中文
相关论文

相关论文: The t-core of an s-core

200 篇论文

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

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

If $s$ and $t$ are relatively prime J. Olsson proved in 2008 that the $s$-core of a $t$-core partition is again a $t$-core partition, and that the $s$-bar-core of a $t$-bar-core partition is again a $t$-bar-core partition. Here generalized…

组合数学 · 数学 2013-01-09 Jean-Baptiste Gramain , Rishi Nath

We introduce the idea of (s,t)-closure and delta-sets and show that (s,t)-closed beta-sets which are contained set-wise in (s,t)-closed delta-sets are also contained partition-wise. This implies the maximal (s,t)-core partition theorem of…

组合数学 · 数学 2008-09-15 Joseph Vandehey

A partition is a $\bar{s}$-core if it is the result of removing all of the $s$-bars from a partition. We extend a method of Olsson and Bessenrodt to determine the number of even partitions that are simultaneously $\bar{s}$-core and…

表示论 · 数学 2016-09-06 Calvin Deng

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

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

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

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

In 2007, Olsson and Stanton gave an explicit form for the largest $(a, b)$-core partition, for any relatively prime positive integers $a$ and $b$, and asked whether there exists an $(a, b)$-core that contains all other $(a, b)$-cores as…

组合数学 · 数学 2014-11-27 Amol Aggarwal

A tremendous amount of research has been done in the last two decades on $(s,t)$-core partitions when $s$ and $t$ are positive integers with no common divisor. Here we change perspective slightly and explore properties of $(s,t)$-core and…

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

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

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

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

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

A partition of a positive integer $n$ is said to be $t$-core if none of its hook lengths are divisible by $t$. Recently, two analogues, $\overline{a}_t(n)$ and $\overline{b}_t(n)$, of the $t$-core partition function, $c_t(n)$, have been…

数论 · 数学 2024-05-10 Pranjal Talukdar

An integer partition of a positive integer $n$ is called to be $t$-core if none of its hook lengths are divisible by $t$. Recently, Gireesh, Ray and Shivashankar [`A new analogue of $t$-core partitions', \textit{Acta Arith.} \textbf{199}…

数论 · 数学 2024-05-01 Pranjal Talukdar

A conjecture on the monotonicity of t-core partitions in an article of Stanton [Open positivity conjectures for integer partitions, Trends Math., 2:19-25, 1999] has been the catalyst for much recent research on t-core partitions. We…

数论 · 数学 2015-03-20 Christopher R. H. Hanusa , Rishi Nath

This note introduces some bijections relating core partitions and tuples of integers. We apply these bijections to count the number of cores with various types of restriction, including fixed number of parts, limited size of parts, parts…

组合数学 · 数学 2019-11-20 Hao Zhong
‹ 上一页 1 2 3 10 下一页 ›