19,167+ open-access research outputs.
We prove superpolynomial length lower bounds for the semantic tree-like Frege refutation system with bounded line size. Concretely, for any function $n^{2-\varepsilon} \leq s(n) \leq 2^{n^{1-\varepsil…
Building on the genus-3 reduction $C_A : w^2 = \lambda^8 + A \lambda^4 + 1$ established in our companion paper (arXiv:2604.09328), we give an unconditional proof of the perfect-cuboid conjecture ("Con…
We introduce a fast, one-dimensional Newtonian {reduced model} to capture uniform rotation in cold white dwarfs, encoding centrifugal support as an effective pressure anisotropy. Using $\Delta_{\rm ro…
With the widespread adoption of large language models (LLMs), understanding their personality representation mechanisms has become critical. As a novel paradigm in Personality Editing, most existing m…
Crowds have long held a paradoxical place in the human imagination, feared for their destructive potential yet essential for collective expression. This tension was tragically manifested in the 1919 J…
This paper provides a diffeomorphism classification of smooth manifolds homeomorphic to the complex projective space $\mathbb{C}P^m$ for $m \in \{5, 6, 7, 8\}$. The classification is obtained by compu…
Let $Z=\{Z(t): t\in \mathbb R\}$ be a stochastic process with trajectories in space $\mathbb D (\mathbb R)$. It is assumed that there exists an essentially smooth function $A:\mathbb R\to (-\infty, \i…
Computing edge-connected components in directed and undirected graphs is a fundamental and well-studied problem in graph algorithms. In a very recent breakthrough, Korhonen [STOC 2025] showed that for…
Buchbinder and Feldman recently gave a deterministic $(1-1/e-\varepsilon)$-approximation for maximizing a non-negative monotone submodular function subject to a matroid constraint, with query complexi…
Lutwak's affine quermassintegral theory is a foundational component of modern affine Brunn--Minkowski theory. Developed in the 1980s, it provides affine analogues of the classical quermassintegrals an…
We prove that any random variable $X$ whose moment generating function is point-wise upper bounded by that of $ G \sim \mathcal{N}(0,1) $ must be dominated by $ G/\mathbb{E}[|G|] $ in convex order, me…
We study stability theory in Hilbert spaces quantitatively. We prove that the inner product on the unit ball is $(k,\epsilon)$-stable for all $k\ge \exp(\pi/\epsilon)$, and it is not $(k,\epsilon)$-st…
We introduce the finite-horizon first-order rank profile of a language $L \subseteq \Sigma^*$: the least quantifier rank needed by an $\mathrm{FO}[<]$ sentence to classify membership in $L$ correctly …
We study a projection-type gradient flow for equality-constrained maximisation of a smooth bilinear control objective on $\mathcal{H}=L^2(0,T;\mathbb{R})$, eliminating Lagrange multipliers through an …
This paper studies the Nash equilibrium seeking problem for stochastic games under heavy-tailed noise. The gradient noise is considered to have a finite $\delta$-th moment ($1<\delta\le 2$), which gen…
For $H \ge N^{1-\frac{1}{2c}} \ln^2 N$, where $c$ is a fixed non-integer number satisfying $$ \|c\| \ge 3c\left(2^{[c]+1}-1\right)\frac{\ln \ln N}{\ln N}, \qquad c > \frac{4}{3}\left(1 + \frac{52\ln \…
In this work, we investigate the well-posedness of a stochastic heat equation with an arbitrary (but polynomial) nonlinearity in any dimension $d\geq 1$ perturbed by a multiplicative white noise in th…
The Gram matrix is a classical object formed from the pairwise inner products of a collection of vectors, with fundamental roles in functional analysis, statistics, combinatorics, and coding theory. I…
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 study the hierarchical secure aggregation problem with groupwise keys. The problem consists of an aggregation server, $U$ relays, and $UV$ users, where each relay serves $V$ disjoint users, and eac…
Free open-access publishing with Google Scholar indexing.
Submission Guide →