相关论文: A theorem on the cores of partitions

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…

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…

We consider the $t$-core of an $s$-core partition, when $s$ and $t$ are coprime positive integers. Olsson has shown that the $t$-core of an $s$-core is again an $s$-core, and we examine certain actions of the affine symmetric group on…

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…

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…

Partition theory abounds with bijections between different types of partitions. One of the most famous partition bijections maps each self-conjugate partition of a positive integer $n$ to a partition of $n$ into distinct odd parts, and vice…

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, ...,…

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…

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…

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…

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…

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…

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…

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…

Jaclyn Anderson proved that if s and t are relatively prime positive integers, then there are exactly (s+t-1)!/(s!t!) partitions whose set of hook-lengths is disjoint from the set {s,t}. Drew Armstrong conjectured (and Paul Johnson, and a…

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}…

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…

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…

Let $s,t$ be natural numbers, and fix an $s$-core partition $\sigma$ and a $t$-core partition $\tau$. Put $d=\gcd(s,t)$ and $m= lcm(s,t)$, and write $N_{\sigma, \tau}(k)$ for the number of $m$-core partitions of length no greater than $k$…

Suppose $s$ and $t$ are coprime positive integers, and let $\sigma$ be an $s$-core partition and $\tau$ a $t$-core partition. In this paper we consider the set $\mathcal P_{\sigma,\tau}(n)$ of partitions of $n$ with $s$-core $\sigma$ and…