Large p-core p^-partitions and walks on the additive residue graph
From MaRDI portal
Publication:6062822
Abstract: This paper investigates partitions which have neither parts nor hook lengths divisible by , referred to as -core -partitions. We show that the largest -core -partition corresponds to the longest walk on a graph with vertices and labelled edges defined via addition modulo . We also exhibit an explicit family of large -core -partitions, giving a lower bound on the size of the largest such partition which is of the same degree as the upper bound found by McSpirit and Ono.
Recommendations
- Asymptotic properties of maximal \(p\)-core \(p^\prime\)-partitions
- On the largest size of \((t, t + 1, \ldots, t + p)\)-core partitions
- The largest size of an (s,s+1)-core partition with parts of the same parity
- On the largest sizes of (s, qs 1)-core partitions with parts of the same parity
- scientific article; zbMATH DE number 3865287
Cites work
This page was built for publication: Large \(p\)-core \(p^\prime\)-partitions and walks on the additive residue graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6062822)