相关论文: A conjecture about partitions
We give a direct deduction and proof of two identities in the theory of plane partitions. The first one is known to enumerate the traces of plane partitions. The second one comes without any combinatorial interpretation.
The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for pm(n) for…
A variation on the splitting principle
A conjecture for higher order separation on generic rational surfaces with some new results about standard divisors.
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.
In his book Topics in Analytic Number Theory, Rademacher considered the generating function of partitions into at most $N$ parts, and conjectured certain limits for the coefficients of its partial fraction decomposition. We carry out an…
We obtain an exact formula for the cubic partition function and prove a conjecture by Banerjee, Paule, Radu and Zeng.
We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with…
The paper introduce a new type of partitions where the largest part appears exactly once, and the remaining parts constitute a partition of that largest part. We derive the generating function associated with these partitions and…
We announce a number of conjectures associated with and arising from a study of primes and irrationals in $\mathbb{R}$. All are supported by numerical verification to the extent possible.
Extending the partition function multiplicatively to a function on partitions, we show that it has a unique maximum at an explicitly given partition for any $n\neq 7$. The basis for this is an inequality for the partition function which…
A conjecture of Armstrong states that if $\gcd (a, b) = 1$, then the average size of an $(a, b)$-core partition is $(a - 1)(b - 1)(a + b + 1) / 24$. Recently, Stanley and Zanello used a recursive argument to verify this conjecture when $a =…
A conjecture concerning some pairs of interfering estimates for some integrals is formulated in three equivalent versions. Its importance for the the Paley problem for plurisubharmonic functions and for certain classes of extremal problems…
We provide, under minimal continuity assumptions, a description of \textsl{additive partition entropies}. They are real functions $I$ on the set of finite partitions that are additive on stochastically independent partitions in a given…
The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…
MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…
A new combinatorial object is introduced, the part-frequency matrix sequence of a partition, which is elementary to describe and is naturally motivated by Glaisher's bijection. We prove results that suggest surprising usefulness for such a…
In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For…
We present a simple bijection between permutation matrices and descending plane partitions without special parts. This bijection is already mentioned in work of P. Lalonde (without giving the details); it involves the inversion words of…
Several results about the union-closed sets conjecture are presented.