Searcharxiv⌕ Search

arXiv subjects

Cristian Lenart

Publications and source records attributed to Cristian Lenart.

At least 55 records · Page 3Linked to original sources
arXiv2011

From Macdonald Polynomials to a Charge Statistic beyond Type A

The charge is an intricate statistic on words, due to Lascoux and Schutzenberger, which gives positive combinatorial formulas for Lusztig's q-analogue of weight multiplicities and the energy function on affine crystals, both of type A. As these concepts are defined for all Lie types, it has been a long-standing problem to express them based on a generalization of charge. I present a method for addressing this problem in classical Lie types, based on the recent Ram-Yip formula for Macdonald polynomials and the quantum Bruhat order on the corresponding Weyl group. The details of the method are carried out in type A (where we recover the classical charge) and type C (where we define a new statistic).

math.CO↗
arXiv2010

Hall-Littlewood Polynomials, Alcove Walks, and Fillings of Young Diagrams

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-polynomials of arbitrary type. The latter formula is in terms of so-called alcove walks, which originate in the work of Gaussent-Littelmann and of the author with Postnikov on discrete counterparts to the Littelmann path model. In this paper, we relate the above developments, by deriving a Haglund-Haiman-Loehr type formula for the Hall-Littlewood P-polynomials of type A from Ram's version of Schwer's formula via a "compression" procedure.

math.CO↗
arXiv2009

Haglund-Haiman-Loehr Type Formulas for Hall-Littlewood Polynomials of Type B and C

In previous work we showed that two apparently unrelated formulas for the Hall-Littlewood polynomials of type A are, in fact, closely related. The first is the tableau formula obtained by specializing q=0 in the Haglund-Haiman-Loehr formula for Macdonald polynomials. The second is the type $A$ instance of Schwer's formula (rephrased and rederived by Ram) for Hall-Littlewood polynomials of arbitrary finite type; Schwer's formula is in terms of so-called alcove walks, which originate in the work of Gaussent-Littelmann and of the author with Postnikov on discrete counterparts to the Littelmann path model. We showed that the tableau formula follows by "compressing" Ram's version of Schwer's formula. In this paper, we derive tableau formulas for the Hall-Littlewood polynomials of type B and C by compressing the corresponding instances of Schwer's formula.

math.CO↗
arXiv2009

Growth Diagrams for the Schubert Multiplication

We present a partial generalization to Schubert calculus on flag varieties of the classical Littlewood-Richardson rule, in its version based on Schuetzenberger's jeu de taquin. More precisely, we describe certain structure constants expressing the product of a Schubert and a Schur polynomial. We use a generalization of Fomin's growth diagrams (for chains in Young's lattice of partitions) to chains of permutations in the so-called k-Bruhat order. Our work is based on the recent thesis of Beligan, in which he generalizes the classical plactic structure on words to chains in certain intervals in k-Bruhat order. Potential applications of our work include the generalization of the S_3-symmetric Littlewood-Richardson rule due to Thomas and Yong, which is based on Fomin's growth diagrams.

math.CO↗
arXiv2008

Combinatorial Formulas for Macdonald and Hall-Littlewood Polynomials of Types A and C. Extended Abstract

A 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 fillings of Young diagrams. Recently, Ram and Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of the corresponding affine Weyl group. In this paper, we show that a Haglund-Haiman-Loehr type formula follows naturally from the more general Ram-Yip formula, via compression. Then we extend this approach to the Hall-Littlewood polynomials of type C, which are specializations of the corresponding Macdonald polynomials at q=0. We note that no analog of the Haglund-Haiman-Loehr formula exists beyond type A, so our work is a first step towards finding such a formula.

math.CO↗
arXiv2008

On q-analogs of weight multiplicities for the Lie superalgebras gl(n,m) and spo(2n,M)

The paper is devoted to the generalization of Lusztig's q-analog of weight multiplicities to the Lie superalgebras gl(n,m) and spo(2n,M). We define such q-analogs K_{lambda,mu}(q) for the typical modules and for the irreducible covariant tensor gl(n,m)-modules of highest weight lambda. For gl(n,m), the defined polynomials have nonnegative integer coefficients if the weight mu is dominant. For spo(2n,M), we show that the positivity property holds when mu is dominant and sufficiently far from a specific wall of the fundamental chamber. We also establish that the q-analog associated to an irreducible covariant tensor gl(n,m)-module of highest weight lambda and a dominant weight mu is the generating series of a simple statistic on the set of semistandard hook-tableaux of shape lambda and weight mu. This statistic can be regarded as a super analog of the charge statistic defined by Lascoux and Schutzenberger.

math.RT↗
arXiv2008

Combinatorial Constructions of Weight Bases: The Gelfand-Tsetlin Basis

This work is part of a project on weight bases for the irreducible representations of semisimple Lie algebras with respect to which the representation matrices of the Chevalley generators are given by explicit formulas. In the case of sl_n, the celebrated Gelfand-Tsetlin basis is the only such basis known. Using the setup of supporting graphs developed by Donnelly, we present a simple combinatorial proof of the Gelfand-Tsetlin formulas based on a rational function identity. Some properties of the Gelfand-Tsetlin basis are derived via an algorithm for solving certain equations on the lattice of semistandard Young tableaux.

math.CO↗
arXiv2008

On Combinatorial Formulas for Macdonald Polynomials

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. Ram and Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of so-called alcove walks; these originate in the work of Gaussent-Littelmann and of the author with Postnikov on discrete counterparts to the Littelmann path model. In this paper, we relate the above developments, by explaining how the Ram-Yip formula compresses to a new formula, which is similar to the Haglund-Haiman-Loehr one but contains considerably fewer terms.

math.CO↗
arXiv2006

A Combinatorial Model for Crystals of Kac-Moody Algebras

We present a simple combinatorial model for the characters of the irreducible integrable highest weight modules for complex symmetrizable Kac-Moody algebras. This model can be viewed as a discrete counterpart to the Littelmann path model. We describe crystal graphs and give a Littlewood-Richardson rule for decomposing tensor products of irreducible representations. The new model is based on the notion of a lambda-chain, which is a chain of positive roots defined by certain interlacing conditions.

math.RT↗
arXiv2006

On the Combinatorics of Crystal Graphs, I. Lusztig's Involution

In this paper, we continue the development of a new combinatorial model for the irreducible characters of a complex semisimple Lie group. This model, which will be referred to as the alcove path model, can be viewed as a discrete counterpart to the Littelmann path model. It leads to an extensive generalization of the combinatorics of irreducible characters from Lie type A (where the combinatorics is based on Young tableaux, for instance) to arbitrary type. The main results of this paper are: (1) a combinatorial description of the crystal graphs corresponding to the irreducible representations (this result includes a transparent proof, based on the Yang-Baxter equation, of the fact that the mentioned description does not depend on the choice involved in our model); (2) a combinatorial realization of Lusztig's involution on the canonical basis (this involution exhibits the crystals as self-dual posets, corresponds to the action of the longest Weyl group element on an irreducible representation, and generalizes Schutzenberger's involution on tableaux); (3) an analog for arbitrary root systems, based on the Yang-Baxter equation, of Schutzenberger's sliding algorithm, which is also known as jeu de taquin (this algorithm has many applications to the representation theory of the Lie algebra of type A).

math.RT↗
arXiv2006

Alcove path and Nichols-Woronowicz model of the equivariant $K$-theory of generalized flag varieties

Fomin and Kirillov initiated a line of research into the realization of the cohomology and $K$-theory of generalized flag varieties $G/B$ as commutative subalgebras of certain noncommutative algebras. This approach has several advantages, which we discuss. This paper contains the most comprehensive result in a series of papers related to the mentioned line of research. More precisely, we give a model for the $T$-equivariant $K$-theory of a generalized flag variety $K_T(G/B)$ in terms of a certain braided Hopf algebra called the Nichols-Woronowicz algebra. Our model is based on the Chevalley-type multiplication formula for $K_T(G/B)$ due to the first author and Postnikov; this formula is stated using certain operators defined in terms of so-called alcove paths (and the corresponding affine Weyl group). Our model is derived using a type-independent and concise approach.

math.QA↗
arXiv2005

Grothendieck polynomials via permutation patterns and chains in the Bruhat order

We give new formulas for Grothendieck polynomials of two types. One type expresses any specialization of a Grothendieck polynomial in at least two sets of variables as a linear combination of products Grothendieck polynomials in each set of variables, with coefficients Schubert structure constants for Grothendieck polynomials. The other type is in terms of chains in the Bruhat order. We compare this second type to other constructions of Grothendieck polynomials within the more general context of double Grothendieck polynomials and the closely related H-polynomials. Our methods are based upon the geometry of permutation patterns.

math.CO↗
arXiv2005

Affine Weyl groups in K-theory and representation theory

We give an explicit combinatorial Chevalley-type formula for the equivariant K-theory of generalized flag varieties G/P which is a direct generalization of the classical Chevalley formula. Our formula implies a simple combinatorial model for the characters of the irreducible representations of G and, more generally, for the Demazure characters. This model can be viewed as a discrete counterpart of the Littelmann path model, and has several advantages. Our construction is given in terms of a certain R-matrix, that is, a collection of operators satisfying the Yang-Baxter equation. It reduces to combinatorics of decompositions in the affine Weyl group and enumeration of saturated chains in the Bruhat order on the (nonaffine) Weyl group. Our model easily implies several symmetries of the coefficients in the Chevalley-type formula. We also derive a simple formula for multiplying an arbitrary Schubert class by a divisor class, as well as a dual Chevalley-type formula. The paper contains other applications and examples.

math.RT↗
arXiv2005

A Pieri-type formula for the K-theory of a flag manifold

We derive explicit Pieri-type multiplication formulas in the Grothendieck ring of a flag variety. These expand the product of an arbitrary Schubert class and a special Schubert class in the basis of Schubert classes. These special Schubert classes are indexed by a cycle which has either the form (k-p+1,k-p+2,...,k+1) or the form (k+p,k+p-1,...,k), and are pulled back from a Grassmannian projection. Our formulas are in terms of certain labeled chains in the k-Bruhat order on the symmetric group and are combinatorial in that they involve no cancellations. We also show that the multiplicities in the Pieri formula are naturally certain binomial coefficients.

math.CO↗
arXiv2004

The K-theory of the Flag Variety and the Fomin-Kirillov Quadratic Algebra

We propose a new approach to the multiplication of Schubert classes in the K-theory of the flag variety. This extends the work of Fomin and Kirillov in the cohomology case, and is based on the quadratic algebra defined by them. More precisely, we define K-theoretic versions of the Dunkl elements considered by Fomin and Kirillov, show that they commute, and use them to describe the structure constants of the K-theory of the flag variety with respect to its basis of Schubert classes.

math.CO↗
arXiv2004

A Unified Approach to Combinatorial Formulas for Schubert Polynomials

Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials; we also present simplifications in some of the existing approaches to this area. We designate certain line diagrams known as rc-graphs as the main structure. The other structures in the literature we study include: semistandard Young tableaux, Kohnert diagrams, and balanced labelings of the diagram of a permutation. The main tools in our investigation are certain operations on rc-graphs, which correspond to the coplactic operations on tableaux, and thus define a crystal graph structure on rc-graphs; a new definition of these operations is presented. One application of these operations is a straightforward, purely combinatorial proof of a recent formula (due to Buch, Kresch, Tamvakis, and Yong), which expresses Schubert polynomials in terms of products of Schur polynomials. In spite of the fact that it refers to many objects and results related to them, the paper is mostly self-contained.

math.CO↗
arXiv2002

Skew Schubert polynomials

We define skew Schubert polynomials to be normal form (polynomial) representatives of certain classes in the cohomology of a flag manifold. We show that this definition extends a recent construction of Schubert polynomials due to Bergeron and Sottile in terms of certain increasing labeled chains in Bruhat order of the symmetric group. These skew Schubert polynomials expand in the basis of Schubert polynomials with nonnegative integer coefficients that are precisely the structure constants of the cohomology of the complex flag variety with respect to its basis of Schubert classes. We rederive the construction of Bergeron and Sottile in a purely combinatorial way, relating it to the construction of Schubert polynomials in terms of rc-graphs.

math.CO↗