Related papers: Asymptotic Enumeration of RNA Structures with Pseu…

We present a strategy for computing asymptotics of coefficients of $d$-variate algebraic generating functions. Using known constructions, we embed the coefficient array into an array represented by a rational generating functions in $d+1$…

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 this paper we analyze the length-spectrum of blocks in $\gamma$-structures. $\gamma$-structures are a class of RNA pseudoknot structures that plays a key role in the context of polynomial time RNA folding. A $\gamma$-structure is…

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 revisit staircases for words and prove several exact as well as asymptotic results for longest left-most staircase subsequences and subwords and staircase separation number, the latter being defined as the number of consecutive maximal…

The main theme of this paper is to study for a symplectomorphism of a compact surface, the asymptotic invariant which is defined to be the growth rate of the sequence of the total dimensions of symplectic Floer homologies of the iterates of…

We continue our work [arXiv:2403.07628] on asymptotic expansions at the soft edge for the classical $n$-dimensional Gaussian and Laguerre random matrix ensembles. By revisiting the construction of the associated skew-orthogonal polynomials…

We propose a conjecture to compute the all-order asymptotic expansion of the colored Jones polynomial of the complement of a hyperbolic knot, J_N(q = exp(2u/N)) when N goes to infinity. Our conjecture claims that the asymptotic expansion of…

We extend an hypergraph representation, introduced by Finkelstein and Roytberg, to unify dynamic programming algorithms in the context of RNA folding with pseudoknots. Classic applications of RNA dynamic programming energy minimization,…

I compute several terms of the asymptotic expansion of the number of connected labelled graphs with n nodes and m edges, for small k=m-n.

We give asymptotic expansions for the moments of the $M_2$-rank generating function and for the $M_2$-rank generating function at roots of unity. For this we apply the Hardy-Ramanujan circle method extended to mock modular forms. Our…

We find asymptotical expansions as $\nu \to 0$ for integrals of the form $\int_{\mathbb{R}^d} F(x) / \big(\omega(x)^2 + \nu^2\big)\, dx$, where sufficiently smooth functions $F$ and $\omega$ satisfy natural assumptions for their behaviour…

In this work we establish under certain hypotheses the $N \to +\infty$ asymptotic expansion of integrals of the form $$\mathcal{Z}_{N,\Gamma}[V] \, = \, \int_{\Gamma^N} \prod_{ a < b}^{N}(z_a - z_b)^\beta \, \prod_{k=1}^{N} \mathrm{e}^{ - N…

We enumerate possible topologies of pseudoknots in single-stranded RNA molecules. We use a steepest-descent approximation in the large N matrix field theory, and a Feynman diagram formalism to describe the resulting pseudoknot structure.

Consider a non-negative sequence $c_n = h(n) \cdot n^{\alpha-1} \cdot \rho^{-n}$, where $h$ is slowly varying, $\alpha>0$, $0<\rho<1$ and $n\in\mathbb{N}$. We investigate the coefficients of $G(x,y) = \prod_{k\ge1}(1-x^ky)^{-c_k}$, which is…

Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence…

We describe rational knots with any of the possible combinations of the properties (a)chirality, (non-)positivity, (non-)fiberedness, and unknotting number one (or higher), and determine exactly their number for a given number of crossings…

The multiplicative structure of the trivial symplectic groupoid over $\mathbb R^d$ associated to the zero Poisson structure can be expressed in terms of a generating function. We address the problem of deforming such a generating function…

Here we examine the number of ways to partition an integer $n$ into $k$th powers when $n$ is large. Simplified proofs of some asymptotic results of Wright are given using the saddle-point method, including exact formulas for the expansion…

In this paper, the author (1) compares subnormal closures of finite sets in free groups; (2) proves that the exponential growth rate (e.g.r.), i.e., the limit of the n-th roots of g(n), where g(n) is the growth function of a subgroup H with…