Results 51 to 60 of about 1,825,425 (354)
Energy Conditions for Hamiltonian and Traceable Graphs
Universal Journal of Mathematics and Applications, 2019 A graph is called Hamiltonian (resp. traceable) if the graph has a Hamiltonian cycle (resp. path), a cycle (resp. path) containing all the vertices of the graph. The energy of a graph is defined as the sum of the absolute values of the eigenvalues of the
Rao Li
doaj +1 more source
Canonical Transformations and Path Integral Measures
, 1994 This paper is a generalization of previous work on the use of classical canonical transformations to evaluate Hamiltonian path integrals for quantum mechanical systems.
A. Niemi +19 more
core +2 more sources
Path Integral Monte Carlo Approach to the U(1) Lattice Gauge Theory in (2+1) Dimensions [PDF]
, 2002 Path Integral Monte Carlo simulations have been performed for U(1) lattice gauge theory in (2+1) dimensions on anisotropic lattices. We extractthe static quark potential, the string tension and the low-lying "glueball" spectrum.The Euclidean string ...
A. Dabringhaus +56 more
core +2 more sources
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 +3 more sources
An evaluation of the number of Hamiltonian paths [PDF]
Journal de Physique Lettres, 1985 The number of Hamiltonian walks on a regular lattice of N points, with coordination number q is of the form ωNH for N → ∞. We obtain an estimate ωH ∼ q/e in surprising agreement with available data in two dimensions.
Orland, Henri +2 more
openaire +2 more sources
Hamiltonian path, routing, broadcasting algorithms for connected square network graphs
Engineering Science and Technology, an International Journal, 2023 Connected Square Network Graphs (CSNG) in the study of Selcuk (2022) and Selcuk and Tankul (2022) is reconsidered in this paper. Although (CSNG) is a 2-dimensional mesh structure, the most important feature of this graph is that it is a hypercube variant.
Burhan Selçuk +1 more
doaj +1 more source
De-Signing Hamiltonians for Quantum Adiabatic Optimization [PDF]
Quantum, 2020 Quantum fluctuations driven by non-stoquastic Hamiltonians have been conjectured to be an important and perhaps essential missing ingredient for achieving a quantum advantage with adiabatic optimization.
Elizabeth Crosson +3 more
doaj +1 more source
Covariant Hamiltonian field theory. Path integral quantization
, 2004 The Hamiltonian counterpart of classical Lagrangian field theory is covariant Hamiltonian field theory where momenta correspond to derivatives of fields with respect to all world coordinates.
Bashkirov, D., Sardanashvily, G.
core +3 more sources
Hamiltonian Formalism for Space-time Non-commutative Theories [PDF]
, 2000 Space-time non-commutative theories are non-local in time. We develop the Hamiltonian formalism for non-local field theories in d space-time dimensions by considering auxiliary d+1 dimensional field theories which are local with respect to the evolution ...
A. D. Fokker +22 more
core +4 more sources
Hamiltonian paths and hamiltonian connectivity in graphs
Discrete Mathematics, 1993 A degree and neighborhood type condition on independent triples of vertices of a graph \(G\) that implies \(G\) is hamiltonian-connected is given. In particular, the following is proved. If \(G\) is a 3-connected graph of order \(n\) such that \(d(u) + d(v) + d(w)-| N(u) \cap N(v) \cap N(w) | \geq n+1,\) then \(G\) is hamiltonian-connected.
openaire +3 more sources