English
Related papers

Related papers: Rectangular symmetries for coefficients of symmetr…

200 papers

This work highlights the existence of partial symmetries in large families of iterated plethystic coefficients. The plethystic coefficients involved come from the expansion in the Schur basis of iterated plethysms of Schur functions indexed…

Combinatorics · Mathematics 2023-05-31 Álvaro Gutiérrez , Mercedes H. Rosas

For any homomorphism V on the space of symmetric functions, we introduce an operation which creates a q-analog of V. By giving several examples we demonstrate that this quantization occurs naturally within the theory of symmetric functions.…

Quantum Algebra · Mathematics 2007-05-23 Mike Zabrocki

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…

Combinatorics · Mathematics 2018-10-18 Per Alexandersson , Valentin Féray

In the paper, we give partition-theoretic results for the coefficients of some mock theta functions and prove their congruence properties. Some recurrence relations connecting the coefficients of the mock theta functions with certain…

Number Theory · Mathematics 2024-02-28 Sabi Biswas , Nipen Saikia

We give formulae for computing Kronecker coefficients occurring in the expansion of $s_{\mu}*s_{\nu}$, where both $\mu$ and $\nu$ are nearly rectangular, and have smallest parts equal to either 1 or 2. In particular, we study…

Combinatorics · Mathematics 2014-03-24 Vasu V. Tewari

We introduce a new basis of the non-commutative symmetric functions whose commutative images are Schur functions. Dually, we build a basis of the quasi-symmetric functions which expand positively in the fundamental quasi-symmetric functions…

Combinatorics · Mathematics 2016-11-08 Chris Berg , Nantel Bergeron , Franco Saliola , Luis Serrano , Mike Zabrocki

We study the class $\mathcal C$ of symmetric functions whose coefficients in the Schur basis can be described by generating functions for sets of tableaux with fixed shape. Included in this class are the Hall-Littlewood polynomials,…

Combinatorics · Mathematics 2011-06-09 Jason Bandlow , Jennifer Morse

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…

Combinatorics · Mathematics 2007-05-23 Jason Fulman

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…

Representation Theory · Mathematics 2018-02-12 Thomas Kahle , Mateusz Michalek

In the seminal work of Stanley, several conjectures were made on the structure of Littlewood-Richardson coefficients for the multiplication of Jack symmetric functions. Motivated by recent results of Alexandersson and the present author, we…

Combinatorics · Mathematics 2025-07-22 Ryan Mickler

We report about some results, interesting examples, problems and conjectures revolving around the parabolic Kostant partition functions, the parabolic Kostka polynomials and ``saturation'' properties of several generalizations of the…

Combinatorics · Mathematics 2007-05-23 Anatol N. Kirillov

Interpolation polynomials were introduced by Knop--Sahi in type $A$, and Okounkov in type $BC$. They are inhomogeneous polynomials whose top terms are Jack and Macdonald polynomials. Thus the expansion coefficients for the product of two…

Combinatorics · Mathematics 2026-04-02 Hong Chen , Siddhartha Sahi

We introduce new families of cylindric symmetric functions as subcoalgebras in the ring of symmetric functions $\Lambda$ (viewed as a Hopf algebra) which have non-negative structure constants. Combinatorially these cylindric symmetric…

Combinatorics · Mathematics 2019-07-05 Christian Korff , David Palazzo

Connection coefficients between different orthonormal bases satisfy two discrete orthogonal relations themselves. For classical orthogonal polynomials whose weights are invariant under the action of the symmetric group, connection…

Classical Analysis and ODEs · Mathematics 2017-03-21 Plamen Iliev , Yuan Xu

In a previous work, both the constants of motion of a classical system and the symmetries of the corresponding quantum version have been computed with the help of factorizations. As their expressions were not polynomial, in this paper the…

Mathematical Physics · Physics 2014-04-29 J. A. Calzada , Ş. Kuru , J. Negro

We provide an algorithm for the construction of orthonormal multivariate polynomials that are symmetric with respect to the interchange of any two coordinates on the unit hypercube and are constrained to the hyperplane where the sum of the…

High Energy Physics - Phenomenology · Physics 2014-12-24 S. S. Chabysheva , J. R. Hiller

In our joint paper with W. Fulton (math.AG/9804041) we prove a formula for the cohomology class of a quiver variety. This formula is general enough to give new expressions for all known types of Schubert polynomials. In the present paper we…

Combinatorics · Mathematics 2007-05-23 Anders S. Buch

We prove a conjecture of Cuttler et al.~[2011] [A. Cuttler, C. Greene, and M. Skandera; \emph{Inequalities for symmetric means}. European J. Combinatorics, 32(2011), 745--761] on the monotonicity of \emph{normalized Schur functions} under…

Combinatorics · Mathematics 2015-07-21 Suvrit Sra

Littlewood Richardson coefficients are structure constants appearing in the representation theory of the general linear groups ($GL_n$). The main results of this paper are: 1. A strongly polynomial randomized approximation scheme for…

Combinatorics · Mathematics 2013-06-19 Hariharan Narayanan

We prove that in the geometric complexity theory program the vanishing of rectangular Kronecker coefficients cannot be used to prove superpolynomial determinantal complexity lower bounds for the permanent polynomial. Moreover, we prove the…

Computational Complexity · Computer Science 2017-08-14 Christian Ikenmeyer , Greta Panova