Hook length biases and general linear partition inequalities

DOI10.1007/S40687-023-00402-1MaRDI QIDQ6076979zbMATH OpenOpenAlexFDO

Authors Cristina Ballantine, Hannah Burson, Amanda Folsom, Boya Wen, William Craig

Publication date 17 October 2023

Published in Research in the Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2303.16512

zbMATH Keywords

partition inequalitieshook lengthdistinct partitionsodd partitionspartition asymptotics

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19) Analytic theory of partitions (11P82) Partitions; congruences and congruential restrictions (11P83)

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 $2$, respectively $3$, in all odd partitions of $n$ than in all distinct partitions of $n$, and make the analogous conjecture for arbitrary hook length $tgeq2$. We also establish additional bias results on the number of gaps of size $1,$ respectively $2$, in all odd versus distinct partitions of $n$. 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 $3$ is a linear inequality involving $q(n)$, the number of distinct partitions of $n$. In this article we also establish effective linear inequalities for $q(n)$ 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 $q$-series. In particular, we use a Rademacher-type exact formula for $q(n),$ Wright's circle method, modularity, $q$-series transformations, asymptotic methods, and combinatorial arguments.

Recommendations

• Hooks and powers of parts in partitions
• Parity biases in partitions and restricted partitions
• Parity biases in partitions and restricted partitions
• Distribution properties for \(t\)-hooks in partitions
• Parity bias in partitions

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

(23)

• A proof of a conjecture of Singh and Barman on hook length
• Inequalities and asymptotics for hook lengths in -regular partitions and -distinct partitions
• Hook length and symplectic content in partitions
• Hook lengths in self-conjugate partitions
• Hook length biases in ordinary and \(t\)-regular partitions
• Some Conjectures and Open Problems on Partition Hook Lengths
• Inequalities and asymptotics for hook numbers in restricted partitions
• Proof of Singh and Barman's conjecture on hook length biases
• Hook-length biases in t-regular partitions
• Congruences for hook lengths of partitions
• Hook length inequalities for t-regular partitions in the t-aspect
• Local limit theorems for hook lengths in partitions
• Truncated theta series related to the Jacobi triple product identity
• The number of parts in a random t-regular partition
• Distribution of alternating sums of parts in partitions
• Inequalities on the total number of t-hooks of partitions
• On the hook length biases of the 2- and 3-regular partitions
• Hook length inequalities for t-regular partitions in the t-aspects. II
• Hook length bias in odd versus distinct partitions
• Finite analogs of partition bias related to hook length two and a variant of Sylvester's map
• Hook length biases for self-conjugate partitions and partitions with distinct odd parts
• Distribution of hooks in self-conjugate partitions
• Fixed hooks in arbitrary columns of partitions

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)