Odd partitions in Young's lattice
Combinatorics
2016-06-08 v2 Representation Theory
Abstract
We show that the subgraph induced in Young's graph by the set of partitions with an odd number of standard Young tableaux is a binary tree. This tree exhibits self-similarities at all scales, and has a simple recursive description.
Cite
@article{arxiv.1601.01776,
title = {Odd partitions in Young's lattice},
author = {Arvind Ayyer and Amritanshu Prasad and Steven Spallone},
journal= {arXiv preprint arXiv:1601.01776},
year = {2016}
}
Comments
13 pages, 3 figures, available from http://www.mat.univie.ac.at/~slc/wpapers/s75prasad.html