82 problems
Matúš's conjecture. There exists a distribution in the zero set of such that all joint probabilities of are rational.
Let be a closed irreducible subvariety of the hyperplane , and let . The Huh–Sturmfels conjecture. One h…
Generating conjecture. The ideal of homogeneous invariants for the 2-state GM+I model on is generated by those minors of edge flattenings that do not involve the va…
Let be a binary tree on binary random variables, let be the associated multilinear map, and let be its prime ideal. For a table, flatten…
Let be a binary tree on binary random variables, and let be the ideal of phylogenetic invariants of its general Markov model. Each edge of induces a split of th…
Three-factor radical-generation conjecture. The radical of is the prime ideal :
Two-factor minimal-generation conjecture. The ideal is minimally generated by
Linear-eliminant membership conjecture. If , , and , then
Garcia–Stillman–Sturmfels conjecture. The ideal is generated by the minors of all two-dimensional flattenings arising from bipartitions of…
Bounded Markov complexity conjecture. If is an independent subset of the underlying graph of , then the preceding bounded-format conclusion holds. This w…
Let and be coefficient points for the varieties and , respectively, and let denote the principal -determinant, whose factors are the discrimin…
Extremal ML threshold relation. For any undirected graph ,
Extremal ML degree bound. For any graph ,
For each , let denote the relevant -state model space, and let be the number of fundamental models in of degree . For , Proposition…
Let ) and be two colored paths on vertices with concentration matrices and satisfying … A reflection of a colored path is the path obtained by reversing its…
Let . Let be an -compartment mammillary model with , , and…
Galois-width conjecture.
A BMT-derived graph is a graph obtained from the tree model by merging color classes of edges. Two internal nodes are non-adjacent when they are not joined by an edge in the underl…
Let be the cycle graph on vertices, and let denote the number of critical points of the Gaussian log-likelihood function for generic sample covariance data,…
Sullivant's saturation conjecture. The vanishing ideal satisfies
Adjoint non-degeneracy conjecture. For a generic -gon , the adjoint is non-degenerate, with Newton polytope equal to the Newton polytope of
Wachspress ML-degree conjecture. For a generic -gon , the maximum likelihood degree is
Let be the undirected graphical model modelling a generic -player game with binary choices in normal form. Let and let…
Let be the no-three-way interaction model of two binary random variables and a third one with state space . Its polar degrees form a sequence. Palindromicity con…
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 subse…