7,965+ open-access research outputs.
The Nash-Williams conjecture establishes degree sequence conditions ensuring Hamilton cycles in digraphs. An asymptotic version of this conjecture for large digraphs was independently derived by sever…
Accurate multiclass segmentation of the Circle of Willis (CoW) is essential for neurovascular disease management but remains challenging due to complex vascular topology and variable morphology. Exist…
Remaining Useful Life (RUL) estimation is a critical component of Prognostics and Health Management (PHM), enabling proactive maintenance scheduling and reducing unplanned failures in industrial equip…
We study properties of the following four classes of operators on the Fock space in $\mathbb C^n:$ 1) weakly localized operators; 2) sufficiently localized operators in the sense of Xia and Zheng; 3) …
Brualdi and Hoffman proposed a well-known problem of determining the graph with maximum adjacency spectral radius among all graphs with given size $m$. Early work by Friedland and Stanley addressed so…
This work realizes a three-dimensionally (3D) nanoarchitected, all organic, "self-separating" lithium-ion electrochemical energy storage (EES) device that is cycled as a solid-state full cell. The dev…
Orderings in charge and spin have been extensively studied to unravel their correlation to emergent superconductivity over the past decades. Bragg-Williams order (BWO), a classical structural order pa…
Let $K$ be an algebraically closed and complete non-archimedean and non-trivially valued field, and let $G$ be a reductive group scheme acting on a flat projective scheme $X$ defined over the base rin…
Formal models for concurrent and distributed systems describe machines; the people who operate them are either ignored or treated as external environment. Yet key distributed systems -- notably grassr…
We compute the Atiyah Real $K$-theory of $C_2$-equivariant projective spaces and construct immersions of such spaces into multiples of the regular representation. These computations are made tractable…
The longstanding Nash-Williams conjecture asserts that every $K_3$-divisible graph $G$ with $\delta(G)\ge 3n/4$ admits a triangle decomposition. In the random setting, Frankl and R\"odl showed that, w…
This paper analyzes identifiability and stability for the drifting field underlying distributional matching in the Generative Drifting framework of Deng et al. First, we introduce the class of compani…
Negative permittivity metamaterial is a scientifically rich avenue due to its tremendous application in several arena of materials research including novel superlens, band-gap materials, invisibility …
We propose a new convex programming relaxation for the weighted Nash social welfare (NSW) problem that achieves a matching $(e^{1/e}\approx 1.445)$-approximation via the rounding algorithm of Feng and…
Gate elimination is the primary technique for proving explicit lower bounds against general Boolean circuits, including Li and Yang's state-of-the-art $3.1n - o(n)$ bound for affine dispersers (STOC 2…
Understanding the spatiotemporal dynamics of disease progression in relation to transcriptomic profiles provides key insights into complex conditions such as Alzheimer disease. To enable such investig…
Since the pioneering work of Korteweg (1901) and the subsequent refinement of capillary fluid models by Dunn and Serrin (1985), the global existence of strong solutions to the multi-dimensional compre…
Quantum optimization algorithms promise advantages for difficult problems but are costly to simulate and analyze on classical machines. Recently, constrained quantum optimization has been investigated…
We construct a local matched-asymptotic description of time-harmonic elastic fields generated by Rayleigh waves near cuspidal elements of a traction-free surface. The free surface is represented local…
Perturbing a deterministic $n$-dimensional matrix with small Gaussian noise is a cornerstone of smoothed analysis of algorithms [Spielman and Teng, JACM 2004], as it reduces the condition number of th…
Free open-access publishing with Google Scholar indexing.
Submission Guide →