Related papers: M_2-rank differences for overpartitions
Integer partitions have fascinated people for centuries, from Ramanujan's groundbreaking congruences to the modern theory of modular forms. This paper investigates the statistical properties of odd unimodal sequences--a natural refinement…
Recent work of Cesana, Craig and the third author shows that the trace of plane partitions is asymptotically equidistributed in residue classes mod $b$. Applying a technique of the first two authors and Garnowski, we prove asymptotic…
In this paper, we have considered the dense rank for assigning positions to alternatives in weak orders. If we arrange the alternatives in tiers (i.e., indifference classes), the dense rank assigns position 1 to all the alternatives in the…
In this paper, we use a branch of polyhedral geometry, Ehrhart theory, to expand our combinatorial understanding of congruences for partition functions. Ehrhart theory allows us to give a new decomposition of partitions, which in turn…
We find examples of duality among quantum theories that are related to arithmetic functions by identifying distinct Hamiltonians that have identical partition functions at suitably related coupling constants or temperatures. We are led to…
Let $n$ and $s$ be fixed integers such that $n\geq 2$ and $1\leq s\leq \frac{n}{2}$. Let $M_n(\mathbb{K})$ be the ring of all $n\times n$ matrices over a field $\mathbb{K}$. If a map $\delta:M_n(\mathbb{K})\rightarrow M_n(\mathbb{K})$…
Andrews, Chan, and Kim recently introduced a modified definition of crank and rank moments for integer partitions that allows the study of both even and odd moments. In this paper, we prove the asymptotic behavior of these moments in all…
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…
Andrews and the third author recently studied congruences for certain restricted two-color partitions. They made two conjectures for Ramanujan-type congruences and a vanishing identity for the limiting sequence. In this paper, we settle…
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…
An overpartition is a partition such that the first occurrence (equivalently, the last occurrence) of a number may be overlined. In this article, we investigate three contents of overpartitions. We first consider the $r$-chain minimal and…
Ranks estimated from data are uncertain and this poses a challenge in many applications. However, estimated ranks are deterministic functions of estimated parameters, so the uncertainty in the ranks must be determined by the uncertainty in…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
In 1919, Ramanujan discovered his famous congruences for the partition function. Not too long after, Freeman Dyson conjectured a combinatorial statistic existed that explained the three congruences, which he dubbed the \textit{crank}. A…
The orthogonal decomposition factorizes a tensor into a sum of an orthogonal list of rankone tensors. We present several properties of orthogonal rank. We find that a subtensor may have a larger orthogonal rank than the whole tensor and…
Using properties of Appell-Lerch functions, we give insightful proofs for six of Ramanujan's identities for the tenth-order mock theta functions.
Many papers have studied inequalities for partition functions. Recently, a number of papers have considered mixtures between additive and multiplicative behavior in such inequalities. In particular, Chern-Fu-Tang and Heim-Neuhauser gave…
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…
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…
Recently, Andrews, Dixit and Yee defined two partition functions $p_{\omega}(n)$ and $p_{\nu}(n)$ that are related with Ramanujan's mock theta functions $\omega(q)$ and $\nu(q)$, respectively. In this paper, we present two variable…