Reconstructing Partitions from their Multisets of k-Minors

MaRDI QIDQ6278732zbMATH OpenFDO

Authors Pakawut Jiradilok

Publication date 17 October 2016

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30)

Abstract: For non-negative integers $n$ and $k$ with $ngek$, a {em $k$-minor} of a partition $lambda=[lambd{a}_1,lambd{a}_2,dots]$ of $n$ is a partition $mu=[m{u}_1,m{u}_2,dots]$ of $n-k$ such that $m{u}_{i}lelambd{a}_i$ for all $i$. The multiset $widehat{M}_k(lambda)$ of $k$-minors of $lambda$ is defined as the multiset of $k$-minors $mu$ with multiplicity of $mu$ equal to the number of standard Young tableaux of skew shape $lambda/mu$. We show that there exists a function $G(n)$ such that the partitions of $n$ can be reconstructed from their multisets of $k$-minors if and only if $kleG(n)$. Furthermore, we prove that $li{m}_{nightarrowinfty}G(n)/n=1$ with $n-G(n)=O(n/logn)$. As a direct consequence of this result, the irreducible representations of the symmetric group $S_n$ can be reconstructed from their restrictions to $S_{n-k}$ if and only if $kleG(n)$ for the same function $G(n)$. For a minor $mu$ of the partition $lambda$, we study the excitation factor $E_{m}u(lambda)$, which appears as a crucial part in Naruse's Skew-Shape Hook Length Formula. We observe that certain excitation factors of $lambda$ can be expressed as a $mathbbQ[k]$-linear combination of the elementary symmetric polynomials of the hook lengths in the first row of $lambda$ where $k=lambd{a}_1$ is the number of cells in the first row of $lambda$.

This page was built for publication: Reconstructing Partitions from their Multisets of $k$-Minors

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