相关论文: On the large genus asymptotics of psi-class inters…

We study the elliptic genera of level $N$ at the cusps of $\Gamma_1(N)$ for any complete intersection. These genera are described as the summations of generalized binomial coefficients, where each generalized binomial coefficient is related…

We obtain bivariate asymptotics for one part monotone Hurwitz numbers in high genus (i.e. as both the size and the genus go to infinity). To do so, we start with a linear recurrence for these numbers obtained by Do and Chaudhuri. Then, we…

We establish a number of "concatenation theorems" that assert, roughly speaking, that if a function exhibits "polynomial" (or "Gowers anti-uniform", "uniformly almost periodic", or "nilsequence") behaviour in two different directions…

We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…

The goal of this paper is to generalize, refine, and improve results on large intersections. We show that if $G$ is a countable abelian group and $\varphi, \psi : G \to G$ are homomorphisms such that at least two of the three subgroups…

We establish asymptotic formulae for general joint moments of characteristic polynomials and their higher-order derivatives associated with matrices drawn randomly from the groups $\mathrm{USp}(2N)$ and $\mathrm{SO}(2N)$ in the limit as…

We prove an asymptotic formula for the number of $k$-uniform hypergraphs with a given degree sequence, for a wide range of parameters. In particular, we find a formula that is asymptotically equal to the number of $d$-regular $k$-uniform…

We prove large (and moderate) deviations for a class of linear combinations of spacings generated by i.i.d. exponentially distributed random variables. We allow a wide class of coefficients which can be expressed in terms of continuous…

Motivated by the recent proof of the Stanley-Wilf conjecture, we study the asymptotic behavior of the number of permutations avoiding a generalized pattern. Generalized patterns allow the requirement that some pairs of letters must be…

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 give a combinatorial proof of a recent geometric result of Farkas and Lian on linear series on curves with prescribed incidence conditions. The result states that the expected number of degree-$d$ morphisms from a general genus $g$,…

We consider a problem of maximizing the product of the sizes of two uniform cross-$t$-intersecting families of sets. We show that the value of this maximum is at most polynomially larger (in the size of a ground set) than a quantity…

We explain a discontinuous drop in the exponential growth rate for certain multivariate generating functions at a critical parameter value, in even dimensions d at least 4. This result depends on computations in the homology of the…

Mirzakhani-Zograf proved the large genus asymptotic expansions of Weil-Petersson volumes and showed that the asymptotic coefficients are polynomials in $\mathbb Q[\pi^{-2},\pi^2]$. They also conjectured that these are actually polynomials…

In this paper we continue our earlier investigations into the asymptotic behaviour of infinite systems of coupled differential equations. Under the mild assumption that the so-called characteristic function of our system is completely…

We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…

We investigate the asymptotic number of elements of size $n$ in a particular class of closed lambda-terms (so-called $BCI(p)$-terms) which are related to axiom systems of combinatory logic. By deriving a differential equation for the…

Siegel-Veech constants are powerful tools for counting saddle connections on a translation surface. Their computation can be involved, most famously with recursive formulas that use intricate combinatorics or intersection theory. From these…

We prove that random triangulations of high genus contain very large expander subgraphs, answering a question of Benjamini. Our approach relies on new general criteria for arbitrary graphs to contain large expander subgraphs.

We define Poisson genericity for infinite sequences in any finite or countable alphabet with an invariant exponentially-mixing probability measure. A sequence is Poisson generic if the number of occurrences of blocks of symbols…