Results 41 to 50 of about 286,371 (234)
Advanced Materials, EarlyView.An active learning framework, grounded in independently generated in‐house experimental data, enables reliable discovery of high‐performance interfacial materials for perovskite solar cells. Iterative model refinement autonomously converges toward structurally robust quaternary ammonium architectures, establishing a new design principle for interfacial
Jongbeom Kim +8 more
wiley +1 more source
An integral method for solving nonlinear eigenvalue problems
, 2010 We propose a numerical method for computing all eigenvalues (and the corresponding eigenvectors) of a nonlinear holomorphic eigenvalue problem that lie within a given contour in the complex plane.
A. Jentzen +32 more
core +1 more source
Advanced Optical Materials, EarlyView.We performed a computational screening of phosphorescent emitters and charge transporters for OLEDs to identify combinations that minimize triplet‐polaron quenching, a major cause of efficiency loss and short operational lifetimes, especially in blue OLEDs. Our results reveal key design rules and highlight emitter‐transporter pairs that strongly reduce
Clint van Hoesel +2 more
wiley +1 more source
Laplacian Eigenvalues and Distances Between Subsets of a Manifold [PDF]
Journal of Differential Geometry, 2000 In the paper under review, the authors prove the following theorem: Let \(L\) be an analytic Laplacian on a metric measure space \((M,\mu)\), and let \(\lambda_{1}\) be the lower bound of the spectrum of \(L\) acting on the functions orthogonal to the constants.
Friedman, Joel, Tillich, Jean-Pierre
openaire +2 more sources
A short proof of the odd-girth theorem [PDF]
, 2012 Recently, it has been shown that a connected graph $\Gamma$ with $d+1$ distinct eigenvalues and odd-girth $2d+1$ is distance-regular. The proof of this result was based on the spectral excess theorem.
Fiol, Miquel Angel, van Dam, Edwin R.
core +2 more sources
$C^3$ matching for asymptotically flat spacetimes
, 2019 We propose a criterion for finding the minimum distance at which an interior solution of Einstein's equations can be matched with an exterior asymptotically flat solution.
Gutiérrez-Piñeres, Antonio C. +1 more
core +1 more source
Distance-Regular Graphs with a Relatively Small Eigenvalue Multiplicity [PDF]
The Electronic Journal of Combinatorics, 2013 Godsil showed that if $\Gamma$ is a distance-regular graph with diameter $D \geq 3$ and valency $k \geq 3$, and $\theta$ is an eigenvalue of $\Gamma$ with multiplicity $m \geq 2$, then $k \leq\frac{(m+2)(m-1)}{2}$.In this paper we will give a refined statement of this result. We show that if $\Gamma$ is a distance-regular graph with diameter $D \geq 3$,
Koolen, JH, Kim, J, Park, J
openaire +3 more sources
Hard‐Magnetic Soft Millirobots in Underactuated Systems
Advanced Robotics Research, EarlyView.This review provides a comprehensive overview of hard‐magnetic soft millirobots in underactuated systems. It examines key advances in structural design, physics‐informed modeling, and control strategies, while highlighting the interplay among these domains.
Qiong Wang +4 more
wiley +1 more source
Spectral-Variation Bounds in Hyperbolic Geometry
, 2015 We derive new estimates for distances between optimal matchings of eigenvalues of non-normal matrices in terms of the norm of their difference. We introduce and estimate a hyperbolic metric analogue of the classical spectral-variation distance.
Müller-Hermes, Alexander, Szehr, Oleg
core +1 more source
On the distance eigenvalues of design graphs
Ricerche di Matematica, 2023 A design graph is a regular bipartite graph in which any two distinct vertices of the same part have the same number of common neighbors. This class of graphs have a close relationship to strongly regular graphs. In this paper, we study the distance eigenvalues of the design graphs. Also, we will explicitly determine the distance eigenvalues of a class
openaire +3 more sources