Related papers: Universality and asymptotics of graph counting pro…

This work is a follow-up of the article [Proc.\ London Math.\ Soc.\ 119(2):358--378, 2019], where the authors solved the problem of counting labelled 4-regular planar graphs. In this paper, we obtain a precise asymptotic estimate for the…

Using a method mixing Mellin-Barnes representation and Borel resummation we show how to obtain hyperasymptotic expansions from the (divergent) formal power series which follow from the perturbative evaluation of arbitrary "$N$-point"…

Motivated by their research on automorphism groups of pseudo-real Riemann surfaces, Bujalance, Cirre and Conder have conjectured that there are infinitely many primes $p$ such that $p+2$ has all its prime factors $q\equiv -1$ mod~$(4)$. We…

The survey covers several topics related to the asymptotic structure of various combinatorial and analytic objects such as the path spaces in graded graphs (Bratteli diagrams), invariant measures with respect to countable groups, etc. The…

Given a function $g=g(n)$ we let ${\mathcal E}^g$ be the class of all graphs $G$ such that if $G$ has order $n$ (that is, has $n$ vertices) then it is embeddable in some surface of Euler genus at most $g(n)$, and let ${\widetilde{\mathcal…

We obtain the double scaling asymptotic behavior of the recurrence coefficients and the partition function at the critical point of the $N\times N$ Hermitian random matrix model with cubic potential. We prove that the recurrence…

It has been noticed since around 2007 that certain enumeration problems can be solved when an analytic or algebraic curve is identified. This curve is the key to the problem. In these lectures, a few such examples are presented. One is a…

Tverberg-type theory aims to establish sufficient conditions for a simplicial complex $\Sigma$ such that every continuous map $f\colon \Sigma \to \mathbb{R}^d$ maps $q$ points from pairwise disjoint faces to the same point in…

Let A be the algebra generated by the power series \sum n^{n-1} q^n/n! and \sum n^n q^n /n! . We prove that many natural generating functions lie in this algebra: those appearing in graph enumeration problems, in the intersection theory of…

This manuscript develops a novel understanding of non-polar solutions of the discrete Painlev\'e I equation (dP1). As the non-autonomous counterpart of an analytically completely integrable difference equation, this system is endowed with a…

The theory of orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to functional-difference…

Let V be a compact real analytic surface with isolated singularities embedded in $R^N$, and assume its smooth part is equipped with a Riemannian metric that is induced from some analytic Riemannian metric on $R^N$. We prove: 1. Each point…

In this paper, we found the Moore-Penrose generalized inverse of adjacency matrix of an undirected graph, explicitly. We proved that the matrix $R_\lambda= [r_{ij}]$ is nonsingular where $r_{ii}=\frac{1}{\lambda}+ \deg v_i$ and $r_{ij}=\mid…

We study the asymptotics of recurrence coefficients for monic orthogonal polynomials p_n(z) with the quartic exponential weight exp [-N (1/2 z^2 + t/4 z^4)], where t is complex. Our goals are: A) to describe the regions of different…

We investigate the spectral properties of the Dirichlet Laplacian on large finite metric balls within irregular infinite graphs of quadratic volume growth. We consider an exhaustion $G_n = B_{R_n}(x_0)$ and the spectral zeta value $Z_n(1) =…

We apply the Euler--Maclaurin formula to find the asymptotic expansion of the sums $\sum_{k=1}^n (\log k)^p / k^q$, ~$\sum k^q (\log k)^p$, ~$\sum (\log k)^p /(n-k)^q$, ~$\sum 1/k^q (\log k)^p $ in closed form to arbitrary order ($p,q…

Let $G = (V, E)$ be a connected graph, and let $T$ in $V$ be a subset of vertices. An orientation of $G$ is called $T$-odd if any vertex $v \in V$ has odd in-degree if and only if it is in $T$. Finding a T -odd orientation of G can be…

We propose a new type of approximate counting algorithms for the problems of enumerating the number of independent sets and proper colorings in low degree graphs with large girth. Our algorithms are not based on a commonly used Markov chain…

In this work, we introduce the notion of Gevrey asymptotic expansion and we show how the classical concept of a convergent power series can be generalized to include the case in which the radius of convergence is zero. This technique can be…

Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…