Generation conjecture for sparse two-factor analysis model ideals
Statement
A sparse two-factor analysis model is the model associated with a graph having two latent variables, with denoting the set of model polynomials indexed by subsets of variables of size at most one. Generation conjecture. The ideal of the sparse two-factor analysis model corresponding to graph is generated by off-diagonal -minors, pentads, and the polynomials in .
The conjecture is motivated by Gröbner-basis computations for sparse two-factor models with larger overlaps among the children sets of the latent variables. It proposes that these three families suffice to generate the full ideal, beyond the low-degree generators observed in the computed examples.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.