Related papers: A generalisation of core partitions

Every partition of [[omega_1]^{< omega}]^2 into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite…

The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…

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…

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…

We study a natural generalization of the notion of cores for l-partitions attached with a multi-charge s $\in$ Z^l : the (e, s)-cores. We rely them both to the combinatorics and the notion of weight defined by Fayers. Next we study…

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…

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…

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…

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…

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…

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

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

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…

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…

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…

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…

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…

A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Motivated by this result,…

In this paper, we investigate the combinatorial properties of three classes of integer partitions: (1) $s$-modular partitions, a class consisting of partitions into parts with a number of occurrences (i.e., multiplicity) congruent to $0$ or…

A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Recently, both authors…