Related papers: On the refined counting of graphs on surfaces
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…
Group Field Theories (GFT) are quantum field theories over group manifolds; they can be seen as a generalization of matrix models. GFT Feynman graphs are tensor graphs generalizing ribbon graphs (or combinatorial maps); these graphs are…
An ordinary voltage graph embedding of a graph in a surface encodes a certain kind of highly symmetric covering space of that surface. Given an ordinary voltage graph embedding of a graph $G$ in a surface with voltage group $A$ and a…
The problems of determining the permutation-representation number (prn) and the representation number of bipartite graphs are open in the literature. Moreover, the decision problem corresponding to the determination of the prn of a…
Mining graph data has become a popular research topic in computer science and has been widely studied in both academia and industry given the increasing amount of network data in the recent years. However, the huge amount of network data…
Graphs are a representation of structured data that captures the relationships between sets of objects. With the ubiquity of available network data, there is increasing industrial and academic need to quickly analyze graphs with billions of…
We present an extended version of Riemannian geometry suitable for the description of current formulations of double field theory (DFT). This framework is based on graded manifolds and it yields extended notions of symmetries, dynamical…
Codes in the Grassmannian space have found recently application in network coding. Representation of $k$-dimensional subspaces of $\F_q^n$ has generally an essential role in solving coding problems in the Grassmannian, and in particular in…
We study invariants of virtual graphoids, which are virtual spatial graph diagrams with two distinguished degree-one vertices modulo graph Reidemeister moves applied away from the distinguished vertices. Generalizing previously known…
We point out an explicit connection between graphs drawn on compact Riemann surfaces defined over the field $\bar{\mathbb{Q}}$ of algebraic numbers --- so-called Grothendieck's {\it dessins d'enfants} --- and a wealth of distinguished…
Embedding graphs in continous spaces is a key factor in designing and developing algorithms for automatic information extraction to be applied in diverse tasks (e.g., learning, inferring, predicting). The reliability of graph embeddings…
The inductive biases of graph representation learning algorithms are often encoded in the background geometry of their embedding space. In this paper, we show that general directed graphs can be effectively represented by an embedding model…
We establish a direct connection between scattering amplitudes in planar four-dimensional theories and a remarkable mathematical structure known as the positive Grassmannian. The central physical idea is to focus on on-shell diagrams as…
A seminal technique of theoretical physics called Wick's theorem interprets the Gaussian matrix integral of the products of the trace of powers of Hermitian matrices as the number of labelled maps with a given degree sequence, sorted by…
The work provides a brief intuitive overview theory of graph on surfaces. We considers graphs with an additional structure, wich we call discs with ribbons, also known as one-vertex ribbon graphs. And solves the problem (Skopenkov's) about…
A prismatoid is a polytope with all its vertices contained in two parallel facets, called its bases. Its width is the number of steps needed to go from one base to the other in the dual graph. The author recently showed in arXiv:1006.2814…
This expository article supplies the mathematical background underpinning the braid representation calculator introduced in arXiv:2212.00831; those representations describe the sets of logic gates available to a topological quantum computer…
We define solvable quantum mechanical systems on a Hilbert space spanned by bipartite ribbon graphs with a fixed number of edges. The Hilbert space is also an associative algebra, where the product is derived from permutation group…
This paper develops a form of finite knot theory as a diagrammatic sequel to the ideal-stratum and deformation-persistence framework for knot types. Thick representatives in bounded ropelength sublevel spaces are studied through the finite…
We use simple iterated one-loop graphs in massless Yukawa theory and QED to pose the following question: what are the symmetries of the residues of a graph under a permutation of places to insert subdivergences. The investigation confirms…