CLCristian Lenart

Cristian Lenart

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Cristian Lenart has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    The many faces of modern combinatorics

    by Cristian Lenart

    This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including algebraic geometry), topology, probability theory, and theoretical computer science.

  • Open Access

    Crystal energy functions via the charge in types A and C

    by Cristian Lenart, Anne Schilling

    The Ram-Yip formula for Macdonald polynomials (at t=0) provides a statistic which we call charge. In types A and C it can be defined on tensor products of Kashiwara-Nakashima single column crystals. In this paper we prove that the charge is equal to the (negative of the) energy function on affine crystals. The algorithm for computing charge is much simpler and can be more efficiently computed than the recursive definition of energy in terms of the combinatorial R-matrix.

  • Open Access

    From Macdonald Polynomials to a Charge Statistic beyond Type A

    by Cristian Lenart

    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).

  • Open Access

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

    by Cristian Lenart

    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.

  • Open Access

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

    by Cristian Lenart

    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.

  • Open Access

    Growth Diagrams for the Schubert Multiplication

    by Cristian Lenart

    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.

  • Open Access

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

    by Cedric Lecouvey, Cristian Lenart

    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.

  • Open Access

    Combinatorial Constructions of Weight Bases: The Gelfand-Tsetlin Basis

    by Patricia Hersh, Cristian Lenart

    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.

  • Open Access

    On Combinatorial Formulas for Macdonald Polynomials

    by Cristian Lenart

    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.