ON THE NUMBER OF 2-HOOKS AND 3-HOOKS OF INTEGER PARTITIONS
From MaRDI portal
Publication:6135511
Abstract: Let denote the number of partitions of such that the number of hooks is congruent to . For , arithmetic progressions and on which vanishes were established in recent work by Bringmann, Craig, Males, and Ono using the theory of modular forms. Here we offer a direct combinatorial proof of this result using abaci and the theory of -cores and -quotients.
Recommendations
- On the maximum number of k-hooks of partitions of n
- Some Conjectures and Open Problems on Partition Hook Lengths
- On multisets of hook lengths of partitions
- Enumeration of generalized hook partitions
- Some combinatorial properties of hook lengths, contents, and parts of partitions
- Hooks and powers of parts in partitions
- The Borwein conjecture and partitions with prescribed hook differences
- scientific article; zbMATH DE number 24328
- Proof of a conjecture on multisets of hook numbers
- On \((2 k + 1, 2 k + 3)\)-core partitions with distinct parts
Cites work
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- scientific article; zbMATH DE number 601020 (Why is no real title available?)
- 4-core partitions and class numbers
- A crank-based approach to the theory of 3-core partitions
- Cranks and t-cores
- Defect zero blocks for finite simple groups
- Distribution properties for \(t\)-hooks in partitions
- Distributions on partitions arising from Hilbert schemes and hook lengths
- The Hook Graphs of the Symmetric Group
Cited in
(4)
This page was built for publication: ON THE NUMBER OF 2-HOOKS AND 3-HOOKS OF INTEGER PARTITIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135511)