相关论文: Simultaneous core partitions with nontrivial commo…

The Frobenius symbol was first introduced in 1900 by Frobenius as a way to encode an integer partition. In 1941, motivated by the modular representation theory of the symmetric group, Nakayama introduced the idea of a p-core partition, for…

Tewodros Amdeberhan and Armin Straub initiated the study of enumerating subfamilies of the set of (s,t)-core partitions. While the enumeration of (n+1,n+2)-core partitions into distinct parts is relatively easy (in fact it equals the…

A partition is a $t$-core partition if $t$ is not one of its hook lengths. Let $c_t(N)$ be the number of $t$-core partitions of $N$. In 1999, Stanton conjectured $c_t(N) \le c_{t+1}(N)$ if $4 \le t \ne N-1$. This was proved for $t$ fixed…

Higher-order notions of Kreweras complementation have appeared in the literature in the works of Krawczyk, Speicher, Mastnak, Nica, Arizmendi, Vargas, and others. While the theory has been developed primarily for specific applications in…

Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions…

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…

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…

We study the function M(t,n) = Floor[ 1 / {t^(1/n)} ], where t is a positive real number, Floor[.] and {.} are the floor and fractional part functions, respectively. In a recent article in the Monthly, Nathanson proved that if log(t) is…

Recently, Gireesh, Ray, and Shivashankar studied an analog, $\overline{a}_t(n)$, of the $t$-core partition function, $c_t(n)$. In this paper, we study the function $\overline{a}_5(n)$ in conjunction with $c_5(n)$ as well as another…

Let ${{B}_{3}}(n)$ denote the number of partition triples of $n$ where each partition is 3-core. With the help of generating function manipulations, we find several infinite families of arithmetic identities and congruences for…

We study the generating function of the excess number of Rogers-Ramanujan partitions with odd rank over those with even rank, and, using combinatorial and analytical techniques, show that this generating function is closely connected with…

We utilize false theta function results of Nathan Fine to discover three new partition identities involving weights. These relations connect G\"ollnitz--Gordon type partitions and partitions with distinct odd parts, partitions into distinct…

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…

A partition is $t$-regular if none of its parts is divisible by $t$. Let $p(N,t)$ be the number of $(t+1)$-regular partitions of a positive integer $N$. In 1971, Hagis proved an asymptotic formula for $p(N,t)$ using the circle method, when…

The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…

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

Partitions with distinct even parts have long been the subject of extensive research. In this paper, We present some new perspectives on such partitions from a combinatorial viewpoint, and connect them with signed partitions and bicolored…

For positive integers $k, l \geq 2$, the set of $k$-regular partitions in which parts appear at most $l$ times has attracted a lot of interest in that a composition of Glaisher's mapping can be used to prove the associated partition…

The Littlewood decomposition for partitions is a well-known bijection between partitions and pairs of $t$-core and $t$-quotient partitions. This decomposition can be described in several ways, such as the $t$-abacus method of James or the…

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…