Asymptotics for $t$-Core Partitions and Stanton's Conjecture
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909994807459840 |
|---|---|
| author | Tyler, Matthew |
| author_facet | Tyler, Matthew |
| contents | A partition is a $t$-core partition if $t$ is not one of its hook lengths. Let $c_t(N)$ be the number of $t$-core partitions of $N$. In 1999, Stanton conjectured $c_t(N) \le c_{t+1}(N)$ if $4 \le t \ne N-1$. This was proved for $t$ fixed and $N$ sufficiently large by Anderson, and for small values of $t$ by Kim and Rouse. In this paper, we prove Stanton's conjecture in general. Our approach is to find a saddle point asymptotic formula for $c_t(N)$, valid in all ranges of $t$ and $N$. This includes the known asymptotic formulas for $c_t(N)$ as special cases, and shows that the behavior of $c_t(N)$ depends on how $t^2$ compares in size to $N$. For example, our formula implies that if $t^2 = κN + o(t)$, then $c_t(N) = \frac{\exp\left(2π\sqrt{A N}\right)}{B N} (1 + o(1))$ for suitable constants $A$ and $B$ defined in terms of $κ$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_02982 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Asymptotics for $t$-Core Partitions and Stanton's Conjecture Tyler, Matthew Number Theory Combinatorics 11P82 A partition is a $t$-core partition if $t$ is not one of its hook lengths. Let $c_t(N)$ be the number of $t$-core partitions of $N$. In 1999, Stanton conjectured $c_t(N) \le c_{t+1}(N)$ if $4 \le t \ne N-1$. This was proved for $t$ fixed and $N$ sufficiently large by Anderson, and for small values of $t$ by Kim and Rouse. In this paper, we prove Stanton's conjecture in general. Our approach is to find a saddle point asymptotic formula for $c_t(N)$, valid in all ranges of $t$ and $N$. This includes the known asymptotic formulas for $c_t(N)$ as special cases, and shows that the behavior of $c_t(N)$ depends on how $t^2$ compares in size to $N$. For example, our formula implies that if $t^2 = κN + o(t)$, then $c_t(N) = \frac{\exp\left(2π\sqrt{A N}\right)}{B N} (1 + o(1))$ for suitable constants $A$ and $B$ defined in terms of $κ$. |
| title | Asymptotics for $t$-Core Partitions and Stanton's Conjecture |
| topic | Number Theory Combinatorics 11P82 |
| url | https://arxiv.org/abs/2406.02982 |