Related papers: An algorithm for map enumeration
We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero…
We present a distributed anytime algorithm for performing MAP inference in graphical models. The problem is formulated as a linear programming relaxation over the edges of a graph. The resulting program has a constraint structure that…
We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs…
In this note, we consider a framework for the analysis of iterative algorithms which can described in terms of a structured set-valued operator. More precisely, at each point in the ambient space, we assume that the value of operator can be…
Grafting is a surgery on Riemann surfaces introduced by Thurston which connects hyperbolic geometry and the theory of projective structures on surfaces. We will discuss the space of projective structures in terms of the Thurston's geometric…
Gowers and Hatami initiated the inverse theory for the uniformity norms $U^k$ of matrix-valued functions on non-abelian groups by proving a $1\%$-inverse theorem for the $U^2$-norm and relating it to stability questions for almost…
We give an algorithm to calculate the minimal and maximal genus of the orientable closed surface where a graph $G$ can be embedded. For this, we construct some special branched coverings of the 2-sphere. We apply this algorithm to calculate…
Intersection graphs are well-studied in the area of graph algorithms. Some intersection graph classes are known to have algorithms enumerating all unlabeled graphs by reverse search. Since these algorithms output graphs one by one and the…
We define a family of maps on lattice paths, called sweep maps, that assign levels to each step in the path and sort steps according to their level. Surprisingly, although sweep maps act by sorting, they appear to be bijective in general.…
We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…
It is well known that so called Breuer-Hall positive maps used in entanglement theory are optimal. We show that these maps possess much more subtle property --- they are exposed. As a byproduct it proves that a Robertson map in the algebra…
UMAP is a non-parametric graph-based dimensionality reduction algorithm using applied Riemannian geometry and algebraic topology to find low-dimensional embeddings of structured data. The UMAP algorithm consists of two steps: (1) Compute a…
We show that given three hermitian matrices, what one could call a fuzzy representation of a membrane, there is a well defined procedure to define a set of oriented Riemann surfaces embedded in $R^3$ using an index function defined for…
We claim to give the definitive theory of what we call the `knee-jerk mapping', which is the basis for a class of optimization algorithms introduced by Baum, and promoted by Dempster, Laird, and Rubin under the name `EM algorithm'.
Accurately and globally mapping human infrastructure is an important and challenging task with applications in routing, regulation compliance monitoring, and natural disaster response management etc.. In this paper we present progress in…
The Baum-Connes conjecture predicts that a certain assembly map is an isomorphism. We identify the homotopy theoretical construction of the assembly map by Davis and L\"uck with the category theoretical construction by Meyer and Nest. This…
The correlated Erd\"os-R\'enyi random graph ensemble is a probability law on pairs of graphs with $n$ vertices, parametrized by their average degree $\lambda$ and their correlation coefficient $s$. It can be used as a benchmark for the…
Two compactifications of the space of holomorphic maps of fixed degree from a compact Riemann surface to a Grassmannian are studied. It is shown that the Uhlenbeck compactification has the structure of a projective scheme and is dominated…
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing rigorously the virial expansion for imperfect gases. We…
Unlabeled multigraphs have diverse applications across scientific fields, from transportation and social networks to polymer physics. In particular, multigraphs are essential for studying the relationship between the spatial organization…