Related papers: Coloured combinatorial maps and quartic bi-tracial…
We have considered an equilibrium ensemble of large Erd\H{o}s-Renyi topological random networks with fixed vertex degree and two types of vertices, black and white, prepared randomly with the bond connection probability, $p$. The network…
We construct a model of quantum gravity in which dimension, topology and geometry of spacetime are dynamical. The microscopic degree of freedom is a real rectangular matrix whose rows label internal flavours, and columns label spatial…
The problem of constructing a quantum theory of gravity has been tackled with very different strategies, most of which relying on the interplay between ideas from physics and from advanced mathematics. On the mathematical side, a central…
In three spatial dimensions, in the unitary limit of a non-relativistic quantum Bose or Fermi gas, the scattering length diverges. This occurs at a renormalization group fixed point, thus these systems present interesting examples of…
The convolution of indicators of two conjugacy classes on the symmetric group S_q is usually a complicated linear combination of indicators of many conjugacy classes. Similarly, a product of the moments of the Jucys--Murphy element involves…
We consider three dimensional gravity with a positive cosmological constant and non- zero gravitational Chern-Simons term. This theory has inflating de Sitter solutions and local metric degrees of freedom. The Euclidean signature partition…
We show that a Hagedorn spectrum (i.e., spectrum where the number of hadrons grows exponentially with the mass) emerges automatically in large $N_c$ QCD in 2+1 and 3+1 dimensions. The approach is based on the study of Euclidean space…
For chaotic scattering on quantum graphs, the semiclassical approximation is exact. We use this fact and employ supersymmetry, the colour-flavour transformation, and the saddle-point approximation to calculate the exact expression for the…
We review combinatorial quantum gravity, an approach which combines Einstein's idea of dynamical geometry with Wheeler's "it from bit" hypothesis in a model of dynamical graphs governed by the coarse Ollivier-Ricci curvature. This drives a…
Gaining insight about ensembles of magnetic configurations, that could originate the confining string tension between quarks, constitutes a major concern in current lattice investigations. This interest also applies to a different approach,…
We consider the 1-equivariant energy critical wave maps problem with two-sphere target. Using a method based on matched asymptotic expansions, we construct infinite time relaxation, blow-up, and intermediate types of solutions that have…
Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…
The four major asymptotic level density laws of random matrix theory may all be showcased though their Jacobi parameter representation as having a bordered Toeplitz form. We compare and contrast these laws, completing and exploring their…
Let $G$ be the unit distance graph in the plane. A well-known problem in combinatorial geometry is that of determining the chromatic number of $G$. It is known that $4\le \chi(G)\le 7$. The upper bound of 7 is obtained using tilings of the…
We study the plane-symmetric collision of two gravitational waves and describe the global spacetime geometry generated by this collision. To this end, we formulate the characteristic initial value problem for the Einstein equations, when…
From a two-agent, two-strategy congestion game where both agents apply the multiplicative weights update algorithm, we obtain a two-parameter family of maps of the unit square to itself. Interesting dynamics arise on the invariant diagonal,…
Matrix field theory is a combinatorially non-local field theory which has recently been found to be a non-trivial but solvable QFT example. To generalize such non-perturbative structures to other models, a more combinatorial understanding…
In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one…
Many practical problems in almost all scientific and technological disciplines have been classified as computationally hard (NP-hard or even NP-complete). In life sciences, combinatorial optimization problems frequently arise in molecular…
We develop a framework for quantitative convergence analysis of Picard iterations of expansive set-valued fixed point mappings. There are two key components of the analysis. The first is a natural generalization of single-valued averaged…