中文
相关论文

相关论文: The Catalan case of Armstrong's conjecture on simu…

200 篇论文

The study of core partitions has been very active in recent years, with the study of $(s,t)$-cores - partitions which are both $s$- and $t$-cores - playing a prominent role. A conjecture of Armstrong, proved recently by Johnson, says that…

组合数学 · 数学 2016-12-08 Matthew Fayers

Armstrong, Hanusa and Jones conjectured that if $s,t$ are coprime integers, then the average size of an $(s,t)$-core partition and the average size of a self-conjugate $(s,t)$-core partition are both equal to $\frac{(s+t+1)(s-1)(t-1)}{24}$.…

组合数学 · 数学 2014-05-12 William Y. C. Chen , Harry H. Y. Huang , Larry X. W. Wang

A conjecture of Armstrong states that if $\gcd (a, b) = 1$, then the average size of an $(a, b)$-core partition is $(a - 1)(b - 1)(a + b + 1) / 24$. Recently, Stanley and Zanello used a recursive argument to verify this conjecture when $a =…

组合数学 · 数学 2015-02-09 Amol Aggarwal

Johnson recently proved Armstrong's conjecture which states that the average size of an $(a,b)$-core partition is $(a+b+1)(a-1)(b-1)/24$. He used various coordinate changes and one-to-one correspondences that are useful for counting…

组合数学 · 数学 2017-11-07 Jineon Baek , Hayan Nam , Myungjun Yu

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

Fix coprime $s,t\ge1$. We re-prove, without Ehrhart reciprocity, a conjecture of Armstrong (recently verified by Johnson) that the finitely many simultaneous $(s,t)$-cores have average size $\frac{1}{24}(s-1)(t-1)(s+t+1)$, and that the…

组合数学 · 数学 2023-04-21 Victor Y. Wang

Motivated by Amdeberhan's conjecture on $(t,t+1)$-core partitions with distinct parts, various results on the numbers, the largest sizes and the average sizes of simultaneous core partitions with distinct parts were obtained by many…

组合数学 · 数学 2017-09-05 Huan Xiong

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…

组合数学 · 数学 2025-03-04 Huan Xiong , Lihong Yang

Simultaneous core partitions have attracted much attention since Anderson's work on the number of $(t_1,t_2)$-core partitions. In this paper we focus on simultaneous core partitions with distinct parts. The generating function of $t$-core…

组合数学 · 数学 2017-03-21 Huan Xiong

A special case of an elegant result due to Anderson proves that the number of $(s,s+1)$-core partitions is finite and is given by the Catalan number $C_s$. Amdeberhan recently conjectured that the number of $(s,s+1)$-core partitions into…

组合数学 · 数学 2016-01-27 Armin Straub

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

Simultaneous core partitions are important objects in algebraic combinatorics. Recently there has been interest in studying the distribution of sizes among all $(s,t)$-cores for coprime $s$ and $t$. Zaleski (2017) gave strong evidence that…

组合数学 · 数学 2018-09-05 János Komlós , Emily Sergel , Gábor Tusnády

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

In this paper we prove that Amdeberhan's conjecture on the largest size of $(t, t+1, t+2)$-core partitions is true. We also show that the number of $(t, t + 1, t + 2)$-core partitions with the largest size is $1$ or $2$ based on the parity…

组合数学 · 数学 2015-01-08 Huan Xiong

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

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

In 2016, Nath and Sellers proposed a conjecture regarding the precise largest size of ${(s,ms-1,ms+1)}$-core partitions. In this paper, we prove their conjecture. One of the key techniques in our proof is to introduce and study the…

组合数学 · 数学 2024-03-06 Yetong Sha , Huan Xiong

We give a bijection between the set of self-conjugate partitions and that of ordinary partitions. Also, we show the relation between hook lengths of self conjugate partition and corresponding partition via the bijection. As a corollary, we…

组合数学 · 数学 2018-11-27 Hyunsoo Cho , JiSun Huh , Jaebum Sohn

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

Anderson established a connection between core partitions and order ideals of certain posets by mapping a partition to its $\beta$-set. In this paper, we give a characterization of the poset $P_{(s,s+1,s+2)}$ whose order ideals correspond…

组合数学 · 数学 2014-07-10 Jane Y. X. Yang , Michael X. X. Zhong , Robin D. P. Zhou
‹ 上一页 1 2 3 10 下一页 ›