Kalai's monomial-ideal diameter conjecture
Let be a square-free monomial ideal generated in degree and having a linear presentation. Let be the graph whose vertices are the minimal monomial generators of , labeled by the indices of their factors. Kalai's monomial-ideal diameter conjecture. The diameter of is bounded above by a polynomial in . This is the algebraic restatement of Kalai's Abstract Polynomial Hirsch Conjecture, connecting graph diameter bounds with linear presentations of square-free monomial ideals; the source does not specify whether the conjecture has been resolved.
References
- Giorgi Butbaia, Paul Orland, Coco Huang, Davide Passaro, Lucas Fagan, Michele Tarquini, Hailong Dao, David Eisenbud, Ali Shehper and Sergei Gukov, “Hierarchical Reinforcement Learning for Sparse-Reward Search in Commutative Algebra”, arXiv:2606.22922 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.