Related papers: Higher genus correlators for the hermitian matrix …
We classify, up to isomorphism, maximal curves covered by the Hermitian curve \mathcal H by a prime degree Galois covering. We also compute the genus of maximal curves obtained by the quotient of \mathcal H by several automorphisms groups.…
We formulate a notion of abstract loop equations, and show that their solution is provided by a topological recursion under some assumptions, in particular the result takes a universal form. The Schwinger-Dyson equation of the one and two…
We compute exact solutions of two--matrix models, i.e. detailed genus by genus expressions for the correlation functions of these theories, calculated without any approximation. We distinguish between two types of models, the unconstrained…
The behavior of correlation functions is studied in a class of matrix models characterized by a measure $\exp(-S)$ containing a potential term and an external source term: $S=N\tr(V(M)-MA)$. In the large $N$ limit, the short-distance…
In this paper we consider a reducible degeneration of a hyperelliptic curve of genus $g$. Using the Sato Grassmannian we show that the limits of hyperelliptic solutions of the KP-hierarchy exist and become soliton solutions of various…
Scaling limits of critical percolation models show major differences between low and high dimensional models. The article discusses the formulation of the continuum limit for the former case. A mathematical framework is proposed for the…
We present a hermitian matrix chain representation of the general solution of the Hirota bilinear difference equation of three variables. In the large N limit this matrix model provides some explicit particular solutions of continuous…
The quadratic cycle cover problem is the problem of finding a set of node-disjoint cycles visiting all the nodes such that the total sum of interaction costs between consecutive arcs is minimized. In this paper we study the linearization…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
A recursive method is derived to calculate all eigenvalue correlation functions of a random hermitian matrix in the large size limit, and after smoothing of the short scale oscillations. The property that the two-point function is…
Interest in the hulls of linear codes has been growing rapidly. More is known when the inner product is Euclidean than Hermitian. A shift to the latter is gaining traction. The focus is on a code whose Hermitian hull dimension and dual…
Multiple zeta values arise as special values of polylogarithms defined on Riemann surfaces of various genera. Building on the vast knowledge for classical and elliptic multiple zeta values, we explore a canonical extension of the formalism…
Iterative methods based on matrix splittings are useful in solving large sparse linear systems. In this direction, proper splittings and its several extensions are used to deal with singular and rectangular linear systems. In this article,…
It is well known that the unitary evolution of a closed $M-$level quantum system can be generated by a non-Hermitian Hamiltonian $H$ with real spectrum. Its Hermiticity can be restored via an amended inner-product metric $\Theta$. In…
We introduce and study the Hermitian matrix model with potential V(x)=x^2/2-stx/(1-tx), which enumerates the number of linear chord diagrams of fixed genus with specified numbers of backbones generated by s and chords generated by t. For…
Scattering amplitudes at loop level can be reduced to a basis of linearly independent Feynman integrals. The integral coefficients are extracted from generalized unitarity cuts which define algebraic varieties. The topology of an algebraic…
We elaborate upon and consolidate various recent developments focusing on the triality of questions offered by issues of basis building, unitarity and non-polylogarithmicity in quantum field theory, specifically for planar two loops. The…
We show how to calculate correlation functions of two matrix models. Our method consists in making full use of the integrable hierarchies and their reductions, which were shown in previous papers to naturally appear in multi--matrix models.…
The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…
We investigate complete arcs of degree greater than two, in projective planes over finite fields, arising from the set of rational points of a generalization of the Hermitian curve. The degree of the arcs is closely related to the number of…