论文信息 - Reconstructing Young tableaux

Reconstructing Young tableaux

This paper completely characterizes the standard Young tableaux that can be reconstructed from their sets or multisets of 1minors. In particular, any standard Young tableau with at least 5 entries can be reconstructed from its set of 1-minors.

Alan J. Cain | Erkko Lehtonen | Erkko Lehtonen

[1] P. Kelly. A congruence theorem for trees. , 1957 .

[2] W. Fulton. Young Tableaux: With Applications to Representation Theory and Geometry , 1996 .

[3] Maria Monks. The solution to the partition reconstruction problem , 2009, J. Comb. Theory, Ser. A.

[4] Oliver Pretzel,et al. Reconstruction of Partitions , 2005, Electron. J. Comb..

[5] Vincent Vatter. A Sharp Bound for the Reconstruction of Partitions , 2008, Electron. J. Comb..

[6] S. Ulam. A collection of mathematical problems , 1960 .