Results 211 to 220 of about 158,681 (246)

Approximate quantum circuit compilation for proton-transfer kinetics on quantum processors.

open access: yesPhys Chem Chem Phys
Kovyrshin A   +17 more
europepmc   +1 more source

Chiral Magnon Dynamics in a Kitaev Magnet Revealed by Magneto-Optics

open access: yes
Bachar N   +15 more
europepmc   +1 more source

Hamiltonian Path-Integral Methods

Reviews of Modern Physics, 1966
A path-integral formulation of quantum mechanics is investigated which is closely related to that of Feynman. It differs from Feynman's formulation in that it involves the Hamiltonian function of the canonically conjugate coordinates and momenta.
Claude Garrod
openaire   +3 more sources

On Hamiltonian cycles and Hamiltonian paths

Information Processing Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rahman, M. Sohel, Kaykobad, M.
openaire   +3 more sources

A diabatic reaction path Hamiltonian

The Journal of Chemical Physics, 1988
A reaction path Hamiltonian is constructed that is based on a straight-line, least motion path that interpolates linearly between equilibrium reactant and product geometries of the molecular system. Conservation of linear and angular momentum are correctly accounted for.
William H. Miller   +2 more
openaire   +3 more sources

Generalized reaction-path Hamiltonian dynamics

Theoretical Chemistry Accounts: Theory, Computation, and Modeling (Theoretica Chimica Acta), 2004
The reaction-path Hamiltonian is reformulated in a form that is independent of the specific choice of guiding path. A necessary and sufficient condition for a given curve to satisfy reaction-path Hamiltonian requirements is derived, showing that any curve with no explicit dependence on the independent parameter does give rise to a formally acceptable ...
Javoer Gonz�lez   +2 more
openaire   +3 more sources

Hamiltonian path graphs

Journal of Graph Theory, 1983
AbstractThe Hamiltonian path graph H(G) of a graph G is that graph having the same vertex set as G and in which two vertices u and v are adjacent if and only if G contains a Hamiltonian u‐v path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonian path graphs is presented.
Chartrand, Gary   +2 more
openaire   +1 more source

Hamiltonian Paths and Cycles

2013
In this chapter, the concepts of Hamiltonian paths and Hamiltonian cycles are discussed. In the first section, the history of Hamiltonian graphs is described, and then some concepts such as Hamiltonian paths, Hamiltonian cycles, traceable graphs, and Hamiltonian graphs are defined.
Mahtab Hosseininia, Faraz Dadgostari
openaire   +1 more source

Hamiltonian and Eulerian Paths

1983
March 14. Hamiltonian and Eulerian paths and cycles come under the general heading of “de Bruijn sequences”. The specific terms “Hamiltonian” and “Eulerian” are somewhat better known; hence this chapter has been named after them rather than de Bruijn.
George Pólya   +2 more
openaire   +1 more source

The Pizza-Cutter’s Problem and Hamiltonian Paths

Mathematics Magazine, 2019
Summary. The pizza-cutter’s problem is to determine the maximum number of pieces that can be made with n straight cuts through a circular pizza, regardless of the size and shape of the pieces.
Baril, Jean-Luc   +1 more
openaire   +1 more source

Home - About - Disclaimer - Privacy