Related papers: Primitive asymptotics in $\phi^4$ vector theory

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…

The minimal degree of a permutation group $G$ is the minimum number of points not fixed by non-identity elements of $G$. Lower bounds on the minimal degree have strong structural consequences on $G$. In 2014 Babai proved that the…

The theory of graphical functions is generalized from scalar theories to theories with spin, leading to a numerator structure in Feynman integrals. The main part of this article treats the case of positive integer spin, which is obtained…

For a variety of pattern-avoiding classes, we describe the limiting distribution for the number of fixed points for involutions chosen uniformly at random from that class. In particular we consider monotone patterns of arbitrary length as…

We establish the asymptotic expansion in $\beta$ matrix models with a confining, off-critical potential, in the regime where the support of the equilibrium measure is a union of segments. We first address the case where the filling…

We study behaviour of the critical $O(N)$ vector model with quartic interaction in $2 \leq d \leq 6$ dimensions to the next-to-leading order in the large-$N$ expansion. We derive and perform consistency checks that provide an evidence for…

We report on the progress in the computation of the beta-functions of phi^4 theory and QCD in the large N expansion. For the former we give an analytic formula for the critical exponent which encodes higher order coefficients in the series…

The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. In this paper, we study the asymptotic dimension of metric spaces generated by graphs and their shortest path metric…

Let $F(G)$ be the number of spanning forests in a graph $G$ and $\mathcal{C}(n,d)$ be the set of all connected $d$-regular simple graphs of order $n$. Define $\widehat{f}_{d}=\liminf_{n\rightarrow \infty}\{F(G)^{1/n}:G\in…

We introduce the simplest minimal subtraction method for massive $\lambda \phi^{4}$ field theory with $O(N)$ internal symmetry, which resembles the same method applied to massless fields by using two steps. First, the utilization of the…

We compute the one-loop \beta-functions describing the renormalisation of the coupling constant \lambda and the frequency parameter \Omega for the real four-dimensional duality-covariant noncommutative \phi^4-model, which is renormalisable…

High temperature expansions for the susceptibility and the second correlation moment of the classical N-vector model (also known as the O(N) symmetric Heisenberg classical spin model or the as the lattice O(N) nonlinear sigma model) on the…

Given a class $\mathcal G$ of graphs, let ${\mathcal G}_n$ denote the set of graphs in $\mathcal G$ on vertex set $[n]$. For certain classes $\mathcal G$, we are interested in the asymptotic behaviour of a random graph $R_n$ sampled…

The free energy of a multi-component scalar field theory is considered as a functional W[G,J] of the free correlation function G and an external current J. It obeys non-linear functional differential equations which are turned into…

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 consider directed weighted graphs and define various families of path counting functions. Our main results are explicit formulas for the main term of the asymptotic growth rate of these counting functions, under some irrationality…

A transitive group $G$ of permutations of a set $\Omega$ is primitive if the only $G$-invariant equivalence relations on $\Omega$ are the trivial and universal relations. If $\alpha \in \Omega$, then the orbits of the stabiliser $G_\alpha$…

We establish the asymptotic behaviour of $\mu(G(n,p))$, the number of unlabelled induced subgraphs in the binomial random graph $G(n,p)$, for almost the entire range of the probability parameter $p=p(n)\in[0,1]$. In particular, we show that…

We obtain first order linear partial differential equations which are satisfied by exponential generating functions of two variables for the number of connected bipartite graphs with given Betti number. By solving these equations…

We develop a semiclassical framework to determine scaling dimensions of neutral composite operators in scalar conformal field theories. For the critical Ising $\lambda\phi^4$ theory in $d=4-\epsilon$, we obtain the full spectrum of…