English
Related papers

Related papers: A new approach to the Dyson rank conjectures

200 papers

In 2015 Choi, Kim, and Lovejoy studied a weighted partition function, $A_1(m)$, which counted subpartitions with a structure related to the Rogers--Ramanujan identities. They conjectured the existence of an infinite class of congruences for…

Number Theory · Mathematics 2020-04-07 Nicolas Allen Smoot

Let $N_k(m,n)$ denote the number of partitions of $n$ with Garvan $k$-rank $m$. It is well-known that Andrews-Garvan-Dyson's crank and Dyson's rank are the $k$-rank for $k=1$ and $k=2$, respectively. In this paper, we prove that the…

Number Theory · Mathematics 2022-06-02 Nian Hong Zhou

We introduce a universal approach for applying the partition rank method, an extension of Tao's slice rank polynomial method, to tensors that are not diagonal. This is accomplished by generalizing Naslund's distinctness indicator to what we…

Combinatorics · Mathematics 2024-09-18 Mohamed Omar

This is a survey on the categorification of the poset of generalized non-crossing partitions, using the representation theory of a hereditary artin algebra H, looking at the set P of exceptional subcategories in mod H. This categorification…

Representation Theory · Mathematics 2015-08-26 Claus Michael Ringel

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,…

Combinatorics · Mathematics 2019-03-06 Huan Xiong , Wenston J. T. Zang

Dyson's (1962) classification of matrix ensembles is reviewed from a modern perspective, and its recent extension to disordered fermion problems is motivated and described. It is explained in particular why symmetry classes are associated…

Mathematical Physics · Physics 2007-05-23 Martin R. Zirnbauer

We obtain a combinatorial proof of a surprising weighted partition equality of Berkovich and Uncu. Our proof naturally leads to a formula for the number of partitions with a given parity of the smallest part, in terms of S(i), the number of…

Combinatorics · Mathematics 2022-05-13 Damanvir Singh Binner

Andrews and Paule revisited combinatorial structures known as the $k$-elongated partition diamonds, which were introduced in connection with the study of the broken $k$-diamond partitions. They found the generating function for the number…

Number Theory · Mathematics 2025-04-16 Russelle Guadalupe

The enumeration $d_k(n)$ of $k$-elongated plane partition diamonds has emerged as a generalization of the classical integer partition function $p(n)$. We have discovered an infinite congruence family for $d_5(n)$ modulo powers of 5.…

Number Theory · Mathematics 2024-12-11 Koustav Banerjee , Nicolas Allen Smoot

In this paper we refine a weighted partition identity of Alladi. We write explicit formulas of generating functions for the number of partitions grouped with respect to a partition statistic other than the norm. We tie our weighted results…

Combinatorics · Mathematics 2016-04-01 Ali Kemal Uncu

It is well known that Ramanujan conjectured congruences modulo powers of $5$, $7$ and and $11$ for the partition function. These were subsequently proved by Watson (1938) and Atkin (1967). In 2009 Choi, Kang, and Lovejoy proved congruences…

Number Theory · Mathematics 2024-07-11 Dandan Chen , Rong Chen , Frank Garvan

By considering the $M_2$-rank of an overpartition as well as a residual crank, we give another combinatorial refinement of the congruences $\overline{\mbox{spt}}_2(3n)\equiv \overline{\mbox{spt}}_2(3n+1)\equiv 0\pmod{3}$. Here…

Number Theory · Mathematics 2014-06-23 Chris Jennings-Shaffer

Following the breakthrough of Croot, Lev, and Pach, Tao introduced a symmetrized version of their argument, which is now known as the slice rank method. In this paper, we introduce a more general version of the slice rank of a tensor, which…

Combinatorics · Mathematics 2023-03-13 Eric Naslund

Successive ranks of a partition, which were introduced by Atkin, are the difference of the $i$th row and the $i$th column in the Ferrers graph. Recently, in the study of singular overpartitions, Andrews revisited successive ranks and parity…

Combinatorics · Mathematics 2017-03-23 Seunghyun Seo , Ae Ja Yee

In this paper, we give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related…

Combinatorics · Mathematics 2020-05-19 Xinhua Xiong , William J. Keith

The celebrated Rogers-Ramanujan identities equate the number of integer partitions of $n$ ($n\in\mathbb N_0$) with parts congruent to $\pm 1 \pmod{5}$ (respectively $\pm 2 \pmod{5}$) and the number of partitions of $n$ with super-distinct…

Number Theory · Mathematics 2023-03-07 Cristina Ballantine , Amanda Folsom

Comon's conjecture on the equality of the rank and the symmetric rank of a symmetric tensor, and Strassen's conjecture on the additivity of the rank of tensors are two of the most challenging and guiding problems in the area of tensor…

Algebraic Geometry · Mathematics 2018-10-23 Alex Casarotti , Alex Massarenti , Massimiliano Mella

Moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harmonic Maass forms. This paper proves a conjecture due to…

Number Theory · Mathematics 2014-02-26 K. Bringmann , K. Mahlburg , R. Rhoades

The mock theta conjectures are ten identities involving Ramanujan's fifth-order mock theta functions. The conjectures were proven by Hickerson in 1988 using q-series methods. Using methods from the theory of harmonic Maass forms,…

Number Theory · Mathematics 2016-04-19 Nickolas Andersen

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

Combinatorics · Mathematics 2024-05-30 James A. Sellers