Related papers: Path count asymptotics and Stirling numbers
In this paper, the asymptotic formulas for Eulerian numbers, refined Eulerian numbers and the coefficients of descent polynomials are obtained directly from the spline interpretations of these numbers. Having related these numbers directly…
The discrete distribution of the length of longest increasing subsequences in random permutations of $n$ integers is deeply related to random matrix theory. In a seminal work, Baik, Deift and Johansson provided an asymptotics in terms of…
We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve…
A particular case of a causal set is considered that is a directed dyadic acyclic graph. This is a model of a discrete pregeometry on a microscopic scale. The dynamics is a stochastic sequential growth of the graph. New vertexes of the…
The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Any graph which is an induced subgraph of a graph in this sequence is called a Burling graph. These graphs have attracted some attention because they…
Let $p$ be a prime and $n$ a positive integer such that $\sqrt{\frac p2} + 1 \leq n \leq \sqrt{p}$. For any arithmetic progression $A$ of length $n$ in $\mathbb{F}_p$, we establish an asymptotic formula for the number of directions…
Associated to Legendrian links in the standard contact three-space, Ruling polynomials are Legendrian isotopy invariants, which also compute augmentation numbers, that is, the points-counting of augmentation varieties for Legendrian links…
Using recent results from the theory of integer points close to smooth curves, we give an asymptotic formula for the distribution of values of a class of integer-valued prime-independent multiplicative functions.
We investigate the probability distribution of Conley-Zehnder indices associated with Brownian random paths on Sp(2n, R) that start at the identity. In the case of n = 1, we prove that the distribution has the same moment asymptotics as the…
Two-dimensional mappings obtained by coupling two piecewise increasing expanding maps are considered. Their dynamics is described when the coupling parameter increases in the expanding domain. By introducing a coding and by analysing an…
Determining unknotting numbers is a large and widely studied problem. We consider the more general question of the unknotting number of a spatial graph. We show the unknotting number of spatial graphs is subadditive. Let $g$ be an embedding…
Preferential attachment in a directed scale-free graph is widely used to model the evolution of social networks. Statistical analyses of social networks often relies on node based data rather than conventional repeated sampling. For our…
We construct an explicit generating sets $F_n$ and $\tilde F_n$ of the alternating and the symmetric groups, which make the Cayley graphs $C(Alt(n), F_n)$ and $C(Sym(n), \tilde F_n)$ a family of bounded degree expanders for all sufficiently…
We give explicit estimates for the Stirling numbers of the second kind $S(n,m)$. With a few exceptions, such estimates are asymptotically sharp. The form of these estimates varies according to $m$ lying in the central or non-central regions…
We establish asymptotic formulas for counting rational points near finite type curves on the plane, generalizing Huang's result.
We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lower bounds on the maximum number of vertices of such a graph with diameter 2 and degree $d$. We completely determine the asymptotic behaviour…
We derive asymptotic formulas for central extended binomial coefficients, which are generalizations of binomial coefficients. To do so, we relate the exact distribution of the sum of independent discrete uniform random variables to the…
We present a new derivation of the distance-dependent two-point function for planar Eulerian triangulations and give expressions for more refined generating functions where we also control hull perimeters. These results are obtained in the…
In a previous paper the authors defined the growth rate of the tunnel number of knots, an invariant that measures that asymptotic behavior of the tunnel number under connected sum. In this paper we calculate the growth rate of the tunnel…
The scramble number of a graph provides a lower bound for gonality and an upper bound for treewidth, making it a graph invariant of interest. In this paper we study graphs of scramble number at most two, and give a classification of all…