Results 31 to 40 of about 1,860,621 (344)
Coherent State Path Integrals in the Weyl Representation [PDF]
, 2006 We construct a representation of the coherent state path integral using the Weyl symbol of the Hamiltonian operator. This representation is very different from the usual path integral forms suggested by Klauder and Skagerstan in \cite{Klau85}, which ...
Baranger M +8 more
core +2 more sources
On mutually independent hamiltonian paths
Applied Mathematics Letters, 2006 Two Hamiltonian paths \(P_1=\langle v_1,v_2,\dots,v_n\rangle\) and \(P_2=\langle u_1,u_2,\dots,u_n\rangle\) of an \(n\)-vertex graph \(G\) are independent if \(u_1=v_1\), \(u_n=v_n\), and \(u_i\neq v_i\) for ...
Teng, Yuan-Hsiang +3 more
openaire +2 more sources
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
Discussiones Mathematicae Graph Theory, 2020 Let H be a graph. A decomposition of H is a set of edge-disjoint subgraphs of H whose union is H. A Hamiltonian path (respectively, cycle) of H is a path (respectively, cycle) that contains every vertex of H exactly once.
Lee Hung-Chih, Chen Zhen-Chun
doaj +1 more source
Renormalized Path Integral in Quantum Mechanics [PDF]
, 1996 We obtain direct, finite, descriptions of a renormalized quantum mechanical system with no reference to ultraviolet cutoffs and running coupling constants, in both the Hamiltonian and path integral pictures.
Henderson, R. J., Rajeev, S. G.
core +3 more sources
Noncrossing Hamiltonian Paths in Geometric Graphs [PDF]
Discrete Applied Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Černý, Jakub +3 more
openaire +2 more sources
Problems on Shortest k-Node Cycles and Paths
Кібернетика та комп'ютерні технології, 2021 The paper is devoted to the construction of mathematical models for problems on the shortest cycles and paths, that pass through a given number of nodes of a directed graph.
Petro Stetsyuk +2 more
doaj +1 more source
Solving the Hamiltonian path problem with a light-based computer [PDF]
Natural Computing, 2007 In this paper we propose a special computational device which uses light rays for solving the Hamiltonian path problem on a directed graph. The device has a graph-like representation and the light is traversing it by following the routes given by the ...
Mihai Oltean
semanticscholar +1 more source
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
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
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