Related papers: Primitive asymptotics in $\phi^4$ vector theory
Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…
We establish formulae for the asymptotic growth (with respect to the scaling dimension) of the number of operators in effective field theory, or equivalently the number of $S$-matrix elements, in arbitrary spacetime dimensions and with…
We obtain bivariate asymptotics for the number of (unicellular) combinatorial maps (a model of discrete surfaces) as both the size and the genus grow. This work is related to two research topics that have been very active recently:…
We derive a simple functional equation with two catalytic variables characterising the generating function of 3-stack-sortable permutations. Using this functional equation, we extend the 174-term series to 1000 terms. From this series, we…
A Feynman period is a particular residue of a scalar Feynman integral which is both physically and number theoretically interesting. Two ways in which the graph theory of the underlying Feynman graph can illuminate the Feynman period are…
Supersymmetric sectors of $\mathcal{N}=4$ super-Yang-Mills theory motivate the study of the partition function for the counting of gauge-invariant functions of $d=2,3$ matrices transforming under the adjoint action of $U(N)$. The partition…
A spectral problem is considered in a thin $3D$ graph-like junction that consists of three thin curvilinear cylinders that are joined through a domain (node) of the diameter $\mathcal{O}(\varepsilon),$ where $\varepsilon$ is a small…
We consider graph classes $\mathcal G$ in which every graph has components in a class $\mathcal{C}$ of connected graphs. We provide a framework for the asymptotic study of $\lvert\mathcal{G}_{n,N}\rvert$, the number of graphs in…
The logarithmic running of marginal double-trace operators is a general feature of 4-d field theories containing scalar fields in the adjoint or bifundamental representation. Such operators provide leading contributions in the large N…
We study the Cardy-like asymptotics of the 4d $\mathcal N=4$ index and demonstrate the existence of partially deconfined phases where the asymptotic growth of the index is not as rapid as in the fully deconfined case. We then take the…
We apply round-off to planar rotations, obtaining a one-parameter family of invertible maps of a two-dimensional lattice. As the angle of rotation approaches pi/2, the fourth iterate of the map produces piecewise-rectilinear motion, which…
The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…
We recalculate the beta functions of higher derivative gravity in four dimensions using the one--loop approximation to an Exact Renormalization Group Equation. We reproduce the beta functions of the dimensionless couplings that were known…
It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…
We use Asymptotic Pade Approximants (APAP's) to predict the four- and five-loop \beta-functions in QCD and N=1 supersymmetric QCD (SQCD), as well as the quark mass anomalous dimensions in Abelian and non-Abelian gauge theories. We show how…
Pad\'e-improvement of four-loop beta-functions in massive phi^4 scalar field theory is shown to predict the known five-loop contribution with astonishing (0.2%) accuracy, supporting the applicability of Pade-summations for approximating…
We calculate the quantum corrections to the two-point function of four dimensional topologically massive non-Abelian vector fields at one loop order for $SU(N)$ gauge theory in Feynman-'t Hooft gauge. We calculate the beta function of the…
A group $G$ of permutations of a set $\Omega$ is {\em primitive} if it acts transitively on $\Omega$, and the only $G$-invariant equivalence relations on $\Omega$ are the trivial and universal relations. A graph $\Gamma$ is {\em primitive}…
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$. Babai conjectured that if a primitive…
Given an orientation-preserving diffeomorphism of the interval [0;1], consider the uniform norm of the differential of its n-th iteration. We get a function of n called the growth sequence. Its asymptotic behaviour is an interesting…