arXiv preprints from January 1, 2026 through September 20, 2026 — 16:54:49 EST
We prove strong existence for Itô SDEs with diffusion coefficients that can introduce strong attraction to a submanifold. We extend and strengthen the Röckner-Zhao approach, which uses Malliavin calculus to establish compactness of the approximating solutions in Wiener-Sobolev space. At least when the diffusion coefficients are...
Bang (1976) proved the inequality for matrix permanents $\mathrm{per}^2(A) \geq 2^{-2n}\mathrm{per}(A \otimes J_2)$, where $J_2$ is the $2 \times 2$ all-ones matrix and $A$ is any $n \times n$ matrix with non-negative entries. We show that, if $A$ is any $n \times n$ real-valued matrix with rank at most two (possibly having negative...
Neural operators provide fast surrogate models for approximating operators between function spaces, but their predictions often lack uncertainty quantification. We develop a split conformal framework to guarantee that a calibrated pointwise band around the neural operator output contains the true solution on at least a $1-γ$ fraction...
In 1972, Jech asked whether there exists a Suslin $(ω_1, ω_2)$-forest in the constructible universe. As reported by Jech, Laver gave a positive answer, but his proof was never published and appears no longer to be available. In 2015, Eskew introduced the combinatorial principle $W^*_κ(λ)$, a strengthening of Silver's principle, and...
We introduce a framework of (Lie-)global $\infty$-categories, which formalizes various families of $\infty$-categories indexed by compact Lie groups and equipped with suitable restriction functors along continuous group homomorphisms that occur naturally in equivariant homotopy theory and representation theory. As our main results,...
A conjecture of Komlós states that the combinatorial discrepancy of any matrix $A\in\mathbb R^{m\times n}$ whose columns have Euclidean norm at most one is bounded by a universal constant. We prove that the combinatorial discrepancy of every such matrix is at most $O((\log n)^{1/4}(\log\log n)^{7/4})$. This is the first asymptotic...
For finite-dimensional linear inverse problems where the variables are Gaussian, it is well-known that the minimum-mean-square error estimator takes the form of a regularized least-squares data fit. In this chapter, we show that this equivalence extends to a much broader infinite-dimensional setting where generalized splines take the...
We generalize the homological sieve method, developed by Das, Lehmann, Tosteson, and the author, to study certain quartic del Pezzo fibrations, and we prove a version of Manin's conjecture over global function fields in these cases. Our proofs combine the $3$-dimensional positive-characteristic minimal model program, the geometry of...
We prove uniform exponential bounds for the compactly supported Betti numbers of spaces of morphisms from curves of fixed genus to projective varieties. For targets in a fixed projective space cut out by a prescribed number of equations of fixed degrees, the bound is exponential in the degree of the morphism and is independent of the...
We establish a weighted Wasserstein spectral gap for the three-dimensional damped cubic wave equation with genuinely finite rank Brownian forcing. Under a saturation condition, the gap holds with respect to the negative phase topology $\mathcal E_s=H^{-s}\times H^{-1-s}$ for every $0<s<1/2$, from which we deduce unique ergodicity and...
In this paper, we develop the weighted level set method for a Kähler manifold $(X^n,ω)$ admitting an almost holomorphic map to a possibly singular base $Z$, which is not uniruled. As a key intermediate result, we prove that any blowup $\operatorname{Bl}_SX$ of $X$ along smooth submanifolds $S$ of $ \operatorname{codim} S\ge2$ admits a...
Let $q(n)$ denote the largest number of queens that can be placed on an $n\times n$ chessboard so that no queen attacks more than one other queen. We prove that $q(n)=\lfloor4n/3\rfloor$ for every $n\geqslant6$, and that $q(n)=n$ for $n\leqslant5$, which settles a previously conjectural value. As a corollary, we also settle that, in...
In this paper, we study the dependence of the propagation speed on the diffusion ratio in a Lotka-volterra competition-diffusion system under strong competition. The model is known to admits a unique monotone travelling front connecting two exclusion equilibria and the sign of its speed determines which species invades the territory...
A web is a plane graph encoding an invariant vector in a tensor product of fundamental representations of a quantum group. A stranding of an $\mathfrak{sl}_n$ web is a system of colored oriented curves recording one monomial of the vector it encodes. This article focuses on identifying and constructing leading term strandings, those...
For $a,c\in\mathbb{N}$ and $b,d\in\mathbb{Z}$ such that the (non-empty) set \[ R_{a,b,c,d} :=\left\{\frac{an+b}{\,cn+d\,}: n\in\mathbb{N}\right\} \cap\bigl(\mathbb{Q}_{>0}\setminus\{1\}\bigr) \] is multiplicatively recurrent, we give a complete characterization of the set of limit points of every unimodular multiplicative function...
Let $R$ be a nonzero associative unital ring, let $G$ be a group, and let $ρ$ be a preorder on $\{1,\ldots,n\}$. A $G$-grading on $ρ$ induces a very good $G$-grading on the structural matrix ring $M_n(ρ,R)$. We show that, for each of the properties trivial, symmetric, epsilon-strong and strong, the grading on $ρ$ has the property if...
The online Ramsey game for graphs $G$ and $H$ is played on the infinite complete graph $K_\mathbb{N}$. In each round, Builder chooses an edge, and Painter colors it red or blue. The online Ramsey number $\tilde{r}(G,H)$ is the smallest integer $t$ for which Builder has a strategy guaranteeing a red copy of $G$ or a blue copy of $H$...
Erdős and Gallai in 1959 proved the seminal result that every $n$-vertex graph with no cycle of length at least $2t+2$ has at most $\frac{2t+1}{2}(n-1)$ edges. We prove the extension that, for every sufficiently large $t$, the same quantity is also the sharp extremal bound for graphs with no $t$ consecutive even cycle lengths,...
We study the moduli of isolated non-normal singularities by introducing the functor $\mathrm{Crimp}_S^d(X)$ of crimpings of $(X \to S)$ corank $d$. This globalizes Ishii's moduli functor of subrings of finite colength. By verifying Artin's criteria, we prove that if $X \to S$ is a separated morphism of finite presentation, then...
Let $\mathbf{C}=\partial E\subset \mathbb{R}^{n+1}$ be a regular area-minimizing hypercone. We first prove that $\mathbf{C}$ is simultaneously strictly stable and strictly minimizing if and only if there exists $c_\mathbf{C}>0$ such that \[ \operatorname{Per}(F;B_R)-\operatorname{Per}(E;B_R) \geq c_\mathbf{C} ...
For every natural number $r\geq 2$, we construct $r^{th}$ powers of bipartite graphs whose chromatic number is quadratic in their clique number, showing that the straightforward quadratic upper bound is best possible. We thereby settle an open problem posed by Chakraborty, Chandran, Jacob and Pillai [J. Graph Theory 112(3) (2026),...
The zero divisor graph $Γ(R)$ of a finite commutative ring $R$ has as vertices the non-zero zero divisors of $R$, with an edge between two elements exactly when their product is zero. We determine the boxicity and threshold dimension of $Γ(R)$ for two classes of finite commutative rings: reduced rings and quotients of principal...
In this article, using the theory of $δ$-geometry, we construct a canonical $z$-isocrystal $(\mathbf{H}_δ(E), \mathfrak{f}^*)$ admitting a Hodge-Pink structure for any abelian Anderson module $E$. The Hodge-Pink structure on $\mathbf{H}_δ(E)$ induces a natural filtration $(\mathbf{H}_δ(E) \supset \mathbf{X}_{\mathrm{prim}}(E) \supset...
Expansion planning models usually fix storage duration before optimization, setting how much storage power to build but not for how long it can discharge. We present a generation-transmission-storage expansion framework in which candidates of many durations compete on annualized cost, making the duration mix an optimization outcome....
We study long-horizon Wasserstein-penalized minimax control for discrete-time stochastic linear systems with empirical disturbance data, in which adversarial disturbance distributions induce time-varying mean and covariance dynamics, making standard turnpike arguments not directly applicable. For possibly uncentered data, we...