Related papers: Growth problems in diagram categories
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 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…
It is derived the explicit asymptotic expression in $n$ for the coefficient $c_n$ of the generating function for multiplicative structures with sub exponential rate of growth of $c_n,$ as $n\to\infty$.
In this text, we prove the existence of an asymptotic growth rate of the number of dominating sets (and variants) on finite rectangular grids, when the dimensions of the grid grow to infinity. Moreover, we provide, for each of the variants,…
We consider a number of combinatorial problems in which rational generating functions may be obtained, whose denominators have factors with certain singularities. Specifically, there exist points near which one of the factors is asymptotic…
We study ideal-simple commutative semirings and summarize the results giving their classification, in particular when they are finitely generated. In the principal case of (para)semifields, we then consider their minimal number of…
The meander problem is a combinatorial problem which provides a toy model of the compact folding of polymer chains. In this paper we study various questions relating to the enumeration of meander diagrams, using diagrammatical methods. By…
A new approach to the problem of finding the asymptotical behaviour of large orders of semiclassical expansion is suggested. Asymptotics of high orders not only for eigenvalues, but also for eigenfunctions, are constructed. Thus, one can…
Three-dimensional random tensor models are a natural generalization of the celebrated matrix models. The associated tensor graphs, or 3D maps, can be classified with respect to a particular integer or half-integer, the degree of the…
Asymptotic expansions are derived as power series in a small coefficient entering a nonlinear multiplicative noise and a deterministic driving term in a nonlinear evolution equation. Detailed estimates on remainders are provided.
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…
In this paper we investigate the growth rate of the number of all possible paths in graphs with respect to their length in an exact analytical way. Apart from the typical rates of growth, i.e. exponential or polynomial, we identify…
This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth…
We introduce some new symmetric tensor categories based on the combinatorics of trees: a discrete family $\mathcal{D}(n)$, for $n \ge 3$ an integer, and a continuous family $\mathcal{C}(t)$, for $t \ne 1$ a complex number. The construction…
We prove a collection of asymptotic density results for several interesting classes of the $I$-graphs. Specifically, we quantify precisely the proportion of $I$-graphs that are generalised Petersen graphs as well as those that are…
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…
A condition is given, under which a general lattice point counting function is asymptotic to the corresponding ball volume growth function. This is then used to give height asymptotics in the style of the Batyrev-Manin Conjecture for…
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…
Starting from an abelian category A such that every object has only finitely many subobjects we construct a semisimple tensor category T. We show that T interpolates the categories Rep(Aut(p),K) where p runs through certain projective…
We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally…