Related papers: A conjecture about partitions

We provide a short proof of the 1-dimensional flat chain conjecture.

We give a counterexample to a recently conjectured variant of the Penrose inequality.

The article provides a counterexample to a conjecture by Blocki-Zwonek.

The union-closed sets conjecture, also known as Frankl's conjecture, is a well-studied problem with various formulations. In terms of lattices, the conjecture states that every finite lattice $L$ with more than one element contains a…

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

We outline an approach to prove the two dimensional Jacobian Conjecture using the theory of fractals.

Some formulas and speculations are presented relative to integrable systems and quantum mechanics.

We demonstrate that statistics for several types of set partitions are described by generating functions which appear in the theory of integrable equations.

We give a new simple geometric proof that any seven points in the plane have four Tverberg partitions into three sets. This is the only confirmed non-trivial case of Sierksma's conjecture. Earlier proofs, by Stephan Hell, relied on…

By jagged partitions we refer to an ordered collection of non-negative integers $(n_1,n_2,..., n_m)$ with $n_m\geq p$ for some positive integer $p$, further subject to some weakly decreasing conditions that prevent them for being genuine…

In this paper, we prove a conjecture of Schnell in the surface case.

In this paper we present a new formula for the number of unrestricted partitions of $n$. We do this by introducing a correspondence between the number of unrestrited partitions of $n$ and the number of non-negative solutions of systems of…

We propose a subconjecture that implies the semiampleness conjecture for quasi-numerically positive log canonical divisors and prove the semiampleness in some elementary cases.

The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…

An important conjecture in additive combinatorics, number theory, and algebraic geometry posits that the partition rank and analytic rank of tensors are equal up to a constant, over any finite field. We prove the conjecture up to a…

We present an involution on set partitions that interchanges two statistics related to relative size of block entries and use it to establish an equidistribution on objects counted by the Bessel numbers.

In this paper we obtain a partial answer to a conjecture on the solvabilty of linear difference equations in quasianalytic Carleman classes.

In a previous paper of the second author with K. Ono, surprising multiplicative properties of the partition function were presented. Here, we deal with $k$-regular partitions. Extending the generating function for $k$-regular partitions…

In this note, we provide a short proof of Feige's conjecture for identically distributed random variables.

E394 in the Enestrom index. Translated from the Latin original, "De partitione numerorum in partes tam numero quam specie datas" (1768). Euler finds a lot of recurrence formulas for the number of partitions of $N$ into $n$ parts from some…