Related papers: Skew hook Schur functions and the cyclic sieving p…
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 study the open version of the su$(m|n)$ supersymmetric Haldane-Shastry spin chain associated to the $BC_N$ extended root system. We first evaluate the model's partition function by modding out the dynamical degrees of freedom of the…
In this paper, we study shifted Schur functions $S_\mu^\star$, as well as a new family of shifted symmetric functions $\mathfrak{K}_\mu$ linked to Kostka numbers. We prove that both are polynomials in multi-rectangular coordinates, with…
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.…
We generalize several classical results about Schur functions to the family of cylindric Schur functions. First, we give a combinatorial proof of a Murnaghan--Nakayama formula for expanding cylindric Schur functions in the power-sum basis.…
We prove that the combinatorial side of the "Rational Shuffle Conjecture" provides a Schur-positive symmetric polynomial. Furthermore, we prove that the contribution of a given rational Dyck path can be computed as a certain skew LLT…
For any Schur function $s_{\nu}$, the associated {\em delta operator} $\Delta'_{s_{\nu}}$ is a linear operator on the ring of symmetric functions which has the modified Macdonald polynomials as an eigenbasis. When $\nu = (1^{n-1})$ is a…
Given an identity relating families of Schur and power sum symmetric functions, this may be thought of as encoding representation-theoretic properties according to how the $p$-to-$s$ transition matrices provide the irreducible character…
It is an important problem in algebraic combinatorics to deduce the Schur function expansion of a symmetric function whose expansion in terms of the fundamental quasisymmetric function is known. For example, formulas are known for the…
The determinantal identities of Hamel and Goulden have recently been shown to apply to a tableau-based ninth variation of skew Schur functions. Here we extend this approach and its results to the analogous tableau-based ninth variation of…
We give a $q$-enumeration of circular Dyck paths, which is a superset of the classical Dyck paths enumerated by the Catalan numbers. These objects have recently been studied by Alexandersson and Panova. Furthermore, we show that this…
Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…
We study a multi-symmetric generalization of the classical Schur functions called the multi-symmetric Schur functions. These functions form an integral basis for the ring of multi-symmetric functions indexed by tuples of partitions and are…
By considering the specialisation $s_{\lambda}(1,q,q^2,...,q^{n-1})$ of the Schur function, Stanley was able to describe a formula for the number of semistandard Young tableaux of shape $\lambda$ in terms of two properties of the boxes in…
We present a single operation for constructing skew diagrams whose corresponding skew Schur functions are equal. This combinatorial operation naturally generalises and unifies all results of this type to date. Moreover, our operation…
It is well known that if one integrates a Schur function indexed by a partition $\lambda$ over the symplectic (resp. orthogonal) group, the integral vanishes unless all parts of $\lambda$ have even multiplicity (resp. all parts of $\lambda$…
Cyclic sieving is a well-known phenomenon where certain interesting polynomials, especially $q$-analogues, have useful interpretations related to actions and representations of the cyclic group. We propose a definition of sieving for an…
The cyclic sieving phenomenon of Reiner, Stanton, and White says that we can often count the fixed points of elements of a cyclic group acting on a combinatorial set by plugging roots of unity into a polynomial related to this set. One of…
We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape…
Skew orthogonal polynomials arise in the calculation of the $n$-point distribution function for the eigenvalues of ensembles of random matrices with orthogonal or symplectic symmetry. In particular, the distribution functions are completely…