English
Related papers

Related papers: An Explicit Construction of Type A Demazure Atoms

200 papers

The $m$-symmetric Macdonald polynomials form a basis of the space of polynomials that are symmetric in the variables $x_{m+1},x_{m+2},\dots$ (while having no special symmetry in the variables $x_1,\dots,x_m$).We establish in this article…

Combinatorics · Mathematics 2023-11-22 Manuel Concha , Luc Lapointe

Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct…

Commutative Algebra · Mathematics 2019-02-20 Thomas Kahle , Ezra Miller , Christopher O'Neill

It has previously been shown that, at least for non-exceptional Kac-Moody Lie algebras, there is a close connection between Demazure crystals and tensor products of Kirillov-Reshetikhin crystals. In particular, certain Demazure crystals are…

Quantum Algebra · Mathematics 2012-04-27 Anne Schilling , Peter Tingley

Recent results of Kahle and Miller give a method of constructing primary decompositions of binomial ideals by first constructing "mesoprimary decompositions" determined by their underlying monoid congruences. These mesoprimary…

Commutative Algebra · Mathematics 2018-08-15 Christopher O'Neill

We give a combinatorial formula for the non-symmetric Macdonald polynomials E_{\mu}(x;q,t). The formula generalizes our previous combinatorial interpretation of the integral form symmetric Macdonald polynomials J_{\mu}(x;q,t). We prove the…

Combinatorics · Mathematics 2007-05-23 J. Haglund , M. Haiman , N. Loehr

Non-attacking skyline fillings were used by Haglund, Haiman and Loehr to establish a combinatorial formula for nonsymmetric Macdonald polynomials. Semistandard skyline fillings are non-attacking skyline fillings with both major index and…

Combinatorics · Mathematics 2020-10-19 Neil J. Y. Fan , Peter L. Guo , Nicolas Y. Liu

The product monomial crystal was defined by Kamnitzer, Tingley, Webster, Weekes, and Yacobi for any semisimple simply-laced Lie algebra $\mathfrak{g}$, and depends on a collection of parameters $\mathbf{R}$. We show that a family of…

Combinatorics · Mathematics 2022-08-03 Joel Gibson

In this paper, we give an explicit combinatorial realization of the crystal B(\lambda) for an irreducible highest weight U_q(q(n))-module V(\lambda) in terms of semistandard decomposition tableaux. We present an insertion scheme for…

Representation Theory · Mathematics 2013-07-16 Dimitar Grantcharov , Ji Hye Jung , Seok-Jin Kang , Masaki Kashiwara , Myungho Kim

For $G$ a reductive group and $T\subset B$ a maximal torus and Borel subgroup, Demazure modules are certain $B$-submodules, indexed by elements of the Weyl group, of the finite irreducible representations of $G$. In order to describe the…

Representation Theory · Mathematics 2023-02-10 Marc Besson , Sam Jeralds , Joshua Kiers

We present a conjecture generalizing the Cauchy formula for Macdonald polynomials. This conjecture encodes the mixed Hodge polynomials of the character varieties of representations of the fundamental group of a Riemann surface of genus g to…

Representation Theory · Mathematics 2019-12-19 T. Hausel , E. Letellier , F. Rodriguez-Villegas

The plethystic transformation $f[X] \mapsto f[X/(1-t)]$ and LLT polynomials are central to the theory of symmetric Macdonald polynomials. In this work, we introduce and study nonsymmetric flagged LLT polynomials. We show that these admit…

Combinatorics · Mathematics 2025-07-29 Jonah Blasiak , Mark Haiman , Jennifer Morse , Anna Pun , George H. Seelinger

In 1996, Knop and Sahi introduced a remarkable family of inhomogeneous symmetric polynomials, defined via vanishing conditions, whose top homogeneous parts are exactly the Macdonald polynomials. Like the Macdonald polynomials, these…

Combinatorics · Mathematics 2025-10-24 Houcine Ben Dali , Lauren Williams

It is well known that the $q$-Whittaker polynomials, which are $t=0$ specializations of the Macdonald polynomials $P_\lambda(X;q,t)$, expand positively as the sum of Schur polynomials. Macdonald polynomials have a quasisymmetric refinement:…

Combinatorics · Mathematics 2026-01-09 Olya Mandelshtam , Harper Niergarth , Kartik Singh

This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…

Group Theory · Mathematics 2026-02-13 Mehmet Yeşil

Lascoux polynomials generalize Grassmannian stable Grothendieck polynomials and may be viewed as K-theoretic analogs of key polynomials. The latter two polynomials have combinatorial formulas involving tableaux: Lascoux and…

Combinatorics · Mathematics 2022-05-17 Tianyi Yu

We characterize subsets of highest weight $\mathfrak{g}$-crystals that arise as unions of Demazure crystals, for any symmetrizable Kac-Moody Lie algebra $\mathfrak{g}$. We provide a local characterization for these subsets and prove they…

Representation Theory · Mathematics 2025-12-24 Sami Assaf , Nicolle González

As part of a program to develop $K$-theoretic analogues of combinatorially important polynomials, Monical, Pechenik, and Searles (2021) proved two expansion formulas $\overline{\mathfrak{A}}_a = \sum_b Q_b^a(\beta)\overline{\mathfrak{P}}_b$…

Combinatorics · Mathematics 2025-08-22 Laura Pierson

The non-negative integer cocharge statistic on words was introduced in the 1970's by Lascoux and Sch\"utzenberger to combinatorially characterize the Hall-Littlewood polynomials. Cocharge has since been used to explain phenomena ranging…

Combinatorics · Mathematics 2017-10-03 Ryan Kaliszewski , Jennifer Morse

The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…

Combinatorics · Mathematics 2016-04-05 Amanda Cameron , Alex Fink

In this paper, the canonical polyadic (CP) decomposition of tensors that corresponds to matrix multiplications is studied. Finding the rank of these tensors and computing the decompositions is a fundamental problem of algebraic complexity…

Computational Complexity · Computer Science 2021-04-13 Petr Tichavsky
‹ Prev 1 3 4 5 6 7 10 Next ›