Results 121 to 130 of about 152,187 (305)
Plaid‐Like Spin Splitting and Chirality of Magnon Bands in Antiferromagnetic MnTe2
Advanced Science, EarlyView.Helicity‐ and angle‐resolved Raman spectroscopy reveals chiral magnons in the non‐coplanar antiferromagnet MnTe 2. Combined with first‐principles calculations and spin‐wave theory, the results establish its altermagnetic character through circular Raman dichroism, reduced rotational symmetry, and a distinctive plaid‐like momentum‐space magnon spin ...
Dirk Wulferding +10 more
wiley +1 more source
Hamiltonicities of Double Domination Critical and Stable Claw-Free Graphs
Discussiones Mathematicae Graph Theory, 2019 A graph G with the double domination number γ×2(G) = k is said to be k- γ×2-critical if γ×2 (G + uv) < k for any uv ∉ E(G). On the other hand, a graph G with γ×2 (G) = k is said to be k-γ×2+$k - \gamma _{ \times 2}^ + $-stable if γ×2 (G + uv) = k for any
Kaemawichanurat Pawaton
doaj +1 more source
, 2003 Hamiltonian dynamics describes the evolution of conservative physical systems. Originally developed as a generalization of Newtonian mechanics, it represents a core component of any undergraduate physics curriculum. What is not so widely recognized is that the ideal (i.e.
openaire +2 more sources
Dipolar Coupling Errors in Nuclear Spin Qubits
Advanced Science, EarlyView.Multi‐nuclear spin registers of phosphorus‐atom qubits in silicon have demonstrated 99.99% single and >$>$99.9% two qubit gate fidelities. Despite nanometer separation, read‐out fidelities between individual nuclear spins within the register are not identical.
I. D. Thorvaldson +15 more
wiley +1 more source
Improved Sufficient Conditions for Hamiltonian Properties
Discussiones Mathematicae Graph Theory, 2015 In 1980 Bondy [2] proved that a (k+s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamiltonian (s = 0) or Hamiltonian-connected (s = 1) if the degree sum of every set of k+1 pairwise nonadjacent vertices is at least ((k+1)(n+s−1)+1)/2.
Bode Jens-P. +2 more
doaj +1 more source
The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs [PDF]
, 2004 A hamiltonian coloring of a connected graph G of order n is an assignment c of colors (positive integers) to the vertices of G such that |c(u)-c(v)|+D(u,v)⩾n-1 for every two distinct vertices u and v of G, where D(u,v) is the length of a longest u–v path
Ladislav Nebeský +3 more
core +1 more source
Advanced Science, EarlyView.Peptide‐inspired associative polymers with arginine‐like guanidinium stickers and lysine‐like ammonium spacers undergo chain collapse and liquid‐liquid phase separation induced by reversible sticker associations. Sticker valence and tunable association strength jointly control the phase behavior, chain conformation, and interfacial cohesion of these ...
Seung‐Hwan Oh +7 more
wiley +1 more source
Open PhysicsThis article introduces a novel modified G′G2\left(\phantom{\rule[-0.75em]{}{0ex}},\frac{G^{\prime} }{{G}^{2}}\right) expansion method, combined with Maple software, for solving the exact solutions of the generalized hyperelastic-rod wave equation (GHRWE)
Ma Hongwei +4 more
doaj +1 more source
On Vertices Enforcing a Hamiltonian Cycle
Discussiones Mathematicae Graph Theory, 2013 A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian.
Fabrici Igor +2 more
doaj +1 more source
Oscillating mushrooms : adiabatic theory for a non-ergodic system [PDF]
, 2014 Can elliptic islands contribute to sustained energy growth as parameters of a Hamiltonian system slowly vary with time? In this paper we show that a mushroom billiard with a periodically oscillating boundary accelerates the particle inside it ...
Turaev, D +5 more
core +1 more source