Odd partitions in Young's lattice

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.

13 pages, 3 figures, available from http://www.mat.univie.ac.at/~slc/wpapers/s75prasad.html