English
Related papers

Related papers: Stretched Newell-Littlewood coefficients

200 papers

We study the distribution of the extended binomial coefficients by deriving a complete asymptotic expansion with uniform error terms. We obtain the expansion from a local central limit theorem and we state all coefficients explicitly as…

Combinatorics · Mathematics 2014-07-29 Thorsten Neuschel

Let $\Gamma$ be a $Q$-polynomial distance-regular graph with diameter at least $3$. Terwilliger (1993) implicitly showed that there exists a polynomial, say $T(\lambda)\in \mathbb{C}[\lambda]$, of degree $4$ depending only on the…

Combinatorics · Mathematics 2014-03-18 Alexander L. Gavrilyuk , Jack H. Koolen

We introduce a conjectural construction for an extension to superspace of the Macdonald polynomials. The construction, which depends on certain orthogonality and triangularity relations, is tested for high degrees. We conjecture a simple…

Mathematical Physics · Physics 2012-08-14 O. Blondeau-Fournier , P. Desrosiers , L. Lapointe , P. Mathieu

Littlewood investigated polynomials with coefficients in $\{-1,1\}$ (Littlewood polynomials), to see how small their ratio of norms $||f||_4/||f||_2$ on the unit circle can become as $deg(f)\to\infty$. A small limit is equivalent to slow…

Number Theory · Mathematics 2012-10-23 Daniel J. Katz

Let $r \geq 0$, and let $\lambda$ and $\mu$ be partitions such that $\lambda_1 \leq r + 1$. We present a combinatorial interpretation of the plethysm coefficient $\langle s_\lambda, s_\mu[s_r] \rangle$. As a consequence, we solve the…

Combinatorics · Mathematics 2025-08-28 Mitchell Lee

We study the Littlewood-Richardson coefficients of double Grothendieck polynomials indexed by Grassmannian permutations. Geometrically, these are the structure constants of the equivariant $K$-theory ring of Grassmannians. Representing the…

Combinatorics · Mathematics 2016-07-11 Michael Wheeler , Paul Zinn-Justin

We resolve two open problems on Kronecker coefficients $g(\lambda,\mu,\nu)$ of the symmetric group. First, we prove that for partitions $\lambda,\mu,\nu$ with fixed Durfee square size, the Kronecker coefficients grow at most polynomially.…

Combinatorics · Mathematics 2022-12-23 Igor Pak , Greta Panova

For non-negative integers $n$ and $k$ with $n \ge k$, a {\em $k$-minor} of a partition $\lambda = [\lambda_1, \lambda_2, \dots]$ of $n$ is a partition $\mu = [\mu_1, \mu_2, \dots]$ of $n-k$ such that $\mu_i \le \lambda_i$ for all $i$. The…

Combinatorics · Mathematics 2016-10-19 Pakawut Jiradilok

We give explicit positive combinatorial interpretations for the plethysm coefficients $\langle s_\mu[s_\nu], s_\lambda\rangle$, when $\lambda$ has at most two rows, as counting certain marked trees. In the special case $\mu=(n)$, this also…

Combinatorics · Mathematics 2025-11-05 Igor Pak , Greta Panova , Joshua P. Swanson

Given an integral hyperplane arrangement, Kamiya-Takemura-Terao (2008 & 2011) introduced the notion of characteristic quasi-polynomial, which enumerates the cardinality of the complement of the arrangement modulo a positive integer. The…

Combinatorics · Mathematics 2021-05-13 Akihiro Higashitani , Tan Nhat Tran , Masahiko Yoshinaga

We give the full solution of the following problem: obtain sharp inequalities between the moduli of smoothness $\omega_\alpha(f,t)_q$ and $\omega_\beta(f,t)_p$ for $0<p<q\le \infty$. A similar problem for the generalized $K$-functionals and…

Classical Analysis and ODEs · Mathematics 2017-11-23 Yurii Kolomoitsev , Sergey Tikhonov

For $(\lambda_{1},...,\lambda_{d})=\lambda\in(0,1)^{d}$ with $\lambda_{1}>...>\lambda_{d}$, denote by $\mu_{\lambda}$ the Bernoulli convolution associated to $\lambda$. That is, $\mu_{\lambda}$ is the distribution of the random vector…

Dynamical Systems · Mathematics 2024-06-11 Ariel Rapaport , Haojie Ren

We reconsider the two related problems: distribution of the diagonal elements of a Hermitian n x n matrix of known eigenvalues (Schur) and determination of multiplicities of weights in a given irreducible representation of SU(n) (Kostka).…

Representation Theory · Mathematics 2020-01-23 Robert Coquereaux , Jean-Bernard Zuber

The classical Littlewood-Richardson rule is a rule for computing coefficients in many areas, and comes in many guises. In this paper we prove two Littlewood-Richardson rules for symmetric skew quasisymmetric Schur functions that are…

Combinatorics · Mathematics 2015-09-14 Christine Bessenrodt , Vasu V. Tewari , Stephanie J. van Willigenburg

We show that the HOMFLY polynomials for torus knots T[m,n] in all fundamental representations are equal to the Hall-Littlewood polynomials in representation which depends on m, and with quantum parameter, which depends on n. This makes the…

High Energy Physics - Theory · Physics 2015-06-04 A. Mironov , A. Morozov , Sh. Shakirov

We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite lambda-terms that are lambda_{letrec}-expressible in the sense that they arise as infinite…

Programming Languages · Computer Science 2013-05-28 Clemens Grabmayer , Jan Rochel

Let $\ell$ be a rational prime number. Assuming the Gross-Kuz'min conjecture along a $\Zl$-extension $K\_{\infty}$ of a number field $K$, we show that there exist integers $\mut$, $\lat$ and $\widetilde{\nu}$ such that the exponent…

Number Theory · Mathematics 2018-12-10 Jose Ibrahim Villanueva Gutierrez

In this paper we consider generalized eigenvalue problems for a family of operators with a quadratic dependence on a complex parameter. Our model is $L(\lambda)=-\triangle +(P(x)-\lambda)^2$ in $L^2(\R^d)$ where $P$ is a positive elliptic…

Mathematical Physics · Physics 2009-03-06 Fatima Aboud , Didier Robert

It is known that the Schur expansion of a skew Schur function runs over the interval of partitions, equipped with dominance order, defined by the least and the most dominant Littlewood-Richardson filling of the skew shape. We characterise…

Combinatorics · Mathematics 2018-08-17 Olga Azenhas , Alessandro Conflitti , Ricardo Mamede

J. DeLoera-T. McAllister and K. D. Mulmuley-H. Narayanan-M. Sohoni independently proved that determining the vanishing of Littlewood-Richardson coefficients has strongly polynomial time computational complexity. Viewing these as Schubert…

Combinatorics · Mathematics 2019-05-23 Anshul Adve , Colleen Robichaux , Alexander Yong