Related papers: Dyson's Rank, overpartitions, and weak Maass forms
Convex rank tests are partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. Each class consists of the…
These lecture notes are intended as an introduction to several notions of tensor rank and their connections to the asymptotic complexity of matrix multiplication. The latter is studied with the exponent of matrix multiplication, which will…
It is shown in this paper how a connection may be made between the symmetry generators of the Hamiltonian (or potential) invariant under a symmetry group $G$, and the subcasimirs that come about when the rank of the Poisson structure of a…
We consider the problem of learning an unknown partition of an $n$ element universe using rank queries. Such queries take as input a subset of the universe and return the number of parts of the partition it intersects. We give a simple…
The study of Ramanujan-type congruences for functions specific to additive number theory has a long and rich history. Motivated by recent connections between divisor sums and overpartitions via congruences in arithmetic progressions, we…
In this paper, we prove inequalities for ranks, cranks, and partitions among different classes modulo 11. These were conjectured by Borozenets.
In the present work, we extend current research in a nearly-forgotten but newly revived topic, initiated by P. A. MacMahon, on a generalized notion which relates the divisor sums to the theory of integer partitions and two infinite families…
Two new expansions for partial sums of Gauss' triangular and square numbers series are given. As a consequence, we derive a family of inequalities for the overpartition function $\bar{p}(n)$ and for the partition function $p_1(n)$ counting…
The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…
Bringmann, Lovejoy, and Osburn showed that the generating functions of the spt-overpartition functions spt(n), spt1(n), spt2(n), and M2spt(n) are quasimock theta functions, and satisfy a number of simple Ramanujan-like congruences. Andrews,…
The groundbreaking performance of deep neural networks (NNs) promoted a surge of interest in providing a mathematical basis to deep learning theory. Low-rank tensor decompositions are specially befitting for this task due to their close…
Recently, Andrews, Dixit and Yee introduced partition functions associated with Ramanujan/Watson third order mock theta functions $\omega(q)$ and $\nu(q)$. In this paper, we find several new exact generating functions for those partition…
We obtain two-variable Hecke-Rogers identities for three universal mock theta functions. This implies that many of Ramanujan's mock theta functions, including all the third order functions, have a Hecke-Rogers-type double sum…
In 2007, G.E. Andrews introduced the $(n+1)$-variable combinatorial generating function $R_n(x_1,x_2,\cdots,x_n;q)$ for ranks of $n$-marked Durfee symbols, an $(n+1)$-dimensional multisum, as a vast generalization to the ordinary…
MacMahon introduced partition analysis in his book ``Combinatory Analysis'' as a computational technique for solving problems related to systems of linear Diophantine equations and inequalities. This paper aims to develop a fundamental…
Recently, Amderberhan, Griffin, Ono, and Singh started the study of "traces of partition Eisenstein series" and used it to give explicit formulas for many interesting functions. In this note we determine the precise spaces in which they…
As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order. This is an infinitary extension of the well known fact that finite partial orders endowed with linear extensions form a Ramsey…
We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…
We study statistics on ordered set partitions whose generating functions are related to $p,q$-Stirling numbers of the second kind. The main purpose of this paper is to provide bijective proofs of all the conjectures of \stein…
We study a dimensionality reduction technique for finite mixtures of high-dimensional multivariate response regression models. Both the dimension of the response and the number of predictors are allowed to exceed the sample size. We…