Related papers: Asymptotic Enumeration of RNA Structures with Pseu…
An endhered (end-adhered) pattern is a subset of arcs in matchings, such that the corresponding starting points are consecutive and the same holds for the ending points. Such patterns are in one-to-one correspondence with the permutations.…
In this paper, we introduce a new method to construct evolving networks based on the construction of the Sierpinski gasket. Using self-similarity and renewal theorem, we obtain the asymptotic formula for average path length of our evolving…
Recently presented explicit formulae for asymptotic expansions of Feynman diagrams in the Sudakov limit are applied to typical two-loop diagrams. For a diagram with one non-zero mass these formulae provide an algorithm for analytical…
A compacted binary tree is a graph created from a binary tree such that repeatedly occurring subtrees in the original tree are represented by pointers to existing ones, and hence every subtree is unique. Such representations form a special…
The coefficient sequences of multivariate rational functions appear in many areas of combinatorics. Their diagonal coefficient sequences enjoy nice arithmetic and asymptotic properties, and the field of analytic combinatorics in several…
Non-coding RNA structure and function are essential to understanding various biological processes, such as cell signaling, gene expression, and post-transcriptional regulations. These are all among the core problems in the RNA field. With…
We consider the generating function of the sine point process on $m$ consecutive intervals. It can be written as a Fredholm determinant with discontinuities, or equivalently as the convergent series \begin{equation*} \sum_{k_{1},...,k_{m}…
We analyze a size-structured branching process in which individual cells grow exponentially according to a Feller square-root process and divide under general size-control mechanisms. We obtain exact expressions for the asymptotic…
The exponential generating function for the sequence A143405 in the OEIS is exp(exp(x)*(exp(x) - 1)). This paper analyzes the more general generating function exp(m*exp(b*x) + r*exp(d*x) + s) and provides asymptotics for the sequences…
We introduce a systematic approach to express generating functions for the enumeration of maps on surfaces of high genus in terms of a single generating function relevant to planar surfaces. Central to this work is the comparison of two…
The number of independent sets is equivalent to the partition function of the hard-core lattice gas model with nearest-neighbor exclusion and unit activity. We study the number of independent sets $m_{d,b}(n)$ on the generalized Sierpinski…
We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal…
We use the convolution method for arithmetic functions of several variables to deduce an asymptotic formula for the number of $k$-tuples of positive integers with components which are pairwise non-coprime and $\le x$. More generally, we…
We calculate exponential growth constants describing the asymptotic behavior of several quantities enumerating classes of orientations of arrow variables on the bonds of several types of directed lattice strip graphs $G$ of finite width and…
Given a knot $K$ in a closed orientable manifold $M$ we define the growth rate of the tunnel number of $K$ to be $gr_t(K) = \limsup_{n \to \infty} \frac{t(nK) - n t(K)}{n-1}$. As our main result we prove that the Heegaard genus of $M$ is…
In this paper, we analyze the asymptotic behavior of a system of interacting reinforced stochastic processes $({\bf Z}_n, {\bf N}_n)_n$ on a directed network of $N$ agents. The system is defined by the coupled dynamics ${\bf…
We study the extremal function $S^k_d(n)$, defined as the maximum number of regular $(k-1)$-simplices spanned by $n$ points in $\mathbb{R}^d$. For any fixed $d\geq2k\geq6$, we determine the asymptotic behavior of $S^k_d(n)$ up to a…
We derive bulk asymptotics of skew-orthogonal polynomials (sop) $\pi^{\bt}_{m}$, $\beta=1$, 4, defined w.r.t. the weight $\exp(-2NV(x))$, $V (x)=gx^4/4+tx^2/2$, $g>0$ and $t<0$. We assume that as $m,N \to\infty$ there exists an $\epsilon >…
In this work we demonstrate a novel separation between symmetric neural network architectures. Specifically, we consider the Relational Network~\parencite{santoro2017simple} architecture as a natural generalization of the…
We study the asymptotic behavior of two statistics defined on the symmetric group S_n when n tends to infinity: the number of elements of S_n having k records, and the number of elements of S_n for which the sum of the positions of their…