Paperlane

no. 1 · from the archive · rebuiltarchive Mon 26 Oct →

Friday, 23 October 2026

325 papers in 31 fields

Analysis of PDEs46

In this short note, we prove the global well-posedness of the modified dispersion-generalized Benjamin-Ono equation with dispersion $1<α<2$, $$\partial_t u + D^α\partial_x u + u^2\partial_x u=0,$$ over the Sobolev space $H^s(\mathbb{R})$, for any regularity $s$ greater or equal than the sharp analytic well-posedness regularity. As a byproduct, we also derive nonlinear smoothing estimates and give a simple proof of local well-posedness.

comments
12 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.30275 ↗

In this paper we prove that plane waves always scatter from bounded, strictly convex planar inhomogeneities with constant material parameters. Our approach involves the introduction of a modified Pompeiu property, whose failure corresponds to the vanishing of the Fourier transform of the indicator function of the inhomogeneity on a complexified circle not centered at the origin. We then show that such vanishing is impossible for bounded, strictly convex planar sets.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.30329 ↗

We study the problem of finite time singularities in the isentropic compressible Euler equations in multiple dimensions with radial symmetry. Our initial data consists of the radially symmetric Kidder self-similar implosion with a continuous constant density cutoff. Motivated by our recent work on the one-dimensional problem, we present high-resolution radially symmetric adaptive mesh refinement simulations that when combined with asymptotic similarity solution analysis present a full picture of the ensuing dynamics of the implosion. From the cutoff point in the initial data, an expanding wave emerges. The endpoints of the wave follow the "imploding" and "exploding" characteristic speeds associated with the system of hyperbolic conservation laws. This wave has much more complex structure than the exact non-centered rarefaction wave that emerges in the one-dimensional problem. As in the one-dimensional case, the inner Kidder solution is swallowed up by the expanding wave as time approaches the singularity time. However, unlike the one-dimensional case, a blowup occurs along the point where the `imploding' side of the expanding wave attaches to the Kidder solution. This composite blowup has an asymptotic self-similar form that has an interpretation in terms of the Gurderley-type self-similarity structure. The numerical method for the PDE necessitates a Lagrangian scheme to avoid the numerical diffusion inherent in Eulerian methods. We use a leapfrog method coupled to recursive refinement of the mesh near the blowup, which allows for very high resolution simulations, resolving many orders of magnitude of the self-similar blowup. Consistent with prior rigorous results for these equations, the blowup does not involve mass concentration and exhibits a critical $L^p$ space for the concentration of the density, depending on the dimension of space.

comments
23 pages, 17 figures
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2610.30331 ↗

We show that root convexity of the pressure is preserved by the porous medium equation if the initial data is root convex, positive, smooth, bounded below by a quadratic function and has bounded Laplacian. This complements a result of Daskalopoulos-Hamilton-Lee on root concavity of pressure.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.30358 ↗

Let $Ω\subset\mathbb{R}^{d}$ be a bounded Lipschitz domain, let $α\in(0,1)$, and let $\partial_{t}^α$ denote the Caputo derivative. For $\partial_{t}^αu-\nabla\cdot\bigl(A(x)\nabla u\bigr)=f$ with homogeneous Dirichlet condition and initial datum $g\in L^{2}(Ω)$, we identify which of the thresholds appearing in the energy method belong to the method and which to the equation. We compare $f\in L^{2}\bigl((0,T);L^{2}(Ω)\bigr)$ and $f\in L^{r}\bigl((0,T);L^{2}(Ω)\bigr)$ with $r>2/α$; in the subdiffusive range the second implies the first and not conversely. Existence is not at issue and we claim none of it: it is known, for both hypotheses and under weaker ones, from the work of Zacher. What we determine is the exact set of exponents each route admits and what the exponents left outside it cost. Under the weaker hypothesis the construction below reaches $α\in(\frac12,1)$, under the stronger one every $α\in(0,1)$, and in both cases the solution lies in $L^{\infty}\bigl((0,T);L^{2}(Ω)\bigr)$, by the mode representation and not by the energy route, which yields no such bound under the weaker hypothesis. The restriction $α>\frac12$ comes from the compactness criterion, whose admissible exponents form $[1,2α)$; the exponent $r>2/α$ is exactly what the Grönwall step consumes. A concentrating family shows that nothing weaker suffices along that route, and the mode representation lowers the requirement to $1/α$. The frontier $α=\frac12$ belongs to the equation: for every $α\in(0,\frac12]$ there is $f\in L^{2}\bigl((0,T);L^{2}(Ω)\bigr)$ whose weak solution leaves $L^{\infty}\bigl((0,T);L^{2}(Ω)\bigr)$. Uniqueness and Hadamard well-posedness follow.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.30377 ↗

We study positive weak super-solutions of the Lane-Emden inequality $\mathcal{L}u := \sum_{i=1}^{n}(-Δ_{p_i})^{s_i}u \ge u^q$ in $\mathbb{R}^N$, where each $(-Δ_{p_i})^{s_i}$ is a fractional $p_i$-Laplacian of order $s_i\in(0,1]$ and exponent $p_i\in(1,\infty)$, and $\max_i s_ip_i<N$. Let $κ_i := (N-s_ip_i)/(p_i-1)$ be the decay exponent of the fundamental solution of the $i$-th operator, and let $\overlineκ := \max_iκ_i$. We show that the Serrin exponent of $\mathcal{L}$ is $\mathfrak{q}_{\mathcal{L}} = N/\overlineκ$. More precisely, for $0<q<\mathfrak{q}_{\mathcal{L}}$ the only non-negative continuous weak super-solution is $u\equiv 0$, while for every $q>\mathfrak{q}_{\mathcal{L}}$ we construct explicit positive weak super-solutions of the form $A(λ+|x|)^{-κ}$. In other words, the Serrin exponent of the sum is the smallest of the Serrin exponents $N/κ_i$ of the single operators, that is, the one of the operator whose fundamental solution decays fastest. No structural assumption relating the different operators is needed. The endpoint $q=\mathfrak{q}_{\mathcal{L}}$ is left open. The local order $s_i=1$ is treated together with the nonlocal orders, and all the arguments are carried out in the weak setting.

comments
28 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.30415 ↗

We present new inversion formulas for the unattenuated and attenuated magnetic ray transforms in the Poincaré disk, in the case of a constant, supercritical magnetic field. Our approach mirrors earlier complexification approaches by Novikov (Ark. Mat., 2002) and Bal (J. Math. Pures Appl., 2005), and a second feature of this article is to connect the approach with the Transport Twistor framework recently introduced by Bohr-Paternain (J. Éc. polytech. Math., 2023; arXiv:2606.25173).

comments
20 pages, 8 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.30529 ↗

We study the Robin, or impedance, Laplacian on a half-space of dimension $n \ge 3$ which is perturbed inside a fixed ball. The boundary may be deformed, and obstacles may be present in the interior or attached to the boundary, in any combination and with no smallness assumption. Outside the ball the configuration is the flat impedance half-space of Part I, with constant impedance $α> 0$, where a bulk channel and a surface channel propagate at every positive energy and only the surface channel propagates on the band $(-α^2,0)$. We prove a limiting absorption principle, valid at every positive energy and outside a discrete set of embedded eigenvalues in the band. We construct the generalized Fourier transform and prove its completeness by a stationary argument which constructs no wave operator and reduces completeness to the uniqueness of the scattering solution at each energy. We then obtain the scattering matrix, its unitarity and a two-channel optical theorem. The main result is a uniqueness theorem for the inverse problem. Under two geometric conditions on the pair, the scattering amplitude at a single positive energy determines the perturbation completely, and the argument does not distinguish a deformation of the boundary from an obstacle. It follows that no nontrivial perturbation satisfying the same conditions is invisible at any positive energy. On the surface band the corresponding statement is reduced to one explicitly stated question about the exterior Robin problem.

comments
74 pages, 2 figures. Part II of a two-part series; Part I is arXiv:2610.27885
fields
Analysis of PDEs, Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2610.30575 ↗

This paper and its companion Part II prove that the incompressible Euler equations in the plane, without external force, admit two distinct renormalized weak solutions with the same initial vorticity $f$, where $f$ is radial and nonnegative and lies in $(L^1\cap L^q)(\mathbb{R}^2)$ for every $q<\infty$ but is not bounded. One solution is radially symmetric and stationary. The other is $3$-fold rotationally symmetric, is equimeasurable with $f$ at every time, and departs from $f$ in finite time; the two solutions are distinct in $L^\infty_t(L^1\cap L^q)_x$ on $[0,T]\times\mathbb{R}^2$ for every $q\in(4/3,\infty)$ and every sufficiently large $T$. In this first part we prove two ingredients. One is a compactness criterion: for a radial datum, a sequence of $3$-fold rotationally symmetric solutions with converging data, whose non-radial moment is bounded below at some bounded time, has a subsequence converging to a second distinct renormalized weak solution. The other is the linear analysis for the building blocks of our multiscale datum. We show that the linearization of the Euler equations around the basic building block plus a small point vortex has an unstable eigenvalue in a space of $3$-fold rotationally symmetric perturbations. This latter argument depends on rigorous interval arithmetic that we discuss more fully in Part II.

code
github.com/mcoiculescu/NonUniqueEuler ∎ Lean project (lean/lakefile.toml, lean/lean-toolchain) builds, no sorry at 1df5e79, checked 2026-10-27 build details
comments
42 pages, 2 figures. Part I of two, Part II in preparation. LLM-assisted. The full proof, including its computer-assisted part (rigorous interval arithmetic), is formalized in Lean 4. The interval-arithmetic certificate is also checked by an independent Python/Arb implementation. Lean code, interval-arithmetic code and a working draft of Part II: https://github.com/mcoiculescu/NonUniqueEuler
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.30655 ↗

We study eventual strict log-concavity and level-set geometry for the multidimensional Fisher-KPP equation with nontrivial, nonnegative, smooth compactly supported initial data, without assuming radial symmetry or convexity of the initial superlevel sets. Our main result is that there exist $T>1$ and $c>0$ such that $D_x^2\log u(t,x)\le -(c/t)e^{-β_*t}\mathrm{Id}$ for all $t\ge T$ and $x\in\mathbb{R}^N$, where $β_*=2(\sqrt2-1)$. Consequently, after a single waiting time, $u(t,\cdot)$ has exactly one critical point, a nondegenerate global maximizer, and every level set $\{u(t,\cdot)=λ\}$ with $0<λ<\max_x u(t,x)$ is a smooth closed strictly convex hypersurface with positive principal curvatures. For levels in any fixed closed interval $K\subset(0,1)$, the level sets are radial graphs $ρ=R_λ(t,ω)$, with every principal curvature bounded below by $(1-C\log t/t)/(2t)$ for all sufficiently large $t$. Unlike log-concavity, ordinary concavity exhibits a threshold determined by the inflection level of the critical travelling wave: for each fixed level above it, $u$ is eventually strictly concave on its superlevel set, whereas below it concavity eventually fails. Our proof proceeds by establishing estimates in four overlapping spatial regions. In the fixed-front region, we combine a one-sided estimate for second angular derivatives with radial and mixed derivative bounds to obtain curvature control without differentiating the Lipschitz directional phase. In the remaining regions, absorptive comparison in the invaded interior, leading-edge barriers and blow-up arguments through the diffusive scale, and Gaussian amplitude estimates combined with parabolic regularity in the exterior yield the required logarithmic-Hessian bounds.

comments
52 pages, 1 figure
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.30702 ↗

Blowup analysis is a central part of geometric analysis, and systems of PDEs such as Toda systems exhibit particularly rich blowup behavior. In [Nie25], the author constructed explicit families of radial Toda solutions whose blowup masses correspond to arbitrary elements of the Weyl group of the underlying Lie algebra. In this paper, we study these families within the framework of blowup analysis developed by C.-S. Lin and his coauthors. The key is an asymptotic analysis of the solution family that distinguishes Cartan elements in the interior of a Weyl chamber from those lying on its boundary faces. We prove a uniform upper bound for $u_i^{λ,H}(r)+2\log r$, so that the selection estimate holds with the center at the origin. We show that the successive bubbling scales for slow decay are determined by the intersections of the ray $H+tq_μ$ with root hyperplanes. At each crossing, rescaling and the face asymptotics identify the limiting profiles as explicit solutions of the corresponding Levi-Toda subsystems. The masses of these successive bubbles, computed using [KLNW24], account for the entire blowup mass. Examples in type $A_2$ demonstrate this identification and exhibit both separated scalar bubbles and a simultaneous full-system bubble.

comments
Comments welcome!
fields
Analysis of PDEs, Differential Geometry, Representation Theory
pdf ↗ page arXiv:2610.30767 ↗

We prove that the Hasegawa-Mima equation (HME) is the limit of a magnetized pressureless Euler-Boltzmann system in a special scaling regime. The proof relies on the derivation of a uniform estimate independent of the scaling parameter, using the particular structure of the singular system and the identification of a combination of the unknowns that compensates for fast oscillations in time. We also show that HME allow us to investigate a conditional property of inverse energy cascade and drift waves.

comments
28 pages. Comments are welcome!
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2610.30788 ↗

In this paper, we investigate the spatial decay and asymptotic stability of forced waves for the Fisher-KPP equation in a shifting heterogeneous environment, focusing on the critical speed $c_*=2\sqrt{r_+}$. Within the framework of regular variation, we establish a complete classification of critical wave tails in terms of the asymptotic behavior of the environmental deviation $r_+-r(z)$ as $z\to+\infty$. In each case, we derive precise spatial decay that characterize how the environmental tail modifies the leading-order decay of the wave at criticality. We further establish asymptotic stability estimates of forced waves. For initial data satisfying an exponentially weighted boundedness condition, we prove an $O(t^{-1/2})$ convergence rate in the uniform norm. Under stronger spatial decay assumptions on the weighted initial data, this rate improves to $O(t^{-1-σ/2})$, for $σ\in[0,1]$, in both the uniform norm and a weighted norm. Moreover, no smallness assumption on the initial perturbations is needed for our results.

comments
35 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.30820 ↗

A recently proposed reaction-diffusion model for the tulip breaking virus (TBV) has been shown to generate striped pigmentation patterns on growing tulip petals. In this paper, we investigate the formation of localized spike patterns in this model in the asymptotic limit of small viral diffusivity. It is known that two distinct bifurcation mechanisms can occur which generate new spikes as the domain half-length $L$ slowly increases: spike self-replication and spike nucleation. Self-replication occurs through a saddle-node bifurcation of the inner spike core problem, whereas nucleation is associated with a fold of the nonlinear outer problem. Using matched asymptotic expansions, we derive critical conditions for these mechanisms and construct phase diagrams that predict which mechanism occurs first as $L$ increases, or whether nucleation is absent. We further combine these results with a Turing instability analysis of the homogeneous steady state to obtain a phase diagram of pattern-forming mechanisms. An interesting finding is that, for the TBV model, the Turing-unstable region lies entirely within the parameter regime where spike nucleation is possible. These results provide further insight into the mechanisms underlying the formation and evolution of pigmentation patterns in virus-infected tulips.

fields
Analysis of PDEs, Dynamical Systems
pdf ↗ page arXiv:2610.30855 ↗

In this paper, we investigate the compressible upper-convected Maxwell (UCM) system in \(\mathbb{R}^3\), which corresponds to the purely elastic case of the compressible Oldroyd-B model with vanishing retardation time. In this regime, the velocity equation loses the viscous dissipation term, and the constitutive nonlinearities induce a derivative loss, so that the standard approaches in Sobolev or finitely regular Besov spaces fail. We therefore work in analytic function spaces, realized as exponentially weighted hybrid Besov spaces, and develop a global-in-time analytic framework based on Littlewood–Paley analysis and uniform-in-\(τ\) energy estimates. A key ingredient is the introduction of the kinematic stress tensor, which allows us to establish the required a priori estimates in hybrid Besov spaces. Based on these estimates, we prove the existence of a unique global-in-time analytic solution for small analytic initial data. Moreover, for ill-prepared data, we rigorously justify the global-in-time relaxation (Newtonian) limit as the relaxation parameter \(τ\to0\), with an explicit convergence rate of order \(O(\sqrtτ)\).

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.30943 ↗

We study a nonlocal Fisher–KPP equation on the real line with compactly supported initial data. The reaction satisfies $f(s)\le f^{\prime}(0)s$ for $0\le s\le1$, with a power bound on $f^{\prime}(0)s-f(s)$ near zero. For continuous even probability kernels $J$ comparable to $|x|^{-γ}$, $γ>1$, we prove a global two-sided estimate and locate every fixed level set with a bounded error in $\log|x|$. The propagation scale is $\exp(f'(0)t/γ)$ for every $γ>1$. This differs sharply from the free-boundary propagation studied by Du and Ni \cite{DuNiJEMS}. For polynomial kernel tails, spreading in their model has linear, algebraic or $t\log t$ growth. We also obtain arrival-time and weighted-integral estimates and identify a spatial tail coefficient when $|x|^γJ(x)$ has a positive limit.

comments
44 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.30986 ↗

We study initial-boundary value problems for linear lattice differential equations on the half-line. We first give a systematic account of fundamental solutions for equations with general finite-range interactions. We then develop complementary approaches based on reflection, the Laplace transform, and the unified transform method, obtaining contour integral and Bessel-function representations of solutions. For the semidiscrete diffusion equation, we justify these representations for continuous boundary data and initial data of polynomial growth, establish uniqueness in the corresponding growth class, and derive spatial estimates and long-time properties, including asymptotic periodicity. We also treat nonhomogeneous equations, Robin boundary conditions, nonsymmetric coefficients, and a class of time-dependent coefficients. Finally, higher-order examples illustrate how the unified transform approach extends beyond second-order equations.

fields
Analysis of PDEs, Mathematical Physics, Complex Variables
pdf ↗ page arXiv:2610.31057 ↗

We obtain two quantitative results related to classical rearrangement inequalities for the first Dirichlet eigenvalue. The first one is a quantitative version of Chiti's reverse Hölder inequality. More precisely, for every $1\le q<p<\infty$, we prove that the deficit controls, up to translations, the $L^q$ distance between a first eigenfunction of a bounded domain and the first eigenfunction of the ball having the same first eigenvalue. The second result concerns the Kohler–Jobin inequality and gives a quantitative estimate in terms of the $L^\infty\!\to L^2$ distance between the corresponding Dirichlet resolvents. In both cases, the main idea is to find a suitable superlevel set of the first eigenfunction which is almost optimal for the Faber-Krahn inequality.

fields
Analysis of PDEs, Spectral Theory
pdf ↗ page arXiv:2610.31063 ↗

This paper investigates pointwise and oscillatory potential estimates for viscosity solutions and their gradients to a class of nonlocal fully nonlinear elliptic equations. The key ingredient of our argument is to establish precise pointwise bounds for a novel fractional sharp maximal function defined in terms of affine functions. As an immediate consequence, we prove higher order Sobolev regularity results of Calderón-Zygmund type for such equations without imposing any global boundedness assumptions on viscosity solutions. The potential theory developed herein extends the work of Daskalopoulos-Kuusi-Mingione (Commun. Partial Differ. Equ. 39: 574-590, 2014) for fully nonlinear second order elliptic equations to the fractional fully nonlinear setting.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31082 ↗

Let $Ω\subset\mathbb{R}^n$ be a bounded domain with $n\geq2$. The well-known Payne-Pólya-Weinberger conjecture for consecutive eigenvalue ratios asserts that $$ \frac{λ_{m+1}(Ω)}{λ_m(Ω)}\leq\left(\frac{j_{n / 2,1}}{j_{n / 2-1,1}}\right)^2,\quad m=1,2,3,\cdots. $$ Here, $j_{p,k}$ denotes the $k$-th positive zero of the Bessel function $J_p$, and $λ_j(Ω)$ are the Dirichlet eigenvalues of $Ω$, counted with multiplicity and ordered as $$ 0<λ_1(Ω)<λ_2(Ω)\leqλ_3(Ω)\leq\cdots. $$ The cases $m=1,2,3$ were established by Ashbaugh and Benguria in their seminal works. In this paper, we give an affirmative answer to the Payne-Pólya-Weinberger conjecture for $m=4$ by combining a quadratic-form identity with a Brouwer degree argument. We also extend the corresponding spectral inequality to arbitrary bounded open sets in $\mathbb{R}^n$.

comments
37 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31088 ↗

We establish sharp Beckner–Onofri on the CR sphere $\mathbb{S}^{2N-1}\subset\mathbb C^N$, $N\ge2$, under vanishing holomorphic moments through degree $m\ge1$. The optimal coefficients are $\frac{1}{m+1}$. The function inequality admits a stronger form involving only the energy above degree $m$. We also prove a quantitative concentration estimate in the $1$-Wasserstein distance and show that every maximizing sequence has diverging energy and approaches the family of uniform measures on regular $(m+1)$-polygons. The proof combines subcritical minimization with rigidity of the constrained Euler–Lagrange equation, obtained from an exact radial energy identity and a Hardy space projection estimate. Finally, weighted ball automorphisms yield sharp inequalities without moment constraints, with scalar conformal, barycenter, and holomorphic Gram determinant corrections.

comments
33 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31092 ↗

We consider the classical model for small-strain thermoviscoelastic evolution in isotropic Kelvin-Voigt materials with inertia, as given by $$\begin{cases} u_{tt} = μΔu_t + (λ+μ)\nabla\nabla\cdot u_t + \hatμΔu + (\hatλ+\hatμ)\nabla\nabla\cdot u - B\nablaΘ, \\ κΘ_t = DΔΘ+ μ|\nabla u_t|^2 + (λ+μ)|\mathrm{div}\,u_t|^2 - BΘ\,\mathrm{div}\,u_t. \end{cases}$$ Recently, Winkler (arXiv:2602.05964) established global-in-time solvability for an initial value problem in smoothly bounded multi-dimensional domains $Ω$ under homogeneous Dirichlet boundary conditions for the displacement variable $u$, and homogeneous Neumann boundary conditions for the temperature $Θ$, allowing the heat capacity $κ$ to depend on $Θ$. Moreover, it was shown there that the corresponding temperature is positive a.e. in $Ω\times(0,\infty)$. In the present work, we strengthen this positivity result by deriving a quantitative lower bound for $Θ$. Our analysis applies to heat capacities $κ$ with power-law scaling for small arguments, precisely: either $κ(ξ)\simξ^α$ for some $α\ge 0$, or $κ(ξ)\geξ$, in a suitable neighborhood of $ξ=0$. Under these structural assumptions on $κ$, we show that for every $τ>0$ and $T>τ$ there exists $c(τ,T)>0$ such that $Θ(x,t)\ge c(τ,T)$ for a.e. $(x,t)\inΩ\times(τ,T)$.

comments
22 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31124 ↗

This manuscript studies a coupled system of nonlinear parabolic and hyperbolic equations that models thermoviscoelastic materials with explicit internal stress relaxation, $$\begin{cases} τu_{ttt} + u_{tt} = (D(Θ)u_{xt})_x + (C(Θ)u_x)_x, \\ Θ_t = Θ_{xx} + |E(Θ)u_{xt} + F(Θ)g_t|^2, \\ τg_t + g = D(Θ)u_{xt} + C(Θ)u_x. \end{cases}$$ The system arises from a stress-strain constitutive relation of Zener type, where the internal variable $g$ encodes mechanical memory effects. A key feature is the explicit coupling of stress relaxation to the heat equation through the dissipation term, which differs from standard approaches that eliminate $g$ via algebraic substitution. Under the assumptions that $τ>0$ and that $D,C\in C^2([0,\infty))$ are positive and $E,F\in C^1([0,\infty))$, and for suitably regular initial data, we establish local existence and uniqueness of strong solutions. Under additionally strengthened regularity requirements on the initial data and on $D,C$, this solution is moreover shown to be classical. These results extend a corresponding local strong and classical solvability theory developed for the underlying system without the stress variable $g$ to the present, stress-augmented setting.

comments
33 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31134 ↗

The Grushin Laplacian $Δ_α= Δ_x +|x|^{2α}Δ_y $ is a degenerate elliptic operator in $\mathbb{R}^{h+k}$ that degenerates on $\{0\} \times \mathbb{R}^k$. We explicitly compute the Grushin spherical harmonics on the gauge sphere $\{(x,y) \in \mathbb{R}^{h+k} : |x|^{2(α+1)}+(α+1)^2|y|^2=1\}$ and the corresponding spectrum when the non-degenerate dimension $h=1$, a case not covered by the existing literature. The eigenfunctions consist of homogeneous Grushin-harmonic polynomials of degrees $n \equiv 0,1 \pmod{α+1}$, even and odd in the $x$-variable respectively, which can be described in terms of Jacobi polynomials.

fields
Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.31137 ↗

In this paper, we consider \[ \begin{cases} u=K*(|x|^αa_0(x)v^p)&\quad\hbox{in }\mathbb R^n,\\ v=K*(|x|^βb_0(x)u^q)&\quad\hbox{in }\mathbb R^n, \end{cases} \] where $n\ge2$, $0<ρ<n$, $p,q>0$, and $α,β>-ρ$. The radial kernel is nonincreasing and satisfies $K(r)\asymp r^{ρ-n}$. The coefficients satisfy $0<c_0\le a_0(x),b_0(x)\le C_0$ and $|x|(|\nabla\log a_0(x)|+|\nabla\log b_0(x)|)\le L$. We prove nonexistence if \[ \frac{n+α-\varepsilon_a}{p+1} +\frac{n+β-\varepsilon_b}{q+1}>n-ρ+\varepsilon_K, \] where the defects bound the radial logarithmic derivatives. No symmetry, finite-energy condition, or prescribed decay is assumed. The proof combines a localized virial identity with a source-layer pressure estimate whose constants are uniform under centered dilations, including the low-order range $0<ρ\le1$. We also identify the necessary scaling range for existence. For radial weighted Newton systems with unequal powers, we prove that the combined coefficient defect has a sharp, unattained infimum equal to the subcritical gap. A fixed bound on the coefficient ratios forces a strictly larger defect, whereas suitable coefficient–solution pairs approach the threshold with excess at most $C/\log M$. In the scalar Newton case, the threshold is explicit and the approximating family converges, after normalization, to an explicit critical weighted profile. The sharpness results concern the Newton kernel; no corresponding construction is asserted for general fractional kernels.

comments
36 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31167 ↗

We establish sharp quantitative stability of the Ashbaugh–Benguria inequality on bounded convex domains in $\mathbb R^n$. After volume and centroid normalization, the eigenvalue-ratio deficit controls the squared $H^{-1/2}(\mathbb S^{n-1})$ norm of the radial displacement from the unit sphere. This yields the optimal exponent $5/2$ for the Fraenkel asymmetry and, for small deficits, the optimal exponent $(n+4)/2$ for the normalized Hausdorff distance. All three exponents are sharp even among smooth strictly convex domains whose principal curvatures lie in $[1/2,2]$. In particular, the quadratic Fraenkel-asymmetry estimate proposed by Brasco and De Philippis (2017, Open Problem 7.65) fails. We also determine the optimal stability exponents under higher-order radial regularity bounds.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31223 ↗

We study the long-time Fourier distribution of driven passive scalars transported by an incompressible alternating shear flow (the Pierrehumbert flow) subjected to IID random phase shifts, in the regime of strong shear-strength. With a novel and self-contained proof, we establish (i) a quantitative version of the cumulative Batchelor's law; (ii) quantitative negative regularity mixing estimates; and (iii) a strong form of `sparsity' -- unevenness in the distribution of Fourier mass in radial sectors in frequency space. Our method uses the strong shear-strength assumption to handle a purely deterministic scalar driving term.

comments
44 pages
fields
Analysis of PDEs, Dynamical Systems, Probability
pdf ↗ page arXiv:2610.31241 ↗

We study bounded realizations of Caputo differentiation on coefficient Banach spaces of fractional power series. The main contribution is an explicit quantitative analysis of local approximation and periodic reconstruction. We determine the least possible simultaneous error in the initial displacement and the prescribed target. The optimal value is attained, and a minimizing perturbation is given explicitly. We also solve the exact-arrival problem and establish uniqueness of its least-norm solution. These formulas provide computable approximation times and identify the sharp threshold for hypercyclicity, mixing and Devaney chaos. Every periodic point is described by a finite block whose geometric repetition yields exact norm formulas. The resulting approximations attain any prescribed sufficiently large minimal period near any given vector. For distinct positive powers, a simultaneous block construction gives quantitative error estimates and the same sharp threshold for disjoint mixing. Compact embeddings relate the Banach realizations to the Mittag-Leffler-Caputo Fréchet space. They also exhibit dense stable invariant subspaces inside chaotic realizations. The local approximation condition is a norm formulation of classical transitivity. Its quantitative evaluation, together with explicit periodic and simultaneous reconstruction, provides the central results of the study.

fields
Analysis of PDEs, Mathematical Physics, Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2610.31255 ↗

We establish a new abstract minimax theorem for obtaining ground-state critical points of a class of \(C^{1}\)-functionals. The central feature of this class is that the associated Nehari set is not necessarily a differentiable manifold, but is homeomorphic to a (possibly non-complete) submanifold of the unit sphere. This occurs for functionals whose fibering maps \(t \mapsto I(tu)\) possess a unique global maximum point only when \(u\) belongs to an open cone in the underlying Banach space. A lower semicontinuous boundary barrier, which may be finite, controls minimizing sequences near the boundary of the spherical cone. As a consequence, we provide a general minimax characterization of the ground-state energy level. Elliptic applications complement existing results and include superlinear and quasilinear problems with finite barriers, including thresholds depending on the profile of a first eigenfunction and its gradient.

comments
38 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31262 ↗

We consider the $Φ^4_d$ measure under radial symmetry on the unit ball, formally given by $$dρ(u) = \frac 1 Z \exp\Big( - \frac 14 \int_{B_1} |u|^4 dx - \frac 12 \int_{B_1} |\nabla u|^2 dx\Big) d u, $$ where $u$ is restricted to radially symmetric functions with 0 boundary conditions. We prove that for every dimension $d$, there exists such a measure, which is concentrated on $L^p(B_1)$ for every $p < \frac{2d}{d-2}$ (for every $p < \infty$ if $d \le 2$). Furthermore, we show that these measures are not Gaussian, and when $d \ge 4$, they are singular with respect to the underlying Gaussian measure. We achieve this result by first defining the measure $ρ^+_δ[λ]$ on the shell $\{δ\le |x| \le 1\}$, $0 < δ< 1$, with a boundary condition on the sphere of radius $δ$ of the form $u|_{\{|x| = δ\}} = λ$. Then we prove that this measure satisfies a variational formula, and use it to show moment bounds which are uniform in the boundary value $λ$. A crucial ingredient in this argument is the fact that every solution of the elliptic equation $-Δu + u^3 = 0$ on the annulus $\{ δ\le |x| \le 1 \}$ satisfies uniform bounds inside the domain, independently of the boundary conditions.

comments
81 pages
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2610.31267 ↗

We prove a sharp quantitative version of the Talenti rearrangement inequality. Specifically, we show that, for any $p\in [1;+\infty]$, for any $f\in L^\infty(Ω),\, f\geq 0,\, f\not\equiv 0$, for any open set $Ω\subset \mathbb{R}^d$ with finite volume, the solution $u_{f,Ω}$ to $-Δu_{f,Ω}=f,\, u_{f,Ω} \in W^{1,2}_0(Ω)$, satisfies, in dimension $d\geq 1$, $\Vert u_{f^\sharp,Ω^\sharp}\Vert_{L^p(Ω^\sharp)}-\Vert u_{f,Ω}\Vert_{L^p(Ω)}\gtrsim α(Ω)^2+\inf_{z\in \mathbb{R}^d}\mathscr A(f,z)^2$ and, in dimension 1, $ \Vert u_{f^\sharp,Ω^\sharp}\Vert_{L^p(Ω^\sharp)}-\Vert u_{f,Ω}\Vert_{L^p(Ω)}\gtrsim α(Ω)+\inf_{z\in \mathbb{R}}\mathscr A(f,z)^2$ where $α(Ω)$ denotes the Fraenkel asymmetry of $Ω$, $\mathscr A(f,z)$ a weighted asymmetry of $f$ with respect to some center $z$ and $Ω^\sharp$ (resp. $f^\sharp$) is the Schwarz rearrangement of $Ω$ (resp. of $f$). In dimension $d\geq 2$, this estimate implies $ \Vert u_{f^\sharp,Ω^\sharp}\Vert_{L^p(Ω^\sharp)}-\Vert u_{f,Ω}\Vert_{L^p(Ω)}\gtrsim α(Ω)^2+\inf_{z\in \mathbb{R}^d}\Vert f-f^\sharp(\cdot-z)\Vert_{L^1}^2.$ Our result sharpens and extends recent quantitative versions, and does not rely on shape differentiation arguments, but on a generalisation of the quantitative Saint-Venant inequality.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31369 ↗

Let $u$ be the torsion function of a bounded domain $Ω$ in $\mathbb{R}^n$ for the Ornstein–Uhlenbeck operator, that is, the solution of $-Δu + x\cdot\nabla u = 1$ in $Ω$ with $u=0$ on the boundary. We prove that for every $n\ge2$ there are bounded, centrally symmetric domains whose torsion function is not concave. These domains have boundary with a flat piece and can be smoothed so that the boundary is $C^\infty$, strictly convex with principal curvatures bounded below by a positive constant, while keeping the torsion function not concave. In contrast, the torsion function for every ellipse centered at the origin is concave, and for every ball centered at the origin we prove the sharp bound $D^2u\leq-\frac{1}{n}I$. The ellipse result follows by deformation from the disk, using a boundary flux estimate and third-order boundary identities to exclude a first zero eigenvalue of the Hessian.

comments
13 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31405 ↗

On coarse grids, fronts of fractional conservation laws can be narrower than one cell, while the flux through each face depends on the whole domain. For the forced space-fractional Burgers equation, we write the finite-volume defect exactly, with the Riesz flux acting as a nonlocal interface flux. Our proposed closure, NRC, is decoder-only, since the encoder is the exact cell-average projection and a small network only maps cell averages to a sub-cell reconstruction. The decoder adds rational atoms with learned complex poles to a trigonometric histopolant, preserves every cell average, and has closed-form advective and Riesz fluxes. We prove that the scheme conserves mass for every value of the weights and that the learned sub-grid flux has a dipole tail. On 64 cells, NRC reaches a median test error of 0.0308% over three seeds, against 0.431% for WENO5-Z and 0.153% for a black-box flux correction. Ablations show that the exact global operator, the projection and the sub-grid Riesz flux carry most of this gain, and most sub-cell fronts carry a deep learned pole within a quarter cell. NRC keeps its advantage over WENO5-Z under shifts of the order and the forcing and, when trained on several diffusivities, under the tested diffusivity shifts by factors from 0.6 to 2.5 in the median over seeds. From 32 to 128 cells, NRC stays an order of magnitude more accurate than WENO5-Z on the same grid. This gain lies in accuracy per degree of freedom and in an interpretable closure.

comments
98 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31419 ↗

We examine the proof of Dongyi Wei's logarithmic circulation criterion. A trace estimate specific to $\nabla(u_r/r)$ replaces a generic squared-swirl form bound by one with one logarithm rather than two. Repeating the coupled $J$--$Ω$ energy and comparison argument then gives a proposed threshold of order $(\log D)^{-5/4}$. Under the hypotheses stated below, the proof is intended to establish regularity when $|r u_θ|\le C|\log r|^{-α}$ uniformly near the axis with $α>5/4$, and at $α=5/4$ with an absolute sufficiently small coefficient. Every analytic step, including the cutoff core and exterior terms, is included for independent checking.

comments
With the help of an OpenAI Dot, we quickly obtained preliminary results. We subsequently found that a manuscript by Stan Palasek (arXiv:2610.29012) presents essentially the same main results. However, the technical approaches differ, particularly in the squared-swirl estimate, which is substantially shorter in our manuscript. We will further refine and polish the manuscript
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31435 ↗

We prove smoothness up to the boundary for $k$-Hessian eigenfunctions on smooth bounded uniformly convex domains when $2\leq k<n$. This resolves an open problem in the regularity theory of degenerate fully nonlinear elliptic equations and extends the boundary smoothness theorem for Monge–Ampère eigenfunctions. In contrast to the Monge–Ampère case, the linearized $k$-Hessian operator remains uniformly elliptic up to the boundary.

comments
32 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31445 ↗

We determine the global minimizers of the three-dimensional Yukawa lattice energy at every fixed density. At unit covolume, BCC is the unique minimizer below a transition parameter $κ_*\approx1.7179218684699$, FCC is the unique minimizer above it, and exactly these two lattice classes minimize at the transition. Mathematically, denote the Yukawa potential and the energy per particle under this potential by \[ v_κ(r)=\frac{e^{-κr}}r,\qquad E_κ(L)=\frac12\sum_{v\in L\setminus\{0\}} \frac{e^{-κ|v|}}{|v|}. \] Then, \[ \arg\min_{|L|=1}E_κ(L)= \begin{cases} \hbox{BCC lattice},&0<κ<κ_*, \hbox{BCC or FCC lattice},&κ=κ_*, \hbox{FCC lattice},&κ>κ_*. \end{cases} \] As a consequence, the zero-screening comparison recovers the unique BCC minimum for the renormalized Coulomb energy.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31456 ↗

We study symmetric divergence form elliptic equations with measurable coefficients that may be degenerate and unbounded, under a uniform bound on the coarse ellipticity ratio over all ambient cubes and scales. We prove that uniform coarse ellipticity and classical $A_2$ weighted ellipticity define incomparable coefficient classes. For every admissible choice of coarse parameters, we construct a scalar weight with a logarithmically corrected, locally integrable singularity along a product Cantor set. Its codimension is chosen according to the upper coarse discount exponent, and the resulting coefficient satisfies the uniform coarse condition but is comparable to no $A_2$ weight. Conversely, an explicit $A_2$ weight fails the coarse condition for every admissible parameter choice. Under uniform coarse ellipticity we give a direct PDE treatment of boundary regularity in the approximable energy realization. Using coarse interior estimates, we prove boundary decay and solvability of the continuous Dirichlet problem in bounded NTA domains. An almost-positivity argument, with energy approximation and boundary testing justified, yields boundary Harnack and Hölder continuity of quotients of positive solutions with common zero boundary values. The argument requires no additional energy Sobolev inequality and avoids the construction of Green functions. Further examples distinguish uniform coarse control from finite coefficient moments and from coercivity on $\mathrm L^2(\mathrm{d} x)$. We also record interior Hölder estimates and continuity criteria under nonuniform control along nested scales.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31463 ↗

Building on the spacetime observable symmetry discovered in NWX (2025), we introduce asymptotic observable symmetry (AOS) for the wave equation. Its central object is a family of generated approximate velocities constructed from fixed profiles, carrying the same propagation-induced symmetry at different scales and asymptotically realized by exact waves. We investigate AOS on the disc through radial propagation and reflection. This gives a family of spacetime measurable observation sets satisfying the essential spacetime measurable geometric control condition for a fixed positive observation time. However, the observability inequality fails on each of these fixed sets.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31477 ↗

In this paper we study the convergence of solutions of the Stokes equations in a domain perforated by slender bodies placed on a fixed periodic grid of size $2ε$ as the size of the bodies goes to zero and the number of bodies goes to infinity. We assume that the width $b_ε$ of the bodies vanishes faster than the length $a_ε$ of the particles. We identify the critical scaling regimes for $a_ε$ and $b_ε$ and prove that in this case the system is effectively described by the Brinkman equations.

comments
45 pages, 2 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31480 ↗

We study Liouville-type theorems for stationary solutions of the incompressible magnetohydrodynamics equations in $\mathbb{R}^n$, with directional fractional dissipation $(-\partial_i^2)^αu$ and $(-\partial_j^2)^βb$, where $n\ge 2$ and $0<α,β\le 1$. We prove that $u\equiv b\equiv 0$ by assuming that $u\in L^{p,\infty}(\mathbb{R}^n)$ and $b\in L^{q,\infty}(\mathbb{R}^n)$, with suitable conditions on $p$ and $q$. The proof uses a localized fractional energy identity and does not assume finiteness of the global homogeneous Sobolev energy. The method also applies to the case of full fractional dissipation. For the system with common-directional fractional dissipation, we prove stationary uniqueness for compactly supported perturbations of arbitrary smooth transverse shear backgrounds when $0<α,β<1$. We also establish a quantitative uniqueness criterion for perturbations of backgrounds with bounded gradients that are not necessarily compactly supported, for all $0<α,β\le 1$, assuming directional localization.

comments
28 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31517 ↗

We consider the fractional Laplacian with added critical or subcritical Hardy potential, called Hardy operator. We prove a Hörmander spectral multiplier theorem, i.e., the boundedness of sufficiently smooth multipliers of these Hardy operators on Lebesgue spaces. The range of admissible Lebesgue exponents is optimal, but the smoothness assumption is probably not. The proof combines the Helffer–Sjöstrand formula with a quantitative Jaffard lemma for operator-valued matrices.

comments
28 pages
fields
Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.31532 ↗

We develop a local well-posedness theory for the spatially inhomogeneous 3-d Boltzmann equation with hard sphere cross-section, accommodating a class of large initial data. This class is an interpolation between the space $L_{x}^{\infty}L_v^{1}$ and $L_{v}^1L_{x}^{\infty}$ (with weight in $v$). It is notable for including data that can have infinite $L_{x,v}^\infty$-norm, entropy density. The core idea of the proof is a homogenization method based on collision geometries. As a key application, we prove the kinetic limit of hard sphere gases with initial data in this space, having certain extra conditions. This is the first proof on the kinetic limit of hard sphere gases with singular initial data. We also derive weak stability estimates of Boltzmann equation and hard sphere gas within the same functional spaces.

fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2610.31570 ↗

We establish a sharp pointwise gradient estimate for positive entire classical solutions of the Lane–Emden system when one of the exponents lies below the Serrin exponent $n/(n-2)$. The estimate generalizes the positivity of the scalar curvature of the associated conformal metric in the biharmonic case $q=1$. The coefficient in the estimate is optimal on the critical hyperbola.

comments
13 pages. All comments welcome!
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2610.31584 ↗

For $d\geq2$, $0<s<1$, $p>1$, and $τ>0$, we study the sharp half-space remainder \[ [u]_{s,p,+}^p-\mathcal D_{d,s,p}\int_{\mathbb R^d_+}x_d^{-sp}|u|^p\,dx \geqΛ_{d,s,p,τ}\int_{\mathbb R^d_+} \frac{x_d^{τ-sp}|u|^p}{(x_{d-1}^2+x_d^2)^{τ/2}}\,dx. \] We first obtain exact dimensional and angular reductions by an $L^p$ contraction. For $p=2$, we identify the planar sharp coefficient with the simple first eigenvalue of a singular angular operator with compact resolvent. We prove a ground-state representation and a two-sided estimate for the sharp deficit. These give quantitative stability and a Fourier–Mellin energy criterion for extremizing sequences in all dimensions. For the distance with multiplier $h(ξ)=\min\{ξ^2,1\}$, the best planar stability coefficient is not attained and is strictly smaller than the quadratic dispersion coefficient. The minimizing frequencies are nonzero when $τ=2$ and $s$ is close to one. Finally, we prove normalized local limits for the sharp quadratic constant, each fixed fiber eigenvalue, and the dispersion coefficient.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31595 ↗

We prove non-uniqueness for the forced one-dimensional Vlasov-Poisson equation on the whole space. More precisely, for every finite $p$, we construct a nonnegative ion density, smooth for positive times, and a source $S\in C([0,1];L^1(\R^2))$ with $S(0)=0$, for which there exist two distinct nonnegative distributional solutions $f_\pm\in C([0,1];L^1(\R^2))$ with the same zero initial datum and with spatial densities bounded in $L^p(\R)$ uniformly in time. The result is sharp in terms of the integrability of the spatial densities: our solutions have Lipschitz electric fields, and we show that in this class uniqueness holds as soon as the spatial density is bounded.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31629 ↗

We give a constructive representation of the solution of the KdV equation $u_t=-u_{xxx}+6uu_x$ on $\mathbb R$ for real initial data in $H^3(\mathbb R)$. The approximations couple an exact, unitary centered-difference Chernoff product for the Airy group with a skew-symmetric discretization of the quadratic term, and are computed by Picard iteration; they preserve the $L^2$ norm exactly, as does the limit. A two-mesh Cauchy argument shows that the whole sequence converges in $C([0,T];H^2)$, at rate $O(n^{-\frac{2(s-2)}5})$ for $H^s$ data ($3\leq s\leq 7$), and in $L^2$ at rate $O(n^{-6/5})$ for $H^3$ data. This scheme, to the best of our knowledge, is novel and is of independent interest. As a by-product we obtain existence and uniqueness of strong solutions, Lipschitz dependence on the data in the $H^2$ norm, uniformly on bounded subsets of $H^3$ and compact time intervals, and joint locally Lipschitz dependence of $(t,f)\mapsto S(t)f$ into $L^2$; the classical conservation laws extend the flow globally in time.

comments
Comments are welcome!
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.31634 ↗

Combinatorics38

We give a matroid-theoretic analogue of Gaussian elimination and use it to construct, for every matroid M, the syzygy matroid Syz(M) on the collection of circuits of M. Dualizing the construction yields the combinatorial adjoint Adj(M) on the collection of maximal proper flats of M, and the two are related by Adj(M) \simeq Syz(M*). Neither construction depends on a realization. We determine Syz(M) when M is U_{k,k+3} or the Vamos matroid V_{8}. We also show that Adj(M) is an adjoint of M when M has rank 3. When M has rank 4 and V_{8} is a restriction of M, Adj(M) has rank 3 and is not an adjoint of M.

comments
27 pages, 5 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.30283 ↗

For a graph $G$, let $\text{cg}(G)$ be the maximum $k\in \mathbb N$ for which $G$ contains a $k$-vertex cograph as an induced subgraph. The Erdős-Hajnal conjecture asserts that for every proper hereditary graph class $\mathcal{G}$, there exists $γ\in(0,1]$ such that every $n$-vertex graph $G\in\mathcal{G}$ satisfies $\text{cg}(G)\geq n^γ$. This is still open; however, for some hereditary classes, one may guarantee much stronger bounds. For instance, every chordal graph $G$ on $n\geq 2$ vertices satisfies $\text{cg}(G)\geq n/(2\log n)$. Paul Seymour asked whether this bound is optimal up to a constant factor. We answer this affirmatively, even for interval graphs: For every integer $n\geq 2$, we construct an $n$-vertex interval graph $G$ with $\text{cg}(G)<64n/\log n$.

fields
Combinatorics
pdf ↗ page arXiv:2610.30299 ↗

By the Marcus-Tardos Theorem (formerly the Stanley-Wilf Conjecture), every permutation class other than the class of all permutations has a finite upper growth rate, meaning that the $n$th root of the number of permutations of length $n$ in the class has a finite limit superior. It has long been conjectured that this limit superior is in fact always a proper limit. We disprove this by constructing a permutation class whose upper and lower growth rates differ. The construction uses grid classes with cubic row-column graphs of increasing girth, obtained from Haar graphs of finite 2-groups. The corresponding hereditary property of ordered graphs also disproves an analogous 2006 conjecture of Balogh, Bollobás, and Morris. Along the way, we show that every proper permutation class with a D-finite generating function has a proper growth rate. We also establish refined enumerative bounds for grid classes, which lead to a short proof of Albert and Vatter's generalization of Bevan's Theorem on the growth rates of grid classes.

fields
Combinatorics
pdf ↗ page arXiv:2610.30369 ↗

The canonical double cover $BX$ of a graph $X$ is the direct product $X\times K_2$. A graph $X$ is stable if every automorphism of $BX$ is induced by automorphisms of $X$ and $K_2$, and unstable otherwise. We prove several asymptotic results on stable and unstable graphs. In particular, we show that the automorphism group of the canonical double cover of almost every graph has order $2$, and consequently that almost all graphs are stable. We also prove that the dominant sources of instability are having twins and being disconnected, in that order, and that graphs arising from a known construction are the next step in this hierarchy.

comments
18 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.30373 ↗

Smith's remoteness function records how long an impartial game lasts when the winner wins as quickly as possible and the loser delays defeat. For the generalized Wythoff game $\mathrm{WYT}(a,b)$, in which two positive integer parameters $a$ and $b$ determine which simultaneous removals from the two piles are allowed, we give a formula for the remoteness of every position, building on the known values at losing positions. The formula depends on two indices: a local index determined by the coordinates of the losing positions in a window of length $b$ ending at the smaller pile, and the integer part of the pile difference divided by $a$. When $b=1$, complementary Beatty sequences make the local index explicit, which gives an explicit formula for $\mathrm{WYT}(a,1)$, including classical Wythoff's game. We also show that if each attempted move in a finite impartial game independently fails with a fixed probability and passes the turn, the probability that the player to move wins under optimal play is an explicit exponential function of remoteness. For every success probability strictly between $0$ and $1$, the optimal attempts are exactly the moves that reduce remoteness by one.

comments
12 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.30427 ↗

We study how covering a graph by a small number of shortest or approximately shortest paths/walks constrains its treewidth and pathwidth. A path or walk is $(α,β)$-quasi-shortest for $α\geq1$ and $β\geq 0$ if each contiguous segment has length at most $α$ times the distance between its endpoints plus $β$. For graphs vertex-covered by $k$ shortest paths, we establish the first known polynomial pathwidth bound of $O(k^3)$. For edge-coverage, we improve the previously known $O(k^4)$ upper bound to $O(k^2\log k)$. As a main ingredient of the proofs, we first show that if the vertices of a graph can be covered by $k$ $(α,β)$-quasi-shortest paths or walks, then its treewidth is $O_{α,β}(k^2)$; this is a consequence of the fact that such graphs have linear metric growth and the technique developed in [Campbell et al., E-JC 2023]. To obtain the above pathwidth upper bounds, we combine this result with techniques from the literature in a nontrivial way. On the other hand, we show that there exist connected bipartite cubic graph whose edges can be covered by $k$ shortest paths and whose pathwidth is $Ω(k\log k)$, providing the first superlinear lower bound. For graphs covered by $k=2$ $(α,0)$-quasi-shortest paths with $α>1$, we show that, unlike treewidth and unlike the case $α=1$ and $β=0$ of exact shortest paths, the pathwidth may be unbounded. Finally, for every fixed rationals $α\geq1$ and $β\geq 0$, we give XP algorithms with a running time of $n^{f(k,α,β)}$ for some function~$f$ that decide whether the vertices of a graph can be covered by at most $k$ $(α,β)$-quasi-shortest paths or walks. The algorithms combine our treewidth upper bounds with an algorithmic meta-theorem from [Dreier et al., LICS 2025]. [abstract shortened to meet the arXiv requirements]

comments
21 pages, 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2610.30458 ↗

We prove that every hereditary Cayley permutation class with finitely many simple members has a finite basis and an algebraic generating function. We first show that every simple Cayley permutation of length at least two contains a simple pattern obtained by deleting one or two letters, and that the only exceptional Cayley permutations are the simple parallel alternations and their symmetries. We then characterize substitution-closed classes by the simplicity of their basis elements and show that classes with finitely many simple members are partially well ordered. Given the simple members and the basis of such a class, we construct a finite system of functional equations and compute an annihilating polynomial.

fields
Combinatorics
pdf ↗ page arXiv:2610.30484 ↗

Barnette's conjecture states that every cubic 3-connected bipartite planar graph has a Hamiltonian cycle. We present a digested exposition of OpenAI's generated proof of Barnette's conjecture \cite{openai-barnette}.

comments
14 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.30490 ↗

The Linearity Conjecture states that in the projective plane PG(2,$q$), $q=p^h$, every minimal blocking set (w.r.t. lines) is a linear point set over some subfield of ${\mathbb F}_q$. This paper contains the proof of the Linearity Conjecture for $p^e\ne 3,4$, where $e$ is the exponent of the blocking set. The text contains 3 concatenated parts. In Part 0, we give a guide for reading Parts 1 and 2. Part 1 develops a great part of the method, and the case $p^e=2$ is solved. In Part 2 we prove the Linearity Conjecture for $p^e\geq 5$.

fields
Combinatorics
pdf ↗ page arXiv:2610.30503 ↗

For an integer $q\ge5$, let $A_q(n,\{2,4\})$ be the largest cardinality of a subset of a $q$-ary Hamming space of length $n$ in which every two distinct words have distance $2$ or $4$. Set \[ N(q)=\left\lceil\max\left\{2q+1, \frac{17+\sqrt{8q^2+96q-95}}2\right\}\right\rceil. \] We prove that $A_q(n,\{2,4\})=1+\binom n2$ for every $n\ge N(q)$. In particular, $N(q)=2q+1$ for $q\ge26$. An explicit code of size $q(n-2)$ shows that the least eventual threshold $N_*(q)$ satisfies $N_*(q)\ge2q-1$; consequently $2q-1\le N_*(q)\le2q+1$ for every $q\ge26$. The argument applies to arbitrary integer alphabet sizes, without a linearity assumption. Its main ingredients are synchronization of symbols on intersecting supports, weighted bounds for $2$-intersecting families of four-sets, and a joint estimate for the weight-two and weight-four layers in a common-three-core configuration. No computational verification is required.

fields
Combinatorics
pdf ↗ page arXiv:2610.30613 ↗

For an integer $q\ge2$, let $A_q(n,\{2,4\})$ be the largest cardinality of an unrestricted $q$-ary code of length $n$ in which any two distinct words have Hamming distance $2$ or $4$. We prove that \[ A_q(n,\{2,4\})=1+\binom n2 \qquad(q\in\{3,4\},\ n\ge6), \] thereby settling the two remaining alphabet sizes in the conjecture of Boyvalenkov, Delchev, Zinoviev, and Zinoviev; the binary case was settled previously. The quaternary result implies the ternary result by alphabet inclusion. For $n\ge16$, the quaternary upper bound is proved combinatorially. After normalizing one word to zero, the weight-four supports form a $2$-intersecting family; exact support intersections force symbol synchronization and restrict support multiplicities. We combine the nontrivial intersection theorem with matching arguments and a three-coordinate projection lemma. The finite lengths $6\le n\le13$ are handled by a complete Hamming-isometry reduction to exact clique decisions, and $n=14,15$ by a smaller exact weighted-clique relaxation. All finite decisions are reproduced by two standalone integer-only C++17 verifiers provided as supplementary source files.

fields
Combinatorics, Information Theory
pdf ↗ page arXiv:2610.30615 ↗

For graphs $G, T$ and a graph-family $\mathcal{H}$, let $ex(G,T,\mathcal{H})$ denote the maximum possible number of copies of $T$ in an $\mathcal{H}$-free subgraph of $G$. Alon and Shikhelman conjectured that for every family of graphs $\mathcal{H}$ with $χ(H) > s$ for every $H \in \mathcal{H}$, it is NP-hard to compute $ex(G,K_s,\mathcal{H})$, and even to approximate it up to additive error $n^{s-δ}$ on $n$-vertex graphs, for any fixed $δ> 0$. The case $s=2$ was established in a breakthrough result of Alon, Shapira and Sudakov. We prove the Alon-Shikhelman conjecture for finite families $\mathcal{H}$. In particular, we obtain an elementary proof of the Alon-Shapira-Sudakov result when $\mathcal{H}$ is finite.

fields
Combinatorics
pdf ↗ page arXiv:2610.30654 ↗

We prove that the Aleshin level graphs are two-sided expanders. We establish linear diameter bounds for Belaterra and Aleshin graph families. At level $n$, the diameters of the Bellaterra and undirected Aleshin graphs are a $|V_n|=2^n$. This improves the quadratic diameter bounds of Malyshev and Pak to the correct order of growth. For the Aleshin graphs we obtain a normalized spectral gap of at least $1-2\sqrt2/3$ and an edge-expansion constant of at least $3-2\sqrt2$, thereby establishing a Malyshev–Pak's Conjecture with explicit constants. An exact calculation at level ten also proves that the undirected Aleshin graphs are not Ramanujan for any $n\geq10$.

fields
Combinatorics
pdf ↗ page arXiv:2610.30662 ↗

Let $\cR=\{r+jm:j\geq0\}$ and $\cS=\{s+jm:j\geq0\}$ be disjoint arithmetic progressions of positive integers, and choose a partition of $n$ uniformly at random. We determine the limiting probability that the number of parts in $\cR$ is larger than the number of parts in $\cS$. More precisely, if $a=r/m$ and $b=s/m$, then this probability converges to $I_{1/2}(a,b)$, the regularized incomplete beta function. We prove the stronger distributional statement that, after multiplication by the partition saddle-point parameter, the difference of the two numbers of parts converges to $m^{-1}(\log G_b-\log G_a)$, where $G_a$ and $G_b$ are independent gamma variables. The proof uses the Boltzmann conditioning device for random partitions, a $q$-gamma evaluation of the unconditioned characteristic function, and a uniform Fourier estimate showing that conditioning on the total size does not change the limit. We also evaluate the finite-truncation limit studied by Li and Zhao. The two evaluations coincide, proving their conjecture on the commutation of the truncation and large-size limits.

comments
27 pages
fields
Combinatorics, Probability
pdf ↗ page arXiv:2610.30700 ↗

Fuglede's conjecture in $\mathbb{F}_p^d$ says that a nonempty set tiles by translation if and only if it is spectral. We prove the conjecture in $\mathbb{F}_2^8$ and $\mathbb{F}_{11}^3$. Over $\mathbb{F}_2$ we show more generally that the Fourier support of a nonconstant indicator of density different from one half contains a plane. Consequently every spectral set of density one quarter has a subspace tiling complement. This supplies one of the dimension-eight reductions left by Kadowaki; the others are completed using classified Hadamard matrices and perfect binary codes. In $\mathbb{F}_2^9$ we prove that every tile is spectral and that every spectral set has power-of-two cardinality. All spectral cardinalities except $64$ are shown to tile, and we give further reductions of the remaining case. We also construct a spectral set of density one eighth whose Fourier support contains no three-dimensional subspace. For $\mathbb{F}_{11}^3$ we extend the geometric method of Fallon, Mayeli, and Villano by using moment identities, polynomial plane profiles, weighted incidence counts, and exact finite computations. The computations and their verification programs are described in the appendices.

comments
81 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.30712 ↗

We bound fractional chromatic numbers by establishing a connection with low-weight odd-cycle transversals. Let $\ell\geq 3$ be an integer and let $G$ be a graph of odd girth at least $\ell$ whose odd-cycle covering polyhedron is integral. For every nonnegative weight vector $w=(w_v)_{v\in V(G)}\in \mathbb{R}_{\geq 0}^{V(G)}$, we obtain a set $Z\subseteq V(G)$ such that $G-Z$ is bipartite and $w(Z)\leq\frac{mad(G)}{2\ell}w(V(G))$. Here, $w(S)=\sum_{v\in S}w_v$ for any $S\subseteq V(G)$, and $mad(G)$ denotes the maximum average degree of $G$. Consequently, if $mad(G)<2\ell$, then $G$ has fractional chromatic number at most $\frac{4\ell}{2\ell-mad(G)}$. As applications, we prove that, for every positive integer $k$, every $n$-vertex planar graph of girth at least $2k+3$ has fractional chromatic number at most $\frac{2k+1}{k}(1-\frac{1}{kn+1})$, establishing the girth version of Naserasr's fractional coloring conjecture with a strict inequality. For $k=1$, we furthermore prove that the upper bound $\frac{3n}{n+1}$ holds for every $n$-vertex triangle-free planar graph and this is attained for infinitely many values of $n$.

fields
Combinatorics
pdf ↗ page arXiv:2610.30719 ↗

Let $X$ be a finite set and $\mathcal{F} \subseteq 2^X$ a non-trivial increasing property. We show that the bias-threshold $b(\mathcal{F})$ for the Picker-Chooser $\mathcal{F}$-game satisfies $b(\mathcal{F}) \ge α/ p_c(\mathcal{F})$, where $p_c(\mathcal{F})$ is the threshold for the property $\mathcal{F}$ and $α> 0$ is an absolute constant. This proves that Picker-Chooser games satisfy one-sided ``probabilistic intuition''. The proof is based on the notion of influence from the theory of boolean functions.

comments
12 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.30730 ↗

This paper investigates arithmetic conditions, over finite fields, for the invertibility of circulant matrices whose first row is $(a_0,\ldots,a_{n-1})$, in terms of linear constraints on the entries $a_0,\ldots,a_{n-1}$. The coefficients of such linear constraints are determined by field traces arising from Frobenius orbits of roots of unity, and under additional assumptions they are given by Ramanujan sums reduced modulo the characteristic of the given field. These results provide finite-field analogues of the corresponding criteria over $\mathbb{Q}$, where the relevant Ramanujan-sum linear constraints can be formulated without such additional assumptions, while also showing some differences caused by reduction modulo the characteristic. The constraints can often determine invertibility using aggregate information about the entries of a row, rather than the particular pattern of the entries. We also discuss the polynomial gcd criterion, which gives necessary and sufficient conditions for invertibility and yields further consequences for special families of circulant matrices.

comments
14 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.30830 ↗

The classical Turán-type problem for graphs forbidding $k$ disjoint triangles has been resolved firstly by Erdős [Arch. Math. 13 (1962) 222-227] for graphs of sufficiently large order and improved by Moon [Canad. J. Math. 20 (1968) 95-102], who established that the unique edge extremal graph is $K_{k-1}\vee T_2(n-k+1)$ for $n> \frac{19k-11}{2}$. In this paper, we determine the maximum signless Laplacian spectral radius among all $kK_3$-free graphs of order $n$ and characterize the unique signless Laplacian spectral extremal graph $K_{k-1}\vee T_{2}(n-k+1)$ for all $k\ge 2$ and sufficiently large $n$.

fields
Combinatorics
pdf ↗ page arXiv:2610.30859 ↗

The extremal problem of determining the graphs with maximum spectral radius among all graphs with a prescribed number of edges was resolved by Rowlinson [Linear Algebra Appl. 110 (1988) 43–53]. A signed graph $Γ=(G,σ)$ is called $C_k^-$-free if it contains no negative $k$-cycle as a signed subgraph. The index of a signed graph is defined as the largest eigenvalue of its adjacency matrix. This paper addresses the maximization of the index of unbalanced signed graphs. For signed graphs of a prescribed order, Wang and Lin [Discrete Appl. Math. 372 (2025) 164–172] determined the maximum index of $C_4^{-}$-free unbalanced signed graphs. Subsequently, Wang, Peng and Hou [Discrete Math. 349 (2026) 114871] characterized the unbalanced signed graphs of prescribed size with maximum index. This paper treats the edge spectral Turán-type problem for $C_4^-$-free unbalanced signed graphs. The all-positive signed graph with underlying graph $G$ is denoted by $(G,+)$. Evidently, $A((G,+))=A(G)$. In particular, $(H_{d,t},+)$ is the all-positive signed graph whose underlying graph is $H_{d,t}$, where $H_{d,0}=K_d$ and for $t>0$, $H_{d,t}$ is obtained from $K_d$ by adding a single vertex adjacent to exactly $t$ vertices of $K_d$. Let $m-3=\binom{d}{2}+t$ with $0\le t\le d-1$. Up to switching isomorphism and the addition of isolated vertices, the unique extremal unbalanced signed graph is obtained by attaching a negative triangle to a specified vertex of the all-positive signed graph $(H_{d,t},+)$.

comments
25 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.30881 ↗

Spectral conditions for Hamiltonian cycles are a fundamental subject in extremal spectral graph theory. For simple unsigned graphs, Fiedler and Nikiforov [Linear Algebra Appl., 432 (2010), 2170-2173] pioneered this direction, and Li and Ning [Linear Multilinear Algebra, 64 (2016), 2252-2269] later extended these results by introducing minimum degree parameters. In this paper, we study the spectral conditions for the existence of a negative Hamiltonian cycle in unbalanced signed graphs of order n > 8. We first determine the maximum index among all n-vertex unbalanced signed graphs containing no negative Hamiltonian cycle, and characterize the corresponding extremal graphs up to switching isomorphism. Furthermore, we establish an upper bound on the number of edges in unbalanced signed graphs of order n >= 7 with frustration index one, and classify all extremal graphs achieving this bound.

comments
22 pages, 4 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.30883 ↗

We construct a bijection between $2143$-avoiding and $3421$-avoiding permutations that preserves the descent top set and the ascent top set and reverses the left-to-right order of the peaks. This bijection allows us to establish a bijection between $1243$-avoiding and $3412$-avoiding permutations with the same properties. These results refine two cases of a conjecture posed by Burstein and prove a conjecture posed by Burstein and Jones.

comments
9 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.30975 ↗

Let $p(n)$ be the ordinary partition function and let $c(n)=\sum_{k=0}^{n-1}p(k)$, with $c(0)=0$. We prove that, for every $a\geq1$, $b\geq0$, and $m\geq2$, the sequence $c(an+b)$ is not eventually constant modulo $m$, thereby answering a question posed by Chen. The proof combines the algebraicity over $\mathbb C(j)$ of modular functions for finite-index subgroups of $\mathrm{SL}_2(\mathbb Z)$ with Voloch's theorem on the transcendence of elliptic modular functions in positive characteristic.

comments
16 pages
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2610.31102 ↗

Let a finite simple graph be given. We study symmetric matrices with this graph pattern that admit a null vector with prescribed exact support. Such a vector exists precisely when its support is a fort, meaning that no vertex outside the support has exactly one neighbor inside it. Over the complex numbers, we prove that the Zariski closure of each exact-support coefficient locus is irreducible and compute its codimension in terms of boundary vertices and a labeled forest on the connected components of the support. The corresponding forest deficiency also determines the generic restricted nullity. An incidence parametrization yields a prime decomposition of the reduced zero-forcing failure locus. For a prescribed common kernel, we describe the coefficient space through equilibrium stresses, exterior affine dependencies, and free coefficients. We then construct boundary complexes recording local solution values and equation residuals. Their gluing maps are defined over the universal coefficient ring and commute with arbitrary base change. By retaining the complete collection of support signatures associated with each seed set, we obtain a composition formula for the minimum zero-forcing number and an algorithm for its computation.

fields
Combinatorics
pdf ↗ page arXiv:2610.31109 ↗

We determine the zero-forcing number of maximal biconnected outerplanar graphs. When the weak dual is a path, the zero-forcing number and the induced path-covering number are both two. Otherwise, the branching faces determine a canonical core and a family of terminal strips. We prove that an optimal forcing process can be chosen in a normal form governed by explicit vertex and face capacities on the core. After fixing forests on the terminal strips, the zero-forcing number is expressed through an optimization over core-edge selections and the minimum number of root connections that must be removed to obtain an executable orientation. The path-covering number is obtained from the same capacity optimization without the repair cost. We characterize executable orientations by blocking-circuit equations and identify the two-path obstruction with a first cohomology class of a signed contact multigraph. Local replacements and a finite comparison of boundary recurrences establish the normal form for graphs of arbitrary size. A fifty-six-state recurrence constructs a minimum zero-forcing set and a complete forcing chronology in linear time from indexed triangle adjacency. We also obtain exact replacement results for rooted blocks and construct infinite families in which the zero-forcing number exceeds the path-covering number.

fields
Combinatorics
pdf ↗ page arXiv:2610.31138 ↗

We give a new proof that 1-extension preserves generic local rigidity of bar-joint frameworks in all dimensions. The proof does not use a special position argument, which makes the approach potentially useful for X-replacement in 3-space. Instead, the balancing conditions recently introduced by the first author use directed paths in the line graph, and by modifying the end of these paths, we transfer a self-stress on the 1-extended graph back to the original. Treating the new vertex as variable allows us to extract the balancing condition of the smaller graph as one coefficient of a homogeneous quadratic. A Lean 4 formalization of the main results accompanies the paper.

comments
7 pages
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2610.31212 ↗

We give an explicit partition of $\{1,\ldots,537\}$ into six sum-free sets, establishing $S(6)\ge 537$. This improves the lower bound 536 of Fredricksen and Sweet (2000). Known recursive constructions then give the improved lower bounds $S(8)\ge 5\,372$, $S(11)\ge 204\,208$, $S(13)\ge 2\,042\,082$, and $R_6(3)\ge 539$. We also report 131 pairwise inequivalent partitions found by the search. We describe their structure and provide the complete partitions in the supplementary material. These partitions provide starting points for future searches and structural studies of Schur partitions.

fields
Combinatorics
pdf ↗ page arXiv:2610.31362 ↗

A non-zero $m \times n$ (0, 1)-matrix $A$ is called a {\em nullspace matrix} if each entry $(i, j)$ of $A$ has an even number of $1's$ in the set of entries consisting of $(i, j)$ and its rectilinear neighbors. These matrices correspond to even dominating sets of $m \times n$ grid graphs. We study these matrices and consider those that cannot be constructed from smaller nullspace matrices.

fields
Combinatorics
pdf ↗ page arXiv:2610.31475 ↗

Let $G$ be a finite simple graph. An averaging operation selects a nonempty connected vertex set and replaces the weights of its vertices by their arithmetic mean. For a nonnegative initial weight function $ω:V(G)\to\mathbb R_{\ge0}$ and a target vertex $x$, let $t(G,x,ω)$ denote the minimum number of averaging operations needed to attain the maximum reachable weight at $x$. Gollin et al.[1] proved, using the Axiom of Choice, that a finite optimal strategy exists for every finite graph, every nonnegative initial weight function and every target vertex; see Tao [2] for a simplified proof. We prove that the lengths of shortest optimal strategies on $3$-spiders have no uniform finite bound. In particular, these lengths cannot be bounded in terms of the maximum degree of the graph.

fields
Combinatorics
pdf ↗ page arXiv:2610.31499 ↗

We prove the all-exp property for the Traveling Salesman Problem with the $2$-opt neighborhood, and for $(3,2,2)$- and $(2,3,2)$-Maximum Constraint Assignment with the flip neighborhood. The all-exp property states that infinitely many instances have an initial solution from which every sequence of improving moves to a local optimum, and hence every run of local search, has exponential length. For the Traveling Salesman Problem, the all-exp property was previously known for every $k$-opt neighborhood with $k \ge 3$, so our result for $2$-opt completes the picture for all $k$-kopt neighborhoods. In $(p,q,r)$-Maximum Constraint Assignment, each constraint involves at most $p$ variables, each variable occurs in at most $q$ constraints, and each domain has size $r$. Decreasing any of the parameters of $(3,2,2)$ or $(2,3,2)$ yields a problem in which every sequence of improving flips has polynomial length, so both Maximum Constraint Assignment results are tight. All three results settle long-standing open problems. Our proofs build on a common construction idea, which reveals a close connection between the local-search dynamics of the three problems.

comments
36 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.31513 ↗

Let $q=p^n$, where $p>2$ is prime. We prove that every $q$-set $U\subseteq\mathrm{AG}(2,q)$ determining exactly $(q+3)/2$ directions is affinely equivalent to the graph of $x^{(q+1)/2}$. For $n\ge2$, we also prove that a $q$-set determining at most $(q+p)/2$ directions is either an affine $\mathbb{F}_p$-linear set or affinely equivalent to this graph. The classification for $n=1$ is due to Lovász and Schrijver. For $n=2$, the classification and the stated stability result follow from results of Gács, Lovász, and Sz\H onyi and the direction theorems of Blokhuis, Ball, Brouwer, Storme, and Sz\H onyi, completed by Ball. These direction theorems establish affine $\mathbb{F}_p$-linearity for functions with fewer than $(q+3)/2$ determined directions. Our proof uses Rédei polynomials, results of Gács, Lovász, and Sz\H onyi on their coefficients, and an earlier polynomial comparison lemma of the author.

fields
Combinatorics
pdf ↗ page arXiv:2610.31516 ↗

We prove a triple quantum Pieri formula: the product of a quantum double Schubert polynomial $\widetilde{\mathfrak{S}}_u(x;y)$ by a quantum factorial elementary polynomial $\widetilde{E}_{p,k}(x;z)$ in a second set of variables $z$ is a sum over chains in the quantum Bruhat graph, indexed by a quantum analogue of Sottile's relation, whose coefficients are monomials in the quantum parameters times polynomials in the differences $y_i-z_j$ with nonnegative integer coefficients, and which is Graham-positive at $z=y$. At $y=z=0$ it is the quantum Pieri rule of Ciocan-Fontanine and Postnikov; at $z=y$ it is an equivariant quantum Pieri rule for the complete flag variety, indexed by chains in the quantum Bruhat graph rather than, as in the rule of Huang and Li, by the data of a reduction to classical cohomology, and proved directly. A doubled Pieri formula, positive in the same senses, treats multiplication by the quantization of a product of two elementary polynomials in the same variables, which is not the product of the quantizations: it is two iterated Pieri steps with the incompatible pairs of chains omitted. More generally, the triple quantum Schubert structure constants $c_{u,v}^{w,d}(y;z)$, the coefficients of $\widetilde{\mathfrak{S}}_u(x;y)\widetilde{\mathfrak{S}}_v(x;z)$ in the basis $\{\widetilde{\mathfrak{S}}_w(x;y)\}$, are polynomials in the $y_i-z_j$ with nonnegative integer coefficients; the proof of this appears as an appendix. We extend the Peterson-Woodward comparison formula and the quantum-to-classical reduction of Leung-Li and Huang-Li to the triple constants, and we describe and prove correct the algorithms of schubmult, which compute products of arbitrary quantum double Schubert polynomials well beyond the reach of previous methods.

comments
57 pages. Includes an appendix by Tongren Xiao and Yihua Yue proving triple quantum Schubert positivity. Algorithms implemented in the Python package schubmult
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2610.31533 ↗

For a graph $G$, the $2$-token graph $F_2(G)$ has as vertices all $2$-subsets of $V(G)$, with two such subsets adjacent whenever their symmetric difference is an edge of $G$. In this paper, we determine the domination number of the $2$-token graph of the complete bipartite graph $K_{m,n}$, for all integers $2\le m\le n$. We show that it equals $\lceil m/2\rceil+n-1$, except when $m=3$, or when $m\ge5$ is odd and $n=m+1$; in these two exceptional situations it is one less. Our arguments rely on an explicit characterization of the dominating sets of the $2$-token graph of $K_{m,n}$.

comments
14 pages, 3 Figures, 1 Table. Submitted for publication before the appearance of arXiv:2610.28936, whose results on F_2(K_{m,n}) were obtained independently. This version differs from the submitted one only by a footnote on arXiv:2610.28936 and three added references in the conclusions section
fields
Combinatorics
pdf ↗ page arXiv:2610.31557 ↗

A thrackle is a drawing of a graph in the plane in which every pair of edges meets exactly once, either at a common endpoint or at a proper crossing. Conway conjectured that every thrackle has at most as many edges as vertices. We prove that every thrackle on $n\ge4$ vertices has at most $\left\lfloor4(n-1)/3\right\rfloor$ edges. The proof combines Pammer's computer-assisted verification of the conjecture for graphs on at most twelve vertices with a discharging argument in suitable plane and projective-plane embeddings.

comments
7 pages, 2 figures
fields
Combinatorics, General Topology, Geometric Topology
pdf ↗ page arXiv:2610.31589 ↗

A folklore result says that any parabolic double coset $W_{I} w W_{J}$ in a Coxeter group $W$ is an interval of the Bruhat order, provided that $W_{I}$ and $W_{J}$ are finite. We include a self-contained proof, without assuming that $W$ is finite. Furthermore, we prove that each "triple coset" $W_{I} u W_{J} v W_{K}$ has a Bruhat minimum and -- if $W_{I}, W_{J}, W_{K}$ are finite -- a Bruhat maximum, but (in general) is not a Bruhat interval. This proves and extends a conjecture on MathOverflow #472072.

comments
20 pages, includes expository material, comments are welcome
fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2610.31602 ↗

We use the partition functions of a five-vertex exactly solvable lattice model from statistical mechanics to give new combinatorial formulae for the Schubert structure constants of torus-equivariant quantum K-theory rings of Grassmannians. The proofs build on our earlier results where we identified the transfer matrices of these lattice models geometrically as multiplications by the Hirzebruch $λ_y$ classes of the tautological subbundle and the (dual) quotient bundle. The structure constants are solutions of a system of linear equations with coefficients given by the partition function. This system may be solved explicitly by specializing the Hirzebruch parameter $y$ to an equivariant parameter, leading to explicit formulae using Cramer's rule. Furthermore, we give an alternative combinatorial construction of the partition functions in terms of sums over cylindric set-valued tableaux, which we call cylindric Grothendieck polynomials. The latter generalise McNamara's factorial skew Grothendieck and Yeliussizov's modified Grothendieck polynomials and can be thought of as an equivariant K-theoretic version of Postnikov's toric Schur function. We also provide new polynomial representatives for equivariant K-theory classes of Richardson varieties and their variants.

comments
45 pages, 5 figures
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2610.31607 ↗

In the Hamming space $\mathbb{F}_q^n$, a $d$-anticode is a subset in which every pair of points has Hamming distance at most $d$, or equivalently, a set of diameter at most $d$. Let $m_q(n,d)$ denote the maximum size of a $d$-anticode and let $\mathcal{A}_q(n,d)$ be the family of all $d$-anticodes. We show that for fixed $q$, as $n\to\infty$, the total number of $d$-anticodes satisfies \[ |\mathcal{A}_q(n,d)|=2^{(1+o(1))m_q(n,d)} \] for $4\le d\le n-1$, except when $q=2$ and $d=n-1$. We also count linear $d$-anticodes, that is, subspaces of $\mathbb F_q^n$ with diameter at most $d$. For fixed $q$ and $d$, their number is polynomial in $n$. For growing $d$, we determine the exponential order as $q^{Θ_q(d^2+d\log_q(n/d))}$ in the sublinear regime and $q^{Θ(n^2)}$ when $d/n\toα\in(0,1)$. In the near-full regime $n-d=o(n)$, we obtain the sharper count $q^{(1/4+o(1))n^2}$. A random-generator construction further improves the binary lower bound for every fixed linear diameter.

comments
Two figures. Comments are welcome
fields
Combinatorics
pdf ↗ page arXiv:2610.31618 ↗

Does computing a composition of total Boolean functions require the product of the randomized query complexities of its factors? We give a negative answer. There are families of total functions $f,g$ such that $R(f\circ g) =Θ\!\left(\frac1{\log R(g)}\right)R(f)R(g)$ This result requires first separating linearized query complexity $\LR$, as well as noisy randomized query complexity $noisyR$, from standard randomized query complexity $R$. Both constructions essentially come from totalizing existing partial function separations, albeit via different techniques. By adapting these techniques, we also construct total functions separating every adjacent pair in the chain from sabotage $RS$, max-conflict $\barχ$, and linearised query complexity $LR$. We show that AND-of-ORs separates conflict $χ$ from max-conflict $\barχ$ complexity and makes conflict and sabotage incomparable. Finally, randomized complexity can be smaller than its composition limit $R^*$ by the maximal factor $Θ(\log R)$. The total–total composition separation is also formalized in Lean.

comments
56 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.31638 ↗

Numerical Analysis30

Summation-by-parts (SBP) operators are a cornerstone of provably stable high-order methods for hyperbolic conservation laws. For nonlinear problems, the flux-differencing framework of Fisher and Carpenter combines such SBP operators with entropy-conservative two-point fluxes to obtain semi-discretizations that are conservative in the sense of Lax–Wendroff and discretely entropy-conservative or stable. So far, this framework has been developed exclusively for operators that are exact for polynomials. Function-space SBP (FSBP) operators lift this restriction by being exact on a general finite-dimensional function space that can be tailored to the problem at hand. In this work, we extend flux differencing to FSBP operators for general (potentially non-polynomial) function spaces. We prove that, whenever the operator has a diagonal norm and its function space contains the constants, the resulting semi-discretization is conservative in the sense of Lax–Wendroff, semi-discretely entropy-conservative within a single element, and entropy-stable across element interfaces. We also provide the first theoretical accuracy analysis of FSBP operators: We characterize their design order through an algebraic criterion on the underlying function space, prove that suitable non-polynomial spaces achieve the same design order as polynomial spaces of equal dimension, and show that the flux-differencing semi-discretization retains this order. Notably, the entropy-conservative two-point flux is reused unchanged; only the underlying function space differs from the polynomial case. Numerical experiments for the Burgers' equation and the compressible Euler equations in one and two dimensions confirm these properties.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.30272 ↗

Many Bayesian inverse problems are characterized by two parameter vectors with distinct roles. A medium property, operator coefficient, or geometry block enters the forward model nonlinearly, whereas a volumetric, initial condition, or boundary condition source enters linearly. General-purpose nonlinear surrogates must relearn this known source dependence from data and may not preserve the correct source scaling outside the training regime. We introduce a structure-preserving partially linear (SPPL) framework that constructs separate reduced spaces for outputs, (linearly appearing) sources, and (nonlinearly appearing) medium variables and represents the reduced forward map as an affine function of the retained source coordinates, with coefficients that depend on the medium variables. Here, "affine" refers to the retained, mean-centered source coordinates: the physical forward map remains linear in the source, while the affine offset is induced by the source-prior mean and vanishes when that mean is zero. The analysis first identifies the optimal blockwise ridge approximation and then derives the optimal affine-in-source approximation under independent medium and source priors. A direct decomposition of the forward error into output, source, medium, and surrogate contributions yields blockwise spectral criteria and prior-predictive expected-KL control. For a Gaussian source prior, the optimal affine-in-source approximation coincides with the optimal blockwise ridge approximation. In a coseismic numerical example, a three-model controlled ablation on common block-reduced coordinates separates the effects of coefficient-matrix supervision and structure-preserving affine-in-source parameterization. Reduced-space surrogate MCMC provides orders-of-magnitude online acceleration relative to high-fidelity posterior sampling.

comments
35 pages, 6 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.30306 ↗

I present a matrix-free local multigrid method for $C^1$ tensor-product Hermite discretizations on adaptively refined Cartesian meshes, using the clamped biharmonic problem as the model problem. Extending a cell-wise primal-dual formulation to Hermite elements, I enforce continuity through a constraint operator that is never formed. At refinement edges, geometric prolongation supplies both the trace and its normal derivative, so the local V-cycle needs no edge operator and no hanging-node machinery. For the cubic element, an even-odd decomposition based on the signed reflection symmetry of the Hermite basis, applied along two axes, splits the element matrix into four dense $16\times16$ blocks and reaches 85% of peak memory bandwidth. Chebyshev-Jacobi and vertex-patch smoothers both preserve conformity by construction. In three dimensions on one NVIDIA A100 in double precision, conjugate gradients preconditioned by the Chebyshev-Jacobi V-cycle need five or six iterations on uniform meshes and solve at up to 4.23 million cells per second. On locally refined meshes the count rises to at most sixteen, ordered by the fraction of cells on a refinement edge and nearly equal for both smoothers.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.30308 ↗

We present a general framework to derive augmented Lagrangian preconditioners for saddle point systems arising from mixed finite element discretizations. Our approach is based on augmenting the variational formulation at the continuous level prior to discretization, providing a unified strategy for designing efficient preconditioners that are robust under mesh refinement for a broad class of problems leading to symmetric saddle point systems. The robustness of the proposed preconditioners is established through a detailed spectral analysis. This framework is applied to different model problems, focusing on mixed-dimensional and fictitious domain formulations involving Lagrange multipliers, with some configurations featuring large coefficient jumps. Extensive numerical experiments on different test cases and geometries are presented, validating the effectiveness and robustness of our preconditioners when used in conjunction with flexible GMRES.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.30357 ↗

This paper presents a framework for robust topology optimization of Kirchhoff-Love (KL) multi-patch shells using isogeometric analysis and non-matching meshes and provides a CAD-compatible method. The material distribution is optimized via a NURBS-based level set method, enabling accurate boundary representation and seamless export to standard CAD/CAM workflows. The shape derivative is computed using the speed method, yielding a volume-based formulation that avoids boundary approximations and aligns with the isogeometric principle of coarse, high-order discretizations. This eliminates the need for local refinement, adaptive quadrature, or trimming as the descent direction for the compliance and volume objectives are obtained through a biharmonic equation. The framework is extended to robust optimization under uncertainty, accounting for stochastic loading and material properties via Monte Carlo sampling and Gaussian Random Fields. Numerical examples demonstrate the method's efficiency and robustness across single- and multi-patch shells, reproducing literature results with fewer elements than traditional FEM or refined IGA approaches. The developed methods and tools can be directly extended to problems involving stress-based optimization and risk-averse metrics. The numerical implementations are open-source and available on GitHub.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.30389 ↗

We develop an adaptive time-stepping strategy for scalar auxiliary variable (SAV) schemes combined with variable-step BDF2 discretization for gradient flows. The strategy selects step sizes based on the instantaneous energy dissipation rate and enforces monotonicity of a computable symmetric energy through a step rejection mechanism. We show that the step-size rules used in practice correspond to equidistributing a monitor function along the energy curve, connecting energy-adaptive time stepping to the classical theory of r-adaptive mesh methods. The monitor $g = |\dot{E}|$ is asymptotically optimal as it minimises the leading-order maximum symmetric-energy discrepancy for a given number of steps. A combined monitor that switches to $g = \sqrt{|\dot{E}|}$ near equilibrium caps step growth without degrading this error bound. The arclength parameter $β$ used in prior work is shown to be the ratio of the largest permitted step to the energy-error tolerance. The controller is paired with the SSAV–BDF2 discretization. Accepted steps satisfy monotonicity of the symmetric energy, from which we deduce a bound on the physical energy that is uniform in the number of steps, $\sup_n E(u^n) \le E(u^{0}) + τ_1 + O(Δt_{\max}^2)$, and the scheme achieves second-order global accuracy under standard step-ratio restrictions. Numerical experiments on Cahn–Hilliard, Ohta–Kawasaki, Phase–Field Crystal, and functionalized Cahn–Hilliard models confirm the theory and demonstrate the method's efficiency.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.30454 ↗

This paper presents efficient 2D and 3D finite-difference time-domain (FDTD) algorithms augmented by the comb tensor network (CTN) representation of the field and auxiliary quantities. The proposed CTN-FDTD algorithm leverages superior compressibility of CTN compared with quantized tensor train (QTT), and rank-reduction strategies including local and global smoothing techniques to achieve logarithmic memory requirement and computation (per time step) cost. Numerical examples validate these complexities and demonstrate the applicability of CTN-FDTD using a variety of source excitation, frequency and permittivity profiles in both 2D and 3D. Remarkably, CTN-FDTD can simulate 35 trillion spatial grid points in 3D with low memory and computation costs on one computation node, whereas standard FDTD would require 281 TB memory to store each of its 31 3D arrays. Moreover, CTN-FDTD was applied to realistic 2D photonic crystal structure simulation with one million grid points and 3D scattering analysis with 8.6 billion grid points.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.30486 ↗

We compute self-similar singularity profiles of partial differential equations (PDEs) using adaptive numerical discretizations based on optimizing a discrete loss (ODIL). The fields are represented in overlapping local Chebyshev patches joined with a mapped asymptotic patch. After factoring out the leading power laws of solution ansatzes, their limiting amplitudes at infinity are determined by the optimization, eliminating domain truncation and prescribed far-field conditions. Adaptive refinement is guided by Chebyshev-coefficient decay, and the nonlinear least-squares problem is solved using automatically differentiated Gauss–Newton iterations with Levenberg–Marquardt damping. The method achieves O(10^{-14})-level accuracy for Burgers profiles, residuals of O(10^{-14}) to O(10^{-10}) for the generalized De Gregorio family, and of O(10^{-8}) in a local region for the two-dimensional Boussinesq equations. These results demonstrate that ODIL can identify singularity profiles for PDEs with high accuracy using adaptive numerical methods, complementing ongoing efforts that rely on artificial intelligence.

comments
32 pages, 5 figures, 13 tables
fields
Numerical Analysis, Analysis of PDEs
pdf ↗ page arXiv:2610.30492 ↗

In this paper we introduce a compact stencil Runge-Kutta discontinuous Galerkin method for the Euler equations of compressible gas dynamics, which preserves a minimum entropy principle similar to that introduced by Tadmor for entropy solution of the Euler equations [4]. Compact stencil RKDG, introduced by Chen et al. in [15], is a variant of standard RKDG method which is known for its smaller stencil size and parallel efficiency. The main challenge is that the cRKDG method has to be expressed in Butcher form and not every Runge-Kutta method of this form is a convex combination of forward-Euler steps. Therefore, in order to establish this property we leverage the bound preserving framework of the cRKDG schemes [8], an entropy bounded limiter [6] and the classical positivity preserving limiter. In the last section numerical experiments are provided to demonstrate the robustness of the method.

comments
Two dimensional results will be reported in revised version of the article
fields
Numerical Analysis, Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2610.30496 ↗

We consider a bounded operator on a separable complex Hilbert space, reached only through its action on vectors and that of its adjoint, and split it along a subspace of finite dimension into a compression, a far block acting on the complement, and the two couplings between them. Given upper bounds on the norms of the couplings and of the far block, we show that outside a disc a pseudospectrum of the operator lies in a pseudospectrum of the compression, with an explicit loss in the level; this reverses the classical inclusion of the Ritz values in a pseudospectrum of the operator. The same bounds, with the smallest singular value of the shifted compression, bound the resolvent of the operator, count its eigenvalues with algebraic multiplicity inside every contour outside the disc on which a computed inequality holds, and enclose its spectral projector; no normality, self-adjointness or positivity is used.

comments
34 pages, 4 figures. Data: doi:10.7910/DVN/HOZFS8. Code: https://github.com/JuliaBallArithmetic/RigorousPseudospectra.jl (tags reverse-ritz-arxiv-v1, reverse-ritz-arxiv-v2) and https://github.com/JuliaBallArithmetic/BallArithmetic.jl (tag reverse-ritz-arxiv-v1)
fields
Numerical Analysis
pdf ↗ page arXiv:2610.30530 ↗

We develop a unified framework for high-order, fully discrete entropy-stable discontinuous Galerkin (DG) methods with compact explicit single-step time discretizations. At the end of each time step, the preliminary DG polynomial is scaled toward its cell average to enforce a strong cell entropy inequality while preserving conservation. This correction is feasible if and only if the updated cell average satisfies a weak cell entropy inequality, which standard third-order strong-stability-preserving Runge–Kutta DG updates can violate at arbitrarily small positive CFL numbers. For compact single-step schemes, including compact Runge–Kutta, Lax–Wendroff, and ADER-DG methods, we derive an explicit interval of feasible numerical entropy fluxes at each interface and prove that it is nonempty under a CFL condition. Projecting a compatible high-order target flux onto this interval guarantees the weak cell entropy inequality and preserves single-step high-order accuracy on smooth solutions, including near nondegenerate extrema. The limiter also enforces multiple entropy inequalities simultaneously. We also establish a Lax–Wendroff-type theorem. Numerical experiments for scalar conservation laws and the compressible Euler equations demonstrate high-order accuracy, multi-entropy control, and robustness for strong shocks.

comments
25 pages, 7 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.30535 ↗

Learned multigrid components are often evaluated at a fixed iteration budget, but such comparisons do not distinguish local approximation gains from practical solver efficiency. We study this distinction for high-contrast elliptic problems on unstructured finite element meshes. A learned V-cycle uses operator-dependent transfers, Galerkin coarse operators, near-kernel deflation and an energy-norm safeguard; only its smoothers are trained. The architecture represents a specified class of fixed polynomial smoothers and is positively homogeneous in the load. On fresh conductive-channel problems, one learned pass reduces the energy error by factors of 5.7-6.1 relative to the same cycle with four-step Jacobi-preconditioned conjugate-gradient smoothing; the corresponding factors are 1.38-1.45 for insulating barriers. In a separate fixed-input test on channel problems, the fine-level learned smoother attains a smaller energy-norm error than the exact minimum over a five-dimensional Krylov space of its own input on 97-100 of 100 fresh inputs for each position and training initialization; this does not establish superiority over all polynomial-smoothed cycles. When the classical smoothing budget is increased, the paired geometric-mean accuracy crosses that of the learned cycle between 8 and 14 steps per smoothing call on channels and between 5 and 8 on barriers. The measured CPU implementation offers no computational advantage over the tested classical solvers, and load changes and floating islands further restrict its accuracy.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.30692 ↗

This work extends least-squares support vector regression (LS-SVR) based on the generalized moving least squares (GMLS) approximation to the numerical solution of partial differential equations on spheres. We show that the proposed approach constructs a kernel-based approximant in its dual form and establishes its connection with the associated reproducing kernel Hilbert space (RKHS). Furthermore, solving the PDE through the proposed LS-SVR framework is shown to be equivalent to solving a smoothing problem or a kernel ridge regression problem in the corresponding RKHS. As applications, the method is employed to solve the Allen-Cahn equation and its conservative counterpart on spheres. An implicit first-order operator-splitting scheme is used to separate each model into linear and nonlinear subproblems. The linear subproblem is discretized by the backward differentiation formula and approximated at each time step using LS-SVR derived from a GMLS-based collocation formulation, while the nonlinear part is treated analytically. The resulting scheme is shown to admit a unique numerical solution at every time step. For the conservative Allen-Cahn model, a correction procedure is incorporated to preserve mass. Numerical experiments demonstrate the accuracy and effectiveness of the proposed framework.

comments
32 pages, 10 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.30714 ↗

For a given matrix \( A \) in the real Schur form, the eigenvalue swapping algorithm is used to swap two adjacent diagonal blocks. In LAPACK, this operation is performed by the subroutine~\texttt{SLAEXC}/\texttt{DLAEXC}, which is based on a direct swapping algorithm proposed by Bai and Demmel in 1993. In this work, we present a thorough error analysis of a modified direct swapping algorithm. By a carefully designed pivoted Givens QR factorization, this algorithm can achieve an error bound of the form \( O( \boldsymbol{u} \lVert A \rVert ) \) under mild assumptions, where \( \boldsymbol{u} \) is the unit roundoff. We present empirical evidence to illustrate the superior stability of our algorithm over existing approaches.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.30795 ↗

This paper develops projection methods for computing low-rank solutions to large-scale coupled generalized Sylvester equations. The dominant subspaces of these solutions are shown to be spanned by specific resolvent directions, motivating a Petrov–Galerkin projection framework. Conditions for the unique solvability of the projected coupled generalized Sylvester equations are also discussed. Based on these dominant subspaces, two algorithms are proposed: an extended Krylov-based projection algorithm and a rational Krylov-based projection algorithm. The former uses fixed shifts, whereas the latter uses adaptive shifts. Numerical experiments on large-scale benchmark problems demonstrate that the proposed methods achieve high accuracy and fast convergence.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.30804 ↗

We introduce a data-dependent compact multinode Shepard method for the approximation of scattered multivariate data. The proposed approach extends the compact multinode Shepard operator by incorporating nonlinear, data-dependent weights inspired by the weighted essentially non-oscillatory (WENO) methodology while preserving the partition of unity structure and the locality of the approximation. The construction is based on compactly supported multinode weight functions associated with local polynomial interpolants defined on unisolvent stencils. A smoothness indicator is employed to adapt the contribution of each stencil according to the local regularity of the underlying function, thereby reducing spurious oscillations near discontinuities while retaining the optimal approximation order in smooth regions. We establish the theoretical approximation properties of the proposed operator: it achieves the order of accuracy of its linear counterpart for sufficiently smooth functions and, under an explicit indicator-separation hypothesis, the same order is retained at every covered evaluation point near a jump discontinuity. Numerical experiments for local degrees up to four illustrate the performance of the method on both smooth and non-smooth data, on scattered as well as on gridded nodes.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.31026 ↗

Feasible-region sampling and volume estimation become increasingly inefficient when constraints define only a small fraction of a convenient bounding domain. We combine R-functions, which encode compound feasibility as a continuous signed field, with sequential Monte Carlo (SMC) samplers. The proposed construction exploits not only the sign of the R-function, which determines exact feasibility, but also its continuous negative values outside the feasible set, which provide graded information on constraint violation. Logistic intermediate distributions use this information to guide particles progressively towards feasibility, while the final target distribution remains uniform on the feasible region. Experiments on intersections and unions, including disconnected cases of hyperballs, show substantial variance reductions relative to direct rejection sampling, with the statistical advantage generally increasing as the feasible fraction decreases. For sufficiently small feasible regions, these advantages persist even after accounting for computational cost. To isolate the benefit of continuous R-function information, we also compare the proposed method with an SMC sampler with a region-only (RO) construction that uses the same sequential particle machinery but retains only binary feasible/infeasible information. We demonstrate that the R-function-informed SMC method concentrates particles in the feasible region earlier and produces lower-variance volume estimates than RO.

comments
22 pages, 8 figures, 3 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2610.31042 ↗

We propose and analyse a fully discrete finite element approximation of the three-dimensional incompressible rotating MHD-Boussinesq system with nonlinear power-law ($p$-Laplace) viscosity. Conforming elements are used for the velocity and temperature, $\mathbf H(\operatorname{curl})$-conforming Nédélec elements for the magnetic induction, and a semi-implicit backward Euler scheme in time. The discretisation preserves the principal energy structure: the Lorentz and induction terms cancel exactly, while the Coriolis force remains energy neutral. This yields well-posedness and mesh-independent energy stability. The nonlinear power-law diffusion creates two main analytical difficulties. Since a uniform time-derivative estimate for the discrete velocity is unavailable, strong compactness is obtained through a time-translate argument and Simon's compactness criterion. The weak limit of the nonlinear diffusion is then identified by a Minty argument based on a discrete energy $\limsup$ inequality. Compactness and passage to the limit hold throughout the shear-thickening regime, while identification of a genuine weak solution is obtained in the Newtonian case and, in three dimensions, above an explicit threshold dictated by the Lorentz force rather than by convection. We further establish a priori error estimates without any mesh-time coupling condition. Three-dimensional numerical experiments confirm the stability and convergence behaviour predicted by the analysis.

comments
42 pages, 29 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.31091 ↗

We construct a continuous function on $[-1,1]^2$ for which the infimum of the $L^2$-approximation error over the class of ReLU networks with two hidden layers and architecture $(2,2,1,1)$ is not attained. This counterexample shows that deep ReLU networks do not satisfy the best approximation property in general, even for continuous target functions. Our findings contrast with existing results for shallow neural networks, where ReLU is one of the few activation functions that guarantee the existence of global minima in typical regression tasks. The proof is based on the fact that the breaklines for neurons in the second hidden layer can bend, which breaks the symmetry arguments used in the one-hidden-layer case.

fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2610.31264 ↗

We present a numerical method for recovering rigid polygonal obstacles in two dimensions, based on the diffraction-based inverse scattering theory of Bao, Chen, Lu, and Xiong. A single pulse is emitted from a point source, and the resulting wave field is measured on a receiver curve. After isolating the diffracted signals, we recover the visible vertices from arrival times and the corner orientations and opening angles from amplitudes. The use of amplitude information permits local reconstruction in the reflection shadow, where reflected waves do not reach the receiver. The amplitudes also determine the direction of a shadowed edge adjacent to a visible vertex, enabling local non-line-of-sight imaging. Numerical experiments for a convex corner, a concave corner, a triangle, a pentagon and a star-shaped obstacle confirm that the visible portion of the boundary can be recovered stably from diffracted signals. A further convex-corner test with additive noise at level $0.2\%$ on the single arc $L_1$ confirms that the tip and opening remain recoverable.

comments
20 pages, 21 figures
fields
Numerical Analysis, Analysis of PDEs
pdf ↗ page arXiv:2610.31271 ↗

In randomised numerical linear algebra, common choices for distributions of sketch vectors $ω\in \mathbb R^n$ are isotropic, so that $\mathbb E[ωω^T]=I_n$. Unfortunately, the natural extension of an isotropic vector in $(\mathbb R^n, \|\cdot \|_{2})$ to an infinite-dimensional separable Hilbert space $\mathcal H$ may not exist as an element of the space, posing an obstacle for any attempt to lift the randomised SVD to infinite-dimensional target operators $A$. Current workarounds either forego isotropy and take $ω$ to be a continuous Gaussian process with trace-class covariance operators, or leave $ω$ implicit by instead sampling $Aω$ as if $ω$ were isotropic Gaussian. We unify their approaches by introducing "sketch functionals", an example of cylindrical random variables (Vakhania–Tarieladze–Chobanyan 1987) which allow us to treat general, non-Gaussian distributions with bounded covariance operators. To demonstrate the utility of the new theory, we apply it to develop novel bounds for the infinite-dimensional randomised SVD with a general class of sub-Gaussian sketch distributions.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.31333 ↗

We construct a second-order, linear, and fully decoupled scheme for Rayleigh–Bénard convection between Navier-slip walls. The nonlinear terms are treated explicitly and multiplied by a scalar with exact value $1$ and no energy contributed to the continuous problem. As a result, each BDF2 step, with a rotational pressure correction, solves only constant-coefficient linear problems. For the time discretization, we prove that, for any time-step, the energy decays when the walls have equal temperatures, under a condition on the thermal weight, and the energy is bounded on finite time intervals when heated from below. Relaxing the scalar towards $1$ preserves both estimates. Energy stability does not control the accuracy of the scalar; the velocity and temperature fields are computed with its unrelaxed value, whose deviation from $1$ scales like $(E/C)(δt/τ)^3$ for kinetic energy $E$, time-scale $τ$ of the flow, and weight $C$ of the scalar equation. In our tests, choosing $C$ comparable to $E$ keeps this deviation small and doubles the largest time-step for which steady rolls are reproduced to a relative difference of $10^{-8}$. With Taylor–Hood elements, we observe second-order convergence in time, recover the critical Rayleigh numbers, and match published Nusselt numbers to within $0.5\%$. A three-dimensional implementation passes corresponding validation tests.

comments
38 pages, 10 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.31364 ↗

We introduce a spatially adaptive proper orthogonal decomposition (POD) method for error-bounded lossy compression of snapshot data in finite-dimensional function spaces. The method combines hierarchical graph partitioning with independent low-rank approximations on spatial subdomains, allowing the local approximation ranks to adapt to the spatial distribution of information in the data. For partitions that are orthogonal in the discrete inner product, we establish an exact decomposition of the global squared reconstruction error into local contributions and characterize the optimality of the resulting local POD approximations for fixed partitions and ranks. These results provide a rigorous mechanism for allocating a prescribed global error tolerance among subdomains and selecting the smallest admissible local ranks. We further develop a sufficient error bound for the coefficient-space normalized root-mean-square error (NRMSE). A greedy hierarchical refinement algorithm accepts a spatial subdivision only when it reduces the storage required by the local low-rank factors while preserving the prescribed reconstruction-error bound. The method is assessed using synthetic data and snapshot sequences from two- and three-dimensional compressible-flow simulations. The numerical results illustrate how spatially adaptive ranks and partitioning can improve compression relative to global POD and fixed spatial partitions, particularly when the data exhibit spatially heterogeneous dynamics.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.31375 ↗

Equilibrium neural networks define their hidden state as the fixed point of a contraction, so their effective depth is set at evaluation time rather than by the architecture. Using them for fully nonlinear PDEs raises two issues that explicit networks avoid: second derivatives may grow with the effective depth, and the potential is only ever evaluated approximately. We study nonnegative softplus equilibrium networks with contraction factor $q<1$, a convex class suited to the Monge–Ampère equation. A positivity cancellation in the resolvent shows that the Hessian grows at most like $(1-q)^{-2}$, rather than the $(1-q)^{-3}$ of a direct estimate, and an explicit one-neuron family shows that this exponent is sharp; third derivatives satisfy a sharp $(1-q)^{-3}$ bound. Residual-based a posteriori estimates then control the state, its input derivatives and, in two dimensions, the Hessian determinant at an approximate equilibrium. Combined with interval arithmetic on complete covers of the domain, they yield rigorous uniform bounds on the Monge–Ampère residual and, through a comparison argument, on the solution error of a fixed trained network. On two manufactured Dirichlet problems on the unit disk, all six trained models are certified with residual below $0.25$ and boundary error below $0.01$. Adaptive stopping halves float64 evaluation time at best, whereas certified adaptive evaluation remains costlier than fixed depth.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.31386 ↗

Quaternion tensor singular value decomposition (T-SVD) under the T-product provides a framework for analyzing multidimensional quaternion data. However, the T-SVD construction of Pan and Ng (SIAM J. Matrix Anal. Appl., 2024) \cite{PanNg2024} contains a structural gap: an unrestricted quaternion matrix SVD need not preserve the paired Fourier block structure required for tensor factor recovery, potentially leading to loss of T-unitarity and inaccurate reconstruction. To address this issue, we develop a structure-preserving construction that transforms each paired quaternion block into a complex matrix and maps its complex SVD factors back to quaternion factors with the required structure. This construction corrects the proof of \cite[Theorem 4]{PanNg2024} and leads to a corrected version of \cite[Algorithm 2]{PanNg2024}, hereafter referred to as the ``corrected algorithm'', ensuring T-unitary tensor factors and an f-diagonal core for arbitrary third-order quaternion tensors. A numerical counterexample demonstrates the failure of \cite[Algorithm 2]{PanNg2024} and verifies the corrected algorithm at machine precision. Notably, we propose a fast structure-preserving algorithm, Algorithm~\ref{alg:t-fast}, and compare it numerically with the corrected algorithm. The experimental results show that Algorithm~\ref{alg:t-fast} reduces the decomposition time while maintaining near-machine-precision accuracy. Furthermore, its application to color video encryption yields high reconstruction quality, favorable ciphertext statistics, and stability under input perturbations.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.31451 ↗

We construct and analyse a fully discrete scheme for a Kirchhoff-type nonlinear integro-differential equation in two spatial dimensions with time-dependent coefficients. The scheme combines a symmetric three-layer time discretization of Crank–Nicolson type with a conforming finite element method of arbitrary polynomial degree $p$ and a Picard iteration for the nonlinearity. We prove that the Picard iteration is well defined and, that the iterates converge to the Ritz projection of the exact solution measured in fractional-power norms of the discrete Laplacian. Running the same energy argument in the unshifted norms, and under the same hypotheses, we then obtain the optimal order $\mathcal{O} ( h^{p+1} + τ^2 )$ in $L^2$ and $\mathcal{O} ( h^{p} + τ^2 )$ in $H^1$ for the full error. For the homogeneous problem with constant coefficients, the exact solution of the scheme moreover preserves a discrete energy identically. Numerical experiments with manufactured solutions reproduce the predicted second order in time and the full spatial order $h^{p+1}$ in the $L^2$-norm.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.31487 ↗

I present a geometric multigrid solver for the Poisson equation with continuous cubic elements in three dimensions, smoothed by a multiplicative vertex-patch Schwarz method with exact local solves. All fields are kept in persistent cell-wise storage, where every cell holds its own copy of each shared degree of freedom. The patch smoother yields a continuous solution without any exchange between cells. On the GPU, the patch update is computed in registers, one cell per thread, and the cells of a patch exchange data by warp shuffles, so shared memory is avoided almost entirely. Despite the low occupancy that this design implies, the arithmetic of the patch update runs close to the FP32 peak. Fast diagonalization, merged transforms, and a reflection symmetry of the patch then reduce the arithmetic until a sweep moves its data at $87\%$ of the bandwidth of a plain device copy. The hierarchy therefore runs in single precision inside a double-precision outer iteration. Rounding the unassembled residual destroys the cancellation between opposite-sign copies of shared degrees of freedom; exchanging the copies between cells in double precision performs this cancellation before rounding, without changing the dual vector they represent. With this \emph{rebalancing}, the cycle converges as in double precision and independently of the mesh size, the error converges at the optimal rate down to the precision of the solve, and the solver reaches over $400$ million degrees of freedom per second on a single NVIDIA A100 GPU.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.31496 ↗

We build structure-preserving reduced-order models for both challenge problems of the AePW-4 High-Speed Working Group. They are a clamped thin panel at Mach 1.92 (RC-19) and a cantilever plate at Mach 5.85 (HyMAX). The published data for each case hold no time-resolved response and no repeated runs. The physics must therefore be carried by the form of the model. One construction gives two models per problem. A Ritz-Galerkin reference model describes the plate. A learned model keeps the reference model's exact potential, fits the remaining generalized forces, and trains only a dissipation that cannot add energy. Its energy balance holds for any weights by construction. On the trained model the worst relative residual is 2.2e-15. On RC-19, shock relations predict a pressure ratio of 1.521 across the panel. Pressure-sensitive paint measured the same value. Thirty runs of the learned model place the mean dominant frequency within 1.0% of the measured 236 Hz. At one periodic and one chaotic condition, the learned model reproduces the response regime of a published reduced-order model in all sixteen runs. It does so without that model's 113 Hz spectral peak, which the measurements do not show. Measured displacements can also correct the chaotic response through one more force that respects the energy balance. We tested this on synthetic data at the experiment's 5 kHz sampling rate. The state error is 1.25% of the panel thickness without noise and 3.5% with 10 micrometers of noise. On HyMAX the learned model follows the reference model's trailing-edge displacement for 65 ms with a relative error of 3.7%. These results show that a model whose structure carries the physics can match measured flutter behavior when the available data cannot train it.

comments
68 pages, 15 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.31504 ↗

We determine when approximation by convex polynomials on expanding intervals converges to best approximation on the real line by convex entire functions of exponential type at most $σ>0$. For intervals of radius $(n-γ_n)/σ$, where $0\leγ_n<n$ and $γ_n=o(n)$, one margin sequence gives this limit for every convex function of polynomial growth if and only if $γ_n/[n^{1/3}(\log n)^{2/3}]\to\infty$. When this condition fails, a fixed uniformly strictly convex entire function has approximation errors with unbounded limsup. We apply the limit theorem to prove existence of the convex Bernstein constant for $|x|^λ$ for every $λ\ge1$, and identify it with an attained entire-function minimum. We also give a sufficient margin for growth bounded by $\exp(a|x|^α)$, $0<α<1$. For arbitrary subexponential growth on the real line, each target with finite entire-function error admits a suitable margin, whereas no single margin is sufficient for the whole class. Further results concern attainment, right continuity with respect to the exponential type, weighted growth conditions, and the endpoints of fixed-fraction approximation intervals.

fields
Numerical Analysis, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.31546 ↗

Constructing accurate and computationally tractable approximation spaces is a fundamental task in scientific computing. Partially trainable neural networks bridge fixed random features and fully adaptive representations. This paper quantifies a phase transition pattern in approximation bounds and observes analogous behavior in training errors: a rapid but smooth initial improvement followed by diminishing returns, with a sharper transition under greater initialization mismatch. Under polynomial spectral decay with exponent $α>1$ and leverage compatibility, we establish a squared $L_2$ approximation rate $\mathcal{O}((κ_P\log(m/δ)/m)^α)$ for two-layer networks of width $m$ and trainable proportion $P$, where $κ_P=(P/κ_1^*+(1-P)/κ_0^*)^{-1}$. The bound holds uniformly over the unit ball of a reproducing kernel Hilbert space (RKHS) with probability at least $1-δ$. The constants $κ_0^*$ and $κ_1^*$ quantify the fixed and trainable groups' sampling mismatches relative to the target RKHS. For spherical biased-ReLU features in dimension $d$, we verify these assumptions with $α=(d+2)/(d-1)$ and $κ_0^*=4\sqrt{2}τ(d+1)/d$ for initialization scale $τ\ge1$, and $κ_1^*=1$ under ridge leverage sampling. For $d=5$ and $τ=10$, a trainable proportion of approximately $4.1\%$ captures $90\%$ of the reduction in the approximation bound from $P=0$ to $P=1$. A structured three-layer example illustrates how a few trainable first-layer neurons exploit fixed downstream blocks through nonlinear composition. Numerical experiments across diverse settings, including networks with up to 15 layers, exhibit similar phase transitions in training errors.

fields
Numerical Analysis, Statistics Theory
pdf ↗ page arXiv:2610.31663 ↗

Optimization and Control23

Linear and convex quadratic programs are fundamental problems in optimization. While many methods have been developed for solving these programs in large-scale applications, to our knowledge none have attempted to solve their continuous-time gradient flow, a differential inclusion, in full generality without assumptions beyond feasibility. Recent work solved the gradient flows in two special cases, basis pursuit and the lasso, and obtained competitive algorithms. Motivated by these results, we solve the general case exactly. Using the minimal selection principle for monotone differential inclusions, we show that the trajectory of the gradient flow consists of finitely many pieces, each obtained from one nonnegative least-squares problem. Its final piece yields an optimal solution or a certificate of unboundedness. This analysis leads to two algorithms. The first algorithm is exact, terminates after finitely many steps, and applies to linear programs and projections onto polyhedra. The second algorithm, which we call minimal selection descent, discretizes the gradient flow for general convex quadratic programs. Its iterates converge to an optimal solution when one exists and otherwise certify unboundedness. We apply both algorithms to a positivity-preserving limiter for a discontinuous Galerkin scheme and to optimal control problems for the Poisson and heat equations. In the limiter, the first algorithm conserves the total mass more accurately than the state-of-the-art Douglas–Rachford splitting method. On the control problems, minimal selection descent reaches the optimal value to machine precision and is competitive in time with commercial and open-source solvers.

comments
55 pages
fields
Optimization and Control, Dynamical Systems
pdf ↗ page arXiv:2610.30300 ↗

Uncrewed aerial vehicle (UAV) communication systems are increasingly used to provide temporary connectivity when ground communication infrastructure is damaged by disasters such as hurricanes and wildfires. However, the amount of aerial support required changes as ground networks recover and communication demand evolves. We focus on dynamically adjusting the number and allocation of actively deployed UAVs within a fixed available fleet. We develop a model predictive control (MPC) framework for dynamic fleet sizing of heterogeneous UAV relays during post-disaster communication recovery. The framework accounts for communication demand, ground network recovery, heterogeneous UAV operation, UAV energy availability, and backhaul capacity, which limits how much relayed traffic can be transmitted to the external communication network. The resulting formulation is a convex quadratic program that supports efficient online fleet sizing and deployment decisions. We evaluate the framework using seven historical disaster recovery case studies based on Federal Communications Commission reports, together with four backhaul scenarios and sensitivity analyses. Results show that required active UAV fleet size varies considerably throughout recovery, while backhaul capacity and fleet composition affect communication performance, highlighting the value of adapting active fleet size over time.

fields
Optimization and Control
pdf ↗ page arXiv:2610.30323 ↗

We address the problem of real-time multi-agent path planning under prescribed initial and final configurations, formulated as a high-dimensional optimal control problem subject to inter-agent collision avoidance and obstacle constraints. Classical solvers based on the Hamilton–Jacobi–Bellman equation or Pontryagin's maximum principle (PMP) become computationally intractable as the number of agents grows, due to the curse of dimensionality and the non-convexity introduced by interaction constraints. We propose OCFormer, a transformer-based neural network that parameterizes the inverse of a coordinate transformation mapping a simple, analytically tractable latent space, in which agents evolve independently under a decoupled Hamiltonian, to the physical space of the coupled, interacting system. The model is trained by minimizing a physics-informed loss comprising the Hamiltonian ODE residual from the PMP and a boundary matching term, without requiring pre-computed trajectory data. The self-attention mechanism endows OCFormer with permutation equivariance over agents, a structural symmetry that prior symplectic network approaches do not natively enforce. When trained on a distribution of boundary conditions, the amortized OCFormer produces near-optimal trajectories for unseen initial and final configurations in a single forward pass ($\sim$220ms), enabling real-time inference without retraining. We further introduce a lightweight transfer learning framework that adapts a pretrained OCFormer to out-of-distribution perturbations in seconds via L-BFGS fine-tuning. Numerical experiments on two- and three-dimensional multi-agent navigation with up to 128 agents demonstrate the scalability and efficiency of the proposed approach.

fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2610.30388 ↗

Lyapunov functions and barrier certificates give state-space guarantees of stability and safety, but synthesizing and verifying them—especially for nonlinear, high-dimensional systems—remains an open challenge. Existing pipelines verify candidates with numerical solvers (sum-of-squares programs), interval methods, or satisfiability-modulo-theories (SMT) solvers, which often require relaxations, are conservative, or scale poorly with model dimension and nonlinearity. These limitations have also shaped benchmark design: standard test suites are dominated by low-dimensional polynomial systems chosen to suit what solvers can handle rather than what engineering applications require. We address both sides of this challenge. First, we introduce DynaCertBench, a benchmark of 105 instances: 80 non-redundant systems curated from the literature, extended with high-dimensional and control-constrained variants and new nonlinearly coupled systems, comprehensively spanning stability, region-of-attraction, forward-invariance, and safety tasks. Second, we present LLM2Cert, an LLM-driven framework that synthesizes candidate certificates and verifies them against their proof obligations: each obligation is routed to an SMT solver or directly to the Lean Proof-Repair agent. On DynaCertBench, LLM2Cert verifies 81 of 105 instances ($77.1\%$), a $17.1$ percentage point improvement over one-shot proposal without feedback. On the 81 fixed certificates, LLM2Cert verifies 22 that All-SMT leaves unresolved. Code and data are available at https://github.com/FormalCert-AI/llm2cert.

code
github.com/FormalCert-AI/llm2cert ∎ Lean project (llm2cert/formalization/lean/lakefile.toml, llm2cert/formalization/lean/lean-toolchain) builds, no sorry at 37b6a04, checked 2026-10-27 build details
comments
59 pages, 3 figures. Equal contribution: Zhipeng Cao and Peiyang Song. Equal advising: Bai Xue and Alessandro Abate
fields
Optimization and Control
pdf ↗ page arXiv:2610.30524 ↗

For the method of successive approximations (MSA), a fundamental challenge is that the stochastic maximum principle (SMP) provides an optimality condition rather than a descent rule. To overcome this difficulty for nonconvex stochastic control problems, we develop a soft-update MSA (SU-MSA) with a second-order-adjoint correction of the Hamiltonian and a neural realization called DeepSMP. Both an explicit stepsize rule guaranteeing cost descent and the convergence of the algorithm are established. Moreover, the global SMP condition is asymptotically satisfied when the corrected Hamiltonian is convex, while in a special case the cost is further proved to converge to the global optimum. To extend SU-MSA to high dimensions, we develop DeepSMP using a differentiable smooth approximation of the corrected Hamiltonian and analyze the convergence of the resulting objective and its gradient. Numerical experiments demonstrate the effectiveness of the proposed framework.

fields
Optimization and Control
pdf ↗ page arXiv:2610.30585 ↗

We develop three retraction-free Landing methods for nonsmooth composite optimization over the Stiefel manifold, combining an (approximately) tangential direction with an infeasibility-reducing normal direction. The subgradient Landing method, with normal stepsizes parameterized by $α\in[0,1]$, has best-iterate complexity bounds $\mathcal{O}(ε^{-4})$ for surrogate stationarity and $\mathcal{O}(ε^{-2/(2-α)})$ for feasibility. For $α=0$, it converges locally $R$-linearly under local weak sharpness and mild assumptions. The proximal gradient Landing method computes a tangential direction by solving a proximal subproblem and combines it with the same normal direction. Moreover, the inexact proximal gradient Landing method allows the proximal subproblem to be solved approximately and applies an explicit correction to control violations of the tangency condition. Both proximal methods have outer-iteration complexity bounds $\mathcal{O}(ε^{-2})$ for stationarity and $\mathcal{O}(ε^{-1})$ for feasibility, and every accumulation point is first-order stationary. Under an additional asymptotic Bregman-error condition and the Kurdyka-Lojasiewicz property of a suitable auxiliary function, the primal sequence of the inexact method converges to a first-order stationary point. Numerical experiments illustrate the effectiveness of all three methods. On the tested sparse principal component analysis instances, the inexact method has favorable running times, and both proximal methods maintain small feasibility residuals.

fields
Optimization and Control
pdf ↗ page arXiv:2610.30617 ↗

KL geometry accelerates restart schedules in stochastic weakly-convex optimization, but the schedule depends jointly on an unknown and potentially nonunique geometric description. We introduce CARP-KL, a certified portfolio that adapts over valid KL descriptions while using the same primitive stochastic-subgradient oracle for both optimization and candidate selection. Over declared polynomial parameter ranges, CARP-KL competes with every affordable valid description and preserves the known-description polynomial Moreau-stationarity rate up to logarithmic factors, without objective values, an exact proximal map, direct Moreau-gradient access, or a bounded-domain assumption. Controlled experiments quantify the finite-budget price of this universality. The portfolio repeatedly contains strong candidates, while certification consumes a substantial share of the oracle budget and finite-sample ranking limits their recovery. A common conservative gap bound further reduces the portfolio from $O(\log^3 T)$ to $O(\log^2 T)$ candidates with an explicit scale-mismatch penalty. The theory and diagnostics together establish certified unknown-geometry adaptation and pinpoint selection as the principal practical frontier of the current construction.

comments
57 pages
fields
Optimization and Control
pdf ↗ page arXiv:2610.30650 ↗

We investigate a hidden convexity phenomenon for triples of homogeneous quadratic forms. We give a complete characterization of the convexity of the upper image obtained by adding the nonnegative orthant to their joint range. More precisely, the upper image is convex if and only if either a nonzero nonnegative linear combination of the three associated matrices is positive semidefinite, or the three quadratic forms admit a common strict negative direction. In particular, the upper image is convex whenever one of the three quadratic forms is convex. As applications, we establish the convexity of an associated value function and derive a generalized S-lemma for implications involving two quadratic inequalities and a strict theorem of the alternative for quadratic systems.

comments
12 pages
fields
Optimization and Control
pdf ↗ page arXiv:2610.30706 ↗

The Perception-Adjusted Luce Model (PALM) introduced by by Echenique et al. (2018) is a sequential choice model that can accommodate violations of regularity and choice overload, behaviors not captured by the utility-maximization framework. Flores et al. (2019) studied the assortment problem under the PALM and proved that, for the case of two levels, there is always an optimal solution that is revenue-ordered by level. They also conjectured that revenue-ordered by levels remain optimal for the general PALM with any number of levels. We resolve this question in the affirmative by showing that every PALM instance admits an optimal assortment that includes, within each level, all products at or above a level-specific revenue threshold. The proof involves first showing how the conjecture which deals with a discrete optimization problem, can be reduced to proving certain property of a related continuous optimization problem. Specifically, we study a continuous refinement of the assortment decision under the same PALM choice rule. Although the refinement permits partial utility selections, we prove it always has an optimum that selects complete revenue tiers. This allows us to show that the assortment problem is polynomial-time solvable when the number of levels is fixed.

comments
17 pages, 1 figure
fields
Optimization and Control
pdf ↗ page arXiv:2610.30904 ↗

We consider safety-constrained position tracking for a flexible transmission system consisting of a torsional shaft driven by a motor and connected to a gravitationally loaded inertia. The coupled PDE-ODE dynamics admit a semilinear formulation in which the linear input-output system is impedance passive and the gravitational torque enters as a bounded, globally Lipschitz perturbation. We establish an energy dissipation inequality for the nonlinear model and show that a position-funnel controller with supervised damping admits a unique global closed-loop trajectory. In particular, the motor-angle tracking error remains strictly inside a prescribed time-varying funnel, which can be chosen to enforce safety bounds on the motor angle.

fields
Optimization and Control, Functional Analysis
pdf ↗ page arXiv:2610.31061 ↗

We study policy evaluation (PE) and policy gradient (PG) for continuous-time stochastic control with Markov regime-switching. The main challenges are the coexistence of diffusion and regime jumps, the coupling of regime-dependent value functions, and the construction of model-free learning rules from the coupled generators. We establish a martingale characterization of PE that incorporates both Brownian and switching martingales, and extend martingale loss and orthogonality methods to this setting. We further derive a coupled PG equation and a trajectory-based gradient representation that, under an action-independent switching generator, avoids explicit knowledge of the system coefficients and transition rates. These results lead to offline and online actor-critic algorithms. We also establish convergence and study the finite-grid approximation required for implementation. Numerical experiments for a regime-switching linear-quadratic problem illustrate the proposed methods.

fields
Optimization and Control
pdf ↗ page arXiv:2610.31094 ↗

For a strongly convex unconstrained minimization problem, Newton's method with a line search offers rapid convergence to a minimizer by incorporating second-order information. However, for a general unconstrained problem the Hessian need not be positive definite, which can lead to the inability to find a search direction or to search directions that fail to produce descent. Modified Newton methods are designed to handle this situation. This paper considers modifications to a Newton-conjugate-gradient approach based on Lanczos tridiagonalization. Existing methods are extended using dynamic modification schemes that provide a descent direction while keeping the modification bounded. A Lanczos-based scheme and a conjugate-gradient (CG)-based scheme are formulated and analyzed. These methods are mathematically equivalent in exact arithmetic, but their practical behavior differs in finite precision. Finally, it is shown how the convergence and computational cost are affected by varying the amount of additional curvature introduced and by allowing the early termination of the inner iterations.

comments
23 pages, 2 figures, 1 table
fields
Optimization and Control
pdf ↗ page arXiv:2610.31110 ↗

Long chains of decisions coupled only through a bounded cumulative state, such as the operation of an energy-storage device, form convex programs that generic solvers treat as arbitrary sparse models. We present an exact solver for this class that propagates the complete convex cost-to-reach function through restrictions and infimal convolutions, each evaluated by fast Legendre-Fenchel conjugation as an ordered merge of slopes: no state grid, no value approximation, and a function rather than a single primal-dual pair as output. Price-taking storage instances of 5,000 to 15,000 hourly steps solve 35-93 times faster than Gurobi. The value function is what pays: exact capacity marginals in one differentiated pass, recourse assembled rather than sampled on scenario trees, and a certified sizing loop whose cut count does not grow with the number of weather years. We then widen the carried state. Two storages at one node can be eliminated rather than coordinated by carrying the value function of the pair, and we prove that this object is combinatorially rigid: every breakline the recursion realizes is vertical, horizontal, or borne by a line through the origin, with no genericity assumption. For d co-located stores sharing one charge-discharge coefficient, every realized wall is a position hyperplane or an indifference hyperplane {s_i = s_j}. A catalogue law maps where speed holds: one-dimensional chains beat the frontal solve by 15-30x and growing, while the planar block loses by 13.5-107x on rich network curves. Those curves are themselves exact, traced by a parametric dual simplex. The open-source package FLToptim, every benchmark driver and all data accompany the paper.

comments
63 pages, 5 figures, 9 tables. Code and data: https://doi.org/10.5281/zenodo.21943668
fields
Optimization and Control
pdf ↗ page arXiv:2610.31213 ↗

This paper addresses exact controllability and rapid stabilization issues for linear difference delay systems with finitely many pointwise delays. We first establish a criterion for exact controllability in $L^r$, $r \in [1, +\infty)$, characterized by a necessary and sufficient Hautus-type frequency-domain condition. The sufficiency of this condition in $L^r$ was already known [https://hal.science/hal-04830757/], whereas its necessity had previously been established only in $L^1$ [arXiv:2210.13590]. We answer [arXiv:2210.13590, Conjecture 3.8] by proving that this condition is also necessary for $r \in (1, +\infty)$. The analysis is based on rewriting the system as an evolution equation in a suitable Banach space, which allows one to apply duality arguments in the spirit of [https://doi.org/10.1137/S036301299119795X]. Building on this controllability analysis and the abstract stabilization framework developed in [https://doi.org/10.1137/S0363012996301609, arXiv:1301.5744], we prove that our exact controllability criterion in $L^r$ is also a sufficient condition for rapid stabilization in $L^2$, i.e., that the system of interest can be stabilized by a family of state feedback control laws ensuring that the closed-loop system is exponentially stable in $L^2$ with an arbitrarily large decay rate. As an application, we extend our results to linear one-dimensional hyperbolic partial differential equations, which can be reduced to linear difference delay systems via the method of characteristics, obtaining also a necessary and sufficient frequency-domain criterion for exact controllability in $L^r$, $r\in [1, +\infty)$, which, as before, is a sufficient condition for rapid stabilization in $L^2$.

fields
Optimization and Control, Analysis of PDEs
pdf ↗ page arXiv:2610.31225 ↗

We study the nearest rectangular symplectic matrix problem in the squared Frobenius norm for arbitrary targets $T\in\mathbb R^{2n\times2k}$, with $n\ge k$. We prove that its semidefinite relaxation is exact for every target if and only if $n\ge2k-1$. Under this condition, the primal problem, the relaxation, and both Lagrangian dual problems attain the same optimal value. In this range, we derive the exact minimum Rayleigh quotient of the Riemannian Hessian at every feasible point under the Euclidean induced metric, and prove that all second-order stationary points are global minimizers. We also obtain global objective error bounds. We extend the strong-duality and minimum-curvature results to Hermitian positive definite row weights, proving that strong duality holds for every target if and only if the lowest eigenvalue of the weight has complex multiplicity at least $2k-1$. The dual formulation leads to a method whose main iterations use matrices of order $2k$, with $O(k^2)$ iterative storage apart from the full input and output. Across six tested sizes, mean-time speedups are $2.55$--$12.60$ over a Riemannian first-order method and $4.61$--$43.93$ over Jensen–Zimmermann R–TR2; batching gives a further factor of $3.45$--$23.53$ over sequential calls. The theoretical results complete the critical dimensions not covered by Gram convexification and quadratic matrix programming.

comments
20 pages, 1 figure, 2 tables
fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2610.31298 ↗

The optimal control of a discrete Schrödinger bridge is a discrete gradient, a difference of vertex potentials, but recent models such as MadSBM instead learn a free control on the edges by cross-entropy. We prove that this leaves the action uncontrolled: cross-entropy identifies the control only up to a state-dependent shift (a gauge), and the action is $\operatorname{KL}(r\|p)$ plus a gauge term the loss never constrains. We propose GDSBM, which writes the control as a difference of vertex potentials and adds the action to the loss; pinning the gauge costs no expressiveness and makes the action a property of the model, so the penalty acts on the model and not on the gauge. On peptide generation our MadSBM reimplementation has a free-gauge action of order $10^{8}$ for a gauge-fixed value of $6.5$, against $1.5$ for GDSBM, with no quality loss that three seeds can detect. The gradient form also fits guidance, which becomes the addition of a potential: guided toward a net charge of $+3$ at pH~7, GDSBM is closer than MadSBM, over three seeds, to its exact tempered target in total variation at every guidance strength (at $β=1$, $81\%$ of samples in the target window against $74\%$, for a target of $97\%$); we claim no statistical significance.

comments
31 pages, 3 figures
fields
Optimization and Control, Probability, Statistics Theory
pdf ↗ page arXiv:2610.31361 ↗

This monograph presents a selection of the author's recent works on the control, stability, and stabilization of some classes of linear time-delay systems. After a detailed introduction to topics related to time-delay systems covered in the monograph, its main contents are presented in a series of mostly independent chapters.

fields
Optimization and Control, Dynamical Systems
pdf ↗ page arXiv:2610.31398 ↗

One considers the NP-hard problem of minimizing real cubic and quartic forms on the Euclidean unit sphere. One first extends the Hessian spectral characterization of local minima by the author. In particular one provides a gap-depth characterization of negative global and spurious minima, and proves that the minimum value of an odd degree-d form is recovered (up to the factor d(d -1)) by minimizing the smallest eigenvalue of its ambient Hessian over the sphere (and equivalently the unit ball). Next, one exhibits several classes of benign families of cubic and quartic forms (i.e. with no spurious local minima on the sphere) and prove that some are robust to small coefficient perturbation (i.e. the resulting form remains benign even if it leaves the initial family). Therefore the class of benign cubic and quartic forms is full-dimensional (in the ambient space of coefficients), for n $\ge$ 2. Also for every odd degree d, the class of benign degree-d forms increases with the dimension (however it does not imply that such forms become more frequent when the dimension increases).

fields
Optimization and Control
pdf ↗ page arXiv:2610.31403 ↗

We introduce and analyze a round-robin simultaneous resource allocation contest, motivated by sports leagues and other competitive environments where agents must distribute limited resources across multiple encounters. Players allocate resources in advance to matches against all opponents, and match outcomes are determined by relative allocations. We study two payoff schemes: total points, where players accumulate rewards for each win, and winner-takes-all, where only the tournament winner is rewarded. For three players, we provide complete equilibrium characterizations under both schemes. For four or more players, we show that the total points payoff admits Blotto-type equilibria, while the winner-takes-all payoff requires numerical and algorithmic analysis. To address this, we develop a best-response dynamics algorithm with stochastic inertia and use it to approximate equilibria in games with four and five players.

fields
Optimization and Control
pdf ↗ page arXiv:2610.31418 ↗

In this paper, we propose an efficient subgradient-based framework, referred to as the sequential subgradient-aligned rays (SSAR) method, for improving the convergence performance of the dual subgradient method. In particular, the proposed method identifies and exploits a finite sequence of rays, when available, as the dual subgradient method evolves, along each of which a subgradient of the negative dual function remains constant and aligns with the ray. While the dual variable iterates remain on each identified ray, a constant stepsize associated with the ray is employed, with the associated constant stepsizes decreasing from one ray to the next. This approach yields constant decrements in the negative dual function values while the dual variable iterates remain on the associated rays, enabling the dual variable iterates to progress more quickly toward a dual optimal solution. We then show that the proposed SSAR method can be leveraged to improve the performance of the dual decomposition method for minimizing the average of local loss functions associated with multiple agents that share a common decision variable, a widely used problem formulation in many large-scale real-world applications. In particular, the SSAR method improves the convergence performance of the corresponding dual decomposition method while also reducing its communication cost. Numerical experiments on a least squares regression problem and a logistic regression problem using real datasets are conducted to evaluate the performance of the SSAR method.

comments
This work has been submitted to the IEEE for possible publication
fields
Optimization and Control
pdf ↗ page arXiv:2610.31486 ↗

Motivated by the numerical resolution of stochastic optimal control problems, particularly those involving nonlinear dynamics, we investigate the convergence properties of the Douglas-Rachford splitting algorithm in a nonconvex and infinite-dimensional setting. We introduce an extension of the method that applies when one component of the objective function is continuously differentiable with a locally Lipschitz gradient, while the other is weakly lower semicontinuous with a bounded domain.

fields
Optimization and Control
pdf ↗ page arXiv:2610.31502 ↗

We propose a new regression method named Direct Inference on Admissible Sets (Diona) that directly uses samples to estimate the state and its derivatives at a query point, along with their admissible bounds, without long global training. By casting the values and derivatives at the query and neighbouring samples as latent variables in a constrained optimisation problem, the burden of long training loops becomes one of on-demand local solves. We establish Diona's theoretical properties including finite-sample coverage and, in the noiseless case, convergence to the true state and derivatives under dense sampling. In a nonlinear regression benchmark on six functions of three to eight dimensions, Diona was more accurate than a Gaussian process (GP) on noiseless data especially with denser data sets. Furthermore, as with GP, it produced uncertainty bounds that contained the true value at more than 95% of query points in four functions. Diona's time to a first prediction after a data set update was three to four orders of magnitude shorter than that of the GP, and two to three orders shorter than that of a neural network, which was more accurate but offers no uncertainty quantification. This low latency is paid for by on-demand predictions, so this latency advantage applies when relatively few predictions are needed between data updates.

comments
27 pages, 4 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.31526 ↗

Multi-robot coordination of nonlinear systems is naturally formulated as joint-space optimal control subject to constraints over groups of robots. Existing methods that approach joint optimality remain largely centralized, offline, and confined to collision-free motion planning, while decentralized, real-time counterparts target safe navigation without pursuing the joint optimum. This paper develops a decentralized, real-time planner that approaches the joint optimum as an anytime process. We extend a recent single-robot framework that searches dispersive trees of forward-propagated commands for differentially flat systems to coordinate a multi-robot team near-optimally. We first show that the inter-robot coupling can be effectively replaced by some local constraints, under which locally grown dispersive trees contain a near-optimal agreement. It is this structure that the robots pursue by decentralized column generation, negotiating rents on the shared space that guide the search of each robot's tree. The negotiation settles on an agreement whose near-optimality is certified at quiescence. Our protocol, WarpWeaver, implements this negotiation as an asynchronous real-time loop over a receding horizon, and demonstrates effective closure to quiesced agreements even when real-time deadlines cut the negotiation short. In simulation, WarpWeaver reduces total travel time by up to 22% against centralized offline planners on the Dynobench suite and by up to 37% against a decentralized real-time baseline, and nearly doubles the success rate of a task-specific planner on graph connectivity. Hardware experiments on six robots planning onboard demonstrate real-world implementability.

comments
19 pages, 5 figures, 7 tables. Submitted to IEEE Transactions on Robotics
fields
Optimization and Control
pdf ↗ page arXiv:2610.31540 ↗

Probability23

We study the first passage of Brownian motion to a monomial moving boundary. For every integer degree at least two, we construct a time-independent signed image measure whose heat potential is the killed Brownian transition density on a nonzero interval of the natural Brownian time scale. The image density is determined by a second-kind Volterra equation in the image coordinate, not by the classical Volterra equations in time for the hitting density. Its kernel is an explicit Wright function, and the first-passage density is recovered afterwards from the boundary flux. Exponential bounds establish convergence, while a beta-moment transform connects the Wright kernel with the finite-order differential hierarchy previously obtained from transported moving zeros. A cubic numerical experiment independently checks the resulting density against simulated Brownian paths.

fields
Probability
pdf ↗ page arXiv:2610.30298 ↗

In this paper, we establish a functional non-central limit theorem for regime-switching stable-like processes with periodic coefficients. Our approach relies on stochastic analysis methods, in particular semimartingale characteristics, combined with the ergodic theory of Markov processes. If the set on which the order function achieves its minimum value $\underlineα$ has positive Lebesgue measure, then the limit is a rotationally invariant $\underlineα$-stable Lévy process. Otherwise, the limit is the zero process.

fields
Probability
pdf ↗ page arXiv:2610.30342 ↗

We use Stein's method to prove general upper bounds on the second order Wasserstein distance in the CLT for general dependent partial sums $S_N=X_1+\ldots +X_N$. Then we use these estimates to provide optimal $O(N^{-1/2})$ rates for a variety of chaotic dynamical systems and $φ$- and $ψ$-mixing sequences. Our results for $ψ$-mixing sequences are obtained under the fourth moment condition, which matches the best known results in the iid case. This is the first time that optimal CLT rates of any kind are obtained for unbounded weakly stationary variables under general mixing conditions. We then apply this result and obtain optimal CLT rates $O\left((\text{Var}(S_N))^{-1/2}\right)$ for non-stationary $ψ$-mixing sequences without any growth rates on $\text{Var}(S_N)$. We also obtain close to optimal CLT rates for nonconventional sums and some classes of random dynamical systems with non-uniform decay of correlations

comments
48 pp
fields
Probability, Dynamical Systems
pdf ↗ page arXiv:2610.30352 ↗

We investigate the longest increasing subsequences (LIS) of random permutations distributed under the Luce model with weights $θ_1^{(n)} \ge \ldots \ge θ_n^{(n)}$. Our first main result provides a general formula for the growth rate of the LIS. For example, we get that the LIS of Luce permutations with Sukhatme weights $θ_k^{(n)} = n-k+1$ grows like $\sqrt{n}$. We also give simple conditions for the LIS to be of order $n^β$, for any given $β\in[1/2,1)$. Our second main result states that, if the weights are of the form $θ_k^{(n)} = f\big( (k-1)/n \big)$ for a sufficiently regular function $f$, then the LIS divided by $2\sqrt{n}$ converges in probability to a constant $K(f)$ described by a variational problem. Throughout, we make extensive use of coupling techniques; in particular, to prove our second main result, we argue that Luce random permutations behave similarly to random permutations sampled from the ``Luce permuton''.

comments
28 pages. Comments welcome!
fields
Probability, Combinatorics
pdf ↗ page arXiv:2610.30382 ↗

We model the dynamics of the liquidity profile in Uniswap~V3 and other concentrated-liquidity automated market makers with a stochastic partial integro-differential equation (SPIDE). The profile, the aggregate of all provider positions across tick space, evolves under a degenerate Sturm–Liouville operator, which encodes mean-reverting concentration around the market price, coupled with a Hilbert–Schmidt integral operator, which captures nonlocal redistribution driven by provider repositioning. We establish existence and uniqueness of the mild solution in a weighted $L^2$ space built on the Gegenbauer eigensystem, and reduce the SPIDE to a coupled system of linear stochastic differential equations whose low-order modes describe the level, slope, and curvature of the profile. Pairing the SPIDE with a log-price process yields tractable expressions for pool reserves, pool value, and loss-versus-rebalancing under Ornstein–Uhlenbeck-type and Black–Scholes-type noise. A finite-rank calibration in a fixed reference frame, applied to three Uniswap pools, gives interpretable estimates and lowers active-band forecast error relative to a martingale benchmark on the two pools compatible with the stationary specification. On the third pool, out-of-sample diagnostics are consistent with nonstationarity, which motivates price-aware and time-varying extensions.

comments
55 pages, 1 figure, 7 tables
fields
Probability
pdf ↗ page arXiv:2610.30539 ↗

We study the mixing time of two local Markov chains for uniformly sampling proper edge colorings of trees. For a tree with $n$ vertices and maximum degree $Δ$, we establish optimal mixing-time bounds for the single-edge Glauber dynamics when $q\geΔ+2$ and for the neighboring-edge heat-bath dynamics when $q\geΔ+1$. Both chains mix in $O_Δ(n(\log n+\log(1/\varepsilon)))$ steps, uniformly over the number of colors $q$. These bounds are tight in their dependence on $n$ for fixed $Δ$. Our proof establishes log-Sobolev inequalities through local color release, reusable recoloring buffers, and component entropy mixing. The two dynamics require different local constructions: a two-spare-color buffer for single-edge updates and a second-layer controller for neighboring-edge updates. The resulting entropy analysis applies to general bounded-degree trees, including regimes where worst-case spatial mixing fails.

fields
Probability
pdf ↗ page arXiv:2610.30625 ↗

This article studies a finite-horizon American put option with up to $m$ exercise rights under the risk-neutral Black–Scholes model, where consecutive exercises must be separated by a prescribed refractory period $δ>0$ and unused rights may expire. For each number of remaining rights, we show that optimal exercise is characterized by a single exercise boundary and that these boundaries are ordered by the number of remaining rights. We prove optimality of the first boundary-hitting time and establish local Lipschitz continuity of the exercise boundaries within each open deadline strip. Away from the deadlines, we derive smooth fit, the associated quasi-variational inequality and free-boundary formulation, an early-exercise-premium representation, recursive Volterra-type boundary equations, and a verification theorem. We also extend the recursive formulation to an independent random termination time, thereby allowing for exogenous termination of the option contract.

comments
64 pages, 1 figure
fields
Probability
pdf ↗ page arXiv:2610.30637 ↗

We provide a short probabilistic proof of the classical characterization of multivariate quasi-copulas, addressing the call for a simpler and more transparent proof expressed by Sempi (2017). Our approach is based on a coupling construction for random variables with fixed marginal distributions and a prescribed distribution of their maximum. In our main result, we show that such a coupling exists if and only if the maximum is stochastically no smaller than each component and the distribution of the maximum is dominated by the sum of the marginal measures. The construction applies to arbitrary distributions and relies only on a decomposition of the maximum law and monotone quantile couplings. A direct consequence of our main result is the existence of copulas with prescribed values along an increasing track.

comments
9 pages
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2610.30642 ↗

The stationary increment measure of the open Kardar-Parisi-Zhang equation on a bounded interval can be represented as the independent sum of a Brownian motion and another process defined via an explicit Radon-Nikodym derivative with respect to the measure induced by a Brownian motion. In the fan region, its finite-dimensional Laplace transform was previously expressed in terms of the continuous dual Hahn process. The main contribution here consists of computing the finite-dimensional Laplace transform for a range of parameters in the shock region by an analytic continuation argument. As an application, we provide a direct proof of the convergence of the finite-dimensional distributions of the increment height function of open WASEP under the stationary measure in the shock region, by computing the convergence of finite-dimensional Laplace transform without relating to the open KPZ equation.

comments
58 pages
fields
Probability
pdf ↗ page arXiv:2610.30699 ↗

We derive exact formulas for the diagonal distribution of half-space geometric last-passage percolation with a two-parameter family of stationary initial conditions throughout the phase diagram. Unlike previous results, our formulas remove the random shift at the origin. Under critical scaling, we obtain new formulas for the half-space stationary KPZ fixed-point distribution at $x=0$ in the high-density and maximal-current phases. In the low-density phase, we derive a new representation and show that it matches the corresponding formula from the stationary log-gamma polymer.

fields
Probability
pdf ↗ page arXiv:2610.30739 ↗

We establish the central limit theorem (CLT) for Smoluchowski–Kramers approximation of Langevin equations with state-dependent, possibly non-symmetric friction and multiplicative noise. To the best of our knowledge, this is the first such result, even in the case of constant friction and additive noise. The result differs in an essential way from classical averaging CLTs and reveals a new two-scale fluctuation phenomenon. The normalized difference process retains a persistent fast component and is generally not tight in $C([0,T];\mathbb{R}^d)$, thus the usual continuous-path CLT cannot hold. We derive an exact decomposition of the normalized difference into an accumulated slow fluctuation and a rapidly relaxing velocity correction. The auxiliary slow fluctuation converges to a linear diffusion driven by both the original Brownian motion and an additional independent Brownian noise whose effective covariance is characterized explicitly through a quadratic Poisson corrector. For every fixed $t>0$, the fast correction converges conditionally to its local Gaussian equilibrium. Consequently, the fixed-time fluctuation limit is identified as a Gaussian mixture: $$ \frac{\bar X_t-X_t^\varepsilon}{\sqrt{\varepsilon}} \Longrightarrow \bar Y_t+N^{1/2}(\bar X_t)ξ, $$ where $\bar X_t$ is the overdamped limit, $\bar Y_t$ is the limiting slow fluctuation, $N$ is the covariance of the terminal velocity correction and solves a Lyapunov equation, and $ξ$ is a standard Gaussian random variable independent of $(\bar X_t,\bar Y_t)$. A quantitative convergence rate is also provided. The result fills the remaining gap in the asymptotic theory of the overdamped approximation at the central limit scale, complementing the existing law of large numbers, moderate deviation and large deviation results.

fields
Probability
pdf ↗ page arXiv:2610.30835 ↗

Establishing pathwise uniqueness for stochastic differential equations driven by fractional Brownian motion with Hurst parameter $H>1/2$ remains challenging, particularly for discontinuous drifts beyond the regularity regimes of existing theories. A canonical example is the sign drift, for which uniqueness fails in the corresponding deterministic equation. In this paper, we complement recent strong existence results by establishing pathwise uniqueness for the equation with sign drift perturbed by fractional Brownian motion for every $H\in(1/2,1)$, thus obtaining strong well-posedness. Our proof develops a new approach based on the infinite iteration of an inequality arising from a fixed-point relation, combined with tail probability estimates exploiting the Gaussian structure of the noise. The methods and results cover a broader class of Gaussian Volterra processes satisfying suitable local nondeterminism and positivity conditions.

fields
Probability
pdf ↗ page arXiv:2610.30889 ↗

We establish the existence of solutions to path-dependent rough differential equations with non-anticipative coefficients whose regularity is formulated in terms of horizontal and vertical Dupire derivatives. Under the same regularity assumptions as in Ananova~\cite{An23}, we develop a new causal Taylor argument and establish a second-order remainder estimate. This removes the regularity loss responsible for the restriction $2\leq p<1+\sqrt{2}$ in~\cite{An23} and extends the existence result to the full range $2\le p<3$.

comments
28 pages
fields
Probability
pdf ↗ page arXiv:2610.30931 ↗

Let $A_n$ be an $n\times n$ real matrix with iid entries distributed as a fixed centered, variance-one, symmetric subgaussian random variable. For deterministic invertible $M_n$, set $h_n=\|M_n^{-1}\|_{\mathrm{HS}}$ and $B_n=M_n^{-1}/h_n$. We prove $\mathbb{P}(s_{\min}(M_nA_n)\le\varepsilon/h_n) =(1+o(1))\varepsilonΘ_n(B_n)$ as $n\to\infty$, uniformly over $M_n$ and $e^{-cn}\le\varepsilon\le n^{-C}$. Here $Θ_n(B)=\mathbb{E}\sqrt{nU^\top BB^\top U}$, where $U$ is uniform on $S^{n-1}$. The constants $c>0$ and $C>1$ depend only on the entry law. No condition-number bound or effective-rank assumption is required. The coefficient tends to one for diffuse inverse profiles. For convergent concentrated or spiked profiles, its limit is an explicit Gaussian expectation. The proof combines the submicroscopic comparison of Sah, Sahasrabudhe, and Sawhney with signed-permutation averaging and a weighted comparison for random hyperplane normals. Applications include inverse amplification, square sample covariance matrices with arbitrary deterministic positive-definite population matrices, and independent random environments.

comments
22 pages
fields
Probability
pdf ↗ page arXiv:2610.31143 ↗

We study the effect of replacing a family of independent statistical experiments by independent repetitions of their average. We give a simple, complete characterization of the $f$-divergences for which this operation increases divergence by at most a constant depending only on the generator, uniformly in the number of observations and the underlying measurable space. The characterization is governed by a local-to-global principle: a comparison restricted to two observations on a binary alphabet already determines the validity of the general inequality. It admits an explicit scalar formulation, which simplifies further for symmetric divergences. The result applies to arbitrary convex generators and requires no differentiability or symmetry assumptions. It recovers the homogenization inequality for total variation and identifies exactly the admissible members of the power-divergence family. In particular, whenever uniform homogenization fails, the obstruction is already present in a family of binary experiments with two observations. Moreover, the global comparison constant is controlled uniformly over generators with a common bound in the local inequality.

fields
Probability, Information Theory
pdf ↗ page arXiv:2610.31164 ↗

We study the fixed-particle limit of empirical measures for a unified self-dual family of conservative particle systems on $\mathbb{Z}^d$: independent random walkers, the symmetric exclusion process, and the symmetric inclusion process. For a fixed number of particles $k$, under diffusive space-time scaling parametrised by $n$, we prove that as $n\to\infty$ the normalised empirical measure converges in $D([0,T],\mathcal{M}_1(\mathbb{R}^d))$ to an atomic empirical measure carried by $k$ independent diffusions, with constant covariance determined by the microscopic jump kernel. Equivalently, the limit is the unique atomic solution of the Dean-Kawasaki martingale problem with mass quantisation $1/k$. In particular, exclusion and inclusion have the same fixed-$k$ atomic limit as independent walkers: the interaction contributes only through microscopic near-collisions, whose rescaled occupation time vanishes. The proof combines self-duality, consistency-based reduction to two particles, and Green-function estimates for finite perturbations of symmetric random walks.

comments
36 pages. Submitted to the Journal of Statistical Physics
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2610.31319 ↗

The Unadjusted Langevin Algorithm (ULA) is widely used for high-dimensional Bayesian inference. Classical analyses in Wasserstein-2 distance predict an asymptotic bias and a mixing time that grow with dimension, but this metric is stronger than necessary for many statistical tasks. We instead analyze the bias in subspace robust Wasserstein distance, which controls the mean and arbitrary low-dimensional marginals and is therefore well suited to observables typically estimated in practice. For ridge-separable potentials formed with i.i.d. data, we prove high-probability bounds showing a bell-shaped mixing profile as the number of data points $N$ varies relative to the dimension $d$. In the overparameterized regime, the effective dimension is the rank $N$ of the data-dependent perturbation, leading to complexity depending on $N$ rather than $d$. In the large-sample regime, Gaussian-perturbation estimates yield dimension-free complexity once $N$ is sufficiently large. In contrast, near the proportional regime $\asymp d$, we prove that dimension-free guarantees are impossible in general.

comments
30 pages, 4 figures
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2610.31431 ↗

In this paper, we establish several deviation inequalities for the norms of vector-valued martingales, achieving bounds of the same quality as those available in the classical one-dimensional setting. Our results extend and refine previous work by Pinelis (1994) and Hayes (2005) in this area.

fields
Probability
pdf ↗ page arXiv:2610.31449 ↗

We establish criteria for stability in the bulk of planar stochastic chemical reaction networks with mass-action kinetics. Using Poincaré compactification, we characterize the asymptotic drift and show how stochastic fluctuations can prevent escape along transversally repulsive branches of the limiting deterministic flow. We construct a Lyapunov function by combining local estimates near these branches with dissipative estimates in the neighboring regions. The criteria cover a wide class of networks and in particular apply beyond weakly reversible and strongly endotactic networks. Together with compatible boundary estimates, these criteria imply positive recurrence.

comments
42 pages, 2 figures
fields
Probability
pdf ↗ page arXiv:2610.31550 ↗

For a $Δ$-regular connected graph $H$ we obtain the upper tail large deviations speed and rate function for the number of copies of $H$ in $\mathbb{G}_n^d$, a random $d$-regular graph on $n$ vertices, in the regime $np^{Δ/2} \gg (\log n)^{1/(v_H-2)}$ and $p \ll 1$, where $p:=d/n$ and $v_H$ is the number of vertices, and also identify the typical structure of $\mathbb{G}_n^d$ conditioned on this upper tail event. For $Δ\geq 3$, the speed and the rate function are same with those in the Erdős-Rényi setting. In contrast, for $Δ=2$ (i.e.~in case of cycles), due to the degree constraint in $\mathbb{G}_n^d$, although speed remains the same the rate function turns out to be different. Moreover, conditioned on the upper tail event of cycle counts in $\mathbb{G}_n^d$, we show that the random graph contains a disjoint collection of clique and biclique like structures with probability approaching to one, a stark contrast compared to the Erdős-Rényi setting. In the complementary regime, i.e.~for $1 \ll n^{v_H}p^{e_H} \ll (\log n)^{α^*_H/(α^*_H-1)}$, where $e_H$ is the number of edges in $H$, $α^*_H$ is the fractional independence number of $H$, and $H$ is a strictly balanced graph (and thus including the regular case), we show that the upper tail large deviations speed and rate function for the number of copies of $H$ match with those in the Erdős-Rényi setting. In this regime, we further show that almost all of the unlabeled copies of $H$ conditioned on the upper tail event are edge disjoint.

comments
56 pages, 2 figures
fields
Probability, Combinatorics
pdf ↗ page arXiv:2610.31590 ↗

We study the large-scale behavior of critical and nearly critical space-time Hawkes processes initialized by a prescribed Poisson field of past events. The density of this initial field separates three macroscopic regimes. In the high-density regime, fluctuations average out and the event measure converges to a hydrodynamic limit which is a deterministic diffusion profile. At the fluctuation threshold, random branching remains visible and produces a measure-valued stochastic limit. Below the threshold, the rescaled event measure vanishes locally even though its mean generally remains nontrivial, with rare large clusters accounting for the surviving mean. For reproduction delays with finite mean, the critical limits are described by heat flow and the occupation measure of a branching diffusion. A nearly critical perturbation introduces linear decay without changing the three-regime structure. Heavy-tailed delays lead to a different balance between time and space: the mean follows a fractional diffusion law, the stochastic limit is a superprocess occupation measure on time-space, characterized by a nonlinear fractional equation, and the past persists as a temporal memory term. We also determine how the scaling of the Poisson past must be matched to the observation scales and show that, in one spatial dimension, a shorter observation window recovers stochastic behavior hidden in the sparse regime. The results allow bounded initial profiles with possibly infinite total mass and describe the limits directly at the level of locally finite event measures.

comments
72 pages
fields
Probability
pdf ↗ page arXiv:2610.31604 ↗

This work constructs a non-trivial solution to the ill-defined two-dimensional Kardar-Parisi-Zhang (KPZ) equation at criticality: a distribution-valued stochastic process on the plane, which we call the Critical 2D KPZ Process. It arises as the limit in law of centred log partition functions of two-dimensional Gaussian directed polymers at criticality, viewed as discretised KPZ solutions. It is also a measurable function of the Critical 2D Stochastic Heat Flow (SHF) via a renormalised Cole-Hopf transformation, obtained as the limit of the centred logarithm of the spatially mollified SHF as the smoothing is removed. The Critical 2D KPZ process is non-Gaussian and its covariance displays a log-log blow-up near the diagonal. Gaussian fluctuations emerge when averaging on shrinking spatial scales. The results presented here were obtained through extensive interactions with generative AI (ChatGPT 5.5, 5.6 and 6); see Appendix C for more details. The proof builds on key recent and older advances in our field, combined in novel ways with substantial AI input. We view this manuscript as a "community project" that represents more than a decade's collective effort. We have worked on making the presentation as accessible as possible, highlighting the main ideas and their relations to the literature.

comments
84 pages
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2610.31614 ↗

This paper is about the derivation of "integrability results" (i.e., for example, explicit formulas for the probability of events involving a few marked points) for Conformal Loop Ensembles, that are the (conjectured) scaling limits of discrete crititical planar lattice models from Statistical Physics. We discuss the explicit solutions to the PDEs provided by the original SLE/CLE martingale approach that AI now makes it possible to uncover. This provides short and direct new proofs of a number of formulas that have recently been derived based on Liouville quantum gravity, conformal field theory or Coulomb gas methods, and also makes it possible to derive some new ones. We briefly illustrate this with the examples of the backbone exponent and annulus crossing probabilities for critical percolation, but this direct approach seems to apply to a wide class of observables of two-dimensional systems related to conformal field theories.

comments
Main text is 11 pages
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2610.31648 ↗

Algebraic Geometry22

We prove that the least common denominator of all genus $g$ Hodge integrals is the Minkowski number $T_{2g}$ or, equivalently, the Bhargava factorial $(2g+1)!_{\mathbb{P}}$ associated to the set of primes $\mathbb{P}\subset\mathbb{N}$. As a corollary, we prove a conjecture of Liu-Xu on the multiplicity of $3$ in the least common denominators of certain descendant integrals, and generalise their result on a conjecture of Itzykson-Zuber to Hodge integrals with $λ$ classes. Namely, the order of the automorphism group of any pointed stable curve of genus $g'\le g$ divides the least common denominator of all genus $g$ Hodge integrals. We also comment on the use of generative AI via IMProofBench, which played a fruitful part in the development of this (entirely human-written) paper.

comments
14 pages, comments welcome!
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2610.30274 ↗

These lecture notes are based on lecture series by the authors for the Summer School 2025 on ``Physical mathematics of quantum field theory" at the University of Massachusetts Amherst organized by Owen Gwilliam, Chris Elliott, and Matteo Lotito. The lectures centred around algebraic structures arising from twists of supersymmetric quantum field theories, correlation functions of topologically twisted supersymmetric gauge theories, and their mathematical counterparts as intersection-theoretic invariants associated to moduli spaces of instantons, semistable sheaves, or Higgs sheaves on four-manifolds or complex projective surfaces.

comments
138 pages
fields
Algebraic Geometry, Differential Geometry, Geometric Topology, Quantum Algebra
pdf ↗ page arXiv:2610.30288 ↗

We prove a relative fundamental lemma for the unitary symmetric variety $GL_n(k')\backslash U_{2n}$, proving a conjecture of Leslie, Xiao, and Zhang. Our proof reduces to the Lie algebra and argues over function fields in positive characteristic, using methods from Ngo-Laumon and Ngo. In particular, we reinterpret orbital integrals in terms of the cohomology of relative affine Springer fibers and globalize this using unitary versions of Hitchin moduli spaces for symmetric pairs via a product formula. As the main global input, we prove a matching of perverse sheaves between relative Hitchin moduli spaces and their corresponding endoscopic variants.

fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2610.30366 ↗

We remove the assumption of the Hodge conjecture from the asymptotic formula for the Archimedean local height established in our previous work. We also remove other minor assumptions. We achieve this by exploiting the cohomological nature of Beilinson's local intersection index rather than arguing motivically.

comments
6 pages
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2610.30574 ↗

We extend the dual complex of a simple normal crossings divisor to a homotopy type invariant $\mathcal{D}(X)$ of arbitrary complex varieties, and we prove that it is contractible when $X$ is connected and of klt type. In fact, the dual complex belongs to a broader class of invariants, which we call RC (rationally connected)-invariant functors. We prove a rigidity theorem governing the behavior of such functors with respect to rationally connected fibrations.

comments
37 pages; comments welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.30608 ↗

Let $S=S_{2,\ldots,2}\subset\mathbb P^{n+2}$ be a smooth complete intersection of $n$ quadrics containing a line $E$, where $n\geq 3$, and set $D=(n-1)\mathbf h+E$, where $\mathbf h=[\mathcal O_S(1)]$. We study the deformations of smooth curves $C\in |mD|$ and their obstructions. The linear system $|D|$ defines a birational morphism $f:S\to\overline S$ that contracts $E$ to a point and realizes an unprojection in the sense of Papadakis–Reid. When $n=3$, the surface $S=S_{2,2,2}\subset\mathbb P^5$ is a $K3$ surface and $E$ is a $(-2)$-curve. We prove that the complementary open surface $S\setminus E$ admits first-order infinitesimal deformations in $\mathbb P^5\setminus E$ that are obstructed at the second order. Using these obstructions, we show that, for every sufficiently large $m$ with $\operatorname{char} k\nmid m$, there exists a generically non-reduced irreducible component $W_m$ of the Hilbert scheme $\operatorname{Hilb}^{sc}\mathbb P^5$ of smooth connected curves in $\mathbb P^5$. Its general member $C$ lies on a complete intersection $S_{2,2,2}$ of three quadrics, satisfies $C\sim mD$, and has $h^0(N_{C/\mathbb P^5})-\dim_{[C]}\operatorname{Hilb}^{sc}\mathbb P^5=3$. In contrast, when $n>3$, we prove that, for every sufficiently large $m$ with $\operatorname{char} k\nmid m$, the corresponding family of curves in $|mD|$ gives rise to a generically smooth irreducible component of $\operatorname{Hilb}^{sc}\mathbb P^{n+2}$.

comments
27 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.30962 ↗

Let $X$ be a non-stable (in the sense of GIT) hypersurface of degree $d \ge 3$ in the projective space $\mathbb{P}^{n}$. S. G. Park proved that the global minimal exponent of $X$ satisfies the inequality $\widetildeα(X) \le \frac{n+1}{d}$. In this paper, we establish the uniform sharpness of this inequality: we prove that $\widetildeα(X) = \frac{n+1}{d}$ holds for a general member $X$ of every irreducible component of the strictly semistable locus. Moreover, a general point of each irreducible component of the GIT boundary $\partial M^{\mathrm{GIT}}$ admits a strictly semistable zero-weight representative with this minimal exponent. By the lower semicontinuity of the minimal exponent on the affine cone and a theorem of Mustaţă–Popa for general linear combinations of monomials, the problem is reduced to computing the log canonical thresholds, at the cone vertex, of the monomial ideals associated with the maximal strictly semistable supports with respect to a maximal torus and their weight-zero parts. Since the barycenter of the degree-$d$ simplex lies in the convex hull of each of these supports, Howald's formula forces these thresholds to be uniformly equal to $\frac{n+1}{d}$.

comments
12 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.30985 ↗

For a smooth plane quartic $C$, the $3$-Weierstrass points are the $300$ points (counted with weights) at which some plane cubic has contact order at least ten with $C$. Revisiting the work of Kamel and Elshareef, we write the third Veronese Wronskian as an $\text{SL}_3$-covariant form $Ω_3$ of degree $75$, given by a determinant of iterated Hamiltonian derivatives, and explain the special $3$-Weierstrass points through contact cubics and homologies preserving $C$. We determine $Ω_3$ for the Fermat, Komiya–Kuribayashi, Klein and Picard quartics; for the Klein quartic $Ω_3\equivΦ_6^2\,Φ_{21}\,(3Φ_{14}^3+21962\,Φ_6^7)$ modulo the curve, up to a non-zero scalar. Finally, the dectactic points of the Fermat quartic are not $4$-Weierstrass points, which disproves a conjecture of Kamel and Elshareef. All computations are supported by \texttt{SINGULAR} scripts.

fields
Algebraic Geometry
pdf ↗ page arXiv:2610.30992 ↗

This paper establishes the analytic classification of smooth, simple, 3-fold flops, and in the process provides both an intrinsic characterisation and a classification of their contraction algebras.

comments
65 pages
fields
Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2610.31073 ↗

This article overviews recent progress in understanding and classifying one of the most elementary of birational surgeries within algebraic geometry, namely 3-fold flops, through the development of a noncommutative version of singularity theory.

comments
contribution to Proceeding of the ICM 2026
fields
Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2610.31079 ↗

We prove Gamma conjectures I and II of Galkin, Golyshev and Iritani for Milnor hypersurfaces, the smooth hypersurfaces of bidegree $(1,1)$ in the product of two projective spaces. We provide a criterion for Gamma conjecture II for general Fano manifolds, generalizing the criterion by Hu and Ke. Using the mirror symmetry technique of Galkin and Iritani, we establish global Gamma-I for Milnor hypersurfaces, thereby proving Gamma conjecture I as a special case. Using it, together with the Galois action and our criterion, we verify Gamma conjecture II for Milnor hypersurfaces.

fields
Algebraic Geometry
pdf ↗ page arXiv:2610.31150 ↗

We introduce the roots of supercritical Leung–Yau–Zaslow pairs and prove pointwise strong positivity of the associated Schur forms. The resulting LYZ cones contain the pliant cone on smooth projective threefolds, with strict inclusion on a Fujino–Sato threefold. We also establish Hard Lefschetz and Hodge–Riemann relations for the associated Chern classes on compact Kähler manifolds in bidegrees $1\le p+q\le\dim X$ with $\min\{p,q\}\le1$.

comments
37 pages, all comments all welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.31233 ↗

We give a construction of the previously announced family of three-dimensional noncommutative Fano minifolds of Euler degree $72$. We prove that their defining $\mathbb{Z}$-algebras are Koszul and Artin–Schelter regular, and compute the Hilbert series of their section algebras.

fields
Algebraic Geometry
pdf ↗ page arXiv:2610.31250 ↗

In this article, we study log blow-ups in the setting of log adic spaces. As in the theory of log schemes, we prove the existence of global resolutions of toric singularities for fs log adic spaces log smooth over a $p$-adic field, and the acyclicity of certain sheaves under log blow-ups. One new feature of (log) rigid analytic varieties is their integral structure sheaf: we prove that it is also almost acyclic under log blow-ups in the Kummer étale topology. We also supply some foundational results on log adic spaces.

comments
Comments are welcome!
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2610.31265 ↗

We study the cohomology of integral structure sheaves for two types of open rigid analytic varieties: complements of divisors in quasi-compact varieties, and partially proper spaces. As applications, we prove a strengthened form of the Hebbarkeitssatz (Riemann's extension theorem), involving the almost vanishing of $R^1\lim$, and study pro-étale $G$-torsors on open varieties.

comments
Comments are welcome!
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2610.31289 ↗

Let $K$ be a non-Archimedean local field of characteristic different from $2$ and let $V$ be a four-dimensional symplectic $K$-vector space. We study the Penrose incidence correspondence $\mathbb{P}(V) \leftarrow \mathrm{Flag}(1,2;V) \rightarrow \mathrm{Gr}(2,V)$ after Berkovich analytification. The Klein quadric $\mathrm{Gr}(2,V)$ decomposes into the open orbit $\mathrm{Spin}(5)/\mathrm{Spin}(4)$ and the Lagrangian quadric, which parametrize respectively the projective lines transverse and tangent to the standard contact distribution on $\mathbb{P}(V)$. We construct explicit free discrete subgroups $Γ\subset\mathrm{PSp}(V)$ and analytic domains, cut out by Drinfeld upper half-spaces, in all three members of the incidence diagram. Both incidence projections are surjective on these domains, the three $Γ$-actions are free and properly discontinuous, and the Penrose double correspondence descends to the analytic quotients. The quotient of the twistor domain is a contact analytic threefold, and the Grassmannian domain is contained in the analytification of the $\mathrm{Spin}(5)/\mathrm{Spin}(4)$ open orbit.

fields
Algebraic Geometry, Group Theory
pdf ↗ page arXiv:2610.31379 ↗

We refine a bound of Cheng-Feyzbakhsh to prove an asymptotic $Γ$-Bayer-Macrì-Toda ($Γ$-BMT) inequality on every smooth polarized complex threefold. The proof relies on a reduction to small tilt stability parameters. Using this inequality we verify Feyzbakhsh-Thomas's condition $(wBG)$ whenever $K_{X}$ is numerically proportional to the polarization. For polarized Calabi-Yau threefolds, this yields a reduction of positive rank generalized Donaldson-Thomas (DT) invariants to those counting sheaves pure in codimension one. We further express these invariants in terms of rank one generalized DT invariants. Thus, the rank reductions of Feyzbakhsh-Thomas hold without assuming the BMT conjecture.

comments
13 pages, comments/questions welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.31399 ↗

We present a definition of a local height of nef toric divisors in the sense of Yuan and Zhang by approximating a height for canonical divisors and then using the local energy to extend to other metrics on the same geometric divisor.

comments
37 pages
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2610.31442 ↗

We give a geometric proof of the following statement: let $X$ be a smooth hyperkähler fourfold such that the Picard group is generated by a line bundle $L$ that is nef, non-trivial, and not big. If the Kodaira dimension of $L$ is non-negative, some positive multiple defines a Lagrangian fibration. The proof requires a number of tools which are of independent interest, including an analogue of Voisin's unobstructedness result and a smoothing result for singular Lagrangian subvarieties.

comments
105 pages. Comments welcome!
fields
Algebraic Geometry, Complex Variables, Differential Geometry
pdf ↗ page arXiv:2610.31497 ↗

Let $\mathcal{A}$ be an arrangement of $d$ lines in $\mathbb{P}^2_\mathbb{C}$ and let $\mathcal{T}\langle\mathcal{A}\rangle$ be its bundle of logarithmic vector fields. On a general line, $\mathcal{T}\langle\mathcal{A}\rangle$ splits as $\mathcal{O}(-k)\oplus\mathcal{O}(k+1-d)$ with $k=\min\{\mathrm{mdr}(\mathcal{A}),\lfloor\frac{d-1}{2}\rfloor\}$, where $\mathrm{mdr}$ is the minimal degree of a Jacobian syzygy. We prove that $k$ is determined by the intersection lattice whenever $d\le16$, answering in this range a question of Cook, Harbourne, Migliore and Nagel. Since freeness can be read off from $k$ and $c_2(\mathcal{T}\langle\mathcal{A}\rangle)$, this strengthens Terao's freeness conjecture in this range; in particular we obtain a proof of Terao's conjecture for $14$ lines that uses it only for $13$ lines. For any number $d$ of lines, it follows that $\mathrm{mdr}$ is determined by the lattice whenever $\mathrm{mdr}\le6$ and $2\mathrm{mdr}\le d-3$, and that Terao's conjecture holds for every free arrangement whose smaller exponent is at most $7$. The proof reduces the question to critical arrangements: $2s+3$ lines, each containing at most $s+1$ intersection points, with $\mathrm{mdr}=s$. For these, the inflection polynomial of the minimal derivation factors as $Q_\mathcal{A} R$ with $R\in H^0(\mathcal{I}_Z^2(s-3))$, where $Z$ is the zero scheme of the derivation, of length $ν=c_2(\mathcal{T}\langle\mathcal{A}\rangle)-s(s+2)$. For $s\le5$ this forces $ν\le1$, and Chern class arguments then reduce everything to Terao's conjecture for $13$ lines. For $s=6$ we show $ν\le3$, using a Riccati equation along multiple components of $R$, Ziegler's multirestriction, and local computations verified by computer algebra; an exhaustive enumeration of the 26,265,318 candidate lattices with $ν\in\{2,3\}$ that satisfy Bojanowski's inequality completes the proof.

comments
26 pages, 1 table. Theorem B is computer-assisted; the programs, the screening logs, the realizable classes and checksums of the enumeration output are in the ancillary files
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.31556 ↗

The Poisson $T$-Pfaffians of Bott–Samelson varieties, $G/U$, and $G/B$ produce Frobenius splittings, but only by a local, coordinate-bound argument. We isolate the local mechanism: a weighted trace pairing on the deformation space of a fat point, whose top coefficient factors over the blocks. At the members of a presentation, polyvector fields on the base $X$ transfer to the moduli space $M$. Applied to a Poisson bivector, this produces a Poisson bivector, extending Bottacin's structure from surfaces to arbitrary dimension. Applied to a top degree polyvector $s$ and wedged with a transverse Euler frame, it produces an anticanonical section on $M$, which we call the \emph{leafrian}. When $X$ is a Poisson surface, we prove that the leafrian splits the moduli of stable sheaves, of principal $G$-bundles, and of instantons if and only if $s$ Frobenius-splits the base. The mechanism itself is dimension-free. The construction also recovers and generalizes the splittings of the Lie-theoretic examples: the $r$-matrix need not satisfy the classical Yang–Baxter equation.

fields
Algebraic Geometry, Commutative Algebra, Symplectic Geometry
pdf ↗ page arXiv:2610.31619 ↗

We prove that every finite almost simple subgroup that is not simple of the group of birational automorphisms of the three-dimensional complex projective space is isomorphic to one of the following: $\mathfrak{S}_5$, $\mathfrak{S}_6$, $\mathrm{PGL}_2(\mathbb{F}_7)$ or $\mathrm{PGL}_2(\mathbb{F}_9)$. We also prove that the group of birational automorphisms of the three-dimensional complex projective space contains unique (up to conjugation) subgroups isomorphic to $\mathrm{PGL}_2(\mathbb{F}_7)$ and $\mathrm{PGL}_2(\mathbb{F}_9)$.

comments
39 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.31628 ↗

Dynamical Systems18

We study the persistence of integrable structures in real-analytic nearly integrable systems under perturbations that may destroy some, but not all, of these structures. Specifically, we establish upper bounds on the numbers of real-analytic first integrals -- quantities conserved by the motion -- and commuting vector fields -- infinitesimal generators of continuous symmetries -- that can persist under the perturbation. These bounds are expressed in terms of Melnikov-type functions, which quantify the breakdown of the corresponding integrable structures. Unlike classical Melnikov theory, our conditions occur even in the absence of zeros of the Melnikov functions, so they do not necessarily imply the existence of homoclinic tangles. We give a geometric interpretation of these conditions in the context of the Arnold diffusion problem, showing that they imply micro-diffusion. We also obtain a criterion for higher-dimensional nearly integrable systems in which the dimension of the span of the Melnikov vectors restricts the numbers of possible first integrals and commuting vector fields. This shows that the geometry of the Melnikov vectors provides a new mechanism for detecting the breakdown of integrability. We give several applications to integrable Hamiltonian systems subject to forcing and dissipation.

comments
44 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.30354 ↗

We study upper bounds for isolated periodic orbits of generalized Liénard systems on a single potential well. Common-curvature and common-intercept conditions yield uniqueness and hyperbolicity, while a convex–concave condition on the potential-profile slopes gives an upper bound of two. The statements allow finite unequal potential endpoints; appropriate versions also admit degenerate restoring forces and reduced regularity. We prove a uniqueness extension across slope interfaces, a quantitative joint weak-damping criterion, and a compensation criterion controlled by two derivatives. A separate response comparison at neutral cycles, combined with a connected parameter-family argument, gives a coefficient criterion for a two-cycle bound. Applications include classical quartic systems, negative-parameter and positive-parameter Selkov systems, a uniqueness conjecture for arbitrary-degree polynomial systems, and explicit smooth and nonsmooth examples. Existence is proved separately whenever an exact count is asserted. Restrictions to a potential well, a parameter region, or a compact width interval are retained throughout.

comments
66 pages, no figures
fields
Dynamical Systems
pdf ↗ page arXiv:2610.30417 ↗

We construct a smooth Riemannian metric on an arbitrary product of spheres whose geodesic flow is Bernoulli with respect to the Liouville measure.

comments
81 pages, 8 figures. The main text and Appendices A and B occupy pages 1-46. Appendix C on pages 47-80 collects elementary but lengthy proofs of several claims and is intended to serve as a reference. Comments welcome!
fields
Dynamical Systems, Differential Geometry
pdf ↗ page arXiv:2610.30464 ↗

Mechanistic attribution in Earth system science requires quantifying uncertainty and communicating its implications. Here, we develop an uncertainty-aware mechanistic attribution pipeline that constructs probabilistic fingerprints from ensemble estimates, including covariance-aware separation of competing mechanisms, and an evidence ladder that systematically varies the information provided to language models (LLMs). We evaluate this framework in an idealized stochastic system and a coupled El Niño model using controlled interventions and ensemble data assimilation. In the idealized system, numerical separation increases GPT-4o's intervention-label agreement from 0.80 to 0.98, but not GPT-4o-mini's. In the coupled system, both LLMs identify seven of eight fingerprint-ambiguous events when given full fingerprints with verbal interpretations; GPT-4o's false ambiguity reports decrease from 10/82 to 1/82, without consistent gains in intervention-label agreement. For eight historical ENSO events, the uncertainty-aware condition agrees with the model-inferred mechanism labels in seven cases. These findings distinguish uncertainty assessment from its communication.

fields
Dynamical Systems, Mathematical Physics
pdf ↗ page arXiv:2610.30501 ↗

For a countably infinite discrete group $G$, we study subsets of $G$ that contain a neighbourhood return-time set of a minimal point in a $G$-flow $X$. For $e\in F\subseteq G$, we characterize this property by the existence of $e\in A\subseteq F$ such that $\operatorname{Int}_K(A):=\{t\in G:Kt\subseteq A\}$ is right syndetic for every finite $K\subseteq A$, and equivalently by the support of a minimal binary configuration in the Bernoulli shift $2^G$. Additional conditions on $\operatorname{Int}_K(A) \operatorname{Int}_K(A)^{-1}$ characterize realization by minimal flows that are weakly mixing of all finite orders or strongly mixing: for every such $K$, the former requires that for each finite $H\subseteq G$ there is $c\in G$ with $HcH\subseteq \operatorname{Int}_K(A) \operatorname{Int}_K(A) ^{-1}$, whereas the latter requires that $\operatorname{Int}_K(A)\operatorname{Int}_K(A)^{-1}$ be cofinite. We also construct, for every compact metrizable minimal $G$-flow, a free minimal, strongly mixing Cantor flow disjoint from it.

comments
40 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.30554 ↗

A collinear motion of an $n$-body problem is one in which the $n$-bodies always lie along some, possibly moving, geodesic during their evolution. We prove that every collinear motion of $n\geq 3$ bodies in a constant non-zero curvature space is necessarily contained in some fixed constant curvature space of dimension at most three. For natural systems admitting energy and angular momentum integrals, we further show that every such motion is necessarily a relative equilibrium: evolving under uniform rotation while maintaining constant mutual distances. These results extend certain classical results on collinear motions in Euclidean spaces, initiated by P. Pizzetti, to general spaces of constant curvature. The same methods also yield a partial answer to a question of A. Wintner. Namely, we show that any concave and always coplanar motion in the Euclidean 4-body problem, where the moving plane containing the bodies sweeps out an $\mathbb{R}^4$, must be self-similar: maintaining constant mutual distance ratios over the motion.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.30567 ↗

We study two notions of pluripotency for dynamical systems. Strong pluripotency refers to the possibility of reprogramming, by arbitrarily small perturbations, the forward orbits of points in a set of positive Riemannian volume so that they track a prescribed orbit in a uniform time-averaged sense. In contrast, pluripotency, also called ``statistical pluripotency" in this paper, requires only asymptotic agreement of empirical measures. Strong pluripotency implies statistical pluripotency, but the converse need not hold. For $C^r$ transitive Anosov diffeomorphisms, $r\ge2$, we prove that strong pluripotency fails for every nonempty reference set. On the other hand, statistical pluripotency holds for a nonempty reference set if and only if it is contained in the basin of the unique SRB measure. This basin is invariant and has full Riemannian volume, but contains no periodic points. These results reveal a sharp distinction between the two notions even within uniformly hyperbolic dynamics.

comments
10 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.30636 ↗

For every irrational rotation number $α$ of constant type and every $q>1$, we construct a $C^2$ circle diffeomorphism $F$ arbitrarily close to the rigid rotation $R_α$ in the combined $C^2$ and $B^2_{2,q}$ topology whose normalized conjugacy is not Lipschitz. We also prove that $F''\in B^0_{2,1}$ implies global $C^1$ conjugacy. Thus the thresholds in the Besov summability and weak Dini scales are $q=1$ and $γ=1/2$, respectively. These results complement Herman's Baire category theorem on the residual existence of $C^2$ diffeomorphisms without $C^1$ conjugacy by providing quantitative counterexamples and sufficient conditions for differentiable conjugacy.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.30750 ↗

We give a self-contained proof that, for a finite detailed balanced mass-action system with positive rate constants, each positive stoichiometric compatibility class contains exactly one positive equilibrium and every positive trajectory converges to it, together with a Lean 4 formalization of the complete argument from persistence to convergence. Boundedness and persistence come from the barrier argument of OpenAI (2026) for weakly reversible systems: an arbitrary-tolerance affine approximation yields a finite-minimum barrier whose superlevel sets confine trajectories and give one logarithmic bound for all solutions from a given initial state. The Horn-Jackson dissipation identity identifies the positive equilibria as an exponential family with parameters in the orthogonal complement of the stoichiometric subspace, which gives uniqueness in each class. A bounded-speed descent argument replaces LaSalle's invariance principle; it uses neither uniqueness of solutions nor continuous dependence on initial data, and it places every cluster point in that family. The route given here is direct and elementary, and its main theorem is checked by the Lean kernel against explicit definitions. The proofs, the Lean development, and the manuscript were produced in ClawsGO Science, an agent harness that packages a complete research environment: Claude Opus 5.5 made the research decisions, GPT 6 Astra carried them out, and the Lean kernel checked every formal step.

code
github.com/BitMiracle-AI/detailed-balance-gac ∎ Lean project (lean/lakefile.lean, lean/lean-toolchain) builds, no sorry at c0598eb, checked 2026-10-27 build details
comments
23 pages, 1 figure. Lean 4 formalization: https://github.com/BitMiracle-AI/detailed-balance-gac (tag v1.0). Use of AI tools is described in the Acknowledgements
fields
Dynamical Systems
pdf ↗ page arXiv:2610.30808 ↗

We study reflection symmetry in the equal-mass Newtonian \(1+N\) coorbital problem for \(N=5,6,7,8\). We prove that every collision-free solution of the angular central-configuration equations has a reflection axis. As a consequence, every non-coalescent limit of planar central configurations consisting of one dominant mass and \(N\) equal small masses is reflection-symmetric about a line through the dominant body. Our proof combines analytic arguments with rigorous computer-assisted verification. For each possible reflection, we introduce variables that measure the deviation from that reflection and vanish exactly when the configuration has that symmetry. The central-configuration equations yield a symmetric matrix equation in these variables. Concavity of the force derivative and estimates of the resulting quadratic forms reduce the symmetry problem to finitely many rigorously verified inequalities. Although the details depend on \(N\), the same general method applies in all four cases. We also obtain, as a separate result, the complete three-class classification for \(N=5\), up to the natural equivalences.

comments
38 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.31036 ↗

Many models of spatial populations use directed motion towards environmental attractants as a mechanism for spatial pattern formation. While prior approaches typically focus on partial differential equation models for directed motion in continuous space, it is natural to consider the dynamics of biological and social systems on a metapopulation featuring well-mixed local patches and spatial motion between patches. In this paper, we formulate a version of the Keller-Segel model for chemotaxis on a graph metapopulation, modeling a chemoattractant that can diffuse across patches and a population of individuals who move through a biased random walk through comparing chemoattractant levels along edges of the metapopulation network. We also derive a continuum limit for our model describing chemotaxis in a population on patches connected by a graphon, showing that our resulting integro-differential equation model arises as the limit of our discrete patch model for families of large deterministic or random graphs. Through linear stability analysis, we derive conditions on the chemotactic sensitivity required to produce instability of a spatially uniform equilibrium for our Keller-Segel models in terms of the reaction parameters and the eigenvalues of the Laplacian operator for the metapopulation graph or graphon. Through a mix of weakly nonlinear stability analysis, numerical simulations, and analytical bounds on solutions, we can also characterize the form of pattern-forming instability in our graphon model and show how our choice of demographic dynamics for the population and the graphon adjacency function can impact the long-time total population size and chemoattractant concentration achieved in emergent spatial patterns.

fields
Dynamical Systems, Analysis of PDEs
pdf ↗ page arXiv:2610.31049 ↗

We prove that every wandering exposed Julia component of a rational map is a point. Here a Julia component is exposed if it meets the boundary of a Fatou domain. The theorem extends the corresponding result for polynomials to rational maps, without any assumption on critical recurrence. The proof combines an enhanced nest with a covering estimate for multiply connected pullback domains.

comments
28 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.31055 ↗

We establish the full Ledrappier-Young entropy formula for ergodic invariant measures of $C^1$ diffeomorphisms when the positive Oseledets bundles and their nonpositive complement form a dominated splitting. We prove transverse formulas under three-block domination and equality of metric and unstable entropy under positive-nonpositive domination. To complete the proof, we develop a new mechanism for estimating partial entropy through comparisons of conditional information along orbits. Applications characterize vanishing transverse dimension, give upper pointwise dimension bounds and exact dimensionality of hyperbolic measures. In the quasi-isometric-center setting, this implies a $C^1$ invariance principle for measures with nonpositive center Lyapunov exponents.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.31086 ↗

Let $\mathcal F=\{f_i(x)=r_i x+t_i\}_{i=0}^{b-1}$ be a self-similar iterated function system (IFS) on $\mathbb R$ with $b\ge 3$, and let $K_{\mathcal F}$ be the associated self-similar set. Given $m\in\mathbb N$, for any sequence $ω=ω^0ω^1\ldots$ with each $ω^i\in \{0,1,\ldots,b-1\}^m$ a block of length $m$, let \[ K_{\mathcal F}^ω:=π_{\mathcal F}\left(\{(d_i)\in \{0,1,\ldots,b-1\}^{\mathbb N}: d_{k+1}d_{k+2}\ldots d_{k+m}\neω^k\quad\forall k\ge 0\}\right), \] where $π_{\mathcal F}$ is the natural coding map from $\{0,1,\ldots,b-1\}^{\mathbb N}$ to $K_{\mathcal F}$. The set $K_{\mathcal F}^ω$ is called the survivor set of an open dynamical system with a moving hole related to $ω$. When $\mathcal F$ is a homogeneous IFS satisfying the open set condition (OSC), the dimensions of $K_{\mathcal F}^ω$ were determined by the first author, Sun and Wang (Adv. Math., 2026). In this paper we generalize these results to inhomogeneous IFSs. When $\mathcal F$ satisfies the OSC, we give explicit formulae for the dimensions of $K_{\mathcal F}^ω$. In particular, we show that the packing dimension and upper box-counting dimension of $K_{\mathcal F}^ω$ always coincide, while the Hausdorff dimension and lower box-counting dimension of $K_{\mathcal F}^ω$ are not necessarily equal, which is different from the homogeneous case. Furthermore, when $\mathcal F$ satisfies the exponential separation condition and the similarity dimension $s_{\mathcal F}\le 1$, we are able to determine the Hausdorff dimension of $K_{\mathcal F}^ω$. Finally, we apply our results to badly approximable numbers and non-recurrence points in the setting of inhomogeneous IFS satisfying the OSC.

comments
34 pages, 2 figures and 1 table
fields
Dynamical Systems, Classical Analysis and ODEs, Number Theory
pdf ↗ page arXiv:2610.31128 ↗

Model predictive control (MPC) has been applied to wind-turbine regulation with markedly different internal prediction models, ranging from linearized low-order turbine models to nonlinear, aeroelastic, floating, and data-driven predictors. This review organizes the literature primarily by the model propagated by the controller and treats model order, predictor representation, MPC formulation, control objective, and validation plant as separate descriptors. Primary studies show that low-order linear or piecewise-affine predictors are attractive for constrained power and speed regulation, whereas flexible drivetrain, structural, and floating models are needed when drivetrain twist, tower motion, blade loads, or platform dynamics are explicit control quantities. Nonlinear and economic MPC studies further demonstrate coordinated pitch/torque control across broad operating regions, while preview, repetitive, and data-driven formulations address wind prediction, periodic loads, and model mismatch. Particular attention is given to aerodynamic pitch dependence: variable-pitch turbine dynamics can be non-affine with respect to applied pitch, and the term NMPC alone does not prove that the original nonlinear pitch map is retained inside the optimizer. The review therefore adopts a conservative, equation-based classification for direct nonlinear applied-pitch propagation. Here, direct nonlinear applied-pitch propagation means that the applied pitch at each prediction step is evaluated inside the original nonlinear aerodynamic map, rather than replacing that dependence by a linearized, scheduled, piecewise-affine, or learned surrogate. The literature supports a remaining integration challenge at the intersection of flexible drivetrain prediction, nonlinear aerodynamic pitch treatment, explicit constraints and load objectives, and validated adaptive or learned model correction.

comments
Khalili-Amirabadi, R., Jalaeian-Farimani, M., & Ghane, M. (2026). Model Predictive Control of Wind Turbines: A Model-Oriented Review of Prediction Models, Control Objectives, and Nonlinear Aerodynamic Formulations. Journal of Intelligent Monitoring and Control Systems, 1(1): 35-41. https://doi.org/10.65098/jimcs.01.2026.35.41
fields
Dynamical Systems, Optimization and Control
pdf ↗ page arXiv:2610.31295 ↗

We investigate the Typical Periodic Optimization (TPO) Conjecture and freezing phase transitions for Dini potentials and beyond. We show that the TPO conjecture fails already at Dini regularity. We identify a sharp regularity threshold for freezing phase transitions, which we call weak log-log Dini. Both results reveal the stability of aperiodic ground states. Moreover, we identify Dini regularity as the sharp threshold for a quantitatitve analog of the freezing phase transition.

comments
57 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.31327 ↗

Let $2\le m < n$ be integers, and let $K(\mathcal{A})$ be the Bedford–McMullen carpet generated by $\{(x,y)\mapsto((x+i)/m,(y+j)/n):(i,j)\in\mathcal{A}\}$, where $\mathcal{A}$ is a subset of $\{0,1,\ldots,m-1\}\times\{0,1,\ldots,n-1\}$. Write $\mathcal{B}$ for the set of occupied columns, and assume that $\#\mathcal{B}\ge2$ and each column contains at least two symbols of $\mathcal{A}$. At each vertex of the column tree $\mathcal{B}^*$, we independently choose one forbidden symbol from $\mathcal{A}$ according to a prescribed distribution. Let $\mathbb{P}$ denote the resulting product measure on $\mathcal{A}^{\mathcal{B}^*}$. This gives a random survivor set $K_ω(\mathcal{A})$ with $ω\in\mathcal{A}^{\mathcal{B}^*}$. We show that, for $\mathbb{P}$-a.e. $ω$, \begin{equation*} \dim_H K_ω(\mathcal{A})=\frac{1}{\log m}\log\left(\int \sum_{b\in\mathcal{B}}\ell_b(ω)^{\frac{\log m}{\log n}} d\mathbb{P}(ω)\right), \end{equation*} where $\ell_b(ω)$ is the number of surviving symbols in column $b$ at the root.

comments
19 pages, 2 figures
fields
Dynamical Systems, Probability
pdf ↗ page arXiv:2610.31440 ↗

We introduce polytopal substitutions, a recursive procedure for constructing polyhedral approximations of self-similar topological spaces. For a class of substitutions called sub-hyperbolic, we show that the limit of these approximations is naturally homeomorphic to the limit space of the associated iterated monodromy group. We establish a relationship between the $\ell^p$-contraction coefficients of sub-hyperbolic substitutions and the conformal dimension of their limit spaces. In particular, we characterize the conformal dimension in terms of asymptotic moduli and relate these moduli to $p$-energies of graphs.

comments
59 pages, 23 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2610.31530 ↗

Differential Geometry14

We construct a closed surface of genus $2$ with nonpositive Gaussian curvature and a complete nonperiodic flat geodesic asymptotic to a flat closed geodesic. The metric is of class $C^{3,1/3}$ and its curvature is of class $C^{1,1/3}$, but not $C^2$. Thus the periodic-asymptote obstruction for smooth surfaces does not extend to $C^1$ Gaussian curvature.

fields
Differential Geometry
pdf ↗ page arXiv:2610.30707 ↗

In this paper, we study the quermassintegral inequalities for capillary hypersurfaces in a horoball in hyperbolic space. We construct a locally constrained nonlinear curvature flow that preserves the $k$-th quermassintegral while monotonically increasing the $l$-th quermassintegral for any $(1\leq l<k\leq n)$. Using this flow, we establish a full family of the quermassintegral inequalities for horo-convex capillary hypersurfaces in a horoball with contact angle $θ\in(0,π/2]$. Moreover, we weaken the horo-convexity to convexity and obtain the quermassintegral inequalities for convex capillary hypersurfaces between the $n$-th and $l$-th quermassintegrals.

comments
36 pages,1 figure
fields
Differential Geometry
pdf ↗ page arXiv:2610.30771 ↗

We classify locally symmetric hypersurfaces, understood in the intrinsic sense, in Riemannian globally symmetric spaces.

comments
28 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.30848 ↗

We study ancient Ricci flows whose tangent flow at backward infinity is a smooth compact Ricci shrinker. After normalization, every nontrivial solution either converges exponentially or has polynomial decay governed by neutral directions. We recover the finite-dimensional parametrization of the exponentially convergent solutions and establish finite-order asymptotic expansions for all slowly convergent solutions. For principal slow solutions, we obtain a locally bijective finite-dimensional parametrization compatible with diffeomorphisms, parabolic rescaling, and time translation.

fields
Differential Geometry
pdf ↗ page arXiv:2610.30939 ↗

Let $(M^n,g)$ be a smooth closed connected Riemannian manifold of dimension $n\ge3$ with positive Yamabe constant. For any prescribed finite set $Λ\subset M$ containing at least two points, we construct a complete metric on $M\setminusΛ$, conformal to $g$, with scalar curvature $n(n-1)$. At each singularity, the local geometric term in the reduced action comes from the first nonzero homogeneous metric term of degree at most $(n-2)/2$ in finite conformal normal coordinates, or from the mass of the Green function metric when all such terms vanish. We completely solve Schoen's conjecture about singular Yamabe problem.

fields
Differential Geometry, Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.31058 ↗

In this paper, we propose the Chern-Calabi Flow for extremal metrics in conformal Hermitian geometry. After the existence of extremal metric, we consider the existence of global flows to the Chern-Calabi flows for extremal metrics on compact complex surfaces with Gauduchon metrics. To achieve this goal, we use the Adams inequality and the Gronwall inequality method to obtain fourth order derivative norm estimates. We also study the convergence of the global solution to the Chern-Calabi flow and its limit is the solution of the Chern-Calabi extremal metric problem. We propose a fourth order elliptic problem and derive the Bochner formula relevant to the elliptic estimates for the Chern-Calabi heat flow.

fields
Differential Geometry, Analysis of PDEs, Complex Variables
pdf ↗ page arXiv:2610.31068 ↗

We extend Chern-Weil theory to Lie groupoids carrying a Cartan connection. For a principal $(Σ, ω)$-bundle $(P, θ)$ over $X$ we construct a map of differential graded algebras from an $ω$-basic subcomplex of the Weil algebra of the Lie algebroid of $Σ$ to $Ω^\bullet(X)$, whose map in cohomology does not depend on $θ$. It recovers the classical Chern-Weil map for Lie groups, the Cartan model for action groupoids, and the characteristic classes of Cartan geometries for gauge groupoids.

fields
Differential Geometry
pdf ↗ page arXiv:2610.31219 ↗

We show that closed Riemannian 3-orbifolds with positive scalar curvature have virtually free fundamental group. We also build a family of closed 3-orbifolds with free fundamental group of rank 2 which do not admit Riemannian metrics of positive scalar curvature.

fields
Differential Geometry
pdf ↗ page arXiv:2610.31279 ↗

Convex-like submanifolds in the Lorentz-Minkowski spaces are introduced in this paper as a natural and broad generalization of convex surfaces in the Euclidean space. Associated with such a convex-like submanifold in a Minkowski space, we define roofs (which resembles the supporting planes), caps (which are generated by the light rays in the normal bundle), and towers (which revives the notion of interior for such high codimensional objects). As a touchstone of this theory, a volume comparison theorem is proved, which is a non-trivial generalization of the obvious fact that among two nested convex surfaces, the outer one has larger volume. Finally we provide two important applications of this theorem.

comments
31 pages, 4 figures. The authors used ChatGPT to assist in language editing and in reviewing the proofs. The authors take full responsibility for the content of this manuscript. Any comments are welcome
fields
Differential Geometry
pdf ↗ page arXiv:2610.31332 ↗

For a closed embedded minimal hypersurface in a unit sphere, we show that the existence of a uniform vanishing angle in Lawlor's criterion suffices for its cone to minimize area. The normal-wedge condition follows from Howard's rolling theorem. We derive explicit curvature bounds and apply them to the reported Hsiang-Sterling curvature estimates for topologically trivial cones. The resulting area-minimizing cones give an affirmative answer to the existence question raised by Ilmanen and White (Camb. J. Math., 2015).

comments
13 pages, 3 figures, 1 table
fields
Differential Geometry
pdf ↗ page arXiv:2610.31341 ↗

Let $(M^n,g), n\geq 4$ be a close Einstein manifold with positive scalar curvature and $G$ be the Green function of the conformal Laplacian. The ADM mass of the asymptotically flat metric $\hat g:=G^{4/(n-2)} g$ is an important geometric invariant. When either $n=5$ or $n\geq 6$ with Weyl vanishing condition, we prove a mass formula, generalizing Gursky-Malchiodi's formula in dimension $4$. An important step is an extension of Viaclovsky's Green function expansion in higher dimensions. Next we prove a sharp diameter-mass inequality on Einstein manifolds. Finally we present two applications. First, we prove a mass gap theorem for Einstein manifolds. Second, for Collins-Székelyhidi's family of Sasaki-Einstein metrics $g_i$ on $\mathbb{S}^5$ with volume going to zero, the sequence of the masses $m(\hat{g_i})$ blows up uniformly as $i\to\infty$.

comments
25 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.31343 ↗

In this paper, we extend the $L^\infty$ estimates of Guo-Phong for fully non-linear equations on compact hermitian manifolds to a possibly indefinite reference form satisfying a uniform admissibility criterion. Furthermore, we also establish one-sided stability estimates. Neither result requires homogeneity or concavity of the nonlinear operator.

comments
15 pages, comments welcome
fields
Differential Geometry, Analysis of PDEs, Complex Variables
pdf ↗ page arXiv:2610.31453 ↗

We show that there exist exotic spheres with metrics of strictly positive sectional curvature in infinitely many dimensions: in every dimension $n\equiv3\pmod4$ with $n\geq11$ and $n\not\equiv255\pmod{256}$. Previously, every known closed simply connected manifold of positive sectional curvature in a dimension above $24$ was diffeomorphic to a compact rank-one symmetric space. The spheres we consider are certain homotopy spheres arising as quotients of special $S^3$-$S^3$ bundles introduced by Sperança. These homotopy spheres are determined by an orthogonal representation $ρ$ of $S^3$ and an $S^3$-conjugation-equivariant map $β$, and are denoted $Σ_{ρ,β}$. By recent constructions, such spheres admit Riemannian metrics of strictly positive sectional curvature. In this paper we consider the spheres $Σ_{ρ_b,β}$ of dimension $4b+3$, $b\geq2$, where $ρ_b$ is the representation of $S^3$ on $\mathbb{R}^3\oplus\mathbb{H}^b$ by left multiplication on the second summand. For these spheres, we show that the Eells-Kuiper invariant is the product of an integer $k(β)$ depending only on $β$ and a rational number $r_b$ given by one coefficient of a power series built from the $\hat A$- and $L$-genera. We then show that, for every $b\geq2$ with $b\not\equiv63\pmod{64}$, there is a map $β$ for which the Eells-Kuiper invariant does not vanish, and thus the corresponding sphere is exotic. A computer calculation also gives the dimensions $n\equiv255\pmod{256}$ below $2^{16}$.

comments
36 pages, 3 tables. Programs and outputs archived at Zenodo, doi:10.5281/zenodo.23571372
fields
Differential Geometry
pdf ↗ page arXiv:2610.31528 ↗

We study complete embedded translating solitons in R^3 with finite genus and finite entropy. We prove that such collapsed translators whose wings are all of planar type (in a weak topological sense) must be vertical flat planes. In particular, this implies the non-existence result for gluing and doubling constructions involving planes that was conjectured in (14) and announced in (9) as an application of the authors' techniques, under weaker assumptions than previous rigidity results by Khan and Lynch-Tinaglia in (17,19,20). A key ingredient is a sharp new a priori decay estimate in the exterior problem for the horizontal graphical translator equation, showing that bounded solutions to the nonlinear equation, and their gradients, are controlled by multiples of the Green's function of the linear drift Laplacian, regardless of the size of the given L^\infty data. Combined with a graphical description of the infinite ends and the Neves-Tian flux identity, this yields the main rigidity result. As another application, we obtain a full classification of collapsed embedded finite-genus translators of entropy lambda < 3.

comments
36 pages, 2 figures
fields
Differential Geometry
pdf ↗ page arXiv:2610.31669 ↗

Number Theory12

We extend the simultaneous popular polynomial difference theorem of Conlon, Dong, and the author to polynomial shifts along prescribed directions in $\mathbb{F}_p^D$. Let $P_1,\ldots,P_k\in\mathbb{Z}[t]$ be linearly independent polynomials with zero constant terms, and let $v_1,\ldots,v_k\in\mathbb{Z}^D\setminus\{0\}$. We show that, for every $\varepsilon>0$, every sufficiently large prime $p$, and every $A\subseteq\mathbb{F}_p^D$ of density $α$, there exists a nonzero $d\in\mathbb{F}_p$ such that \[ \mathbb{E}_{\underline{x}\in\mathbb{F}_p^D} \mathbf{1}_A(\underline{x}) \prod_{\substack{1\leq i\leq k\\ ω_i=1}} \mathbf{1}_A\bigl(\underline{x}+P_i(d)v_i\bigr) \geq α^{\,1+\sum_{i=1}^kω_i}-\varepsilon \] simultaneously for every $ω\in\{0,1\}^k$. The main new ingredient is a directional arithmetic regularity decomposition adapted to mixed directional box norms.

comments
13 pages
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2610.30335 ↗

We give an elementary proof of the absence of Landau–Siegel zeros with the explicit constant $c=1/100$. For every primitive quadratic Dirichlet character $χ$ of conductor $q\ge3$, each real zero $β\in(0,1)$ of $L(s,χ)$ satisfies $(1-β)\log q>c$. The proof combines integer coefficient counting, polynomial congruences, a paired-tail hyperbola estimate, and a logarithmically weighted comparison of positive sums. All required constants are explicit, and one choice of parameters covers every conductor. The argument uses elementary arithmetic and real summation and integration, without separate zero computations for small conductors.

comments
Comments are welcome
fields
Number Theory
pdf ↗ page arXiv:2610.30476 ↗

Consider a cyclic number field of prime degree $p$. For a fixed degree, there are only finitely many such fields which are norm-Euclidean. When $p=2$ or $3$, these have been completely determined. If instead $p>3$, one can bound the discriminant of such fields from above. We substantially sharpen these upper bounds via an explicit Burgess-type criterion and describe a method for completely resolving other small prime cases.

comments
18 pages
fields
Number Theory
pdf ↗ page arXiv:2610.30621 ↗

We prove that, for $n \in \mathbb{Z}^+$ not a perfect square, the only pairs of positive integers $\{a, b\}$ for which there exists $r \in \mathbb{R}$ such that $r^a + \sqrt{n}$ and $r^b + \sqrt{n}$ are both rational numbers are those of the form $\{a, a\}$ or $\{g, 2g\}$ (with $g$ odd). This resolves an open question presented in the 2023 Simon Marais Mathematics Competition.

comments
6 pages; comments very welcome!
fields
Number Theory
pdf ↗ page arXiv:2610.30658 ↗

We develop algorithms to construct a basis of de Rham cohomology for modular curves and a matrix representing the Hodge filtration required in the quadratic Chabauty method. We do this without requiring an explicit plane model of the curve and instead compute these objects in terms of modular forms. Our approach works for any modular curve; to demonstrate its efficiency, we implement our method for nonsplit Cartan modular curves.

comments
comments welcome
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2610.30703 ↗

This paper completely determines the Gallai–van der Waerden number \(\mathrm{GW}(r;3,3)\) for all integers \(r\ge 3\): \[ \mathrm{GW}(3;3,3)=\mathrm{GW}(4;3,3)=9,\qquad \mathrm{GW}(r;3,3)=r\quad (r\ge 5). \]

fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2610.30711 ↗

We present a counterexample, produced by OpenAI, to Littlewood's 1961 theorem on $L^α$-flat polynomials. The theorem asserts that no $L^α$-flat polynomials exist within the class of trigonometric polynomials of the form$$\sum_{m=1}^{n} a_m \cos(mθ+α_m), \qquad n \in \mathbb{N}^*,$$satisfying$$k\, n^2 \sum_{m=1}^{n} a_m^2 \;\leq\; \sum_{m=1}^{n} m^2 a_m^2,$$where $k$ is an absolute constant (alternatively expressed on the right-hand side as $K = 1/k$). We show that OpenAI's counterexample is contained within the class of hyper-lacunary sequences. Consequently, it offers only a limited refutation, as such sequences fail to satisfy an implicit assumption of Littlewood's theorem. We also discuss broader questions surrounding this counterexample and provide a brief historical overview.

comments
9 pages. 4 quotations. 14 references. Comments, feedback and collaboration are welcome
fields
Number Theory
pdf ↗ page arXiv:2610.30797 ↗

Let $ξ$ be a real algebraic irrational number and $p(n,ξ,b)$ the number of distinct blocks of length $n$ in its base-$b$ expansion. Bugeaud and Evertse proved in 2008 that $p(n,ξ,b)/(n(\log n)^η)$ is unbounded for every $η<1/11$. We prove this for every $η<1/4$. We also prove the analogous bound for the continued fraction expansion of an algebraic number of degree at least three, with every exponent $δ<1/4$. Bugeaud announced this statement in 2013 with an unspecified $δ>0$. Finally, the subword complexity of the steering word of $(3/2)^n$ exceeds $C\,k(\log k)^η$ infinitely often for every $η<1/4$ and every $C$. The three proofs share one count: $\varepsilon^{-1}$ classes times $\varepsilon^{-3}$ subspaces from the quantitative Subspace Theorem of Evertse and Ferretti. The subspaces are then disposed of at the cost of a logarithm, with no further power of $\varepsilon^{-1}$. All three results, and the quantitative Subspace Theorem they rest on, are machine-verified in Lean~4.

fields
Number Theory
pdf ↗ page arXiv:2610.30937 ↗

We give a determinant proof that every nonzero real period of a nonsingular elliptic curve over $\mathbb Q$ with complex multiplication, measured with a specified nonzero rational invariant differential, has irrationality exponent two. The proof uses an integral origin chart, matched local lengths, an actual compactification and weighted packet map, and arithmetic and analytic estimates for the same selected minor on a rectangular sublattice of the full CM period lattice. For the integral-defined lemniscate period $Ω=2\int_0^1(1-t^4)^{-1/2}\,dt$, we also give the uniform bound $μ(Ω^n)=O(n\log(2n))$ for integers $n\geq1$. Its new arithmetic ingredient clears integration denominators prime by prime while retaining the coefficient order; a one-root norm argument and an analytic estimate at algebraic centers complete the power proof. The two arguments are presented with their different charts and exact dependencies. Lean verifies the new CM determinant argument and rational normalization relative to explicit classical uniformization, CM-lifting and theta inputs; the lemniscate-power endpoint is also verified. The formalization record states the exact classical boundary and theorem references.

fields
Number Theory
pdf ↗ page arXiv:2610.31112 ↗

Let $\mathrm{F}/\mathbb{Q}_p$ be a finite extension with $p\ne 2$, and let $V$ be a quadratic space over $\mathrm{F}$ of dimension at least two admitting a self-dual lattice. We prove the local arithmetic Siegel-Weil formula for GSpin Rapoport-Zink spaces formulated by Li and Zhang. We use the global-to-local strategy of Mihatsch and Zhang and its application by Luo. Using a generalization of the prismatic realization functor of Imai, Kato, and Youcis, we construct and study derived special cycles on integral models of SO Shimura varieties and their Rapoport-Zink uniformizations. We derive the local intersection formula from the modularity of special cycles on the generic fiber. As a first application, we prove the corresponding semi-global arithmetic Siegel-Weil identity for orthogonal Shimura varieties over a totally real field $F\ne\mathbb{Q}$.

comments
117pages
fields
Number Theory
pdf ↗ page arXiv:2610.31173 ↗

Let k be a number field. We prove that for every quadratic extension F/k, every real zero beta of L(s, chi_{F/k}) satisfies (1 - beta) log d_F >= c(k) with an effective constant c(k) > 0, and we deduce (through a reduction of Stark) that the Brauer-Siegel theorem holds effectively and uniformly over all Galois extensions K of k, in the form h_K R_K >= c(k) d_K^{1/2} / ((2 pi)^{[K:Q]} log d_K). Stark's effective cases of the Brauer-Siegel theorem were the fields without quadratic subfields, since the quadratic subfields carried the ineffectivity of Siegel's theorem; over a base field k, the first result removes it. Both rely on a uniform bound for Chebotarev sums. Let K/k be a Galois extension with group G, and suppose S is a subset of G containing the identity. For any prime p of k, let delta_p be the proportion of the primes of K above p whose Frobenius lies in S. Then the sum over Np <= X of delta_p log Np / Np is at most (|S|/|G| + epsilon) log X + O(1), uniformly in K, as soon as X >= d_K^C with C depending only on epsilon and the degree [K:Q]. The proof is Kerr's form of the OpenAI argument, simple vanishing at the points (iota theta)_{iota in S}, with theta in a box in O_K, and Masser's zero estimate. The field enters only through Masser's invariant of the lattice of points, which we compute to be [K:Q]/|S| by averaging over the Galois group of the normal closure. Over Q, the determinant method of Green, Barreto, and Kominers gives sharper Chebotarev bounds, and we explain the comparison.

comments
19 pages, 6 diagrams
fields
Number Theory
pdf ↗ page arXiv:2610.31402 ↗

Let $E/\mathbf{Q}$ be an elliptic curve, let $K=\mathbf{Q}(\sqrt{D})$ satisfy the Heegner hypothesis with $D<-4$, and fix a modular parametrization $\varphi$ with $\varphi(\infty)=O$. Under surjectivity modulo $2^L$, with $L\ge 2$, and a cohomological exclusion condition at level $4$, we construct a finite set of primes $T$ such that, writing $d_T=\prod_{q\in T}(-q)$ and $n_T=\prod_{q\in T}q$, the $2$-Selmer dimensions of $E^{d_T}$ and $E^{d_TD}$ are $0$ and $1$. The support size is bounded in terms of the initial Selmer dimensions, independently of $L$. Inspired by the work of Tian and Tian–Yuan–Zhang on congruent numbers, we construct a point $Q_T$ on the terminal twist and identify its Kummer class with the standard mod-$2$ Kolyvagin class. Using the low-corank $2$-converse and the $2$-primary Birch–Swinnerton-Dyer formula, we prove that its index $m_T$ in the full Mordell–Weil lattice satisfies $v_2(m_T)=v_2(c_\varphi)+\mathfrak{i}(E,K)$. The optimal Manin constant theorem supplies a $2$-indivisible parametrization $\varphi_0$, for which $κ^{\mathrm{std}}_{n_T,1}(\varphi_0)\ne 0$ if and only if $\mathfrak{i}(E,K)=0$. When the intrinsic index vanishes, the minimum terminal support size is $R=\min\{d_2(E),d_2(E^D)\}$, and the normalized standard classes have order $2^M$ for $1\le M\le L$. Full $2$-adic Galois image then gives strong nonvanishing.

comments
56 pages, 4 tables
fields
Number Theory
pdf ↗ page arXiv:2610.31631 ↗

Classical Analysis and ODEs9

Building on the work of A. Córdoba and R. Fefferman, we provide a necessary and sufficient covering condition on a basis $\mathcal{B}$ on a separable metric space $X$ with a Borel measure $μ$ so that the associated \mbox{geometric} maximal operator $M_\mathcal{B}$ satisfies for all $α> 0$ the weak type estimate $$μ\left(\left\{x \in X : M_\mathcal{B}f(x) > α\right\}\right) \leq \int_{X}Φ\left( γ_\mathcal{B} \left|\frac{f}α\right|\right)\,dμ\;,$$ where $Φ: [0, \infty) \rightarrow [0, \infty)$ is an everywhere finite Young's function.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.30327 ↗

We study finite-difference operators of the form \[ D(f,h)=\sum_{k=1}^n a_k f(b_kh), \] where the coefficients may be complex and the nodes are real. Ash, Catoiu, and Csörnyei characterized the finite differences for which \[ D(f,h)=o(h)\quad\Longrightarrow\quad f(h)=o(h) \] holds for every measurable real-valued function. We extend their counterexample theorem to complex-valued functions defined on \(\mathbb C\). Except for the same exceptional four-term configuration, we construct a Lebesgue measurable function \(f\) such that \[ D(f,h)=0\qquad\text{for every }h\in\mathbb C, \] while \(f(h)\not=o(1)\) as \(h\to0\). The counterexamples are supported on countable multiplicative subgroups. The construction is based on zeros of Laurent polynomials and multiplicative characters, and avoids the infinite-dimensional linear-algebra argument used in the earlier proof.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.30583 ↗

In this paper, we study the boundedness of $M_{A^{-1}}$, the maximal operator involves an invertible matrix, on the weighted variable spaces $L^{p(\cdot)}(w)$, where the weights are in an appropriate class. In general, we obtain the necessary conditions for the weight classes and exponents. However, for certain types of invertible matrices, we characterize the weights such that the boundedness holds.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.30603 ↗

Building on the technology developed in \cite{Deb-qik}, we establish a quantified Tauberian theorem under a flexible Wiener-Ikehara Tauberian condition and under several types of boundary behavior for the Laplace transform.

comments
21 pages
fields
Classical Analysis and ODEs, Number Theory
pdf ↗ page arXiv:2610.31016 ↗

For $p\geq2$ and $r\geq 1$, we prove the sharp strong $r$-variation estimate for solutions to the free Schrödinger equation $$ \bigl\|V^r_{[0,1]}\{e^{itΔ}f\}\bigr\|_{L^p(\mathbb R^2)} \lesssim \|f\|_{H^s(\mathbb R^2)}. $$ The estimate holds if $s> s(p,r)$ and fails if $s< s(p,r)$, where $$s(p,r)=\max\left\{ \frac{2}{r}+\frac{1}{p}-\frac12,\, \frac{2}{r}-\frac{2}{p},\, \frac{1}{p}+\frac{1}{r},\, \frac{2}{p}-\frac13,\, 1-\frac{2}{p} \right\}.$$ In particular, $s(3,\infty)=1/3$. Thus our result yields a sharp variational extension of the two-dimensional Schrödinger maximal estimate of Du, Guth, and Li [{Ann. Math.}, 186, 607–640 (2017)]. The proof employs fractal restriction estimates to eliminate the regularity loss originating from the summation in the variation norm.

comments
36 pages
fields
Classical Analysis and ODEs, Analysis of PDEs
pdf ↗ page arXiv:2610.31099 ↗

We establish an endpoint weighted Fourier estimate under a vanishing restriction condition on the unit sphere. Let $n \geq 2$ and $p_c = 2(n+1)/(n+3)$. We prove that every $f \in L^{p_c}(\mathbb{R}^n)$ with zero spherical Fourier restriction satisfies $$ \left\| \bigl|1-|ξ|^2\bigr|^{-1/2}\widehat{f}(ξ) \right\|_{L^2(\mathbb{R}^n)} \leq C_n \|f\|_{L^{p_c}(\mathbb{R}^n)}, $$ where the restriction condition is understood through the continuous Tomas–Stein restriction operator. This result gives a negative answer to Goldberg's counterexample-existence question and supplies a missing endpoint.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.31353 ↗

We derive integral representations for the $n$-th derivative with respect to the order of Bessel functions of the first, second and third kinds, as well as the modified Bessel function and the Macdonald function. Based on these integral representations, we have developed a highly-efficient algorithm for the numerical evaluation of these derivatives with respect to the order, applicable to any complex argument and any real order.

comments
27 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.31368 ↗

We establish the stability of the optimal non-endpoint Fourier restriction range under smooth flat perturbations of curved-root surfaces in $\mathbb R^3$. Specifically, we consider graphs of $$φ(x_1,x_2)=(x_2-x_1^m)^n+R(x_1,x_2),$$ where $m,n\ge2$ are integers and $R$ is smooth and flat at the origin. On a sufficiently small neighborhood depending on the perturbation, we prove the local $L^p(\mathbb R^3)\to L^2(S,dσ)$ restriction estimate for $1\le p<p_c$, where $$p_c=\frac{q_c}{q_c-1}, \qquad q_c=\max\left\{2+\frac{2mn}{m+1},2n\right\}.$$ If the nonnegative localizing density is positive at the origin, an adapted-box example shows that the estimate fails for $p>p_c$. Thus arbitrary smooth flat perturbations preserve the optimal restriction range away from the critical endpoint. For $n\ge3$, the main local estimate combines planar curve decoupling with a one-dimensional finite-type extension estimate, whose principal scale factors cancel exactly. For $n=2$, we prove a uniform $C^4$ perturbation estimate using a weighted convolution bound and an anisotropic Whitney decomposition. Anisotropic rescaling and summation complete the proof.

fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.31389 ↗

It is well known that $u_0 \in L^2(\mathbb{R}) \setminus \{0\}$ is an extremizer for the $L^8_t L^4_x$-Strichartz estimate if and only if it is a Gaussian. We show that every extremizing sequence of even functions $\{ u_n \} \subset L^2(\mathbb{R}) \setminus \{0\}$ approaches a centered Gaussian in an appropriate sense. This result follows from a certain inequality for coordinate-wise even $L^2$ functions on $\mathbb{R}^4$ conjectured by Gonçalves (2019) which we prove in this paper with the optimal constant.

comments
18 pages
fields
Classical Analysis and ODEs, Analysis of PDEs
pdf ↗ page arXiv:2610.31543 ↗

Functional Analysis9

We establish a geometric (Fefferman–Chang-type) atomic characterization of the two-parameter Hardy space associated with a pair of Schrödinger operators $L_i=-Δ+V_i$ on $\mathbb R^{n_i}$, $i=1,2$. The space is defined by the product conical square function. We assume comparability of neighbouring covering cubes, a local bound on the potentials, and decay of the semigroup mass at large scales. We prove that the Hardy norm is equivalent to a sum of classical local product Hardy norms at scales determined by the adapted coverings. This localization formula yields an atomic decomposition whose atoms satisfy size and partial cancellation conditions, with cancellation required only below the corresponding local scales. Both the atoms and their rectangular components remain supported inside fixed enlargements of the covering rectangles. The proof combines one-parameter Schrödinger Hardy space characterizations with standard vector-valued arguments and a localized product atomic decomposition with uniform control of scales and supports. The assumptions cover the model case of reverse Hölder potentials $V\in RH_q$, $q>n/2$, as well as potentials outside every $RH_q$ class, $q>1$, including half-space indicators and exponential potentials.

comments
37 pages, 1 figure
fields
Functional Analysis
pdf ↗ page arXiv:2610.30459 ↗

This survey provides a concise overview of matrix triangle inequalities. Classical topics, such as inequalities for unitarily invariant norms, are revisited from a different perspective, with a particular emphasis on unitary orbit inequalities and various notions of matrix moduli. The exposition progresses from elementary results to much more recent developments, highlighting the evolution of the subject and its ongoing directions of research.

comments
accepted in Reviews in Mathematical Physics
fields
Functional Analysis
pdf ↗ page arXiv:2610.30538 ↗

For \(0<p<1\) and \(μ>1\), every \(d\)-dimensional subspace of \(L_p\) embeds linearly into \(\ell_p^{\lfloorμd\rfloor}\) with distortion at most \(C(p,μ)(\log(d+2))^{1/p}\). If its Rademacher type \(q\) constant is at most \(T\), where \(p<q\leq2\), the distortion is at most \(C(p,q,μ)T\), independently of \(d\). We also give explicit bounds as \(μ\downarrow1\). This answers the question of Johnson and Schechtman concerning the extension of their very tight embedding theorem below exponent one. The proof combines compression at a lower exponent with a change of density that preserves the number of coordinates, and applies over both scalar fields.

comments
21 pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.30546 ↗

We solve a problem posed by Hu and Virtanen by characterizing, for every $0<p<\infty$, the bounded symbols $f$ for which $T_f^{(t)}T_g^{(t)}-T_{fg}^{(t)}$ tends to zero in the unnormalized Schatten $p$-norm or quasi-norm as $t\to0^+$ for every fixed bounded $g$. The setting is weighted Fock spaces over $\mathbb C^n$ with weights whose real Hessians are uniformly positive and bounded. Only constants satisfy the limit when $p<2n$; at $p=2n$, it is equivalent to the weak real gradient belonging to $L^{2n}(\mathbb R^{2n})$. When $p>2n$, the limit is characterized by relative weak compactness in $L^1(\mathbb R^{2n})$ of normalized local mean oscillation densities. For $p\ge2$, uniform convergence over $\|g\|_\infty\le1$ is equivalent to vanishing density mass. A continuous compactly supported counterexample for $p>2n$ shows that bounded density mass and convergence for $g=\bar f$ do not imply convergence for every fixed bounded $g$. The symbol classes are weight-independent unital algebras, yielding limits for finite Toeplitz products and commutators; quantitative Hölder estimates also give finite-rank approximation bounds. The Gaussian case transfers to anti-Wick quantization by unitary equivalence. On compact Kähler manifolds with positive line bundles, we prove a Hölder sufficient condition, including the endpoint, for each fixed bounded second symbol. A projective-line example shows that trace norm convergence can fail for a smooth first symbol and a fixed bounded second symbol. The proofs combine local holomorphic approximation, Schatten and Sobolev estimates, singular integral methods, and the Dunford–Pettis criterion.

comments
88 pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.30787 ↗

We study ordinary and completely bounded norms of radial Schur multipliers on trees. On the homogeneous tree of countably infinite degree, we show that boundedness implies complete boundedness. The argument realizes arbitrary matrix amplifications of a shifted Toeplitz symbol inside rectangular corners of the original multiplier. It also applies to some locally finite trees of unbounded degree. Consequently, the completely bounded radial multiplier theorem of González-Pérez, Parcet, Pérez García and Wang has no general counterpart with ordinary norms. We also determine the optimal order of the comparison constant for positive definite even symbols. For each $1 < p < \infty$ with $p \neq 2$, we construct radial symbols on finitely generated nonabelian free groups, supported in the ball of radius $N$, whose completely bounded Herz–Schur norms remain bounded as $N \to \infty$, whereas their ordinary Fourier multiplier norms grow at least like $N^{|1-\frac{2}{p}|}$. For each fixed $0 < \vartheta < π$, we also determine the exact order $t^{-|1-\frac{2}{p}|}$ of both the ordinary and completely bounded Fourier multiplier norms of the damped radial phases $s \mapsto \mathrm{e}^{(-t+\mathrm{i}\vartheta)|s|}$ as $t \to 0$. Finally, we compute the local amenability modulus of free balls, we bound the Fourier–Schur ratio of free balls from above and below in terms of this modulus, and we show that its restriction to radial symbols grows polynomially in the radius.

comments
31 pages
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2610.30832 ↗

We study weighted sampling of operator orbit frames in infinite dimensional separable Hilbert spaces \(H\), keeping the operator and generating vectors fixed. Let $N_μ(R)$ count the sampling times in $[0,R]$. For a single orbit of a positive operator, let $m_A(R)$ count the eigenvalues in $(0,e^{-1/R}]$. Every real sampling design that preserves the frame property must satisfy the lower bound $N_μ(R)\ge m_A(R)-O_μ(1)$. Conversely, for every $η>0$, we construct an integer sampling design that preserves the frame property and satisfies $N_μ(R)\le(1+η)m_A(R)+O_η(1)$. Thus the coefficient $1$ is optimal. Under additional spectral conditions, we attain $N_μ(R)=m_A(R)+O(1)$ and characterize the weights that preserve the frame property on the constructed sets. For finitely or countably many orbits of a positive operator, let $P_j$, $j\ge1$, be the spectral projection corresponding to $2^{-j-1}<-\logλ\le2^{-j}$ and define $K_A(R)=\#\{j\ge1:2^j\le R,\ P_j\ne0\}$. Every real sampling design that preserves the frame property satisfies $N_μ(R)\ge c_μK_A(R)-C_μ$ for $R\ge2$, with constants $c_μ>0$ and $C_μ\ge0$. Conversely, we construct an integer sampling design that preserves the frame property and satisfies $N_μ(R)\le L K_A(R)+L$ for $R\ge2$, where $L$ depends only on the bounds of the given orbit frame. For normal operators of norm one, we prove that the smallest frame condition number is attained among integer sampling designs that preserve the frame property and satisfy a prescribed counting bound, whenever this class is nonempty. Finally, we construct one normal operator with two families of generating vectors for which the optimal growth orders of $N_μ(R)$ are $\log R$ and $R$, respectively, for both real and integer sampling.

fields
Functional Analysis
pdf ↗ page arXiv:2610.31278 ↗

We prove that every bounded truncated Toeplitz operator on a Hardy model space admits a bounded symbol if and only if its defining inner function is one-component, meaning that it has a connected sublevel set at some level in $(0,1)$. This resolves the bounded symbol conjecture of Baranov, Chalendar, Fricain, Mashreghi and Timotin and, through known equivalences, the embedding and weak factorization conjecture of Baranov, Bessonov and Kapustin. A uniform bound $R$ for the ratio of least bounded symbol norm to operator norm on the rank-one family associated with point evaluation in the disk already forces this geometry. The corresponding bound for all bounded truncated Toeplitz operators is at most $CR\log(e+R)$, where $C$ is absolute, and the logarithmic factor is optimal. In a nonzero de Branges space, the same geometric condition characterizes when every sufficiently small equivalent change of norm preserving the de Branges structure is represented exactly by reweighting the original integral with a positive density bounded above and away from zero. This characterization remains valid when the norm changes are restricted to discrete sampling norms. Outside the one-component class, every model space admits self-adjoint trace class truncated Toeplitz operators without bounded symbols, with arbitrarily small norm and singular values satisfying any prescribed positive upper bounds.

comments
29 pages. All results first posted 7 Oct 2026, https://doi.org/10.5281/zenodo.23214254
fields
Functional Analysis, Complex Variables
pdf ↗ page arXiv:2610.31382 ↗

Let $\mathcal H=\ell^2(\mathbb Z)$ and let $\mathbb Z$ act by bilateral shifts. We prove that the quotient $\mathbb S(\mathcal H)/\mathbb Z$ of the unit sphere, equipped with its quotient metric, has infinite Hilbert distortion. Consequently, $\mathcal H/\mathbb Z$ does not admit a bilipschitz embedding into Hilbert space, answering a question of Cahill, Iverson, and Mixon. The proof first embeds every flat torus $\mathbb R^n/L$, after rescaling, into the quotient $\mathbb S\big(\ell^2(\mathbb Z^n)\big)/\mathbb Z^n$ with distortion arbitrarily close to $1$, where $\mathbb Z^n$ acts by translations. We then show that every finite subset of this quotient embeds into $\mathbb S(\mathcal H)/\mathbb Z$ with distortion arbitrarily close to $1$. The lower bounds of Khot and Naor for the Hilbert distortion of flat tori then imply the result.

comments
The proof of the main theorem was found using OpenAI's ChatGPT 5.5
fields
Functional Analysis
pdf ↗ page arXiv:2610.31468 ↗

We develop a method for studying centralizers of generic elements in some large Polish groups. We identify a condition which enables us to show that the range of each power map is comeager; a strengthening of this condition allows us to prove that a generic element embeds in a flow (a continuous, one-parameter subgroup). This approach enables us to answer the question that motivated this work : we prove that a generic isometry of the Urysohn space (or the Urysohn sphere) embeds in a flow. We also obtain information on the centralizer of a generic isometry; we show that it contains an infinite-dimensional torus and that torsion elements are dense in it. To illustrate the flexibility of our method, we apply it to two other Polish groups. The first is the group of measure-preserving automorphisms of a standard probability space, and we recover results of King and of de la Rue and de Sam Lazaro. Finally we apply our technique to the group of nonsingular automorphisms of a standard probability space, and we deduce that a generic nonsingular automorphism embeds in a flow, answering a question of Danilenko and Silva.

fields
Functional Analysis, Group Theory, Logic
pdf ↗ page arXiv:2610.31548 ↗

Logic8

It is known, by works of Werner and Carneiro, that the type theory of Lean (and indeed of CIC plus a version of choice) is equiconsistent with ZFC plus "there are infinitely many strongly inaccessible cardinals". We prove a finer connection between these two formal systems; namely, given any formula in the language of second order arithmetic, that formula is provable in the aforementioned extension of ZFC if and only if the same formula, when viewed as a type in Lean, is inhabited.

comments
This work has been presented at ICMS 2026 on 23 July 2026
fields
Logic
pdf ↗ page arXiv:2610.30433 ↗

In this article, we use the PBNF-transform, or Polynomial Boolean Normal Form, described earlier in two articles and now extended to higher arity, to solve Boolean satisfiability problems (SAT), which are part of the P versus NP problem. SAT consists of a statement of conjunctions of clauses, and in our SAT-solving models, we dualize the logical equations, inverting the problem by \emph{multiplying} letters (literals) in the transferred clauses, now phrases: $pqrs\cdots s_{\ell}$, and using a binary iterated composition based on \emph{adding polynomials} for the conjunctions in our solution formula. We obtain Polynomial Boolean Equations, PBE=0, by also renaming the truth value $1\mapsto 0$(T). To find a solution, we look for repeating literals in the clauses to factor out. With reversed literal repetition, we can even reduce the CNF to the sum of the transformed clauses.

fields
Logic
pdf ↗ page arXiv:2610.30523 ↗

For every right-c.e.\ real $p\in(1,2)$, $L^p[0,1]$ has a computable presentation. The proof combines an effective stability modulus for almost isometric embeddings with a Fraïssé-style construction in which the exponent varies. In the same range, if $\ell^p$ has a computable presentation, then $p$ is computable. Combining these with the known results gives the computable presentability classification for all separable Lebesgue spaces. We also formulate an effective Fraïssé theorem for Banach spaces and apply it to obtain a computable presentation of the Gurarij Banach space.

fields
Logic, Functional Analysis
pdf ↗ page arXiv:2610.30565 ↗

Let 2 be the two-element structure in the empty signature. We build a computable presentation Q of the Borel randomization $2^{[0,1)}$ in which neither constant random variable is a computable point. Consequently, Q is not aware. This gives a negative answer to a question of Cuervo Ovalle and Goldbring \cite{CG}. We also construct a countable structure $M$ with no computable presentation but $M^{[0,1)}$ has a computable presentation. This answers another question and establishes the necessity of the awareness condition stated in one of the main theorems in \cite{CG}.

fields
Logic
pdf ↗ page arXiv:2610.30569 ↗

We study the analytification and tropicalization of algebraic varieties over valued fields via Jun's spaces of hyperfield points. Our main new objects are a family of power-tropical hyperfields $H_n$ and their inverse limit $H$, recording at each level the class of a leading term modulo $n$-th powers of the residue field. They yield an enhanced tropicalization of the associated space $X(H)$, strictly finer than the Berkovich one exactly when the multiplicative group of the residue field is non-divisible: it specialises to the Berkovich analytification when the residue field is algebraically closed, to the real analytification of Jell-Scheiderer-Yu when it is real closed, and to a new $p$-adic analytification when it is $p$-adically closed. Over henselian valued fields of equicharacteristic $0$ we then construct a model-theoretic avatar of $X(H)$: the space $\widehat{X}_T$ of definable types orthogonal to the value group, which sharpens the geometry in the spirit of Hrushovski and Loeser and recovers their space over algebraically closed valued fields. We show that $\widehat{X}_T$ is strictly pro-definable, satisfies a model-theoretic Payne theorem, and definable compactness in such spaces satisfies a Heine-Borel type characterization. As an application, we analytify $p$-adic semi-algebraic sets and prove a strong density theorem for their tropicalizations, the exact $p$-adic counterpart of the real one of Jell-Scheiderer-Yu.

fields
Logic, Algebraic Geometry
pdf ↗ page arXiv:2610.30762 ↗

After defining the concept of inevitability for statements with the modal logic of forcing, we raise the question of which statements are inevitable under $\mathsf{ZFC}$ and under large cardinal hypotheses. We show that $\mathsf{SOA}$ (defined as $\mathsf{ZFC}^-$ + $\mathsf V=\mathsf{HC}$) plus the $\boldsymbolΣ^1_2$-perfect set property is $\mathsf{ZFC}$-inevitable, and that Projective Determinacy is inevitable in the theory of $\mathsf{ZFC}$ with a proper class of Woodin cardinals. We then discuss the possible conceptual significance of these results for the foundations of set theory.

comments
20 pages
fields
Logic
pdf ↗ page arXiv:2610.31040 ↗

Rosendal proved that any $K_σ$ equivalence relation is Borel reducible to $\ell_\infty$. We prove that for every $F_σ$ equivalence relation $F$ on a Polish space, there is an $F_σ$ real linear subspace $H$ of $\ell_2$ such that the coset relation $x\mathrel{E_H}y$ if and only if $x-y\in H$ has no Baire-measurable reduction to $F$. In particular, there is no $F_σ$ equivalence relation universal under Borel reducibility for all $F_σ$ equivalence relations. This answers a question of Rosendal.

comments
17 pages
fields
Logic
pdf ↗ page arXiv:2610.31052 ↗

In this paper, we prove that the set of groups satisfying the minimal condition on centralizers is a complete co-analytic subset of the Polish space of countable groups. This answers a question of Wesolek and Williams.

fields
Logic, Group Theory
pdf ↗ page arXiv:2610.31601 ↗

Statistics Theory7

An F-type normal-reference calibration is developed for testing equality of two high-dimensional covariance matrices with unknown means. The test statistic is a ratio whose numerator measures the Frobenius covariance discrepancy and whose denominator estimates its null expectation. Their difference is the complete Li-Chen statistic. Under suitable moment and trace conditions, we establish a Gaussian-reference approximation. After standardization, the statistic and its reference share the normal or nonnormal limits determined by a convergent normalized spectrum. The reference is a ratio of independent chi-square-type mixtures. Applying Welch-Satterthwaite matching to its two components gives an ordinary F approximation, with degrees of freedom estimated from independent four-observation blocks. The effect of estimating the population means is controlled by an exact expansion, and local-power and consistency results are established. The ordinary F approximation is asymptotically valid under a diffuse spectrum, whereas a covariance spike can produce a nonvanishing approximation error. Simulation studies examine empirical size and power under normal and nonnormal sampling. Averaging the trace estimates over fixed partitions improves their stability, but does not remove size inflation in the strongly correlated settings.

comments
50 pages, 2 figures. Includes appendices and ancillary code
fields
Statistics Theory
pdf ↗ page arXiv:2610.30497 ↗

In this paper, we use the Feature Space Decomposition (FSD) method to establish an explicit, non-asymptotic, instance-optimal convergence rate for the estimation error of the LASSO in the Gaussian linear regression problem for any signal, any diagonal covariance and any regularization parameter above $σ_ξ/\sqrt{N}$ where $σ_ξ$ is the noise variance and $N$ the number of data.

fields
Statistics Theory
pdf ↗ page arXiv:2610.30622 ↗

Local conditional predictions from a black box need not admit a common joint distribution. We study two aspects of their coherent projection: finite-access precision and directional fidelity. For arbitrary deterministic binary conditional tables, we establish matching expected minimax excess conditional-Kullback–Leibler risk $Θ(\min\{R\sqrt{d/B},d^2/B\})$ under independent uniform exact-table queries, with repeated draws charged, for a local bounded pairwise joint class. The result holds for sufficiently large $d$, $R\sqrt d\le M_0$, and $Cd^3\le B\le(d2^{d-1})^{1/3}$, where $M_0$ is fixed. A moment estimator attains the upper bound. The main technical contribution is a matching lower-bound construction that respects shared pairwise interactions and frozen exact-table responses, with comparison to the best projection of the same realized table. We then examine directional fidelity in a computable hard-marginal formulation that preserves direct black-box marginals. A preregistered TabPFN-v2 case study combines a Car anchor with a frozen two-dataset, three-split extension. All $1{,}152$ extension optimization instances pass independent numerical checks at registered tolerances. Directional contrasts are dataset-dependent and asymmetric: optimizing one direction need not improve the other. Together, the analyses distinguish accurate approximation of a selected projection from improvement in conditional directions outside its fitted objective.

comments
50 pages
fields
Statistics Theory
pdf ↗ page arXiv:2610.30708 ↗

In this paper, we propose estimators for the mean of the daily spot-correlation curves, which are robust to the presence of finite-variation jumps in the price processes. The related feasible functional central limit theorems for the proposed estimators have been established under a joint infill and long-span setting. Based on the asymptotic theory, we develop a test procedure for flatness of the curves. Monte Carlo simulations confirm the strong finite-sample performance of the estimators. In an empirical application to 30 U.S. stocks from 2010 to 2019, we find a pronounced end-of-day surge in the mean of correlation curves across diverse stock groupings, alongside substantial calendar-time non-flatness in the curves.

fields
Statistics Theory
pdf ↗ page arXiv:2610.31208 ↗

Deep learning (DL) methods have substantially improved predictive performance across a wide range of downstream prediction tasks, enabling new discoveries in multiple domains. However, principled DL methods for non-Euclidean random objects remain relatively scarce, despite the growing importance of modern biomedical outcomes taking the form of probability distributions, random graphs, functions, and other random objects in metric spaces. Motivated by a new generation of digital and clinical biomarkers, we propose a deep learning framework for regression with random objects in metric spaces. Our approach operates directly on the metric structure of the response space, avoiding restrictive manifold or Euclidean embedding assumptions imposed by many existing methods. At the same time, it retains modern statistical guarantees under the stated statistical assumptions. We establish statistical consistency and convergence rates for the proposed estimator, and characterize conditions under which it can mitigate the curse of dimensionality for hierarchically compositional regression functions. Extensive simulation studies demonstrate competitive predictive performance, with gains over several competing approaches in multiple Euclidean and non-Euclidean configurations. Finally, we demonstrate the practical utility of the proposed framework in two digital health case studies with distribution-valued outcomes in Wasserstein spaces, using high-resolution accelerometry and continuous glucose monitoring data. Embedding-based deep-learning methods may be less suitable when no informative low-dimensional representation exists or when the learned embedding does not adequately preserve the intrinsic geometry of the response space.

fields
Statistics Theory
pdf ↗ page arXiv:2610.31328 ↗

The Power Spherical distribution has been proposed as a computationally efficient alternative to the von Mises-Fisher distribution for data on the unit sphere, with reduced computational cost for simulation and a simpler normalizing constant. Despite these advantages, its statistical inference properties remain underdeveloped. In this paper, we develop a likelihood-based framework for estimation and inference for the Power Spherical distribution. Within this framework, we develop maximum likelihood estimation procedures for both the central direction and concentration parameter. Building on these estimators, we formulate likelihood ratio tests for hypotheses involving known and unknown parameters, study their asymptotic behavior, and evaluate finite-sample performance through simulation studies. The results demonstrate accurate Type I error control and good power when the asymptotic chi-square approximation is appropriate, while the parametric bootstrap provides reliable inference in small-sample settings or those where the dimension is large relative to the sample size. The findings also highlight nontrivial dependence of the power of tests for the central direction on the concentration parameter.

comments
15 pages, 13 figures
fields
Statistics Theory
pdf ↗ page arXiv:2610.31503 ↗

Spectral self-supervised learning is a method of density ratio estimation for the setting in which only samples drawn from the joint density of the numerator are available. The method has extensively been studied in terms of the computational properties, such as optimal solutions and connections to representation learning. However, theoretical understanding of its statistical property is still insufficient. In this work, we study three questions, namely, the minimax optimality, the applicability of the theory to regularized algorithms, and the statistical merits of density ratio estimation with data augmentation mechanisms that have recently been considered in the context of self-supervised representation learning. We first show that for general classes of Hölder continuous density ratios, there are regularized spectral self-supervised learning algorithms that yield estimators attaining the minimax optimality, up to logarithmic factors. We then prove that for subclasses endowed with a data augmentation mechanism, we obtain faster convergence rates that are also minimax optimal (up to logarithmic factors) in a weaker sense. We also present the key proof ideas tailored for self-supervised density ratio estimation.

fields
Statistics Theory
pdf ↗ page arXiv:2610.31603 ↗

Complex Variables6

Our main purpose is to determine all meromorphic solutions, in explicit form, of the nonlinear differential-difference equations \begin{equation*} f^{n}(z)f'(z)+q(z)f(z+c)=p_{1}{\rm e}^{α_{1}z}+p_{2}{\rm e}^{α_{2}z} \end{equation*} and \begin{equation*} f^{n}(z)f'(z)+q(z){\rm e}^{Q(z)}f(z+c)=p_{1}{\rm e}^{α_{1}z}+p_{2}{\rm e}^{α_{2}z}, \end{equation*} where $n\geq 3$ is an integer, $q(z)$ and $Q(z)$ are nonzero polynomials with $Q(z)$ nonconstant, and $c,~p_{j},~α_{j}(j=1,2)$ are nonzero constants satisfying $α_{1}\neq α_{2}$. We sharpen the result in the cited literature, as illustrated by specific examples.

fields
Complex Variables
pdf ↗ page arXiv:2610.30602 ↗

For over two centuries, the esteemed mathematicians Gauss and Fourier conjectured that each real critical point of the rational function $p^{'}(s)/p(s)$ is associated with a pair of non-real zeros of the real polynomial $p(s)$. The conjecture remains unresolved. The real zeros of $(p^{'}(s)/p(s))^{'}$ that are real multiple zero of $p^{'}(s)$ are defined as the second kind of zeros of $(p^{'}(s)/p(s))^{'}$. In addition to the second kind of zeros, the other real zeros of $(p^{'}(s)/p(s))^{'}$ are referred to as the first kind of zeros of $(p^{'}(s)/p(s))^{'}$. We demonstrate that the first kind of zeros of $(p^{'}(s)/p(s))^{'}$ emerge from the intersection of root loci emitted from non-real zeros of $p(s)$, thereby providing a comprehensive geometric interpretation of their relationship. Moreover, each first kind of zero of $(p^{'}(s)/p(s))^{'}$ is connected via root loci to a pair of conjugate non-real zeros of $p(s)$. This establishes the precise geometric relationship conjectured by Gauss and Fourier, fully resolving their original problem for first-kind zeros and completing a foundational chapter in polynomial theory. We have proven Gauss-Fourier conjecture about the first kind of zeros.

fields
Complex Variables
pdf ↗ page arXiv:2610.30620 ↗

Let $Ω\subset\mathbb{R}^n$ be a domain, with $n\ge2$. We characterize the real-valued harmonic functions that can occur as prescribed real components of monogenic functions. For any fixed nonzero real Clifford module $M$ and any fixed unit vector $s\in M$, a smooth real-valued function $h$ can be written as $h=\langle F,s\rangle$ with $F$ monogenic if and only if the $(n-1)$-form $*dh$ is exact. Consequently, every real-valued harmonic function on $Ω$ admits such a representation if and only if $H_{\mathrm{dR}}^{n-1}(Ω)=0$. In dimension eight, the same exactness criterion characterizes the real parts of octonionic regular functions and yields the corresponding equivalence with $H_{\mathrm{dR}}^7(Ω)=0$. The proofs use global solvability of the Poisson equation and elementary identities for differential forms.

comments
9 pages
fields
Complex Variables
pdf ↗ page arXiv:2610.30648 ↗

On every bounded pseudoconvex domain $Ω\Subset\mathbb C^n$, $n\ge2$, with $C^2$ boundary, we prove $K_Ω/S_Ω\le C_{Ω,\varepsilon} δ_Ω^{-1}|\logδ_Ω|^{1+\varepsilon}$ near the boundary for every $\varepsilon>0$, where $δ_Ω$ denotes the boundary distance. For each positive nondecreasing $H(s)=o(s)$, a smoothly bounded pseudoconvex complete Reinhardt domain in $\mathbb C^2$ shows that the logarithmic factor cannot be replaced by $H(|\logδ_Ω|)$.

fields
Complex Variables
pdf ↗ page arXiv:2610.31043 ↗

The main purpose of this paper is to resolve the Hardy-Littlewood-type equivalence problem. In particular, we show that a Hardy-Littlewood-type theorem holds for arbitrary majorants in the case \(p\in(1,\infty)\), and that the equivalence holds in the case \(p=1\). For the proof, we employ new functional analytic approaches based on Fourier series, the Hilbert transform, and the uniform boundedness principle. Those proof methods are completely different from those of Dyakonov [Acta Math., 178 (1997), 143-167] and Pavlović [Acta Math., 183 (1999), 141-143]. In addition, we present several representative applications that improve a series of known results.

comments
It was completed in June 2026
fields
Complex Variables
pdf ↗ page arXiv:2610.31132 ↗

We study the volume-normalized gradient flow of the squared Chern scalar curvature on compact Hermitian manifolds of complex dimension $n\ge3$. The flow extends smoothly past a finite time if the spatial supremum of Chern scalar curvature belongs to $L^2$ in time. A uniform curvature bound in the evolving $L^p$ norm, for one fixed $p>n$, gives global existence and smooth convergence of the whole trajectory to a constrained critical metric. On Chern scalar-flat backgrounds, small initial $L^p$ curvature gives exponential convergence to the background. A corresponding condition on the trace-free first Chern–Ricci form gives exponential convergence on Chern–Ricci-flat Hermitian and positive Kähler–Einstein backgrounds. The smallness thresholds are independent of the initial higher derivatives. We also construct constant Chern scalar curvature backgrounds of either sign with arbitrarily small smooth perturbations whose solutions, if global, cannot converge back to the background.

fields
Complex Variables, Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2610.31270 ↗

Mathematical Physics6

We prove that Borodin-Gorin presentation for Heckman-Opdam $\mathfrak{gl}_n$ hypergeometric function by interlacing integrals is equivalent to two other integral presentations studied in arXiv:2508.18864. We also consider related Baxter operators and the corresponding limiting procedure from the Ruijsenaars hyperbolic model.

fields
Mathematical Physics, Representation Theory
pdf ↗ page arXiv:2610.30304 ↗

We determine the surface-defect difference operators of the 4d $\mathcal{N}=2$ lens space index for class $\mathcal{S}$ theories of type $A_{N-1}$ on $(\mathbb{S}^3/\mathbb{Z}_r)\times\mathbb{S}^1$. For generic fugacities $(p,q,t)$ and arbitrary rank $N$, orbifold order $r$ and discrete holonomies, their coefficients are finite products of theta functions with nomes $p^r$ and $q^r$. After an explicit gauge transformation, Gaussian in the holonomies, each operator factorizes into two elliptic Ruijsenaars–Schneider-type operators with step $pq$, one with nome $p^r$ and one with nome $q^r$, acting on variables glued along a lattice. Using this factorization and a Wronski-type relation, we prove that all the operators commute. We also establish a sufficient criterion for self-adjointness with respect to the bilinear vector multiplet pairing. It applies to the basic mixed operator and, in suitable parameter chambers, to the pure $p$- and $q$-type operators; for general mixed operators the contour prescription remains open. These results support the expectations from S-duality.

comments
37 pages
fields
Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2610.30849 ↗

ADER-DG numerical method with the LST-DG predictor, when used to solve hyperbolic equations with stiff source terms, exhibits properties characteristic of IMEX computational schemes. With increasing stiffness, characterized by the parameter $z = ν{Δt}^{n} < 0$, the maximum of the Courant number $\mathrm{CFL}_{\rm max}$ of the ADER-DG numerical method increases. In the region of strong stiffness $|z| \gg 1$, a linear increase in the Courant number $\mathrm{CFL}_{\rm max}(z) \sim |z|$ occurs. In the region of small source terms $|z| \ll 1$, the results $\mathrm{CFL}_{\rm max}(z)$ transform into known results for the problem $\mathrm{CFL}_{\rm max}(0)$ without source terms. In the transition region $|z| \sim 1$, a range of insignificant decrease in the Courant number $\mathrm{CFL}_{\rm max}(z)$ is discovered. In the linear case, instability is violated precisely when one of the matrix eigenvalues reaches $λ= -1$, regardless of the phase $θ$ of the numerical solution. A rigorous stability theory of the ADER-DG numerical method for stiff problems for arbitrary degree $N$ of basis polynomials is constructed. The stability condition is simplified to solving a polynomial equation for the Courant number $\mathrm{CFL}$. Highly accurate dependencies of the Courant number $\mathrm{CFL}_{\rm max}(N, z)$ of the ADER-DG method on the parameter $z$ are obtained. A rigorous direct proof of the approximation of the ADER-DG method is presented. Approximation orders $p = N+1$ for arbitrary degrees $N$ are rigorously derived. A set of numerical experiments is carried out to apply the ADER-DG method to solving both a linear advection-reaction equation and the system of Euler equations for a two-component reacting medium. The results obtained in these calculations confirm the theoretical results well.

comments
93 pages, 32 figures, 15 tables
fields
Mathematical Physics, Numerical Analysis
pdf ↗ page arXiv:2610.30852 ↗

We first prove a sharp Lieb-Thirring inequality with semi-classical constant and gradient correction in one dimension. In the periodic setting, the corresponding inequality also includes a parity dependent shell-correction term, which appears to be new. Moreover, we also characterize the optimizers of these inequalities. In particular, the optimizing density profiles form a two-dimensional manifold, which we call here the Poincaré density manifold. We then apply these results to study the Thomas–Fermi–von Weizsäcker (TFW) approximation of the kinetic energy in Density Functional Theory. More precisely, we first obtain an explicit and non-asymptotic bound on the global and local error made by the TFW approximation. These bounds are controlled by the distance of the normalized density profile from the Poincaré density manifold times the number of particles. In particular, these bounds show that the TFW approximation is exact on the Poincaré manifold. We then show that, in the periodic setting, the distance between the Kohn-Sham potential and the inverse TFW potential in the natural dual Sobolev space can also be controlled by explicit density dependent constants times the distance to the Poincaré manifold. As a corollary, we prove that for a fixed density profile, the Kohn-Sham potential converges towards the inverse Thomas–Fermi potential in the high-density limit $N \rightarrow \infty$ with asymptotic rate of order $N^{-2}$. This rate is shown to be optimal.

fields
Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2610.30887 ↗

Seven-dimensional supergravity poses a uniquely intricate supersymmetry problem, combining topologically massive higher-form gauge dynamics, distinct Clifford algebra properties, and rich geometric structures. We first establish the complete formulation of the maximal Cartan-gauged theory in terms of the gauge-invariant higher-form flux, including both the bosonic action and supersymmetry variations. This formulation, which also makes the smooth ungauged limit manifest, is achieved by requiring a consistent truncation to the minimal Cartan-gauged theory in the equal-charge limit. We construct the complete bilinear system for a timelike Killing vector, where additional internal orientation of the symplectic-Majorana spinor arises already in the scalar sector, uniquely among pure minimal ungauged theories. In the equal-charge sector, we decouple the algebraic constraints into SU$(3)$-isotypic components, and analyse the differential bilinear relations, determining the permitted dilaton gradient, fluxes, fibration twist and intrinsic torsion of the base. We prove that with gauging and active Cartan flux, the complex scalar bilinear vanishes identically. We also construct a Killing gauge for the higher-form potential compatible with the self-duality condition. We show that with gauging but no active Cartan flux, the Killing vector also acts as a generator of the gauged R-symmetry, and the base structure is enlarged from SU$(3)$ to U$(3)$. We find that BPS-flow solutions realize this setting. With supersymmetry, we isolate a single independent component of the 3-form equation across an exhaustive four-class partition for both theories within this setup. Applied to known and proposed solutions in both theories, this classification exposes unexplored sectors and provides an accessible toolbox for constructing and testing solutions and developing new geometric and holographic applications.

comments
106 pages, 4 tables
fields
Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2610.31191 ↗

We consider the quantization of linearized Einstein equations on 4-dimensional asymptotically flat spacetimes. We prove the existence of fully gauge invariant Hadamard states in the harmonic gauge for any Einstein metric asymptotic to the Minkowski metric in a conic neighborhood of spatial infinity.

comments
v1
fields
Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2610.31214 ↗

Algebraic Topology5

We construct and describe the moduli stack $\mathrm{Isog}$ of isogenies between oriented elliptic curves. We show that $\mathrm{Isog}$ is a spectral Deligne-Mumford stack and a relative spectral algebraic space over $\mathcal{M}_{\mathrm{ell}}^{\mathrm{or}}$, and give a fiber product decomposition of $\mathrm{Isog}$ corresponding to a connected-étale factorization on oriented elliptic curves. In the process of proving these results, we construct a theory of duality and quotients for spectral abelian varieties, prove a higher-algebraic version of Nakayama's lemma, and lift the rigidity theorem for morphisms of elliptic curves to the setting of spectral algebraic geometry.

fields
Algebraic Topology, Algebraic Geometry
pdf ↗ page arXiv:2610.30376 ↗

We study the negative gradient flow of analytic maps $f:X\to\R$ defined on compact analytic Riemannian manifolds without imposing any nondegeneracy or transversality assumptions. We construct tight isolating blocks around the connected components of the critical set $\Crit(f)$ and record only bounded-time contacts made after an orbit exits one block and before it makes landfall within the interior of another. These contacts assemble into a strict topological category $\cL$ -- called the landfall category -- whose classifying space $B\cL$ is shown to be simple homotopy equivalent to $X$ naturally over all down-sets of the flow partial order. The filtered homotopy type is independent of the isolating blocks. Passing to a finite subanalytic triangulation yields a flow-induced acyclic partial matching, and hence, an explicit finite chain complex generated by the non-exit simplices of the blocks which computes the homology of $X$. The finite model also computes the Morse–Conley spectral sequence over arbitrary coefficients; over a field, homological perturbation further produces a connection matrix whose entries are finite sums over descending contact itineraries.

comments
33 pages, 1 figure, comments welcome!
fields
Algebraic Topology, Dynamical Systems
pdf ↗ page arXiv:2610.30993 ↗

Background: Clinical influenza vaccine effectiveness (VE) has often been low over the past two decades, highlighting the need for preseason VE forecasting. Timely forecasts could help health authorities plan prevention strategies and allocate healthcare resources. However, preseason forecasting of clinical influenza VE remains relatively uncommon. Methods: We obtained hemagglutinin (HA) sequences from GISAID for U.S. specimens collected in August–September before each influenza season from 2010–2011 through 2024–2025. After quality screening, we compared each virus with the corresponding vaccine target strain for the same season and subtype or lineage using two mathematical distances based on amino acid patterns in the HA protein. We calculated mean distances for each season and subtype or lineage and paired them with published clinical VE estimates, yielding 26 observations across 13 seasons. Using a mathematical AI approach, we fitted linear regression models of VE against each distance and evaluated their predictive performance by forecasting later seasons using data from earlier seasons, with the historical mean VE for each subtype or lineage as a reference. We then applied the same approach to 87 HA sequences collected in August–September 2026 to forecast VE for the 2026–2027 season. Results: We generated component-specific forecasts of influenza VE for the upcoming 2026–2027 U.S. season. Both mathematical distances were negatively associated with historical VE, indicating that greater differences between circulating viruses and vaccine strains were associated with lower VE. The topological model forecast VE of 40.3%, 56.9%, and 47.1% against A(H1N1)pdm09, A(H3N2), and B/Victoria, respectively, whereas the geometric model forecast corresponding VE values of 34.0%, 56.8%, and 51.1%.

fields
Algebraic Topology
pdf ↗ page arXiv:2610.31301 ↗

Fundamental to the field of topological signal processing (TSP) is the \textit{persistence diagram} (PD), or barcode, of a signal, which gives noise-resistant measures of topologically significant features as distinct from noise. Existing literature proves that the total persistence computed from these diagrams is equal to the total variation, for certain continuous signals on compact domains. We provide a closed formula for this shared quantity, and generalize to all continuous and discrete functions on bounded domains, and to certain functions on non-compact 1D manifolds. Extending the identification of continuous and discrete persistence, we investigate the similarities of functions with the same PDs, and prove that, for any $n$, the persistence diagram can be calculated as a function of the sequence of critical values; we compute these formulas for $n \leq 6$. Finally, we examine which function transformations cause predictable changes in the PD of the transformed function, characterizing affine and linear transformations.

comments
60 pages, 24 figures
fields
Algebraic Topology
pdf ↗ page arXiv:2610.31391 ↗

We prove that the deformation functor associated to an algebra over a sufficiently nice Koszul operad can be lifted to an operadic formal moduli problem over the Koszul dual operad. We further show that this operadic formal moduli problem corresponds to the derived center of the algebra under the operadic Lurie-Pridham correspondence. As an application, we prove that the classical Gerstenhaber algebra structure on polyvector fields of a commutative algebra agrees with the derived center of the algebra as an abelian Poisson algebra.

comments
19 pages. Revised and expanded version of Section 5.4 of the author's Ph.D. thesis, arXiv:2607.05455. Comments welcome
fields
Algebraic Topology, Algebraic Geometry
pdf ↗ page arXiv:2610.31411 ↗

Geometric Topology5

We study two fundamental properties of the intersection pairing between geodesic currents on infinite-type surfaces which are classical in the finite-type closed setting: injectivity of the marked length spectrum and continuity of the intersection form. We show that geodesic currents on infinite-type surfaces of the first kind are determined by their intersection numbers with closed curves, extending Otal's marked length spectrum rigidity argument from finite-type to infinite-type surfaces. In contrast, we prove that the intersection pairing is not continuous in general for the natural topologies by constructing explicit counterexamples. We then prove sufficient criteria for continuity of intersection numbers for infinite-type surfaces.

fields
Geometric Topology
pdf ↗ page arXiv:2610.30420 ↗

We present a homological construction of Dax invariants in 4-manifolds that is intrinsic to the topological category and requires neither smoothing nor generic representatives. Applications include an extension of the invariant of Cha-Kim to neat disks without assuming local flatness, and a topological definition of the Dax map for arc spaces that yields a short alternative proof of the topological Dax isomorphism theorem.

comments
15 Pages
fields
Geometric Topology
pdf ↗ page arXiv:2610.30837 ↗

We prove that every compact orbifold with corners admits a triangulation in which the image of every codimension one face is a subcomplex. Faces need not be embedded, and the local groups may permute boundary components. The proof turns the boundary hyperplanes of linear charts into mirrors by means of the squaring map, which, unlike the folding $y\mapsto|y|$, is compatible with smooth changes of charts, and then applies the triangulation theorem for orbit spaces of proper Lie groupoids.

fields
Geometric Topology, Algebraic Topology
pdf ↗ page arXiv:2610.31001 ↗

Let $M=Ω/Γ$ be a closed properly convex real projective $4$-manifold. We prove the Chern-Hopf-Thurston conjecture for this class of manifolds, i.e. $χ(M)\geq0$. The argument transfers Akagawa's double-form identity on the Cheng–Yau cone over $Ω$ to a Bochner identity on $M$, from which we deduce that $H^q(M;Λ^pE^*)=0$ whenever $q<p(n+1-p)/(n+1)$, in arbitrary dimension $n$, for some flat bundle $E$ naturally attached to $M$. In dimension four, this implies that the cohomology with coefficients in $Λ^2E^*$ concentrates in degree two.

comments
19 pages
fields
Geometric Topology
pdf ↗ page arXiv:2610.31085 ↗

We study the Beliakova–Wehrli link $s$-invariant and Cavallo's link $τ$-invariant of coherently oriented cables. For knots satisfying extremal four-ball genus and maximal self-linking hypotheses, we establish bounds for the $s$-invariant of $(p,q)$-cables, where $p$ and $q$ are not necessarily coprime, and show that these bounds are sharp under certain conditions. For the $τ$-invariant, we prove analogous bounds for arbitrary companion knots and exact formulas whenever $τ(K)=\pm g_4(K)\ne 0$. Specializing to the coherently oriented cable links associated to an $n$-framed knot, we apply these bounds to the lasagna $s$-invariant of Ren and Willis. The resulting applications provide upper bounds for the lasagna $s$-invariant of knot traces and a criterion for distinguishing homeomorphic zero traces up to orientation-preserving diffeomorphism.

comments
22 pages, 2 figures
fields
Geometric Topology
pdf ↗ page arXiv:2610.31654 ↗

Group Theory5

We classify all abstract automorphisms of the elementary and full twisted Chevalley groups of types ${}^2A_\ell$ ($\ell\geq3$), ${}^2D_\ell$ ($\ell\geq4$), ${}^2E_6$, and ${}^3D_4$ over arbitrary commutative rings, for every invariant isogeny type. The coefficient automorphism $θ$ has order dividing that of the diagram automorphism. We assume that $2$ is invertible and, for triality, that $3$ is invertible as well. Three features distinguish the answer from the usual inner–diagonal and coefficient decomposition. The elementary groups of types ${}^2A_3$ and ${}^2A_4$ admit an additive family of exceptional automorphisms supported at $θ$-fixed maximal ideals with residue field $\mathbb F_3$. In type ${}^2D_4$, diagram automorphisms may vary on idempotent components, subject to compatibility with the involution and the isogeny lattice. In triality, the coefficient automorphisms preserve the trace operator $r\mapsto r+θ(r)+θ^2(r)$ but need not commute with $θ$. We determine which elementary automorphisms extend to the full groups and describe the remaining central factors. A nonzero exceptional unitary factor extends precisely in the simply connected type ${}^2A_3$, giving a classification for the hyperbolic group $\operatorname{SU}_4(R,θ;Q_4)$. The proof glues uniquely determined normalization data for a finite root frame and then recovers the coefficient action from root-subgroup relations.

comments
66 pages
fields
Group Theory
pdf ↗ page arXiv:2610.30314 ↗

Let $A$ and $G$ be finite groups such that $A$ acts coprimely on $G$ by automorphisms. For any fixed prime divisor $p$ of $|G|$, we prove that if every non-nilpotent maximal $A$-invariant subgroup of $G$ of order divisible by $p$ is normal then $G$ has a Sylow tower and $G$ is $q$-nilpotent or $q$-closed for each prime divisor $q$ of $|G|$.

fields
Group Theory
pdf ↗ page arXiv:2610.30653 ↗

The cubic pancake graphs are Cayley graphs over the symmetric group Sn generated by three prefix reversals. There is the folllowing open problem: characterize all the sets of three prefix reversals that generate Sn. Blanco and Golubyatnikov give a complete solution of the problem when any of the two smallest or the two largest lengths but n are included in a triple of prefix reversals. According to their conjectures, we give some conditions implying a triple of prefix reversals does not generate Sn. Moreover, Using the symmetric groups that can already be generated by three prefix reversals, we can derive some recurrence conditions.

fields
Group Theory, Combinatorics
pdf ↗ page arXiv:2610.30892 ↗

Let $G$ be a finite solvable group and $V$ be a faithful completely reducible $G$-module. We improve previous bounds for the sizes of defect groups of blocks of solvable groups through an improved bound on vector stabilizers of $p$-nilpotent groups. Specifically, if $G$ is 2-nilpotent and $2 \nmid |V|$, then there exists $v \in V$ such that $\mathbf{C}_G(v) \leq \mathbf{F}_4(G)$. Similarly, if $G$ is 3-nilpotent and $3 \nmid |V|$, then there exists $v \in V$ such that $\mathbf{C}_G(v) \leq \mathbf{F}_5(G)$. Using these results, we conclude that $d(B) \leq \lfloor \frac{9n}{10} \rfloor$ when $O_p(G) = 1$ for $p = 2$ and $d(B) \leq \lfloor \frac{19n}{21} \rfloor$ when $O_p(G) = 1$ for $p = 3$.

fields
Group Theory
pdf ↗ page arXiv:2610.30952 ↗

Let A be a unital *-subalgebra of $M_n(C)$ and let $M = U(n)/U(A)$, with the quotient Finsler metric induced by a unitarily invariant norm on $u(n)$, normalized so that $||iP|| = 1$ for rank-one projections $P$. This family contains the unitary orbits of Hermitian matrices, in particular flag manifolds and Grassmann manifolds. We prove that if $z_0$ is a minimal lifting of a tangent vector $X$ with $||X||_{\infty} < π/2$, then the one-parameter group $t \mapsto e^{t z_0}\cdot o$ has minimal length among all piecewise smooth curves in $M$ joining its endpoints. The same holds in manifolds $N=SU(n)/(SU(n) \cap A)$ for every Ad-invariant Finsler norm on $su(n)$, not necessarily symmetric (i.e. the unit sphere does not need to be balanced). The proof relies on the convexity of the distance from the identity along geodesic segments, valid for all these norms. We also prove that the ball of radius $π/2$ around the identity, for the spectral norm, is convex along one-parameter segments. This extends known results for the p-Schatten norms with p even, and gives a new proof for the operator norm, where the result is due to Duran, Mata-Lorenzo and Recht.

comments
9 pages
fields
Group Theory, Functional Analysis, Metric Geometry
pdf ↗ page arXiv:2610.31535 ↗

Representation Theory5

We study the exceptional theta correspondence for dual pairs of the form $\SL_3\times G$ inside $p$-adic groups of type $E_n$, $n=6,7,8$. We establish Howe duality for lifts of all Whittaker-generic unitarizable representations of $\SL_3$. Our dual pair is in a see-saw relationship with a dual pair of the form $G_2 \times H$ such that $G/H$ is a rank-two symmetric space. Using the theta correspondence for $\SL_3 \times G$, we prove a multiplicity-one result for $H$-invariant functionals on representations of $G$.

fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2610.30479 ↗

We show that rigid modules are $τ$-locally free for a large family of 1-Iwanaga–Gorenstein algebras. This family includes many cases of the algebras introduced by Geiss–Leclerc–Schröer in their Inventiones paper "Quivers with relations for symmetrizable Cartan matrices I: Foundations", hence answering a question posed by Geiss–Leclerc–Schröer for many new cases. Our result is achieved by introducing coactions of Taft algebras and applying the recent theory developed by the first-named author and Coulembier.

comments
Comments more than welcomed!
fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2610.30543 ↗

For the symmetric pair $(\mathrm{GL}_n(\mathbb C),\mathrm{GL}_n(\mathbb R))$, we compute the exact Flicker–Rallis period of a distinguished vector in a cohomological minimal $U(n)$-type, normalized by the Gel'fand–Tsetlin pairing of Hara–Miyazaki–Namikawa. Our main tool is a weight-independent identity between the Whittaker period and a compact $O(n)$-average. We determine the proportionality constant using the archimedean newform formula of Humphries–Jo, and evaluate the compact functional on the normalized distinguished vector. This yields an explicit formula for the Flicker–Rallis period for every cohomological weight.

comments
11 pages
fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2610.31018 ↗

Let $G$ be a quasi-split $p$-adic group, defined over a non-archimedean local field of residue cardinality $q$, and $R$ be a $\mathbb{Z}[\sqrt{q}^{-1},μ_{4p^\infty}]$-algebra. We generalize the constructions of Shahidi local coefficients and Langlands-Shahidi gamma factors to the setting of co-Whittaker $R$-representations. For classical $p$-adic groups, we prove there is a unique integral morphism of endomorphism rings of Gelfand–Graev representations, interpolating the (standard) local generic transfer to a general linear group. This yields a local transfer morphism in families, which allows us to deduce properties of the local $\ell$-adic generic transfer and congruences modulo primes $\ell\neq p$.

fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2610.31615 ↗

Plabic tangles define geometric promotion maps between configurations and, after choosing a lift, between Grassmannians. The main conjecture in \cite{Tangles} is that when the tangle is dominant and solvable the induced algebraic promotion is cluster quasi-homomorphism. This work extends the cluster perspective in two directions. First, we initiate the study of quantum promotions. We conjecture that all promotions defined from dominant solvable tangles are naturally lifted to a \emph{quantum cluster quasi homomorphism}, and prove for all cases in the literature that the were shown to be (classical) cluster quasi-homomorphisms. Secondly, we define the notion of cluster-Lusztig quasi-homomorphisms, which are cluster quasi homomorphisms that take Lustig's dual canonical basis elements to dual canonical basis element, up to a Laurent monomial in frozen variables, with clearing and normalization chosen uniformly on each content component. We prove the unexpected result that the classical and quantum $m$-unary star promotions fall into this category, and conjecture that all promotions coming from dominant solvable tangles share the same property. We then consider promotions via non solvable cores of intersection number higher than one. We use it to study facets of amplituhedron cells, and to show that some of them do not lie in zero loci of dual canonical basis elements, disproving a conjecture by T. Lam \cite{LamGP}.

comments
101 pages
fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2610.31655 ↗

Rings and Algebras5

We prove that every complex finite-dimensional simple binary Lie superalgebra with non-zero odd part is either a simple Lie superalgebra, and hence is one of the superalgebras of Kac's list, or the two-dimensional non-Lie superalgebra $B_2$. This confirms the Grishkov–Shestakov conjecture and, together with the theorems of Grishkov and Filippov on simple binary Lie algebras, gives the answer to Shestakov's question from the Dniester Notebook (Problem 3.100(d)) over the field of complex numbers.

fields
Rings and Algebras
pdf ↗ page arXiv:2610.30386 ↗

In this paper, we give a complete classification of compatible left-symmetric conformal algebra structures on solvable Lie conformal algebras which are free of rank two as $\mathbb{C}[\partial]$-modules up to isomorphism. We obtain ten mutually non-isomorphic normal-form types and determine the precise equivalence relations among the parameters within each family. Moreover, we also characterize the Novikov conformal algebras among the classified left-symmetric conformal algebras, thereby obtaining a complete classification of compatible Novikov conformal algebra structures in the same setting.

comments
23 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2610.30471 ↗

Let $K/F$ be a cyclic Galois field extension of degree $n$ with $\mathrm{Gal}(K/F)=\langleσ\rangle$. The nonassociative Petit algebras $K[t;σ]/K[t;σ](t^m-a)$ have recently emerged as important tools in coding theory and cryptography, where the applications only require distinct algebras up to isomorphism. Algebras that are isomorphic via a monomial isomorphism of degree one are called equivalent. We present a novel and precise parametrization of the $F$-equivalence classes of these algebras in the key case that $F$ contains a primitive $n$th root of unity and $n\mid m$. We evaluate the parametrization explicitly when $F$ is a nonarchimedean local field, which has applications to the number field case recently used to construct a nonassociative variant of Learning with Errors.

fields
Rings and Algebras
pdf ↗ page arXiv:2610.30921 ↗

We describe all degenerations of complex $4$-dimensional Jordan algebras and of complex $5$-dimensional nilpotent Jordan algebras. The proofs do not use other papers on degenerations, and all degenerations and non-degenerations were formally verified in the proof assistant Lean~4. The graph of primary degenerations of $4$-dimensional Jordan algebras has $73$ vertices and $160$ edges. The variety of $5$-dimensional nilpotent Jordan algebras is stratified into $63$ normal forms, five of which are one- or two-parameter families; together with two special members of a family this gives $65$ objects, and the graph of primary degenerations has $154$ edges. In particular, we describe all irreducible components of the corresponding varieties: the variety of $4$-dimensional Jordan algebras has $10$ irreducible components, and the variety of $5$-dimensional nilpotent Jordan algebras has dimension $22$ and $5$ irreducible components.

fields
Rings and Algebras
pdf ↗ page arXiv:2610.31179 ↗

We introduce a family of five-dimensional non-flexible quadratic real algebras $\{\mathcal A_γ\}_{0\leqγ\leq1}$ with canonical basis $1,i,j,k,\ell$, in which $γ$ changes the multiplication but not their norm, and study how this change affects geometry and dynamics. The algebras are pairwise non-isomorphic, $\mathcal A_0$ contains Hamilton's quaternion algebra, and $\mathcal A_1$ is the Pentarnion algebra. The alternating part of the trilinear form $\langle u\times_γv,w\rangle$ induced by the multiplication of $\mathcal{A}_γ$ defines a three-dimensional subspace $H_γ\subset\operatorname{span}_{\mathbb R}\{i,j,k,\ell\}$, tilted by the angle $\arctan(γ/\sqrt3)$, whose rotation group $G_γ\cong\mathrm{SO}(3)$ contains the automorphism group of $\mathcal A_γ$. For $γ_1\neγ_2$ the groups $G_{γ_1}$ and $G_{γ_2}$ generate $\mathrm{SO}(V)\cong\mathrm{SO}(4)$. For the six ways of ordering and bracketing the product of $i,p,p$ in $\mathcal A_γ$, two map the unit circle in ${\rm span}\{j,k\}$ to a point and, for $γ>0$, four map it to ellipses. As an application, we derive a Hamiltonian model of a classical spin on $H_γ$ whose multiplication-induced quadratic energy is isotropic for $γ=0$ and anisotropic for $γ>0$. It conserves spin length and, for fixed $γ$, energy, and satisfies an exact work identity when $γ$ varies in time. Numerical experiments with periodically varying $γ$ indicate both regular and irregular spin dynamics.

fields
Rings and Algebras, Mathematical Physics, Dynamical Systems
pdf ↗ page arXiv:2610.31485 ↗

Spectral Theory5

For each $d \ge 2$ we prove that the unit $d$-cube $\square_d \subset \mathbb{R}^d$ is, on the class $\mathcal{P}$ of convex polytopes combinatorially equivalent to a $d$-cube, (i) a strict local minimizer of the scale-invariant isoperimetric ratio $I(Ω) = \tfrac{P(Ω)^d}{|Ω|^{d-1}}$, with $P$ the perimeter, (ii) a strict local minimizer of the volume-normalized first Dirichlet eigenvalue $\barλ(Ω) = |Ω|^{2/d}λ_1(Ω)$, and (iii) a strict local maximizer of the volume-normalized first Neumann eigenvalue $\barμ(Ω) = |Ω|^{2/d}μ_1(Ω)$. The method is a shape-derivative Hessian analysis adapted to the hyperoctahedral symmetry of the cube. In symmetry-adapted coordinates on the parameter space --- the decomposition into irreducible representations of the hyperoctahedral group --- each Hessian is block-diagonal, with four scalar eigenvalues, which we give in closed form in $π$, rational coefficients, and a few universal series-constants. The first Neumann eigenvalue is not differentiable at $\square_d$, since its lowest cluster splits under perturbation. The Neumann case therefore works with a smooth auxiliary functional, whose Hessian is computed by second-order perturbation theory of the cluster; the coupling to modes outside the cluster enters at the same order. Finally, we show that extremality of $I$, $\barλ$, and $\barμ$ does not hold in high dimensions for a particular multilinear perturbation that leaves $\mathcal{P}$ by breaking convexity. All results are local; we discuss why a global statement, available for quadrilaterals (Endo and Osting, 2026), appears out of reach for $d \ge 3$.

comments
32 pages, 2 figures
fields
Spectral Theory, Analysis of PDEs
pdf ↗ page arXiv:2610.30463 ↗

For positive powers of the discrete Dirichlet Laplacian $(-Δ_{\mathrm{D}})^σ$, non-trivial Hardy weights exist if and only if $0<σ<3/2$. For $0<σ\leq 1$, an explicit optimal Hardy weight for $(-Δ_{\mathrm{D}})^σ$ was obtained by Das and de la Fuente-Fernández. Their ground state argument does not apply when $1<σ<3/2$, because the off-diagonal matrix entries of $(-Δ_{\mathrm{D}})^σ$ are no longer all non-positive. Nevertheless, we show that their result is true for the entire subcriticality range $0<σ<3/2$. For $1<σ<3/2$, our argument combines the factorisation $$(-Δ_{\mathrm{D}})^σ=\nabla_{\mathrm{D}}^{*}(-Δ_{\mathrm{N}})^{σ-1}\nabla_{\mathrm{D}},$$ where $\nabla_{\mathrm{D}}$ and $-Δ_{\mathrm{N}}$ are the discrete Dirichlet gradient and the discrete Neumann Laplacian, respectively, with a suitable two-term ground state representation. In addition, we use these arguments to derive another explicit family of optimal Hardy weights for any $σ\in(0,3/2)$.

comments
19 pages
fields
Spectral Theory, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.31171 ↗

Steklov eigenfunctions, $\{φ_{σ_j}\}_{j=0}^\infty$, are the eigenfunctions of the Dirichlet to Neumann map on a bounded domain with eigenvalue $σ_j$. This paper considers Steklov eigenfunctions and eigenvalues on a family of curvilinear polygons, $Ω_α$ whose boundaries are smooth away from a single corner of angle $α$. We (i) prove optimal lower bounds on the decay of the harmonic extension, $u_{σ_j}$, of $φ_{σ_j}$ away from the boundary of $Ω_α$ and (ii) give optimal lower bounds on the degree to which the high energy Steklov spectrum of $Ω_α\setminus H_1$ may differ from that of $Ω_α\setminus H_0$ when $H_1$ and $H_0$ are isometric. This shows that the corresponding estimates in recent work by the authors together with Malagutti are optimal. The proof in this paper was obtained through an interaction with ChatGPT 6 Astra: While writing the work with Malagutti, the authors became curious about optimal error bounds for the difference between the Steklov spectra on a curvilinear polygon, $P$, and the spectrum of any operator which knows only local information about $\partial P$. The authors suggested to ChatGPT to remove two isometric, smooth domains from a curvilinear polygon. ChatGPT suggested the ideas for a proof based on a regularized trace and the singularity in the kernel of the DtN map near a corner. The authors then suggested a simpler, conformal approach, the method for handling small angles, and the idea to obtain lower bounds on Steklov eigenfunctions. The paper is entirely written by the authors and the argument has been significantly modified, clarified, and simplified from the ChatGPT ideas.

fields
Spectral Theory, Analysis of PDEs
pdf ↗ page arXiv:2610.31387 ↗

We prove the strict Pólya inequality for Neumann eigenvalues of spherical shells in every dimension $d\ge2$, for every radius ratio and every positive energy. The proof also covers balls. For shells, the excess over the leading Weyl term has a positive lower bound depending only on dimension. Above explicit frequency thresholds independent of the radius ratio, we obtain a surplus of boundary order. These estimates remain uniform as the hole shrinks or the shell becomes thin. We compare weighted sampling errors for inverse radial actions while retaining the removed volume exactly. The proof is entirely analytic and requires no computer-assisted verification.

comments
63 pages, 1 figure
fields
Spectral Theory, Analysis of PDEs
pdf ↗ page arXiv:2610.31464 ↗

For every $d\ge2$ and $0\leσ<1/3$, we construct with LLM-assistance a smooth bounded nonnegative lens-type potential $V$ with arbitrarily small $\|V\|_\infty+\int_{\mathbb{R}^d}|x|^{1-d+σ}|V(x)|^2 dx$, such that $-Δ+V$ has only pure point spectrum in $(0,\infty)$. Thus, we show that Barry Simon's $L^2$ conjecture, Problem 8 in "Schrödinger operators in the twenty-first century", is false.

comments
35 pages, 1 figure. Comments are welcome
fields
Spectral Theory, Mathematical Physics
pdf ↗ page arXiv:2610.31637 ↗

Category Theory4

The localizing/separating factorization, which is the analogue, for restriction categories, to the surjective/embedding factorization for topoi, is developed at both the mere restriction category and join restriction category level. The factorization system at both the ordinary and join level is approached using the notion of a density, which is a stable and universal suborder of the restriction order. The main technical results of the paper construct the join localization and establish its basic properties. The paper gives several examples of localizations. In particular, examples of localization on commutative rigs are provided which give a way to construct categories of schemes. The Zariski spectrum and the Pierce spectrum are, in particular, developed.

fields
Category Theory
pdf ↗ page arXiv:2610.30553 ↗

In a previous paper, we constructed a closed skew monoidal structure on the category of Gray-categories and Gray-functors whose internal hom Psd(A, B) captures pseudomaps and pseudo-transformations. In the present paper we give a symmetric description of the Gray-category Psd(A,B) and use this to prove that the skew monoidal structure is symmetric skew monoidal.

fields
Category Theory
pdf ↗ page arXiv:2610.31410 ↗

We introduce several flavours of semi-strict 4-category as enriched categories. We give the axioms for semi-strict 4-categories in elementary terms and describe a wide range of examples. In particular, we answer the question of what exactly Gray-categories and the higher transformations between them form: namely, a left-sharp 4-category G-Cat$^4$. In addition, we describe examples arising from braided monoidal 2-categories, monoidal Gray-categories (herein defined) and Gray-categories with structure. We use the concepts introduced here and the relationships between them to unify various concepts in the literature, such as Crans' 4-teisi. In the second part of the paper, we investigate homotopical aspects. In particular, we classify the equivalence n-cells in the left-sharp 4-category G-Cat$^4$ for each n. Using this, we show that the left-sharp skew monoidal structure on the category of Gray-categories induces a symmetric monoidal closed structure on the homotopy category of Gray-categories.

fields
Category Theory
pdf ↗ page arXiv:2610.31448 ↗

A hard theorem of Givant classifies the finitary algebraic theories for which every algebra is free. From it, one easily deduces that all such theories are minimal (adding any further equations makes them trivial) and have a well-defined notion of dimension (free algebras on sets of different cardinality are never isomorphic). We prove both these properties directly, without the aid of Givant's theorem.

comments
11 pages
fields
Category Theory, Logic, Rings and Algebras
pdf ↗ page arXiv:2610.31599 ↗

General Topology3

We study conditions that imply finite-dimensionality of metrizable or Frechet-Urysohn linear subspaces of topological vector spaces (TVS). We consider the classes $\mathscr{D}_M$ and $\mathscr{D}_{FU}$ of TVS: a space $L$ belongs to $\mathscr{D}_M$ (respectively, $\mathscr{D}_{FU}$) if every metrizable (respectively, Frechet-Urysohn) linear subspace of $L$ is finite-dimensional. Although the classes of metrizable spaces and of Frechet-Urysohn spaces differ substantially, the classes $\mathscr{D}_M$ and $\mathscr{D}_{FU}$ are much closer to each other: in the Hrusak-Ramos-Garcia model, in which Malykhin's problem is solved, $\mathscr{D}_M=\mathscr{D}_{FU}$, whereas under MA+not CH, as shown in the paper, $\mathscr{D}_M\neq\mathscr{D}_{FU}$. For a locally convex space (LCS) $L$ we denote by $L_w$ the space $L$ with its weak topology and by $L'_{w^*}$ the dual space with the weak$^*$ topology. This paper investigates which LCS $L$ have the property that $L_w$ and $L'_{w^*}$ belong to $\mathscr{D}_M$ or $\mathscr{D}_{FU}$. Although the classes are close, different methods are used to study them: topological-algebraic ones for $\mathscr{D}_M$ (a criterion is obtained) and methods of measure theory and probability for $\mathscr{D}_{FU}$ (a sufficient condition is obtained). We prove that if an LCS $L$ admits a continuous norm, then $L_w\in\mathscr{D}_{FU}$; in particular, if $L$ admits a continuous norm and $L_w$ is Frechet-Urysohn, then $L$ is finite-dimensional. If the topology of an LCS $L$ is coarser than the topology induced by some complete norm on $L$ (for example, if $L$ is Banach), then $L'_{w^*}\in\mathscr{D}_{FU}$; completeness of the norm is essential here. The methods also apply to spaces of real-analytic functions and to the space of polynomials with the topology of pointwise convergence: these also belong to $\mathscr{D}_{FU}$.

comments
23 pages. Elsevier (elsarticle) format
fields
General Topology, Functional Analysis
pdf ↗ page arXiv:2610.30800 ↗

In this paper, we introduce a new class of spaces, termed U_c-admitting spaces, and investigate their relationships with U_s-admitting spaces and well-filtered spaces. Adopting the perspective of H-sobriety, we show that every U_c-admitting space is H-sober, so that U_c-admitting spaces arise as a special case of H-sober spaces. Consequently, the category U_c-Sob of U_c-admitting spaces and continuous maps is complete and forms a reflective subcategory of Top_0. In addition, we prove that a T_0 space X is U_c-admitting if and only if its Smyth power space is U_c-admitting. Finally, we present the standard U_c-completion of an arbitrary T_0 space.

fields
General Topology
pdf ↗ page arXiv:2610.30967 ↗

Aggregation functions provide a general mechanism for combining multiple inputs into a single output and constitute a fundamental tool in information fusion. Beyond the classical numerical setting, aggregation can also be considered at the level of mathematical structures, where the main question is to determine which properties of the original structures are preserved by the aggregation process. In this paper, we study the preservation of topology within a unified framework based on continuous quantales and quantale-enriched categories. We introduce strongly preserving functions, for which the natural topology induced by a $\mathscr V$-metric space coincides with that induced after aggregation. We decompose this property into its upper and lower versions and show that upper strong preservation is equivalent to Scott continuity at the unit of the domain quantale, whereas lower strong preservation is characterized in terms of the fibre of the unit and the Scott upper semicontinuity of the inverse multifunction. Combining these results, we obtain a complete characterization of strongly preserving functions, together with analogous results for separated, symmetric, and separated and symmetric $\mathscr V$-metric spaces. Finally, we specialize the general theory to functions from $\mathsf P_+^{\,I}$ to $\mathsf P_+$, obtaining characterizations of strongly extended quasi-pseudometric and pseudometric aggregation functions on Cartesian products and on common underlying sets, together with corresponding results for extended quasi-metric and metric aggregation functions on Cartesian products.

comments
36 pages
fields
General Topology
pdf ↗ page arXiv:2610.31059 ↗

Information Theory3

Let $\mathbb L/\mathbb K$ be a finite Abelian Galois extension with a fixed decomposition $\mathrm{Gal}(\mathbb L/\mathbb K)=\langleσ_1\rangle\times\cdots\times\langleσ_m\rangle$. We show that the quotient of the multivariate skew polynomial ring $\mathbb L[x_1,\ldots,x_m;σ_1,\ldots,σ_m]$ by suitable central polynomials $H_1(x_1),\ldots,H_m(x_m)$ is isomorphic to a product of $t$ copies of $\mathrm{End}_{\mathbb K}(\mathbb L)$, so that one skew polynomial represents all blocks of a sum-rank metric space. The sum-rank weight of an element equals the rank of an associated Dickson matrix and of a generalized Moore matrix. Using this, we define sum-rank Reed–Muller-type codes and show that their dimension and minimum distance are given by the formulas for affine Cartesian codes with side lengths $\mathrm{deg}\,H_1,\ldots,\mathrm{deg}\,H_m$; the same holds for codes supported on lower sets. The family contains as special cases linearized Reed–Solomon codes, Gabidulin codes, rank-metric Reed–Muller codes, and affine Cartesian codes. Over finite fields, every linearized Reed–Muller code of Berardini and Caruso is, after a monomial change of variables, a monomial code in our framework. This gives the dimension of all these codes, and their exact minimum distance in every degree whenever the support is a lower set.

fields
Information Theory, Combinatorics, Rings and Algebras
pdf ↗ page arXiv:2610.31358 ↗

Let $u$ be a received word for the full-length Reed–Solomon code $\operatorname{RS}_q(k)$, with interpolation polynomial $f_u$ of degree $k+m$. For each $m\in\{3,4,5,6,7\}$, we classify all such deep holes over every finite field, without a field-size hypothesis. None occur for odd $m$ in this range. At $m=4$ and $m=6$, the only exceptions are, respectively, the Segre sextic and Frobenius-power families; these occur only in dimension two over fields of characteristic two. For arbitrary $m\geqslant3$, we also establish two uniform bounds. If $\sqrt q\geqslant12(m+1)\log(2m+2)$, no word of interpolation degree $k+m$ is a deep hole when $q$ is odd, $k\geqslant3$, or $m$ is odd. If $q>16(m+2)^4$, we obtain the corresponding complete classification at every admissible $k$, including the explicit dimension-two exceptions. Our proofs use an agreement criterion expressed in complete homogeneous symmetric functions, agreement-count estimates, finite geometry, permutation-polynomial restrictions, and subset constructions for solving the resulting symmetric-function equations. The remaining finite cases are settled by finite computations with supplied certificates and deterministic verification programs.

comments
43 pages
fields
Information Theory, Combinatorics, Number Theory
pdf ↗ page arXiv:2610.31460 ↗

Let $μ$ be a log-concave isotropic probability measure on $R^d$ , and let $μ^n$ denote the law of the normalized sum of $n$ independent random vectors with law $μ$. We prove that \[ H(μ^n|γ)\leq \frac{C}{n} \min\left\{1+\log(ed)^2H(μ|γ)\ ,\ d\right\}. \] Compared to the previous best known bound, our estimate replaces the polynomial dependence on the dimension by a polylogarithmic one. The proof relies on a new combination of the De Bruijn identity with Eldan's stochastic localization process.

fields
Information Theory, Probability
pdf ↗ page arXiv:2610.31493 ↗

Metric Geometry3

In this paper, we establish an affine fractional Orlicz–Sobolev inequality by replacing the Euclidean fractional Orlicz seminorm with an energy obtained by minimizing over origin-symmetric star bodies of prescribed volume. Under finite lower and upper power growth assumptions, a subcritical upper growth bound, and a monotonicity condition on $t^{n/s+2}Φ''(t)$, the resulting inequality has the same best constant as its Euclidean counterpart. The power case recovers the affine fractional Sobolev inequality of Haddad and Ludwig with the corresponding Luxemburg normalization. To establish this inequality, we investigate the underlying geometric extremal problem. For every nonzero smooth function of compact support, the existence and uniqueness of an optimal star body are proved under the growth assumptions alone, and its radial function is characterized by an equation involving $Φ(t)+(s/n)tΦ'(t)$. We also establish an anisotropic rearrangement inequality, together with its equality conditions under additional strictness assumptions. Moreover, the normalized local limit is investigated. The optimized energies converge to the local energy, and the radial functions of the minimizing bodies converge uniformly on the sphere. The limiting modular is determined by $\overlineΦ(t)=\int_0^tΦ(τ)\,dτ/τ$. Finally, we compare optimization over star bodies with optimization in the affine orbit.

comments
25 pages
fields
Metric Geometry
pdf ↗ page arXiv:2610.30689 ↗

We study medial axes of nonempty closed sets in finite-dimensional real normed spaces whose norms are $C^1$ away from the origin. Using the differential of the norm, we define the dual $k$-medial axis by requiring the contact covectors associated with nearest points to have affine dimension at least $k-1$. In dimension $n$, we prove that this set is $(n-k+1)$-rectifiable for every $1\le k\le n+1$, and hence has Hausdorff dimension at most $n-k+1$. We give a direct geometric proof and characterize the dual medial axes through the superdifferential of the squared distance function, obtaining an alternative proof from a theorem of Alberti, Ambrosio, and Cannarsa on singularities of semiconvex functions. Under the additional assumption of strict convexity, the ordinary and dual medial axes coincide for $k=2,3$, yielding the corresponding rectifiability results for ordinary medial axes. For $k=4$, however, the ordinary rectifiability conclusion can fail even for norms arbitrarily close to Euclidean: we construct norms on $\mathbb R^3$ with smooth positively curved unit spheres arbitrarily $C^\infty$-close to the Euclidean sphere, together with four-point sets whose ordinary $4$-medial axes contain nondegenerate line segments.

comments
20 pages
fields
Metric Geometry, Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2610.30878 ↗

For every normed space $X$ and integers $1\le k<n$, we construct a Lipschitz retraction from $X(n)$ onto $X(k)$ with constant at most $2+8n(n-1)$, independently of the dimension of $X$. Here $X(n)$ consists of the nonempty subsets of $X$ with at most $n$ points, equipped with the Hausdorff metric. For the consecutive case $k=n-1$, a separate construction gives the sharper asymptotic bound $O(n\log n)$. These results extend to barycentric metric spaces and settle some open problems on Lipschitz retractions.

fields
Metric Geometry
pdf ↗ page arXiv:2610.31555 ↗

Quantum Algebra3

Affine quantum groups $\widetilde{\mathbf{U}}$ and affine iquantum groups $\widetilde{\mathbf {U}}^\imath$ admit two complementary descriptions: a Serre-type presentation and a Drinfeld (current) presentation. While iquantum groups $\widetilde{\mathbf {U}}^\imath$ are typically defined via the Serre presentation, their Drinfeld presentations are substantially more subtle and less well understood. In this paper, we give a conceptual derivation of the Drinfeld presentation of $\widetilde{\mathbf {U}}^\imath$ starting directly from the Drinfeld presentation of $\widetilde{\mathbf {U}}$, working within the framework of iHopf algebras. This approach leads naturally to the definition of iquantum affinization associated with arbitrary Kac-Moody algebras $\mathfrak{g}$. We further show that, in this general setting, these iquantum affinizations can be realized as coideal subalgebras of quantum affinizations with respect to the Drinfeld coproduct. Finally, in the affine case, we describe the imaginary root vectors $Θ_{i,r}$ of $\widetilde{\mathbf {U}}^\imath$ explicitly in terms of the root vectors $ψ^\pm_{i,r}$ of $\widetilde{\mathbf {U}}$, thereby extending the results of Li and Przeździecki for certain affine types of $\widetilde{\mathbf {U}}^\imath$.

comments
42 pages
fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2610.30521 ↗

In this paper, we give a positive answer to Jarossay's question under the adjoint reduction relations. Namely, we prove that the extended double shuffle relations together with the relation $\!\!\!\mod π^2$ are equivalent to the adjoint double shuffle relations together with the adjoint reduction relations.

fields
Quantum Algebra
pdf ↗ page arXiv:2610.30720 ↗

We introduce a new class of unitary set-theoretic Yang–Baxter solutions, called \emph{bipartite} solutions. This class, which is purely combinatorial in nature, forms a full subcategory of $\mathcal{LYB}$, the category of Lyubashenko type solutions of Agore, Chirvasitu and the author, and is particularly amenable to explicit classification results. We give an intrinsic necessary and sufficient condition for a solution of the Yang–Baxter equation to be isomorphic to a bipartite solution, we settle the isomorphism problem within this class and, as an application, we determine their automorphism groups. If $X$ is a finite set with $|X| = n$, the number of isomorphism classes of bipartite solutions on $X$ is $\lfloor n/2 \rfloor + 1 + \sum_{m=2}^{n} \bigl( o(m, n-m) - 1 \bigr)$, where $o(m, k)$ denotes the number of orbits of the symmetric group $S_m$ acting by conjugation on the $k$-element multisets of elements of $S_m$. The paper also offers a comparative study: for small $|X| = n$ we count, up to isomorphism, all set-theoretic Yang–Baxter solutions on $X$, together with five distinguished families of solutions. Throughout the range we were able to compute, the class $\mathcal{LYB}$ accounts for a large share of all bijective and of all non-degenerate solutions, strikingly close to the total.

comments
27 pages, 6 tables. Comments are welcome
fields
Quantum Algebra, Combinatorics, Rings and Algebras
pdf ↗ page arXiv:2610.30845 ↗

Symplectic Geometry3

Every singular subalgebroid, and in particular every singular foliation $\mathscr{G}$, determines a universal Poisson $C^\infty$-scheme $\mathrm{Spec}(\mathcal{F}(\mathscr{G}))$, which is the analogue of the linear Poisson structure on the dual of a Lie algebroid. We show that the underlying space $X_{\mathcal{F}(\mathscr{G})}$ of $\mathrm{Spec}(\mathcal{F}(\mathscr{G}))$ decomposes as a disjoint union of symplectic manifolds. Furthermore, we extend the Helffer-Nourrigat cone to a singular subalgebroid and show that it is an embedded Poisson $C^\infty$-subscheme of $\mathrm{Spec}(\mathcal{F}(\mathscr{G}))$.

comments
27 pages. Comments are welcome
fields
Symplectic Geometry, Mathematical Physics, Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2610.30395 ↗

The documents [OAI26a, OAI26b, OAI26c] claimed to prove cases of the Hodge conjecture via homological mirror symmetry, before being withdrawn by OpenAI. We discuss the source of the error (but do not analyse the rest of the argument).

comments
9 pages
fields
Symplectic Geometry, Algebraic Geometry
pdf ↗ page arXiv:2610.30976 ↗

The attention mechanism underpins modern large language models, yet their dynamics remain only partially understood. Recent perspectives interpret attention blocks as interacting particle systems, whose mean-field limits correspond to gradient flows of energy functionals on spaces of probability densities on $\mathbb R^d$ equipped with Wasserstein-type metrics. We extend this viewpoint by deriving accelerated attention blocks from inertial, Nesterov-type damped Hamiltonian dynamics on these density spaces, developing the geometry and differential calculus needed to make the construction rigorous. In particular, we introduce a local-mobility geometry for the Otto-Wasserstein and softmax-Wasserstein settings, and a quotient Stein geometry that resolves the degeneracy of the linear-attention kernel to yield a well-defined metric and differential calculus. We provide rigorous foundations when softmax attention admits a gradient-flow formulation and when its inertial counterpart admits a damped Hamiltonian on explicitly characterized domains. For linear attention, we obtain a finite-dimensional solution theory with sharp conditions for global existence versus finite-time second-moment blow-up. We further prove a quantitative link between continuous moment blow-up and the discrete-layer depth at which token norms cross a prescribed threshold. Finally, motivated by the finite-token geometry, we propose geometric corrections to token and momentum updates. In decoder-only, nanoGPT-style experiments on TinyStories and OpenWebText, these corrections lower validation negative log-likelihood on next-token prediction relative to momentum-only controls.

comments
97 pages, 5 figures, 4 tables, comments welcome!
fields
Symplectic Geometry, Analysis of PDEs, Differential Geometry, Dynamical Systems
pdf ↗ page arXiv:2610.31600 ↗

Operator Algebras2

We introduce relative $h$-diagonals for crossed products $A\rtimes_αΓ$ by discrete groups, which are positive-form approximate diagonals in the Haagerup tensor product taken relative to $A$. We show that $α$ is amenable if and only if $A\rtimes_αΓ$ admits a relative $h$-diagonal, an analogue of Johnson's theorem for $L^{1}(G)$.

fields
Operator Algebras
pdf ↗ page arXiv:2610.30821 ↗

We construct a factorizable Markov map $T$ on a hyperfinite finite von Neumann algebra and a positive element $x\in L\log L$ for which the sequence $T^n(T^*)^n x$ does not converge bilaterally almost uniformly. This answers a question of Anantharaman-Delaroche \cite{AD2006}.

comments
16 pages
fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2610.31560 ↗

Commutative Algebra1

For every pair of integers $d,n\geq1$, we construct a commutative noetherian local-Cohen-Macaulay DG-ring $A$ such that $\dim H^0(A)=d$, $\mathrm{amp}(A)=n$, $\mathrm{fpd}(A)=d-n$, and $\mathrm{FPD}(A)=d$. This gives a negative answer to the implication from local-Cohen-Macaulayness to equality of the two finitistic projective dimensions in a question of Bird, Shaul, Sridhar, and Williamson.

fields
Commutative Algebra
pdf ↗ page arXiv:2610.31392 ↗

History and Overview1

A common concern is that using large language models (LLMs) lets students offload mathematical work that tasks are designed to elicit. Yet such claims often rest on outcomes (e.g., submitted solutions), rather than on evidence of students' work with LLMs. We followed 23 first-year linear algebra students as they solved three differently designed homework tasks with LLMs. Drawing on self-regulated learning and choice-affluent environments, we interpreted each of 429 prompts as a trace of a regulatory event and compared 59 chatlogs with the problem solutions the students submitted. Prompts formed five structures, casting the LLM mainly as a solver, explainer, or validator. The mix of structures shifted across the tasks, and ten of the 15 students who completed all three tasks changed their dominant structure. Most final submissions stayed close to LLM output, including those that followed exchanges in which students had explained, conjectured, and checked their own ideas. We conclude that an LLM-aided submission is not a trustworthy marker of students' offloading of the mathematical work, and that offloading needs to be examined in each regulatory space and part by part rather than as a whole.

comments
44 pages. Preprint under consideration at Digital Experiences in Mathematics Education; not peer reviewed
fields
History and Overview
pdf ↗ page arXiv:2610.31335 ↗

K-Theory and Homology1

Antonini, Azzali and Skandalis proved that, for every countable discrete group $Γ$, the canonical map $EΓ\to\underline{E}Γ$ induces a split injection in equivariant $KK$-theory with real coefficients. In this paper, we give a more elementary proof of the corresponding rational injectivity result in ordinary equivariant $KK$-theory without using $\mathrm{II}_1$ factors.

fields
K-Theory and Homology, Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2610.31174 ↗

Get each issue by email →