1,411+ 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…
Differential-difference matrix Lax representations (Lax pairs), gauge transformations, and discrete Miura-type transformations (MTs) belong to the main tools in the theory of (nonlinear) integrable di…
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…
We describe how the spacetime positive energy theorem in dimension $n \geq 4$ follows from our recent work on the Riemannian version of the positive mass theorem. Our proof builds on the fundamental w…
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…
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…
A classical result of Steinitz from 1913 \cite{Ste13}, answering an earlier question of Riemann and L\'evy (e.g., \cite{Lev05}), states that for any norm $\|\cdot\|$ in $\mathbb{R}^d$ and any set of v…
Let $\mathcal{V}^c(\mathfrak{gl}_N)$ be Etingof--Kazhdan's quantum affine vertex algebra associated with the trigonometric $R$-matrix. We establish a connection between suitably generalized deformed $…
For positive integers $n$, $d$, $k$ and $h$, let $[n]^d$ be the $d$-dimensional grid of order $n$, and we refer to the equation $\sum_{i=1}^{h}x_{1,i}=\cdots =\sum_{i=1}^{h}x_{k,i}$ as the {\it $B_{k,…
Large language models (LLMs) produce responses rated as highly empathic in single-turn settings (Ayers et al., 2023; Lee et al., 2024), yet they are also known to be formulaic generators that reuse th…
We introduce a new type of generating theorems in General Relativity for anisotropic, static, spherically symmetric solutions of the Einstein field equations. The results are used to derive a class of…
With the rise of LLMs, there is an increasing need for intelligent recommendation assistants that can handle complex queries and provide personalized, reasoning-driven recommendations. LLM-based recom…
This paper identifies a structural limitation in current multimodal AI architectures that is topological rather than parametric. Contrastive alignment (CLIP), cross-attention fusion (GPT-4V/Gemini), a…
Impact craters are a cornerstone of planetary surface analysis. However, while most deep learning pipelines treat craters solely as a detection problem, critical scientific workflows such as catalog d…
We extend AMM trade functions to negative inputs via the \textit{concave continuation}, derived from the invariance of the local conservation law under allocation direction flips. This unifies routing…
Recently, Jiang et al. [2026] developed Leon, a practical variant of One-sided Shampoo [Xie et al., 2025a, An et al., 2025] algorithm for online convex optimization, which does not require computing a…
Given a graph $F$, the random Tur\'an problem asks to determine the maximum number of edges in an $F$-free subgraph of $G_{n,p}$. Prior to this work, the only bipartite graphs $F$ with known tight bou…
We give a linear algebraic classification of Auslander regular acyclic monomial algebras via the Bruhat factorisation of the Coxeter matrix. Namely, we show under mild assumptions that a monomial acyc…
In October 2025, research by Bo\c{t}, Fadili, and Nguyen, and by Jang and Ryu, led to the seminal result that Beck and Teboulle's FISTA converges weakly to a minimizer of the sum of two convex functio…
Free open-access publishing with Google Scholar indexing.
Submission Guide →