Related papers: Sinh-Gordon equations on finite graphs
In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…
In this article we study graphs with ordering of vertices, we define a generalization called a pseudoordering, and for a graph $H$ we define the $H$-Hamiltonian number of a graph $G$. We will show that this concept is a generalization of…
The number of topologies and non-homeomorphic topologies on a fixed finite set are now known up to $n=18$, $n=16$ but still no complete formula yet (Sloane). There are one to one correspondence among topologies, preorder and digraphs. In…
We concern in this paper the graph Kazdan-Warner equation \begin{equation*} \Delta f=g-he^f \end{equation*} on an infinite graph, the prototype of which comes from the smooth Kazdan-Warner equation on an open manifold. Different from the…
We study the random graph G_{n,\lambda/n} conditioned on the event that all vertex degrees lie in some given subset S of the non-negative integers. Subject to a certain hypothesis on S, the empirical distribution of the vertex degrees is…
Given a finite simple undirected graph $G$, let $T_1(G)$ denote the subset of vertices of $G$ such that every vertex of $T_1(G)$ belongs to at least one subgraph isomorphic to a graph obtained by connecting a single vertex to two vertices…
In this paper, we show how to discretize the abelian Chern-Simons gauge theory on generic planar lattices/graphs (with or without translational symmetries) embedded in arbitrary 2D closed orientable manifolds. We find that, as long as a…
The semi-random graph process is a single-player game that begins with an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the player independently and uniformly at random. The player then adaptively selects a vertex…
We study finite-type solutions of the elliptic sinh-Gordon equation along the strip $\Bbb{R}\times[0,L]$ with Durham conditions on each boundary component. We determine necessary rationality criteria for these conditions to be satisfied on…
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
In this paper we consider the nonlinear Klein-Gordon equation on the metric star graph with tree semi-infinite bonds. At the branched point we put two types of vertex boundary conditions: the weight continuity and the condition for…
We present a unified method of construction of surfaces associated with Grassmannian sigma models, expressed in terms of an orthogonal projector. This description leads to compact formulae for structural equations of two-dimensional…
We derive some existence results for the solutions of the Tzitz\'eica equation \begin{equation*} -\Delta u + h_1(x)e^{Au} + h_2(x)e^{-Bu}=0 \end{equation*} and the generalized Tzitz\'eica equation \begin{equation*} -\Delta u +…
This paper studies the $p$-biharmonic equation on graphs, which arises in point cloud processing and can be interpreted as a natural extension of the graph $p$-Laplacian from the perspective of hypergraph. The asymptotic behavior of the…
In 1987, the second author of this paper reported his conjecture, all finite simple groups $S$ can be characterized uniformly using the order of $S$ and the set of element orders in $S$, to Prof. J. G. Thompson. In their communications,…
We address here the problem of generating random graphs uniformly from the set of simple connected graphs having a prescribed degree sequence. Our goal is to provide an algorithm designed for practical use both because of its ability to…
We consider the problem of finding a subgraph of a given graph which minimizes the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already when all functions are the same, we show that it…
The aim of this article is twofold: one one side we introduce and study the properties of a critical sinh-Gordon type flow \begin{equation*} {\frac{\partial}{\partial…
A comprehensive symmetry analysis of the N=1 supersymmetric sine-Gordon equation is performed. Two different forms of the supersymmetric system are considered. We begin by studying a system of partial differential equations corresponding to…
We study semilinear elliptic equations on finite graphs with fully general exponential nonlinearities, thereby extending classical equations such as the Kazdan-Warner and Chern-Simons equations. A key contribution of this work is the…