Let $G_1, \dots, G_k$ be vector spaces over a finite field $\mathbb{F} = \mathbb{F}_q$ with a non-trivial additive character $χ$. The analytic rank of a multilinear form $α\colon G_1 \times \dots \times G_k \to \mathbb{F}$ is defined as $\operatorname{arank}(α) = -\log_q \mathbb{E}_{x_1 \in G_1, \dots, x_k\in G_k} χ\big(α(x_1,\dots, x_k)\big)$. The partition rank $\operatorname{prank}(α)$ of $α$ is the smallest number of maps of partition rank 1 that add up to $α$, where a map is of partition rank 1 if it can be written as a product of two multilinear forms, depending on different coordinates. It is easy to see that $\operatorname{arank}(α) \leq O\Big(\operatorname{prank}(α)\Big)$ and it has been known that $\operatorname{prank}(α)$ can be bounded from above in terms of $\operatorname{arank}(α)$. In this paper, we improve the latter bound to polynomial, i.e. we show that there are quantities $C, D$ depending on $k$ only such that $\operatorname{prank}(α) \leq C (\operatorname{arank}(α)^D + 1)$. As a consequence, we prove a conjecture of Kazhdan and Ziegler. The same result was obtained independently and simultaneously by Janzer.
We characterize which graph invariants are partition functions of a spin model over the complex numbers, in terms of the rank growth of associated `connection matrices'.
In this paper, we develop a polynomial time algorithm to compute a Dulmage-Mendelsohn-type decomposition of a matrix partitioned into submatrices of rank at most $1$.
In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee rectangle. We also obtain a new bijective proof of a result of Andrews and Bressoud that the number of partitions of $N$ with all ranks at least $1-\ell$ equals the number of partitions of $N$ with no parts equal to $\ell+1$, for $\ell\ge0$, which allows us to refine it by the above statistics. Combining Foata's second fundamental transformation for words with Greene…
In $1944$, Freeman Dyson defined the concept of rank of an integer partition and introduced without definition the term of crank of an integer partition. A definition for the crank satisfying the properties hypothesized for it by Dyson was discovered in 1988 by G. E. Andrews and F. G. Garvan. In this paper, we introduce truncated forms for two theta identities involving the generating functions for partitions with non-negative rank and non-negative crank. As corollaries we derive new infinite families of linear inequalities for the partition function $p(n)$. The number of Garden of Eden partit…
Motivated by a question of Defant and Propp (2020) regarding the connection between the degrees of noninvertibility of functions and those of their iterates, we address the combinatorial optimization problem of minimizing the sum of squares over partitions of $n$ with a nonnegative rank. Denoting the sequence of the minima by $(m_n)_{n\in\mathbb{N}}$, we prove that $m_n=Θ\left(n^{4/3}\right)$. Consequently, we improve by a factor of $2$ the lower bound provided by Defant and Propp for iterates of order two.
We consider $m$-divisible non-crossing partitions of $\{1,2,\ldots,mn\}$ with the property that for some $t\leq n$ no block contains more than one of the first $t$ integers. We give a closed formula for the number of multi-chains of such non-crossing partitions with prescribed number of blocks. Building on this result, we compute Chapoton's $M$-triangle in this setting and conjecture a combinatorial interpretation for the $H$-triangle. This conjecture is proved for $m=1$.
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 blocks. Motivated by his work, we investigate partitions with prescribed successive rank parity blocks. The main result of this paper is the generating function of partitions with exactly $d$ successive ranks and $m$ parity blocks.
A positroid is a special case of a realizable matroid, that arose from the study of totally nonnegative part of the Grassmannian by Postnikov. Postnikov demonstrated that positroids are in bijection with certain interesting classes of combinatorial objects, such as Grassmann necklaces and decorated permutations. The bases of a positroid can be described directly in terms of the Grassmann necklace and decorated permutation. In this paper, we show that the rank of an arbitrary set in a positroid can be computed directly from the associated decorated permutation using non-crossing partitions.
The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove identities for counts of partitions with large rank in fixed residue classes.
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.
In this paper we study generating functions resembling the rank of strongly unimodal sequences. We give combinatorial interpretations, identities in terms of mock modular forms, asymptotics, and a parity result. Our functions imitate a relation between the rank of strongly unimodal sequences and the rank of integer partitions.
Using an extension of Wright's version of the circle method, we obtain asymptotic formulae for partition ranks similar to formulae for partition cranks which where conjectured by F. Dyson and recently proved by the first author and K. Bringmann.
A tensor defined over a finite field $\mathbb{F}$ has low analytic rank if the distribution of its values differs significantly from the uniform distribution. An order $d$ tensor has partition rank 1 if it can be written as a product of two tensors of order less than $d$, and it has partition rank at most $k$ if it can be written as a sum of $k$ tensors of partition rank 1. In this paper, we prove that if the analytic rank of an order $d$ tensor is at most $r$, then its partition rank is at most $f(r,d,|\mathbb{F}|)$. Previously, this was known with $f$ being an Ackermann-type function in $r$ …
We prove formulas for the generating functions for M_2-rank differences for partitions without repeated odd parts. These formulas are in terms of modular forms and generalized Lambert series.
Given a coprime pair $(m,n)$ of positive integers, rational Catalan numbers $\frac{1}{m+n} \binom{m+n}{m,n}$ counts two combinatorial objects:rational $(m,n)$-Dyck paths are lattice paths in the $m\times n$ rectangle that never go below the diagonal; $(m,n)$-cores are partitions with no hook length equal to $m$ or $n$.Anderson established a bijection between $(m,n)$-Dyck paths and $(m,n)$-cores. We define a new transformation, called rank complement, on rational Dyck paths. We show that rank complement corresponds to conjugation of $(m,n)$-cores under Anderson's bijection. This leads to: i) a …
We prove asymptotic upper bounds on the number of $d$-partitions (paving matroids of fixed rank) and partial Steiner systems (sparse paving matroids of fixed rank), using a mixture of entropy counting, sparse encoding, and the probabilistic method.
A tensor defined over a finite field $\mathbb{F}$ has low analytic rank if the distribution of its values differs significantly from the uniform distribution. An order $d$ tensor has partition rank 1 if it can be written as a product of two tensors of order less than $d$, and it has partition rank at most $k$ if it can be written as a sum of $k$ tensors of partition rank 1. In this paper, we prove that if the analytic rank of an order $d$ tensor is at most $r$, then its partition rank is at most $f(r,d,|\mathbb{F}|)$, where, for fixed $d$ and $\mathbb{F}$, $f$ is a polynomial in $r$. This is a…
Let $j,n$ be even positive integers, and let $\overline{p}_j(n)$ denote the number of partitions with BG-rank $j$, and $\overline{p}_j(a,b;n)$ to be the number of partitions with BG-rank $j$ and $2$-quotient rank congruent to $a \pmod{b}$. We give asymptotics for both statistics, and show that $\overline{p}_j(a,b;n)$ is asymptotically equidistributed over the congruence classes modulo $b$. We also show that each of $\overline{p}_j(n)$ and $\overline{p}_j(a,b;n)$ asymptotically satisfy all higher-order Turán inequalities.
Nazarov and Tarasov recently generalized the notion of the rank of a partition to skew partitions. We give several characterizations of the rank of a skew partition and one possible characterization that remains open. One of the characterizations involves the decomposition of a skew shape into a minimal number of border strips, and we develop a theory of these MBSD's as well as of the closely related minimal border strip tableaux. An application is given to the value of a character of the symmetric group S_n indexed by a skew shape z at a permutation whose number of cycles is the rank of z.
Bessenrodt and Ono initially found the strict log-subadditivity of partition function $p(n)$, that is, $p(a+b)< p(a)p(b)$ for $a,b>1$ and $a+b>9$. Many other important statistics of partitions are proved to enjoy similar properties. Lovejoy introduced the overpartition rank as an analog of Dyson's rank for partitions from the $q$-series perspective. Let $\overline{N}(a,c,n)$ denote the number of overpartitions with rank congruent to $a$ modulo $c$. Ciolan computed the asymptotic formula of $\overline{N}(a,c,n)$ and showed that $\overline{N}(a, c, n) > \overline{N}(b, c, n)$ for $c\geq7$ and $n…
We characterize which graph invariants are partition functions of an edge-coloring model over the complex numbers, in terms of the rank growth of associated `connection matrices'.
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 all the partitions of $n$ with designated summands. He proved that $PD_{t}(3n+2)$ is divisible by $3$. In this paper, we first introduce a structure named partitions with overline designated summands, which is counted by $PD_t(n)$. We then define a generalized rank of partitions with overline designated summands and give a combinatorial interpretation of the c…
If L is a partition of n, the rank of L is the size of the largest part minus the number of parts. Under the uniform distribution on partitions, Bringmann, Mahlburg, and Rhoades showed that the rank statistic has a limiting distribution. We identify the limit as the difference between two independent extreme value distributions and as the distribution of B(T) where B(t) is standard Brownian motion and T is the first time that an independent three-dimensional Brownian motion hits the unit sphere. The same limit holds for the crank.
We prove that for every positive integer $d \ge 2$ there exist polynomial functions $F_d, G_d: \mathbb{N} \to \mathbb{N}$ such that for each positive integer $r$, every order-$d$ tensor $T$ over an arbitrary field and with partition rank at least $G_d(r)$ contains a $F_d(r) \times \cdots \times F_d(r)$ subtensor with partition rank at least $r$. We then deduce analogous results on the Schmidt rank of polynomials in zero or high characteristic.
We derive an asymptotic formula for $A(n,j,r)$ the number of integer partitions of $n$ into at most $j$ parts each part $\le r$. We assume $j$ and $r$ are near their mean values. We also investigate the second largest part, the number of parts $\ge 2$, etc. We show that the fraction of the partitions of an even integer $n$ that are graphical, ie. whose parts form the degree sequence of a simple graph, is $O(\ln^{-1/2} n)$. Probabilistic results are used in our discussion of graphical partitions. The George Szekeres circle method is essential for our asymptotic results on partitions. We determi…
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 for $pp(n)$, and then we use these to give a new proof of a refined system of congruences for $p(n)$ that was found by Berkovich and Garvan.
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 sequence $\{N_k(m,n)\}_{|m|\le n-k-71}$ is log-concave for all sufficiently large $n$ and each integer $k$. In particular, we partially solve the log-concavity conjecture for Andrews-Garvan-Dyson's crank and Dyson's rank, which was independently proposed by Bringmann-Jennings-Shaffer-Mahlburg and Ji-Zang.
Let spt(n) denote the total number of appearances of smallest parts in the partitions of n. Recently, Andrews showed how spt(n) is related to the second rank moment, and proved some surprising Ramanujan-type congruences mod 5, 7 and 13. We prove a generalization of these congruences using known relations between rank and crank moments. We obtain explicit Ramanujan-type congruences for spt(n) mod p for p = 11, 17, 19, 29, 31 and 37. Recently, Bringmann and Ono proved that Dyson's rank function has infinitely many Ramanujan-type congruences. Their proof is non-constructive and utilizes the theor…
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 we call the Partition Rank. This allows us to extend the slice rank method to problems that require the variables to be distinct. Using the partition rank, we generalize a recent result of Ge and Shangguan, and prove that any set $A\subset\mathbb{F}_{q}^{n}$ of size \[|A|>\binom{n+(k-1)q}{(k-1)(q-1)}\] contains a $k$-right-corner, that is distinct vectors $…
By introducing $k$-marked Durfee symbols, Andrews found a combinatorial interpretation of $2k$-th symmetrized moment $η_{2k}(n)$ of ranks of partitions of $n$ in terms of $(k+1)$-marked Durfee symbols of $n$. In this paper, we consider the $k$-th symmetrized positive moment $\barη_k(n)$ of ranks of partitions of $n$ which is defined as the truncated sum over positive ranks of partitions of $n$. As combintorial interpretations of $\barη_{2k}(n)$ and $\barη_{2k-1}(n)$, we show that for fixed $k$ and $i$ with $1\leq i\leq k+1$, $\barη_{2k-1}(n)$ equals the number of $(k+1)$-marked Durfee symbols …
Let $k$ be a positive integer and $m$ be an integer. Garvan's $k$-rank $N_k(m,n)$ is the number of partitions of $n$ into at least $(k-1)$ successive Durfee squares with $k$-rank equal to $m$. In this paper give some asymptotics for $N_k(m,n)$ with $|m|\ge \sqrt{n}$ as $n\rightarrow \infty$. As a corollary, we give a more complete answer for the Dyson's crank distribution conjecture. We also establish some asymptotic formulas for finite differences of $N_k(m,n)$ with respect to $m$ with $m\gg \sqrt{n}\log n$.
Let πbe a partition. In [2] we defined BG-rank(π) as an alternating sum of parities of parts. This statistic was employed to generalize and refine the famous Ramanujan modulo 5 partition congruence. Let p_j(n)(a_{t,j}(n)) denote a number of partitions (t-cores) of n with BG-rank=j. Here, we provide an elegant combinatorial proof that 5|p_j(5n+4) by showing that the residue of the 5-core crank mod 5 divides the partitions enumerated by p_j(5n+4) into five equal classes. This proof uses the orbit construction in [2] and new identity for BG-rank. In addition, we find eta-quotient representation f…
Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting behavior of their zeros as sets and densities.
We present an affirmative answer to Stanley's zrank problem, namely, the zrank and rank are equal for any skew partition. We show that certain classes of restricted Cauchy matrices are nonsingular and furthermore, the signs depend on the number of zero entries. Similar to notion of the jrank of a skew partition, we give a characterization of the rank in terms of the Giambelli type matrices of the corresponding skew Schur functions. We also show that the sign of the determinant of a factorial Cauchy matrix is uniquely determined by the number of its zero entries, which implies the nonsingularit…
We study the multiplicity $b_S(n)$ of the trivial representation in the symmetric group representations $β_S$ on the (top) homology of the rank-selected partition lattice $Π_n^S$. We break the possible rank sets $S$ into three cases: (1) $1\not\in S$, (2) $S=1,..., i$ for $i\ge 1$ and (3) $S=1,..., i,j_1,..., j_l$ for $i,l\ge 1$, $j_1 > i+1$. It was previously shown by Hanlon that $b_S(n)=0$ for $S=1,..., i$. We use a partitioning for $Δ(Π_n)/S_n$ due to Hersh to confirm a conjecture of Sundaram that $b_S(n)>0$ for $1\not\in S$. On the other hand, we use the spectral sequence of a filtered com…
We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition functions. Mixed partition functions can be seen as a generalization of partition functions of vertex models, as introduced by de la Harpe and Jones, [P. de la Harpe, V.F.R. Jones, Graph invariants related to statistical mechanical models: examples and problems, Journal of Combinatorial Theory, Series B 57 (1993) 207--227] and they are related to invariant theo…
Let $N(\leq m,n)$ denote the number of partitions of $n$ with rank not greater than $m$, and let $M(\leq m,n)$ denote the number of partitions of $n$ with crank not greater than $m$. Bringmann and Mahlburg observed that $N(\leq m,n)\leq M(\leq m,n)\leq N(\leq m+1,n)$ for $m<0$ and $1\leq n\leq 100$. They also pointed out that these inequalities can be restated as the existence of a re-ordering $τ_n$ on the set of partitions of $n$ such that $|\text{crank}(λ)|-|\text{rank}(τ_n(λ))|=0$ or $1$ for all partitions $λ$ of $n$, that is, the rank and the crank are nearly equal distributions over parti…
Let $p$ be a prime and let $S$ be a non-empty subset of $\mathbb{F}_p$. Generalizing a result of Green and Tao on the equidistribution of high-rank polynomials over finite fields, we show that if $P: \mathbb{F}_p^n \rightarrow \mathbb{F}_p$ is a polynomial and its restriction to $S^n$ does not take each value with approximately the same frequency, then there exists a polynomial $P_0: \mathbb{F}_p^n \rightarrow \mathbb{F}_p$ that vanishes on $S^n$, such that the polynomial $P-P_0$ has bounded rank. Our argument uses two black boxes: that a tensor with high partition rank has high analytic rank …
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 suitable generating function, while the conjectures related to cranks were studied by Shane Chern using weighted partition moments. We revisit the conjectures on the crank of a partition by decomposing the relevant generating function and further explore connections with Apple-Lerch series and tenth order mock theta functions.
A q-series with nonnegative power series coefficients is called positive. The partition statistics BG-rank is defined as an alternating sum of parities of parts of a partition. It is known that the generating function for the number of partitions of n that are 7-cores with given BG-rank can be written as certain sum of multi-theta functions. We give explicit representations for these generating functions in terms of sums of positive eta-quotients and derive inequalities for the their coefficients. New identities for the generating function of unrestricted 7-cores and inequalities for their coe…
The notion of the spt-crank of a vector partition, or an $S$-partition, was introduced by Andrews, Garvan and Liang. Let $N_S(m,n)$ denote the number of $S$-partitions of $n$ with spt-crank $m$. Andrews, Dyson and Rhoades conjectured that $\{N_S(m,n)\}_m$ is unimodal for any $n$, and they showed that this conjecture is equivalent to an inequality between the rank and the crank of ordinary partitions. They obtained an asymptotic formula for the difference between the rank and the crank of ordinary partitions, which implies $N_S(m,n)\geq N_S(m+1,n)$ for sufficiently large $n$ and fixed $m$. In t…
Cayley's first hyperdeterminant is a straightforward generalization of determinants for tensors. We prove that nonzero hyperdeterminants imply lower bounds on some types of tensor ranks. This result applies to the slice rank introduced by Tao and more generally to partition ranks introduced by Naslund. As an application, we show upper bounds on some generalizations of colored sum-free sets based on constraints related to order polytopes.
We obtain a finite analogue of a recent generalization of an identity in Ramanujan's Notebooks. Differentiating it with respect to one of the parameters leads to a result whose limiting case gives a finite analogue of Andrews' famous identity for $\textup{spt}(n)$. The latter motivates us to extend the theory of the restricted partition function $p(n, N)$, namely, the number of partitions of $n$ with largest parts less than or equal to $N$, by obtaining the finite analogues of rank and crank for vector partitions as well as of the rank and crank moments. As an application of the identity for o…
This is the third and final installment in our series of papers applying the method of Atkin and Swinnerton-Dyer to deduce formulas for rank differences. The study of rank differences was initiated by Atkin and Swinnerton-Dyer in their proof of Dyson's conjectures concerning Ramanujan's congruences for the partition function. Since then, other types of rank differences for statistics associated to partitions have been investigated. In this paper, we prove explicit formulas for M_2-rank differences for overpartitions. Additionally, we express a third order mock theta function in terms of rank d…
We introduce a family of ideals $I_{n,λ,s}$ in $\mathbb{Q}[x_1,\dots,x_n]$ for $λ$ a partition of $k\leq n$ and an integer $s \geq \ell(λ)$. This family contains both the Tanisaki ideals $I_λ$ and the ideals $I_{n,k}$ of Haglund-Rhoades-Shimozono as special cases. We study the corresponding quotient rings $R_{n,λ,s}$ as symmetric group modules. When $n=k$ and $s$ is arbitrary, we recover the Garsia-Procesi modules, and when $λ=(1^k)$ and $s=k$, we recover the generalized coinvariant algebras of Haglund-Rhoades-Shimozono. We give a monomial basis for $R_{n,λ,s}$, unifying the monomial bases stu…
We study the row-space partition and the pivot partition on the matrix space $\mathbb{F}_q^{n \times m}$. We show that both these partitions are reflexive and that the row-space partition is self-dual. Moreover, using various combinatorial methods, we explicitly compute the Krawtchouk coefficients associated with these partitions. This establishes MacWilliams-type identities for the row-space and pivot enumerators of linear rank-metric codes. We then generalize the Singleton-like bound for rank-metric codes, and introduce two new concepts of code extremality. Both of them generalize the notion…
In this paper, we obtain infinitely many non-trivial identities and inequalities between full rank differences for 2-marked Durfee symbols, a generalization of partitions introduced by Andrews. A certain strict inequality, which almost always holds, shows that identities for Dyson's rank, similar to those proven by Atkin and Swinnerton-Dyer, are quite rare. By showing an analogous strict inequality, we show that such non-trivial identities are also rare for the full rank, but on the other hand we obtain an infinite family of non-trivial identities, contrasting the partition theoretic case.
