4,956+ open-access research outputs.
This paper proposes an algorithm for clipping line segment against an axis-aligned rectangular window. The conventional algorithms for line segment clipping treat the clipping boundary and/or the line…
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…
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…
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…
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…
In 1965 Kraichnan pointed out that a sufficiently strong background magnetic field, i.e. the case of small Alfv\'en number, will reduce the nonlinear interaction and inhibit the formation of strong gr…
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…
We establish regularity results for viscosity solutions to a class of quasilinear parabolic equations exhibiting nonhomogeneous degeneracy or singularity (a double phase regime) of the form \[ u_t - \…
The authors previously formulated the hybrid conjecture, unifying Andr\'e-Pink-Zannier and Andr\'e-Oort conjectures, and proved it in Shimura varieties of abelian type. We study its analogue for mixed…
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…
Object detection models typically perform well on images captured in controlled environments with stable lighting, water clarity, and viewpoint, but their performance degrades substantially in real-wo…
It is well known that Erd\H{o}s Matching Conjecture concerns the maximum number of hyperedges in an $r$-uniform hypergraph with bounded matching number. As a generalization, it is natural to ask for t…
Drifting Models [Deng et al., 2026] train a one-step generator by evolving samples under a kernel-based drift field, avoiding ODE integration at inference. The original analysis leaves two questions o…
We demonstrate robust programmable state preparation in small VCSEL arrays with optical feedback using transient optical injection in the form of Gaussian pulses. In Lang--Kobayashi type models of del…
The ensemble Kalman filter (EnKF) is widely used for nonlinear and high-dimensional state estimation because it replaces complex covariance propagation with simple ensemble statistics. However, conven…
We report new results on eight problems in mathematics and theoretical computer science, produced with the assistance of Bolzano, an open-source multi-agent LLM system. Bolzano orchestrates rounds of …
The proliferation of financial misinformation poses a severe threat to market stability and investor trust, misleading market behavior and creating critical information asymmetry. Detecting such misle…
Davis, Drusvyatskiy, and Jiang showed that gradient descent with an adaptive stepsize converges locally at a nearly-linear rate for smooth functions that grow at least quartically away from their mini…
Free open-access publishing with Google Scholar indexing.
Submission Guide →