Related papers: The Hamilton-Waterloo problem for Hamilton cycles …
We propose an improved algorithm for counting the number of Hamiltonian cycles in a directed graph. The basic idea of the method is sequential acceptance/rejection, which is successfully used in approximating the number of perfect matchings…
In this paper, we investigate the existence of infinitely many solutions for the following fractional Hamiltonian systems: \begin{eqnarray}\label{eq00} _{t}D_{\infty}^{\alpha}(_{-\infty}D_{t}^{\alpha}u(t)) + L(t)u(t) = & \nabla W(t,u(t))\\…
Given a family of graphs $G_1,\dots,G_{n}$ on the same vertex set $[n]$, a rainbow Hamilton cycle is a Hamilton cycle on $[n]$ such that each $G_c$ contributes exactly one edge. We prove that if $G_1,\dots,G_{n}$ are independent samples of…
We show that for each \alpha>0 every sufficiently large oriented graph G with \delta^+(G),\delta^-(G)\ge 3|G|/8+ \alpha |G| contains a Hamilton cycle. This gives an approximate solution to a problem of Thomassen. In fact, we prove the…
A Hamilton cycle in a digraph is a cycle that passes through all the vertices, where all the arcs are oriented in the same direction. The problem of finding Hamilton cycles in directed graphs is well studied and is known to be hard. One of…
In this paper, we bring a complete solution to the Ovals problem, as formulated in [3] and [24].
Most classical mechanical systems are based on dynamical variables whose values are real numbers. Energy conservation is then guaranteed if the dynamical equations are phrased in terms of a Hamiltonian function, which then leads to…
In this work we show how to complete some Hamilton-Jacobi solutions of linear, nonconservative classical oscillatory systems which appeared in the literature and we extend these complete solutions to the quantum mechanical case. In…
Consider the random graph process $\{G_t\}_{t\geq 0}$. For $k\geq 3$ let $G_{t}^{(k)}$ denote the $k$-core of $G_t$ and let $\tau_k$ be the minimum $t$ such that the $k$-core of $G_t$ is nonempty. It is well known that w.h.p. for…
We demonstrate with soluble models how to employ the effective Hamiltonian approach of Lee and Suzuki to obtain all the exact eigenvalues of the full Hamiltonian. We propose a new iteration scheme to obtain the effective Hamiltonian and…
Hamilton flows on K\"ahler manifold for which all trajectories are $H$-planar curves (complex analog of geodesics) are considered. These flows are called $H$-planar. The equation which has to obey the Hamiltonian of $H$-planar Hamilton flow…
A tight Hamilton cycle in a $k$-uniform hypergraph ($k$-graph) $G$ is a cyclic ordering of the vertices of $G$ such that every set of $k$ consecutive vertices in the ordering forms an edge. R\"{o}dl, Ruci\'{n}ski, and Szemer\'{e}di proved…
In this paper we consider the following total functional problem: Given a cubic Hamiltonian graph $G$ and a Hamiltonian cycle $C_0$ of $G$, how can we compute a second Hamiltonian cycle $C_1 \neq C_0$ of $G$? Cedric Smith proved in 1946,…
Investigating a problem of B. Mohar, we show that every one-ended Hamiltonian cubic graph with end degree 3 contains a second Hamilton cycle. We also construct two examples showing that this result does not extend to give a third Hamilton…
In this paper we compute all the smooth solutions to the Hamilton-Jacobi equation associated with the horocycle flow. This can be seen as the Euler-Lagrange flow (restricted to the energy level set $E^{-1}(\frac 12)$) defined by the Tonelli…
We prove that for all $k\geq 4$ and $1\leq\ell<k/2$, every $k$-uniform hypergraph $\mathcal{H}$ on $n$ vertices with $\delta_{k-2}(\mathcal{H})\geq\left(\frac{4(k-\ell)-1}{4(k-\ell)^2}+o(1)\right)\binom{n}{2}$ contains a Hamiltonian…
In this paper we describe protocols which use a standard deck of cards to provide a perfectly sound zero-knowledge proof for Hamiltonian cycles and Flow Free puzzles. The latter can easily be extended to provide a protocol for a…
In this paper we show that $e/n$ is the sharp threshold for the existence of tight Hamilton cycles in random $k$-uniform hypergraphs, for all $k\ge 4$. When $k=3$ we show that $1/n$ is an asymptotic threshold. We also determine thresholds…
We examine possibility to design an efficient solving algorithm for problems of the class \np. It is introduced a classification of \np problems by the property that a partial solution of size $k$ can be extended into a partial solution of…
An interpretation of the ``halo problem'' in accelerators based on quantum-like diffraction is given. Comparison between this approach and the others based on classical mechanics equations is discussed.