相关论文: A Combinatorial Interpretation for the coefficient…

The number of times spin s appears in the Kronecker product of n spin j representations is computed, and the large n asymptotic behavior of the result is obtained. Applications are briefly sketched.

A fundamental problem in the representation theory of the symmetric group, Sn, is to describe the coefficients in the decomposition of a tensor product of two simple representations. These coefficients are known in the literature as the…

In this paper, we give a combinatorial rule to calculate the decomposition of the tensor product (Kronecker product) of two irreducible complex representations of the symmetric group ${\mathfrak S}_n$, when one of the representations…

The computation of Kronecker coefficients is a challenging problem with a variety of applications. In this paper we present an approach based on methods from symplectic geometry and residue calculus. We outline a general algorithm for the…

We study the properties of the product, which runs over the primes, $$\mathfrak{p}_n = \prod_{s_p(n) \, \geq \, p} p \quad (n \geq 1),$$ where $s_p(n)$ denotes the sum of the base-$p$ digits of $n$. One important property is the fact that…

The problem of decomposing the Kronecker product of $S_n$ characters is one of the last major open problems in the ordinary representation theory of the symmetric group $S_n$. Here we prove upper and lower polynomial bounds for the…

We relate the $m$-truncated Kronecker products of symmetric functions to the semi-invariant rings of a family of quiver representations. We find cluster algebra structures for these semi-invariant rings when $m=2$. Each {\sf g}-vector cone…

We present here a combinatorial method for computing cup-$i$ products and Steenrod squares of a simplicial set $X$. This method is essentially based on the determination of explicit formulae for the component morphisms of a higher diagonal…

We resolve three interrelated problems on \emph{reduced Kronecker coefficients} $\overline{g}(\alpha,\beta,\gamma)$. First, we disprove the \emph{saturation property} which states that $\overline{g}(N\alpha,N\beta,N\gamma)>0$ implies…

Let $H(p)$ be the set of 2-bridge knots $K$ whose group $G$ is mapped onto a non-trivial free product, $Z/2 * Z/p$, $p$ being odd. Then there is an algebraic integer $s_0$ such that for any $K$ in $H(p)$, $G$ has a parabolic representation…

We present a criterion for multiplicity-freeness of the decomposition of the restriction Res$^G_H(\rho_1 \otimes \rho_2)$ of the Kronecker product of two generic irreducible representations $\rho_1, \rho_2$ of a finite group $G$ with…

It is shown that for any prime $p$ and any natural numbers $\ell, m,$ and $s$ such that $0<s<p$, the three following congruences \begin{align*}\sum_{i\ge \ell+1}(-1)^{m-i} {m \choose i}{m+s-1+i(p-1) \choose m+s-1+\ell(p-1)} &\equiv 0 \bmod…

We study the remarkable Saxl conjecture which states that tensor squares of certain irreducible representations of the symmetric groups S_n contain all irreducibles as their constituents. Our main result is that they contain representations…

While there has been some progress on the decomposition of Kronecker products of characters of the symmetric groups in recent times, results on the symmetric and alternating part of Kronecker squares are still scarce. Here, new results (and…

Worpitzky's identity expresses $n^p$ in terms of the Eulerian numbers and binomial coefficients: $$n^p = \sum_{i=0}^{p-1} \genfrac<>{0pt}{}{p}{i} \binom{n+i}{p}.$$ Pita-Ruiz recently defined numbers $A_{a,b,r}(p,i)$ implicitly to satisfy a…

Let K be a number field containing the group of n-th roots of unity and S a set of primes of K including all those dividing n and all real archimedean places. We consider the cup product on the first Galois cohomology group of the maximal…

For $k\ge 1$, the homogeneous symmetric functions $G(k,m)$ of degree $m$ defined by $\sum_{m\ge 0} G(k,m) z^m=\prod_{i\ge 1} \big(1+x_iz+x^2_iz^2+\cdots+x^{k-1}_iz^{k-1}\big)$ are called \emph{Petrie symmetric functions}. As derived by…

We study the complexity of computing Kronecker coefficients $g(\lambda,\mu,\nu)$. We give explicit bounds in terms of the number of parts $\ell$ in the partitions, their largest part size $N$ and the smallest second part $M$ of the three…

There is an extensive literature on the asymptotic order of Sudler's trigonometric product $P_N (\alpha) = \prod_{n=1}^N |2 \sin (\pi n \alpha)|$ for fixed or for "typical" values of $\alpha$. In the present paper we establish a structural…

We prove a combinatorial formula for the Macdonald polynomial H_mu(x;q,t) which had been conjectured by the first author. Corollaries to our main theorem include the expansion of H_mu(x;q,t) in terms of LLT polynomials, a new proof of the…