中文
相关论文

相关论文: The $(s,s+d,\dots,s+pd)$-core partitions and the r…

200 篇论文

A partition is called an $(s_1,s_2,\dots,s_p)$-core partition if it is simultaneously an $s_i$-core for all $i=1,2,\dots,p$. Simultaneous core partitions have been actively studied in various directions. In particular, researchers concerned…

组合数学 · 数学 2020-04-14 Hyunsoo Cho , JiSun Huh

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

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

In this paper, we study $(s,s+1)$-core partitions with $d$-distinct parts. We obtain results on the number and the largest size of such partitions, so we extend Xiong's paper in which the results are obtained about $(s,s+1)$-core partitions…

组合数学 · 数学 2019-11-26 Murat Sahin

Simultaneous bar-cores, core shifted Young diagrams (or CSYDs), and doubled distinct cores have been studied since Morris and Yaseen introduced the concept of bar-cores. In this paper, our goal is to give a formula for the number of these…

组合数学 · 数学 2022-05-05 Hyunsoo Cho , JiSun Huh , Hayan Nam , Jaebum Sohn

Amdeberhan conjectured that the number of $(s,s+2)$-core partitions with distinct parts for an odd integer $s$ is $2^{s-1}$. This conjecture was first proved by Yan, Qin, Jin and Zhou, then subsequently by Zaleski and Zeilberger. Since the…

组合数学 · 数学 2017-05-10 Jineon Baek , Hayan Nam , Myungjun Yu

Hooks are prominent in representation theory (of symmetric groups) and they play a role in number theory (via cranks associated to Ramanujan's congruences). A partition of a positive integer $n$ has a Young diagram representation. To each…

组合数学 · 数学 2015-07-14 Tewodros Amdeberhan , Emily Leven

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 develop a geometric approach to the study of $(s,ms-1)$-core and $(s,ms+1)$-core partitions through the associated $ms$-abaci. This perspective yields new proofs for results of H. Xiong and A. Straub (originally proposed by T.…

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

In this paper, we construct a bijection from a set of bounded free Motzkin paths to a set of bounded Motzkin prefixes that induces a bijection from a set of bounded free Dyck paths to a set of bounded Dyck prefixes. We also give bijections…

组合数学 · 数学 2022-06-01 Hyunsoo Cho , JiSun Huh , Hayan Nam , Jaebum Sohn

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

We investigate the number $N_{d,r}(s)$ of $(s, s+r)$-core integer partitions with $d$-distinct parts. Our first main result is a proof of a recurrence relation conjectured by Sahin in 2018. We also derive generating functions, asymptotics,…

组合数学 · 数学 2019-08-19 Noah Kravitz

Given a coprime pair $(m,n)$ of positive integers, rational Catalan numbers $\frac{1}{m+n} \binom{m+n}{m,n}$ counts two combinatorial objects:rational $(m,n)$-Dyck paths are lattice paths in the $m\times n$ rectangle that never go below the…

组合数学 · 数学 2015-04-22 Guoce Xin

The notion of $(a,b)$-cores is closely related to rational $(a,b)$ Dyck paths due to Anderson's bijection, and thus the number of $(a,a+1)$-cores is given by the Catalan number $C_a$. Recent research shows that $(a,a+1)$ cores with distinct…

组合数学 · 数学 2017-05-30 Kirill Paramonov

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

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

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

We explain a "curious symmetry" for maximal $(s-1,s+1)$-core partitions first observed by T. Amdeberhan and E. Leven. Specifically, using the $s$-abacus, we show such partitions have empty $s$-core and that their $s$-quotient is comprised…

组合数学 · 数学 2014-11-04 Rishi Nath

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

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
‹ 上一页 1 2 3 10 下一页 ›