The solution to the partition reconstruction problem
From MaRDI portal
Publication:1003623
DOI10.1016/j.jcta.2007.12.012zbMath1228.05047OpenAlexW2035181072MaRDI QIDQ1003623
Publication date: 4 March 2009
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2007.12.012
Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of representation theory (05E10)
Related Items
Totally symmetric functions are reconstructible from identification minors, Reconstructing Young tableaux, Set-reconstructibility of Post classes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sharp bound for the reconstruction of partitions
- Reconstructing permutations from cycle minors
- The representation theory of the symmetric groups
- On uniquely \(k\)-determined permutations
- Permutation reconstruction from minors
- Permutation reconstruction
- Reconstruction of partitions