2000 character limit reached
Alcove random walks, k-Schur functions and the minimal boundary of the k-bounded partition poset
Published 25 Jan 2018 in math.CO, math.PR, and math.RT | (1801.08313v2)
Abstract: We use k-Schur functions to get the minimal boundary of the k-bounded partition poset. This permits to describe the central random walks on affine Grassmannian elements of type A and yields a polynomial expression for their drift. We also recover Rietsch's parametriza-tion of totally nonnegative unitriangular Toeplitz matrices without using quantum cohomology of flag varieties. All the homeomorphisms we define can moreover be made explicit by using the combinatorics of k-Schur functions and elementary computations based on Perron-Frobenius theorem.
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.