Related papers: Asymptotics of various partitions

We determine asymptotic formulas for the coefficients of a natural class of negative index and negative weight Jacobi forms. These coefficients can be viewed as a refinement of the numbers $p_k(n)$ of partitions of n into k colors. Part of…

The rational homology group of the order complex of non-even partitions of a finite set is calculated. A twisted version of the Goresky-MacPherson approach to similar homology calculations is proposed.

We find exact and asymptotic formulas for the average values of several statistics on set partitions: of Carlitz's $q$-Stirling distributions, of the numbers of crossings in linear and circular representations of set partitions, of the…

We show existence of a isoperimetric $3$-partition of $\mathbb R^8$, with one set of finite volume and two of infinite volume, which is asymptotic to a singular minimal cone.

The asymptotic variety of a counterexample of Pinchuk type to the strong real Jacobian conjecture is explicitly described by low degree polynomials.

We generalize the asymptotic estimates by Bubboloni, Luca and Spiga (2012) on the number of $k$-compositions of $n$ satisfying some coprimality conditions. We substantially refine the error term concerning the number of $k$-compositions of…

Let $a_{r,s}(n)$ denote the number of mutlicolored partitions of $n$, wherein both even parts and odd parts may appear in one of $r$-colors and $s$-colors, respectively, for fixed $r,s\ge 1$. The paper aims to study arithmetic properties…

We determine the asymptotic behavior of the coefficients of Hecke polynomials. In particular, this allows us to determine signs of these coefficients when the level or the weight is sufficiently large. In all but finitely many cases, this…

We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.

The present thesis studies structural properties of non-crossing partitions associated to finite Coxeter groups from both algebraic and geometric perspectives. On the one hand, non-crossing partitions are lattices, and on the other hand, we…

Let $\mathfrak{p}_{\mathbb{P}_r}(n)$ denote the number of partitions of $n$ into $r$-full primes. We use the Hardy-Littlewood circle method to find the asymptotic of $\mathfrak{p}_{\mathbb{P}_r}(n)$ as $n \to \infty$. This extends previous…

A given dynamics for a composite quantum system can exhibit several distinct properties for the asymptotic entanglement behavior, like entanglement sudden death, asymptotic death of entanglement, sudden birth of entanglement, etc. A…

Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…

These are (not updated) notes from the lectures I gave at the NATO ASI ``Symmetric Functions 2001'' at the Isaac Newton Institute in Cambridge (June 25 -- July 6, 2001). Their goal is an informal introduction to asymptotic combinatorics…

We study generating functions which count the sizes of $t$-cores of partitions, and, more generally, the sizes of higher rows in $t$-core towers. We then use these results to derive an asymptotic for the average size of the $t$-defect of…

One mentions in a lot of papers that the poles of Igusa's p-adic zeta function determine the asymptotic behavior of the number of solutions of polynomial congruences. However, no publication clarifies this connection precisely. We try to…

We prove that a graph G is asymptotically isomorphic to the ray if and only if G is uniformly spherically bounded and is of bounded local degrees. This problem arouse in combinatorics and was posed in [3] (Problem 10.1).

We demonstrate that statistics for several types of set partitions are described by generating functions which appear in the theory of integrable equations.

We present an infinite family of recursive formulas that count binary integer partitions satisfying natural divisibility conditions and show that these counts are interrelated via partial sums. Moreover, we interpret the partitions we study…

We derive the dominant asymptotic form and the order of the correction terms of the finite-perimeter partition function of self-avoiding polygons on the square lattice, which are weighted according to their area A as q^A, in the inflated…