Hook length biases and general linear partition inequalities
From MaRDI portal
Publication:6076979
Abstract: Motivated in part by hook-content formulas for certain restricted partitions in representation theory, we consider the total number of hooks of fixed length in odd versus distinct partitions. We show that there are more hooks of length , respectively , in all odd partitions of than in all distinct partitions of , and make the analogous conjecture for arbitrary hook length . We also establish additional bias results on the number of gaps of size respectively , in all odd versus distinct partitions of . We conjecture similar biases and asymptotics, as well as congruences for the number of hooks of fixed length in odd distinct partitions versus self-conjugate partitions. An integral component of the proof of our bias result for hooks of length is a linear inequality involving , the number of distinct partitions of . In this article we also establish effective linear inequalities for in great generality, a result which is of independent interest. Our methods are both analytic and combinatorial, and our results and conjectures intersect the areas of representation theory, analytic number theory, partition theory, and -series. In particular, we use a Rademacher-type exact formula for Wright's circle method, modularity, -series transformations, asymptotic methods, and combinatorial arguments.
Recommendations
Cites work
- scientific article; zbMATH DE number 994432 (Why is no real title available?)
- scientific article; zbMATH DE number 4112684 (Why is no real title available?)
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 3399320 (Why is no real title available?)
- Asymptotically trivial linear homogeneous partition inequalities
- Distributions of hook lengths divisible by two or three
- Distributions on partitions arising from Hilbert schemes and hook lengths
- Integer partitions, probabilities and quantum modular forms
- Multiplicative properties of the number of k-regular partitions
- New hook-content formulas for strict partitions
- New hook-content formulas for strict partitions
- On the number of parts in congruence classes for partitions into distinct parts
- Partitions Into Odd Summands
- Random strict partitions and random shifted tableaux
- STACKS (II)
- Seiberg-Witten theory and random partitions
- The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
- The size of \(t\)-cores and hook lengths of random cells in random partitions
- Unexpected biases between congruence classes for parts in \(k\)-indivisible partitions
Cited in
(5)
This page was built for publication: Hook length biases and general linear partition inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076979)