相关论文: A Comparison of Pair and Triple Partition Relation…
New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.
Let $\overline{p}_o(n)$ denote the number of overpartitions of $n$ into odd parts. The partition function $\overline{p}_o(n)$ has been the subject of many recent studies where many explicit Ramanujan-like congruences were discovered. In…
We list some open problems, concerning the polarized partition relation. We solve a couple of them by showing that for every singular cardinal $\mu$ one can force the strong polarized relation with respect to the pair $\mu^+,\mu$.
In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…
This article introduces recursive relations allowing the calculation of the number of partitions with constraints on the minimum and/or on the maximum fragment size.
A semigroup conjugacy is an equivalence relation that equals group conjugacy when the semigroup is a group. In this note, we answer five open problems related to semigroup conjugacy. (Problem One) We say a conjugacy ~ is partition-covering…
Recently, Andrews considered the partitions with parts separated by parity, in which parts of a given parity are all smaller than those of the other parity. Inspired from the partitions with parts separated by parity, we investigate the…
In this paper, we extend the work of Andrews, Beck and Hopkins by considering partitions and compositions with bounded gaps between each pair of consecutive parts. We show that both their generating functions and two matrices determined by…
Let $A_{3}(n)$ (resp. ${{B}_{3}}(n)$) denote the number of partition pairs (resp. triples) of $n$ where each partition is 3-core. By applying Ramanujan's ${}_{1}\psi_{1}$ formula and Bailey's ${}_{6}\psi_{6}$ formula, we find the explicit…
We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…
We develop the theory of copartitions, which are a generalization of partitions with connections to many classical topics in partition theory, including Rogers-Ramanujan partitions, theta functions, mock theta functions, partitions with…
We give a definition of partition C*-algebras: To any partition of a finite set, we assign algebraic relations for a matrix of generators of a universal C*-algebra. We then prove how certain relations may be deduced from others and we…
A scalar integer partition problem asks for a number of nonnegative integer solutions to a linear Diophantine equation with integer positive coefficients. The manuscript discusses an algorithm of derivation of linear relations involving the…
We study partitions of totally positive integers in real quadratic fields. We develop an algorithm for computing the number of partitions, prove a result about the parity of the partition function, and characterize the quadratic fields such…
We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…
The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…
Almost nothing is known about the parity of the partition function $p(n)$, which is conjectured to be random. Despite this expectation, Ono surprisingly proved the existence of infinitely many linear dependence congruence relations modulo 4…
We define the category of partitioned binary relations and show that it contains many classical diagram categories, including categories of binary relations, maps, injective maps, partitions, (oriented) Brauer diagrams and (oriented)…
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…
In his recent work, Andrews revisited two-color partitions with certain restrictions on the differences between consecutive parts, and he established three theorems linking these two-color partitions with more familiar kinds of partitions.…