English
Related papers

Related papers: A combinatorial interpretation for certain plethys…

200 papers

The product $s_\mu s_\nu$ of two Schur functions is one of the most famous examples of a Schur-positive function, i.e. a symmetric function which, when written as a linear combination of Schur functions, has all positive coefficients. We…

Combinatorics · Mathematics 2007-05-23 Francois Bergeron , Peter McNamara

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

Representation Theory · Mathematics 2015-09-25 Toshiaki Shoji

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…

Combinatorics · Mathematics 2015-02-25 Igor Pak , Greta Panova

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

A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…

Combinatorics · Mathematics 2013-10-07 Matthias Beck

In two papers, B\"urgisser and Ikenmeyer (STOC 2011, STOC 2013) used an adaption of the geometric complexity theory (GCT) approach by Mulmuley and Sohoni (Siam J Comput 2001, 2008) to prove lower bounds on the border rank of the matrix…

Computational Complexity · Computer Science 2020-02-04 Nick Fischer , Christian Ikenmeyer

Let $w$ be a word in alphabet $\{x,D\}$ with $m$ $x$'s and $n$ $D$'s. Interpreting "$x$" as multiplication by $x$, and "$D$" as differentiation with respect to $x$, the identity $wf(x) = x^{m-n}\sum_k S_w(k) x^k D^k f(x)$, valid for any…

Combinatorics · Mathematics 2014-07-24 John Engbers , David Galvin , Justin Hilyard

This paper proves a combinatorial rule giving all maximal and minimal partitions $\lambda$ such that the Schur function $s_\lambda$ appears in a plethysm of two arbitrary Schur functions. Determining the decomposition of these plethysms has…

Representation Theory · Mathematics 2018-11-14 Rowena Paget , Mark Wildon

The Kronecker product of two Schur functions $s_{\mu}$ and $s_{\nu}$, denoted by $s_{\mu}*s_{\nu}$, is the Frobenius characteristic of the tensor product of the irreducible representations of the symmetric group corresponding to the…

Combinatorics · Mathematics 2007-05-23 Mercedes H. Rosas

We prove that for all natural numbers k,n,d with k <= d and every partition lambda of size kn with at most k parts there exists an irreducible GL(d, C)-representation of highest weight 2*lambda in the plethysm Sym^k(Sym^(2n) (C^d)). This…

Group Theory · Mathematics 2010-12-16 Peter Bürgisser , Matthias Christandl , Christian Ikenmeyer

Representation theory of the symmetric group $\mathfrak{S}_n$ has a very distinctive combinatorial flavor. The conjugacy classes as well as the irreducible characters are indexed by integer partitions $\lambda \vdash n$. We introduce class…

Combinatorics · Mathematics 2018-12-27 Ahmed Umer Ashraf

Recently Blasiak gave a combinatorial rule for the Kronecker coefficient $g_{\lambda \mu \nu}$ when $\mu$ is a hook shape by defining a set of colored Yamanouchi tableaux with cardinality $g_{\lambda\mu\nu}$ in terms of a process called…

Combinatorics · Mathematics 2014-12-09 Ricky Ini Liu

Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial…

Combinatorics · Mathematics 2009-11-18 Bruce Sagan , Carla Savage

Plethysm coefficients $\mathsf{a}_{\mu[\nu]}^\lambda$ are the structure coefficients of the plethysm of Schur functions $s_\mu[s_\nu] = \sum_{\lambda} \mathsf{a}_{\mu[\nu]}^\lambda s_\lambda$. We study a bivariate generating function of…

Combinatorics · Mathematics 2026-04-07 Álvaro Gutiérrez , Rosa Orellana , Franco Saliola , Anne Schilling , Mike Zabrocki

We prove that the semi-invariant ring of the standard representation space of the $l$-flagged $m$-arrow Kronecker quiver is an upper cluster algebra for any $l,m\in \mathbb{N}$. The quiver and cluster are explicitly given. We prove that the…

Representation Theory · Mathematics 2021-12-01 Jiarui Fei

In this paper we present a combinatorial proof of the Kronecker--Weber Theorem for global fields of positive characteristic. The main tools are the use of Witt vectors and their arithmetic developed by H. L. Schmid. The key result is to…

Number Theory · Mathematics 2013-07-16 Julio Cesar Salas-Torres , Martha Rzedowski-Calderón , Gabriel Villa-Salvador

Our main result here is that the specialization at $t=1/q$ of the $Q_{km,kn}$ operators studied in [4] may be given a very simple plethystic form. This discovery yields elementary and direct derivations of several identities relating these…

Combinatorics · Mathematics 2015-01-06 A. M. Garsia , E. Leven , N. Wallach , G. Xin

We obtain a family of explicit "polyhedral" combinatorial expressions for multiplicities in the tensor product of two simple finite-dimensional modules over a complex semisimple Lie algebra. Here "polyhedral" means that the multiplicity in…

Representation Theory · Mathematics 2007-05-23 Arkady Berenstein , Andrei Zelevinsky

We define a number of related combinatorial objects, each of which possesses a surprising symmetry. We include several applications such as a combinatorial explanation for certain fixed points of the involution $\omega$ on the ring of…

Combinatorics · Mathematics 2018-09-13 Graham Hawkes

The Kronecker coefficient g_{\lambda \mu \nu} is the multiplicity of the GL(V)\times GL(W)-irreducible V_\lambda \otimes W_\mu in the restriction of the GL(X)-irreducible X_\nu via the natural map GL(V)\times GL(W) \to GL(V \otimes W),…

Computational Complexity · Computer Science 2013-06-10 Jonah Blasiak , Ketan D. Mulmuley , Milind Sohoni