Results 61 to 70 of about 133,879 (298)
Accurate Estimations of Any Eigenpairs of N-th Order Linear Boundary Value Problems
This paper provides a method to bound and calculate any eigenvalues and eigenfunctions of n-th order boundary value problems with sign-regular kernels subject to two-point boundary conditions.
Pedro Almenar, Lucas Jódar
doaj +1 more source
AbstractWe study the dependence of the eigenvalues of a tridiagonal matrix upon off-diagonal entries. The change in the eigenvalues when a cross-diagonal product approaches zero or infinity is estimated.
Hager, William W., Pederson, Roger N.
openaire +2 more sources
Eigenvalue multiplicity in quartic graphs [PDF]
Let G be a connected quartic graph of order n with μ as an eigenvalue of multiplicity k. We show that if μ ∉ {−1,0} then k ≤ (2n − 5)/3 when n ≤ 22, and k ≤ (3n − 1)/5 when n ≥ 23.
Capaverde, Juliane +3 more
core +1 more source
Schematic illustration of LNP‐MPG nuclei‐targeting delivery of HMW‐FGF2 promoting histone acetylation to regulate the fate of DPSCs and treat spinal cord injury. LNPs components include pHMW‐FGF2 plasmid, DSPC, Dlin‐MC3‐DMA, cholesterol, and PEG2000, and are modified with MPG to form HMW‐FGF2@LNP‐MPG (HLM). HLM nuclei‐targets DPSCs to deliver HMW‐FGF2,
Heng Zhou +6 more
wiley +1 more source
Inverses and eigenvalues of diamondalternating sign matrices
An n × n diamond alternating sign matrix (ASM) is a (0, +1, −1)-matrix with ±1 entries alternatingand arranged in a diamond-shaped pattern. The explicit inverse (for n even) or generalized inverse (for nodd) of a diamond ASM is derived.
Catral Minerva +3 more
doaj +1 more source
We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.
Xiaogang Liu, Sanming Zhou
openaire +3 more sources
Eigenvalue multiplicity in cubic graphs [PDF]
Let G be a connected cubic graph of order n with μ as an eigenvalue of multiplicity k. We show that (i) if μ∉{-1,0} then k≤12n, with equality if and only if μ=1 and G is the Petersen graph; (ii) if μ=-1 then k≤12n+1, with equality if and only if G=K4 ...
Rowlinson, Peter
core +1 more source
We mechanically program liquid crystal elastomer coatings as a stimuli‐responsive and digitally addressable platform for refreshable tactile displays; we validate the perceptual performance of our dynamic device matches conventional static tactile media.
Tom Bruining +9 more
wiley +1 more source
A note on strong resonance problems for p-Laplacian
In this note, we study the existence of the weak solutions for the p-Laplacian with strong resonance, which generalizes the previous results in one-dimension.
Chunhua Jin, Yuanyuan Ke, Jingxue Yin
doaj
Defect‐Templated Phase Engineering in Atomically Thin Metals
Graphene defects are transformed from passive imperfections into programmable templates for phase‐selective growth of atomically thin silver. Plasma‐generated boundary defects favor Ag(1), whereas sp3‐rich zero‐layer graphene promotes Ag(2). This defect‐directed intercalation links local graphene chemistry to crystalline phase, electronic structure ...
Arpit Jain +25 more
wiley +1 more source

