Related papers: Combinatorial Perspectives on the Crank and Mex Pa…
We formulate and study the microscopic statistical mechanics of systems of particles with exclusion statistics in a discrete one-body spectrum. The statistical mechanics of these systems can be expressed in terms of effective single-level…
This paper studies the minimax detection of a small submatrix of elevated mean in a large matrix contaminated by additive Gaussian noise. To investigate the tradeoff between statistical performance and computational cost from a…
The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors needed to reconstruct it exactly. The problem of determining this rank and computing the corresponding nonnegative factors is difficult;…
In this article, we refine a result of Andrews and Newman, that is, the sum of minimal excludants over all the partitions of a number $n$ equals the number of partitions of $n$ into distinct parts with two colors. As a consequence, we find…
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 construct new smallest parts partition functions and smallest parts crank functions by considering variations of Bailey's Lemma and conjugate Bailey pairs. The functions we introduce satisfy simple linear congruences modulo $3$ and $5$.…
Recently, Blecher and Knopfmacher explored the notion of fixed points in integer partitions. Here, we distinguish partitions with a fixed point by which value is fixed and analyze the resulting triangle of integers. In particular, we…
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…
Statistical mechanics and thermodynamics for ideal fractional exclusion statistics with mutual statistical interactions is studied systematically. We discuss properties of the single-state partition functions and derive the general form of…
A partition of a positive integer $n$ is a representation of $n$ as a sum of a finite number of positive integers (called parts). A trapezoidal number is a positive integer that has a partition whose parts are a decreasing sequence of…
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…
A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a non-negative weight to each of its triangles such that the sum of the weights of the…
Ballantine--Beck--Feigon--Maurischat introduced the subsum polynomial \[ \operatorname{sp}(\lambda,x):=\prod_i (1+x^{\lambda_i}) \] attached to an integer partition $\lambda$, and studied rational functions obtained by summing reciprocals…
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…
The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was…
Given a connected undirected weighted graph, we are concerned with problems related to partitioning the graph. First of all we look for the closest disconnected graph (the minimum cut problem), here with respect to the Euclidean norm. We…
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…
Let $\Delta(n)$ denote the smallest positive integer $m$ such that $a^3+a(1\le a\le n)$ are pairwise distinct modulo $m$. The purpose of this paper is to determine $\Delta(n)$ for all positive integers $n$.
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…
We continue to consider the discrete decreasing minimization problem on an integral base-polyhedron treated in Part I. The problem is to find a lexicographically minimal integral vector in an integral base-polyhedron, where the components…