Related papers: The first term of plethysms
We develop a theory of two-parameter quantum polynomial functors. Similar to how (strict) polynomial functors give a new interpretation of polynomial representations of the general linear groups $\operatorname{GL}_n$, the two-parameter…
We use a plethystic formula of Littlewood to answer a question of Miller on embeddings of symmetric group characters. We also reprove a result of Miller on character congruences.
We present a formulas to add a row or a column to the power, monomial, forgotten, Schur, homogeneous and elementary symmetric functions. As an application of these operators we show that the operator that adds a column to the Schur…
We characterize the approximate monomial complexity, sign monomial complexity , and the approximate L 1 norm of symmetric functions in terms of simple combinatorial measures of the functions. Our characterization of the approximate L 1 norm…
We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…
We prove necessary conditions for certain elementary symmetric functions, $e_\lambda$, to appear with nonzero coefficient in Stanley's chromatic symmetric function as well as in the generalization considered by Shareshian and Wachs. We do…
Motivated by questions of Mulmuley and Stanley we investigate quasi-polynomials arising in formulas for plethysm. We demonstrate, on the examples of $S^3(S^k)$ and $S^k(S^3)$, that these need not be counting functions of inhomogeneous…
We introduce Schur multiple zeta functions which interpolate both the multiple zeta and multiple zeta-star functions of the Euler-Zagier type combinatorially. We first study their basic properties including a region of absolute convergence…
Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…
In this paper, we first prove the coefficient conjecture of Clunie and Sheil-Small for a class of univalent harmonic functions which includes functions convex in some direction. Next, we prove growth and covering theorems and some related…
The theory of symmetric functions has been extended to the case where each variable is paired with an anticommuting one. The resulting expressions, dubbed superpolynomials, provide the natural N=1 supersymmetric version of the classical…
The Schur (resp. Carath\'eodory) class consists of all the analytic functions $f$ on the unit disk with $|f|\le 1$ (resp. $\Re f>0$ and $f(0)=1$). The Schur parameters $\gamma_0,\gamma_1,\dots (|\gamma_j|\le 1)$ are known to parametrize the…
We prove some Schur positivity results for the chromatic symmetric function $X_G$ of a (hyper)graph $G$, using connections to the group algebra of the symmetric group. The first such connection works for (hyper)forests $F$: we describe the…
In our previous paper, Green functions associated to complex reflection groups G(e,1,n) were discussed. It involved a combinatorial approach to the Green functions of classical groups of type B_n or C_n. In this paper, we introduce Green…
We say a sequence $f_0, f_1, f_2, \ldots$ of symmetric functions is Schur log-concave if $f_n^2 - f_{n-1}f_{n+1}$ is Schur positive for all $n\ge1$. We conjecture that a very general class of sequences of Schur functions satisfies this…
We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…
We establish new Murnaghan--Nakayama rules for symplectic, orthogonal and orthosymplectic Schur functions. The classical Murnaghan--Nakayama rule expresses the product of a power sum symmetric function with a Schur function as a linear…
The theory of Schur functors provides a powerful and elegant approach to the representation theory of GL_n - at least to the so-called polynomial representations - especially to questions about how the theory varies with n. We develop…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
To find crystals of $\mathfrak{sl}_2$ representations of the form $\Lambda^n\text{Sym}^r\mathbb{C}^2$ it suffices to solve the combinatorial problem of decomposing Young's lattice into symmetric, saturated chains. We review the literature…