2000 character limit reached
On the generating function for intervals in Young's lattice
Published 19 Jul 2021 in math.CO | (2107.09149v1)
Abstract: In this paper, we study a family of generating functions whose coefficients are polynomials that enumerate partitions in lower order ideals of Young's lattice. Our main result is that this family satisfies a rational recursion and are therefore rational functions. As an application, we calculate the asymptotic behavior of the cardinality of lower order ideals for the ``average" partition of fixed length and give a homological interpretation of this result in relation to Grassmannians and their Schubert varieties.
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.