Related papers: Counting partitions inside a rectangle

For any near-threshold asymptotic regime and for any Feynman diagram (involving loop and/or phase space integrals), a systematic prescription for explicitly constructing all-logs, all-powers (all-twists) expansions in perfectly factorized…

Let $\boldsymbol W=\{\boldsymbol W_n:n\in\mathbb N\}$ be a sequence of random vectors in $\mathbb R^d$, $d\ge 1$. This paper considers the logarithmic asymptotics of the extremes of $\boldsymbol W$, that is, for any vector $\boldsymbol…

We use a semiclassical approximation to derive the partition function for an arbitrary potential in one-dimensional Quantum Statistical Mechanics, which we view as an example of finite temperature scalar Field Theory at a point. We rely on…

We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized…

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$. Our main result shows that the primes are equidistributed for a fixed residue class over all moduli of size $x^{1/2+\delta}$ with a…

For $n \in \mathbb{N}$ let $\Pi[n]$ denote the set of partitions of $n$, i.e., the set of positive integer tuples $(x_1,x_2,\ldots,x_k)$ such that $x_1 \geq x_2 \geq \cdots \geq x_k$ and $x_1 + x_2 + \cdots + x_k = n$. Fixing…

Bergeron--Ceballos--K\"ustner introduced the $q$-Fibonomial coefficients \( \qfibonom{m+n}{n}\), gave a combinatorial interpretation of the $q$-Fibonomial coefficients via a weighted path-domino tiling model, and conjectured that these…

A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We…

We provide a general framework for proving asymptotic equidistribution, convexity, and log concavity of coefficients of generating functions on arithmetic progressions. Our central tool is a variant of Wright's Circle Method proved by two…

Suppose that $n$ statistical units are observed, each following the model $Y(x_j)=m(x_j)+ \epsilon(x_j),\, j=1,...,N,$ where $m$ is a regression function, $0 \leq x_1 <...<x_N \leq 1$ are observation times spaced according to a sampling…

The QCD at finite density is not well understood yet, where standard Monte Carlo simulation suffers from the sign problem. In order to overcome the sign problem, the method of Lefschetz thimble has been explored. Basically, the original…

The generating function which counts partitions with the Plancherel measure (and its q-deformed version), can be rewritten as a matrix integral, which allows to compute its asymptotic expansion to all orders. There are applications in…

Entanglement asymmetry provides a quantitative measure of symmetry breaking in many-body quantum states. Focusing on inhomogeneous $U(1)$ charges, such as dipole and multipole moments, we show that the typical asymmetry is bounded by a…

We show that a well-known asymptotic series for the logarithm of the central binomial coefficient is strictly enveloping in the sense of P\'olya and Szeg\"o, so the error incurred in truncating the series is of the same sign as the next…

We study asymptotics of the dimer model on large toric graphs. Let $\mathbb L$ be a weighted $\mathbb{Z}^2$-periodic planar graph, and let $\mathbb{Z}^2 E$ be a large-index sublattice of $\mathbb{Z}^2$. For $\mathbb L$ bipartite we show…

Let $p(n)$ denote the partition function. In this paper our main goal is to derive an asymptotic expansion up to order $N$ (for any fixed positive integer $N$) along with estimates for error bounds for the shifted quotient of the partition…

We prove new formulas and congruences for $p(n,k):=$ the number of partitions of $n$ into $k$ parts and $q(n,k):=$ the number of partitions of $n$ into $k$ distinct parts. Also, we give lower and upper bounds for the density of the set…

We will use a discrete analogue of the classical Laplace method to show that for infinitely many positive integers $n$, the main term of the asymptotic expansion of the scaled $q$-exponential $(-q^{-nt+1/2}u;q)_{\infty}$ could be expressed…

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…