2000 character limit reached
On floors and ceilings of the k-Catalan arrangement
Published 22 Nov 2013 in math.CO | (1311.5718v3)
Abstract: The set of dominant regions of the $k$-Catalan arrangement of a crystallographic root system $\Phi$ is a well-studied object enumerated by the Fu{\ss}-Catalan number $Cat{(k)}(\Phi)$. It is natural to refine this enumeration by considering floors and ceilings of dominant regions. A conjecture of Armstrong states that counting dominant regions by their number of floors of a certain height gives the same distribution as counting dominant regions by their number of ceilings of the same height. We prove this conjecture using a bijection that provides even more refined enumerative information.
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.