Results 121 to 130 of about 52,480 (200)
ABSTRACT Ab initio path integral Monte Carlo (PIMC) simulations constitute the gold standard for the estimation of a broad range of equilibrium properties of a host of interacting quantum many‐body systems spanning a broad range of conditions from ultracold atoms to warm dense quantum plasmas.
Paul Hamann +2 more
wiley +1 more source
On pre-Hamiltonian Cycles in Hamiltonian Digraphs
Let $D$ be a strongly connected directed graph of order $n\geq 4$. In \cite{[14]} (J. of Graph Theory, Vol.16, No. 5, 51-59, 1992) Y. Manoussakis proved the following theorem: Suppose that $D$ satisfies the following condition for every triple $x,y,z$ of vertices such that $x$ and $y$ are non-adjacent: If there is no arc from $x$ to $z$, then $d(x)+d(y)
openaire +2 more sources
The first low‐oxidation (I/III) state chromium‐complex bearing a O‐chelating NHC ligand has been synthesized and structurally characterized by single‐crystal X‐ray analysis. The formation of the mixed‐valence species was further supported by SQUID magnetometry and high‐field electron paramagnetic resonance (EPR) spectroscopy.
Somnath Bhattacharya +4 more
wiley +1 more source
Hamiltonian cycles for finite Weyl groupoids
Let [Formula: see text] be the Cayley graph of a finite Weyl groupoid [Formula: see text]. In this paper, we show an existence of a Hamiltonian cycle of [Formula: see text] for any [Formula: see text]. We exactly draw a Hamiltonian cycle of [Formula: see text] for any (resp. some) irreducible [Formula: see text] of rank three (resp. four).
Takato Inoue, Hiroyuki Yamane
openaire +2 more sources
Tight Bounds for Hypercube Minor‐Universality
ABSTRACT A graph G $G$ is m $m$‐minor‐universal if every graph H $H$ with at most m $m$ edges and no isolated vertices is contained as a minor in G $G$. Recently, Benjamini, Kalifa and Tzalik proved that there is an absolute constant c>0 $c\gt 0$ such that the d $d$‐dimensional hypercube Qd ${Q}_{d}$ is (c⋅2d/d $c\cdot {2}^{d}/d$)‐minor‐universal ...
Emma Hogan +5 more
wiley +1 more source
Fractional Balanced Chromatic Number and Arboricity of Planar (Signed) Graphs
ABSTRACT A balanced ( p , q ) $(p,q)$‐coloring of a signed graph ( G , σ ) $(G,\sigma )$ is an assignment of q $q$ colors to each vertex of G $G$ from a platter of p $p$ colors, such that each color class induces a balanced set (a set that does not induce a negative cycle).
Reza Naserasr +3 more
wiley +1 more source
Loop Quantum Photonic Chip for Coherent Multi‐Time‐Step Evolution
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
Challenges and Opportunities in Machine Learning for Light‐Emitting Polymers
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
On pedigree polytopes and Hamiltonian cycles
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
High Relative Accuracy Computations With Covariance Matrices of Order Statistics
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

