Related papers: Proof of a partition identity conjectured by Lassa…
We answer a question of Zeilberger and Zeilberger about certain partition statistics.
In this paper we give an elementary proof of the Zariski-Lipman conjecture for log canonical spaces.
Following the ideas of Rosenbloom [7] and Hayman [5], Luis B\'aez-Duarte gives in [1] a probabilistic proof of Hardy-Ramanujan's asymptotic formula for the partitions of an integer. The main principle of the method relies on the convergence…
Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…
Say that mu is a ``subpartition'' of an integer partition lambda if the multiset of parts of mu is a submultiset of the parts of lambda, and define an integer partition lambda to be ``wide'' if for every subpartition mu of lambda, mu >= mu'…
Following the work of Jean-Loup Waldspurger, we prove the epsilon dichotomy part of the local Gross-Prasad conjecture over $\mathbb{R}$ for tempered local $L$-parameters.
We provide a proof of the Borwein Conjecture using analytic methods.
Simion had a unimodality conjecture concerning the number of lattice paths in a rectangular grid with the Ferrers diagram of a partition removed. Hildebrand recently showed the stronger result that these numbers are log concave. Here we…
We prove that a curious generating series identity implies Faber's intersection number conjecture (by showing that it implies a combinatorial identity already given in arXiv:1902.02742) and give a new proof of Faber's conjecture by directly…
Euler's classic partition identity states that the number of partitions of $n$ into odd parts equals the number of partitions of $n$ into distinct parts. We develop a new generalization of this identity, which yields a previous…
We prove three main conjectures of Berkovich and Uncu (Ann. Comb. 23 (2019) 263--284) on the inequalities between the numbers of partitions of $n$ with bounded gap between largest and smallest parts for sufficiently large $n$. Actually our…
In this paper, we give a bijective proof of the reduced lecture hall partition theorem. It is possible to extend this bijection in lecture hall partition theorem. And refined versions of each theorems are also presented.
In this note, we provide a conceptual explanation of a well-known polynomial identity used in algebraic number theory.
The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…
We prove seven of the Rogers-Ramanujan type identities modulo $12$ that were conjectured by Kanade and Russell. Included among these seven are the two original modulo $12$ identities, in which the products have asymmetric congruence…
In our previous paper, we determined a unified combinatorial framework to look at a large number of colored partition identities, and studied the five identities corresponding to the exceptional modular equations of prime degree of the…
A conjecture is given that, if true, could lead to an algorithm for computing definite sums of rational functions.
In this short note we present a class of conjectures on partitions of integers as summations of primes, which are extensions of Goldbach conjecture.
In this paper a new conjecture equivalent to Collatz conjecture is presented. In particural, showing that (all) the solution(s) of newly introduced iterative functional equation(s) have a given property is equivalent to prove Collatz…
Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of…