Related papers: Sinh-Gordon equations on finite graphs
In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…
Let $G=(V,E)$ be a connected finite graph. We study the existence of solutions for the following generalized Chern-Simons equation on $G$ \begin{equation*} \Delta u=\lambda \mathrm{e}^{u}\left(\mathrm{e}^{u}-1\right)^{5}+4 \pi…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
The article starts with some introductory material about resolution graphs of normal surface singularities (definitions, topological/homological properties, etc). We then discuss the case when the normal surface singularity is an N-fold…
We provide algorithms involving edge slides, for a connected simple graph to evolve in a finite number of steps to another connected simple graph in a prescribed configuration, and for the regularization of such a graph by the minimization…
We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on…
Recent works on machine learning for combinatorial optimization have shown that learning based approaches can outperform heuristic methods in terms of speed and performance. In this paper, we consider the problem of finding an optimal…
Bidirected graphs generalize directed and undirected graphs in that edges are oriented locally at every node. The natural notion of the degree of a node that takes into account (local) orientations is that of net-degree. In this paper, we…
We demonstrate that for the sine-Gordon theory at the free fermion point, the 2-point correlation functions of the fields $\exp (i\al \Phi )$ for $0< \al < 1$ can be parameterized in terms of a solution to a sinh-Gordon-like equation. This…
In this paper we give a unified approach in categorical setting to the problem of finding the Galois closure of a finite cover, which includes as special cases the familiar finite separable field extensions, finite unramified covers of a…
In this paper, we study the signed total domination number in graphs and present new sharp lower and upper bounds for this parameter. For example by making use of the classic theorem of Turan, we present a sharp lower bound on this…
In this paper we introduced an arithmetic graph function which associates with every group G the directed graph whose vertices corresponds to the divisors of |G|. With the help of such functions we introduced arithmetic graphs of classes of…
This paper introduces the concept of compliant vertices and compliant graphs, with a focus on the total domination degree (TDD) of a vertex in compliant graphs. The TDD is systematically calculated for various graph classes, including path…
We prove the Singer conjecture for extended graph manifolds and pure complex-hyperbolic higher graph manifolds with residually finite fundamental groups. In real dimension three, where a result of Hempel ensures that the fundamental group…
We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.
We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…
We generalize the idea of cofinite groups, due to B. Hartley. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions. The idea of constructing a cofinite graph starts…
A simple topological graph is a topological graph in which any two edges have at most one common point, which is either their common endpoint or a proper crossing. More generally, in a k-simple topological graph, every pair of edges has at…
Let $G$ be a finite group and $\text{cd}(G)$ denote the character degree set for $G$. The prime graph $\Delta(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\text{cd}(G)$, denoted $\rho(G)$. Two primes…
The sine-Gordon equation in light cone coordinates is solved when Dirichlet conditions on the L-shape boundaries of the strip [0,T]X[0,infinity) are prescribed in a class of functions that vanish (mod 2 pi) for large x at initial time. The…