Results 61 to 70 of about 52,480 (200)
Lifshitz Transition in Correlated Topological Semimetals
Advanced Science, EarlyView.Theoretical calculations reveal that in YPtBi and GdPtBi, strong electronic correlations shift topological Dirac nodes away from the Fermi level by forming large hole pockets. This effect is sensitive to temperature and arises from interactions among 4d or 4f electrons, offering insights into Fermi surface engineering in quantum materials.
Byungkyun Kang +4 more
wiley +1 more source
Proof Compression and NP Versus PSPACE II: Addendum
Bulletin of the Section of Logic, 2022 In our previous work we proved the conjecture NP = PSPACE by advanced proof theoretic methods that combined Hudelmaier’s cut-free sequent calculus for minimal logic (HSC) with the horizontal compressing in the corresponding minimal Prawitz-style natural ...
Lew Gordeev, Edward Hermann Haeusler
doaj +1 more source
Contractible Hamiltonian cycles in triangulated surfaces [PDF]
Elemente der Mathematik, 2014 A triangulation of a surface is called $q$-equivelar if each of its vertices is incident with exactly $q$ triangles. In 1972 Altshuler had shown that an equivelar triangulation of torus has a Hamiltonian Circuit. Here we present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in equivelar triangulation of a ...
openaire +3 more sources
The Importance of Metal‐Organic Framework Linker Atoms for CO2 Reduction: A DFT Study
Advanced Science, EarlyView.Using DFT, we examine the role of linker atoms in CO2 reduction on copper‐based metal organic frameworks (Cu MOFs). Our calculations reveal that linker atoms may serve as both CO2 and H‐shuttling sites and suggest linker electrostatics as a descriptor for linker activity. ABSTRACT Although the metal within the secondary building unit of a metal‐organic
Ugochukwu Nwosu, Samira Siahrostami
wiley +1 more source
On $2$-pyramidal Hamiltonian cycle systems [PDF]
Bulletin of the Belgian Mathematical Society - Simon Stevin, 2014 Let \(\hat K_{2n}\) denote the complete graph \(K_{2n}\) with the edges in a perfect matching removed and let \(\hat K_{2n+1} = K_{2n+1}\). A Hamiltonian cycle system (HCS) of order \(v\) is a decomposition of the edge set of \(\hat K_v\) into a disjoint union of Hamiltonian cycles. Such a system \(H\) is called 1-rotational (resp.
Bailey, Rosemary +3 more
openaire +6 more sources
Unveiling a Bulk WTaV Multicomponent Alloy With Superior Thermal Properties and Manufacturability
Advanced Science, EarlyView.ABSTRACT Many tungsten (W)‐based medium and high entropy alloys (HEA) demonstrate superior microstructural stability and enhanced mechanical properties as compared to pure W, effectively rendering them as viable candidate materials for extreme environments such as nuclear fusion, aerospace applications, and so on.
Ishtiaque K. Robin +11 more
wiley +1 more source
On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Christian Löwenstein +2 more
doaj +1 more source
Superradiance and Broadband Emission Driving Fast Electron Dephasing in Open Quantum Systems
Advanced Science, EarlyView.We uncover the physical origin of ultrafast electron dephasing in solid‐state high‐harmonic generation by simulating the Lindblad equation for the dissipative Hubbard model. Coexistence of Dicke superradiance and broadband emission is revealed, whose destructive interference shortens the effective scattering time and provides a unified picture of ...
Gimin Bae, Youngjae Kim, Jae Dong Lee
wiley +1 more source
The Solution of the Extended 16th Hilbert Problem for Some Classes of Piecewise Differential Systems
MathematicsThe limit cycles have a main role in understanding the dynamics of planar differential systems, but their study is generally challenging. In the last few years, there has been a growing interest in researching the limit cycles of certain classes of ...
Louiza Baymout +2 more
doaj +1 more source
Some results on the existence of Hamiltonian cycles in -compositions of bipartite digraphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let D be a digraph on n vertices s1, …, sn and let D1, …, Dn be a family of vertex-disjoint bipartite digraphs. We think of D1, …, Dn as 2-colored digraphs with the same color set.
Pilar Cano +2 more
doaj +1 more source