Related papers: Path count asymptotics and Stirling numbers
In this paper, we study some combinations of the degenerate and incomplete Stirling numbers of the second kind. We use a combinatorial approach and provide some asymptotic results.
Solutions to linear controlled differential equations can be expressed in terms of iterated path integrals of the driving path. This collection of iterated integrals encodes essentially all information about the driving path. While upper…
Stirling numbers of the first kind are common in number theory and combinatorics; through Ewen's sampling formula, these numbers enter into the calculation of several population genetics statistics, such as Fu's Fs. In previous papers we…
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…
Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.
Stirling numbers of both kinds are linked to each other via two combinatorial identities due to Schl\"afli and Gould. Using q-analogs of Stirling numbers defined as inversion generating functions, we provide q-analogs of the two identities.…
In this paper we count the number of paths and cycles in complete graphs by using the number $e$. Also, we compute the number of derangements in same way. Connection by $e$ yields some nice formulas for the number of derangements, such as…
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…
We compute explicitly (modulo solutions of certain algebraic equations) the spectra of infinite graphs obtained by attaching one or several infinite paths to some vertices of certain finite graphs. The main result concerns a canonical form…
Random recursive hypergraphs grow by adding, at each step, a vertex and an edge formed by joining the new vertex to a randomly chosen existing edge. The model is parameter-free, and several characteristics of emerging hypergraphs admit neat…
Let $G$ be a directed graph on finitely many vertices and edges, and assign a positive weight to each edge on $G$. Fix vertices $u$ and $v$ and consider the set of paths that start at $u$ and end at $v$, self-intersecting in any number of…
The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count…
We study the distribution of partition parts in arithmetic progressions and find asymptotic results that capture all exponentially growing terms. This is accomplished by studying the behavior of non-modular Eisenstein series that appear in…
The concept of graph compositions is related to several number theoretic concepts, including partitions of positive integers and the cardinality of the power set of finite sets. This paper examines graph compositions where the total number…
A few years ago various disparities for Laplacians on graphs and manifolds were discovered. The corresponding results are mostly related to volume growth in the context of unbounded geometry. Indeed, these disparities can now be resolved by…
We realize the Apollonian group associated to an integral Apollonian circle packings, and some of its generalizations, as a group of automorphisms of an algebraic surface. Borrowing some results in the theory of orbit counting, we study the…
We consider the class of directed graphs with $N\geq 1$ edges and without loops shorter than $k\geq1$. Using the concept of a labelled graph, we determine graphs from this class that maximize the number of all paths of length $k$. Then we…
We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on…
We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally…