Results 91 to 100 of about 154,862 (311)
Observation of Optical Precursor in Time‐Energy‐Entangled W Triphotons
Advanced Science, EarlyView.This study reports the observation of optical precursors at the triphoton level through the SSWM process. By appropriately adjusting the optical depth (OD), optical precursors are effectively separated from the main wave through utilizing the slow‐light effect to manipulate the triphoton temporal correlations in the group delay regime.
Zhou Feng +5 more
wiley +1 more source
Localization of Floer homology of engulfable topological Hamiltonian loop
, 2013 Localization of Floer homology is first introduced by Floer \cite{floer:fixed} in the context of Hamiltonian Floer homology. The author employed the notion in the Lagrangian context for the pair $(\phi_H^1(L),L)$ of compact Lagrangian submanifolds in ...
Oh, Yong-Geun
core +1 more source
Alternating Hamiltonian cycles in $2$-edge-colored multigraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an $\mathcal{NP ...
Alejandro Contreras-Balbuena +2 more
doaj +1 more source
Designing Spin Symmetry for Altermagnetism with Strong Magnetoelectric Coupling
Advanced Science, EarlyView.Antiferromagnets can be induced into altermagnets by changing the real‐space symmetry, increasing their potential for use in spintronic devices. Here, a novel and general approach is proposed: transforming antiferromagnets into altermagnets by modulating spin‐space symmetry, rather than real‐space symmetry.
Wei Sun +6 more
wiley +1 more source
DISTRIBUTED HAMILTONIAN PATH SEARCH ALGORITHM
Perner’s Contacts, 2010 Many practical problems of transportation can be transformed to the problem of finding Hamiltonian path or circle. It was proven, that this problem is NP-complete and thus can be very time-consuming for practical problem size. In this paper we present a
Karol Grondžák
doaj
Arc-Disjoint Hamiltonian Cycles in Round Decomposable Locally Semicomplete Digraphs
Discussiones Mathematicae Graph Theory, 2018 Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of D, then D is a semicomplete digraph. A digraph D is locally semicomplete if for every vertex x, the out-neighbours of x induce a semicomplete digraph and ...
Li Ruijuan, Han Tingting
doaj +1 more source
Finite topologies and Hamiltonian paths
Journal of Combinatorial Theory, Series B, 1973 Suppose x is a finite set. This paper deals with the question of how many mutually complementary topologies X can carry. If p is a prime and |X|=p, p+1, 2p−1 or 2p, we prove that the answers are respectively p, p, 2p−1, 2p−1. The problem is shown to be related to the existence of a certain type of 1-factorization of the complete graph on an even number
openaire +2 more sources
Packaging Metal Atomic Clusters for Universal and Robust Protection through Cluster Beam Process
Advanced Science, EarlyView.Gas‐phase‐aggregated metal clusters are packaged and well‐protected in poly(methyl methacrylate) (PMMA) through controlled beam implantation. The packaged precise clusters show robust protection against oxidation and agglomeration. This protection also demonstrates universality, as it successfully protects metal clusters composed of various elements ...
Siqi Lu +13 more
wiley +1 more source
Polyhedra with few 3-cuts are hamiltonian [PDF]
, 2018 In 1956, Tutte showed that every planar 4-connected graph is hamiltonian. In this article, we will generalize this result and prove that polyhedra with at most three 3-cuts are hamiltonian.
Brinkmann, Gunnar, Zamfirescu, Carol T.
core +2 more sources