相关论文: Realization and classification of Hamiltonian-circ…

A signed graph is a graph together with an assignment of signs to the edges. A closed walk in a signed graph is said to be positive (negative) if it has an even (odd) number of negative edges, counting repetition. Recognizing the signs of…

The purpose of this article is to characterize symplectic and Hamiltonian circle actions on symplectic manifolds in terms of symplectic embeddings of Riemann surfaces. More precisely, we will show that (1) if $(M,\omega)$ admits a…

This paper establishes robust obstructions to representing Hamiltonian diffeomorphisms as $k$-th powers ($k \geq 2$) or embedding them in flows for certain higher-dimensional symplectic manifolds $(M,\omega)$, including surface bundles. We…

A Hamilton cycle in a directed graph $G$ is a cycle that passes through every vertex of $G$. A Hamiltonian decomposition of $G$ is a partition of its edge set into disjoint Hamilton cycles. In the late $60$s Kelly conjectured that every…

The Bubble-sort graph $BS_n,\,n\geqslant 2$, is a Cayley graph over the symmetric group $Sym_n$ generated by transpositions from the set $\{(1 2), (2 3),\ldots, (n-1 n)\}$. It is a bipartite graph containing all even cycles of length…

A mixed graph is said to be \textit{integral} if all the eigenvalues of its Hermitian adjacency matrix are integer. The \textit{mixed circulant graph} $Circ(\mathbb{Z}_n,\mathcal{C})$ is a mixed graph on the vertex set $\mathbb{Z}_n$ and…

A graph $G$ is called a $2K_2$-free graph if it does not contain $2K_2$ as an induced subgraph. In 2014, Broersma, Patel and Pyatkin showed that every 25-tough $2K_2$-free graph on at least three vertices is Hamiltonian. Recently, Shan…

Reflections from hypersurfaces act by symplectomorphisms on the space of oriented lines with respect to the canonical symplectic form. We consider an arbitrary $C^{\infty}$-smooth hypersurface $\gamma\subset\mathbb R^{n+1}$ that is either a…

The generalized Petersen graph $G(n, k)$ is a cubic graph with vertex set $V(G(n, k)) = \{v_i\}_{0 \leq i < n} \cup \{w_i\}_{0 \leq i < n}$ and edge set $E(G(n, k)) = \{v_i v_{i+1}\}_{0 \leq i < n} \cup \{w_i w_{i+k}\}_{0 \leq i < n} \cup…

For a Hamiltonian system in R^{2n}, its two-system is defined in the phase space R^{2n} x sp(2n,R). In a sense, it is a combination of the original system and its system in variations with feedback. We study the Hamiltonian forms of the…

A Hamiltonian path (cycle) in a graph is a path (cycle, respectively) which passes through all of its vertices. The problems of deciding the existence of a Hamiltonian cycle (path) in an input graph are well known to be NP-complete, and…

If a closed smooth manifold $M$ with an action of a torus $T$ satisfies certain conditions, then a labeled graph $\mG_M$ with labeling in $H^2(BT)$ is associated with $M$, which encodes a lot of geometrical information on $M$. For instance,…

In this article, we treat G_2-geometry as a special case of multisymplectic geometry and make a number of remarks regarding Hamiltonian multivector fields and Hamiltonian differential forms on manifolds with an integrable G_2-structure; in…

The harmonic index of a graph $G$ is defined as the sum of weights $\frac{2}{deg(v) + deg(u)}$ of all edges $uv$ of $E (G)$, where $deg (v)$ denotes the degree of a vertex $v$ in $V (G)$. In this note we generalize results of [L. Zhong, The…

A well-known conjecture of Alspach says that every $2k$-regular Cayley graph of an abelian group can be decomposed into Hamiltonian cycles. We consider an analogous question for infinite abelian groups. In this setting one natural analogue…

A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It serves as a model of a compact polymer on a lattice. I study the number of Hamiltonian cycles, or equivalently the entropy of a compact polymer,…

A Hamiltonian path (a Hamiltonian cycle) in a graph is a path (a cycle, respectively) that traverses all of its vertices. The problems of deciding their existence in an input graph are well-known to be NP-complete, in fact, they belong to…

We give a short constructive proof for the existence of a Hamilton cycle in the subgraph of the $(2n+1)$-dimensional hypercube induced by all vertices with exactly $n$ or $n+1$ many 1s.

For a polynomial map $\mathbf{f} : k^n \to k^m$ ($k$ a field), we investigate those polynomials $g \in k[t_1,\ldots, t_n]$ that can be written as a composition $g = h \circ \mathbf{f}$, where $h: k^m \to k$ is an arbitrary function. In the…

The Einstein/Abelian-Yang-Mills Equations reduce in the stationary and axially symmetric case to a harmonic map with prescribed singularities $\p\colon\R^3\sm\Sigma\to\H^{k+1}_\C$ into the $(k+1)$-dimensional complex hyperbolic space. In…