中文
相关论文

相关论文: Average Size of a Self-conjugate (s, t)-Core Parti…

200 篇论文

There is a well-studied correspondence by Jaclyn Anderson between partitions that avoid hooks of length s or t and certain binary strings of length s+t. Using this map, we prove that the total size of a random partition of this kind…

组合数学 · 数学 2021-09-14 Chaim Even-Zohar

Suppose $s$ and $t$ are coprime natural numbers. A theorem of Olsson says that the $t$-core of an $s$-core partition is again an $s$-core. We generalise this theorem, showing that the $s$-weight of the $t$-core of a partition $\lambda$ is…

组合数学 · 数学 2014-05-14 Matthew Fayers

We extend recent results of Ono and Raji, relating the number of self-conjugate $7$-core partitions to Hurwitz class numbers. Furthermore, we give a combinatorial explanation for the curious equality $2\operatorname{sc}_7(8n+1) =…

数论 · 数学 2021-02-16 Kathrin Bringmann , Ben Kane , Joshua Males

Amdeberhan conjectured that the number of $(t,t+1, t+2)$-core partitions is $\sum_{0\leq k\leq [\frac{t}{2}]}\frac{1}{k+1}\binom{t}{2k}\binom{2k}{k}$. In this paper, we obtain the generating function of the numbers $f_t$ of $(t, t + 1, ...,…

组合数学 · 数学 2014-10-14 Huan Xiong

Simultaneous core partitions have been widely studied since Anderson's work on the enumeration of $(s,t)$-core partitions. Amdeberhan and Leven showed that the number of $(s,s+1, \ldots, s+k)$-core partitions is equal to the number of $(s,…

组合数学 · 数学 2019-05-03 Sherry H. F. Yan , Yao Yu , Hao Zhou

Fix $t \geq 2$. We first give an asymptotic formula for certain sums of the number of $t$-cores. We then use this result to compute the distribution of the size of the $t$-core of a uniformly random partition of an integer $n$. We show that…

概率论 · 数学 2023-02-28 Arvind Ayyer , Shubham Sinha

A recent paper by Hanusa and Nath states many conjectures in the study of self-conjugate core partitions. We prove all but two of these conjectures asymptotically by number-theoretic means. We also obtain exact formulas for the number of…

组合数学 · 数学 2014-03-05 Levent Alpoge

For fixed s, the size of an (s, s+1)-core partition with distinct parts can be seen as a random variable X_s. Using computer-assisted methods, we derive formulas for the expectation, variance, and higher moments of X_s. Our results give…

组合数学 · 数学 2016-11-24 Anthony Zaleski

An n-core partition is an integer partition whose Young diagram contains no hook lengths equal to n. We consider partitions that are simultaneously a-core and b-core for two relatively prime integers a and b. These are related to abacus…

组合数学 · 数学 2014-04-23 Drew Armstrong , Christopher R. H. Hanusa , Brant C. Jones

Core partitions have attracted much attention since Anderson's work (2002) on the number of $(s,t)$-core partitions for coprime $s,t$. Recently, there has been a growing interest in studying the limiting distributions of the sizes of random…

概率论 · 数学 2024-12-31 Jiange Li , Yetong Sha , Huan Xiong

For a positive integer $t \geq 2$, the $t$-core of a partition plays an important role in modular representation theory and combinatorics. We initiate the study of $t$-cores of partitions contained in an $r \times s$ rectangle. Our main…

组合数学 · 数学 2024-04-30 Arvind Ayyer , Shubham Sinha

We observe that for a and b relatively prime, the "abacus construction" identifies the set of simultaneous (a,b)-core partitions with lattice points in a rational simplex. Furthermore, many statistics on (a,b)-cores are piecewise polynomial…

组合数学 · 数学 2015-06-24 Paul Johnson

We are concerned with counting self-conjugate $(s,s+1,s+2)$-core partitions. A Motzkin path of length $n$ is a path from $(0,0)$ to $(n,0)$ which stays above the $x$-axis and consists of the up $U=(1,1)$, down $D=(1,-1)$, and flat $F=(1,0)$…

组合数学 · 数学 2019-04-05 Hyunsoo Cho , JiSun Huh , Jaebum Sohn

In this paper, we are mainly concerned with the enumeration of $(2k+1, 2k+3)$-core partitions with distinct parts. We derive the number and the largest size of such partitions, confirming two conjectures posed by Straub.

组合数学 · 数学 2016-04-14 Sherry H. F. Yan , Guizhi Qin , Zemin Jin , Robin D. P. Zhou

Using a combinatorial bijection with certain abaci diagrams, Nath and Sellers have enumerated $(s, m s \pm 1)$-core partitions into distinct parts. We generalize their result in several directions by including the number of parts of these…

组合数学 · 数学 2019-10-15 Hannah E. Burson , Simone Sisneros-Thiry , Armin Straub

We study generating functions which count the sizes of $t$-cores of partitions, and, more generally, the sizes of higher rows in $t$-core towers. We then use these results to derive an asymptotic for the average size of the $t$-defect of…

数论 · 数学 2015-09-23 Larry Rolen

We classify the connection between $t$-cores and self-conjugate $t$-cores to sums of squares. To do so, we provide explicit maps between $t$-core partitions and self-conjugate $t$-core partitions of a positive integer $n$ to representations…

组合数学 · 数学 2022-04-20 Joshua Males , Zack Tripp

If s and t are relatively prime positive integers we show that the s-core of a t-core partition is again a t-core partition

组合数学 · 数学 2008-02-01 J. B. Olsson

Integer partitions which are simultaneously $t$--cores for distinct values of $t$ have attracted significant interest in recent years. When $s$ and $t$ are relatively prime, Olsson and Stanton have determined the size of the maximal…

组合数学 · 数学 2024-05-31 Rishi Nath , James A. Sellers

Inspired by Armin Straub's conjecture (arXiv:1601.07161) about the number and maximal size of (2n+1, 2n+3)-core partitions with distinct parts, we develop relatively efficient, symbolic-computational algorithms, based on non-linear…

组合数学 · 数学 2016-12-12 Anthony Zaleski , Doron Zeilberger