Binomiality of undirected colored Gaussian graphical models
Abstract
Following earlier work by Coons-Maraj-Misra-Sorea and Misra-Sullivant, we study colored, undirected Gaussian graphical models, and present a necessary and sufficient condition for such a model to have binomial vanishing ideal. These conditions involve Jordan schemes, a variant of association schemes, well-known structures in algebraic combinatorics. Using association schemes without transitive group action, we refute the conjecture by Coons-Maraj-Misra-Sorea that binomiality implies that the color classes must be orbits under the automorphism group of the colored graph.
Fields of Study & Subjects
Advanced Combinatorial Mathematics
Polynomial and algebraic computation
Commutative Algebra and Its Applications
Publication details
- Journal / source
- Algebraic Statistics
- Volume
- 17
- Issue
- 1
- Pages
- 125–150
- Publication date
- 21 June 2026
- Language
- EN