Results 71 to 80 of about 587,938 (239)
Hamiltonian of a spinning test-particle in curved spacetime
Using a Legendre transformation, we compute the unconstrained Hamiltonian of a spinning test-particle in a curved spacetime at linear order in the particle spin.
A. Tulczyjew +13 more
core +1 more source
THE TRIPLE IDEMPOTENT GRAPH OF THE RING Z_n
Let be a commutative ring, and denote the set of all idempotent elements of . The triple idempotent graph of , denoted by , is defined as an undirected simple graph whose vertex set .
Vika Yugi Kurniawan +2 more
doaj +1 more source
It is shown that if the minimum degree of a graph \(G\) on \(n\) vertices is at least \((2n-1)/3\) then \(G\) contains a subgraph that can be obtained from a hamiltonian path by adding all edges joining vertices of distance two on the path.
Fan, Genghua, Kierstead, H.A
openaire +1 more source
Beyond conventional factorization: Non-Hermitian Hamiltonians with radial oscillator spectrum
The eigenvalue problem of the spherically symmetric oscillator Hamiltonian is revisited in the context of canonical raising and lowering operators. The Hamiltonian is then factorized in terms of two not mutually adjoint factorizing operators which, in ...
Andrianov A A +27 more
core +1 more source
Fourier Transform of Transfer Matrices of Plane Ising Models
This work demonstrates the Fourier transform of the elementary transfer matrix of the generalized two-dimensional Ising model with special boundary conditions with a shift (screw type) with the form of a Hamiltonian covering the classical Ising model ...
Pavel V. Khrapov
doaj +1 more source
Infinite-dimensional port-Hamiltonian systems -- a system node approach [PDF]
Friedrich Philipp +2 more
openalex +1 more source
On interconnections of infinite-dimensional port-Hamiltonian systems [PDF]
Network modeling of complex physical systems leads to a class of nonlinear systems called port-Hamiltonian systems, which are defined with respect to a Dirac structure (a geometric structure which formalizes the power-conserving interconnection structure
Pasumarthy, Ramkrishna +1 more
core +4 more sources
Classically optimized Hamiltonian simulation [PDF]
Conor Keever, Michael Lubasch
openalex +1 more source
Bumpy metric theorem in the sense of Man{é} for non-convex Hamiltonians [PDF]
Shahriar Aslani, Patrick Bernard
openalex +1 more source
Energy Conditions for Hamiltonian and Traceable Graphs
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

