Odd partitions in Young's lattice
classification
🧮 math.CO
math.RT
keywords
youngpartitionstreebinarydescriptionexhibitsgraphinduced
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.