2000 character limit reached
On chain polynomials of geometric lattices
Published 19 Aug 2025 in math.CO | (2508.13810v1)
Abstract: Athanasiadis and Kalampogia-Evangelinou recently conjectured that the chain polynomial of any geometric lattice has only real zeros. We verify this conjecture for families of geometric lattices including perfect matroid designs, Dowling lattices, and for a class of geometric lattices that contains all lattices of flats of paving matroids. We also investigate how the conjecture behaves with respect to certain operations such as direct products, ordinal sums and single-element extensions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.