Related papers: A conjecture about partitions
We explain a conjecture relating the monster simple group to an algebraic variety that was discovered in a non-monstrous context.
In "Square partitions and Catalan numbers" (arXiv0912.4983), Bennett et al. presented a recursive algorithm to create a family of partitions from one or several partitions. They were mainly interested in the cases when we begin with a…
We will prove an infinite family of asymptotic formulas for the logarithm of certain two-colored partitions. An infinite sub-family of these asymptotics was posed as a conjecture by Guadalupe.
In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…
In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…
Partitions with initial repetitions were introduced by George Andrews. We consider a subclass of these partitions and find Legendre theorems associated with their respective partition functions. The results in turn provide partition…
We establish a Pythagorean theorem for the absolute values of the blocks of a partitioned matrix. This leads to a series of remarkable operator inequalities.
We conjecture an algorithm to construct spin multipartitions and prove that all the level one Fock spaces using our combinatorics are modules over the quantum enveloping algebra.
The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…
This note rederives a formula for $r$-color partitions, $1 \le r \le 24$, including Rademacher's celebrated result for ordinary partitions, from the duality between modular forms of weights $-r/2$ and $2+r/2$.
If A is infinite and well-ordered, then |2^A|<=|Part(A)|<=|A^A|.
We derive a formula for $p(n)$ (the number of partitions of $n$) in terms of the partial Bell polynomials using Fa\`{a} di Bruno's formula and Euler's pentagonal number theorem.
We Define moments of partitions of integers, and show that they appear in higher order derivatives of certain combinations of functions.
Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.
We formulate and discuss a conjecture which would extend a classical inequality of Bernstein.
In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and…
The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…
In this article we encode Hadwiger's covering conjecture and Borsuk's partition conjecture into continuous functions defined on the spaces of convex bodies, propose a four-step program to approach them, and obtain some partial results.
The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…
We present conjectured candidates for the least perimeter partition of a disc into $N \le 10$ regions which take one of two possible areas. We assume that the optimal partition is connected, and therefore enumerate all three-connected…