相关论文: Sinh-Gordon equations on finite graphs
The sine-Gordon model serves as a foundational $1+1$-dimensional quantum field theory with numerous applications in condensed matter physics. Despite its integrability, characterizing its finite-temperature behavior remains a significant…
We give a noncommutative extension of sinh-Gordon equation. We generalize a linear system and Lax representation of the sinh-Gordon equation in noncommutative space. This generalization gives a noncommutative version of the sinh-Gordon…
It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end…
We study the elliptic sinh-Gordon and sine-Gordon equations on the real plane and we introduce new families of solutions. We use a Backlund transformation that connects the elliptic versions of sinh-Gordon and sine-Gordon equations. As an…
Using fermionic basis we conjecture the exact formulae for the expectation values of local fields in sinh-Gordon model. The conjecture is checked against previously known results.
The most basic characteristic of x-quasiperiodic solutions u(x,t) of the sine-Gordon equation u_{tt}-u_{xx}+\sin u=0 is the topological charge density denoted $\bar n$. The real finite-gap solutions u(x,t) are expressed in terms of the…
We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…
The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…
Studies on Kazdan--Warner equations on graphs have grown steadily, yet the fractional case remains insufficiently explored. Using topological degree theory, this work investigates the fractional Kazdan--Warner equation in the negative case…
An effective description of the inverse spectral data corresponding to the real periodic and quasiperiodic solutions for the sine-gordon equation is obtained. In particular, the explicit formula for the so-called topological charge of the…
For $n \geq 2$, consider $\mathbb{Z}^n$ as a lattice graph. We explore a generalized Chern-Simons equation on $\mathbb{Z}^n$. Employing the method of exhaustion, we prove that there exists a global solution that also qualifies as a…
We consider the problem of finding a subgraph of a given graph minimizing the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already for bipartite graphs when the functions are convex on…
Girth-regular graphs with equal girth, regular degree and chromatic index are studied for the determination of 1-factorizations with each 1-factor intersecting every girth cycle. Applications to hamiltonian decomposability and to…
In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the…
Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note we give an optimal condition to ensure it is also unbounded from below. We…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
Let $(V,E)$ be a finite connected graph. We are concerned about the Chern-Simons Higgs model $$\Delta u=\lambda e^u(e^u-1)+f, \quad\quad\quad\quad\quad\quad{(0.1)}$$ where $\Delta$ is the graph Laplacian, $\lambda$ is a real number and $f$…
We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.
Let $G$ be a finite insoluble group with soluble radical $R(G)$. In this paper we investigate the soluble graph of $G$, which is a natural generalisation of the widely studied commuting graph. Here the vertices are the elements in $G…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…