English
Related papers

Related papers: A combinatorial interpretation for certain plethys…

200 papers

We present combinatorial operators for the expansion of the Kronecker product of irreducible representations of the symmetric group. These combinatorial operators are defined in the ring of symmetric functions and act on the Schur functions…

Representation Theory · Mathematics 2016-09-07 Alain Goupil , Cedric Chauve

Analytic combinatorics studies the asymptotic behaviour of sequences through the analytic properties of their generating functions. This article provides effective algorithms required for the study of analytic combinatorics in several…

Symbolic Computation · Computer Science 2016-05-03 Stephen Melczer , Bruno Salvy

We find a combinatorial setting for the coefficients of the Boros-Moll polynomials $P_m(a)$ in terms of partially 2-colored permutations. Using this model, we give a combinatorial proof of a recurrence relation on the coefficients of…

Combinatorics · Mathematics 2010-08-30 William Y. C. Chen , Sabrina X. M. Pang , Ellen X. Y. Qu

Let $\nabla^\lambda$ denote the Schur functor labelled by the partition $\lambda$ and let $E$ be the natural representation of $\mathrm{SL}_2(\mathbb{C})$. We make a systematic study of when there is an isomorphism $\nabla^\lambda…

Representation Theory · Mathematics 2019-07-18 Rowena Paget , Mark Wildon

We prove a conjecture of Lecouvey, which proposes a closed, positive combinatorial formula for symplectic Kostka-Foulkes polynomials, in the case of rows of arbitrary weight. To show this, we construct a new algorithm for computing…

Combinatorics · Mathematics 2020-07-07 Maciej Dołęga , Thomas Gerber , Jacinta Torres

We conjecture unimodality for some sequences of generalized Kronecker coefficients and prove it for partitions with at most two columns. The proof is based on a hard Lefschetz property for corresponding highest weight spaces. We also study…

Combinatorics · Mathematics 2023-12-29 Alimzhan Amanov , Damir Yeliussizov

Given an elliptic curve C, we study here $N_k = #C(F_{q^k})$, the number of points of C over the finite field F_{q^k}. This sequence of numbers, as k runs over positive integers, has numerous remarkable properties of a combinatorial flavor…

Combinatorics · Mathematics 2007-07-24 Gregg Musiker

If $[\lambda(j)]$ is a multipartition of the positive integer $n$ (a sequence of partitions with total size $n$), and $\mu$ is a partition of $n$, we study the number $K_{[\lambda(j)]\mu}$ of sequences of semistandard Young tableaux of…

Combinatorics · Mathematics 2015-07-10 James Janopaul-Naylor , C. Ryan Vinroot

The permutation matrices form a subgroup of $\text{GL}_n(\mathbb{C})$ that is isomorphic to the symmetric group $S_n$. Let $r_{\mu\lambda}$ denote the multiplicity of the irreducible representation $V_\mu$ of $S_n$, corresponding to a…

Combinatorics · Mathematics 2025-12-18 Sridhar P. Narayanan

We define the generalized Golomb triangular recursion by g_{j,s,lambda}(n) = g_{j,s,lambda}(n - s - g_{j,s,lambda}(n-j)) + \lambda j. For particular choices of the initial conditions, we show that the solution of the recursion is a non-slow…

Combinatorics · Mathematics 2012-02-03 Abraham Isgur , Vitaly Kuznetsov , Stephen Tanny

Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…

Algebraic Topology · Mathematics 2022-01-26 Clemens Berger , Ralph M. Kaufmann

Petrie symmetric functions $G(k,n)$, also known as truncated homogeneous symmetric functions or modular complete symmetric functions, form a class of symmetric functions interpolating between the elementary symmetric functions $e_n$ and the…

Combinatorics · Mathematics 2026-05-29 Saintan Wu , Sen-Peng Eu , Kuo-Han Ku , Yu-Sheng Shih

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

Algebraic Combinatorics originated in Algebra and Representation Theory, studying their discrete objects and integral quantities via combinatorial methods which have since developed independent and self-contained lives and brought us some…

Combinatorics · Mathematics 2023-07-03 Greta Panova

Kostka functions $K^{\pm}_{\lambda, \mu}(t)$ associated to complex reflection groups are a generalization of Kostka polynomials, which are indexed by $r$-partitions $\lambda, \mu$ and a sign $+, -$. It is known that Kostka polynomials have…

Representation Theory · Mathematics 2017-06-28 Toshiaki Shoji

We present new proofs and generalizations of unimodality of the q-binomial coefficients \binom{n}{k}_q as polynomials in q. We use an algebraic approach by interpreting the differences between numbers of certain partitions as Kronecker…

Combinatorics · Mathematics 2014-03-13 Igor Pak , Greta Panova

We give a combinatorial description of sl(n)-fusion coefficients in the case where one partition has at most two columns and establih other properties for this case.

Combinatorics · Mathematics 2007-05-23 Geanina Tudose

We present a way of computing Kronecker coefficients that uses a new family of rational convex polytopes, called column-row polytopes. We give several different formulas for the computation. They are alternating sums of numbers of integer…

Combinatorics · Mathematics 2026-01-05 Ernesto Vallejo , Pedro David Sánchez Salazar

We consider the symmetric group $S_n$-module of the polynomial ring with $m$ sets of $n$ commuting variables and $m'$ sets of $n$ anti-commuting variables and show that the multiplicity of an irreducible indexed by the partition $\lambda$…

Combinatorics · Mathematics 2020-07-07 Rosa Orellana , Mike Zabrocki

The Kronecker coefficients are the structural constants for the tensor categories of representations of the symmetric groups; namely, given three partitions $\lambda, \mu, \tau$ of $n$, the multiplicity of $\lambda$ in $\mu \otimes \tau$ is…

Representation Theory · Mathematics 2017-06-19 Inna Entova-Aizenbud