Results 41 to 50 of about 1,860,621 (344)
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
On the Path-Integral Derivation of the Anomaly for the Hermitian Equivalent of the Complex $PT$-Symmetric Quartic Hamiltonian [PDF]
, 2006 It can be shown using operator techniques that the non-Hermitian $PT$-symmetric quantum mechanical Hamiltonian with a "wrong-sign" quartic potential $-gx^4$ is equivalent to a Hermitian Hamiltonian with a positive quartic potential together with a linear
H. F. Jones +4 more
core +2 more sources
A Hofer-Type Norm of Hamiltonian Maps on Regular Poisson Manifold
Journal of Applied Mathematics, 2014 We define a Hofer-type norm for the Hamiltonian map on regular Poisson manifold and prove that it is nondegenerate. We show that the L1,∞-norm and the L∞-norm coincide for the Hamiltonian map on closed regular Poisson manifold and give some sufficient ...
Dawei Sun, Zhenxing Zhang
doaj +1 more source
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
Graphs with many hamiltonian paths
Involve, a Journal of MathematicsA graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio of pairs of vertices connected by hamiltonian paths to all pairs of vertices approaches 1. We then consider minimal
Carlson, Erik +5 more
openaire +3 more sources
Triangle-different Hamiltonian paths
Journal of Combinatorial Theory, Series B, 2018 Let $G$ be a fixed graph. Two paths of length $n-1$ on $n$ vertices (Hamiltonian paths) are $G$-different if there is a subgraph isomorphic to $G$ in their union. In this paper we prove that the maximal number of pairwise triangle-different Hamiltonian paths is equal to the number of balanced bipartitions of the ground set, answering a question of K ...
István Kovács, Daniel Soltész
openaire +4 more sources
Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
AIMS Mathematics, 2021 In this paper, we have used two different proof techniques to show the Hamilton-connectedness of graphs. By using the vertex connectivity and Hamiltoniancity of graphs, we construct an infinite family of Hamilton-connected convex polytope line graphs ...
Suliman Khan +4 more
doaj +1 more source
Hamiltonian Properties of DCell Networks
, 2015 DCell has been proposed for data centers as a server centric interconnection network structure. DCell can support millions of servers with high network capacity by only using commodity switches.
Erickson, Alejandro +3 more
core +1 more source
DNA Computing the Hamiltonian Path Problem
Molecules and Cells, 1999 The directed Hamiltonian path (DHP) problem is one of the hard computational problems for which there is no practical algorithm on a conventional computer available. Many problems, including the traveling sales person problem and the longest path problem, can be translated into the DHP problem, which implies that an algorithm for DHP can also solve all
C M, Lee, S W, Kim, S M, Kim, U, Sohn
openaire +2 more sources