Related papers: Another proof of the $n!$ conjecture

This article concerns two conjectures of M. P. Murthy. For Murthy's conjecture on complete intersections, the major breakthrough has still been the result proved by Mohan Kumar in 1978. In this article we improve "Mohan Kumar's bound" when…

In the paper [J. Combin. Theory Ser. A 43 (1986), 103--113], Stanley gives formulas for the number of plane partitions in each of ten symmetry classes. This paper together with results by Andrews [J. Combin. Theory Ser. A 66 (1994), 28-39]…

In 1996, my brilliant student John Noonan, discovered, and proved that there are 3(2n)!/(n(n+3)!(n-3)!) ways to line-up n people of different heights in such a way that out of the n(n-1)(n-2)/6 possible triples of people exactly one is such…

A result of Deza, Levin, Meesum, and Onn shows that the problem of deciding if a given sequence is the degree sequence of a 3-uniform hypergraph is NP complete. We tackle this problem in the random case and show that a random integer…

The middle levels conjecture asserts that there is a Hamiltonian cycle in the middle two levels of $2k+1$-dimensional hypercube. The conjecture is known to be true for $k \leq 17$ [I.Shields, B.J.Shields and C.D.Savage, Disc. Math., 309,…

In 1933, Borsuk proposed the following problem: Can every bounded set in $\mathbb{E}^n$ be divided into $n+1$ subsets of smaller diameters? This problem has been studied by many authors, and a lot of partial results have been discovered. In…

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…

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…

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…

In 2021 da Silva, Hirschhorn, and Sellers studied a wide variety of congruences for the $k$-elongated plane partition function $d_k(n)$ by various primes. They also conjectured the existence of an infinite congruence family modulo…

The rank of partitions play an important role in the combinatorial interpretations of several Ramanujan's famous congruence formulas. In 2005 and 2008, the $D$-rank and $M_2$-rank of an overpartition were introduced by Lovejoy,…

In this paper we prove a new result about partitioning coloured complete graphs and use it to determine certain Ramsey numbers exactly. The partitioning theorem we prove is that for k at least 1, in every edge colouring of a complete graph…

We give a proof of the planar case of a longstanding conjecture of Kneser (1955) and Poulsen (1954). In fact, we prove more by showing that if a finite set of disks in the plane is rearranged so that the distance between each pair of…

Elementary proofs are given for sums of Schur functions over partitions into at most n parts each less than or equal to m for which i) all parts are even, ii) all parts of the conjugate partition are even. Also, an elementary proof of a…

Kneser's 1955 conjecture -- proven by Lov\'asz in 1978 -- asserts that in any partition of the $k$-subsets of $\{1, 2, \dots, n\}$ into $n-2k-3$ parts, one part contains two disjoint sets. Schrijver showed that one can restrict to…

We study certain bijection between plane partitions and $\mathbb{N}$-matrices. As applications, we prove a Cauchy-type identity for generalized dual Grothendieck polynomials. We introduce two statistics on plane partitions, whose generating…

In 2003, Maroti showed that one could use the machinery of l-cores and l-quotients of partitions to establish lower bounds for p(n), the number of partitions of n. In this paper we explore these ideas in the case l=2, using them to give a…

We find the number of partitions of $n$ whose BG-rank is $j$, in terms of $pp(n)$, the number of pairs of partitions whose total number of cells is $n$, giving both bijective and generating function proofs. Next we find congruences mod 5…

We give a product formula for the number of shifted plane partitions of shifted double staircase shape with bounded entries. This is the first new example of a family of shapes with a plane partition product formula in many years. The proof…

We prove that the partition function $p(n)$ is log-concave for all $n>25$. We then extend the results to resolve two related conjectures by Chen. The proofs are based on Lehmer's estimates on the remainders of the Hardy--Ramanujan and the…