Results 121 to 130 of about 158,681 (246)
Antidirected Hamiltonian paths in tournaments
Journal of Combinatorial Theory, Series B, 1972 AbstractIn this paper we present a short proof of Grünbaum's theorem concerning the existence of antidirected Hamiltonian (ADH) paths in tournaments. We also prove that, in every tournament Tn with n ≥ 12, there is an ADH path starting at any vertex.
openaire +1 more source
Laser &Photonics Reviews, EarlyView.This review summarizes recent progress in meta‐photonics with a focus on bound states in the continuum (BICs) as a powerful platform for light confinement and control. It covers fundamental concepts, design strategies across optical regimes, symmetry breaking for practical quasi‐BICs, tunable and AI‐assisted BIC devices, and emerging applications in ...
Hafiz Saad Khaliq, Hak‐Rin Kim
wiley +1 more source
Antidirected Hamiltonian paths in tournaments
Journal of Combinatorial Theory, Series B, 1971 AbstractIt is well known that every tournament has a directed Hamiltonian path. A similar result is established concerning the existence of antidirected Hamiltonian paths in tournaments.
openaire +2 more sources
Loop Quantum Photonic Chip for Coherent Multi‐Time‐Step Evolution
Laser &Photonics Reviews, EarlyView.A loop quantum photonic chip (Loop‐QPC) enabling efficient multi‐step quantum simulation in a single run is demonstrated. Combining recirculating loops with cycle‐or‐measure control, Loop‐QPC eliminates repeated reprogramming and reduces loss. Experimental demonstration of three‐step unitary evolution confirms high‐fidelity operation, showcasing the ...
Yuancheng Zhan +9 more
wiley +1 more source
Controlling Collective Quasiparticle Dynamics Beyond Decoherence in Topological Interfaces
Laser &Photonics Reviews, EarlyView.Gold nanoparticles placed above a deformed honeycomb plasmonic crystal couple to a chiral topological interface mode. The pseudospin‐split bands ψ+/ ψ− encode spin‐momentum locking, so emitters radiate directionally along the domain wall and share a common phase.
Fatemeh Davoodi
wiley +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 +1 more source
Challenges and Opportunities in Machine Learning for Light‐Emitting Polymers
Macromolecular Rapid Communications, EarlyView.The performance of light‐emitting polymers emerges from coupled effects of chemical diversity, morphology, and exciton dynamics across multiple length scales. This Perspective reviews recent design strategies and experimental challenges, and discusses how machine learning can unify descriptors, data, and modeling approaches to efficiently navigate ...
Tian Tian, Yinyin Bao
wiley +1 more source
High Relative Accuracy Computations With Covariance Matrices of Order Statistics
Mathematical Methods in the Applied Sciences, EarlyView.ABSTRACT In many statistical applications, numerical computations with covariance matrices need to be performed. The error made when performing such numerical computations increases with the condition number of the covariance matrix, which is related to the number of variables and the strength of the correlation between the variables. In a recent work,
Juan Baz +3 more
wiley +1 more source
Administrative Traditions of the Majority World: A Commentary and Future Research Agenda
Public Administration and Development, EarlyView.ABSTRACT Decolonising public administration is an urgent and necessary endeavour. In this short article we argue that we cannot, however, settle for shallow decolonialisations. We argue that the specific iterations of bureaucracy evidenced in post‐colonial states across the majority world can be conceptualised through the lens of administrative ...
Ibrahim Bornoma +2 more
wiley +1 more source
Hamiltonian paths in oriented graphs
Journal of Combinatorial Theory, Series B, 1976 AbstractA short proof is given of Meyniel's theorem on Hamiltonian cycles in oriented graphs. Analogous conditions are obtained for a graph to be Hamiltonianconnected.
openaire +2 more sources