2000 character limit reached
Bubble Lattices II: Combinatorics
Published 29 Aug 2022 in math.CO | (2208.13683v1)
Abstract: We introduce two simplicial complexes, the noncrossing matching complex and the noncrossing bipartite complex. Both complexes are intimately related to the bubble lattice introduced in our earlier article "Bubble Lattices I: Structure" (arXiv:2202.02874). We study these complexes from both an enumerative and a geometric point of view. In particular, we prove that these complexes are shellable and give explicit formulas for certain refined face numbers. Lastly, we conjecture an intriguing connection of these refined face numbers to the so-called M-triangle of the shuffle lattice.
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.