Results 321 to 330 of about 746,739 (376)

Size-Transferable Prediction of Excited State Properties for Molecular Assemblies with a Machine Learning Exciton Model. [PDF]

J Phys Chem Lett
Ren F, Chen X, Liu F.
europepmc   +1 more source

Synthesis, Characterisation, Magnetic Properties, and DFT Investigations of Heterobimetallic Nickel‐Lanthanide LNiII LnIII (Ln = Ce, Gd, Tb, Dy) Complexes Supported by Schiff Base Ligands

European Journal of Inorganic Chemistry, Accepted Article.
Four heterobimetallic complexes (Ln = Ce (2), Gd (3), Tb (4), and Dy (5), H2L= Schiff base ligand) were synthesized from LNi (1) precursor (H2L = ligand N, N’‐bis(3‐methoxysalicylaldiimine)‐1,3‐propylene‐2‐ol). Compound 2, which crystallizes in the tetragonal system, differs from the other isostructural 3, 4, and 5 congeners which crystallize in the ...
Fabrice Pointillart, Fatma Darkebira, Fatéma Zohra Chiboub Fellah, Lotfi Belkhiri, Thierry Roisnel, Souhir El Hassasna, Thierry Guizouarn, Abdou Boucekkine   +7 more
wiley   +1 more source

Nanoscale engineering and dynamic stabilization of mesoscopic spin textures. [PDF]

Sci Adv
Harkins K, Fleckenstein C, D'Souza N, Schindler PM, Marchiori D, Artiaco C, Reynard-Feytis Q, Basumallick U, Beatrez W, Pillai A, Hagn M, Nayak A, Breuer S, Lv X, McAllister M, Reshetikhin P, Druga E, Bukov M, Ajoy A.   +18 more
europepmc   +1 more source

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials

Journal of Graph Theory, EarlyView.
ABSTRACT An oriented graph D $D$ is converse invariant if, for any tournament T $T$, the number of copies of D $D$ in T $T$ is equal to that of its converse −D $-D$. El Sahili and Ghazo Hanna [J. Graph Theory 102 (2023), 684‐701] showed that any oriented graph D $D$ with maximum degree at most 2 is converse invariant.
Jiangdong Ai, Gregory Gutin, Hui Lei, Anders Yeo, Yacong Zhou   +4 more
wiley   +1 more source

Adiabatic Energetic Annealing via Dual Single-Pixel Detection in an Optical Nonlinear Ising Machine. [PDF]

ACS Photonics
Olivieri L, Cooper AR, Peters L, Cecconi V, Pasquazi A, Peccianti M, Totero Gongora JS.   +6 more
europepmc   +1 more source

Hamiltonian games

Journal of Combinatorial Theory, Series B, 1992
openaire   +2 more sources

Spanning Plane Subgraphs of 1‐Plane Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A graph drawn on the plane is called 1‐plane if each edge is crossed at most once by another edge. In this paper, we show that every 4‐edge‐connected 1‐plane graph has a connected spanning plane subgraph. We also show that there exist infinitely many 4‐connected 1‐plane graphs that have no 2‐connected spanning plane subgraphs.
Kenta Noguchi, Katsuhiro Ota, Yusuke Suzuki   +2 more
wiley   +1 more source

Observing time-dependent energy level renormalisation in an ultrastrongly coupled open system. [PDF]

Nat Commun
Colla A, Hasse F, Palani D, Schaetz T, Breuer HP, Warring U.   +5 more
europepmc   +1 more source

Strong Coupling Quantum Electrodynamics Hartree-Fock Response Theory. [PDF]

J Phys Chem A
Castagnola M, Riso RR, El Moutaoukal Y, Ronca E, Koch H.   +4 more
europepmc   +1 more source

Time Dilation of Quantum Clocks in a Relativistic Gravitational Potential. [PDF]

Entropy (Basel)
Favalli T, Smerzi A.
europepmc   +1 more source