Combinatorics on a family of reduced Kronecker coefficients

DOI10.1016/J.CRMA.2015.07.012zbMATH Open1325.05017arXiv1506.02829OpenAlexW2962797874MaRDI QIDQ889473FDOQ889473

Authors: Laura Colmenarejo, Mercedes Rosas 

Publication date: 6 November 2015

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Abstract: The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also gives its connection to the plane partitions, which allows us to check that this family satisfies the saturation conjecture for reduced Kronecker coefficients, and that they are weakly increasing. Thanks to its generating function we can describe our family by a quasipolynomial, specifying its degree and period.

Full work available at URL: https://arxiv.org/abs/1506.02829

Recommendations

• Plane partitions and the combinatorics of some families of reduced Kronecker coefficients
• Breaking down the reduced Kronecker coefficients
• Reduced Kronecker products which are multiplicity free or contain only few components
• Vector partition functions and Kronecker coefficients
• Reduced Kronecker coefficients and counter-examples to Mulmuley's strong saturation conjecture SH

zbMATH Keywords

generating function of a family of reduced Kronecker coefficients

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Cites Work

• A combinatorial interpretation for the coefficients in the Kronecker product \(s_{(n-p,p)} \ast s_\lambda\)
• Reduced Kronecker coefficients and counter-examples to Mulmuley's strong saturation conjecture SH
• The stability of the Kronecker product of Schur functions
• The honeycomb model of $GL_n(\mathbb C)$ tensor products I: Proof of the saturation conjecture
• An invitation to the generalized saturation conjecture
• Plane partitions and characters of the symmetric group
• Combinatory analysis. Vols. I, II (bound in one volume)
• On the growth of Kronecker coefficients
• Title not available (Why is that?)

Cited In (10)

• Combinatorics in tensor-integral reduction
• Reduced Kronecker products which are multiplicity free or contain only few components
• Reduced Kronecker coefficients and counter-examples to Mulmuley's strong saturation conjecture SH
• On the growth of Kronecker coefficients
• All Kronecker coefficients are reduced Kronecker coefficients
• Partial symmetries of iterated plethysms
• Title not available (Why is that?)
• Vector partition functions and Kronecker coefficients
• Breaking down the reduced Kronecker coefficients
• Plane partitions and the combinatorics of some families of reduced Kronecker coefficients

This page was built for publication: Combinatorics on a family of reduced Kronecker coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q889473)