Table of Contents
Fetching ...

A Self-Conjugate Partition Analog of $(t,t+1)$-Core Partitions with Distinct Parts

Huan Xiong, Lihong Yang

TL;DR

This work introduces a proper self-conjugate analogue \mathcal{DS}(t) of $(t,t+1)$-core partitions with distinct parts by focusing on self-conjugate partitions whose first Durfee-square parts are distinct. It develops an enumerative framework via the statistics $f(t)=|\mathcal{DS}(t)|$, $g(t)$ (sum of main-diagonal hook lengths), and $h(t)$ (sum of partition sizes), deriving recurrences $f(t)=f(t-1)+f(t-3)$, $g(t)=g(t-1)+g(t-3)+f(t-3)$, and $h(t)=2t\,g(t-1)+(2t-2)g(t-3)-h(t-1)-h(t-3)+f(t-3)$, with explicit generating functions $F(x)=1/(1-x-x^3)$, $G(x)=x^3F(x)/(1-x-x^3)$, and a formula for $H(x)$. The paper then determines the structure of maximum-size partitions in \mathcal{DS}(t): $2t-1$ must appear in $MD(\lambda)$, certain small diagonal hooks are excluded, and the maximal size $m(t)$ is given by a parity- and residue-based piecewise formula involving $t$ and $\left\lfloor\frac{2t+1}{12}\right\rfloor$, with a unique maximizing partition. Together, these results provide a coherent self-conjugate analogue to the classical $(t,t+1)$-core distinct-part theory and yield explicit counts and extremal sizes for this family.

Abstract

Simultaneous core partitions have been widely studied in the past 20 years. In 2013, Amdeberhan gave several conjectures on the number, the average size, and the largest size of $(t,t+1)$-core partitions with distinct parts, which was proved and generalized by Straub, Xiong, Nath-Sellers, Zaleski-Zeilberger, Paramonov, and many other mathematicians. In this paper, we introduce a proper self-conjugate partition analog of $(t,t+1)$-core partitions with distinct parts, and derive the number, the average size, and the largest size for such core partitions.

A Self-Conjugate Partition Analog of $(t,t+1)$-Core Partitions with Distinct Parts

TL;DR

This work introduces a proper self-conjugate analogue \mathcal{DS}(t) of -core partitions with distinct parts by focusing on self-conjugate partitions whose first Durfee-square parts are distinct. It develops an enumerative framework via the statistics , (sum of main-diagonal hook lengths), and (sum of partition sizes), deriving recurrences , , and , with explicit generating functions , , and a formula for . The paper then determines the structure of maximum-size partitions in \mathcal{DS}(t): must appear in , certain small diagonal hooks are excluded, and the maximal size is given by a parity- and residue-based piecewise formula involving and , with a unique maximizing partition. Together, these results provide a coherent self-conjugate analogue to the classical -core distinct-part theory and yield explicit counts and extremal sizes for this family.

Abstract

Simultaneous core partitions have been widely studied in the past 20 years. In 2013, Amdeberhan gave several conjectures on the number, the average size, and the largest size of -core partitions with distinct parts, which was proved and generalized by Straub, Xiong, Nath-Sellers, Zaleski-Zeilberger, Paramonov, and many other mathematicians. In this paper, we introduce a proper self-conjugate partition analog of -core partitions with distinct parts, and derive the number, the average size, and the largest size for such core partitions.

Paper Structure

This paper contains 3 sections, 13 theorems, 23 equations, 7 figures, 2 tables.

Key Result

Theorem 1.1

(see tamdStraubXiong2) Let $t\geq 1$ be a given positive integer and $(F_i)_{i\geq 1}=(1,1,2,3,5,8,13,\ldots)$ be the Fibonacci numbers. We have the following results for $(t, t + 1)$-core partitions with distinct parts.

Figures (7)

  • Figure 1: The Young diagram and the hook lengths of a self-conjugate partition $(6,4,2,2,1,1)$.
  • Figure 2: An example of Case 1.
  • Figure 3: An example of Case 2.
  • Figure 4: The representation of $\mathrm{Q}_{12}^{l}$ and $\mathrm{Q}_{12}^{r}.$
  • Figure 5: The representation of $MD(\lambda)=\{47,43,39,35,29,23,17\}$.
  • ...and 2 more figures

Theorems & Definitions (14)

  • Theorem 1.1
  • Theorem 1.2
  • Theorem 1.3
  • Remark 1.4
  • Theorem 2.1
  • Lemma 2.2
  • Lemma 2.3
  • Theorem 2.4
  • Lemma 2.5
  • Lemma 3.1
  • ...and 4 more