Results 71 to 80 of about 1,865,243 (219)
Extended Lucas Tube: Graf Hamiltonian Baru [PDF]
, 2008 A Hamiltonian cycle in a connected graph G is defined as a closed walk that traverses every vertex of G exactly once, except the starting vertex at which the walk also terminates.
Ernastuti, E. (Ernastuti) +2 more
core
Chain level Floer theory and Hofer's geometry of the Hamiltonian diffeomorphism group
, 2001 In this paper we first apply the chain level Floer theory to the study of Hofer's geometry of Hamiltonian diffeomorphism group in the cases without quantum contribution: we prove that any quasi-autonomous Hamiltonian path on weakly exact symplectic ...
Oh, Yong-Geun
core +4 more sources
Advances in Mechanical Engineering, 2019 We propose a new local path planning approach based on optimization methods with probabilistic completeness in this article. This approach adds a linear constraint to the original covariant Hamiltonian optimization for motion planning problem with a new ...
Bo You +4 more
doaj +1 more source
Physical Review Research, 2020 Comprehending the dynamical behavior of quantum systems driven by time-varying Hamiltonians is particularly difficult. Systems with as little as two energy levels are not yet fully understood as the usual methods including diagonalization of the ...
Pierre-Louis Giscard, Christian Bonhomme
doaj +1 more source
Hamilton-Jacobi quantization of singular Lagrangians with linear velocities
, 2004 In this paper, constrained Hamiltonian systems with linear velocities are investigated by using the Hamilton-Jacobi method. We shall consider the integrablity conditions on the equations of motion and the action function as well in order to obtain the ...
A. Corichi +26 more
core +1 more source
Hamiltonian paths in odd graphs [PDF]
Applicable Analysis and Discrete Mathematics, 2009 Lov?sz conjectured that every connected vertex-transitive graph has a Hamiltonian path. The odd graphs Ok form a well-studied family of connected, k-regular, vertex-transitive graphs. It was previously known that Ok has Hamiltonian paths for k ? 14. A direct computation of Hamiltonian paths in Ok is not feasible for large values of k, because Ok has ...
Letícia Bueno +3 more
openaire +1 more source
Euclidean tours in fairy chess [PDF]
Notes on Number Theory and Discrete MathematicsThe present paper aims to generalize the Knight's tour problem for k-dimensional grids of the form {0,1}ᵏ by considering other fairy chess leapers. Accordingly, we constructively show the existence of closed tours in 2×2×...×2 (k times) chessboards ...
Gabriele Di Pietro, Marco Ripà
doaj +1 more source
Hamiltonian paths in infinite graphs [PDF]
Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Proving the existence of Euclidean knight's tours on n×n×...×n chessboards for n<4 [PDF]
Notes on Number Theory and Discrete MathematicsThe Knight's Tour problem consists of finding a Hamiltonian path for the knight on a given set of points so that the knight can visit exactly once every vertex of the mentioned set. In the present, we provide a 5-dimensional alternative to the well-known
Marco Ripà
doaj +1 more source