Related papers: On the refined counting of graphs on surfaces
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
Subgraph counting aims to count the number of occurrences of a subgraph T (aka as a template) in a given graph G. The basic problem has found applications in diverse domains. The problem is known to be computationally challenging - the…
A framework to represent and compute two-loop $N$-point Feynman diagrams as double-integrals is discussed. The integrands are 'generalised one-loop type" multi-point functions multiplied by simple weighting factors. The final integrations…
We highlight the latest developments in computing higher-order scattering amplitudes with massive internal propagators. The contributing Feynman integrals often lead to special classes of functions, for example, functions associated with…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
Using von Neumann algebras, we extend the theory of quantum computation on a graph to a theory of computation on an arbitrary topological space.
In this paper we consider an elementary, and largely unexplored, combinatorial problem in low-dimensional topology. Consider a real 2-dimensional compact surface $S$, and fix a number of points $F$ on its boundary. We ask: how many…
In this article, we extend several algebraic graph analysis methods to bipartite networks. In various areas of science, engineering and commerce, many types of information can be represented as networks, and thus the discipline of network…
We study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs. Such methods have been recently applied to obtain various properties of…
Using a quadratic version of the Bott residue theorem, we give a quadratic refinement of the count of twisted cubic curves on hypersurfaces and complete intersections in a projective space.
Let $G$ be a finite group. In this paper we present a tool for counting the number of principle $G$-bundles over a surface. As an application, we express (non-standard) generating functions for double Hurwitz numbers as integrals over…
Riemann surfaces which are set by algebraic, algebroid and inverse functions are considered. A method for describing these Riemann surfaces by graphs is proposed. Each such Riemann surface is assigned to a special type of graph - profile.…
Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of…
Let $n,k$ be positive integers such that $n\geq 3$, $k < \frac {n}{2} $. Let $q$ be a power of a prime $p$ and $\mathbb{F}_q$ be a finite field of order $q$. Let $V(q,n)$ be a vector space of dimension $n$ over $\mathbb{F}_q$. We define the…
Marked vertex diagrams provide a combinatorial way to represent knotted surfaces in $\mathbb{R}^4$; including virtual crossings allows for a theory of virtual knotted surfaces and virtual cobordisms. Biquandle counting invariants are…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
We present a rigorous proof of the convergence theorem for the Feynman graphs in arbitrary massive Euclidean quantum field theories on non-commutative R^d (NQFT). We give a detailed classification of divergent graphs in some massive NQFT…
This is an exposition of results on the existence problem of $\pi_1$-injective immersed and embedded surfaces in graph-manifolds, and also of nonpositively curved metrics on graph-manifolds, obtained by different authors. The results are…
Arborescent knots are the ones which can be represented in terms of double fat graphs or equivalently as tree Feynman diagrams. This is the class of knots for which the present knowledge is enough for lifting topological description to the…
Local and global illumination were recently defined in Riemannian manifolds to visualize classical Non-Euclidean spaces. This work focuses on Riemannian metric construction in $\mathbb{R}^3$ to explore special effects like warping, mirages,…