English
Related papers

Related papers: Slide multiplicity free key polynomials

200 papers

The key polynomials, defined by A. Lascoux-M.-P. Sch\"utzenberger, are characters for the Demazure modules of type A. We classify multiplicity-free key polynomials. The proof uses two combinatorial models for key polynomials. The first is…

Combinatorics · Mathematics 2023-07-10 Reuven Hodges , Alexander Yong

We give an elementary approach utilizing only the divided difference formalism for obtaining expansions of Schubert polynomials that are manifestly nonnegative, by studying solutions to the equation $\sum Y_i\partial_i=\mathrm{id}$ on…

Combinatorics · Mathematics 2025-07-09 Philippe Nadeau , Hunter Spink , Vasu Tewari

Subword complexes were defined by A.Knutson and E.Miller in 2004 for describing Gr\"obner degenerations of matrix Schubert varieties. The facets of such a complex are indexed by pipe dreams, or, equivalently, by the monomials in the…

Combinatorics · Mathematics 2022-08-24 Evgeny Smirnov , Anna Tutubalina

We provide a non-recursive, combinatorial classification of multiplicity-free skew Schur polynomials. These polynomials are $GL_n$, and $SL_n$, characters of the skew Schur modules. Our result extends work of H. Thomas--A. Yong, and C.…

Combinatorics · Mathematics 2020-10-29 Shiliang Gao , Reuven Hodges , Gidon Orelowitz

Enriched versions of type A Schubert polynomials are constructed with coefficients in a polynomial ring in variables $c_1, c_2, \ldots$. Specializing these variables to $0$ recovers the double Schubert polynomials of Lascoux and…

Combinatorics · Mathematics 2021-02-12 David Anderson , William Fulton

Schubert polynomials are a basis for the polynomial ring that represent Schubert classes for the flag manifold. In this paper, we introduce and develop several new combinatorial models for Schubert polynomials that relate them to other…

Combinatorics · Mathematics 2020-03-05 Sami Assaf

The expansion of a Schubert polynomial into slide polynomials corresponds to a sum over sub-balls in the subword complex. There has been recent interest in other, coarser, expansions of Schubert polynomials. We extend the methods used in…

Combinatorics · Mathematics 2024-08-20 Thomas Bååth

We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…

Algebraic Geometry · Mathematics 2024-11-27 Daoji Huang , Matt Larson

We associate a polynomial to any diagram of unit cells in the first quadrant of the plane using Kohnert's algorithm for moving cells down. In this way, for every weak composition one can choose a cell diagram with corresponding row-counts,…

Combinatorics · Mathematics 2018-08-16 Sami Assaf , Dominic Searles

We study a basis of the polynomial ring that we call forest polynomials. This family of polynomials is indexed by a combinatorial structure called indexed forests and permits several definitions, one of which involves flagged P-partitions.…

Combinatorics · Mathematics 2023-06-21 Philippe Nadeau , Vasu Tewari

The "back-stabilization number" for products of Schubert polynomials is the distance the corresponding permutations must be shifted before the structure constants stabilize. We give an explicit formula for this number and thereby prove a…

Combinatorics · Mathematics 2025-01-27 Andrew Hardt , David Wallach

After deriving inequalities on coefficients arising in the expansion of a Schur $P$-function in terms of Schur functions we give criteria for when such expansions are multiplicity free. From here we study the multiplicity of an irreducible…

Combinatorics · Mathematics 2007-06-25 Kristin M. Shaw , Stephanie van Willigenburg

We give a nonrecursive, combinatorial characterization of multiplicity-free products of Grassmannian Schubert classes. This answers a question of W. Fulton and extends results of J. Stembridge.

Combinatorics · Mathematics 2011-10-19 Hugh Thomas , Alexander Yong

We study the specialization of the type A nonsymmetric Macdonald polynomials at $t=0$ based on the combinatorial formula of Haglund, Haiman, and Loehr. We prove that this specialization expands nonnegatively into the fundamental slide…

Combinatorics · Mathematics 2020-03-05 Sami Assaf

In order to have a multiresolution analysis, the scaling function must be refinable. That is, it must be the linear combination of 2-dilation, $\mathbb{Z}$-translates of itself. Refinable functions used in connection with wavelets are…

Information Theory · Computer Science 2011-11-02 Emily J. King

We classify and construct all multiplicity-free plethystic products of Schur functions. We also compute many new (infinite) families of plethysm coefficients, with particular emphasis on those near maximal in the dominance ordering and…

Representation Theory · Mathematics 2022-01-07 Christine Bessenrodt , Chris Bowman , Rowena Paget

In this paper we classify the multiplicity-free skew characters of the symmetric group. Furthermore we show that the Schubert calculus is equivalent to that of skew characters in the following sense: If we decompose the product of two…

Combinatorics · Mathematics 2010-11-09 Christian Gutschwager

Schubert polynomials were discovered by A. Lascoux and M. Sch\"utzenberger in the study of cohomology rings of flag manifolds in 1980's. These polynomials generalize Schur polynomials, and form a linear basis of multivariate polynomials. In…

Computational Complexity · Computer Science 2018-05-16 Priyanka Mukhopadhyay , Youming Qiao

We consider multivariate polynomials and investigate how many zeros of multiplicity at least $r$ they can have over a Cartesian product of finite subsets of a field. Here r is any prescribed positive integer and the definition of…

Commutative Algebra · Mathematics 2015-12-23 Olav Geil , Casper Thomsen

We survey the recent study of involution Schubert polynomials and a modest generalization that we call degenerate involution Schubert polynomials. We cite several conditions when (degenerate) involution Schubert polynomials have simple…

Combinatorics · Mathematics 2020-02-04 Michael Joyce
‹ Prev 1 2 3 10 Next ›