The set of all partitions \(\lambda=(\lambda_1,\dots,\lambda_k)\) has a natural graph structure (the Hasse graph) where the partitions are the vertices of the graph and two partitions are connected with an edge if the diagram of one of them can be obtained from the other diagram by adding a box. The author considers the automorphisms of a subgraph \(Y_n\) of the Hasse graph defined by the property that the diagram of \(\lambda\in Y_n\) is contained in a rectangular diagram which is a subset of the diagram of \((n-1,n-2,\dots,2,1)\). The main result is that for \(n\geq 3\) the dihedral group \(D_n\) acts naturally on the graph \(Y_n\) and is isomorphic to its automorphism group.
- Groups generated by involutions of diamond-shaped graphs, and deformations of Young's orthogonal form
- Cyclic symmetry of the scaled simplex
- The poset of positive roots and its relatives
- Homomesy in products of two chains
- Complexity in Young's lattice
- Symmetries on the lattice of k-bounded partitions
- Sweeping up zeta
- Representations of \(\mathbb{N}^{\infty}\)-type combinatorial categories
This page was built for publication: Young's lattice and dihedral symmetries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348749)
