Table of Contents
Fetching ...

Hook length biases for self-conjugate partitions and partitions with distinct odd parts

Catherine Cossaboom

Abstract

We establish a hook length bias between self-conjugate partitions and partitions of distinct odd parts, demonstrating that there are more hooks of fixed length $t \geq 2$ among self-conjugate partitions of $n$ than among partitions of distinct odd parts of $n$ for sufficiently large $n$. More precisely, we derive asymptotic formulas for the total number of hooks of fixed length $t$ in both classes. This resolves a conjecture of Ballantine, Burson, Craig, Folsom, and Wen.

Hook length biases for self-conjugate partitions and partitions with distinct odd parts

Abstract

We establish a hook length bias between self-conjugate partitions and partitions of distinct odd parts, demonstrating that there are more hooks of fixed length among self-conjugate partitions of than among partitions of distinct odd parts of for sufficiently large . More precisely, we derive asymptotic formulas for the total number of hooks of fixed length in both classes. This resolves a conjecture of Ballantine, Burson, Craig, Folsom, and Wen.

Paper Structure

This paper contains 18 sections, 23 theorems, 123 equations, 4 figures.

Key Result

Theorem 1.2

Conjecture conj is true.

Figures (4)

  • Figure 1: Hook numbers for the partition (5,3,2)
  • Figure 2: Values of $\gamma_t^*$ for various $t$
  • Figure 3: Arm, coarm, leg, and coleg length of $\lambda = (10,9,9,9,8,5,1,1)$
  • Figure 4: Regions $A$, $B$, $C$, and $D$ of $\lambda = (10,9,9,9,8,5,1,1)$

Theorems & Definitions (35)

  • Conjecture 1.1: Ballantine--Burson--Craig--Folsom--Wen, Craig--Dawsey--Han
  • Theorem 1.2
  • Theorem 1.3
  • Theorem 1.4
  • Theorem 2.1: AAOS
  • Theorem 2.2
  • Proposition 3.1
  • Proposition 3.2
  • Proposition 3.3
  • Proposition 3.4
  • ...and 25 more