For a complex simple Lie algebra, the dimension $K_{λμ}$ of the $μ$ weight space of a finite dimensional representation of highest weight $λ$ is the same as the number of Littelmann paths of type $λ$ and weight $μ$. In this paper we give an explicit construction of a path of type $λ$ and weight $μ$ whenever $K_{λμ}\ne 0$. This construction has additional consequences, it produces an explicit point in the building which chamber retracts to $λ$ and sector retracts to $μ$, and an explicit point of the affine Grassmannian in the corresponding Mirković-Vilonen intersection. In an appendix we discuss the connection between retractions in buildings and alcove walks.
Using Ram's theory of alcove walks, we give a proof of the Bernstein presentation of the affine Hecke algebra. The method works also in the case of unequal parameters. We also discuss how these results help in studying sheaves of nearby cycles on affine flag manifolds.
A recent breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of a pair of statistics on fillings of Young diagrams. The inversion statistic, which is the more intricate one, suffices for specializing a closely related formula to one for the type A Hall-Littlewood Q-polynomials (spherical functions on p-adic groups). An apparently unrelated development, at the level of arbitrary finite root systems, led to Schwer's formula (rephrased and rederived by Ram) for the Hall-Littlewood P-…
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.
This paper makes precise the close connection between the affine Hecke algebra, the path model, and the theory of crystals. Section 2 is a basic pictorial exposition of Weyl groups and affine Weyl groups and Section 5 is an exposition of the theory of (a) symmetric functions, (b) crystals and (c) the path model. Sections 3 and 4 give an exposition of the affine Hecke algebra and recent results regarding the combinatorics of spherical functions on p-adic groups (Hall-Littlewood polynomials). The $q$-analogue of the theory of crystals developed in Section 4 specializes to the path model version …
In this paper we use the combinatorics of alcove walks to give a uniform combinatorial formula for Macdonald polynomials for all Lie types. These formulas are generalizations of the formulas of Haglund-Haiman-Loehr for Macdonald polynoimals of type GL(n). At q=0 these formulas specialize to the formula of Schwer for the Macdonald spherical function in terms of positively folded alcove walks and at q=t=0 these formulas specialize to the formula for the Weyl character in terms of the Littelmann path model (in the positively folded gallery form of Gaussent-Littelmann).
The Littelmann path moel gives a realization of the crystals of integrable representations of symmetrizable Kac-Moody Lie algebras. Recent work of Gaussent-Littelmann and others has demonstrated a connection between this model and the geometry of the loop Grassmannian. The alcove walk model is a version of the path model which is intimately connected to the combinatorics of the affine Hecke algebra. In this paper we define a refined alcove walk model which encodes the points of the affine flag variety. We show that this combinatorial indexing naturally indexes the "cells" in generalized Mirkov…
Sahi, Stokman, and Venkateswaran have constructed, for each positive integer $n$, a family of Laurent polynomials depending on parameters $q$ and $k$ (in addition to $\lfloor n/2\rfloor$ "metaplectic parameters"), such that the $n=1$ case recovers the nonsymmetric Macdonald polynomials and the $q\rightarrow\infty$ limit yields metaplectic Iwahori-Whittaker functions with arbitrary Gauss sum parameters. In this paper, we study these new polynomials, which we call SSV polynomials, in the case of $GL_r$. We apply a result of Ram and Yip in order to give a combinatorial formula for the SSV polynom…
The paper compares (and reproves) the alcove walk and the nonattacking fillings formulas for type $GL_n$ Macdonald polynomials which were given in Haglund-Haiman-Loehr arXiv:math.CO/0601693, Alexandersson arXiv:1602.05153 and Ram-Yip arXiv:0803.1146. The "compression" relating the two formulas in this paper is the same as that of Lenart arXiv:0804.4716. We have reformulated it so that it holds without conditions and so that the proofs of the alcove walk formula and the nonattacking fillings formula are parallel. This reformulation highlights the role of the double affine Hecke algebra and Cher…
Let G be a reductive group over the field F=k((t)), where k is an algebraic closure of a finite field, and let W be the (extended) affine Weyl group of G. The associated affine Deligne-Lusztig varieties $X_x(b)$, which are indexed by elements b in G(F) and x in W, were introduced by Rapoport. Basic questions about the varieties $X_x(b)$ which have remained largely open include when they are nonempty, and if nonempty, their dimension. We use techniques inspired by geometric group theory and representation theory to address these questions in the case that b is a pure translation, and so prove m…
Macdonald polynomials are orthogonal polynomials associated to root systems, and in the type A case, the symmetric kind is a common generalization of Schur functions, Macdonald spherical functions, and Jack polynomials. We use the combinatorics of alcove walks to calculate products of monomials and intertwining operators of the double affine Hecke algebra. From this, we obtain a product formula for Macdonald polynomials of general type.
In this paper we study the possibility to define irreducible representations of the symmetric groups with the help of finitely many relations. The existence of finite bases is established for the classes of representations corresponding to two-part partitions and to partitions from the fundamental alcove.
We establish the equality of the specialization $P_λ(x;q,0)$ of the Macdonald polynomial at $t=0$ with the graded character $X_λ(x;q)$ of a tensor product of "single-column" Kirillov-Reshetikhin (KR) modules for untwisted affine Lie algebras. This is achieved by constructing two uniform combinatorial models for the crystals associated with the mentioned tensor products: the quantum alcove model (which is naturally associated to Macdonald polynomials), and the quantum Lakshmibai-Seshadri path model. We provide an explicit affine crystal isomorphism between the two models, and realize the energy…
In this paper we derive a counterpart of the well-known Ram-Yip formula for symmetric and nonsymmetric Macdonald polynomials of arbitrary type. Our new formula is in terms of a generalization of the Lakshmibai-Seshadri paths (originating in standard monomial theory), which we call pseudo-quantum Lakshmibai-Seshadri (LS) paths. This model carries less information than the alcove walks in the Ram-Yip formula, and it is therefore more efficient. Furthermore, we construct a connected pseudo-crystal structure on the pseudo-quantum LS paths, which is expected to lead to a simple Littlewood-Richardso…
In this work we study the relationship between several combinatorial formulas for type $A$ spherical Whittaker functions. These are spherical functions on $p$-adic groups, which arise in the theory of automorphic forms. They depend on a parameter $t$, and are a specialization of Macdonald polynomials, and further specialize to Schur polynomials upon setting $t=0$. There are three types of formulas for these polynomials. The first formula is in terms of so-called alcove walks, works in arbitrary Lie type, and is derived from the Ram-Yip formula for Macdonald polynomials. The second one is in te…
We introduce a path-theoretic framework for understanding the representation theory of (quantum) symmetric and general linear groups and their higher level generalisations over fields of arbitrary characteristic. Our first main result is a "super-strong linkage principle" which provides degree-wise upper bounds for graded decomposition numbers (this is new even in the case of symmetric groups). Next, we generalise the notion of homomorphisms between Weyl/Specht modules which are "generically" placed (within the associated alcove geometries) to cyclotomic Hecke and diagrammatic Cherednik algebr…
We derive an asymptotic expansion for the subgroup of arbitrary Fuchsian groups and some other classes of large groups. Moreover, the main conjecture for Random Walks on symmetric groups is established in full generality. Both problems require subtle estimates of character values and root number multiplicities for symmetric groups, which are also of independent interest.
We present an overview of the representation theoretic techniques used to study the mixing times of random walks on finite groups. We focus on the card shuffle studied by Diaconis and Shahshahani in the 1980s and a recent improvement on their result by Teyssier
We study $β$-Jacobi diffusion processes on alcoves in $\mathbb R^N$, depending on 3 parameters. Using elementary symmetric functions, we present space-time-harmonic functions and martingales for these processes $(X_t)_{t\ge0}$ which are independent from one parameter. This leads to a formula for $\mathbb E(\prod_{i=1}^N (y-X_{t,i}))$ in terms of classical Jacobi polynomials. For $t\to\infty$ this yields a corresponding formula for Jacobi ensembles and thus Aomoto's Selberg integral.
We prove sharp rates of convergence to the Ewens equilibrium distribution for a family of Metropolis algorithms based on the random transposition shuffle on the symmetric group, with starting point at the identity. The proofs rely heavily on the theory of symmetric Jack polynomials, developed initially by Jack [Proc. Roy. Soc. Edinburgh Sect. A 69 (1970/1971) 1-18], Macdonald [Symmetric Functions and Hall Polynomials (1995) New York] and Stanley [Adv. Math. 77 (1989) 76-115]. This completes the analysis started by Diaconis and Hanlon in [Contemp. Math. 138 (1992) 99-117]. In the end we also ex…
