Integer partitions and binary trees
If \(\alpha\) is the 2-core, \((\beta_0,\beta_1)\) the 2-quotient of a partition \(\lambda\), then the triple \((\alpha; \beta_0,\beta_1)\) uniquely determines \(\lambda\); see \textit{G. James} and \textit{A. Kerber} [The representation theory of the symmetric group (Addison-Wesley, Reading, MA) (1981; Zbl 0491.20010)]. The present author constructs a unique weighted binary tree representation for \(\lambda\) and provides various examples. Then he lists a series of problems concerning this correspondence. These ideas and their link with noncrossing partitions and Catalan numbers were prompted by work of Rodica Simion, to whose memory the present paper is dedicated.
- A combinatorial problem in the symmetric group
- Addendum to a partition identity
- Codes, transforms and the spectrum of the symmetric group
- Cranks and t-cores
- scientific article; zbMATH DE number 3880803 (Why is no real title available?)
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- scientific article; zbMATH DE number 3099472 (Why is no real title available?)
- Problems related to type-\(A\) and type-\(B\) matrices of chromatic joins
- Combinatorial proofs of the Ramanujan type congruences modulo \(3\)
- scientific article; zbMATH DE number 1788109 (Why is no real title available?)
- 4-regular partitions and the pod function
- Partitions and labeled trees
- Trees with flowers: a catalog of integer partition and integer composition trees with their asymptotic analysis
- Proof of a conjecture of Green and Liebeck on codes in symmetric groups
- Tiling the symmetric group by transpositions
This page was built for publication: Integer partitions and binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696824)