Kalai's Abstract Polynomial Hirsch Conjecture
Let be the collection of graphs whose vertices are labeled by -subsets of an -element set, with the property that for vertices labeled by and , there is a path between them all of whose vertex labels contain . Kalai's Abstract Polynomial Hirsch Conjecture (APHC). If is connected, then the diameter of is bounded above by a polynomial in and . This conjecture abstracts the Hirsch bound for polytope graphs and motivates an algebraic formulation through linear presentations of square-free monomial ideals; its resolution status is not specified in the source.
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.