Results 291 to 300 of about 1,860,621 (344)

Hamiltonian Operators via Feynman Path Integrals

Journal of Mathematical Physics, 1970
It is shown that Kerner and Sutcliffe's derivation leading to a unique quantum mechanical Hamiltonian from its classical counterpart is indeed not unique. This is done by using the same method as Kerner and Sutcliffe to derive different quantum Hamiltonians from the same classical Hamiltonian.
openaire   +1 more source

PATH INTEGRALS FOR QUASI-HERMITIAN HAMILTONIANS

International Journal of Modern Physics D, 2011
Inner products in quasi-Hermitian quantum theories, and hence probabilities, are defined through a metric that depends on the details of the Hamiltonians themselves. We shall see that the functional integral for quasi-Hermitian theories, and hence Feynman diagrams, for example, can be calculated without needing to evaluate the metric. The reason turns
openaire   +1 more source

The Hamiltonian alternating path problem

2012
In this paper, we consider the Hamiltonian alternating path problem for graphs, multigraphs, and digraphs. We describe an approach to solve the problem. This approach is based on constructing logical models for the problem. We use logical models for the Hamiltonian alternating path problem to solve the Hamiltonian path problem and the planning a ...
Gorbenko, Anna, Popov, Vladimir
openaire   +2 more sources

Path Integrals and Hamiltonians

2014
Providing a pedagogical introduction to the essential principles of path integrals and Hamiltonians, this book describes cutting-edge quantum mathematical techniques applicable to a vast range of fields, from quantum mechanics, solid state physics, statistical mechanics, quantum field theory, and superstring theory to financial modeling, polymers ...
openaire   +1 more source

Hamiltonian path in permutation graphs

Theoretical Computer Science
The Hamiltonian path problem is NP-complete for general graphs. The notion of a follow-up vertex in a permutation graph is introduced in this research, with respect to its Hasse diagram. A necessary and sufficient condition is justified for the existence of a Hamiltonian path in a permutation graph in terms of the existence of a follow-up vertex ...
Krishna Daripa, Alak Kumar Datta
openaire   +1 more source

Functional Connectivity Analysis of Brain Default Mode Networks Using Hamiltonian Path.

CNS and Neurological Disorders - Drug Targets, 2017
Zhuqing Jiao, Kai Ma, Huan Wang, Ling Zou, Jianbo Xiang   +4 more
semanticscholar   +1 more source

Hamiltonian paths in distance graphs

Mathematical Notes, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Fault-tolerant routing algorithm for 3D NoC using hamiltonian path strategy

Design, Automation and Test in Europe, 2013
M. Ebrahimi, M. Daneshtalab, J. Plosila
semanticscholar   +1 more source

An efficient implementation of Hamiltonian path based multicast routing for 3D interconnection networks

2013 21st Iranian Conference on Electrical Engineering (ICEE), 2013
Sanaz Rahimi Moosavi, A. Rahmani, P. Liljeberg, J. Plosila, H. Tenhunen   +4 more
semanticscholar   +1 more source

Predicting cancer outcomes with radiomics and artificial intelligence in radiology

Nature Reviews Clinical Oncology, 2021
Kaustav Bera, Nathaniel Braman, Amit Gupta   +2 more
exaly