Related papers: The Large D Limit of Planar Diagrams

We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in $\Rd$, decide…

We introduce a generalization of the O(N) field theory to N-colored membranes of arbitrary inner dimension D. The O(N) model is obtained for D->1, while N->0 leads to self-avoiding tethered membranes (as the O(N) model reduces to…

We reconsider the supermembrane in a Minkowski background and in the light-cone gauge as a one-dimensional gauge theory of area preserving diffeomorphisms (APDs). Keeping the membrane tension $T$ as an independent parameter we show that $T$…

Given a set of inequalities determined by homogeneous forms, the following intertwined results are established: (1) the volume of the real semi-algebraic domain determined by these inequalities is explicitly determined; it is shown to be…

We define an infinite sequence of new invariants, delta_n, of a group G that measure the size of the successive quotients of the derived series of G. In the case that G is the fundamental group of a 3-manifold, we obtain new 3-manifold…

Let X be a finite set of complex numbers and let A be a normal operator with spectrum X that acts on a separable Hilbert space H. Relative to a fixed orthonormal basis e_1,e_2, ... for H, A gives rise to a matrix whose diagonal is a…

A parquet approximation (generalized ladder diagrams) in matrix models is considered. By means of numerical calculations we demonstrate that in the large $N$ limit the parquet approximation gives an excellent agreement with exact results.

We determine under which conditions certain natural models of random constraint satisfaction problems have sharp thresholds of satisfiability. These models include graph and hypergraph homomorphism, the $(d,k,t)$-model, and binary…

Consider Ginibre's ensemble of $N \times N$ non-Hermitian random matrices in which all entries are independent complex Gaussians of mean zero and variance $\frac{1}{N}$. As $N \uparrow \infty$ the normalized counting measure of the…

The large size limit of matrix integrals with quartic potential may be used to count alternating links and tangles. The removal of redundancies amounts to renormalizations of the potential. This extends into two directions: higher genus and…

Sum rules are elegant formulas that relate entropy functionals to coefficients associated with orthogonal polynomials [Sim11]. In a series of paper (see for example [GNR16], [GNR17], [BSZ18a], [BSZ18b]), interesting connections have been…

The dimer model is a classical statistical mechanics model which is exactly solvable in two dimensions, but about which little is known in higher dimensions. In analogy with large $N$ limits in lattice gauge theory, we study a large $N$…

A rigidity theory is developed for bar-joint frameworks in linear matrix spaces endowed with a unitarily invariant norm. Analogues of Maxwell's counting criteria are obtained and minimally rigid matrix frameworks are shown to belong to the…

Let W be a projective variety of dimension n+1, L a free line bundle on W, X in $H^0(L^d)$ a hypersurface of degree d which is generic among those given by sums of monomials from $L$, and let $f : Y \to X$ be a generically finite map from a…

We consider the problem of enumerating d-irreducible maps, i.e. planar maps whose all cycles have length at least d, and such that any cycle of length d is the boundary of a face of degree d. We develop two approaches in parallel: the…

We derive the loop equations for the one Hermitian matrix model in any dimension. These are a consequence of the Schwinger-Dyson equations of the model. Moreover we show that in leading order of large $N$ the loop equations form a closed…

We calculate the expectation value of an arbitrary product of characteristic polynomials of complex random matrices and their hermitian conjugates. Using the technique of orthogonal polynomials in the complex plane our result can be written…

It is well-known that six-dimensional superconformal field theories can be exploited to unravel interesting features of lower-dimensional theories obtained via compactifications. In this short note we discuss a new application of 6d (2,0)…

We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…

We improve and expand in two directions the theory of norms on complex matrices induced by random vectors. We first provide a simple proof of the classification of weakly unitarily invariant norms on the Hermitian matrices. We use this to…