Related papers: Schur Superpolynomials: Combinatorial Definition a…
By establishing relations between operators on compositions, we show that the posets of compositions arising from the right and left Pieri rules for noncommutative Schur functions can each be endowed with both the structure of dual graded…
We discuss computations of the Thom polynomials of singularity classes of maps in the basis of Schur functions. We survey the known results about the bound on the length and a rectangle containment for partitions appearing in such Schur…
This paper contains the proof of Macdonald's duality and evaluation conjectures, the definition of the difference Fourier transform, the recurrence theorem generalizing Pieri rules, and the action of GL(2,Z) on the Macdonald polynomials at…
Jack superpolynomials are eigenfunctions of the supersymmetric extension of the quantum trigonometric Calogero-Moser-Sutherland. They are orthogonal with respect to the scalar product, dubbed physical, that is naturally induced by this…
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…
We show that the Schur polynomials in all primitive $n$th roots of unity are $1$, $0$, or $-1$, if $n$ has at most two distinct odd prime factors. This result can be regarded as a generalization of properties of the coefficients of the…
We present several new and compact formulas for the modified and integral form of the Macdonald polynomials, building on the compact "multiline queue" formula for Macdonald polynomials due to Corteel, Mandelshtam and Williams. We also…
The poly-Bernoulli numbers and its relative are defined by the generating series using the polylogarithm series, and we call them type $B$ and $C$, respectively. As a generalization of these poly-Bernoulli numbers, we introduce Schur type…
Given two polynomials f(x) and g(x), we extend the formula expressing the remainder in terms of the roots of these two polynomials to the case where f(x) is a Laurent polynomial. This allows us to give new expressions of a Schur function,…
This publication is an exercise which extends to two variables the Christoffel's construction of orthogonal polynomials for potentials of one variable with external sources. We generalize the construction to biorthogonal polynomials. We…
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)…
We express the integral form Macdonald polynomials as a weighted sum of Shareshian and Wachs' chromatic quasisymmetric functions of certain graphs. Then we use known expansions of these chromatic quasisymmetric functions into Schur and…
In this article, we use Lindstr\"om Gessel Viennot Lemma to give a short, combinatorial, visualizable proof of the identity of Schur polynomials -- the sum of monomials of Young tableaux equals to the quotient of determinants. As a…
We prove that twisted versions of Schubert polynomials defined by $\widetilde{\mathfrak S}_{w_0} = x_1^{n-1}x_2^{n-2} \cdots x_{n-1}$ and $\widetilde{\mathfrak S}_{ws_i} = (s_i+\partial_i)\widetilde{\mathfrak S}_w$ are monomial positive and…
Schreier sets have been an object of study since first introduced in 1930 by Jozef Schreier to construct a counterexample to a conjecture of Banach. In 1974 George Andrews found interesting connections between these sets and Fibonacci…
The spectral $p$-norm of $r$-matrices generalizes the spectral $2$-norm of $2$-matrices. In 1911 Schur gave an upper bound on the spectral $2$-norm of $2$-matrices, which was extended in 1934 by Hardy, Littlewood, and Polya to $r$-matrices.…
Just as the definition of factorial Schur functions as a ratio of determinants allows one to show that they satisfy a Jacobi-Trudi-type identity and have an explicit combinatorial realisation in terms of semistandard tableaux, so we offer…
Asvin G and Andrew O'Desky recently introduced the graded algebra P$\Lambda$ of polysymmetric functions as a generalization of the algebra $\Lambda$ of symmetric functions. This article develops combinatorial formulas for some…
We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. This provides a universal method for…
In the present article we introduce two new combinatorial interpretations of the $r$-Whitney numbers of the second kind obtained from the combinatorics of the differential operators associated to the grammar $G:=\{ y\rightarrow yx^{m},…