Results 91 to 100 of about 3,678 (251)
How Proton Incorporation Reshapes Lattice Dynamics In BaSnO3‐Type Proton Conductors
Advanced Science, EarlyView.Yttrium‐doped BaSnO3 exhibits isotope‐dependent changes in its low‐energy vibrational density of states upon hydration. Comparison of dry, H2O‐, and D2O‐treated samples re‐veals mass‐dependent phonon renormalization linked to proton dynamics near oxygen va‐cancies, providing experimental insight into hydrogen‐coupled lattice excitations in proton ...
Artur Braun +9 more
wiley +1 more source
Powers of Hamiltonian paths in interval graphs [PDF]
Journal of Graph Theory, 1998 Summary: We give a simple proof that the obvious necessary conditions for a graph to contain the \(k\)th power of a Hamiltonian path are sufficient for the class of interval graphs. The proof is based on showing that a greedy algorithm tests for the existence of Hamiltonian path powers in interval graphs.
openaire +2 more sources
Polarization Dynamics in Ferroelectrics: Insights Enabled by Machine Learning Molecular Dynamics
Advanced Science, EarlyView.Machine learning molecular dynamics is presented as a route to capture polarization switching, domain wall kinetics, topological polar textures, and polar mechanical coupling beyond the limits of conventional atomistic methods. This Perspective surveys recent progress and identifies key methodological directions, including long‐range electrostatics ...
Dongyu Bai +3 more
wiley +1 more source
On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path
, 2022 International audienceThe decision problems of the existence of a Hamiltonian cycle or of a Hamiltonian path in a given graph, and of the existence of a truth assignment satisfying a given Boolean formula C, are well-known NPcomplete problems.
Lobstein, Antoine, Hudry, Olivier
core +1 more source
Proving the existence of Euclidean knight's tours on n×n×...×n chessboards for n<4 [PDF]
Notes on Number Theory and Discrete MathematicsThe Knight's Tour problem consists of finding a Hamiltonian path for the knight on a given set of points so that the knight can visit exactly once every vertex of the mentioned set. In the present, we provide a 5-dimensional alternative to the well-known
Marco Ripà
doaj +1 more source
Hamiltonian Path in Split Graphs- a Dichotomy
CoRR, 2017 In this paper, we investigate Hamiltonian path problem in the context of split graphs, and produce a dichotomy result on the complexity of the problem. Our main result is a deep investigation of the structure of $K_{1,4}$-free split graphs in the context of Hamiltonian path problem, and as a consequence, we obtain a polynomial-time algorithm to the ...
P. Renjith, N. Sadagopan
openaire +2 more sources
Advanced Electronic Materials, EarlyView.Our work bridges the gap between skyrmion discovery and material design by demonstrating how atomic‐scale control of exchange interactions enables tunable skyrmion phase transitions in centrosymmetric magnetic metals. ABSTRACT Magnetic skyrmions are topologically protected spin states that hold promise for shaping the future of electronics.
Dasuni N. Rathnaweera +9 more
wiley +1 more source
Spectrum and wave functions of excited states in lattice gauge theory
, 2008 We suggest a new method to compute the spectrum and wave functions of excited states. We construct a stochastic basis of Bargmann link states, drawn from a physical probability density distribution and compute transition amplitudes between stochastic ...
Hosseinizadeh, Ahmad +3 more
core
Solution of the knight's Hamiltonian path problem on chessboards
, 1994 Is it possible for a knight to visit all squares of an n × n chessboard on an admissible path exactly once? The answer is yes if and only if n ⩾ 5. The kth position in such a path can be computed with a constant number of arithmetic operations.
Hindrichs, Tanja +3 more
core +1 more source
Hamiltonian Intervals in the Lattice of Binary Paths
The Electronic Journal of CombinatoricsLet $\mathcal{P}_n$ be the set of all binary paths (i.e., lattice paths with upsteps $u = (1,1)$ and downsteps $d = (1,-1)$) of length $n$ endowed with the pointwise partial ordering (i.e., $P \le Q$ iff the lattice path $P$ lies weakly below $Q$) and let $G_n$ be its Hasse graph.
Ioannis Tasoulas +2 more
openaire +2 more sources