English
Related papers

Related papers: A new approach to the Dyson rank conjectures

200 papers

We present a generalization, which we call (k,m)-rank, of Dyson's notion of rank to integer partitions with k successive Durfee rectangles and give two combinatorial symmetries associated with this new definition. We prove these symmetries…

Combinatorics · Mathematics 2007-05-23 Cilanne Boulet

In this paper, we discuss a few recent conjectures made by George Beck related to the ranks and cranks of partitions. The conjectures for the rank of a partition were proved by Andrews by using results due to Atkin and Swinnerton-Dyer on a…

Combinatorics · Mathematics 2021-01-27 Shreejit Bandyopadhyay

We study the Dyson rank function $N(r,t;n)$, the number of partitions with rank congruent to $r$ modulo $t$. We first show that it is monotonic in $n$, and then show that it equidistributed as $n \rightarrow \infty$. Using this result we…

Number Theory · Mathematics 2020-09-14 Joshua Males

In 2003, Hammond and Lewis defined a statistic on partitions into 2 colors which combinatorially explains certain well known partition congruences mod 5. We give two analogs of Hammond and Lewis's birank statistic. One analog is in terms of…

Number Theory · Mathematics 2009-09-29 F. G. Garvan

Integer partitions have long been of interest to number theorists, perhaps most notably Ramanujan, and are related to many areas of mathematics including combinatorics, modular forms, representation theory, analysis, and mathematical…

Number Theory · Mathematics 2020-10-20 Adriana L. Duncan , Simran Khunger , Holly Swisher , Ryan Tamura

Based on work of Atkin and Swinnerton-Dyer on partition rank difference functions, and more recent work of Lovejoy and Osburn, Mao has proved several inequalities between partition ranks modulo $10$, and additional results modulo $6$ and…

Number Theory · Mathematics 2015-09-22 Ethan Alwaise , Elena Iannuzzi , Holly Swisher

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

Number Theory · Mathematics 2021-01-05 Dandan Chen , Rong Chen , Frank Garvan

At the 1987 Ramanujan Centenary meeting Dyson asked for a coherent group-theoretical structure for Ramanujan's mock theta functions analogous to Hecke's theory of modular forms. Many of Ramanujan's mock theta functions can be written in…

Number Theory · Mathematics 2016-09-09 Frank Garvan

Andrews, Lewis and Lovejoy introduced the partition function $PD(n)$ as the number of partitions of $n$ with designated summands. In a recent work, Lin studied a partition function $PD_{t}(n)$ which counts the number of tagged parts over…

Combinatorics · Mathematics 2020-07-08 Robert. X. J. Hao , Erin Y. Y. Shen , Wenston J. T. Zang

A partition statistic ` crank' gives combinatorial interpretations for Ramanujan's famous partition congruences. In this paper, we establish an asymptotic formula, Ramanujan type congruences, and q-series identities that the number of…

Number Theory · Mathematics 2007-05-23 Dohoon Choi , Soon-Yi Kang , Jeremy Lovejoy

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…

Combinatorics · Mathematics 2024-11-04 Guy Moshkovitz , Daniel G. Zhu

Recently, much attention has been given to various inequalities among partition functions. For example, Nicolas, {and later DeSavlvo--Pak,} proved that $p(n)$ is eventually log-concave, and Ji--Zang showed that the cranks are eventually…

Number Theory · Mathematics 2022-09-27 Kathrin Bringmann , Siu Hang Man , Larry Rolen

The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…

Computational Complexity · Computer Science 2026-03-02 Lianna Hambardzumyan , Shachar Lovett , Morgan Shirley

Let $NT(m, k, n)$ denote the total number of parts in the partitions of n with rank congruent to m modulo k. Andrews proved Beck's conjecture on congruences for $NT(m, k, n)$ modulo 5 and 7. Generalizing Andrews'results, Chern obtain…

Number Theory · Mathematics 2023-03-10 Nankun Hong , Renrong Mao

Noting a curious link between Andrews' even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is…

Number Theory · Mathematics 2025-06-11 Shishuo Fu , Dazhao Tang

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…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Kathy Q. Ji , Herbert S. Wilf

Physical systems exhibiting stochastic or chaotic behavior are often amenable to treatment by random matrix models. In deciding on a good choice of model, random matrix physics is constrained and guided by symmetry considerations. The…

Mathematical Physics · Physics 2010-01-06 Martin R. Zirnbauer

New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.

Number Theory · Mathematics 2007-05-23 A. O. L. Atkin , F. G. Garvan

Bringmann and Lovejoy introduced a rank for overpartition pairs and investigated its role in congruence properties of $\bar{pp}(n)$, the number of overpartition pairs of n. In particular, they applied the theory of Klein forms to show that…

Combinatorics · Mathematics 2010-09-28 William Y. C. Chen , Bernard L. S. Lin

In a recent study of sign-balanced, labelled posets Stanley [13], introduced a new integral partition statistic srank(pi) = O(pi) - O(pi'), where O(pi) denotes the number of odd parts of the partition pi and pi' the conjugate of pi. In [1]…

Combinatorics · Mathematics 2007-05-23 Alexander Berkovich , Frank G. Garvan