Related papers: Matrix integrals and enumeration of maps
The chapter aims to explore the application of graph theory and networks in the recommendation domain, encompassing the mathematical models that form the foundation for the algorithms and recommendation systems developed based on them. The…
This document is an exposition of an assortment of open problems arising from the exact enumeration of (perfect) matchings of finite graphs. Roughly half have been solved at the time of this writing; see the document "Twenty Open Problems…
In graph learning, maps between graphs and their subgraphs frequently arise. For instance, when coarsening or rewiring operations are present along the pipeline, one needs to keep track of the corresponding nodes between the original and…
Given a graph $G$, the maximal induced subgraphs problem asks to enumerate all maximal induced subgraphs of $G$ that belong to a certain hereditary graph class. While its optimization version, known as the minimum vertex deletion problem in…
A classical approach for surface classification is to find a compact algebraic representation for each surface that would be similar for objects within the same class and preserve dissimilarities between classes. We introduce Self…
We consider the simplest gauge theories given by one- and two- matrix integrals and concentrate on their stringy and geometric properties. We remind general integrable structure behind the matrix integrals and turn to the geometric…
In a brief review, we discuss interrelations between arbitrary solutions of the loop equations that describe Hermitean one-matrix model and particular (multi-cut) solutions that describe concrete matrix integrals. These latter ones enjoy a…
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
We study multiplicative nested sums, which are generalizations of harmonic sums, and provide a calculation through multiplication of index matrices. Special cases interpret the index matrices as stochastic transition matrices of random…
We introduce a family of models, which we name matrix models associated with children's drawings -- the so-called dessin d'enfant. Dessins d'enfant are graphs of a special kind drawn on a closed connected orientable surface (in the sky).…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
We explain connections among several, a priori unrelated, areas of mathematics: combinatorics, algebraic statistics, topology and enumerative algebraic geometry. Our focus is on discrete invariants, strongly related to the theory of…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
In this survey, we discuss some basic problems concerning random matrices with discrete distributions. Several new results, tools and conjectures will be presented.
The mathematics underlying the connection between deconstruction lattices and locality diagrams of conformal models is developed from scratch, with special emphasis on classification issues. In particular, the notions of equilocality…
Convenient parameterizations of matrices in terms of vectors transform (certain classes of) matrix equations into covariant (hence rotation-invariant) vector equations. Certain recently introduced such parameterizations are tersely…
Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…
We construct a class of positive linear maps on matrix algebras. We find conditions when these maps are atomic, decomposable and completely positive. We obtain a large class of atomic positive linear maps. As applications in quantum…
We study the combinatorial and structural properties of the circle map sequences. We introduce an embedding procedure which gives a map from the hull(closure of the set of translates) to the sequence of embedding operations through which we…