Results 31 to 40 of about 1,859,854 (274)
Covariant Hamiltonian Field Theory: Path Integral Quantization [PDF]
International Journal of Theoretical Physics, 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. In particular, classical Lagrangian and covariant Hamiltonian field theories are equivalent in the case of a hyperregular Lagrangian, and they are quasi ...
D. Bashkirov +2 more
openaire +3 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
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
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
Low‐Symmetry Weyl Semimetals: A Path to Ideal Topological States
Advanced Functional Materials, EarlyView.This study presents a theoretical framework for realizing ideal Weyl semimetals, where Weyl nodes are well‐isolated at the Fermi level. The approach is exemplified in the low‐symmetry material Cu2SnSe3, which exhibits tunable topological phases, current‐induced orbital magnetization, and a strong circular photogalvanic effect, making it a promising ...
Darius‐Alexandru Deaconu +3 more
wiley +1 more source
Measurement + Control, 2019 Wheeled mobile robots are widely utilized for environment-exploring tasks both on earth and in space. As a basis for global path planning tasks for wheeled mobile robots, in this study we propose a method for establishing an energy-based cost map.
Bo You +4 more
doaj +1 more source
IEEE Access, 2021 In order to solve the NP-hard problem of mobile sink path planning in wireless sensor networks (WSN) where the communication range is modeled as a circular area and overlaps with each other, this paper proposes a sink node path planning method guided by ...
Zhijie Huang +4 more
doaj +1 more source
Advanced Functional Materials, EarlyView.Permanent magnets derive their extraordinary strength from deep, universal electronic‐structure principles that control magnetization, anisotropy, and intrinsic performance. This work uncovers those governing rules, examines modern modeling and AI‐driven discovery methods, identifies critical bottlenecks, and reveals electronic fingerprints shared ...
Prashant Singh
wiley +1 more source
Path Independence in Adiabatic Quantum Computing for Hadamard Gate
Journal of Mathematical and Fundamental Sciences, 2014 The computation time in adiabatic quantum computing (AQC) is determined by the time limit of the adiabatic evolution, which in turn depends on the evolution path. In this research we have used the variational method to find an optimized path.
Jusak Sali Kosasih +2 more
doaj +1 more source