Related papers: Introducing irrational enumeration: analytic combi…
Given a Dirichlet series $L(s) = \sum a_n n^{-s}$, the asymptotic growth rate of $\sum_{n\le X} a_n$ can be determined by a Tauberian theorem. Bounds on the error term are typically controlled by the size of $|L(\sigma+it)|$ for fixed real…
We prove the irrationality of some factorial series. To do so we combine methods from elementary and analytic number theory with methods from the theory of uniform distribution.
We discuss two theorems in analytic number theory and combinatory analysis that have seen increased use in recent years. A corollary to a Tauberian theorem of Ingham allows one to quickly prove asymptotic formulas for arithmetic sequences,…
This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…
We derive asymptotic bounds for the ordinary generating functions of several classical arithmetic functions, including the Moebius, Liouville, and von Mangoldt functions. The estimates result from the Korobov-Vinogradov zero-free region for…
In the past, empirical evidence has been presented that Hilbert series of symplectic quotients of unitary representations obey a certain universal system of infinitely many constraints. Formal series with this property have been called…
We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We establish asymptotic estimates of Mathieu-type series defined by sequences with power-logarithmic or factorial behavior. By taking the Mellin transform, the problem is mapped to the singular behavior of certain Dirichlet series, which is…
The exponential generating functions of {n^(n+m)} for arbitrary integer m are expressed as rational functions of the e.g.f. of {n^(n-1)} [the tree function] and then of the e.g.f. of {n^n} [the endofunction function]. The coefficients in…
We introduce two new binary operations with combinatorial species; the arithmetic product and the modified arithmetic product. The arithmetic product gives combinatorial meaning to the product of Dirichlet series and to the Lambert series…
We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations,…
Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…
We establish formulae for the asymptotic growth (with respect to the scaling dimension) of the number of operators in effective field theory, or equivalently the number of $S$-matrix elements, in arbitrary spacetime dimensions and with…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
To obtain the Dirichlet series for complex powers of the Riemann zeta function, we define and study the basic properties of a sequence of polynomials that, used as coefficients of the respective terms of the Dirichlet series of the Riemann…
We introduce a family of atomic measures on free groups generated by no-return random walks. These measures are shown to be very convenient for comparing "relative sizes" of subgroups, context-free and regular subsets (that, subsets…
In this paper, we study a Dirichlet series generated by powers of harmonic numbers. As an application of these functions, we derive certain series involving harmonic numbers. We also study the analytic properties of these Dirichlet series…
The paper considers a universal approach that allows one to quite simply obtain nonlinear asymptotic estimates of various summation functions. It is shown the application of this approach to the asymptotic estimation of divergent Dirichlet…
The theory of summability of divergent series is a major branch of mathematical analysis that has found important applications in engineering and science. It addresses methods of assigning natural values to divergent sums, whose…