English
Related papers

Related papers: Weak dual equivalence for polynomials

200 papers

Using Schur positivity and the principal specialization of Schur functions, we provide a proof of a recent conjecture of Liu and Wang on the $q$-log-convexity of the Narayana polynomials, and a proof of the second conjecture that the…

Combinatorics · Mathematics 2008-06-11 William Y. C. Chen , Larry X. W. Wang , Arthur L. B. Yang

We use Young's raising operators to give short and uniform proofs of several well known results about Schur polynomials and symmetric functions, starting from the Jacobi-Trudi identity.

Combinatorics · Mathematics 2013-09-10 Harry Tamvakis

This paper uses the theory of dual equivalence graphs to give explicit Schur expansions for several families of symmetric functions. We begin by giving a combinatorial definition of the modified Macdonald polynomials and modified…

Combinatorics · Mathematics 2015-08-31 Austin Roberts

Cylindric skew Schur functions, which are a generalisation of skew Schur functions, arise naturally in the study of P-partitions. Also, recent work of A. Postnikov shows they have a strong connection with a problem of considerable current…

Combinatorics · Mathematics 2007-05-23 Peter McNamara

We consider a filtration of the symmetric function space given by $\Lambda^{(k)}_t$, the linear span of Hall-Littlewood polynomials indexed by partitions whose first part is not larger than $k$. We introduce symmetric functions called the…

Combinatorics · Mathematics 2007-05-23 L. Lapointe , J. Morse

We prove that the set of matchings with a fixed number of unmatched vertices is Schur-positive with respect to the set of short chords. Two proofs are presented. The first proof applies a new combinatorial criterion for Schur-positivity,…

Combinatorics · Mathematics 2026-05-21 Avichai Marmor

In 2007 Sami Assaf introduced dual equivalence graphs as a method for demonstrating that a quasisymmetric function is Schur positive. The method involves the creation of a graph whose vertices are weighted by Ira Gessel's fundamental…

Combinatorics · Mathematics 2015-03-13 Austin Roberts

We describe a combinatorial formula for the coefficients when the dual immaculate quasisymmetric functions are decomposed into Young quasisymmetric Schur functions. We prove this using an analogue of Schensted insertion. Using this result,…

Combinatorics · Mathematics 2016-06-14 Edward E. Allen , Joshua Hallam , Sarah K. Mason

We show the equivalence of the Pieri formula for flag manifolds and certain identities among the structure constants, giving new proofs of both the Pieri formula and of these identities. A key step is the association of a symmetric function…

alg-geom · Mathematics 2016-11-08 Nantel Bergeron , Frank Sottile

We study the action of a differential operator on Schubert polynomials. Using this action, we first give a short new proof of an identity of I. Macdonald (1991). We then prove a determinant conjecture of R. Stanley (2017). This conjecture…

Combinatorics · Mathematics 2022-03-25 Zachary Hamaker , Oliver Pechenik , David E Speyer , Anna Weigandt

We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…

Algebraic Geometry · Mathematics 2009-06-03 A. I. Molev

Cylindric skew Schur functions, a generalization of skew Schur functions, are closely related to the famous problem finding a combinatorial formula for the 3-point Gromov-Witten invariants of Grassmannian. In this paper, we prove cylindric…

Combinatorics · Mathematics 2017-06-15 Seung Jin Lee

We obtain the Schur positivity of spider graphs of the forms $S(a,2,1)$ and $S(a,4,1)$, which are considered to have the simpliest structures for which the Schur positivity was unknown. The proof outline has four steps. First, we find…

Combinatorics · Mathematics 2023-05-16 Jean-Yves Thibon , David G. L. Wang

We introduce a new combinatorial object, semistandard increasing decomposition tableau and study its relation to a semistandard decomposition tableau introduced by Kra\'skiewicz and developed by Lam and Serrano. We also introduce…

Mathematical Physics · Physics 2017-05-19 Keiichi Shigechi

A Littlewood polynomial is a single-variable polynomial all of whose coefficients lie in $\{ \pm 1\}$. We establish the leading term asymptotics of the number of reciprocal or skew-reciprocal Littlewood polynomials with square discriminant.…

Number Theory · Mathematics 2025-06-11 David Hokken

In work with A. Yong, the author introduced genomic tableaux to prove the first positive combinatorial rule for the Littlewood-Richardson coefficients in torus-equivariant $K$-theory of Grassmannians. We then studied the genomic Schur…

Combinatorics · Mathematics 2022-03-25 Oliver Pechenik

This paper deals with decreasing operators on back stable Schubert polynomials. We study two operators $\xi$ and $\nabla$ of degree $-1$, which satisfy the Leibniz rule. Furthermore, we show that all other such operators are linear…

Combinatorics · Mathematics 2020-06-23 Gleb Nenashev

Let $\Lambda$ be the space of symmetric functions and $V_k$ be the subspace spanned by the modified Schur functions $\{S_\lambda[X/(1-t)]\}_{\lambda_1\leq k}$. We introduce a new family of symmetric polynomials,…

Quantum Algebra · Mathematics 2007-05-23 L. Lapointe , A. Lascoux , J. Morse

The symmetric Grothendieck polynomials generalize Schur polynomials and are Schur-positive by degree. Combinatorially this is manifested as the generalization of semistandard Young tableaux by set-valued tableaux. We define a (weak)…

Combinatorics · Mathematics 2024-12-31 Graham Hawkes

We extend Krivine's strict positivstellensatz for usual (real multivariate) polynomials to symmetric matrix polynomials with scalar constraints. The proof is an elementary computation with Schur complements. Analogous extensions of Schm\"…

Algebraic Geometry · Mathematics 2013-01-07 Jaka Cimpric