Paperlane

no. 5 · from the archive← Wed 28 Oct archive Mon 2 Nov →

Friday, 30 October 2026

1349 papers in 32 fields

Analysis of PDEs106

We study periodic homogenization of a parabolic equation with linear, degenerate bulk terms in a perforated domain, with a monotone nonlinear Robin reaction of order $\varepsilon$ on the pore walls. The storage coefficient may vanish on sets of positive measure, and the diagonal diffusion weights are not bounded below but satisfy an inverse-integrability condition. Under positivity of the mean storage, a quantitative cell-detection estimate yields strong compactness of the states and of the scaled traces. The effective equation has positive storage, a positive-definite diffusion matrix given by a weighted cell problem, and a nonlinear volume reaction obtained by averaging over the pore surface. We also prove a strong weighted-gradient corrector and uniform-in-time convergence of the dissipated and stored energies and of the states in the storage-weighted $L^2$ norm.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.37787 ↗

We prove the local $L^4$ Strichartz estimate without derivative loss for the Zakharov–Kuznetsov flow on $\mathbb{R}\times\mathbb{T}$. This reaches the sharp spatial regularity endpoint and implies the embedding $X^{0,b}\hookrightarrow L^4$ for every $b>1/2$. The proof reduces the estimate to a semi-algebraic mixed-measure estimate.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.37805 ↗

We introduce a new variational framework for the study of standing waves for nonlinear Schrödinger equations with combined power nonlinearities. The approach is based on minimizing the mass functional over a set defined by an upper bound on the energy and a lower bound on a nonlinear potential term, rather than minimizing the energy at prescribed mass. This yields a new characterization of the sharp Gagliardo–Nirenberg optimizer through purely variational constraints. As a consequence, we establish the existence of minimizers for all energy levels below a critical threshold and derive the corresponding Euler–Lagrange equations. These minimizers give rise to standing-wave solutions of the nonlinear Schröedinger equation

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.37814 ↗

For every $p > 1$, we establish uniqueness and comparison principle for Trudinger's parabolic equation \[ \partial_t (|u|^{p-2}u) = \text{div}(|\nabla u|^{p-2}\nabla u) \quad \text{in } Ω\times (0,\text{T}), \] assuming suitable Hölder regularity for the boundary values. Our comparison principle applies to sign-changing weak sub- and supersolutions. As an application, we obtain uniqueness of weak solutions to Cauchy–Dirichlet problems when the lateral boundary data is suitably Hölder continuous in time. In particular, Lipschitz continuous boundary values are covered.

comments
24 pages, comments are welcome!
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.37835 ↗

We study a traveling wave formulation of the viscous Saint-Venant system in one spatial dimension with capillarity, which can be reduced to an equivalent nonlinear third order ODE. We construct heteroclinic orbits for small positive capillarity, for arbitrary positive capillarity under an explicit small Froude number condition, and in a small-amplitude regime away from the critical Froude number. These then give rise to smooth traveling bore wave solutions to the viscous Saint-Venant system.

comments
24 pages, 2 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.37879 ↗

Let $Ω\subset\mathbb{R}^N$ ($N\geq2$) be measurable with $0<|Ω|<\infty$, and let $u_Ω$ be its logarithmic potential ($N=2$) or Newtonian potential ($N\geq3$), normalized so that $Δu_Ω=χ_Ω$. We prove the sharp inequality \[ \int_Ω|\nabla u_Ω|^2\,\mathrm{d} x \leq\frac{1}{2Nω_{N-1}} \iint_{Ω\timesΩ}\frac{\mathrm{d} x\,\mathrm{d} y}{|x-y|^{N-2}}, \] where $ω_{N-1}=|\mathbb{S}^{N-1}|$, with equality if and only if $Ω$ is a ball up to a null set. In dimension two this settles the $L^2$ Ahlfors–Beurling conjecture of Fleeman and Khavinson. For $N\ge3$ it is equivalent to the scale-free bound that at most the fraction $(N-2)/(2N)$ of the total field energy lies inside $Ω$. We also obtain an explicit deficit identity, a sharp extension to bounded nonnegative densities, and consequences for torsional rigidity, Bergman analytic content, Brownian motion, and aggregation equations.

comments
29 pages
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2610.37886 ↗

Designing a composite requires understanding which effective properties can be achieved through varying its microstructure, i.e., the spatial arrangement of given constituent materials. Hierarchical laminates, created by successive layering, reach many known limits on these properties, making it natural to ask whether they can reproduce every effective response obtainable from the same constituents. We answer this question negatively for planar two-phase composites governed by linear systems whose potentials have 16 or more components. We construct constituent material properties and, at any prescribed nontrivial phase fraction, periodic microstructures whose effective properties cannot be approximated by hierarchical laminates, even when layer directions, proportions, and the number of layering steps are unrestricted. We design the constituents so that all hierarchical laminates have equal effective energies at two prescribed mean gradients. The key step is to construct a medium whose local properties are those of horizontal laminates with smoothly varying phase fractions, but whose effective energies violate this equality. Approximating these energies with sufficiently fine periodic stripes of the original constituents yields the two-phase counterexample. This construction also gives a negative answer to the two-well relaxation problem: the minimum of two positive-definite homogeneous quadratic forms on $\mathbb{R}^{2\times32}$ can have distinct quasiconvex and rank-one convex envelopes. The counterexample and the strict inequality between the envelopes are formally verified in Lean 4.

comments
32 pages, 4 figures. Main results formally verified in Lean 4
fields
Analysis of PDEs, Mathematical Physics, Optimization and Control
pdf ↗ page arXiv:2610.37899 ↗

We give a self-contained account of the classical obstacle problem, written for graduate students who wish to enter the field of free boundary problems. Starting from a one-dimensional model and an explicit radially symmetric example, we set up the variational problem, show that minimizers exist and are unique, and prove interior $W^{2,p}$-regularity as well as the optimal $C^{1,1}$-regularity. The second half of the notes is devoted to the free boundary: we prove that it is porous, introduce blow-up limits, and use the Alt-Caffarelli-Friedman monotonicity formula to show that every free boundary point is either regular or singular. These notes grew out of a mini-course at the Rio Summer School on PDEs in 2020, and they are meant to be read alongside, not instead of, the monograph by Petrosyan, Shahgholian, and Uraltseva.

comments
29 pages, 9 figures. To appear in "Modern Methods in the Analysis of Free Boundary Problems", edited by E. A. Pimentel and J. M. Urbano, Coimbra Mathematical Texts, Springer
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.37943 ↗

This paper investigates the existence and properties of interaction kernels representing nonlocal energies associated with the Riesz fractional gradient and variable, uniformly elliptic matrix fields $A(x)$. Building on our previous analysis of constant matrices in [DSV26], we establish necessary conditions on the singularity and decay of such kernels, derive an explicit representation formula under suitable regularity assumptions, and prove uniqueness of the kernel representation. We also obtain sharp asymptotics and positivity criteria near the diagonal, averaged decay estimates at infinity, and characterize the divergence free property of $A(x)$ through the decay of the kernel. Finally, we show that the associated energy may fail the truncation property and that arbitrarily small smooth perturbations of constant matrices can destroy the nonnegativity of the representing kernel. These results provide negative answers to both [SS18, Open Problems 1.9 and 1.10].

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38010 ↗

We study a class of weighted fourth-order elliptic problems in \(\mathbb{R}^4\) driven by the biharmonic operator and involving Hardy–Hénon type potentials. The nonlinear term has critical exponential growth in the sense of an Adams-type inequality. The weights \(|x|^a\) and \(|x|^b\) allow us to incorporate singular, vanishing, and unbounded effects in a unified variational framework. We introduce a suitable weighted function space, establish Sobolev-type embeddings, and prove an Adams-type inequality adapted to this setting. Under appropriate structural assumptions on the nonlinearity, we prove the existence of nontrivial weak solutions. We also obtain regularity properties and derive a Pohozaev identity, which leads to a nonexistence result.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38078 ↗

We prove the soliton resolution conjecture for infinite-order multisoliton solutions in the sharp well-posedness space $H^s(\mathbb R)$, $s>-\frac12$, and construct soliton gases in $H^{s}(\mathbb R)$ with arbitrary $s\in\mathbb R$, for the Benjamin–Ono equation. In particular, our work addresses two important open problems about inverse spectral for Lax operator, including the problem of spectral characterization of infinite-order multisolitons and that of determining the range of their asymptotic parameters. A central ingredient of our work is a spectral decomposition adapted to rough initial data. This extends the global soliton–radiation description to weakly weighted $H^s$ data while allowing infinite negative eigenvalues. Another important ingredient is a continuous norming action that extends finite inverse spectral shifts to gas limits while retaining a full continuous norming weight. Our framework provides a basis for studying infinite-order soliton resolution and the construction and asymptotics of soliton gases for nonlocal equations.

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

We study a one-dimensional Fučik-type boundary value problem (BVP) driven by the nonhomogeneous, one-dimensional $(p,q)$-Laplacian, \[ -\left(|u'|^{p-2}u' + |u'|^{q-2}u'\right)' = λ(u^+)^{p-1} - μ(u^-)^{q-1}, \qquad u(0)=u(L)=0, \qquad L>0, \] where $1<q<p$ and $λ,μ\in\mathbb{R}$. The problem is asymmetric: the positive component is paired with the $p$-power and the negative component with the $q$-power. This asymmetry prevents the standard homogeneous $p$-Laplacian scaling argument from producing explicit Fučik curves. We first prove a quadrant reduction theorem. Any positive nodal interval for a solution forces $λ>0$, and any negative nodal interval forces $μ>0$. Hence, all sign-changing solutions occur for values of $(λ,μ)$ in the positive quadrant. Outside the positive quadrant, only one-sign solutions can occur. We also formulate the equation as an autonomous planar system and establish existence and uniqueness for its initial value problem in the positive quadrant. We then impose the second Dirichlet condition through a shooting formulation and show that every zero of a nontrivial Dirichlet solution is simple and isolated. This provides the dynamical foundation for the subsequent construction and gluing of nodal humps of solutions. Inside the positive quadrant, we use a classical one-dimensional time-map method to obtain a projected-geometry description of the spectrum, or the set of values of $(λ, μ)$ for which there exist nontrivial solutions. Every nodal solution has a common energy $E>0$ shared by all positive and negative humps.

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

In this paper, we study how the propagation of particle moments depends on the fluid velocity in the Vlasov equation. We present some new moment estimates involving the velocity in this equation. As an application, we establish Ladyzhenskaya-Prodi-Serrin-type regularity criteria involving only the velocity field for weak solutions of the 3D Navier-Stokes-Vlasov system.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38274 ↗

We study the focusing mass-critical inhomogeneous nonlinear Schrödinger equation $i\partial_{t}u+Δu+|x|^{-b}|u|^{\frac{4-2b}{d}}u=0$ in dimensions $d\ge3$. For $\frac12<b<\min\{2,d/2\}$, we prove that every forward-global $H^1$ solution with mass equal to that of the ground state $Q$ either scatters forward or coincides with $e^{it}Q$, up to phase rotation and scaling. As a consequence, every solution with nonradial $H^1$ initial data at the ground-state mass must be global and scatter in both time directions. For $0<b\le\frac12$, analogous rigidity and scattering results hold under an additional finite-variance assumption. The key new ingredients in our proof are a nonradial incoming/outgoing decomposition and exterior frequency-decay estimates, which yield the kinetic-energy localization needed for a localized virial argument.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38285 ↗

We study torsional rigidity on finite compact connected metric graphs with real \(δ\)-vertex strengths in the regime of strictly positive torsion. For a fixed total length \(L>0\), let \(I_+\) be the sum of the positive strengths and \(I_-\) the sum of the magnitudes of the negative strengths, with \(I_+>I_-\). We determine the sharp infimum and the exact threshold for a finite universal supremum. The supremum is finite precisely when \(I_-<I_+/(1+LI_+)\). In this regime, an interval with strengths \(I_+\) and \(-I_-\) at opposite endpoints attains the sharp Saint–Venant bound. At and beyond the threshold, torsional rigidity is unbounded even among three-vertex paths with the same data and strictly positive torsion. The sharp infimum is \(L^2/(I_+-I_-)\) throughout the range \(I_+>I_-\ge0\). It is not attained by any finite graph and is approached by graphs with two vertices joined by increasingly many parallel edges of equal length, preserving both strength totals separately. A vertex-matrix formulation and explicit path examples clarify the relation between strength placement, spectral positivity, and solvability.

fields
Analysis of PDEs, Combinatorics
pdf ↗ page arXiv:2610.38330 ↗

We consider the scalar field equation $$\begin{cases} -Δu+u+λ|u|^{q-1}u =μ|u|^{p-1}u, & x\in\mathbb R^n,\\[2mm] u(x)\to 0, & |x|\to\infty, \end{cases}$$ where $n\geq3$, $1<q<p<(n+2)/(n-2)$, and $λ,μ>0$. We study uniqueness and radial nondegeneracy of its sign-changing radial bound states. The proof combines a comparison argument for the shooting variation across nodal intervals with uniform compactness estimates for families of bounded nodal number and continuation in a normalized parameter. We show that, for every integer $k\geq1$, fixing the centre and requiring $u(0)>0$ leaves exactly one radial bound state with $k$ nodes. Its radial linearized operator has trivial kernel in the radial space. For each fixed $k$, the corresponding normalized solutions form a global $C^1$ branch.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38347 ↗

We study the lifespan \(T^*(\varepsilon)\) of classical solutions to the Cauchy problem for the one-dimensional quasilinear wave equation $u_{tt}-(c(u)^2u_x)_x=0$, with initial data of size $\varepsilon>0$. We assume that $c'(θ)\sim a|θ|^{p-2}$ as $θ\to 0$, where \(a>0\) and \(p>3\) or $p=2$. We obtain explicit asymptotic formulas for $T^*(\varepsilon)$ as $\varepsilon\downarrow0$. We treat both the case $ψ\in L^1(\mathbb R)$ and the case $ψ=ψ_1+\Braket{x}^{-α}$, where \(ψ_1\in L^1(\mathbb R)\) and \(0<α\le1\). Our results identify the dependence of the lifespan scale on the decay exponent, including the borderline case $α=1$. The proof combines Riccati equations along characteristics with a scaling argument inspired by Lindblad.

comments
20 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38353 ↗

We study the genericity of singularities of types $A_2,A_3,D_4^\pm$ in solutions of the equations of gas dynamics and nonlinear geometrical optics. The sets of solutions satisfying the corresponding transversality conditions are proved to be open and dense in spaces of smooth and real-analytic solutions equipped with the Whitney topology on compact sets.

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

We establish the generalized Hyers-Ulam stability of the Fréchet-type functional equation \begin{align*} \sum_{\emptyset \neq I \subset \{ 1, 2, \ldots, n+1 \}} (-1)^{|I|-n+1} f \Bigg( \sum_{i \in I} x_i \Bigg) = 0 \end{align*} in the sense of Găvruţa.

comments
14 pages, no figures, original manuscript
fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2610.38409 ↗

We establish sharp fractional Hardy inequalities in the critical regimes $sp=d$ and $sp=1$, with explicit logarithmic weight functions. In the whole-space setting, for $p>d\ge 1$, $sp=d$, we prove that \begin{equation*} \int_{\mathbb R^d} \int_{\mathbb R^d} \frac{|u(x)-u(y)|^p}{|x-y|^{2d}}\,dx\,dy \geq \left(\frac{p-1}{p}\right)^p \int_{B_R}|u(x)|^p W_{p,d,R}(x)\,dx, \end{equation*} for $u\in C_c(B_R)$, where $W_{p,d,R}$ is a logarithmic-type weight and the constant is sharp. We also show that the corresponding inequality with the simpler weight $|x|^{-d}(\log(R/|x|))^{-p}$ cannot hold with any positive constant. Furthermore, we derive two-sided estimates and asymptotic formulae for $W_{p,d,R}$, including its limiting connection with the classical Hardy inequality. In the half-space $\mathbb{R}^{d}_{+}$, we establish an analogous sharp fractional Hardy inequality in the critical case $sp=1$, with an explicit logarithmic weight depending on the distance to the boundary. We also investigate the asymptotic behaviour of this weight, obtaining estimates that describe its behaviour near the boundary. These results elucidate the role of logarithmic weights in critical fractional Hardy inequalities in both whole-space and half-space settings.

comments
22 pages
fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2610.38420 ↗

This paper presents a rigorous mathematical analysis of inverse scattering for periodic surfaces through a multilayer superlens. Using the transformed field expansion, we derive a highly explicit reconstruction formula. We theoretically prove that under perfect matching, the reconstruction factor is independent of the number of layers and depends solely on the total material thicknesses, achieving uniform boundedness when the slab thickness dominates. By establishing first-order perturbation formulas and high-frequency asymptotics, we quantify how small material losses induce exponential amplification of high-frequency errors. Crucially, we show that increasing the number of layers substantially reduces this amplification coefficient. Consequently, for fixed total thicknesses, multilayer structures offer significantly improved stability and extended resolution limits for subwavelength reconstruction.

comments
31 pages, 7 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38423 ↗

We study a two-phase parabolic free boundary problem arising as the segregation limit of a competition-diffusion system with strong interactions and fully nonlinear diffusion. The positive and negative phases are governed by different equations and are coupled through global viscosity inequalities. We construct viscosity solutions that are Lipschitz in space and $1/2$-Hölder in time, and establish differentiability in space across the free boundary, including at singular points. At regular points, we prove that the solution has a parabolic $C^{1,α}$ asymptotic expansion, and deduce that the free boundary is locally a $C^{1,α}$ hypersurface. The proof relies on a parabolic Alt-Caffarelli-Friedman monotonicity formula to classify blow-up limits, followed by an improvement of flatness argument.

comments
34 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38480 ↗

We study the three-dimensional defocusing cubic nonlinear wave equation with homogeneous Dirichlet boundary condition in the exterior of the unit ball, $Ω=\R^3\backslash\overline{B(0,1)}$, for radial initial data. For every $\frac12\leq s\leq\frac34$, we establish global well-posedness in $\dot H^s_{D,rad}(Ω)\times\dot H^{s-1}_{D,rad}(Ω)$, including the critical endpoint $s=\frac12$, without an additional $L^4$ assumption on the initial displacement. The proof uses the distorted Fourier transform associated with the Dirichlet Laplacian to establish radial Sobolev embeddings, including the quantitative estimate $\|f\|_{L^p(Ω)}\leq C\sqrt p\,\|f\|_{\dot H_D^{1/2}(Ω)}$ for $4\leq p<\infty$, with $C$ independent of $p$. We combine a nonlinear Fourier truncation argument with the critical Strichartz estimate to construct a global nonlinear component with high-frequency-truncated initial data. For the remainder, we construct a local energy solution in an affine energy space and derive a logarithmic energy inequality that prevents finite-time energy blow-up. Persistence of the original Sobolev regularity, uniqueness, and local Lipschitz dependence on each finite time interval complete the proof.

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

We construct electromagnetic potentials on arbitrary open 3-dimensional sets for anisotropic, non-homogeneous materials, thus rendering any topological assumption like simple connectedness or the absence of holes superfluous in this context. The main idea is to invoke the extended Maxwell system the easy solution theory of which then yields existence of both scalar- and vector potentials.

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

In this paper, we establish orbital stability of smooth zero-background solitary waves for the modified Camassa–Holm equation in $H^1(\R)\cap W^{1,4}(\R)$ for the full range $γ<c<2γ$. The main difficulty is that spectral coercivity of the Hessian does not by itself yield nonlinear coercivity in this topology, because normalized perturbations may develop derivative concentration. In order to overcome this obstruction, we apply a penalized Lyapunov functional and introduce a derivative factorization. The key ingredient is a concentration-coercivity principle for the normalized Lyapunov energy, which yields local nonlinear Lyapunov coercivity. Our result extends the $H^1(\mathbb R)\cap W^{1,4}(\mathbb R)$ orbital-stability results of Li and Liu [Ann. PDE, 2021] and Zhang and Zhu [JDE, 2025] to the entire parameter range $γ<c<2γ$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38514 ↗

For a class of systems of two parabolic equations with equal diffusion and homogeneous Dirichlet boundary conditions, we show the existence of finite time blow-up solutions, although the corresponding system of ODE's has only global, exponentially decaying solutions. Such a phenomenon of blow-up induced by equal diffusions, which originates in the works of Bebernes-Lacey [SIAM J. Math. Anal. 21 (1990), 1415–1425, and J. Differential Equations 95 (1992), 105–129] and Weinberger [J. Differ. Equations 154 (1999), 225–237], was previously known, for instance, in the case of homogeneous Neumann boundary conditions, but it had remained an open question whether it can happen in the homogeneous Dirichlet case. The latter, which corresponds to an absorption or cooling of the system at the boundary, that is a priori more stabilizing, requires nontrivial new ideas. As another new feature, we show that this can happen even if the nonlinearity acts only on a compact sub-region, and our proof actually covers the Neumann and Cauchy, as well as Dirichlet problems in a unified way.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38542 ↗

We study a two-dimensional incompressible two-fluid system: an inviscid, irrotational Euler phase and a viscous, conducting MHD phase, separated by a free interface. We prove a conditional quantitative no-splash criterion for smooth solutions in a specified admissible class. In addition to a bound on the trace of the Euler velocity, an initial bound on the magnetic trace and bounds on the bulk vorticity, this class imposes bounds on the interface Biot–Savart potential and its tangential derivative, fixed exponential vertical localization, and the normal derivative of the bulk vorticity at the interface together with one tangential derivative of it. It also requires a Biot–Savart representation of the Euler velocity up to a bounded-gradient harmonic part and a positive initial chord-arc bound. Under these assumptions the chord-arc functional has a uniform positive lower bound on $[0,T]$, depending only on the interval length, the decay width and the a priori bound, after an enlargement that absorbs the surface tension and the densities. The proof combines a maximum-principle analysis of the interface-vorticity equation, in which the magnetic field enters through the Lorentz term and the pressure jump, with a geometric reduction in the style of Fefferman–Ionescu–Lie.

comments
76 pages. All comments are welcome
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38555 ↗

We combine spectral perturbation with orthogonal transformations in $H_0^1(Ω)$ to study singular Moser-Trudinger inequalities under the energy constraint $\int_Ω|\nabla u|^2\,dx\le1$, where $Ω$ is a smooth bounded planar domain containing the origin. For the weight $|x|^{-2β}$, $0\leβ<1$, the positive maximizer is unique for small $α>0$, and the sharp global stability constant satisfies \[ C_α=\fracα{2} \left(\frac1{μ_1}-\frac1{μ_2}\right)+O(α^2), \qquad α\downarrow0, \] where $μ_1<μ_2$ are the first two weighted Dirichlet eigenvalues. We compute the second asymptotic coefficient by a weighted quartic maximization on the second eigenspace, even when the second eigenvalue is multiple. An exact reduction to the sphere orthogonal to the maximizer identifies the attaining functions and yields a limiting global-to-local ratio of $1/2$. On the disk, the energy derivative with respect to the central value characterizes radial constrained degeneracy and yields finitely many exceptional normalized parameters. Combined with known critical uniqueness and nondegeneracy, this gives uniform quadratic stability near criticality, while compactness and analytic reduction yield finite-power stability throughout the admissible range.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38592 ↗

We study a quasilinear elliptic problem involving the $p$-laplacian operator and a slightly subcritical nonlinearity with a sign-changing weight. We assume that the slightly subcritical nonlinearity is a regularly varying function at zero and at infinity, which are not necessarily asymptotic to a power at infinity. We state sufficient conditions which guarantee a Palais-Smale condition. We also provide a bifurcation theorem for these nonlinearities, which allow us to state the existence of a bifurcated branch of positive solutions, containing a turning point, and multiplicity of solutions.

journal
Topological Methods in Nonlinear Analysis Volume 67, No. 2, 2026, 589-617
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38596 ↗

We prove well-posedness for a stochastic Lin-Liu model of modified liquid crystals, coupling an incompressible fluid to a director field under transport and multiplicative noise. On smooth bounded domains in two dimensions, we prove global well-posedness for energy-class initial data, provided the leading coefficient of the polynomial director potential is positive. On the torus, we establish local well-posedness in time-weighted $L^p$-$L^q$ frameworks with Besov initial data, including regimes of low and negative regularity.

comments
Contribution to the Oberwolfach Report for the Seminar 'Stochastic Partial Differential Equations in Critical Spaces' organised by Antonio Agresti and Mark Veraar
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2610.38641 ↗

We study the existence of positive normalized solutions for the nonlocal Kirchhoff equation with partial harmonic confinement \[-\left(a+b\int_{\mathbb{R}^{3}}|\nabla u|^{2}\,dx\right)Δu +(x_1^2+x_2^2)u+λu=|u|^{p-2}u,\] subject to the mass constraint $\int_{\mathbb{R}^{3}}|u|^2\,dx=μ$, where $a,b>0$ are constants, $\frac{14}{3}<p<6$, $μ>0$ is a prescribed mass, and $λ\in\mathbb{R}$ is a Lagrange multiplier associated with the mass constraint. For every sufficiently small $μ>0$, we prove the existence of two positive normalized solutions. One of these solutions is a local minimizer, while the other is obtained at a mountain-pass level. The construction of the local minimizer relies on a combination of profile decomposition and a new nonlocal merging technique, yielding compactness up to translations in the unconfined $x_3$-direction. The mountain-pass solution is obtained by considering positive solutions defined on expanding balls. A uniform bound on the Morse index allows us to obtain a spectral estimate for the limiting Lagrange multiplier. Together with an energy comparison, this spectral estimate yields strong convergence in the energy space and recovers both the prescribed mass and the Kirchhoff coefficient.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38650 ↗

We study the long-time behavior of the Hartree–Fock equation with Coulomb interaction in dimensions $d\geq2$ for small initial density matrices of possibly infinite rank. We prove global well-posedness and modified scattering governed by a resonant Hartree-Fock equation. Our approach is based on the half-density formulation and a final-state construction for the resonant dynamics. We also characterize the stationary states of the resonant Hartree–Fock equation and prove that ordinary linear scattering fails when the initial density matrix has rank at least two. These results extend long-range modified scattering to genuinely operator-valued infinite-rank Hartree-Fock evolution. Despite cancellation between the direct and exchange terms, the long-range effect persists, with resonant dynamics evolving on the same logarithmic time scale as in the Hartree equation.

comments
42 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38676 ↗

We study the mean first-reaction time (MFRT) of a Brownian particle in a bounded three-dimensional domain $Ω$ with a reflecting boundary $\partialΩ$, that contains a thin reactive filament. The filament is a tube of cross-sectional diameter $\varepsilon\ll 1$ around a smooth closed curve $Γ$, and its surface is partially reactive with reactivity $b$. As $\varepsilon\to 0$ the filament reduces to a line source in the outer problem. Its cross-section enters only through a logarithmic reactive capacitance $d_c(b)$, so that the MFRT is $\mathcal{O}(-\log[\varepsilon d_c])$. This contrasts with the $\mathcal{O}(\eps^{-1})$ scaling for spatially localized traps of radius $\eps$. Using matched asymptotic expansions, we derive a Fredholm integral equation on $Γ$ for the line density of the reactive flux. It sums all powers of $ν\equiv -1/\log[\varepsilon d_c]$ and involves two geometric quantities: the regular part $R$ of the Neumann Green's function, which encodes the interaction of $Γ$ with $\partialΩ$, and an intrinsic self-energy of $Γ$ that depends only on its shape. The framework extends to multiple filaments, splitting probabilities, a spatially heterogeneous diffusivity, and the principal eigenvalue of the Laplacian. For the unit sphere we solve the integral equation with a simple trapezoidal Nyström scheme, and we validate the predictions for rings, linked rings and torus knots against full 3-D finite-element solutions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38715 ↗

We study the hard-sphere Boltzmann equation near a global Maxwellian and have found the bifurcation between the stability and instability in $H_{x}^{s}$ Sobolev space. We prove a strong-weak type instability result in the $s<1$ regularity regime, and establish the global stability under the regularity $s>1$ via the interplay between the dissipation and dispersive effects. In this intricate competition of dispersion, dissipation, large-velocity growth, and the asymmetric nature of the gain and loss terms, we prove that the instability is jointly generated by the dispersive effect and the loss term structure. To reach the sharp regularity for the global stability, we incorporate the dispersive effect into the dissipative energy framework for the analysis near equilibrium. This hence concludes sharp threshold and provides a complete characterization of global well-posedness near equilibrium.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38759 ↗

We establish the general-relativistic limit of f(R) gravity coupled to a massless scalar field for small, asymptotically Euclidean, well-prepared Cauchy data near Minkowski spacetime. We prove global existence and future causal geodesic completeness, with uniform estimates for the metric, matter, and rescaled effective field as an admissible family of modified Lagrangians f(R) approaches the Einstein-Hilbert Lagrangian R. The physical and conformal metrics and the matter field converge to the limiting Einstein-massless-scalar development, uniformly on the entire future spacetime, together with finitely many space and time derivatives. The effective field, defined by a nonlinear reparametrization of the physical scalar curvature, converges to the scalar curvature of the limiting Einstein development. The main analytical difficulty is that the effective-field mass tends to infinity, while its evolution equation becomes an algebraic trace relation. Small field amplitudes may coexist with high-frequency oscillations and comparatively large derivatives, whose quadratic contributions must be controlled uniformly. Using the Euclidean-hyperboloidal foliation method and adapted wave coordinates, we analyze a quasilinear wave-Klein-Gordon system whose nonlinearities do not satisfy the classical null condition. We combine oscillatory estimates, weighted interior and exterior energies, and propagation estimates for the discrepancy from the Einstein trace relation. Quantitative convergence on compact regions and uniform spacetime decay yield global convergence.

comments
222 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38795 ↗

In this article, we establish the interior gradient estimates for $k$-Hessian equations with measure data. We use the ideas from the potential theories for the $p$-Laplacian type equations and pointwise estimates of $k$-subharmonic functions by Labutin. The interior gradient regularity is optimal for $k\geqslant3$, while for $k=2$, we prove the interior $W^{2,1+\varepsilon}$ and $C^{1,α}$ estimates for $2$-subharmonic solutions.

comments
37 pages. Comments are welcome!
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38846 ↗

We investigate the interaction between a vanishing obstacle and the vanishing viscosity limit in the setting of the inhomogeneous incompressible Navier-Stokes equations with no-slip boundary conditions. We work in the space exterior to a small obstacle in three dimensions. We prove quantitative convergence rates, assuming that the obstacle is sufficiently small, namely smaller than a constant times the viscosity. The convergence holds as long as the solution to the limit problem is known to exist and stays sufficiently smooth. This extends the results of Iftimie, Lopes Filho and Nussenzveig Lopes to the inhomogeneous Navier-Stokes equations. Moreover, we can show improved convergence rates and convergence of the gradient in $\mathbb{R}^3$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38881 ↗

We classify the local blowup masses of constant-coefficient Toda systems for all simple Lie algebras with one prescribed singular source, bounded component masses, and bounded boundary oscillations. We encode the source strengths and the blowup masses by two elements of the Cartan subalgebra: the grading element $p_μ$ and the mass element $q_σ$. We show that $p_μ-q_σ=wp_μ$ for some Weyl group element $w\in W$. The proof uses the Drinfeld-Sokolov gauge and the resulting holomorphic $W$-invariants for Toda systems. Asymptotic analysis near the source and on a shrinking circle enclosing the total local mass gives two evaluations of the leading Laurent coefficients of the $W$-invariants, which agree by holomorphicity. This agreement enables us to conclude the above Weyl-orbit result. In particular, the quadratic constraint is the local Pohozaev identity. Only with the full set of $W$-invariants can we strengthen earlier orbit-plus-integer restrictions to an exact Weyl-orbit characterization in the constant-coefficient setting. Together with the author's explicit families in [Nie], this determines all attainable local mass vectors.

comments
18 pages, comments are welcome
fields
Analysis of PDEs, Differential Geometry, Representation Theory
pdf ↗ page arXiv:2610.38905 ↗

In this work, we assess the well-posedness of the Smoluchowski coagulation-fragmentation equation with fractional Laplacian. In particular, we consider a truncated set of discrete Smoluchowski-type equations modeling the formation of clusters, with homogeneous Neumann boundary conditions, where the diffusive term describes a non-standard behavior in the movement of particles ('anomalous' diffusion).

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

This chapter provides a short survey of recent developments in the controllability of nonlocal partial differential equations. We first review controllability results for evolution equations involving nonlocal spatial operators. Particular attention is devoted to unique continuation properties, observability inequalities, and Carleman estimates in establishing controllability properties. We then discuss controllability issues for partial differential equations with memory terms, highlighting how memory effects influence reachable states, null controllability, and exact controllability. We review and compare various analytical techniques developed to overcome the difficulties arising from the nonlocal structure. We also provide a critical assessment of some of these methods. Throughout the chapter, we emphasize the interplay between controllability and observability, the adaptation of classical control methods to nonlocal settings, and the distinctive phenomena that arise in comparison with local equations. We then discuss geometric inequalities and their role in the controllability of diffusion models. The chapter concludes with a discussion of current challenges and several open problems, aiming to provide directions for future research.

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

We extend the notion of non-local almost minimal sets introduced in [Dipierro, Valdinoci, and Villa, J. Math. Pures Appl. (2026)] by admitting lower-order powers for the remainder term. We combine classical techniques and a new, weaker version of the Euler-Lagrange inequalities (at a microscopic scale) to obtain $\mathcal{C}^{1,α}$-regularity for non-local almost minimal sets, up to Hausdorff dimension $n-3$. In turn, this formulation is well-suited for the non-local counterpart of the so-called Massari's problem for sets with prescribed mean curvature. In particular, such a generalization allows us to consider sets with $L^p$ non-local mean curvature (with $p\geq n/s$), which do not satisfy any curvature equation (neither in the classical nor in the viscosity sense). The results presented here lie beyond the reach of previously established methodologies. Indeed, the approach developed herein is based on a conceptual shift relative to the existing literature, which relied on a strong form of the Euler-Lagrange equation that is not available for general non-local almost minimal sets.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.38940 ↗

We study the effect of constant vorticity on the Benjamin-Feir instability of small-amplitude Stokes waves in infinite depth. Working with the full water-wave equations, we rigorously establish a transition between modulational instability and stability as the vorticity crosses a critical value. We consider right-propagating waves with constant vorticity $γ$, associated with the background shear current $-γy\mathbf e_x$, and normalize the gravitational acceleration and carrier wavenumber to one. For each fixed $γ<2/\sqrt{3}$, we prove that sufficiently small-amplitude Stokes waves are Benjamin-Feir unstable. For each fixed $γ>2/\sqrt{3}$, these waves are spectrally stable with respect to longitudinal, long-wavelength perturbations. These results rigorously confirm, away from the critical value, the stability transition predicted by the formal nonlinear Schrödinger approximation of Thomas, Kharif, and Manna.

comments
49 pages; companion Mathematica files are available upon request
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39000 ↗

We establish the existence of radial nodal solutions for a class of zero-mass $(p,q)$-Laplacian equations in $\mathbb{R}^N$ with a Hardy-Hénon type weight $|x|^α$. The absence of lower-order potential terms motivates the use of a homogeneous radial variational framework adapted to the mixed $p$- and $q$-growth structure. A key ingredient is a weighted Sobolev embedding theorem that establishes continuity and compactness in the appropriate range of exponents and identifies the sharp interval for continuous embedding. Building on these results, we construct sign-changing radial solutions through a variational method based on radial partitions and critical levels. The main result asserts that, for every $k\in\mathbb{N}$, the problem admits a radial weak solution with exactly $k$ nodal zeros. The proof combines minimization on Nehari manifolds over radial subdomains with an optimization procedure that determines the nodal radii and ensures the compatibility of the solution across nodal interfaces.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39063 ↗

We study pointwise estimates for positive, $C^4$-solution $u$ to the fourth-order Hénon equation \[ Δ^2 u = |x|^σu^p \quad \text{in } \mathbf R^n \setminus \{0\} \] with $n \geq 5$, $p>1$, and $σ>-4 $. In an earlier work published in J. Anal. Math. 140 (2020) 371-394, Z. Guo, X. Huang, L. Wang, and J. Wei established the following pointwise estimate \[ -Δu \geq \frac 2{n-4} \frac{|\nabla u|^2}u + \sqrt{\frac {n(n-4)}{n^2-4}} u^\frac{n}{n-4} \quad \text{in } \mathbf R^n \setminus \{0\} \] for radial solutions to the critical, fourth-order Lane-Emden equation, namely $σ= 0$ and $p=(n+4)/(n-4)$. Inspired by this interesting result, we establish a similar pointwise inequality \[ -Δu \geq \frac 2{n-4} \frac{|\nabla u|^2}u + \sqrt{\frac 2{p+1- \frac 8{n(n-4)}}} |x|^{\frac σ2} u^\frac{p+1}2 \quad \text{in } \mathbf R^n \setminus \{0\} \] for radial solutions to the fourth-order Hénon equation in $\mathbf R^n \setminus \{0\}$ for any $σ\geq 0$ and $p \geq (n+4 + σ)/(n-4)$. We also show that the constant $2/(n-4)$ is sharp and that the thresholds $σ\geq 0$ and $p \geq (n+4 + σ)/(n-4)$ are necessary. As in our previous study on the case of $\mathbf R^n$, our proof is also based on the Bernstein technique via the maximum principle, hence appears to be simpler and more constructive. However, to avoid possible singularity at the origin, we develop a Bernstein technique in one-dimensional space, which is capable of handling equations in punctured spaces.

comments
21 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39134 ↗

This paper concerns the lifespan estimate for three-dimensional ideal incompressible MHD systems. By introducing $L^{3/2}$-type energy, we lower the regularity assumption for the initial data as well as the order of the highest derivatives involved in the total weighted energy estimate. The new weights proposed in this paper are symmetric, unified, and compatible with both $L^2$-type energy and $L^{3/2}$-type energy.

comments
submitted version in January 2026
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39137 ↗

This paper develops a new uniqueness framework for inverse scattering problems for the time-harmonic Schrödinger equation using multi-frequency data. Our approach is based on a Paley-Wiener-type theorem that characterizes the support of the potential through the asymptotic growth of a generalized Fourier integral along imaginary frequencies, allowing for nontrivial amplitude functions. Within this framework, we obtain two major results on identifying the shape of the support of the potential in three dimensions, for both the plane-wave incidence and point source incidence, respectively. For plane-wave incidence, we prove that the location and shape of the convex compact support of an essentially bounded potential are uniquely determined by fixed-angle far-field data from two opposite incident directions or by backscattering far field data, provided that the potential is real-valued and sign-definite near the boundary of its support. For point-source incidence, we show that near-field backscattering data, namely the scattered field evaluated at the source point as the source ranges over a sufficiently large sphere, uniquely determine the location and shape of the convex support under the same assumptions on the potential. The proofs rely on meromorphic extension and the Paley-Wiener-type theorem.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39142 ↗

We prove global existence of the Cauchy problem of a Schrodinger equation with the logarithmic laplacian and a pure power linearity. We address the focusing and the defocusing cases, and we obtained a sharp blow-up in time result.

comments
All comments are welcome
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39146 ↗

This five-part series establishes the first systematic theory of capillary–gravity water waves carrying compactly supported vorticity with fixed positive circulation. Treating the free surface and the vortex as coupled unknowns, we study the well-posedness of traveling-wave equilibria, including the existence and continuation of solution branches with respect to bifurcation parameters, as well as their variational structure, geometric rigidity, canonical classification, and conditional dynamics. In this first paper, we construct small-speed solitary waves carrying a point vortex of fixed circulation by solving the free-surface Bernoulli equation and the regular-drift condition simultaneously. We derive the free-surface expansion through fourth order, including the first capillary correction, and second-order corrections to the conformal and physical vortex depths. We also characterize vortex equilibria in prescribed domains through the Kirchhoff–Routh function, proving existence and uniform localization. A joint Lyapunov–Schmidt reduction then regularizes the point vortex into a smooth, compactly supported vorticity core while preserving its circulation and the prescribed vorticity law. Finally, in the periodic setting, we construct a local branch under a nonresonance condition and show that the vortex depth diverges logarithmically as the wave speed approaches a positive limit, in contrast to its inverse-speed growth in the solitary-wave setting.

comments
76 pages, 2 figures, 1 table
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39149 ↗

This five-part series establishes the first systematic theory of capillary–gravity water waves carrying compactly supported vorticity with fixed positive circulation. Treating the free surface and the vortex as coupled unknowns, we study the well-posedness of traveling-wave equilibria, including the existence and continuation of solution branches with respect to bifurcation parameters, as well as their variational structure, geometric rigidity, canonical classification, and conditional dynamics. In this second paper of the series, we apply the Haziot-Wheeler analytic continuation theorem to extend the small-speed point-vortex branch constructed in Part I to a global curve of coupled equilibria. We establish two alternatives: either the geometric control quantity diverges, or it remains bounded along a sequence of solutions with no strongly convergent subsequence. If the second alternative occurs, we use concentration–compactness to obtain a finite profile decomposition without assuming monotonicity of the free surface: a nontrivial centered vortex wave and finitely many reflected pairs of irrotational waves, with a remainder converging strongly to zero. At any simple speed fold, a Schur-complement reduction in the physical vortex coordinate shows that the static energy-momentum Hessians of the two nearby equal-speed waves differ by one in negative index within the symmetric class. Finally, we use a joint two-parameter Lyapunov–Schmidt reduction to extend the regularization of Part I to compact arcs of the global solution curve, carrying the canonical smooth-core branches through their specified simple speed folds. These results provide a global point-vortex reference for the variational construction in Part III and canonical smooth-core comparison arcs for the rigidity and uniqueness theory in Part IV.

comments
75 pages, 3 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39163 ↗

We investigate the existence and non-existence of anti-symmetric solutions to the fractional Lane–Emden system in the half-space $\mathbb{R}^n_+$: \begin{equation*}\begin{cases} (-Δ)^s u = v^p & \text{in } \mathbb{R}^n_+, (-Δ)^s v = u^q & \text{in } \mathbb{R}^n_+, \end{cases}\end{equation*} where $0<s<\frac{1}{2},p,q>0,2s+p=1$, with $u,v$ nonnegative in $\mathbb{R}^n_+$ and anti-symmetric with respect to $\partial\mathbb{R}^n_+$. Li and Zhuo [2023, Sci. China Math.] previously proved non-existence in $L_{2s}$, as well as non-existence in the extended space $L_{2s+1}$ when $1-2s<p,q<\frac{n+2s}{n-2s}$ and existence in $L_{2s+1}$ when $p+2s<1,q+2s<1$. In this paper, we fill the remaining borderline case $p=1-2s$ in $L_{2s+1}$ space. We establish a non-existence result for $1-2s=p\leq q\leq\frac{n+2s}{n-2s}$ and an existence result for $0<q<p=1-2s$. For the non-existence result, we combine a maximum principle for anti-symmetric functions with the method of moving planes to derive a Liouville–type theorem when $1-2s<q\leq\frac{n+2s}{n-2s}$. We then iterate the lower-bound estimates to obtain a contradiction through blow-up. To prove the existence of nontrivial solutions when $0<q<1-2s$, we construct a nonhomogeneous solution by a monotone iteration scheme in $L_{2s+1}$ as well as analyze a homogeneous profile. Surprisingly, the homogeneous profile serves as a universal lower bound for all solutions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39165 ↗

The work deals with establishing the global well-posedness in the space $W^{(1,2),2}(R^{2}\times R^{+})$ of the integro-differential equation in the space of two dimensions in the situation when the diffusion term involves the standard Laplace operator in one direction and the fractional Laplacian in another direction in the presence of the drift term. Such model is relevant to the cell population dynamics in the Mathematical Biology. The proof is based on a fixed point technique.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39166 ↗

We study generalized transition fronts for cooperative reaction–diffusion systems with spatially periodic and time-dependent coefficients. We obtain sufficient conditions for the existence of fronts and necessary constraints on their propagation speeds in terms of generalized principal eigenvalues. In the almost-periodic case, we identify the two spectral thresholds and examine the attainment of the critical speed under additional hypotheses on the normalized linear evolution. We then investigate the large-advection limit and construct a time-periodic example showing that a stationary spectral characterization need not extend to time-dependent flows. For symmetric cooperative systems in stationary periodic shears with equal diffusion matrices, we obtain explicit correction terms for the minimal speed in both the small- and large-diffusion limits. The two expansions follow from periodic eigenvalue perturbation, localization near a maximal streamline, and minimization over the exponential weight. We also establish a higher-order large-advection expansion and present numerical illustrations independent of the analytic proofs.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39199 ↗

This work is devoted to the study of the hydrodynamic limit for the fluid-particle flows governed by the Vlasov-Fokker-Planck (VFP) equation coupled with the incompressible Navier-Stokes (INS) equation as the Deborah number approaches to zero. The limit is valid globally in time provided that the initial perturbation is small in a neighborhood of a steady state. The proof is based on a formal derivation of the limiting system via the Hilbert approach, followed by a rigorous justification via introducing a novel decomposition involving some macroscopic quantities and a refined energy estimate motivated by macro-micro decomposition. In contrast to the existing results for the same scaled model, the present work provides the first one on the hydrodynamic limits in a strong sense with an explicit convergence rate.

comments
Updated to match the published version in Mathematical Models and Methods in Applied Sciences (M3AS) following editorial embargo policy
journal
Math. Models Methods Appl. Sci. 34 (2024), no. 12, 2265-2304
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39204 ↗

We identify unstable radial equilibria as sharp concentration thresholds for the Jäger–Luckhaus chemotaxis system on the unit disk with no-flux boundary conditions. Concentration is compared through cumulative mass. At fixed total mass, every radial initial profile more concentrated than an unstable equilibrium produces finite-time blow-up, whereas every nonstationary profile less concentrated than that equilibrium generates a global, uniformly bounded solution converging to the least concentrated radial equilibrium. We also classify the radial equilibria and determine their nonlinear stability. Let $Λ= j_{1,1}^{2}$, where $j_{1,1}$ is the first positive zero of the Bessel function $J_1$. For $M\ne Λπ$, the least concentrated equilibrium is the unique locally asymptotically stable equilibrium under mass-preserving radial perturbations. It is spatially homogeneous for $M<Λπ$ and strictly increasing for $M>Λπ$. Every other radial equilibrium, including the homogeneous state at $M=Λπ$, is nonlinearly unstable. These results clarify how total population and initial spatial aggregation jointly determine collapse or bounded redistribution, and how stable peripheral enrichment can occur within the radial model.

comments
This manuscript is still a work in progress, but we could not wait to share it before attending to some important business in Phantom Blade Zero. Comments and suggestions are welcome
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39209 ↗

We construct complete vacuum initial data sets with prescribed asymptotically flat exterior geometry, including the gluing of two Schwarzschild exterior regions with small masses (which need not be positive). The construction allows for arbitrarily slow leading decay and nonzero second fundamental form. For leading terms with a fixed radial power, we first construct localized seed data sets whose constraint errors decay to any prescribed finite order, then apply the projection and stability theorems of our companion papers. The resulting vacuum data sets differ from seeds by harmonic terms controlled by Hamiltonian and momentum silhouettes, and by super-harmonic corrections. This difference of harmonic terms is measured by a relative notion of ADM energy-momentum, which is defined even for slowly-decaying data sets that do not admit an ADM energy-momentum. Upon adjusting seed data sets by either harmonic-decaying terms or compact transverse-traceless terms, we freely control this relative ADM charge and, when it exists, the total ADM charge. In particular, when gluing Schwarzschild metrics the total ADM mass can be specified independently of the Schwarzschild mass parameters. Together with our companion papers, these results establish a constructive theory of optimal localization beyond harmonic decay.

comments
29 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39262 ↗

We study the Korteweg-de Vries equation on a bounded interval with boundary dissipation, and its spatial semidiscretization by a weighted cubic Hermite Galerkin method. A small nonlinear wave can be approximated by a linear discrete simulation in two orders: linearize first and then discretize, or discretize first and then linearize. Both orders give the same total error, but they divide it differently between linearization and discretization. The difference of the two divisions is the ordering error. We show that it is quadratic in the size of the initial datum and carries a positive power of the mesh size, for all time. For the continuous problem, the solution map is analytic, with a power series that converges for all time in exponentially weighted trajectory norms. The linearized semigroup has Crandall-Pazy regularity with the exact index 3/2. For the weighted scheme, exponential stability, Kato smoothing, Crandall-Pazy regularity and analyticity of the solution maps hold uniformly in the mesh size. These properties give error estimates in which the error and the datum are measured in the same norm: in the energy norm, in $H_0^1$ and in $H^2$. In exponentially weighted time-integrated norms the semidiscrete solutions converge uniformly on balls, at the rate $h^{1/6}$ in $L^4(0,\infty;L^2)$ for data in $L^2$ and at the rate $h^{2/3}$ in $L^2(0,\infty;H^1)$ for data in $H_0^1$. On every interval $[t_0,\infty)$, $t_0>0$, same-norm convergence holds uniformly on balls at algebraic rates. The ordering error is of order $h^{1/6}$ times the square of the energy norm of the datum, uniformly for all $t\ge0$. For the unweighted scheme, a grid wave packet of zero group velocity destroys mesh-uniform Kato smoothing and Crandall-Pazy regularity.

comments
36 pages
fields
Analysis of PDEs, Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2610.39269 ↗

We study stability of Brenier potentials and maps under changes of the target measure. Let $κ>0$, for a full support $κ$-strongly log-concave source $ρ$, possibly with a non-smooth potential, the normalized transport potentials satisfy \[ \|u_μ-u_ν\|_{L^2(ρ)}\leqslant\sqrt{2/κ}\,W_2(μ,ν) \] for arbitrary targets with finite second moments. The proof controls normalized Laguerre cell barycentres by their mass derivatives and centers the potential velocity to remove unbounded source cell locations. Bounded variation interpolation then yields the sharp map exponent $1/3$ for targets in a common compact set, \[ \left\Vert T_μ-T_ν\right\Vert _{L^{2}(ρ)}\leqslant \operatorname{Const} \cdot W_{2}\left( μ,ν\right) ^{1/3}. \] Sharpness of the exponents for both the potential and Brenier map stability are established.

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

Inter-layer exchange in biological and chemical systems may involve transport delays and memory effects. In this paper, we mainly study the stability and bifurcations of the synchronized layered steady states in singularly perturbed membrane-coupled reaction-diffusion (RD) systems, where discrete or exponentially distributed delays are introduced into the activator coupling, while the inhibitor coupling remains instantaneous, leading to six representative configurations. By extending the singular limit eigenvalue problem (SLEP) method originally developed by [Nishiura and Fujii, SIMA, 18(6), 1987; Nishiura and Mimura, SIAP, 49(2), 1989] for the non-delayed case, we develop a unified spectral framework that incorporates the symmetric and asymmetric sub-eigenvalue problems arising from all six delayed configurations, demonstrating how the SLEP approach can be adapted to capture the limiting behavior of critical eigenvalues when time delays are present. We then establish sufficient conditions to determine the delay-independent stability, the persistence of Turing instability, as well as delay-induced Hopf bifurcations of the synchronized layered steady states. In particular, we focus on analyzing how time delays could induce in-phase and anti-phase breathers via Hopf bifurcations, leading to spatiotemporal oscillatory instabilities that were absent in the delay-free setting. As an application, we also supply a two-layer membrane-coupled delayed FitzHugh-Nagumo system to illustrate how our results can be applied.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39304 ↗

We study normalized solutions of the nonlinear Dirac equation \[ \begin{cases} -iα\cdot\nabla u+mβu=μu+|x|^{-b}\bigl(|u|^{q-2}-|u|^{p-2}\bigr)u&\text{in }\mathbb{R}^3,\\ \displaystyle\int_{\mathbb{R}^3}|u|^2\,dx=a, \end{cases} \] where $m>0$, $0<b<1$, $2<q<3-b$, and $q<p<\infty$. For each fixed $p>q$ and all sufficiently small $a>0$, we prove the existence of a normalized solution $(u_a,μ_a)$ with $u_a\in H^1(\mathbb{R}^3;\mathbb C^4)\cap L^\infty(\mathbb{R}^3;\mathbb C^4)$ and $μ_a\in(0,m)$. This covers the weighted Sobolev critical and supercritical ranges $p\ge3-b$. Our method combines a mass-preserving spectral reduction with a convex truncation and uniform $L^\infty$ estimates. For solutions arising from reduced minimization, we determine the energy asymptotics and the rate at which $μ_a$ approaches $m$ as $a\to0^+$. After rescaling, the upper two-component spinors converge in $H^{\frac12}(\mathbb{R}^3;\mathbb C^2)$ to the set of normalized ground states of a weighted nonlinear Schrödinger equation with exponent $q$, while the lower two-component spinors converge to zero in the same space. We also derive an asymptotic formula in $L^2(\mathbb{R}^3;\mathbb C^2)$ for the rescaled lower two-component spinor in terms of the gradient of the limiting Schrödinger ground state.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39310 ↗

The present paper provides linear quantitative stability estimates for the anisotropic Alexandrov soap bubble theorem. The estimates are sharp and, to the authors' knowledge, provide the first sharp quantitative version of Alexandrov's theorem in the anisotropic setting. Our estimates establish quantitative closeness to the Wulff shape, also providing sharp control of the closeness of the Gauss maps. As shown by the authors for the classical case, such a control can play a crucial role in achieving optimal profiles for arbitrary deviations and stronger measures of closeness. We also obtain sharp control of the so-called (anisotropic) excess. The paper also provides the first sharp quantitative version of the anisotropic Heintze-Karcher inequality. For the Heintze-Karcher inequality, the stability estimates providing closeness of the Gauss maps and control of the excess are new even in the classical (isotropic) setting.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39365 ↗

Let $Ω\subset\mathbb{R}^n$ be a bounded, smooth and (uniformly) convex domain, and let $u$ be a positive solution to an elliptic boundary value problem with zero Dirichlet data. A classical problem in the analysis of partial differential equations is to determine whether the convexity of $Ω$ is inherited by the superlevel (or sublevel) sets of $u$. This survey considers divergence-form equations in bounded convex domains. For torsion functions, first eigenfunctions, and semilinear equations with sublinear nonlinearities, concavity of suitable transforms of $u$ gives positive results. Two further methods, i.e. envelope constructions and constant-rank theorems for level-set curvature, often provide alternative routes to convexity and related properties. These results are complemented by counterexamples, showing that in general convexity of the domain and ellipticity of the operator do not guarantee quasiconvexity for every solution. We present these counterexamples through a shared underlying idea, and describe the distinct ways in which different equations implement this idea.

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

We study Darcy–Boussinesq convection in a layered porous medium containing a thin layer whose thickness $h_0$ and permeability $K_0$ vanish simultaneously. The competition between these two small parameters is measured by the effective hydraulic conductance $α= \lim \frac{K_0}{h_0} \in [0,\infty]$. We show that the collapsing layer is replaced by an effective interface whose transmission law depends qualitatively on this ratio. When $α= 0$, the limiting interface is impermeable; when $ 0 <α<\infty$, the normal Darcy flux is proportional to the pressure jump, yielding a finite-resistance transmission law; and when $α=\infty$, the pressure is continuous and the interface becomes hydraulically transparent. We establish estimates uniform in the layer thickness and permeability, quantitative convergence of solutions on every finite time interval, and upper semicontinuity of the associated global attractors. The analysis has to accommodate both a degenerating geometry and a loss of coercivity in the pressure equation. In particular, we use a generalized Poincaré inequality for piecewise $H^1$ pressures, a pressure extension across the collapsing layer, and uniform thin-strip estimates. The results provide a rigorous finite- and long-time validation of effective interface models for convection through thin low-permeability interphases.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39421 ↗

We prove that certain classes of nonlocal integral estimates on domains, involving operators, may be reduced to the local analogues without the singular weight on cubes. The theory applies to two-sided inverse doubling and quasi-monotone kernels with some moment conditions, and with a left-hand-side operator with average domain-bi-Lipschitz properties. Direct applications to fractional semi-norm inequalities in Peridynamics, such as fractional Korn's inequalities and Geometric Rigidity Estimates are presented.

comments
28 pages
fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2610.39437 ↗

We determine the sharp observation-time threshold for the autonomous, pure-potential wave equation with an inverse-square boundary singularity on the unit ball. For every fixed $κ<0$, full-boundary observability holds on $(-T,T)$ whenever $T>1$ and fails when $T<1$. This resolves, for this model, the optimal-time question raised by Enciso, Shao, and Vergara [J. Eur. Math. Soc. 23 (2021), 3459–3495] and extends their parameter range $-\frac12<κ<0$ to all $κ<0$, including the limit-point regime $κ\leq-\frac12$. Our approach is based on the Ingham–Beurling theory of nonharmonic Fourier series. Spherical harmonic decomposition reduces the problem to one-dimensional singular operators, for which we establish frequency separation, local counting estimates, and lower bounds for the boundary norming constants, uniformly in the angular parameter. A quantitative Ingham–Beurling inequality then yields the sharp-time observability estimate. As a by-product, this spectral approach provides an independent proof of boundary observability and an explicit functional characterization of its maximal $L^2$ observation domain. The latter is described by a weighted $\ell^2$ condition on the spectral coefficients and consists precisely of energy solutions whose distributional Neumann trace belongs to $L^2$. It contains the boundary-admissible energy solutions considered in Enciso–Shao–Vergara's original work.

comments
57 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39475 ↗

This paper studies the following chemotaxis system with nonlinear diffusion and singular sensitivity \[ \begin{cases} u_t = \nabla \cdot \left( (u+a)^{m-1} \nabla u \right) - χ\nabla \cdot \left( u \dfrac{\nabla v}{v^k} \right), \\[4pt] v_t = Δv - v + u, \end{cases} \] in a smoothly bounded domain \(Ω\subset \mathbb{R}^n\), \(n \geq 2\), subject to no-flux boundary conditions, where \(χ,k,a,m>0\). For suitably regular initial data, we prove global existence and uniform-in-time boundedness of classical solutions if one of the following conditions holds: \[ \begin{aligned} & n=2,\quad k\in(0,\infty),\quad m>1;\\ & n\ge 3,\quad k\in\left(0,\tfrac12\right),\quad m>1+\frac{(1-k)(n-2)}{n};\\ & n\ge 3,\quad k\in\left[\tfrac12,1\right),\quad m>\frac{3n-2}{2n};\\ & n\ge 3,\quad k\in[1,\infty),\quad m>\max\left\{1,\frac{3n-2}{2n+2}\right\}. \end{aligned} \] The main contribution is the physically relevant three-dimensional case. In particular, for every \(χ>0\), \(a>0\), \(m>1\) and \(k\ge 1\), the system admits a global bounded classical solution. Thus, in dimension three, nonlinear diffusion of porous-medium type removes the smallness restriction on the chemotactic sensitivity $χ$ that earlier results require in the case \(m=1\) and \(k\geq 1\).

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39507 ↗

Previous work strengthened the time integrability of integral-invariant weak solutions from L^1 to L^\infty within a spatial L^2 framework.This paper studies the propagation of Sobolev regularity for integral-invariant weak solutions of the conservative linear scalar transport equation.We first derive a representation formula along the flow and a distributional equation from integral identities against adjoint-transported test functions on domains moving with the same characteristic flow,and relate the weak formulation in time, including an endpoint term for the initial data, to representatives satisfying the pointwise-in-time integral definition.We then give a unified proof for k=1,2:under u_0\in H^k(Ω_0)and Assumption \mathsf A_{k+1},the pullback of the solution belongs to C^1([0,T];H^k(Ω_0)),the material derivative has spatial $H^k$ regularity,and the Eulerian time derivative has spatial H^{k-1} regularity.The corresponding time continuity is understood after pullback to the fixed domain by the flow.In both cases, U\in H^1(Q);when k=2, we further obtain \nabla_xU\in H^1(Q;\R^d).The pullback differentiability and the spatial estimates for the material derivativeprovide information beyond first-order space-time Sobolev regularity alone.The proof combines estimates for the characteristic flow with Sobolev product and composition rules.Under the additional assumption that the zero extension of the initial data belongs to H^2(\R^d),we also establish $H^1(0,T;H^1(\R^d))$ regularity in the fixed ambient space.Counterexamples show that these results concern regularity propagation under additional assumptions: general L^2 initial data do not automatically yield spatial smoothing,and spatial regularity of the material derivative cannot replace the corresponding regularity of the Eulerian time derivative.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39527 ↗

In this article, we obtain three stability results for the Poisson-Neumann problem: (1) the stability of the $L^p$ Poisson-Neumann problem under small Carleson perturbations of the coefficients, (2) the preservation of the $L^p$ Poisson-Neumann problem when transitioning from the Laplacian to operators in a special form with oscillations satisfying a small Carleson condition (''small special DKP operators''), and (3) the stability of the $L^p$ Poisson-Neumann problem under small bi-Lipschitz transformations of domains. In contrast to the Neumann problem, the Poisson-Neumann problem is notably more self-contained, as results pertaining to it do not require assumptions regarding the $L^{p'}$ Dirichlet problem, making it a more suitable object for a perturbation theory. As intermediate steps, we establish estimates on the square functional for solutions to the Poisson problem and their gradients on chord arc domains, which are of independent interest for specialists.

comments
55 pages, 1 diagram
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39544 ↗

We study the global well-posedness of the Cauchy problem in $\mathbb R^d$, $d\geq2$, for the relaxed compressible Euler system with a Maxwell-type constitutive law for the stress tensor. We show that the corresponding compressible Navier-Stokes solutions serve as both relaxation limits and large-time asymptotic profiles of the global relaxed Euler solutions constructed here. Given a Navier-Stokes background satisfying suitable boundedness and decay assumptions, we construct global smooth relaxed Euler solutions for each fixed $α\in(0,1]$ and sufficiently small $\varepsilon>0$. Here, the background need not be small. After subtracting the stress initial layer, the approximation error is $O(\varepsilon^α)$ uniformly in time. Under suitable additional conditions on the initial perturbations, this error decays in $L^2$ faster than the decay of standard Navier-Stokes background, uniformly in $\varepsilon$, identifying the background solution as a large-time asymptotic profile. As an application, we obtain the corresponding small-data results using classical Navier-Stokes theory to verify the background assumptions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39552 ↗

We study bubble solutions to the critical CR fractional Yamabe equation on the Heisenberg group for the full range \(0<γ<\frac{Q}{2}\), including the admissible integer-order cases. The CR fractional operator is genuinely nonlocal and is described by Gamma-function spectral multipliers. Its structure differs from that of the Euclidean fractional Laplacian, so the linearized analysis cannot be obtained by a direct extension of integer-order arguments. We develop a direct spectral approach based on the Cayley intertwining relation and the complex spherical-harmonic decomposition, which characterizes the kernel of the linearized operator in terms of infinitesimal translation and dilation modes without reducing the equation to an integral equation or requiring a separate decay analysis. As a byproduct, we obtain the exact normalization constant of the standard bubble throughout the admissible range. We then prove three main results: $(i)$ the non-degeneracy of the bubble manifold; $(ii)$ the local rigidity of the bubble manifold, via a uniform invertibility estimate on the orthogonal complement of the tangent space, with an explicit optimal constant; $(iii)$ the Morse index of every positive bubble is exactly one. The results provide a unified spectral and variational framework for the CR Yamabe problem on the Heisenberg group, covering both integer and noninteger orders.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39607 ↗

We investigate a Modica-Mortola energy in heterogeneous materials with a quasi-crystalline microstructure, described by a suitable notion of almost periodicity. In the regime where phase separation occurs at a finer scale than homogenization, we establish compactness and $Γ$-convergence results in one dimension for vector-valued phases. The main novelty lies in the explicit characterization of the effective surface energy, which reveals the interplay between phase separation and homogenization. In particular, we prove that heterogeneities can promote the splitting of a phase separation into several energetically favorable microscopic transitions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39643 ↗

We establish a quantitative criterion for local Lipschitz regularity of Sobolev maps in the sense of Korevaar and Schoen from finite-dimensional \(\RCD(K,N)\) spaces into complete \(\CAT(0)\) spaces, without assuming harmonicity. We quantify the failure of local energy minimality by the harmonic replacement potential, a dyadic sum of the square roots of normalized energy gaps between a map and its harmonic replacements. We prove that this potential, together with an averaged energy term, controls the minimal weak upper gradient pointwise, with constants depending only on the curvature-dimension bounds and the scale. In particular, local boundedness of the replacement potential implies that the map admits a locally Lipschitz representative.

fields
Analysis of PDEs, Differential Geometry, Metric Geometry
pdf ↗ page arXiv:2610.39644 ↗

We consider the two-dimensional energy of a chiral magnet, consisting of the exchange energy, a bulk Dzyaloshinskii–Moriya interaction with constant $κ\ne0$, and the Zeeman energy in an applied field $h>0$. We prove that the minimizers of this energy among maps of degree $-1$ are exactly the translates of one axially symmetric Bloch skyrmion, whose helicity is determined by the sign of $κ$. This holds for $h \geq c κ^2$, where $c \in(π^2 / 16,1)$ is determined by the slope of the radial profile at the origin; in particular, it holds in the whole range $h\geκ^2$, which answers a question raised by Melcher and by Döring and Melcher. The proof is a calibration argument. Using the profile of the skyrmion, we write the energy density of an arbitrary map as a weighted topological density, plus a divergence, plus a nonnegative remainder, and we show that this identity can be integrated for every map of finite energy. The method also gives the uniqueness of the monotone solution of the profile equation for $h\geκ^2/2$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39651 ↗

We establish a sharp Sobolev-type inequality on $\mathbb{R}^n$, $n\geq 5$, that interpolates between the second-order energy and a weighted first-order term. Specifically, we determine the sharp constant $S_{4,2}$ in the inequality \begin{equation*} \int_{\mathbb R^n} (Δu)^2\,dx \ge S_{4,2} \left(\int_{\mathbb{R}^n}|\nabla u|^{2}|u|^{\frac{4}{n-4}}\,dx\right)^{\frac{n-4}{n-2}}, \end{equation*} for any $u\in\dot H^2(\mathbb{R}^n)$, and we classify the cases of equality. This solves the problem of minimizing the total $Q$-curvature of among metrics on the sphere, conformal to the standard metric, with fixed total scalar curvature.

comments
16 pages
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2610.39659 ↗

For every bounded convex domain $Ω\subset\mathbb R^d$, $d\ge2$, we establish the following sharp inequality for torsional rigidity $$T(Ω)\ge\frac{2(d+1)}{d}\int\limits_Ω\operatorname{dist}(x,\partialΩ)^2\dd x,$$ where $T(Ω)=4\int\limits_Ωu\dd x$ and $-Δu=1$ in $Ω$, $u\in H^1_0(Ω)$. Equality holds for balls.

comments
4 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39666 ↗

We study the fundamental solutions of a class of uniformly elliptic fourth-order parabolic equations in two dimensions, whose principal symbols are not necessarily strongly convex. For constant-coefficient operators, we derive precise small-time asymptotic formulas along certain special directions. These formulas are obtained by the method of steepest descent and reveal the dependence of the asymptotic behavior on the coefficients of the symbol. We subsequently consider operators with bounded measurable coefficients, subject to Dirichlet boundary conditions, and establish Gaussian bounds for their fundamental solutions by means of Davies' exponential perturbation method. The exponential constant in these bounds is shown to be sharp, as a consequence of the constant-coefficient asymptotics.

comments
31 pages, 5 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39686 ↗

Established herein is the rigorous extension of the celebrated Fokas unified transform method for linear evolution PDE with time-dependent coefficients. As illustrative examples, considered below and rigorously analysed in detail are non-homogeneous initial-boundary-value problems, formulated on the half-line, for the heat equation and the modified heat (also widely known as Barenblatt's pseudo-parabolic) equation with reaction terms and temporally varying coefficients. Solution formulae are derived formally via suitable implementation of the UTM, and rigorously verified a posteriori, in the classical sense. The latter task relies on complex-analytic tools and careful interpretation of the obtained integral representations. The explicit solutions established here are then used for investigating qualitative properties. These include regularity, boundary behavior near the axes of the domain as well as long-range and eventual periodicity asymptotics. Notably, smoothness of the solution up to the boundaries depends on compatibility conditions between initial, boundary and forcing data, into which interjected now are initial values of the coefficients. Further results pertaining to solution uniqueness, analyticity and controllability of the addressed problems are thence deduced in light of the preceding qualitative theory.

fields
Analysis of PDEs, Mathematical Physics, Complex Variables, Dynamical Systems
pdf ↗ page arXiv:2610.39698 ↗

We study the problem of the best approximation (w.r.t. the optimal transport metric $W_p$, $p \in [1,\infty)$) of the three-dimensional Lebesgue measure on a domain of volume 1 by a discrete probability measure supported on a Bravais lattice. This problem is known as the quantization problem and it arises in numerical integration, electrical engineering, discrete geometry and materials science. As the lattice size tends to zero and the cardinality of the support of the discrete measure tends to infinity, this reduces to the following geometric optimization problem: Amongst three-dimensional Bravais lattices with determinant $1$, which lattice minimises the $p$-th moment of the lattice Voronoi cell? Barnes and Sloane (1983) proved that the BCC lattice is optimal for the case $p=2$, which is known as the vector quantization problem in the signal compression literature. Bambah (1954) proved that the BCC lattice is optimal for the limiting case $p=\infty$, which is the sphere covering problem. Based on these results, Graf and Luschgy (2000) conjectured that the BCC lattice is optimal for all $p \in [1,\infty)$. Three dimensions is the critical dimension in the sense that in two dimensions the optimal lattice is independent of $p$, whereas in four dimensions it varies with $p$. In this paper we give support in favour of Graf and Luschgy's conjecture by proving that the BCC lattice is a local minimiser for all $p \in [1,\infty)$ and a global minimiser for $p$ near 2. While the conjecture asserts that the global minimiser is independent of $p$, we prove a bifurcation theorem which shows that the set of critical points depends on $p$ and that $p=2$ is a distinguished case. Our proofs combine results from discrete geometry by Barnes and Sloane (1983) and Conway and Sloane (1992) with optimal transport theory, the calculus of variations, bifurcation theory, and some delicate positivity estimates.

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

We establish Wulff rigidity for overdetermined anisotropic $k$-Hessian equations associated with a smooth and strongly convex Finsler gauge. The solutions are subject to homogeneous Dirichlet boundary and a prescribed anisotropic gradient condition on a smooth domain. We prove that the domain must be a Wulff shape. The same rigidity holds under a prescribed positive weighted Neumann-type condition. These results extend the Wulff rigidity for the endpoint cases $k=1$ (Cianchi–Salani, \emph{Math. Ann.}, 2009; Wang–Xia \emph{Arch. Ration. Mech. Anal.}, 2011) and $k=n$ ( Cianchi–Salani, \emph{J. Funct. Anal.}, 2023) to the intermediate cases $2\le k<n$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39756 ↗

In every fixed dimension \(N\ge3\), for any finite list of positive integers \(m_1,\ldots,m_\ell\), we construct smooth strictly star-shaped Euclidean domains whose first \(\ell+1\) distinct Dirichlet eigenvalues can have multiplicities \(1,m_1,\ldots,m_\ell\) respectively. The condition "star-shaped" is almost optimal in the sense that this statement can not hold for bounded convex domains. In fact, we show that the second Dirichlet eigenvalue of any bounded convex domain has multiplicity at most $N$, and this bound is sharp.

comments
45 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39794 ↗

We present a new gradient-like flow that targets critical points of the inequality for the planar Radon transform $\mathcal{R}$ proven by Oberlin and Stein, partially answering a question of Christ, who gave a complete characterisation of the extremisers of the inequality via rearrangement methods. We show that for non-negative radial initial data near the extremiser manifold, solutions to the flow exist globally and there exists a rescaled subsequence of the flow that converges to a critical point of the Radon functional $\|\mathcal{R} f\|_3/\|f\|_{3/2}$ locally in $L^{3/2}(\mathbb{R}^2)$. We also obtain a quantitative result for the rate of decay of critical points, which complements a result of Christ arXiv:1106.0719 in the special case of radial functions. We prove a novel localised smoothing estimate for the operator $\mathcal{R}^*[(\mathcal{R}\cdot)^2]$ restricted to radial functions. This approach is complementary to that of Christ and provides a robust framework for studying extremal problems associated to Radon-like operators.

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

In this paper we study a class of Klein-Gordon-Born-Infeld systems in which the classical Laplacian appearing in the matter equation is replaced by a mixed local-nonlocal operator, whose nonlocal part is allowed to be nonpositive definite according to a real parameter. Both the approximate and the exact Born-Infeld field equations are considered in parallel. After making the functional framework explicit, we identify a range of real parameters for which infinitely many radially symmetric standing waves exist, obtained as Mountain Pass critical points of the associated reduced energy functionals. The mixed local-nonlocal operator reduces to the classical Laplacian as the nonlocal weight vanishes, and is motivated, in the spirit of effective field theories, by nonlocal corrections to the matter dispersion relation.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39829 ↗

We study the orbital instability of algebraically decaying stationary solutions of nonlinear Schrödinger equations in dimensions $d\ge2$, taking competing double-power nonlinearities as a canonical model. At zero frequency, the essential spectrum of the linearized operator touches zero, and the usual $H^1$ coercivity is lost. We construct the zero-frequency limit $η_0$ of the frequency derivatives $\partial_ωφ_ω$ of standing-wave profiles and determine its sharp asymptotic behavior. For a stationary ground state $φ_0\in H^1(\mathbb{R}^d)$, we prove instability if $\langle x\rangle\,φ_0\notin L^2(\mathbb{R}^d)$ or, when $\langle x\rangle\,φ_0\in L^2(\mathbb{R}^d)$, if the duality pairing $\langleη_0,φ_0\rangle$ is negative. This criterion is a zero-frequency counterpart of the negative slope condition in the Grillakis–Shatah–Strauss theory. The proof combines variation of parameters for the linearized ODE with a shooting analysis that determines the global behavior of the homogeneous solution regular at the origin. We then localize $η_0$ to construct an unstable direction and establish instability through a Lyapunov functional argument based on the variational characterization of ground states. The results extend with essentially the same proofs to a class of multiple-power nonlinearities.

comments
66 pages, 2 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39830 ↗

We develop a Riemann–Hilbert formalism for the Cauchy problem for the two-component modified Camassa–Holm (2-mCH) system on the real line under non-zero step-like boundary conditions. Starting from the corresponding Lax pair, we carry out the direct spectral analysis and establish the analytic, symmetry, and asymptotic properties of the eigenfunctions and spectral data determined by the initial conditions. These results are then used to formulate a matrix Riemann–Hilbert problem whose solution provides a reconstruction formula for the solution of the original Cauchy problem.

comments
39 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39938 ↗

The main goal of this paper is to characterize the existence of principal eigenvalues of $$ \left \{ \begin{array}{ll} -\mathrm{div}\left(A\nabla u\right) +qu=λm u \quad & \hbox{in} \;\; Ω,\\[1ex] \mathscr{B} u = 0 \quad & \hbox{on} \;\; \partial Ω, \end{array} \right. $$ where $m\in L^\infty(Ω)$ satisfies some of the conditions (A1)-(A3) below, as well as to deliver their variational characterizations whenever they exist. As we are dealing with general boundary operators of mixed non-classical type, in the general setting of this paper our results are far more general than all existing results. The case when $m$ satisfies (A2) has not been previously explored in the literature.

comments
23 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39940 ↗

We obtain sharp regularity for the anisotropic fractional Laplace equation with a right-hand side belonging to a Morrey space. We derive local $C^{σ+λ-n}-$regularity of solutions when $σ+λ-n\neq1$, where $σ\in(0,2)$ is the order of the operator and $λ\in(n-σ,n)$ is the Morrey decay rate of the right-hand side. In the case $σ+λ-n=1$, we show that solutions are locally in the Zygmund class, and hence are Log-Lipschitz continuous. Explicit examples attest to the sharpness of the conditions.

comments
17 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39947 ↗

We consider the Dirichlet problem $-Δu=|x|^αu^p$, $u>0$ in $Ω$, $u=0$ on $\partialΩ$, where $Ω\subset R^N$, $N\ge 3$, is a bounded domain containing the origin and $α>0$. We prove that a solution exists for every exponent $1<p<p_α=\frac{N+2+2α}{N-2}$, in particular in the whole Sobolev-supercritical range $\frac{N+2}{N-2}\le p<p_α$, provided $Ω$ is invariant under $O(N-1)\times O(1)$ and satisfies an angular monotonicity condition. This class contains the balls, the oblate ellipsoids of revolution, lens-shaped domains, and non-convex, non-smooth and non star-shaped domains. The solution is obtained by minimizing the Rayleigh quotient on a suitable closed convex cone.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39976 ↗

We study entire continuous plurisubharmonic solutions of the complex Monge-Ampère equation $(i\partial\bar\partial u)^n=2^n n!μ$ in $\mathbb{C}^n$, in the Bedford-Taylor sense, where $μ\not\equiv 0$ is a nonnegative locally finite Borel measure periodic with respect to a lattice of full real rank. We assume that $μ$ is locally dominated by complex Monge-Ampère measures of Hölder continuous plurisubharmonic functions, a condition under which the existence theorem of Demailly et al. yields Hölder continuous periodic correctors. Under this assumption, we prove that every such solution with positive two-sided quadratic growth can be written uniquely, up to an additive constant, as the sum of a real quadratic polynomial and a Hölder continuous periodic function.

comments
28 pages
fields
Analysis of PDEs, Complex Variables
pdf ↗ page arXiv:2610.40004 ↗

We study a nonlocal transport problem describing pore growth in a biological membrane exposed to a periodic electric potential, where the growth term is modified through the first moment of the solution $n_1(t)$. We show that for initial data $f_0$ with noncompact support it holds $n_1(t) \rightarrow \infty$ , whereas for $f_0$ with compact support the limit of $n_1$ depends sensitively on the data. For a broad class of initial data we additionally obtain $n_1 \sim t^{\frac{1}{2}}$. In the case of a constant external potential we further prove that solutions converge to the self-similar solution having the same tail behaviour as $f_0$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.40019 ↗

Let $Σ\subset\mathbb R^3$ be a compact $C^2$ hypersurface with nonvanishing Gaussian curvature. We prove the sharp matrix-dimension-independent Schatten-valued Stein–Tomas range \[ R_Σ:L^p(\mathbb R^3;S^a)\longrightarrowγ(L^2(Σ),S^a), \qquad 1<a<\infty,\quad 1\le p\le\min\{a,4/3\}. \] The core endpoint is $E_Σ:γ(L^2(Σ),S^4)\to L^4(\mathbb R^3;S^4)$. After squaring the quartic norm, multiplication lands in the Hilbert–Schmidt class. A local coarea argument splits resonant quartets according to the shorter adjacent frequency chord, producing a dimension-free row/column estimate for elliptic and hyperbolic curvature. We also show that Gaussian type $4/3$ alone does not characterize the corresponding endpoint for arbitrary Banach spaces. Applications include matrix Herglotz waves, a two-dimensional Schrödinger $L^4$ estimate, and free spectral-measure bounds.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.40044 ↗

With numerical simulations of the complex Ginzburg-Landau equation in a two-dimensional space, we find that a stationary but non-zero Dirichlet boundary condition with a discontinuity can drive a periodic train of evenly spaced topological defects that drift along and in proximity to the boundary.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.40103 ↗

We prove a local $Tb$ theorem with testing conditions on metric balls, for possibly non-doubling measures of polynomial growth on geometrically doubling metric spaces. It resolves the maximal-truncation version of Hofmann's local $Tb$ problem for all $1<p,q\leq\infty$, without assuming antisymmetry of the Calderón-Zygmund kernel. Our theorem allows accretive systems of complex testing measures satisfying a quantitative small-set condition; these measures need not be absolutely continuous with respect to the underlying measure. Testing requires only a one-level $L^0$ bound for maximal truncations, with an alternative for balls on which the underlying measure concentrates in a set of small relative diameter. We also remove antisymmetry from the known buffered and unbuffered fixed-truncation criteria. The proof combines a mixed corona decomposition adapted to the two testing systems with two-measure $L^2$ estimates for suppressed operators. As an application in the parabolic space $\mathbb P^n$, local time-directed $A_\infty$-type conditions on caloric and adjoint caloric measure imply $L^2(σ)$-boundedness of the spatial gradient of the heat single layer potential for boundary measures $σ$ with upper parabolic $(n+1)$-growth. This gives a parabolic counterpart of the harmonic-measure theorem of Mourgoglou and Tolsa without Ahlfors regularity, corkscrew or Harnack chain assumptions.

comments
125 pages
fields
Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.40135 ↗

We prove that the first Dirichlet eigenvalue of the fractional Laplacian satisfies the sharp quantitative Faber–Krahn inequality. This was conjectured by Brasco, Cinti and Vita, who proved the inequality with a sub-optimal exponent. The proof adapts to the non-local setting the level-set argument recently introduced by Guerra, Machado and Ramos for the Laplacian. It is carried out on the horizontal level sets of the Caffarelli–Silvestre extension of the torsion function, where the asymmetry appears only as a boundary value at the corner of the extension variables.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.40232 ↗

We compute the second shape derivative of the fractional torsion. It is an explicit quadratic form on the boundary, which involves a Dirichlet-to-Neumann operator for half-harmonic functions blowing up at the boundary. We deduce an explicit formula for volume preserving variations on the ball and show that as in the local case, the shape Hessian is negative and coercive in \(H^{1/2}\) modulo translations.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.40240 ↗

We study a class of nonlinear drift–diffusion equations on $\mathbb{R}^d$ with saturation-type mobilities, not necessarily concave. Under structural assumptions on the mobility and potentials, bounded-domain approximations and local Caccioppoli estimates yield weak solutions for all positive times and an $L^1$-contraction estimate. The same estimates provide local space–time compactness of time translates, whose subsequential limits are weak solutions. Under additional confinement assumptions, uniform mass-tail estimates yield a mass-preserving, free-energy dissipating $C_0$-semigroup of $L^1(\mathbb{R}^d)$-contractions. In this confining setting, every trajectory converges strongly in $L^1(\mathbb{R}^d)$ to a stationary state with the same mass, and the resulting time-limit operator is an $L^1$-contraction. Under the same assumptions, we also identify the unique global and $L^1$-local minimiser of the free energy at each fixed mass and prove that it is stationary under the semigroup.

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

At the Fujita exponent $p=1+2/N$ we construct a strictly positive mild solution of $u_t-Δu=|u|^{p-1}u$ in $\mathbb R^N$ whose initial trace in $L^1$ is zero. In similarity variables the solution approaches a Gaussian profile, and $$\|U(t)\|_1\sim C_N(\log(1/t))^{-N/2},\qquad \|U(t)\|_\infty\sim c_Nt^{-N/2}(\log(1/t))^{-N/2},$$ with explicit constants $C_N$ and $c_N$. In particular, uniqueness fails at the borderline logarithmic rate, and the solution lies outside every stronger logarithmic uniqueness class; this answers two questions raised by Miyamoto [J. Evol. Equ. 21 (2021), 151–166, Remark~1.6]. We also prove that, up to time translation, this is the only ancient solution of fixed sign of the rescaled equation that decays in a Gaussian weighted supremum norm. On a bounded smooth domain the whole-space solution can be localized at finitely many interior points, with independently chosen signs, on top of an arbitrary bounded initial datum. The resulting solutions are classical for $t>0$ and continuous at $t=0$ in $L^1$. Consequently, uniqueness fails for every bounded datum, and positivity is lost for every bounded nonnegative datum, $u_0\equiv1$ included. These results provide affirmative answers to Open Problems~3 and~4 posed by Brezis and Cazenave in [J. Anal. Math. 68 (1996), 277–304].

comments
24 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.40315 ↗

We establish global well-posedness near vacuum for the relativistic Boltzmann equation with soft and hard potentials in the range $γ\in(-2,1]$. The initial data have critical Besov regularity of order $2/r$ in the transverse spatial variables for an admissible range of $r$ depending on $γ$, together with weighted integrability in the longitudinal and momentum variables. The proof combines a fixed-direction div–curl lemma with bilinear collision estimates. In particular, to control the gain term, we combine localization to spherical caps with energy-weighted angular estimates. The key relativistic estimate controls the singularity associated with the first component of the post-collisional relative velocity. These bounds yield the required time decay.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.40322 ↗

We investigate the steady configurations supported by the inviscid two-dimensional Boussinesq equations in the periodic channel. We show steady laminar velocity fields (closed non-contractible fluid trajectories) coupled to non-decreasing density stratifications are necessarily stratified shear flows. The direction of density monotonicity along level sets is in fact fundamental: in striking contrast with the Euler equations, we exhibit laminar non-stagnant non-shear stationary solutions in the periodic channel. We also provide distinct flexibility and rigidity results (laminar persistence or appearance of islands for nearby non-shear solutions) close to stratified shear flows according to their stagnation points. As a by-product of our analysis, we establish a uniform Crandall-Rabinowitz bifurcation theorem that might be of independent interest.

comments
63 pages, 3 figures. Comments are welcome!
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.40334 ↗

We establish quantitative stability for radial Caffarelli-Kohn-Nirenberg inequalities involving the anisotropic radial derivative and the Minkowski functional of a smooth, strictly convex body in $\mathbb R^N$, $N\ge2$. Here, the convex body need not be origin-symmetric. For the $L^2$-Caffarelli-Kohn-Nirenberg inequality, we establish the sharp stability constant $|b+1-a|$ for $a\ne b+1$, and classify all equality cases in the natural weighted completion spaces, by optimizing over the angular coefficients and a common dilation parameter. We also obtain the sharp stability constants $2$ and $4$ for the scale-invariant and scale-noninvariant $L^2$-Heisenberg inequality, respectively. For $2\le p<\infty$, we also establish weighted stability of the anisotropic radial $L^p$-Caffarelli-Kohn-Nirenberg inequalities when $a\neq b+1$ and $(b+1-a)(N-p(b+1))\geq0$, and the anisotropic radial $L^p$-Heisenberg inequalities. As a byproduct, we establish weighted $L^p$-Poincaré inequalities for Gamma measures, which serve as the main tool for our stability estimates.

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

We prove quantitative propagation of chaos in total variation for repulsive Vlasov–Riesz–Fokker–Planck (VRFP) equations on $\mathbb{T}^d$ and $\mathbb{R}^d$ with unregularized interaction potentials with singularity $|x|^{-s}$, $0<s<d/2$. On every finite time interval on which the limiting classical solution satisfies the stated regularity assumptions, the particle marginals with a product initial law converge at an algebraic rate in the particle number, with constants growing at most exponentially in the marginal order. For the three-dimensional repulsive Vlasov–Poisson–Fokker–Planck (VPFP) equation on $\mathbb{R}^3$, a weighted $C^m$ initial probability density, $m\ge3$, with Gaussian velocity decay and polynomial spatial decay of order $M>3$ gives convergence to the global classical solution on every finite time interval. The proof combines conditioning of the initial product law with weighted BBGKY estimates. A decomposition of the potential and a bounded modification of the far-field force yield weighted bounds growing geometrically in the marginal order on the prescribed interval. A centered second-moment estimate permits summation of the error hierarchy, and a synchronous coupling transfers the estimate to the original dynamics.

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

In this paper, we give an alternative proof of the abstract endpoint Strichartz estimates proved by Keel and Tao. Our method is based on the near-far decomposition technique, which was developed in a recent work by Toyoshima and the author.

comments
6 pages
fields
Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.40434 ↗

We consider a broad class of generalized liquid drop models in which a perimeter term competes with repulsive nonlocal interactions with finite first moments. For all such kernels satisfying the natural physical assumption of reflection positivity we show existence of minimizers for all masses, in the (super-)critical regime. Moreover, in the subcritical regime we give the first quantitative estimate of the range of masses for which existence holds, which converges to the whole positive real line as one approaches the critical regime. This result builds on the nonlocal curvature approach introduced and developed in the periodic setting in \cite{dr24}.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.40500 ↗

We prove global well-posedness of the Landau equation near a Maxwellian in bounded $C^3$ domains with in-flow or diffuse-reflection boundary conditions for $-3\leqγ\leq1$, including Coulomb interactions. Small compatible Gaussian perturbations generate global strong solutions, with uniqueness and continuous dependence among weak solutions. The proof combines energy estimates, the comparison principle, interior and weighted boundary estimates for velocity derivatives up to second order, and a logarithmic estimate for solution difference.

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

In this paper, we study the Cauchy problem $u_t-\mathcal L u=h(t)u^p$, $u(0)=\varepsilon u_0\ge0$, where $p>1$, $h\ge0$ is only locally integrable, and $\mathcal L=\sum_{j=1}^mX_j^2$ is a homogeneous Hörmander sum of squares on $\mathbb R^n$ of homogeneous dimension $q$. Diffusion spreads the solution out and weakens the nonlinearity, while the reaction $h(t)u^p$ may force blow-up. We prove that the outcome is decided by the single quantity $\mathcal{H}_{p,h}(T)=\int_0^Th(t)(1+t)^{-\frac q2(p-1)}\,d t$, in which the reaction at time $t$ is weighted by the factor by which diffusion has weakened the solution: small data are global if $\mathcal{H}_{p,h}(\infty)<\infty$, while otherwise the lifespan $T_\varepsilon$ satisfies $c\,\varepsilon^{-(p-1)}\le\mathcal{H}_{p,h}(T_\varepsilon)\le C\,\varepsilon^{-(p-1)}$ for small $\varepsilon$. Our technique of proof is based on a backward-semigroup functional combined with a Gaussian-envelope energy and an ODE cap telescoped along interlaced geometric grids. The result contains the Euclidean, Heisenberg, Carnot and Grushin cases, yields explicit lifespan laws for power, logarithmic, exponential, periodic and intermittent coefficients, and exhibits effects with no autonomous counterpart, such as a lifespan with no power law in $\varepsilon$. We also prove regularity and a priori estimates for classical solutions and discuss what remains true for a general nonlinearity $f(u)$.

comments
27 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.40547 ↗

We establish a sharp uniqueness–nonuniqueness criterion for the two-dimensional incompressible Euler equations within a class of stationary arrays of disjoint neutral vortices. Let $Θ$ be any finite nondecreasing envelope for the vorticity $L^p$ norms, and set $I_Θ=\int_{p_0}^\infty Θ(p)^{-1}\,dp$. If $I_Θ=\infty$, every array in the corresponding class admits a unique Euler evolution, even among bounded energy-admissible weak velocity solutions. If $I_Θ<\infty$, there exists a compactly supported array in the same class admitting two distinct unforced Lagrangian Euler evolutions from the same initial datum. The criterion holds for arbitrary nondecreasing envelopes $Θ$.

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

For each prescribed $1<p<\infty$, we construct a compactly supported initial vorticity in $L^1(\mathbb{R}^2)\cap L^p(\mathbb{R}^2)$ that admits two distinct evolutions under the unforced two-dimensional incompressible Euler equation on $[0,1]$. Both vorticities are strongly continuous in $L^1\cap L^p$ and are transported exactly by their respective almost-everywhere invertible, measure-preserving regular Lagrangian flows. The construction couples unstable four-vortex configurations across increasingly small spatial scales, realizing them through concentrated signed vortex patches. At each finite cutoff, a prepared reference evolution remains close to rotating configurations, while a second evolution differs initially only at the finest scale. In the second evolution, the finest configuration consists of separating dipoles whose remote strain activates the instability of the next larger configuration. This process propagates through successive scales with summable transition times. As the cutoff tends to infinity, the two families of initial data converge strongly, along a subsequence, to the same datum, while a nonzero difference survives at a fixed larger scale and is detected by a fixed smooth observable at a positive limiting time. Quantitative concentration and relative comparison estimates establish this cascade for exact Euler patch solutions. Strong compactness through inverse-flow stability then preserves both exact vorticity transport and the positive-time distinction between the two limiting evolutions. The initial datum and construction parameters may depend on $p$.

comments
92 pages, 4 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.40553 ↗

We work on connected, noncompact $n$-dimensional Riemannian manifolds $(\mathcal{M}, g), n \geq 3$, that are complete with respect to $d_g$ and have noncompact boundary and bounded geometry. We study the existence of positive solutions in $C^{\infty}(\mathcal{M}) \cap L^{2^*}(\mathcal{M}) \cap L^{\infty}(\mathcal{M})$ to the Yamabe problem: $$ \left\{\begin{aligned} -Δ_g u+\frac{n-2}{4(n-1)} R_g u & =\mathscr{C}_0 u^{\frac{n+2}{n-2}} \quad \text { in } \mathcal{M}, \\ \frac{\partial u}{\partial ν}+\frac{n-2}{2(n-1)} H_g u & =\mathscr{C}_1 u^{\frac{n}{n-2}} \quad \text { on } \partial \mathcal{M}, \end{aligned}\right. $$ where $\mathscr{C}_0=Y_{\mathscr{C}}(\mathcal{M}), \mathscr{C}_1=Y_{\mathscr{C}}(\mathcal{M}) \mathscr{C} \bar{d}^{\frac{2}{n-2}}$, the parameter $\mathscr{C} \geq 0$ is fixed, and $$ Y_{\mathscr{C}}(\mathcal{M}):=\inf _{u \in C_c^{\infty}(\mathcal{M}) \backslash\{0\}} \frac{E_g(u)}{\left(\|u\|_{L^{2^*}(\mathcal{M})}^{2^*}+\mathscr{C}\|u\|_{L^{2^{\#}}(\partial \mathcal{M})}^{2^*}\right)^{2 / 2^*}} . $$ Here $E_g$ is the associated quadratic energy. We assume $Y_{\mathscr{C}}(\mathcal{M})<Y_{\mathscr{C}, \infty}(\mathcal{M})$ and $Y_{\mathscr{C}, \infty}(\mathcal{M})>0$, where $Y_{\mathscr{C}, \infty}$ is the corresponding variational level at infinity. We approach this problem using nonnegative solutions $u_j \in W_{\partial}^{1,2}\left(B_g(\mathcal{O}, j)\right), j \in \mathbb{N}, j \geq j_0$, for which we prove that $$ \sup _{j \geq j_0}\left\|u_j\right\|_{L^{\infty}\left(B_g(\mathcal{O}, j-1)\right)}<\infty . $$ For $\mathscr{C}>0$, we also prove that, along a subsequence, $\left\|u_j\right\|_{L^2{ }_{\left(B_g(\mathcal{O}, j) \cap \partial \mathcal{M}\right)}} \rightarrow \bar{d}$, with $0<\bar{d} \leq \mathscr{C}^{-1 / 2^*}$. For $\mathscr{C}=0$, we set $\bar{d}=0$.

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

Combinatorics94

We study algorithmic matroid intersection coloring. Given $k$ matroids on a common ground set $U$ of $n$ elements, the goal is to partition $U$ into the fewest number of color classes, where each color class is independent in all matroids. It is known that $2χ_{\max}$ colors suffice to color the intersection of two matroids, $(2k-1)χ_{\max}$ colors suffice for general $k$, where $χ_{\max}$ is the maximum chromatic number of the individual matroids. However, these results are non-constructive, leveraging techniques such as topological Hall's theorem and Sperner's Lemma. We provide the first polynomial-time algorithms to color two or more general matroids where the approximation ratio depends only on $k$ and, in particular, is independent of $n$. For two matroids, we constructively match the $2χ_{\max}$ existential bound, yielding a 2-approximation for the Matroid Intersection Coloring problem. For $k$ matroids we achieve a $(k^2-k)χ_{\max}$ coloring, which is the first $O(1)$-approximation for constant $k$. Our approach introduces a novel matroidal structure we call a \emph{flexible decomposition}. We use this to formally reduce general matroid intersection coloring to graph coloring while avoiding the limitations of partition reduction techniques, and without relying on non-constructive topological machinery. Furthermore, we give a \emph{fully polynomial randomized approximation scheme} (FPRAS) for coloring the intersection of two matroids when $χ_{\max}$ is large. This yields the first polynomial-time constructive algorithm for an asymptotic variant of Rota's Basis Conjecture. This constructivizes Montgomery and Sauermann's recent asymptotic breakthrough and generalizes it to arbitrary matroids.

fields
Combinatorics
pdf ↗ page arXiv:2604.03735 ↗

We introduce a stochastic probing problem with correlated items. In our model, which we call Bayesian Probing, the correlations are modeled by an underlying graph $G$. Each vertex is independently active with a known probability. Each item corresponds to an edge in the graph. Probing an edge has some cost, gives some reward if both endpoints are active, and also reveals the state of its endpoints. Hence a probe induces a Bayesian update on the remaining edges. The goal is to adaptively probe items/edges subject to a knapsack constraint to maximize the expected total reward obtained from the probed edges. Bayesian Probing generalizes stochastic knapsack and stochastic probing by allowing correlations between items. Moreover, it gives a tractable model for the Bayesian Active Search problem, a popular problem considered in the machine learning community. In Bayesian Active Search, the goal is to find items in a particular class by adaptively probing at most, say $k$, items. Given a prior distribution over items, we want to compute a Bayesian policy to maximize the number of such items found. For this general problem with arbitrary priors, there are strong lower bounds on efficiently computing good policies. In this paper, we design efficient approximation algorithms for Bayesian Probing. These results give the first efficient approximation algorithms for Bayesian Active Search, for a class of practically-relevant prior distributions.

fields
Combinatorics
pdf ↗ page arXiv:2606.09729 ↗

Contention resolution schemes (CRS) are a fundamental and widely applied tool for rounding fractional solutions subject to combinatorial constraints. However, the known analyses of CRS generally only guarantee lower bounds on the expected value and concentration on the upper tail, but no concentration on the lower tail. Thus, CRS are generally not applicable to problems that contain covering constraints, since certifying a covering constraint holds requires a lower tail bound. Our main contribution is to derive lower tail bounds for the output of a particular contention resolution scheme, the random-order CRS of Adamczyk and Włodarczyk, which we call AW. We show that every linear function of the rounded solution attains a constant fraction of its expectation with a failure probability that is dimension-free, depending only on the expected value and on the number of matroids, but not on the size of the ground set. Our analysis is driven by a new property we call \emph{strong $λ$-boundedness}, which strengthens the known $λ$-boundedness of AW by providing two-sided control on how rounding propagates between elements. We then introduce a random process capturing AW, a \emph{sequential selection process}, that may be of independent interest. We prove lower tail bounds for any strongly $λ$-bounded sequential selection process. To demonstrate the applicability of our new tail bounds, we apply them to two problems involving covering constraints. The first result is an $O(k \log k)$-approximation for $k$-matroid intersection coloring (improving the prior $O(k^2)$) when the chromatic number of at least one matroid is $Ω(k^3 \log n)$, where $n$ is the number of elements. The second is the first bicriteria approximation algorithm for monotone submodular maximization under $k$ matroid constraints together with packing and covering constraints.

fields
Combinatorics
pdf ↗ page arXiv:2607.09268 ↗

Multiple chessboard complexes are deleted joins of skeleta of a simplex. We classify their homotopy types for at most three rows and extend this classification to arbitrary column capacities, with the $2$-torus as the only exception to a wedge of spheres. We determine explicit homotopy decompositions for two families with four and five rows and use a common capacity redistribution map to construct infinite families with $2$- and $3$-torsion in integral homology. Together, these results give a negative answer to the Segre part of the problem posed by Reiner and Roberts on characteristic-free resolutions of Segre and Veronese modules and identify three as the largest number of rows for which all generalized chessboard complexes have torsion-free integral homology. Our $3$-torsion construction applies to every square ordinary chessboard complex with at least five rows. Combined with earlier results, it completes the proof of the Shareshian-Wachs conjecture on torsion in chessboard complexes.

comments
24 pages with 1 table
fields
Combinatorics, Algebraic Topology
pdf ↗ page arXiv:2610.37827 ↗

We study conformal prediction under covariate shift with a known covariate density ratio, seeking prediction sets with minimum expected length under the target distribution. For every calibration sample size, we prove that the rule combining the inverse conditional-density score with randomized weighted conformal calibration minimizes this expected length among all rules valid over the full weighted-exchangeability class. We approximate the oracle using quantile and kernel histograms, including forest-weighted estimators, and select estimators and tuning parameters by resampling to estimate calibrated target length. On a bounded response domain, we bound excess length linearly in $L^1$ density error at fixed calibration size, without requiring a uniform positive lower bound on the true density. We also bound selection-pool and resampling errors. Under explicit growth conditions, the selected procedure approaches the same oracle while the calibration size remains fixed. Experiments on 36 known-density configurations and four public regression datasets compare coverage, prediction-set length, and runtime with existing methods. In targeted low-coverage and strong-shift comparisons, inverse-density selection yields shorter mean sets in most cases and lower mean runtime than the evaluated weighted baselines, with some differences in achieved coverage.

fields
Combinatorics, Probability, Statistics Theory
pdf ↗ page arXiv:2610.37866 ↗

Nguyen, Scott, and Seymour conjectured that any two disjoint subtournaments of sufficiently large chromatic number contain cyclic triangles, one in each subtournament, with all edges between them oriented in the same direction. We disprove this conjecture by constructing, for every positive integer $d$, a tournament $T$ with a vertex partition $(X,Y)$ such that $χ(T[X]),χ(T[Y])\ge d$, but no cyclic triangle in either part is complete to a cyclic triangle in the other. Our construction combines a graph of large girth and large chromatic number with a variant of Kneser graphs defined in terms of binary functions. We give two proofs of the required chromatic lower bound, one using the Borsuk–Ulam theorem and the other using the octahedral form of Tucker's lemma.

fields
Combinatorics
pdf ↗ page arXiv:2610.37920 ↗

For $p,q$ natural numbers, define $Δ^{\langle p,q \rangle}:=x^{p-1}\frac{\partial}{\partial y} + y^{q-1}\frac{\partial}{\partial x}$, and consider the sequence of polynomials $\biggl((Δ^{\langle p,q \rangle})^n \cdot x\biggr)_{n\geq 0}$; we call these the generalised hyperbolic polynomials. In this paper, we provide a simple combinatorial interpretation for these polynomials. As special cases, we obtain combinatorial interpretations for the coefficients of the analogs of sinh and cosh corresponding to the curve $x^p- p y^q/q=1$; on setting $p=q=3$, we obtain Conrad and Flajolet's tree interpretation for the coefficients of the Dixonian elliptic functions (2006) as a special case. Finally, we show that for any $p,q\geq 3$, after suitably normalising followed by substituting $y=1$, we obtain a sequence of univariate polynomials which are real-rooted.

comments
18 pages, 1 figure
fields
Combinatorics, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.37931 ↗

We study classes of permutations that are defined by avoidance of forbidden patterns. For each fixed finite set $B$ of forbidden patterns, we study the \emph{avoider enumeration problem}: given an integer $n$, output all $B$-avoiding permutations of length $n$. Avoider enumeration is output-polynomial for every fixed $B$. However, our main notion of efficiency is polynomial delay. We use the insert-maximum tree as a search tree, in which permutations are built by repeatedly inserting a new maximum while preserving pattern avoidance. This leads to the \emph{insert-maximum extension problem}, which asks if a given permutation has an avoiding descendant at a specified depth. An algorithm for this problem can prune branches that cannot reach the target length. Hence, if this problem is in P, we obtain polynomial-delay enumeration. To investigate this problem, we introduce and study \emph{pockets}, the maximal finite subtrees of the insert-maximum tree. For fixed $B$, if there is a polynomial $p$ such that every pocket rooted at $ρ$ has at most $p(|ρ|)$ nodes, then the extension problem is solvable in polynomial time and enumeration has polynomial delay. In particular, a bound on pocket depth depending only on $B$ suffices. We prove such a bound if the class is well-quasi-ordered, has a regular insertion encoding, or if $B$ omits one of the three maximum-position types: leftmost, interior, or rightmost. We also prove that extension is in NP for every fixed $B$, even with binary-encoded target depth. On the negative side, we construct a fixed set of $55$ forbidden patterns for which extension is NP-complete. Consequently, enumerating valid extensions from a given starting permutation cannot have polynomial delay unless P=NP. This also answers a question of Hanika by showing that the forbidden permutation constraint satisfaction problem can be NP-complete for a fixed forbidden set.

fields
Combinatorics
pdf ↗ page arXiv:2610.37940 ↗

In this paper, we define a shuffle-insertion product and a cut-box coproduct on the vector space spanned by Dyck paths, where the product is commutative but non-associative. We prove that the product and coproduct are compatible, making the space a non-associative bialgebra. This bialgebra is connected and bigraded by path degree and peak number, and hence is a non-associative Hopf algebra. Its primitive subspace is spanned by atoms, and associators of primitive elements are primitive. Furthermore, we provide closed-form formulas for its left and right antipodes. We also define the convolution product on the space of linear transformations of the non-associative Hopf algebra, which equips this space with a non-associative algebra structure. Finally, we construct a one-parameter deformation preserving the cut-box coproduct. Its zero specialization is the ordinary shuffle Hopf algebra, which is also the associated graded algebra for the atom filtration, while every nonzero specialization is isomorphic to the shuffle-insertion algebra.

comments
19 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.38139 ↗

In 2020, Brualdi and Dahl introduced the discrete derivative $σ'(i)=σ(i+1)-σ(i)$ of a permutation $σ\in\Sym_n$. In this paper, we focus on the second derivative of a permutation, $σ''(i)=σ(i+1)+σ(i-1)-2σ(i)$, and the inflections it determines. We show that for even $n$, the only distinct permutations with the same second derivative are the identity and its reverse, while for odd $n$, the second derivative is not injective even after excluding them. We then study which sets of pairs of integers $(i,j)$ are the inflection set of some permutation and whether a given set is witnessed in $\Sym_n$ for infinitely many $n$. We show that exactly $14$ permutations of $[n]$ have no inflections when $n\ge5$. For a single inflection $\{(k,m)\}$, we determine all $n$ for which it is witnessed in $\Sym_n$: we prove it is always witnessed, and it is witnessed for only finitely many $n$ if and only if $m\ge 2k+1$. In that case, all such $n$ satisfy $2m-2k+1\le n\le 2m-k+2$ (apart from $k=2$, $n=m+1$), and, perhaps surprisingly, this range has gaps once $k\ge 10$, the smallest occurring at $(k,m,n)=(10,21,30)$. Finally, we characterize maximally inflected permutations, whose second derivative alternates in sign, and show that their number $|\mathcal M_n|$ satisfies $2E_n\le|\mathcal M_n|\le(2/3)^{\lfloor n/3\rfloor-1}\,n!$, where $E_n$ is the Euler zigzag number.

fields
Combinatorics
pdf ↗ page arXiv:2610.38237 ↗

L-extendable functions on the integer lattice are functions that admit a $\frac12$UJ-convex relaxation; that is, values can be assigned to the additional half-integral points, while keeping the original values at integer points, so that the resulting function is $\frac12$UJ-convex. Various examples of L-extendable functions and their applications are known. A general characterization of L-extendability for functions on the integer lattice, however, remains open. In this paper, we study the L-extendability of functions on the integer lattice. We first obtain a necessary condition: L-extendable functions are integrally convex. We then consider a special subclass of L-extendable functions, namely, those whose local convex extensions give L-convex relaxations. This subclass has a useful optimization property: the optimal value of the original function coincides with that of the $\frac12$UJ-convex relaxation given by its local convex extension, a property not guaranteed for general $\frac12$UJ-convex relaxations. We characterize this subclass by showing that a function is L-extendable through its local convex extension if and only if it is integrally convex and its restriction to every unit hypercube is D-convex, where D-convexity is a discrete convexity associated with reflected Freudenthal simplicial divisions. This subclass strictly contains the class of D-convex functions. We also give a combinatorial characterization of D-convex subsets of the vertices of a unit hypercube: a set $X\subseteq\{0,1\}^n$ is D-convex if and only if it is majority-closed and contains a relative opposite pair.

comments
17 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.38287 ↗

We construct three binary extremal self-dual codes of length $60$ with weight enumerators for which no binary extremal self-dual codes of length $60$ were previously known to exist. This completes the determination of the weight enumerators that occur for binary extremal self-dual codes of length $60$.

comments
9 pages
fields
Combinatorics, Information Theory
pdf ↗ page arXiv:2610.38323 ↗

The size of cross-intersecting families ${\cal F}_1, \dots, {\cal F}_d$ is usually measured by the sum or the product of the sizes $|{\cal F}_i|$. These two natural size functions have different extremal structures, and different techniques have been developed for them. We introduce the cross-degree of a size function and show that the potential extremal structures of maximum cross-intersecting families are the same for all size functions of finite cross-degree, including the sum and the product. Our main tool is a strengthened form of the generating family method of Ahlswede–Khachatrian, based on standard generating families and on local modifications of cross-intersecting families, which we call mutations. It treats two completely different types of extremal structures in a unified way and, unlike the original method, needs shifting in only one step.

fields
Combinatorics
pdf ↗ page arXiv:2610.38328 ↗

A crescent configuration of $n$ points in $\mathbb R^d$ is a set in general position whose distinct pairwise distances have multiplicities $1,\ldots,n-1$. We construct such a configuration in $\mathbb R^3$ for every $n\geq3$, giving a uniform bound of three for the minimum dimension. The proof uses equally spaced parameters on a short circular helix and Rolle's theorem. We also give explicit integer-coordinate configurations with $O(n\log n)$ bits per coordinate, and prove that every finite initial segment of the sequence $(\cos j,\sin j,2j)_{j\geq0}$ of length at least three is a crescent configuration.

fields
Combinatorics
pdf ↗ page arXiv:2610.38368 ↗

For a positive integer $k$, let $f(k)$ be the minimum number of distinct nonempty subset sums of a zero-sum-free $k$-element set, where the minimum is taken over all finite abelian groups. We prove $f(k)\ge \frac{k^2}{2}-13k\log(k+1)-116k$. Together with the classical upper bound, this gives $f(k)=k^2/2+O(k\log k)$, with the optimal leading coefficient. As a consequence, the Olson constant of every finite abelian group $G$ satisfies $\mathrm{Ol}(G)\le\sqrt{2|G|}+O(\log|G|)$. The argument combines a triangular lower bound for repeated supports, a count using blocks of two and three copies, and a greedy expansion argument. No restriction is imposed on the order of the group or on the stabilizer of the set of subset sums.

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

Every semi-magic square of order $n$ satisfies the axial moment identities $\sum_{i,j}s_{ij}j^m=\sum_{i,j}s_{ij}i^m=M(n)\sum_jj^m$ for all $m\ge1$, where $M(n)=n(n^2+1)/2$. For real matrices the converse requires $1\le m\le n-1$, whereas for arrangements of $\{1,\dots,n^2\}$ fewer moments suffice once $n\ge14$. We define the permutation threshold $k^*(n)$ as the least $k$ such that every arrangement satisfying these identities for $1\le m\le k$ is semi-magic. In terms of the column-sum deviations $γ_j$, the degree-$k$ conditions state that $\sum_jγ_jt^j$ is divisible by $(t-1)^{k+1}$, linking $k^*(n)$ to the Prouhet–Tarry–Escott problem. While Schur's bound on real zeros gives $k^*(n)\le\sqrt{2(n-1)\log(n^4/4)}$, we prove the converse realisability bound $k^*(n)\ge(\sqrt2-o(1))\sqrt n$ (and $k^*(n)\ge(\sqrt6-o(1))\sqrt n$ when $4\mid n$) by perturbing semi-magic squares with complementary row pairs via horizontal swaps. We also show that $k^*(n)=n-1$ for $3\le n\le13$, $k^*(n)=n-2$ for $14\le n\le17$, and $k^*(n)\le n-3$ for $n\ge18$, and determine $k^*(n)$ for $18\le n\le40$ with computer assistance. Finally, at the $k=1$ level of the hierarchy, we specialise the Mantel–Hubert quadratic assignment variance formula to obtain exact means, variances, and limit laws under a uniform random arrangement for the full line-sum energy $E_{\mathrm{full}}$, for the four-term energy $E_4$ combining the first moments and the two diagonals, and for Loly's moment of inertia, and find that $|L_4|=14{,}639{,}440$ arrangements of order $4$ satisfy $E_4=0$.

comments
27 pages, 3 figures, 5 tables; ancillary verification scripts and certificates in anc/
fields
Combinatorics, Number Theory, Probability
pdf ↗ page arXiv:2610.38386 ↗

Nice partitions of hyperplane arrangements give tensor factorizations of Orlik-Solomon algebras as graded vector spaces. In general, a hyperplane arrangement admitting a nice partition need not be free. In this paper, we consider signed-graphic arrangements, the subarrangements of type-$B$ Weyl arrangements, over fields of characteristic different from $2$. We prove that every nice partition of a signed-graphic arrangement is an inductive factorization and hence that the arrangement is free, with nonzero exponents given by the part sizes. In particular, Terao's conjecture holds for the intersection lattices of signed-graphic arrangements admitting a nice partition.

fields
Combinatorics
pdf ↗ page arXiv:2610.38412 ↗

The Turán number $\rm ex(n,H)$ of a given graph $H$ is the maximum number of edges in an $n$-vertex $H$-free graph. In this paper, for all $p\ge q\ge r\ge 2$ and $n\geq p+q+r$, we determine the exact value of $\rm ex(n,K_p\cup K_q\cup K_r)$ and describe all extremal graphs.

comments
26 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.38430 ↗

We study the correction to the standard lower bound $D^*$ for Davenport constants of finite abelian groups with a growing elementary two-component. For every fixed nontrivial abelian $p$-group $H$ of odd order, we prove $D(H\oplus C_2^r)=D^*(H\oplus C_2^r)+(D(H)-1)\log_2 r+O_H(1)$, with a uniform version for varying $H$. For $C_3\oplus C_2^r$, we determine exact values on explicit infinite intervals of ranks. More generally, the correction is logarithmic or smaller precisely when the fixed group has at most one odd prime divisor. We show that the two-primary part affects the logarithmic coefficient: for $C_{24}\oplus C_2^r$, the ratio $(D-D^*)/\log_2 r$ has limsup at least $2.4933231\ldots>2$, whereas for $C_3\oplus C_2^r$ the limit is $2$. These upper limiting coefficients are unbounded even with the odd prime fixed. The proofs use binary codes and finite-field Fourier analysis.

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

The external zonotopal algebra of a graph is generated by nilpotent vertex elements $X_v$ and determines the graphical matroid after deleting loops. Replacing these generators by $f(X_v)$, for a power series $f(u)$, and filtering by word length gives a family of filtered algebras. We extend filtered graph reconstruction from simple graphs to loopless multigraphs without isolated vertices when the linear and quadratic coefficients of $f$ are nonzero. Nevertheless, even the family of Hilbert functions indexed by all polynomials does not determine the graph: two nonisomorphic ten-vertex trees have the same Hilbert function for every $f$, answering a question of Nenashev and the first author. For forests and series whose first nonconstant term has degree $k\ge 2$, we give a monomial presentation indexed by partial score vectors whose entries are divisible by $k$. For normalized nondegenerate functions, a boundary-state calculus gives a common finite parameter partition for all trees of a fixed maximum degree. In maximum degrees three and four, exact symbolic calculations identify these partitions by the vanishing of specified coefficients of $f^{-1}$. For functions with nonzero quadratic coefficient, the same calculus gives explicit recurrences for attached or connecting paths. Symmetry reductions, including commuting actions of $sl_2$ and the symmetric group on the leaves of a star, determine the generic Hilbert series of stars and two-vertex multigraphs and also apply to parallel edges and leaves in larger graphs. For cycles, we determine the highest-degree term and the first three nonconstant coefficients in the stable range. A weighted independent-set formula describes the trace sequence in the remaining conjecture.

comments
74 pages, 8 figures
fields
Combinatorics, Commutative Algebra
pdf ↗ page arXiv:2610.38469 ↗

Let $\mathcal{S}_χ$ be a cuspidal representation of $\mathrm{GL}_2(q)$. A subset $S \subseteq \mathrm{GL}_2(q)$ is \emph{$t$-intersecting} if $\dim_{\mathbb{C}}\{v \in \mathcal{S}_χ: g_1v = g_2v\} \geqslant t$ for any $g_1, g_2 \in S$. In this paper, we determine $\max{|S|}$ where $S$ is $t$-intersecting.

fields
Combinatorics
pdf ↗ page arXiv:2610.38472 ↗

Let $B_n$ be the book graph consisting of $n$ triangles sharing a common edge. We prove upper bounds for $r(B_{\lceilαn\rceil},B_n)$ that asymptotically match the known lower bounds in the remaining range $1/6<α<1/4$. Combined with the known results for the other ranges of $α$, this completely determines the asymptotics of the Ramsey number $r(B_{\lceilαn\rceil},B_n)$ for every fixed $0<α\le1$: \[ r(B_{\lceilαn\rceil},B_n)=(c(α)+o(1))n, \qquad c(α)= \begin{cases} 2, & 0<α\le1/6,\\[1mm] \displaystyle\frac{3}{1+2p_α^2}, & 1/6<α\leα_0,\\[3mm] (1+\sqrtα)^2, & α_0<α\le1, \end{cases} \] where \(α_0:=\frac{52-16\sqrt3}{121}, \;\; p_α:=\frac{1-\sqrt{α(3-2α)}}{1-2α} \;\; (1/6<α\leα_0).\) Consequently, the random lower bound is asymptotically tight if and only if $α\geα_0$, thereby determining exactly the range of $α$ for which the conjecture of Conlon, Fox and Wigderson holds. The proof develops a defect-compensation framework around a $K_4$-free auxiliary graph.

comments
35 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.38515 ↗

A dissociation set of a graph G is a vertex subset S contained in V(G) such that the induced subgraph G[S] has maximum degree at most 1, and the dissociation number of G is the cardinality of a maximum dissociation set denoted by Φ(G). In this paper, we first derive a sharp lower bound on the dissociation number for all unicyclic graphs. Furthermore, we also study the graphs with minimum spectral radius among all unicyclic graphs with given order and dissociation number and explicitly identify all extremal graphs for \(n-4 \le Φ(G) \le n-1\).

comments
21 pages, 17 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.38539 ↗

We study the fast version of the cops and robber game on finite digraphs with unit-speed cops and an unbounded-speed robber. We prove a lower bound for the cop number of every strongly connected digraph in terms of its order, maximum out-degree, and out-vertex expansion, extending Mehrabian's isoperimetric lower bound to digraphs, where connected components are replaced by forward reachable sets. For strongly connected abelian Cayley digraphs of fixed out-degree, we show that the ratio of the cop number to the number of vertices is comparable to each of out-vertex expansion, vertex expansion of the underlying undirected graph, minimum nontrivial character displacement, the square root of the unnormalized Laplacian spectral gap of the underlying undirected graph, and the reciprocal of its diameter. The comparison constants depend polynomially on the out-degree. In the undirected case, we also compare pathwidth with these parameters, complementing the bounded-degree treewidth comparison of Alon and Mehrabian. Combining the directed lower bound with recent cyclic sweep techniques for abelian Cayley graphs, we determine the order of the cop number of positively oriented tori and directed Heisenberg graphs.

fields
Combinatorics
pdf ↗ page arXiv:2610.38552 ↗

For every odd integer $r\ge1$, let $q_r=1-2^{-r}\binom r{(r-1)/2}$. We show that, for every odd $r\ge3$ and sufficiently large $n$, every $n$-vertex $r$-uniform hypergraph with at least $q_r\binom nr$ edges contains a tight component with at least $(1/2-o(1))\binom nr$ edges. This confirms a conjecture posed by Lang and Sanhueza-Matamala in 2024. As an application, for every odd $r\ge1$ and every integer $k\ge\lceil r(3-2q_r)\rceil$, we prove that the asymptotic minimum $(k-r)$-degree threshold for a tight Hamilton cycle in a $k$-uniform hypergraph is $q_r$, which settles, in this range, another conjecture of Lang and Sanhueza-Matamala in 2022 stating that the lower-bound construction due to Han and Zhao is asymptotically optimal. Our proof combines an isoperimetric inequality for Johnson graphs with a Kruskal-Katona-type theorem, which is of independent interest.

comments
20 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.38560 ↗

For each integer $k\ge2$, let $C(k,k)$ denote the oriented cycle formed by two internally vertex-disjoint directed paths of length $k$ with the same initial and terminal vertices. Picasarri-Arrieta and Rambaud ({\small European J. Combin., 2024}) asked for the smallest integer $g_k$ such that every digraph with minimum out-degree at least two and digirth at least $g_k$ contains a subdivision of $C(k,k)$. We completely resolve this problem by proving that $g_k=k+1$. Our proof relies on a refinement of Thomassen's theorem ({\small Discrete Math., 1985}) on two directed cycles intersecting in exactly one vertex: we prove that every digraph with minimum out-degree at least two contains two directed cycles intersecting in exactly one arc. We also establish an embedding theorem for out-forests with prescribed images of their roots, under minimum out-degree and digirth conditions determined by the number of leaves and the heights of vertices in antichains. As an application, for integers $k,\ell\ge2$, we show that every digraph with minimum out-degree at least \(k\) and digirth at least \(k(\ell-1)+1\) contains \(k\) directed paths of length \(\ell\) sharing only their initial vertex, which can be prescribed arbitrarily. This improves the previous digirth bound \((k^\ell-1)/(k-1)+1\) of Picasarri-Arrieta and Rambaud to a sharp bound.

comments
15 pages,2 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.38574 ↗

We investigate a simple method to compute an unbiased estimate of the number of nodes of a directed acyclic graph (DAG) by following a random directed path. This method is due to Leonard Pitt from 1987, and it generalizes a method of D. E. Knuth from the 1960s for estimating the size of a rooted tree. A slight variation makes it possible to estimate the number of source-sink paths. We extend the algorithm to use many "agents" that walk cooperatively through the graph. This extension unifies and generalizes several methods that have been proposed for approximately counting the nodes of a tree.

comments
28 pages, 5 figures, 10 tables, 4 appendices
fields
Combinatorics
pdf ↗ page arXiv:2610.38586 ↗

We develop a framework for pure and mixed graphon colourings and use it to study the limiting behaviour of graph partition parameters under cut convergence. Pure colourings correspond to measurable partitions, while mixed colourings assign a probability distribution on the colour set to each point. We develop the representation, equivalence and convergence theory, and show that every mixed graphon colouring has an equivalent pure representative, possibly on a different probability space. For each fixed finite colour set, we establish compactness and describe the topology of coloured graph limits using the cut norm on graphons and the weak-$*$ topology on colourings. The usual coloured cut distance characterises convergence for pure colourings, but not for general mixed colourings. As applications, we prove that the Cheeger constant and modularity converge to their mixed graphon counterparts along cut-convergent graph sequences whose orders tend to infinity, assuming uniformly linear minimum degree and positive limiting edge density, respectively. Both mixed functionals are invariant under graphon equivalence. We also establish their continuity in cut distance on the corresponding classes of graphons, with a stability bound for the Cheeger constant. For modularity, we further characterise coloured graphons attaining extremal modularity values and prove attainment of the mixed optimum for each fixed number of colours. We also exhibit a graphon whose modularity supremum is not attained by any finite colouring.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2610.38599 ↗

We give the first explicit constant for crossing families of linear size by showing that every set of $n$ points in general position in the plane contains a crossing family of size approximately $\frac{n}{79}$. We further identify some conditions where there are even larger crossing families. The first such condition forbids the existence of a large different pattern, namely non-convex 4-clusters: We show that every point set contains either a large non-convex 4-cluster or a large crossing family. The second condition is the existence of many crossings: We give a bound for the size of a crossing family in terms of the number of crossings of the complete geometric graph drawn on the point set.

fields
Combinatorics
pdf ↗ page arXiv:2610.38658 ↗

We study how the structure of the coupling matrix $\boldsymbol A$ shapes the energy landscape $E_{\boldsymbol A}(\boldsymbolθ)=-\frac12\sum_{i,j}A_{ij}\cos(θ_i-θ_j)$ of the Kuramoto model. We prove that, for an entrywise nonnegative coupling matrix $\boldsymbol A$ with connected support, if $\boldsymbol A$ has rank-width one over $\mathbb R$, then the landscape is "simple", i.e., every local minimum is synchronized. The rank-width bound is sharp, and the result has many interesting implications for global synchronization. The key contribution of this work is to uncover a structural synchronization mechanism beyond the rank-one regime, which has served as a starting point for earlier analyses of global synchronization.

comments
21 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.38670 ↗

We present an analogue of Brion's theorem for the projected integer-point transform. Brion's theorem writes the integer-point transform of a rational polyhedron $P$ as the sum of the rational functions associated to its vertex cones. The pushforward $π_*$ along a lattice projection $π$ turns the transform of $P$ into the generating function of the numbers of lattice points in the fibres of $π$. We group the vertices of $P$ into contracted classes, generated by the edges whose direction $π$ kills, and show that the sum of the rational functions associated to the vertex cones in a contracted class can be pushed forward along $π$, yielding a rational function decomposition of the projected integer-point transform. For a lattice polytope, the classes correspond to the connected components of the fixed locus of the associated toric variety under the action of a subtorus, and our formula resembles the localization formula for this subtorus. We use this decomposition to provide an explicit formula for the projected integer-point transform of a linear family of polytopes. We illustrate this result with families of Gelfand–Zetlin and string polytopes.

comments
15 pages
fields
Combinatorics, Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2610.38674 ↗

Let $\mathcal{Q}$ be a finite thick generalized quadrangle of order $(s,t)$ with a flag-transitive automorphism group $G$. A well-known conjecture of Kantor from the early 1990s asserts that up to duality, $\mathcal{Q}$ is either of classical type, or it is one of two sporadic examples of order $(3,5)$ or $(15,17)$. Although this fundamental problem in finite geometry remains open, it has been resolved in some special cases. For example, a theorem of Buekenhout and Van Maldeghem from 1994 proves Kantor's conjecture under the stronger assumption that $G$ acts distance-transitively on the set of points of $\mathcal{Q}$. In this paper, we study Kantor's conjecture in the setting where $G$ acts primitively on both the points and lines of $\mathcal{Q}$. Here a theorem of Bamberg et al. implies that $G$ is almost simple with socle $X$ a finite simple group of Lie type, and several special cases where the Lie rank of $X$ is at most $2$ have recently been settled in a sequence of papers. Our main theorem resolves the problem for all almost simple groups of Lie type, thereby completing the proof of Kantor's conjecture for generalized quadrangles with a flag-transitive automorphism group acting primitively on points and lines.

comments
97 pages
fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2610.38819 ↗

We prove that extended weak order is a lattice for all rank 3 Coxeter groups. This was previously known in finite and affine types, and in the universal Coxeter group of rank 3. All other cases are new to this paper. As in earlier work, the proof proceeds by showing that all rank 3 Coxeter arrangements are clean arrangements, meaning that every biclosed set is weakly separated from its complement by a hyperplane. As a consequence, we also deduce Dyer's Conjecture A for all rank 3 Coxeter groups, which asserts that cover relations in extended weak order are given by toggling a single root.

comments
28 pages, 13 figures
fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2610.38849 ↗

Call a finite nonempty point set $S\subset\mathbb{R}^d$ all-even if for every direction $\ell \in \mathbb{P}(\mathbb{R}^d)$, the number of hyperplanes perpendicular to $\ell$ that intersect $S$ is even. In 2026, Francisco Santos presented a question of Juan Benigno Seoane-Sepúlveda on the existence of all-even sets in dimensions $3$ and higher, together with examples of such sets in dimension $2$. Call a set $S\in\mathbb{R}^d$ line-all-even if for every direction $\ell \in \mathbb{P}(\mathbb{R}^d)$ the number of lines parallel to $\ell$ that intersect $S$ is even. As Santos pointed out, every all-even set in $\mathbb{R}^3$ is line-all-even. We conjecture that there exist no line-all-even sets in $\mathbb{R}^3$ that affinely span $\mathbb{R}^3$ We show that our conjecture is equivalent to the statement that every planar all-even set satisfies a certain property, which we call height-rigidity. This property has a natural interpretation in linear algebra terms. Furthermore, we present a hierarchy of properties of planar point sets that imply height-rigidity. We construct several all-even sets in the plane, including some infinite families, and show that all the sets we constructed are height-rigid. In addition, we prove that every all-even set in the plane that can be covered by six or fewer parallel lines is height-rigid.

comments
32 pages, 10 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.38864 ↗

We introduce graftings and cograftings for vector species, modelled on the elementary operations of adjoining and deleting a root in a rooted forest. We relate these maps to operads, up and down operators, and obtain nontrivial balanced pairs, admitting pair of creation/annihilation operators with commuting relations. We establish universal properties for the species of rooted forests. Using Fock functors, we recover the classical Connes–Kreimer Hopf algebra, its noncommutative planar analogue, and Foissy's $q$-infinitesimal Hopf algebra.

comments
45 pages, 13 figures
fields
Combinatorics, Category Theory, Quantum Algebra
pdf ↗ page arXiv:2610.38996 ↗

Stembridge conjectured that every monomial immanant is non-negative on totally non-negative matrices, and Haiman proposed a stronger statement which at $q=1$ says that every monomial immanant is a non-negative integer combination of the Kazhdan-Lusztig immanants of Rhoades and Skandera. We prove this for every hook shape $(a,1^{n-a})$ and every $n$. More precisely, each of the per-vertex functions obtained by splitting Stembridge's formula for hook characters is Kazhdan-Lusztig positive. The main tool is a positivity statement for products: a product of Kazhdan-Lusztig positive immanants of complementary submatrices is Kazhdan-Lusztig positive, which we deduce at $q=1$ from Braden's hyperbolic localization, following Billey and Braden. With Haiman's theorem for irreducible characters, it shows that every class function whose Frobenius characteristic lies in the semiring generated by Schur functions and hook monomial symmetric functions is Kazhdan-Lusztig positive; for example, Skandera's chain of normalised hook immanants is Kazhdan-Lusztig positive for every $n$. We place these results in a comparison of three cones of class functions, and show that the remaining obstructions to Haiman's conjecture lie at singular Schubert varieties that are not reached by an iterated doubling identity of Abreu and Nigro, for which we give an explicit criterion. Finally, on the full span of permutation monomials, an element that is non-negative on totally non-negative matrices can have a negative coefficient at the Kazhdan-Lusztig immanant $\mathrm{Imm}_w$ if and only if the Schubert variety $X_w$ is singular; Skandera proved the smooth half.

comments
24 pages, 7 figures, 1 table. Code and data: doi:10.5281/zenodo.23730750
fields
Combinatorics, Representation Theory
pdf ↗ page arXiv:2610.39021 ↗

The Murty-Simon conjecture states that every $n$-vertex diameter-$2$-critical graph has at most $\lfloor n^2/4 \rfloor$ edges, with equality only for the balanced complete bipartite graph. Using regularity methods, Füredi proved this for all sufficiently large $n$ (specifically, $n$ greater than a tower of $2$'s of height roughly $10^{14}$). We present a proof of the Murty-Simon conjecture that works for all $n$. A proof of the $\lfloor n^2/4 \rfloor$ bound was originally found by AI; we simplified this proof and extended its ideas to get a proof of the full conjecture.

comments
13 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.39032 ↗

We introduce two new monomial bases for the top $t$-degree component of the Garsia-Haiman module $V_μ$ for every partition $μ$. Both bases are indexed by column-strict standard fillings of shape $μ$; the first has exponents governed by entrywise refinements of Haglund's combinatorial statistics for the modified Macdonald polynomials $\widetilde{H}_μ(X;q,t)$. The second basis has exponents governed by an insertion algorithm of Bhattacharya-Ratheesh-Viswanath, and gives a basis realization of the ``fermionic formula" of the $m_{1^n}$-coefficient of the $q$-Whittaker polynomial. Our proof uses orbit harmonics, and is inspired by the original approach of Garsia and Haiman.

comments
31 pages, 22 figures
fields
Combinatorics, Representation Theory
pdf ↗ page arXiv:2610.39061 ↗

In this paper, we give combinatorial interpretations of (i) the Graham-positive coefficients in the expansion of double Schur polynomials in the double fundamental quasisymmetric basis and (ii) the coefficients in the expansion of Grothendieck polynomials in the grove basis. To obtain these interpretations, we construct a common lattice path model for Schubert, Grothendieck, and double Schubert polynomials and their respective quasisymmetric counterparts: forest, grove, and double forest polynomials. The first interpretation answers a question of Bergeron, Gagnon, Nadeau, Spink, and Tewari asking for an explicit combinatorial interpretation of the coefficients. It also yields formulas for the equivariant degrees of the quasisymmetric Schubert cycles introduced by Bergeron, Gagnon, Spink, and Tewari. The specialization of the second interpretation recovers Nadeau and Tewari's Schubert-to-forest formula, expressed using the rightmost representatives of their Omega-equivalence classes.

comments
50 pages, 15 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.39077 ↗

Bondy and Tuza generalized the Turán problem for graphs to weighted graphs. Subsequently, Füredi and Kündgen gave a solution in the case of cliques. We consider the weighted Turán problem on hypergraphs and prove the first tight asymptotic result for 3-uniform hypergraphs. Specifically, we determine the weighted Turán density of the generalized triangle $F_5 = \{abc, abd, cde\}$. We also prove weighted stability results and exact results. Many intriguing open problems remain, the most tantalizing of which is to determine the weighted Turán density of the tetrahedron. Bounds for this density using flag algebras are presented.

fields
Combinatorics
pdf ↗ page arXiv:2610.39085 ↗

Many existence theorems in combinatorics and geometry reduce to the Borsuk-Ulam theorem or its generalizations. We study how these existence arguments can be turned into effective numerical methods when a simple example with a single known solution is available. The idea is to deform this example into the given problem and follow its solution during the deformation. We establish conditions under which this procedure reaches a solution and estimate the work needed for a prescribed accuracy. Mass partition problems illustrate the method for both continuous objects and finite point sets. In a fixed dimension, each step for point sets requires work proportional to the number of points; we give conditions under which the entire computation has this linear cost. We also study how changing the initial example can lead to other solutions and support a search for all of them.

comments
24 pages 5 figures
fields
Combinatorics, Numerical Analysis
pdf ↗ page arXiv:2610.39092 ↗

Kalai conjectured that the largest intersecting family of triangulations of an $n$-gon is the family consisting of all triangulations that contain a fixed ear (a chord of length $2$). What happens if we strengthen the intersecting condition to the condition that any two of the triangulations must intersect on a chord from a specified family of chords -- for example, what if any two triangulations intersect on a chord from some fixed point of the $n$-gon, or intersect on an ear? In this paper we verify Kalai's conjecture for families of triangulations in which any two intersect on a chord from some fixed point. We also show that any ear-intersecting family of triangulations has size at most $T_{n-1} +T_{n-3} = T_{n-1}(17/16 + o(1))$, where $T_{n-1}$ is the upper bound in Kalai's conjecture, namely the number of triangulations of an $(n-1)$-gon. This is based on an exact upper bound of $T_{n-1}$ for the size of a family of triangulations in which any two intersect on some ear from the set of all ears with one ear excluded.

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

Dense model theorems of Conlon and Gowers associate to each subset of a sparse random structure a dense set with approximately the same size and configuration counts after rescaling. This allows dense extremal results to be transferred to the random setting. Allen, Böttcher, Lada, and Mergoni Cecchelli recently generalised this approach and established a dense model theorem in an abstract hypergraph framework, with hypotheses that are readily verified in many applications. Both proofs use the separating hyperplane theorem to reduce the existence of dense models to an anti-correlation estimate. We give a simplified proof of a version of this theorem, inspired by the method of hypergraph containers. Our proof constructs dense models from small fingerprints, combining sampling with the Rödl-Ruciński deletion method.

comments
19 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.39176 ↗

Quantifying the self-similarity of complex networks via discrete fractal dimensions is a fundamental problem in network science. In this paper, we investigate some general fractal dimensions of graph families based on q-energy and Rényi entropy. We first establish several bounds for the energy, and then discuss the monotonicity, measure invariance of the dimensions, as well as some concrete graph families.

fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2610.39187 ↗

We give an affirmative answer to the abstract group problem for the category $\YB$ of all set-theoretic solutions of the Yang–Baxter (YB) equation: every group is isomorphic to the automorphism group of a YB-solution, which can be chosen on a finite set if the group is finite. In the terminology of László Babai, this means that the category $\YB$ is universal and finitely universal, which is an analogue of Frucht's classical theorem for graphs. Furthermore, the YB-solutions can be chosen within three very small classes: the solutions of the Frobenius-Separability equation, the solutions of the Baaj–Long–Skandalis equation and the recently introduced bipartite solutions. The proof is based on new constructions which associate to any graph a YB-solution in each of these classes, with the same automorphism group as the graph. Explicit YB-solutions with automorphism groups $C_n$, $S_n$, $D_n$ and $Q_8$ are given.

comments
16 pages
fields
Combinatorics, Group Theory, Quantum Algebra, Rings and Algebras
pdf ↗ page arXiv:2610.39228 ↗

Let $d$ be a positive integer, and let $\mathcal L_1,\mathcal L_2$ be irreducible and coprime linear transformations from $\mathbb{Z}^d$ to $\mathbb{Z}^d$. In this paper, we prove that, for every finite nonempty set $A\subseteq\mathbb{Z}^d$, \[ |\mathcal L_1A+\mathcal L_2A| \ge \left(|\det\mathcal L_1|^{1/d}+|\det\mathcal L_2|^{1/d}\right)^d|A|-O\left(|A|^{1-1/d}\right). \] This confirms the conjecture of Conlon and Lim on the error term for two linear transformations.

fields
Combinatorics
pdf ↗ page arXiv:2610.39235 ↗

We introduce the stable Tamari lattice $\mathcal{ST}_n$, an infinite lattice on $\mathbb{N}^n$. The $r$-Tamari lattices on $r$-Dyck paths of height $n+1$ occur as a nested family of principal lower order ideals whose union is $\mathcal{ST}_n$. Partition-indexed principal lower order ideals recover the $ν$-Tamari lattices associated with partition boundaries. We give an explicit coordinate description of the stable Tamari order in terms of interval vectors determined by the lower endpoint. These coordinates characterize comparability and covering relations, and their sum gives the maximum length of a chain between two comparable elements. Analogous coordinates determined by the upper endpoint give an explicit formula for the Möbius function. We also construct an EL-labeling of every interval and show that every interval in $\mathcal{ST}_n$ is isomorphic to an interval in a classical Tamari lattice. We classify the possible $h$-vectors by Dyck paths and show that each $h$-vector fiber is parametrized by a unimodular basis of interval vectors. Combining this parametrization with the lower-endpoint coordinates, we obtain a finite rational formula for the multivariate generating function of the height generating functions of all principal lower order ideals. Under the $r$-Tamari realization, these height generating functions recover the interval generating functions of Bergeron and Préville-Ratelle.

fields
Combinatorics
pdf ↗ page arXiv:2610.39257 ↗

We establish sharp upper and lower bounds on the geodesic transversal number of hypercubes. We also obtain a lower bound on the geodesic transversal number of Hamming graphs. As applications, we provide negative answers to two open problems concerning the geodesic transversal number.

comments
10 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.39298 ↗

Conlon, Fox and Sudakov (\emph{Math. Proc. Cambridge Philos. Soc.} \textbf{164} (2018), 385–399) conjectured that hereditary subgraph counts force quasirandomness with linear dependence on the counting error. We prove this for every graph containing an edge. Let \(H\) have \(r\) vertices and \(m\ge1\) edges, and fix \(p\in(0,1)\). If every subset \(S\) of an \(n\)-vertex graph \(G\) contains \(p^m|S|^r\pmδn^r\) labelled injective copies of \(H\), then \(\lvert e_G(A,B)-p|A||B|\rvert\le C_{H,p}δn^2\) for all \(A,B\subseteq V(G)\), where \(e_G(A,B)\) counts ordered adjacent pairs. The proof extracts averaged rooted counts and represents each nonlinear term by a linear map in one selected edge factor. Composing two such maps gives an edge substitution with a superlinear cut-norm bound. A separate star expansion gives stronger local estimates for triangle-free graphs. The linear order is best possible even when \(2e(G)/n^2=p+O(n^{-2})\).

fields
Combinatorics
pdf ↗ page arXiv:2610.39317 ↗

A set $S$ of vertices of a graph $G$ is a mutual-visibility set if every pair of vertices of $S$ is joined by a shortest path whose internal vertices avoid $S$, and the mutual-visibility chromatic number $χ_μ(G)$ is the least number of mutual-visibility sets into which $V(G)$ can be partitioned. Klavžar, Kuziak, Valenzuela Tripodoro and Yero (2025) proved that $χ_μ(G)\leχ(G)$ whenever $G$ has diameter two, observed that equality holds for complete bipartite graphs, and asked whether there are any other diameter-two graphs attaining equality. We answer this question in the affirmative. We construct a graph $G_{11}$ of order 11 and diameter two with $χ_μ(G_{11})=χ(G_{11})=3$, and an infinite family of such graphs obtained from $G_{11}$ by replacing one vertex with pairwise non-adjacent copies of it.

comments
8 pages, 3 figures. Submitted to Aequationes Mathematicae
fields
Combinatorics
pdf ↗ page arXiv:2610.39430 ↗

For a graph $R$, let $\widehat R:=K_1+R$ denote its suspension, obtained by adding a new vertex adjacent to every vertex of $R$. For every fixed nonempty bipartite $2$-regular graph $R$, we determine $\operatorname{ex}(n,\widehat{R})$ for all sufficiently large $n$ and characterize all extremal graphs. Three distinct cases arise, according as $R$ is $2C_6$, a disjoint union of copies of $C_4$, or neither of these. This extends the known exact Turá results on odd wheels to suspensions of arbitrary bipartite 2-regular graphs.

fields
Combinatorics
pdf ↗ page arXiv:2610.39445 ↗

We give new upper bounds on families of integer vectors with prescribed coordinate multiplicities and a forbidden scalar product. Our method uses coefficient functions over formal power series and recovers the Frankl–Wilson bound for binary vectors. For vectors in $\{-1,0,1\}^n$, we obtain an exponential improvement over the ordinary polynomial count in a wide range; in certain regimes, we determine the lower limit of the exponential base. We use the new bounds to make progress on several questions in combinatorial geometry. In particular, we improve the base of the exponent in Borsuk's partition problem: we construct finite subsets of $\mathbb R^N$ requiring at least $(1.37+o(1))^{\sqrt N}$ parts of smaller diameter for all sufficiently large $N$, and obtain a base of $1.3839$ along a subsequence of dimensions.

fields
Combinatorics
pdf ↗ page arXiv:2610.39460 ↗

We determine the maximum number of triangles in $n$-vertex $k$-regular graphs and characterize all extremal graphs for all admissible orders when $k$ is odd and for an explicit range of orders when $k$ is even. For even $k$, we also give explicit lower and upper bounds for the remaining orders. As a consequence, we obtain a lower bound on the number of independent sets of size three in $k$-regular graphs and characterize all equality cases. Our exact results confirm the conjecture of Petingi and Rodríguez and the triangle case of a conjecture of Cambie, de Joannis de Verclos and Kang for all odd $k$ and the specified orders when $k$ is even. Moreover, for every even $k\ge18$, we construct counterexamples to both conjectures and obtain a recursive characterization of all extremal graphs of order at least $Ck$, where $C$ is an absolute constant.

fields
Combinatorics
pdf ↗ page arXiv:2610.39461 ↗

A messenger and a pursuer move alternately on a finite loopless directed graph, with complete information and waiting permitted. The messenger moves first and wins upon reaching a designated recipient, before interception there. We determine the maximum number $M(n,m)$ of ordered nonadjacent source–recipient pairs for which delivery is guaranteed against every initial pursuer position, among graphs with $n$ vertices and $m$ arcs. We give the exact value and an explicit attaining graph for every admissible pair $(n,m)$. For $n\ge12$, a piecewise formula describes sparse growth, the interval $2n\le m\le n(n-3)$ in which every missing pair can be guaranteed, a dense staircase, and the zero range above $n(n-2)$. Complete finite tables cover smaller orders. The proofs combine degree and support bounds, local strategy composition, protected routing, and constructions in the missing-arc graph. Finite exceptional cases use explicit strategy certificates and complete computational exclusions. Reproducible programs and certificates accompany the paper; a Lean development verifies the complete formula for $n\ge12$ and $m\ge24$, the claimed scores of prescribed constructions at every admissible pair, and further finite upper bounds. Its remaining obligations are stated separately.

comments
128 pages, 9 figures. Explicit extremal classification with reproducible computational certificates and partial Lean verification. Companion: https://angelraychev.com/cop-prisoner/
fields
Combinatorics
pdf ↗ page arXiv:2610.39469 ↗

Dahlberg, She, and van Willigenburg conjectured that every $e$-positive tree has maximum degree at most three. We prove this conjecture for caterpillars. Our proof introduces a specialization–cone method: we evaluate chromatic symmetric functions under finite-support specializations that are nonnegative on the elementary symmetric functions, express the evaluations through transfer matrices, and certify negativity using finitely generated cones. Two specializations and three cones handle all caterpillars remaining after a connected-partition reduction, with no bound on the number or spacing of their trivalent vertices. The required cone inclusions and strict sign inequalities are certified by exact rational arithmetic. We also exhibit two infinite families of non-spider caterpillars of maximum degree four that admit connected partitions of every type, showing that Wolfgang's criterion alone leaves cases requiring further obstructions. Our result also reduces Li's criterion on $e$-positivity for caterpillars of maximum degree three to an explicit condition on the positions of trivalent vertices.

comments
18 pages, 5 figures, 1 table
fields
Combinatorics
pdf ↗ page arXiv:2610.39481 ↗

Expander graphs have been central objects of study for over fifty years. Ramanujan graphs attain the asymptotically optimal nontrivial adjacency-eigenvalue threshold for infinite fixed-degree families. The original arithmetic constructions by Lubotzky-Phillips-Sarnak (1988) and Margulis (1988), and the iterative $2$-lift method of Bilu-Linial (2006) provide different approaches to Ramanujan graph constructions. Motivated by work on Mealy automata, we combine both approaches to give the following new arithmetic construction. For every prime $p\equiv 1\pmod {17}$, we construct a infinite tower of $(p+1)$-regular non-bipartite Ramanujan graphs on $2^n$ vertices, with label-preserving $2$-lifts between consecutive levels. These construction is strongly explicit: for fixed $p$, a neighbor or lift sign is computable in $O_p(n^3)$ bit operations. The construction uses fixed algebraic $2$-adic transformations, specified by finite data computable in preprocessing depending only on $p$. The main number-theoretic tool is Blasius's Ramanujan-Petersson theorem for Hilbert modular forms, applied through the Jacquet-Langlands correspondence to obtain the sharp bound $|λ|\leq2\sqrt p$ for every nontrivial adjacency eigenvalue of our $(p+1)$-regular graphs. The transformations preserve $2$-adic distance, which gives the binary covers and an explicit formula for their signings.

comments
27 pages
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2610.39485 ↗

We study the Turán number of the Cartesian product of two stars, a family whose order of magnitude is known. For most pairs of star sizes, we determine the leading coefficient exactly. In the remaining congruence class, we give explicit lower and upper bounds for the coefficient at the leading scale. Our lower bounds use blowups of polarity graphs, and our upper bounds use structural estimates on neighbourhoods.

fields
Combinatorics
pdf ↗ page arXiv:2610.39486 ↗

For two sequences with entries $0,\pm1$, periodic complementarity means that their periodic autocorrelation functions sum to zero at every nonzero shift. We give necessary and sufficient conditions on the length for the existence of such pairs of total weight nine, where weight counts nonzero entries. The conditions decide existence at any prescribed length by divisibility tests. The main new result bounds the length of primitive pairs with two nonzero components. A pair is primitive if it cannot be shortened by removing uniformly inserted zeros after independent cyclic permutations. We prove primitive-length bounds of $64,48,64$ for weight distributions $(5,4),(6,3),(7,2)$. These bounds make the classification finite and prove that the earlier searches contain every required case. Exhaustive enumeration gives $91$ primitive sequence-equivalence classes. Including the five known circulant classes gives $96$ representatives from which every pair can be generated. The same catalogue gives class counts at every length. For constructing one pair, $33$ displayed seeds suffice. The results settle earlier conjectures on the weight distributions and decide exactly which orders admit the associated two-circulant weighing-matrix construction.

comments
22 page, 9 Tables
fields
Combinatorics
pdf ↗ page arXiv:2610.39501 ↗

Let $C^{(3)}_n$ be the $3$-uniform tight cycle on $n$ vertices, that is, the $3$-uniform hypergraph on a cyclically ordered set of $n$ vertices whose edges are precisely the triples of consecutive vertices in the given cyclic order. We asymptotically determine the off-diagonal Ramsey numbers of $3$-uniform tight cycles. This is an off-diagonal analogue of a result of Haxell, Łuczak, Peng, Rödl, Ruciński and Skokan [Combin.\ Probab.\ Comput.\ 18 (2009), no.\ 1-2, 165–203] on the diagonal Ramsey numbers of $3$-uniform tight cycles.

comments
34 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.39578 ↗

Erdős, Frankl and Rödl showed that the number of graphs on $n$ vertices with no copy of a non-bipartite graph $H$ is $2^{(1+o(1))ex(n,H)}$, whereas Morris and Saxton showed that this fails for $C_6$. Answering a question of Erdős, we prove that the number of $C_4$-free graphs on $n$ vertices is $2^{(1+o(1))ex(n,C_4)}$. The proof combines a modified hypergraph container method that treats pairs of vertices with large codegree separately, with a new bound on the number of matchings in a graph.

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

We show that the number of ways to tile a circular $n$-board (an annulus divided into $n$ curved unit square cells) with appropriately curved unit squares and curved (1,1)-fences is a Lucas number squared if $n$ is even and an odd-indexed Lucas number otherwise. A curved (1,1)-fence is composed of two curved unit squares separated by a gap in the shape of another curved unit square. This combinatorial interpretation of the Lucas numbers squared and the odd-indexed Lucas numbers allows us to obtain various identities concerning these sequences in a quick and lucid manner.

comments
12 pages, 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2610.39599 ↗

We resolve a number of the problems collected by Kra, Moreira, Richter and Robertson in their survey "Problems on infinite sumset configurations in the integers and beyond". Our main result is that in every countably infinite abelian group, every set of positive upper Banach density contains a sumset $B_1+\dots+B_k$ of $k$ infinite sets, for every $k$; the proof uses the Kronecker factor, but no higher-order Host-Kra structure theory, nilsystems of step greater than one, or nilspaces. We also answer, positively or negatively, questions on monochromatic sets $B+mB$, on sumsets in sets of logarithmic density, on polynomial sumset configurations, on sums of the form $B_{i_1}+\dots+B_{i_m}$ with $B_i$ drawn from a density family, on random sets, on ordered sumsets in shifted primes, on sums and products in $\mathbb{N}$ and $\mathbb{Q}$, and on sumsets in abelian groups. Several of these answers concern the questions as literally stated, and two follow directly from known examples; in each case we say so and discuss the natural corrected question. Finally, answering a question of Kousek and Radić, we show that the supremum of the lower Banach densities of sets $A\subset\mathbb{N}$ such that $B+B+t\not\subset A$ for every infinite $B\subset\mathbb{N}$ and every $t\ge0$ (respectively $B+B\not\subset A$ for every infinite $B$) is $1/2$ (respectively $3/4$). The main theorem and most of the other results are formalized in Lean 4, with some published theorems entering as explicit hypotheses.

fields
Combinatorics, Dynamical Systems, Number Theory
pdf ↗ page arXiv:2610.39637 ↗

For an integer $h\geq2$, an edge-ordered $h$-uniform hypergraph $H^<$ is an $h$-uniform hypergraph with a linear ordering of its hyperedges. For an integer $q \geq 1$, the edge-ordered Ramsey number $R_{\mathrm{edge}}(H^<;q)$ of $H^<$ is the smallest positive integer $N$ such that there exists an edge-ordered $h$-uniform hypergraph $G^<$ on $N$ vertices such that, for every $q$-coloring of the hyperedges of $G^<$, there is a monochromatic copy of $H^<$ in $G^<$ preserving the hyperedge order. In this note, we show that, for every edge-ordered $h$-uniform hypergraph $F^<$ on $n$ vertices with $m\geq1$ hyperedges, $R_{\mathrm{edge}}(F^<;q) \leq R_h(F;q)^{Cm^2}$ where $F$ is the underlying unordered hypergraph, $R_h(F;q)$ is its standard $q$-color Ramsey number, and $C=C(h,q)>0$ is a constant. For fixed $h\geq3$ and $q\geq2$, this shows that prescribing the hyperedge order does not require an increase in the tower height of the classical upper bound. It also settles a problem posed by Fox and Li (2020), and for $h=2$ gives the bound $2^{O(n^4\log n)}$, improving their bounds for every fixed $q \geq 3$.

comments
10 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.39653 ↗

The famous Four Color Theorem (4CT) states that any planar graph can be colored with four colors, but how do we find a 4-coloring? In our previous paper [FOCS'26], we presented a simple combinatorial algorithm to 4-color planar graphs in $O(n\log n)$ time. We improve it here to $O(n)$ time, which is optimal. The algorithm from our previous paper is based on proving that every planar triangulation has a linear number of reducible configurations or obstructing cycles. The bottleneck for the algorithm is that we need $O(\log n)$ Kempe changes to extend a recursive 4-coloring to the reducible configurations. Each Kempe change can involve a constant fraction of the graph and takes linear time. Here we show that all $O(\log n)$ Kempe changes can be identified and implemented in $O(n)$ time. The idea is to spend $O(n)$ time to preprocess the graph so that we can identify and simulate each good Kempe change in $O(n/\log n)$ amortized time. Thus, we implement all $O(\log n)$ Kempe changes in $O(n)$ total time. Based on this, we implement the whole 4-coloring in linear time. We note that creating such a representation for fast identification and simulation of the right Kempe changes is a challenge of data structures, unlike the previous paper that builds on a new graph theoretic understanding of reducible configurations.

fields
Combinatorics
pdf ↗ page arXiv:2610.39753 ↗

We survey recent developments on minimum-degree thresholds in extremal graph theory, with an emphasis on structural refinements of the chromatic-threshold problem. The chromatic threshold asks when a linear minimum-degree condition forces bounded chromatic number in an \(H\)-free graph; its complete classification shows a striking finite trichotomy. We discuss several stronger and related threshold notions in which bounded colourability is replaced by bounded \(H\)-free homomorphic images, bounded neighbourhood complexity via VC-dimension, exact blowup structure for maximal \(H\)-free graphs, and improved quantitative bounds in graph removal lemmas. In contrast with the rigidity of the chromatic threshold, these newer parameters exhibit richer behaviour, including separations from \(δ_χ(H)\), new exact values, accumulation points in fixed-chromatic spectra, positivity phenomena for 3-chromatic graphs, asymmetric variants, and failures of monotonicity.

comments
Survey article. Accepted for publication in the Proceedings of the International Consortium of Chinese Mathematicians (ICCM 2025)
fields
Combinatorics
pdf ↗ page arXiv:2610.39759 ↗

We prove that finite two-graphs have coherent EPPA and that neither graphs modulo global complementation nor two-graphs modulo global complementation have EPPA. This completes the classification of EPPA and coherent EPPA for the reducts of the random graph, answering a question and confirming a conjecture of Evans, Hubička, Konečný and Nešetřil.

fields
Combinatorics, Logic
pdf ↗ page arXiv:2610.39760 ↗

Let $S$ be a reachable image of a strongly connected synchronizing automaton and $\varnothing\ne A\subsetneq S$. We determine the maximum shortest avoid-or-compress length over binary and arbitrary finite alphabets for $m=n-|S|=4$ and $m=5$. The exact values are $\min(n-|A|,11)$ and $\min(n-|A|,14)$, respectively. Uniform binary constructions attain both bounds. For the upper bounds, short-pair graphs and actual-image constraints reduce all parameters to finite necessary domains. Exhaustive checks exclude the domains, apart from a single relaxation eliminated by a multipartite overlap lemma. The largest calculation covers 3,206,988 domains.

comments
13 pages, 2 figures, 1 table. Computer-assisted upper bounds
fields
Combinatorics
pdf ↗ page arXiv:2610.39833 ↗

Kellerhals, Krebs, Nichterlein, and Schmid introduced the optimization problem Tree in Binary Tree (TBT), where, given a tree $T$, the task is to find a binary tree $S^*$ with $V(T)=V(S^*)$ that minimizes $\sum_{uv\in E(T)} \operatorname{dist}_{S^*}(u,v)$. They also introduced the variant Tree in Binary Tree With Steiner Nodes (TBT-SN), where the condition $V(T)=V(S^*)$ is relaxed to $V(T)\subseteq V(S^*)$. We give a simple linear-time $\frac{8}{3}$-approximation algorithm for TBT and a polynomial-time approximation scheme (PTAS) for TBT-SN. Our main building idea in both algorithms is to iteratively consider subtrees of the tree $T$ which contain all vertices below some vertex $v$ and construct a solution where $v$ has degree 1. For the PTAS, we cut $T$ into smaller trees, solve these instances, modify the obtained solutions, and combine them to achieve a solution for the original instance.

fields
Combinatorics
pdf ↗ page arXiv:2610.39863 ↗

We complete the determination of the minimum possible length of eight-dimensional binary self-orthogonal codes with given minimum distance. For dimension nine we give exact values and bounds for minimum distance at most $64$. By exploiting the geometric reformulation of linear codes as multisets of points, we fully redo the classification for dimension at most seven in a simplified and computer-free manner. As a by-product we prove the non-existence of $[93,9,44]_2$ codes and show several divisibility results for putative optimal nine-dimensional binary codes.

comments
39 pages; comments more than welcome
fields
Combinatorics, Information Theory
pdf ↗ page arXiv:2610.39870 ↗

We provide a sharp estimate for the asymptotic number of lattice zonotopes inscribed in [0, n] d as n tends to infinity. Our estimate refines the logarithmic equivalent established by B{á}r{á}ny, Bureaux, and Lund when the sum of the generators of the zonotope is prescribed. As we shall see, the exponential part of our estimate is a polynomial of degree d in n 1/(d+1) , plus a term involving the non-trivial zeros of the Riemann zeta function. Our analysis is based on a correspondence between power sums over primitive vectors (vectors with coprime coordinates) and Eulerian polynomials. We also analyse some combinatorial properties of lattice zonotopes. In particular, we compute the asymptotic mean and variance of the diameter of the graph of a random lattice zonotope inscribed in [0, n] d as n goes to infinity, and show that this diameter satisfies a central limit theorem.

fields
Combinatorics
pdf ↗ page arXiv:2610.39900 ↗

For fixed nonempty words $u,v$, the minimum insertion degree of a shuffle is the least number of inserted-source runs among its representations. We prove that, after a block exchange from a minimum mask of degree $r$, the minimum over masks with commuting source projections is exactly $r-1$; a larger decrease occurs precisely when a noncommuting mask has fewer runs. If either source is unary, every such exchange is exact. We prove an explicit repair for an infinite periodic degree-three family. Computer-assisted results establish first-mask descent through combined length seventeen over every alphabet, degree-three first-mask descent through length thirty, and a uniform repair of all degree-three failures through length thirty, including all further letter identifications. Counterexamples to arbitrary, first, and last minimum-mask choices explain the need for alternative masks. Finally, we prove that minimum iteration depths have no gaps for arbitrary languages. General block-exchange descent and Singleton No-Gap remain open.

comments
22 pages, 10 tables. Software and verification data: https://github.com/the-omega-institute/insertion-degree-descent/releases/tag/v1.0
fields
Combinatorics
pdf ↗ page arXiv:2610.39941 ↗

Let $G$ be a graph with average degree $d>0$ and $C_α(G)$ be the minimum order of a subgraph whose average degree is at least $αd$ for any fixed $0<α<1$. Then $G$ has a minor of average degree $Ω(\sqrt{d\,C_α(G)})$, which is asymptotically tight up to a constant factor. This reveals a unified mechanism underlying previous results on dense minors in locally sparse graphs.

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

For a connected graph P G on n vertices, the interval index is defined by Int(G) = {u,v} subset V(G) (|I(u, v)| - 1), where I(u, v) denotes the set of all vertices lying on a shortest u - v path. It was conjectured that, among all connected graphs on n vertices, the path Pn attains the maximum value of the interval index. In this paper we settle this conjecture, and we prove that the maximum is attained only for Pn, except for n = 4, when the cycle C4 attains the same value. We also prove that, for every n >= 31, the maximum interval index among graphs without pendant vertices equals (n^3 - n)/6 - 2(n - 4) and it is attained by a dumbbell graph, obtained by joining two 4-cycles by a path.

comments
16 pages, 0 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.39966 ↗

Two vertices of a (not necessarily properly) arc-colored digraph are called arc-$\ell$-color-avoiding strongly $k$-arc-connected if, after the removal of the arcs of any at most $\ell$ colors, they remain strongly $k$-arc-connected. The arc-$\ell$-color-avoiding strongly $k$-arc-connected components are maximal sets of vertices such that any two of those vertices belonging to the set are arc-$\ell$-color-avoiding strongly $k$-arc-connected in the graph. We investigate the problems of finding the arc-$\ell$-color-avoiding strongly $k$-arc-connected components and the maximal arc-$\ell$-color-avoiding strongly $k$-arc-connected subgraphs of an arc-colored digraph. We also consider possible generalizations to $k$-vertex-connectivity and to vertex-colored digraphs. We show that despite the seemingly minor differences in definitions, the complexity of these problems varies significantly: some can be solved in polynomial time, while others are NP-hard. It also turns out that in some cases the problem is NP-hard when multiple colors can be assigned to each vertex, but the problem becomes polynomial-time solvable when each vertex is single-colored.

fields
Combinatorics
pdf ↗ page arXiv:2610.39982 ↗

Bérczi, Gehér, Imolay, Lovász, and Schwarcz (SIAM J. Discrete Math. 40(2026), 308–335) asked whether every set function of bounded variation is a difference of two bounded submodular functions, and how to determine the optimum in a monotonic sum-decomposition of a planar graph cut function. In this paper, we answer both questions and obtain quantitative extensions. For the first question, we characterize the continuous profiles $f:[0,1]\to\R$ for which $A\mapsto f(m(A))$ is a bounded submodular difference on an atomless probability space. More precisely, we express the minimum oscillation of the subtracted component through the positive part of the distributional second derivative. We also characterize admissible discontinuous profiles and give an exact summability criterion for countable block functions. In particular, the first question has a negative answer even for increasing functions of variation one whose scalar profiles have log-Lipschitz derivatives and belong to every $C^{1,α}$, $0<α<1$. Turning to graph cuts, we prove that the optimum equals the total edge weight minus the maximum fractional triangle-packing weight for every nonnegative weighting if and only if the graph is $K_5$-free. Moreover, maximum packings parametrize the symmetrized optimal components, while on $K_4$-free graphs we describe all optimal components and characterize uniqueness. Consequently, the formula applies to weighted planar graphs and implies edge-weight monotonicity on $K_5$-free graphs. For rational weights, it also yields polynomial-time constructions.

comments
22pages
fields
Combinatorics
pdf ↗ page arXiv:2610.40032 ↗

Using a rational analogue of an $\mathrm{A}_2^{(1)}$ Rogers–Ramanujan type identity discovered by Warnaar, we establish sum-like expressions for a bivariate generating function for cylindric partitions of rank three. These expressions provide the finishing touch towards conjectures of Warnaar and Kanade–Russell.

fields
Combinatorics
pdf ↗ page arXiv:2610.40079 ↗

The Erdős–Ginzburg–Ziv problem is a classical extremal problem in discrete geometry. We prove that, for all positive integers $n$ and $r$, every sequence of $4^r n$ lattice points in $\mathbb{Z}^r$ contains $n$ points whose centroid is again a lattice point.

fields
Combinatorics
pdf ↗ page arXiv:2610.40095 ↗

An immersion of a graph H in a graph G is full if the immersion uses every edge of G. We give a structure theorem for group-labeled Eulerian graphs excluding a fixed group-labeled graph as a full immersion.

fields
Combinatorics
pdf ↗ page arXiv:2610.40132 ↗

We give a matrix lifting of the entropy-splitting theorem of Csiszár, Körner, Lovász, Marton, and Simonyi, and show several applications. We use it to prove the Cartesian-product inequality conjectured by Sinjorgo and Sotirov for the generalized Lovász theta number, and we also answer the saturation and convexification questions of Carli Silva, Coutinho, Oliveira, and Tunçel on the same theme. For the strong Hoffman bound, we answer a question of Wocjan, Elphick, and Darbari concerning orthogonal rank, and show that optimization over matrix weights gives exactly the ceiling of the theta number of the complement. Finally, we extend the lifting to diagonally invariant cones of positive semidefinite matrices, giving a proof of a conjecture by Kuryatnikova, Sotirov, and Vera, and giving a short proof, for all graphs, of a theta-based weakening of Fajtlowicz's graph-energy conjecture.

comments
14 pages
fields
Combinatorics, Optimization and Control
pdf ↗ page arXiv:2610.40145 ↗

This manuscript presents a proof of the Alon–Seymour–Thomas conjecture developed under the author's guidance using ChatGPT 6pro. The author has checked every formula and theorem by hand and used Codex to assist with writing. GPT 6.1 Sol (Max) was also used to check the proof repeatedly and to generate numerous examples for verification. More precisely, for every integer $h\geq3$, every $n$-vertex $K_h$-minor-free graph has a vertex set of size at most $\min{n,21h\sqrt n}$ whose deletion leaves every component with at most $2n/3$ vertices.

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

We prove the Borodin–Kostochka conjecture for $(\mathrm{diamond},L_4)$-free graphs and $(\mathrm{diamond},K_5^+)$-free graphs, where $L_4$ is obtained from $K_4$ by attaching a path of length two to one clique vertex, and $K_5^+$ is obtained from $K_5$ by adding a vertex adjacent to exactly one clique vertex. The proof uses structural properties of maximum cliques in diamond-free vertex-critical graphs with $χ=Δ$.

fields
Combinatorics
pdf ↗ page arXiv:2610.40279 ↗

We consider non-transitivity among dice with \(n\) sides restricted to taking face values in the set \(\{1,\ldots,n\}\). We give a computer-assisted proof that \(n=6\) is the smallest \(n\ge3\) which admits a non-transitive cycle of maximum length \(n\) with uniform and minimal winning advantage. For \(n=6\), we identify the two unique non-transitive cycles of length \(6\). We present computational evidence supporting a conjecture that \(n=6\) is the largest \(n\ge3\) which admits a non-transitive cycle of maximum length \(n\) with uniform and minimal winning advantage.

comments
59 pages, 6 figures. Appendix includes Julia code and computational output
fields
Combinatorics
pdf ↗ page arXiv:2610.40321 ↗

Let a_A(n) be the number of permutations of {1,...,n} all of whose cycle lengths lie in a set A. We develop a valuation calculus for these numbers. Mobius inversion writes the exponential generating function as an Euler product, and at a prime p the factors with non-p-integral exponents, the blocks, determine a finite knapsack problem. Its optimal value gives a lower bound for v_p(a_A(n)), and the bound is attained exactly when one residue modulo p, the sum of the terms of the optimal choices, does not vanish. For a fixed set A and prime p the bounds and residues for all n <= N cost O(N^2) operations. When one block is strictly the most efficient, the valuation inside each residue class is that of a locally analytic p-adic function. We use the calculus to determine the 2-adic and 3-adic valuations for cycle lengths at most 3, 4 and 5, to prove the divisibility conjectures recorded in A378495, A079128, A193437 and A193438 and the 3-adic statements recorded in A057693 and A070945, and to treat 99 OEIS sequences in all. We also prove sharp divisibility and gcd theorems, show that at n = 111 the gcd of the counts over all sets of excluded cycle lengths containing {1,2,3} is one third of the gcd over the sets {1,2,3,k}, and determine eventual divisibility and tail gcds modulo composite integers. Part of the paper is formalized in Lean 4.

comments
62 pages. Ancillary files: verification scripts and outputs, Lean 4 sources, and an OEIS catalogue of 99 sequences
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2610.40342 ↗

Biadjoint scalar theory partial amplitudes, $m_n(α,β)$, define an $(n-1)!/2\times (n-1)!/2$ matrix, $M_n$, with rows and columns labeled by orderings. The CHY construction of $M_n$ implies that its rank is $(n-3)!$. Invertible submatrices of maximal rank enter in the KLT construction relating graviton amplitudes to gluon amplitudes. Motivated by finding the KLT formula with the smallest number of terms, one of the authors posed the question of whether there is a critical $n_c$ such that for all $n>n_c$ there exists a diagonal submatrix of $M_n$ of rank $(n-3)!$. In this work we obtain bounds on the size of the largest non-singular diagonal submatrix of $M_n$, which we call its diagonal degree $Δ_n$, and we answer the question in the negative. We prove that the diagonal degree is exponentially suppressed relative to the CHY rank: $Δ_n/(n-3)! = \exp(-Θ(n))$ as $n\to \infty$. More explicitly, we establish the bounds $\exp(-1.5n)\leqΔ_n/(n-3)!\leq \exp \left[ -0.01n+O(1)\right]$.

comments
23 pages (21 pages + appendix), 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2610.40355 ↗

We prove that a two-distance set in $\mathbb R^d$ with distance ratio $1:\sqrt{2}$ has at most $d(d+1)/2$ points for every $d\ge9$. Equality in full affine dimension characterizes the Johnson construction; for $d\ge10$, the full-dimensional condition is automatic. The proof separates configurations according to the connectivity of the short-distance graph. The connected case uses root lattices and intersection theorems, while the disconnected case uses an orthogonal decomposition into component direction spaces and the span of their center differences. We also prove a relative bound for Euclidean two-distance sets and show that equality forces sphericity. Together with the Larman–Rogers–Seidel theorem, these results give maximum cardinality $d(d+1)/2$ for $9\le d\le21$ and $275$ for $d=22$, without exhaustive enumeration.

fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2610.40367 ↗

For many optimization problems on random graphs, most prominently the largest independent set problem, natural algorithms reach only half the optimum, and such factor-two gaps are known to be sharp within broad algorithmic classes. We prove such a gap for finding large induced matchings in Erdős-Rényi random graphs. In the worst case, requiring a matching to be induced turns a polynomial-time solvable problem into an NP-hard one; our results reveal an average-case counterpart. In $G(n,p)$ with $C/n\le p\le 1-κ$, the largest induced matching has size $(1+o(1))L$ with high probability, where $L=\log_{1/(1-p)}(np)$. A simple online greedy algorithm finds an induced matching of size $(1/2-ε)L$, while no online algorithm, even with adaptive inspection order and unbounded computation, finds one of size $(1/2+ε)L$ except with probability $\exp(-Ω(L\log(np)))$. In the sparse regime $p=d/n$, low-degree polynomial algorithms exhibit the same sharp threshold. Our guarantees rest on a maximality principle: with high probability, every maximal induced matching is half-optimal. Greedy outputs a maximal induced matching and our low-degree algorithm a near-maximal one. We bypass the delicate coupling arguments classically used to analyze greedy since Karp. For low-degree hardness, we adapt Wein's overlap gap argument, with forbidden structures that track overlaps between endpoint sets rather than edge sets, since a new edge may join two previously used endpoints and thus encounter no fresh randomness. For online hardness, we give a new and significantly simpler argument that avoids the correlated instances of prior OGP-based proofs: at a suitable stopping time, all pairs involving uninspected vertices remain unrevealed, so a direct first-moment bound suffices.

comments
32 pages plus references
fields
Combinatorics
pdf ↗ page arXiv:2610.40369 ↗

A graph $G$ with $m$ edges is a Nosal graph if its spectral radius $λ(G)$ exceeds $\sqrt m$. At the threshold $λ(G)=\sqrt m$, the star $K_{1,m}$ shows that one vertex can be incident with all $m$ edges. In contrast, Li, Liu and Zhang [J. Combin. Theory Ser. B 179 (2026)] proved that every Nosal graph $G$ with sufficiently many edges satisfies $Δ(G)\le\frac12m+m^{0.99}$, where the constant $\frac12$ is best possible. In this paper, we prove that every Nosal graph $G$ with spectral radius $λ$ satisfies $Δ(G)<m-\frac12(λ-1)(λ-2)$, and hence $Δ(G)<\frac12m+\frac32\sqrt m-1$. Both bounds are sharp up to an additive constant less than $\frac12$: for every $r\ge3$, the complete graph $K_r$ with $\frac12(r^2+r-2)$ pendant vertices attached to one vertex is a Nosal graph with $r^2-1$ edges whose maximum degree lies within $\frac12$ of both bounds. Consequently, the largest maximum degree of a Nosal graph with $r^2-1$ edges is exactly $\frac12(r^2+3r-4)$. The first bound cannot be improved by any positive additive constant: its gap on these graphs is less than $\frac{4}{r+5}$ and tends to zero as $r\to \infty$.

comments
6 pages, 1 figure. Any comments are welcome
fields
Combinatorics
pdf ↗ page arXiv:2610.40380 ↗

Halin conjectured in 1964 that every connected graph has an end-faithful spanning tree. He proved this for countable graphs, but in the early 1990s Seymour and Thomas and, independently, Thomassen found uncountable counterexamples. Both are infinitely connected and hence one-ended, and their unique end has uncountable degree (i.e.\ contains uncountably many pairwise disjoint rays). Several authors have since asked how much of the conjecture survives. Diestel asked in 1992 whether a graph has an end-faithful spanning tree as soon as all its one-ended connected subgraphs have one; by a theorem of Polat, this would give end-faithful spanning trees in all connected graphs whose ends have countable degree. Diestel and Kühn introduced topological spanning trees, a topological variant of end-faithful spanning trees that exists in every one-ended connected graph, and asked in 2004 whether every connected graph has one. And Carmesin asked in 2019 whether every graph has a spanning tree that is end-faithful at least for its thin ends, the ends of finite degree. We answer all three questions in the negative. We show that the uncountably chromatic graph from an earlier note of ours on a problem of Erdős and Hajnal has only ends of countable degree, each dominated by only countably many vertices, yet it has neither an end-faithful nor a topological spanning tree. A refinement of this graph moreover has no spanning tree that contains a ray from every end of degree~1.

comments
17 pages, 8 Figures
fields
Combinatorics
pdf ↗ page arXiv:2610.40458 ↗

In this note, we prove that for a subset $\mathcal{F}$ of $\{0,1\}^n$ of density $\frac{1}{8}$, its average pairwise Hamming distance is at least $\frac{n-3}{2}$, with equality attained only by $(n-3)$-dimensional subcubes. This answers a question of Lei Yu, and solves an important open case of a more general question posed by Ahlswede and Katona in 1977.

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

We prove that the Ehrhart $h^*$-polynomials of crown order polytopes are real-rooted, settling a conjecture of Lundström and Saud Maia Leite. For each integer $r\ge3$, the crown order polytope on $2r$ elements and the rank-$r$ whirl base polytope have the same $h^*$-polynomial. The $h^*$-polynomials of the rank-$r$ wheel and whirl base polytopes, as well as every convex combination of the two, have $2r-2$ distinct negative roots. Their coefficient sequences are positive, unimodal, and strictly ultra log-concave of order $2r-2$.

fields
Combinatorics
pdf ↗ page arXiv:2610.40496 ↗

A king in a tournament is a vertex from which every other vertex is reachable by a directed path of length at most two. We study the deterministic query complexity of finding a king when a query specifies a set of vertices and returns the number of edges directed from that set to its complement. We prove that this complexity is $Θ(n)$ for $n$-vertex tournaments. To show this, we first show that every correct deterministic algorithm in this model must output a maximum-outdegree vertex, even though a king need not have maximum outdegree. We then give an adversary whose answers, after too few queries, remain consistent with a tournament in which the algorithm's output does not have maximum outdegree.

fields
Combinatorics
pdf ↗ page arXiv:2610.40521 ↗

Let $G$ be a simple graph of order $n$ and let $k_r$ denote the number of unlabeled copies of $K_r$ in $G$. Let $s^+$ denote the sum of the squares of the positive adjacency eigenvalues of $G$. For every fixed integer $r\geq2$, we prove that, as $n \to \infty$ \[ \sqrt{s^+}>\left(1-\frac1r\right)n \quad\Longrightarrow\quad k_{r+1}\geq \left(\frac1{r^{r-1}}-o_r(1)\right)n^{r-1}. \] The coefficient $r^{-(r-1)}$ is asymptotically best possible; in particular, the triangle case gives $k_3\geq n/2-o(n)$. The proof combines positive square energy stability, the clique removal lemma, and a sharp clique count around a maximum $r$-cut. The triangle case requires an additional block-matrix argument.

comments
Comments are welcome
fields
Combinatorics
pdf ↗ page arXiv:2610.40570 ↗

We confirm a conjecture of the first author [SODA'26] on a strong form of pseudo-telepathy for Khot's $d$-to-$1$ games: for every $d\geq 4$, every $ε>0$, and every $k\in\mathbb N$, there is a $d$-to-$1$ label-cover game of classical value less than $ε$ that admits a perfect quantum strategy using finite-dimensional shared entanglement with measurement contexts of radius at least $k$. As a consequence, there exist graphs whose quantum chromatic number $χ_q$ is $3$ and whose classical chromatic number $χ$ is arbitrarily large. This is the first improvement on the quantum chromatic gap since the work of Brassard, Cleve, and Tapp [Phys. Rev. Lett.'99], which produced graphs for which $χ$ grows exponentially in $χ_q$. To prove the conjecture, we proceed as follows. We start with a ``stretched'' version of the Mermin–Peres magic square, obtained by spacing out its equations and linking them with additional long equation wires. This operation increases the radius of the initial measurement contexts of a perfect quantum strategy for the game, while preserving classical unsatisfiability. We then apply parallel repetition to make the classical value small, and we turn the system into a pseudo-telepathic multi-layered Kneser hypergraph via a PCP construction of Dinur, Guruswami, Khot, and Regev [STOC'03]. Finally, we feed the resulting hypergraph into the reduction of Fei, Minzer, and Wang from hypergraph colouring to $4$-to-$1$ games, we establish quantum completeness of this reduction, and we show that it preserves context radius.

fields
Combinatorics, Operator Algebras
pdf ↗ page arXiv:2610.40571 ↗

We investigate counting problems for discrete (geometric) structures in tropical settings, motivated by the comparison of the expressivity of linear programs and mean-payoff games. First, we give an upper bound on the number of coherent matching fields of type $(n,r)$ and a lower bound on the number of combinatorial types of $n$-hyperplane sequences in the max-plus tropical space of dimension $r-1$. These structures are closely related, and our bounds establish that as $n \to \infty$, for every fixed $r$ their number equals $n^{(r-1)^2n+o(n)}$. This in turn implies that the number of regular triangulations of the products of simplices $Δ^{n-1}\timesΔ^{r-1}$ is also $n^{(r-1)^2n+o(n)}$, thereby answering a question of Santos. Second, we obtain that the number of labeled order types over the reals and over the signed tropical numbers coincide at first order, establishing a comparison of the expressivity of mean-payoff games and linear programs as measured by labeled order types. Last, the subclass of mean-payoff games known as parity games arise from linear programs by a ``double tropicalization.'' We show that the number of labeled order types obtained after this double tropicalization collapses.

comments
35 pages, 16 figures
fields
Combinatorics, Algebraic Geometry, Optimization and Control
pdf ↗ page arXiv:2610.40622 ↗

Optimization and Control68

Fluctuation-based super-resolution techniques are an appealing alternative to single-molecule and structured-illumination microscopy, as they adapt to standard acquisition settings and exploit the independent stochastic fluctuations of fluorophores across a sequence of frames. However, most existing approaches lack an explicit model of the acquisition process and provide only relative intensity estimates, limiting quantitative analyses. In this work, we combine model-based and generative approaches to exploit the full stochastic information in the sequence, proposing a reconstruction framework built on flow matching and a double-Poisson forward model accounting for blinking, blur, under-sampling and noise. The method alternates two steps: a flow matching model first learns the distribution of the acquired data; then, the sample and the background are jointly estimated by minimising a Kullback-Leibler divergence between observed and simulated distributions via regularised proximal gradient steps. On simulated and real Argolight data, the method resolves lines separated by 120 nm, outperforming SACD and eSRRF.

comments
5 pages, 3 figures, submitted to ISBI 2027. Code available at https://github.com/cozzalberto/flow_fluo
fields
Optimization and Control
pdf ↗ page arXiv:2610.37802 ↗

We study the optimal control of a stylized finite-horizon heat-storage system operated by a prosumer who can buy heat from and sell heat to a district heating network. Heat production and consumption are uncertain, and charging and discharging decisions have to be taken before the subsequent heat balance is observed. The resulting problem is formulated as a Markov decision process with continuous state and action spaces. We first establish a structural characterization of the optimal policy as a two-parameter threshold policy. Under additional regularity assumptions, we prove differentiability and Lipschitz properties of the value functions. Exploiting the threshold structure, we parameterize the policy by the time-dependent lower and upper thresholds and derive a pathwise stochastic-gradient estimator. We then propose a projected stochastic policy-gradient algorithm, establish a constrained Kurdyka-Łojasiewicz inequality and derive global finite-sample bounds for both the objective optimality gap and the distance to the optimal threshold vector. Finally, numerical experiments for a non-stationary heat-balance process illustrate the evolution of the threshold parameters.

fields
Optimization and Control
pdf ↗ page arXiv:2610.37853 ↗

We establish convergence guarantees for the Stochastic LineseArch Method (SLAM) proposed and analyzed in Wang et al. (arXiv:2512.14979) for nonconvex composite stochastic optimization, retaining the iteration and sample complexity orders of the original analysis assuming neither the boundedness of true gradients nor the Lipschitz continuity of the convex nonsmooth term $r$. ChatGPT was used to assist in developing a key intermediate result. Under uniformly Lipschitz continuous and unbiased sampled gradients with uniformly bounded variance with mini-batch sizes proportional to the iteration budget, SLAM achieves an iteration complexity $\mathcal{O}(ε^{-2})$ and a sample complexity $\mathcal{O}(ε^{-4})$ for obtaining an iterate whose expected proximal-gradient residual norm is at most $ε$.

fields
Optimization and Control
pdf ↗ page arXiv:2610.37947 ↗

Rounded capacity cuts (RCCs) are among the most effective cuts for capacitated vehicle-routing relaxations, but exact separation is computationally prohibitive at scale. Existing heuristic and neural separators can be fast, but often fail to produce sufficiently many effective cuts within practical separation budgets. We introduce SAG-Sep, a separator that scores node membership in RCC-inducing subsets across vehicle-count levels from a fractional LP solution in a single encoder forward pass, avoiding the iterative predict-and-coarsen inference used by NeuralSEP-style separators. SAG-Sep encodes the LP solution as a Sparse Augmented Graph (SAG), adding flow-informed multi-hop edges that expose long-range routing structure without densifying attention. Beyond LP-aware sparse encoding, we observe that high-value exact RCCs are typically nested, organizing into onion-like subset families, and SAG-Sep's node scores track subset nesting depth. This motivates Onion-Sweep (OS), a training-free decoder that ranks customers by their scores, evaluates the RCC violation of every prefix of the ranking in one vectorized pass, and emits the most violated prefix of each replica together with a cross-replica family of nested proposals, converting independent node scores into structurally coordinated RCC candidates without a tuned threshold or probing band. On the NeuralSEP benchmark with N=1000 customer instances, SAG-Sep with OS reduces the average root gap by 17.7% relative to the strongest NeuralSEP baseline, while the single-pass SAG-Sep separator achieves a roughly 30-fold per-iteration neural separation speedup. Our findings suggest that LP-aware sparse encoding and the nested structure of high-value cuts are structural patterns worth leveraging in neural separation more broadly.

comments
42 pages, 4 figures, 26 tables. Accepted at NeurIPS 2026 (Main Track). Code: https://github.com/henryleo180/SAG-Sep
fields
Optimization and Control
pdf ↗ page arXiv:2610.37952 ↗

First-order methods, such as the primal-dual hybrid gradient (PDHG) method, have recently been explored for large-scale semidefinite programming (SDP). However, exact projections can be computationally prohibitive, motivating inexact projections using conditional gradient methods. Although computationally cheap and projection-free, these methods typically converge sublinearly. Recent variants, such as Spectrahedron Frank-Wolfe (Garber, 2026), achieve linear convergence in expectation near the optimal face of the spectrahedron. We develop an inexact PDHG framework with tractable spectrahedral projections using two techniques: (i) adaptive error tolerances that avoid unnecessary inner iterations while guaranteeing convergence, and (ii) a heuristic spectral warm start based on the Lanczos algorithm that accelerates Spectrahedron Frank-Wolfe by initializing near the optimal face. We establish an O(1/t) convergence rate for PDHG in the presence of projection errors and estimate the total number of inner iterations required for convergence. Experiments on large-scale SDP instances demonstrate that combining spectral warm starts with Spectrahedron Frank-Wolfe outperforms Lanczos-based inexact projections.

fields
Optimization and Control
pdf ↗ page arXiv:2610.37998 ↗

Selecting attitude actuators for spacecraft in low earth orbit (LEO) often involves a trade between reaction wheels and magnetorquers. Reaction wheels generally have higher size, weight and power as well as cost, compared with magnetorquers, but have performance advantages. We consider a hybrid system relying on a single reaction wheel and three magnetorquers, using a trajectory planning control method that focuses on meeting pointing goals and minimizing the need to desaturate the reaction wheel. The use of planning allows for intelligent use of the reaction wheel and accommodates time-changing goals and orbit-varying magnetic fields. Preliminary results show trajectories with fractional-degree-accuracy, as well as management of reaction wheel momentum and avoidance of stiction. We also compare to a magnetorquer-only planning-based control system and show better convergence and faster slews.

comments
19 pages, 26 figures in 14 groups, AAS/AIAA Astrodynamics Specialist Conference
fields
Optimization and Control
pdf ↗ page arXiv:2610.38029 ↗

Ship-to-home fulfillment requires a retailer to select a fulfillment location and carrier before the delivery time is known. These decisions often rely on static transit-time estimates, which cannot represent how delivery-time uncertainty varies across orders and fulfillment options. This paper constructs conformal predictive distributions (CPDs) using Conformal Predictive Systems (CPS) for regression and the cross Venn-Abers predictor (CVAP) for multiclass classification, and uses them in a contextual optimization model for fulfillment decisions. The model is solved by contextual sample-average approximation (C-SAA). The regret of each fulfillment decision, its expected cost above that of the best decision, is bounded by forecast error, scenario-evaluation error, and the candidate-generation gap. The forecast term depends on how well calibration residuals or class probabilities represent the current order. On more than five million proprietary order records, CVAP raises exact-day accuracy from 49.5% for the rule-based estimate to 64.1%. Paired with a decision rule that selects a quantile weighting late errors more heavily, the split CPS (SCPS) gives a point estimate that raises late-delivery detection from 3.8% to 79.4%. Residual-based CPS distributions also meet or slightly exceed nominal interval-coverage targets. In decision experiments with a JD.com simulator over six test dates, C-SAA with CVAP lowers mean total cost by 7.1% and C-SAA with the Mondrian CPS (MCPS) lowers it by 6.7%, relative to C-SAA with the original nonconformal forecast. Both cut the late-delivery rate from 5.7% to below 4.0%.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38046 ↗

Solving large-scale multiparametric quadratic programs (mpQPs) in real time often requires thousands of iterative optimization updates, creating a major computational bottleneck in model predictive control and learning-enabled systems. This paper proposes TQPNet, a self-supervised neural compression framework that learns to compress long ADMM optimization trajectories into a compact neural warm start followed by a few refinement iterations. We derive a low-dimensional ADMM scheme operating on the primal-dual variables $(x,β)$ and show that its iteration admits an equivalent ReLU-layer representation, termed ADMM(ReLU). Building on this insight, TQPNet combines a multilayer perceptron with ReLU activations (MLP(ReLU)) and a small number of unrolled ADMM(ReLU) refinement layers. The network is trained offline using an optimality-condition-informed residual loss, eliminating the need for solver-generated labels. The proposed residual-based framework enables both self-supervised training and online solution certification through adaptive ADMM(ReLU) refinement. Experiments on large-scale mpQPs and real-time MPC applications demonstrate that TQPNet achieves high accuracy, strong generalization, and substantially faster inference than conventional optimization-based methods.

code
github.com/SOLARIS-JHU/TQPNet repository not found
comments
Accepted at NeurIPS 2026. Code: https://github.com/SOLARIS-JHU/TQPNet
fields
Optimization and Control
pdf ↗ page arXiv:2610.38079 ↗

We study the \textit{Boxing Problem}, which seeks a subset of points in \(\mathbb{R}^d\) maximizing the total reward of a selection of points minus the width of its axis-aligned bounding box. We also investigate the associated \textit{Boxing Set}, defined by the epigraph of the width function over binary selection variables. Although the width function is not submodular in general, we restore submodularity by fixing an anchor point. After anchoring, we establish a connection to the intersection of mixing sets with a linking constraint, which yields a polynomial-time optimization algorithm and a polynomial-size extended formulation. We then study the polyhedral structure of the Boxing Set and show that its facets admit laminar families of tight sets and can be obtained by sequential lifting. For the one-dimensional case, we provide a complete description of facet-defining inequalities together with a strongly polynomial-time separation algorithm.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38085 ↗

We continue the study of minimum-time escape of an omnidirectional evader from the forward conic field of view of a Reeds–Shepp pursuer, now for a faster evader, and solve the game for every speed ratio $ν>1$ and every half-angle $0<α<π/2$: the escape time is characterized by explicit characteristics and the selection of roots of a scalar equation, and it is the value of the game in nonanticipative strategies at every state. Above the end $E$ of the evader's dispersal line on the front axis, the evader chases the reversing pursuer along a universal line fed by tributaries. The characteristic from the boundary of the usable part is an involute of a circle of radius $ν$ ending at a cusp, and two explicit thresholds decide whether it reaches the axis before the cusp and whether the jump of the escape time across it ends before the cusp or runs to it; in the latter case primaries fold back next to the barrier. The pursuer's optimal strategy is the relay of the slower case. The evader follows the tributaries and switches once to a primary, or commits in advance to a heading certified by the scalar equation of the primaries. Level-set and semi-Lagrangian computations are compared with the value.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38125 ↗

Benders decomposition and column generation solve large optimization problems by passing cuts, columns, and dual values between a master problem and subproblems, and are hard to implement correctly. Large language models now automate parts of algorithm design, which points toward agents that build decomposition solvers for new problems. As a first step toward such agents, we study how well current coding agents design and implement these two algorithms, and how they fail. We introduce DecompGym, 81 instances from nine problem families (five Benders, four column generation), in which an agent writes a solver for a prescribed method. Each solver must meet three criteria: execution within a 60-second time limit; numerical feasibility together with a method audit, in which an LLM judge reads the solver's code; and an objective within 1% of the stored optimal objective. We evaluate 12 GPT, Claude, and Gemini models running in coding-agent tools. Over up to ten attempts, we compare independent regeneration with reflection, which first diagnoses the failure. On the first attempt, two models solve every instance and seven solve more than 90%. Most Benders failures (48 of 62) are missing or suboptimal solutions. The most common column-generation failure is a method-audit rejection. Output checks alone would accept 93 of the 108 attempts that fail the method audit. The most common rejection, an optimalif, occurs 96 times, 92 of them in one model.Reflection turns 66% of retries into successes, compared with 39% for regeneration, and it repairs method-audit failures, for which the judge names the defecective gaps. Agents for decomposition therefore need checks on how a solver reaches its answer and feedback that locates the error. The benchmark is available at https://github.com/SIKAI-C/DecompGym.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38175 ↗

Fast inference and strict constraint satisfaction are essential for learning-based decision-making. Existing methods often rely on constraint-specific projections or feasible-set parameterizations, while iterative repair can be costly. We introduce Convex-SKM-Net, a convex constraint-satisfaction layer that forms linearization halfspaces from residual and (sub)gradient oracles without constraint-specific inequality projectors. It applies fixed-depth dual projected-gradient descent (dual PGD) to minimum-displacement block problems using GPU-friendly matrix operations. We jointly learn the predictor and a positive-definite mobility, adapting the correction geometry to improve objective quality. We prove convergence of the outer iterates at fixed dual depth and linear convergence in distance under Slater's condition and bounded subgradients. All our test outputs on three second-order-cone model-predictive control (SOC-MPC) horizons and six power-system convex relaxations satisfy a $10^{-3}$ feasibility tolerance. Comparisons with the latest constraint-satisfaction methods show inference speedups of up to $144.3\times$ on SOC-MPC and $7.7\times$ on a convex quadratically constrained quadratic programming (QCQP) benchmark with joint training. On QCQP, the mean objective gap is $0.012\%$, with full test feasibility at $10^{-4}$. Learning mobility reduces the five-seed affine-task mean gap by $22.4\%$ and improves gaps in matched power-system comparisons.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38197 ↗

Proximal-gradient methods are widely used for composite optimization, but inexact proximal updates introduce a residual in the proximal optimality condition, complicating the analysis of how stationarity changes across a step. We study this question for composite objectives consisting of a smooth convex term and a possibly nonsmooth weakly convex term, focusing on the relationship between the directional-stationarity measures at the input and output points of an inexact proximal-gradient step. We first establish separate input and output bounds, but their combination can yield a conservative estimate because their worst-case residual directions may differ. By exploiting the magnitude and orientation of this shared residual, we establish tight joint bounds and derive an exact one-step stationarity-transfer factor that strictly improves the estimate from separate bounds in the short-step regime. We also identify the precise residual-tolerance threshold for finite uniform stationarity transfer. A further distinction emerges over multiple steps: endpoint worst cases can repeat over arbitrarily many iterations, whereas interior worst cases cannot persist across two consecutive steps, yielding strict two-step submultiplicativity. These results also provide principled tolerance-selection rules, descent estimates, and stationarity-complexity guarantees for inexact proximal-gradient methods.

comments
22 pages, 2 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.38310 ↗

Bisimulation metrics offer a principled notion of task-relevant state similarity in reinforcement learning, but existing constructions and methods are largely confined to discounted MDPs, where contraction arguments ensure well-defined fixed points and downstream guarantees. We develop a unified foundation for bisimulation metrics in undiscounted settings, that is total- and average-reward problems, by replacing the standard operator-centric view with a game-centric one: we interpret prior metric operators as Bellman-Shapley operators of zero-sum turn-based games and define metrics as the corresponding game value functions, yielding unique definitions even when $γ=1$. This game-theoretic foundation facilitates transfer of dynamic-programming theory and algorithms. We also use this game-centric perspective to characterize how metric finiteness depends on structural properties of the underlying MDP and motivate certain directed metrics that remain finite in weakly communicating MDPs. We further introduce an abstract framework for modifying the games' action spaces, allowing general transition coupling sets, that recovers many existing metrics and guides new constructions. Finally, we prove that these metrics bound total-reward and, when the optimal gain is state-independent, optimal relative value differences. We also provide error and suboptimality guarantees for aggregation-based planning in total- and average-reward settings.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38313 ↗

We study the minimax complexity of smooth convex stochastic optimization with intermittent communication: $m$ workers run for $N$ rounds, and between consecutive communication rounds each worker makes $K$ sequential stochastic gradient queries. We focus on the interpolation regime, in which all sample losses share a common minimizer, so that the gradient noise vanishes at the solution. Let $L$ be the smoothness of the objective, $H_s\ge L$ the smoothness of the sample losses, and $R$ the distance from the initial point to a minimizer. We consider three oracle models that provide increasing information: an unbiased stochastic gradient oracle $g(x,ξ)$ satisfying $\mathbb{E}_ξ\|g(x,ξ)\|^2 \leq 2H_s\bigl(F(x)-F(x^*)\bigr)$, gradients of the sample losses at fresh samples, and repeated gradient queries to stored samples. Up to logarithmic factors, all our results are described by two rates: \[ R^2\min\left\{L,\;\frac{H_s}{KN},\; \frac{L}{N^2}+\frac{H_s}{mKN}\right\} \qquad\text{and}\qquad R^2\min\left\{L,\; \frac{\min\{L,H_s/K\}}{N^2}+\frac{H_s}{mKN}\right\}, \] Under the weak growth condition, the first rate is the minimax rate, attained by the best of three simple baselines, as in the classical bounded-variance setting. With repeated access to samples, the second rate becomes the minimax rate for general convex objectives. For general convex objectives with fresh sample gradients, the minimax rate lies between the two rates. Our lower bounds apply to arbitrary randomized intermittent-communication algorithms.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38354 ↗

Understanding how local perturbations influence global quantum dynamics is important for analyzing and designing large-scale quantum systems. Existing quantum centrality measures often rely on static correlations or entanglement and do not directly capture perturbation propagation under unitary evolution. We formulate controllability allocation scoring for quantum input-output dynamics governed by the Schrodinger equation. Using the multiobservable quantum-control Gramian, we introduce virtual local Hamiltonian perturbations along a nominal trajectory and decompose the terminal-output response into channel-wise Gramian contributions. A simplex-constrained log-determinant optimization combines these contributions to define a volumetric controllability allocation score (V-CAS), specifying an optimal allocation of virtual input intensities among local Hamiltonian perturbation directions. The score measures their cooperative dynamical influence and depends on the output and trajectory. We characterize the output Gramian's range and minimum-energy properties and derive a drift-independent sufficient condition ensuring score uniqueness for almost every terminal time at which the problem is feasible. For quantum many-body systems, we develop a matrix-product-state and time-evolving-block-decimation implementation that avoids explicitly constructing exponentially large state-transition matrices. We also derive an error bound propagating Trotter and MPS-truncation errors to the discrete output Gramian. Numerical experiments show that the score captures finite-time influence patterns distinct from those identified by static correlation- and entanglement-based measures and can inform target-independent control-channel preselection.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38415 ↗

This paper addresses a stabilization problem: can every controllable and observable LTI system be stabilized by static output feedback? To the best of our knowledge, we provide, for the first time, a solution to this problem. Furthermore, the proposed design achieves prescribed-time convergence to the origin, with the convergence time arbitrarily assigned a priori and independently of the initial condition. Two static output-feedback methods are developed. The first employs multiple artificial output delays with smooth time-varying gains and provides an explicit gain construction for every controllable and observable LTI system, based on a generalized controllability–observability Gramian introduced in this paper. The second combines constant-gain feedback of the current output with time-varying-gain feedback of a single artificially delayed output and also applies to every controllable and observable LTI system. Its simpler structure requires auxiliary parameters whose existence is guaranteed but whose explicit construction is not provided for general MIMO systems; for SISO systems, the constant current-output gain can be readily selected. The multiple-delay design is further extended to known bounded and fast-varying (without any constraints on the delay derivative) measurement delays, yielding fixed-time stabilization under a corresponding rank condition, with an assignable settling-time bound greater than three times the delay bound. For unknown constant measurement delays, fixed-time stabilization is established for systems with nilpotent state matrices. A numerical implementation is also presented. Numerical examples involving nonminimum-phase, flexible-structure, and cart–pole systems illustrate the effectiveness of the proposed methods.

comments
16 pages, 4 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.38417 ↗

Dynamical optimal mass transportation over nonlinear systems is often hindered by the curse of dimensionality and open-loop implementation. We propose an alternative framework that sacrifices exact optimality in favor of stability, robustness, and scalability. We use a stochastic port-Hamiltonian system as a reference model. Under suitable structural assumptions, we show that its density converges asymptotically to a prescribed steady-state distribution. We then shape a deterministic nonlinear system into a compatible port-Hamiltonian form and add a local density-feedback term so that its closed-loop continuity equation matches the Fokker-Planck-Kolmogorov equation of the reference model. The resulting feedback drives a broad class of initial distributions to the target distribution. Because the density term is local at the particle level, the controller admits decentralized implementation and avoids solving a global finite-horizon transport problem online. Nonlinear examples and simulations illustrate the method. For linear systems with Gaussian targets, we derive necessary and sufficient conditions for stabilizing density feedback and give explicit controller constructions.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38465 ↗

Behavior Cloning (BC) of expert controllers for multiscale dynamical systems is challenging: state variables evolving at widely separated timescales induce highly nonlinear couplings that a shared latent space may fail to adequately represent, degrading closed-loop generalization. We propose Structured Representation Learning for Behavior Cloning (SRLBC), an architecture designed to leverage the physical knowledge of multiscale systems in which slow state variables, fast (stiff) state variables, and predictable exogenous inputs evolve at different timescales. On 500 long-horizon roll-outs of a pressurized water reactor (PWR) load-following benchmark -a high-dimensional, stiff industrial system with challenging safety constraints -and across 20 training seeds, separated embeddings systematically outperform shared embedding baselines on cumulative cost, imitation accuracy and constraint satisfaction. The resulting standalone policies approach NMPC closed-loop performance at a computational cost 15 times lower on average. Since standalone policies still leave a few percent of trajectories infeasible, we embed the learned policies in a safety-augmented approximate NMPC framework, in which the optimizer is only called when the predicted input sequence is not certified as safe. This yields controllers still 6.8 times faster than the NMPC controller on average, with a feasibility (i.e., constraint satisfaction) of at least 99.8% for all architectures, SRLBC retaining the lowest closed-loop cost. Under distribution shift, standalone BC policies degrade sharply: SRLBC degrades the least, and once safety-augmented, it retains a feasibility above 98% with the lowest closed-loop cost. Beyond the quantitative results, Jacobian-based sensitivity analysis shows that the resulting controller relies on a sparse and less redundant set of latent features, each attributable to a single group of physical variables, and aligned with the physical timescale decomposition of the system.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38496 ↗

Can a Watershed transform, the classical tool of morphological segmentation, be placed at the end of a deep network and trained through? The Power Watershed (PW) is the limit of the seeded Random Walker (RW) as p grows to infinity with edge weights raised to the power p. At every finite p the RW solves a sparse positive-definite linear system and is exactly differentiable with respect to the edge weights and the unaries through one adjoint solve; its multi-label form costs one right-hand side per label, and its limit is the PW. We study this family as the last layer of a segmentation network, the watershed layer (WS layer). A conditioning study measures how the solve, the gradient and the distance to the limit evolve with p, and the implicit gradient is checked against unrolling. On synthetic data with correct edge costs the WS layer transforms a soft prediction into an exact boundary. On nuclei segmentation (PanNuke), a binary WS layer is level with a thresholded U-Net. With the instances as labels, the WS layer turns the U-Net into an instance segmenter whose number of labels is set per image by the markers rather than by the output layout, and the network is trained through that partition: instance F1 score rises from 0.656 to 0.795 over a U-Net with connected components, level with the same network followed by a tuned marker watershed. At the training temperature the partition is a watershed of the learned costs, and the finite temperature lets the solve hedge, discounting weak markers and sharing contested pixels. The hedging puts the WS layer 0.015–0.020 F1 ahead of the baseline when trained on a tenth of the data, at the price of having to deploy the finite-p solve rather than its exact limit at inference. Code and the full experimental record are released.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38516 ↗

The paper studies convex minimisation problems involving a composition of a coordinatewise nondecreasing convex function with a finite family of nonnegative, locally Lipschitz continuous and convex functions. We establish complete dual optimality conditions and characterise the entire solution set using multipliers and subgradients associated with a given solution. The results are applied to norm optimisation problems involving minimal time functions with different convex dynamics sets and convex target sets. The sum, maximum and p-norms yield minimal time versions of the Fermat–Torricelli, Chebyshev centre and p-Fermat–Torricelli problems, respectively. Examples in finite and infinite dimensional spaces are provided to illustrate the solution set characterisations.

comments
29 pages, 8 figures
fields
Optimization and Control, Functional Analysis
pdf ↗ page arXiv:2610.38553 ↗

We present cuPDQPx, a GPU-accelerated, factorization-free first-order solver for large-scale convex quadratic programming (QP). Building on the restarted reflected Halpern primal-dual framework of cuPDLPx, we introduce an auxiliary-variable splitting that yields explicit updates without linearizing the quadratic objective or solving inner quadratic subproblems. A preconditioned proximal point interpretation yields both sublinear and linear fixed-point residual convergence guarantees. For practical efficiency, cuPDQPx integrates diagonal preconditioning, step-size selection, adaptive restart, and adaptive primal and quadratic weight updates. cuPDQPx is implemented in C and CUDA with optimized sparse matrix-vector products, kernel fusion, and CUDA Graphs. Numerical experiments on the Maros-Mészáros collection, a convex subset of QPLIB, and synthetic large-scale QPs demonstrate that cuPDQPx has strong numerical performance at both $10^{-4}$ and $10^{-8}$ tolerances.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38706 ↗

The empirical success of matrix-aware optimizers, such as Muon (Jordan et al., 2024) and Shampoo (arXiv:1802.09568), highlights the potential of non-Euclidean geometry for deep learning, including large language model (LLM) training. Despite this progress, the theoretical understanding of stochastic optimization in general normed spaces remains limited, particularly in distributed settings. We analyze minibatch stochastic gradient descent (SGD) for smooth nonconvex optimization with respect to an arbitrary norm on a finite-dimensional space. Using the framework of $κ$-regular normed spaces (arXiv:0809.0813), we derive high-probability oracle complexity bounds under a light-tail condition stated directly in the dual norm induced by the update norm. The bounds make the dependence on geometry explicit through the regularity constant $κ$ of the dual space. In the Euclidean case, our bound recovers the standard minibatch SGD rate up to logarithmic factors. For some non-Euclidean geometries and noise models, it is sharper than bounds obtained by converting a Euclidean noise assumption, reducing a linear dimension dependence to a logarithmic one. Building on this framework, we introduce Rennala NSGD, a semi-asynchronous distributed algorithm, and establish wall-clock time complexity guarantees under fixed, heterogeneous worker computation times. In the Euclidean case ($κ=1$), our bound matches the parameter dependence of classical Rennala SGD up to logarithmic factors.

comments
Accepted at NeurIPS 2026. 111 pages, 2 algorithms, 3 tables
fields
Optimization and Control
pdf ↗ page arXiv:2610.38773 ↗

We introduce the Safeguarded Neurally-Accelerated Preconditioning (SNAP) framework for hybridizing nonlinear optimization methods with pre-trained neural operators (NOs). SNAP targets parametric optimization problems arising from variational formulations of nonlinear partial differential equations (PDEs), where many parameter instances require repeated solves. Inspired by multilevel line-search methods, SNAP operates in cycles, combining classical optimization steps with a search direction generated by a pre-trained NO. Since NO-generated search directions carry no a priori descent guarantee, SNAP employs an a posteriori safeguard by accepting only corrections that satisfy prescribed descent and acceptance conditions. We prove global convergence of the SNAP algorithm and show that it preserves the convergence rate of the underlying optimization method independently of the employed NO architecture. Moreover, we also show that when the NO corrections are sufficiently accurate, SNAP converges faster, with the improvement directly related to the NO training error. To demonstrate SNAP's efficiency in practice, we run numerical experiments on a diverse set of nonlinear parametric optimization problems, including parametric minimal surface, Allen–Cahn, and nonlinear Helmholtz problems. The efficiency of SNAP is demonstrated by comparing two NO architectures, Fourier neural operator (FNO) and Transolver, and by using SNAP as a standalone solver and as a nonlinear preconditioner. Our numerical results show a substantial reduction in the number of required iterations, while demonstrating robustness and generalization across a wide range of problem parameters and mesh resolutions.

comments
26 pages
fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2610.38790 ↗

We develop an infeasible-start extension of the Topkis–Veinott feasible-direction method for nonconvex composite optimization. At each main iteration, a strongly convex local model is used to obtain objective descent while limiting increases in constraint violation. A separate feasibility-reduction step is invoked when feasibility improvement is needed. Under a feasibility-reduction condition, we establish the standard first-order rate for reducing the Fritz John residual and constraint violation. We then verify that both proximal-gradient and regularized Gauss–Newton methods applied to minimizing the squared constraint-violation function satisfy the required feasibility-reduction property under a Polyak–Łojasiewicz condition. Numerical experiments compare the reduction methods, including an experimental prox-linear variant, and compare the scalar-regularized and curvature-enhanced subproblem formulations.

comments
30 pages, 1 figure, 3 tables
fields
Optimization and Control
pdf ↗ page arXiv:2610.38842 ↗

An algorithm is proposed, analyzed, and tested for solving nonlinearly constrained continuous optimization problem instances wherein the objective function is defined by an expectation over a random variable argument and the constraints include inequalities (and perhaps equalities) involving functions that may be nonconvex. The algorithm combines a retrospective-approximation strategy for handling the objective and an interior-point approach for handling the constraints. In each iteration of an outer loop, the objective is approximated by an empirical average over a set of realizations of the random variable argument and the resulting sampled problem is solved with an interior-point method that allows inexact search-direction computations for computational flexibility. Termination conditions for the interior-point method are tailored for those needed for convergence guarantees by the outer loop. Over the outer loop, the sample set is updated adaptively in such a manner that convergence guarantees for solving the original optimization problem can be assured. The results of numerical experiments are presented, which show that the proposed algorithm can outperform competing methods that have comparable theoretical guarantees.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38857 ↗

Fair allocation problems on a continuous simplex are often approached through Sperner-type discretizations: agents label mesh vertices according to their preferences and a fully labelled elementary triangle gives a discrete localization of a fair outcome. We develop a continuous alternative for three agents and three alternatives by representing preferences with multiplicatively consistent reciprocal pairwise-comparison matrices. Two independent ratios per agent induce exact linear indifference boundaries and turn envy-free allocation into a finite-dimensional feasibility problem. For the six possible assignments, we introduce an assignment score $Φ$ built from the agents' consistent priority vectors and prove that an incentive solution component is nonempty if and only if its assignment is the unique minimizer of $Φ$, whereas a disincentive solution component is nonempty if and only if its assignment is the unique maximizer. Consequently, the strict solution region is either empty or a unique convex preference region whose closure lies in the interior of the simplex. The weak solution set is never empty and degenerates exactly when $Φ$ has ties. We also compare the exact continuous formulation with Sperner-based discretization, including the boundary convention required in the disincentive model. Under exact consistency, the model uses six independent pairwise thresholds, whereas a regular triangular mesh with resolution $m$ contains $(m+1)(m+2)/2$ vertices. The method therefore exchanges a stronger parametric preference assumption for an exact continuous solution set and a resolution-independent elicitation stage.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38880 ↗

To minimize the sum $f + g + h$ of three convex functions when $f$ is differentiable with a Lipschitz-continuous gradient, we present a proximal algorithm, variable-metric three operator splitting (VMTOS), a generalization of the three operator splitting (TOS) scheme of Davis and Yin. We establish convergence guarantees by controlling changes in the metric. The smallest saddle-point residual among the first $k$ primal-dual iterates is $\tilde{O}(k^{-1/2})$. When $f$ and the convex conjugate $h^*$ are strongly convex and the accepted metrics and their inverses are uniformly bounded, the rate improves to $\tilde{O}(β^k)$ for some $β\in (0,1)$. We develop a practical Barzilai–Borwein update for diagonal metrics that satisfies our bound on metric changes. Under the same strong convexity assumptions, this update guarantees the required uniform metric bounds, yielding R-linear convergence. Numerical experiments on benchmark optimization problems show that VMTOS is competitive with other proximal algorithms.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38935 ↗

Lane-changing (LC) maneuvers are highly challenging vehicle interactions, with substantial implications for traffic safety and efficiency. Developing effective LC strategies for connected and automated vehicles in mixed traffic is complicated by the uncertainty associated with surrounding-vehicle behavior and the computational burden of embedding realistic prediction models within optimization schemes. To capture these complex interactions while retaining tractability, this study proposes a data-driven optimization framework that embeds neural network (NN) surrogates for safety and lateral comfort within a Bézier-curve-based trajectory planner. Specifically, the safety cost during the LC process is quantified via a surrogate composed of an input convex recurrent neural network (ICRNN) encoding the planned trajectory, a fully input convex neural network (FICNN) embedding the LC duration, and a partially input convex neural network (PICNN) decoder fusing them with historical traffic states; separately, another FICNN surrogate approximates the optimal lateral comfort cost as a function of the LC duration. Both surrogates are embedded via linear programming (LP) formulations, avoiding the binary variables required by conventional mixed-integer programming (MIP) approaches for NN-embedded optimization. We further theoretically establish their exactness at optimality and extend the framework to problems with additional analytical objective terms and multiple surrogates. Experiments on a hybrid dataset combining real-world and simulated trajectories demonstrate that the proposed method achieves surrogate accuracy competitive with unconstrained baselines while substantially improving optimization efficiency over conventional MIPs. Closed-loop simulations further show that the proposed planners markedly reduce the weighted planning cost and consistently outperform baseline methods.

fields
Optimization and Control
pdf ↗ page arXiv:2610.38939 ↗

In this chapter, we explore how a team of autonomous agents can flexibly reconfigure the distribution of its members across many spatially embedded tasks using a task allocation strategy grounded in a generalization of the recently proposed Nonlinear Opinion Dynamics model. Motivated by an adaptive maritime survey application, we couple opinion dynamics directly to spatial movement and examine how the emergent macroscopic allocation is shaped by the interplay between environmental geometry, nature of social interactions, and task demands. We illustrate in simulation how social coupling in the model tunes group cohesion, producing macroscopic allocation patterns ranging from maximally dispersed states, to intermediate semi-dispersed states with a smaller number of distinct subgroups, to maximally cohesive consensus states, in distinct and interpretable parameter regimes. Furthermore, we demonstrate with illustrative examples how a team can reconfigure itself in real time under changing task demands. For allocation scenarios with distance-based task preference and matched number of agents and tasks, we relate numerically the final allocation in the group to the Hungarian optimum, illustrating close-to-optimal performance. We illustrate performance of this method under realistic communication constraints in the MOOS-IvP-Multi simulation environment with simulated autonomous underwater vehicles (AUVs). Together, these examples show how a common set of local interaction rules can support a large range of interpretable macroscopic allocation states and flexible transitions between them.

comments
29 pages, 10 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.39018 ↗

In this paper, we study a Tikhonov-regularized second-order primal–dual dynamical system for smooth nonlinear convex–concave saddle-point problems in real Hilbert spaces. The dynamical system incorporates a vanishing damping coefficient $α/t$, a Hessian-driven term, and a critical Tikhonov regularization coefficient $c/t^2$. By constructing suitable Lyapunov functions, we establish strong convergence to the minimum-norm saddle point and fast convergence rates under the same parameter conditions, without imposing any eventual inside/outside-ball condition. Specifically, the primal–dual trajectory converges strongly to the minimum-norm saddle point, while the primal–dual gap and the velocity norm decay at rates $o(t^{-2})$ and $o(t^{-1})$, respectively. Furthermore, we propose an inexact primal–dual algorithm with a computable relative residual criterion and prove strong convergence of the generated sequence to the same minimum-norm saddle point, together with an $o(k^{-2})$ convergence rate for the primal–dual gap. Finally, numerical experiments on nonlinear and bilinear problems of different dimensions illustrate the minimum-norm selection property and compare the performance of the proposed dynamical system and algorithm with related methods.

comments
27 pages, 5 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.39133 ↗

We propose a mixed-order primal–dual dynamical system with implicit Hessian damping and Tikhonov regularization for linearly constrained convex optimization, and derive a corresponding fast primal–dual algorithm. The proposed dynamical system couples a second-order primal equation with a first-order dual equation without requiring twice differentiability of the objective function. An energy analysis establishes $\mathcal{O}(t^{-2})$ convergence rates for the augmented Lagrangian gap, feasibility violation, and objective residual along an extrapolated primal trajectory. For the proposed algorithm, we construct discrete energy estimates and establish the corresponding $\mathcal{O}(k^{-2})$ rates at the extrapolated primal iterates. In particular, in the critical regularization regimes $ε(t)=a/t^2$ and $ε_k=a/k^2$, these accelerated rates hold simultaneously with strong convergence of the primal trajectory and primal iterates to the minimum-norm solution, respectively, under suitable parameter and trajectory conditions. Numerical experiments illustrate the convergence behavior of the proposed dynamical system and the corresponding algorithm.

comments
29 pages, 7 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.39144 ↗

We study how well a single $k$-dimensional subspace can preserve volume from several positive semidefinite matrices at once. Each matrix is compressed to the subspace and scored by the geometric mean of the eigenvalues of that compression; the scores are aggregated by a weighted power mean of order $p \le 1$. For every fixed $k$ and every fixed rational $p$ we determine the optimal approximation factor: it is achieved by a randomized polynomial-time algorithm, and every larger constant is NP-hard. Above a critical power ($p=-k/2$ over the reals and $p=-k$ over the complex numbers) the factor is an explicit product of Gamma functions. At and below the critical power, every positive constant-factor approximation is NP-hard. The factor comes from a concave relaxation over the positive semidefinite matrices of trace one, which agrees with the volume score at every subspace, followed by ordinary Gaussian rounding. For two rank-$k$ matrices the relaxation is exact, giving a closed-form optimum for Martin means of two subspaces.

comments
48 pages; 4 appendices; no figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.39148 ↗

This paper investigates distributed online estimation and prediction for stochastic large regression models with infinitely many unknown parameters. Existing distributed estimation methods are mostly restricted to finite-dimensional parameter spaces, making them inadequate for emerging infinite-dimensional modeling applications. To tackle this problem, this paper proposes a fully distributed online recursive least squares algorithm with dynamically growing model dimension.The algorithm is constructed with an incrementally augmentable recursive structure, where new parameter dimensions can be embedded in the recursion via zero-padded covariance and estimate augmentation without re-initialization.The almost sure convergence of the algorithm is established under a weak cooperative non-persistent excitation condition, without requiring independence or stationarity assumptions on the regressors.This condition integrates spatio-temporal network information and extends existing finite-dimensional results. The paper further derives an almost sure upper bound on the accumulated prediction regret without any excitation conditions. It is proven that the average regret converges to zero almost surely for a broad class of dimension growth sequences, with the optimal finite-dimensional regret bound recovered as a special case. Finally, numerical simulations are conducted to verify the effectiveness of our theoretical findings.

comments
26 pages,4 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.39197 ↗

Binary bilevel programs are challenging to solve due to the lack of compact single-level reformulations. Recent extended network flow-based reformulations have emerged as a promising approach, providing strong dual bounds. However, their increasing size can make them computationally prohibitive. We develop a cutting-plane framework that exploits these networks without requiring an extended-space formulation. We introduce two exact network flow-based reformulations and provide an efficient separation procedure for inequalities that certify the follower's optimality. We further strengthen these inequalities through a tilting procedure that leverages the combinatorial structure of the networks. Computational experiments show that the proposed approach becomes increasingly advantageous as networks grow larger or more numerous. Moreover, incorporating the cuts into state-of-the-art bilevel solvers improves solution times and optimality gaps on BOBILib instances, closing eight more open instances than the baseline solvers. These results demonstrate the effectiveness of using network representations as separation oracles for binary bilevel optimization.

fields
Optimization and Control
pdf ↗ page arXiv:2610.39261 ↗

Engineering design frequently involves redesigning a prior solution to adapt to changes in context, such as material prices or system requirements. Redesign often leverages simulators too complex and/or computationally intensive for traditional numerical solvers, which lack engineering knowledge and context, to ensure global solution quality. Large language models (LLMs) can interpret semantic information, including engineering knowledge about the system and changes in context, to help guide search, and recent studies have shown that incorporating this knowledge into optimization can improve search performance. However, how best to combine LLMs with numerical solvers in redesign remains unclear. We develop and test an integrated LLM-optimization approach for redesign and compare three methods for leveraging LLMs (warm start, variable fixing and ReAct) and four black-box solvers (Bayesian optimization, genetic algorithms, mesh adaptive direct search and random search) on an electric vehicle battery pack cost minimization case study across four types of redesign scenarios. We find that the integrated approach can match feasible design discovery of the numerical-solver baselines with 80% fewer simulator evaluations while tripling the fraction of runs that find near-optimal solutions. We find that the best LLM-solver integration approach and the way the prior solution is leveraged depend on the structure of the design requirement change, and that the benefit of increasing LLM model size grows with the extent to which the LLM controls the search. These results show clear potential for LLMs in redesign tasks for guiding or replacing numerical solvers.

comments
17 pages, 12 figures, 11 tables. Submitted to the ASME Journal of Mechanical Design. Code: https://github.com/Chani-song/WAFER, data: https://huggingface.co/datasets/Chani-Song/wafer-jmd-release-data
fields
Optimization and Control
pdf ↗ page arXiv:2610.39275 ↗

Reinforcement learning with verifiable rewards (RLVR) makes a language model solve more problems on the first try and fewer when given many tries: it raises pass@1 while the base model overtakes it at large sampling budget k. Is this a failure of RL to add reasoning, or a transient that more training removes? We settle the question with a theorem. The reversal is a price, and we compute its exact rate. Modeling RLVR as an exponential tilt of a base policy over strategies shared across prompts, we prove that under exclusive specialization every update that raises pass@1 strictly lowers the success of some prompt; a strictly positive price on prompts (Stiemke duality) is the exact condition, and being merely the best strategy on a prompt is provably not enough. When the loss reaches the hardest prompts, it forces a pass@k crossover, and the number of crossings is at most the sign variation of the shift in per-prompt success, a totally positive bound that is tight and that recovers the known single-crossover result as its order-preserving case. The crossover is not a bug to patch: a constrained update traces the exact pass@1 versus pass@k frontier, and removing the crossover entirely costs the entire pass@1 gain. The same tilt identity yields entropy collapse and the entropy-performance law with an identifiable exponent, unifying two literatures under one mechanism. Reinforcement cannot widen the reasoning frontier; it can only move along it, at a price we make measurable by a diagnostic that reads the bound, the order-preserving test, and the price from any evaluation log. There is no free lunch, only a price.

comments
19 pages, 4 figures. Code and verification package (34/34 automated checks): https://github.com/yliusci/no-free-lunch-rlvr
fields
Optimization and Control
pdf ↗ page arXiv:2610.39295 ↗

Standard two settlement markets compute the total profits of their participants as a sum of day-ahead (DA) profits and incremental real-time (RT) profits. This procedure was originally designed for conventional generators, which can always deliver their day-ahead (DA) awarded schedule in real time because their capacity is invariant across market clearings. Energy storage resources, by contrast, are state-of-charge (SOC) limited. Therefore, their ability to honor a DA award in real time depends on the SOC available at the moment of dispatch, a quantity that can differ materially from what was assumed at the DA stage. According to the current rules in CAISO, whenever the storage state of charge (SOC) is not sufficient to support the day-ahead award the RT market may impose an instruction to "buy back" or "sell back" that may lead to a monetary loss that is covered by the system operator via uplifts in the bid cost recovery (BCR) scheme. These circumstances have resulted in storage resources capturing a disproportionate share of uplift payments—totaling approximately $75.2 million in CAISO between 2022 and 2025. This paper formalizes the asymmetry between SOC-unlimited (generator) and SOC-limited (storage) resources and proposes an alternative settlement rule in which the total storage profit is computed as the maximum between real-time only compensation and the existing day ahead plus incremental real-time compensation. Through our analysis and a case study based on a realistic version of the California system, we demonstrate that while the proposed rule does not guarantee non-negative profits in all cases, it can reduce - and in favorable conditions eliminate - the negative profit outcomes that trigger make-whole BCR payments.

fields
Optimization and Control
pdf ↗ page arXiv:2610.39313 ↗

This paper studies differential properties of objective functions for discrete-time discounted Markov decision processes (MDPs) with finite state and action sets, when differentiation is considered with respect to the discount factor. Given a fixed discount factor for an MDP, we estimate the norms and seminorms of the objective functions, their derivatives, and the value function at a different discount factor. We then use these estimates to prove that objective functions, their derivatives, and value functions are Lipschitz continuous in discount factors. As a result, if an MDP is solved with a fixed discount factor, then we can estimate the value function at a different discount factor without solving it again.\\ %Following these estimations, we also reveal the relations between the seminorms of objective functions, their behavior when the discount factor approaches $1,$ and the discount factors at which the set of optimal policies changes.

fields
Optimization and Control
pdf ↗ page arXiv:2610.39326 ↗

We propose a simple and symmetric method for policy optimization in discounted zero-sum Markov games. The method, termed symmetric policy iteration, operates by evaluating the joint policy and solving the corresponding regularized matrix game at each iteration. By employing a diminishing sequence of regularization strengths, we establish the global linear convergence of the proposed method to the optimal value function and the saddle point. In particular, the method does not require solving any standalone Markov decision process throughout policy optimization, and is symmetric in the sense that it stays invariant regardless of whether we are solving the min-max or the max-min version of the game. To the best of our knowledge, this appears to be the first simple and symmetric policy-based method attaining global convergence for discounted zero-sum Markov games.

fields
Optimization and Control
pdf ↗ page arXiv:2610.39328 ↗

This paper considers coordinating a heterogeneous team of unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs) traversing a domain containing an unknown number of potentially hazardous targets. The UAVs provide aerial sensing using onboard optical cameras, adapting their trajectories to ground routes and target information. We formulate the aerial search problem using ergodic control, which distributes sensing effort according to a spatial information density to balance exploration and target localization. The formulation incorporates dynamic camera field-of-view footprints and pose-dependent probabilistic detection models. Angles-only measurements are processed through Bayesian inference and marginalization over data-association hypotheses to obtain a Poisson multi-Bernoulli (PMB) approximation of the target posterior, representing both detected and undetected targets. This belief directs aerial sensing toward unexplored regions along the ground routes and viewpoints that improve target localization. Ground planning combines chance-constrained target avoidance, enforced through confidence sets, with a void-probability objective that favors routes unlikely to contain threats. We solve each team's optimization problem in a fully decentralized manner using a nested SCvx*--C-ADMM scheme, with outer sequential convex programming iterations and inner distributed consensus optimization, accounting for nonlinearities, nonseparable objectives, and continuous-time inter-agent separation constraints. A closed-loop scheme updates both fleets' trajectories as information becomes available and permits ground motion when the remaining route risk falls below a prescribed threshold. Numerical case studies examine sensing geometry and target uncertainty, compare decentralized and centralized solvers, and demonstrate full closed-loop collaboration between multiple UAVs and UGVs.

fields
Optimization and Control
pdf ↗ page arXiv:2610.39379 ↗

In this paper, we study Geoffrion properly efficient solutions of affinely adjustable robust two-stage convex polynomial multiobjective optimization problems with spectrahedral uncertainty. For convex polynomial data, we establish sufficient optimality conditions and necessary conditions under a Slater condition. Under SOS-convexity, we obtain an exact SOS characterization of proper efficiency. Using strictly positive weighted-sum scalarization, we develop a finite-dimensional moment-SDP formulation and establish its optimal-value exactness under the strict feasibility condition. We further establish the recovery results connecting Geoffrion properly efficient solutions with moment-SDP optimal solutions.

fields
Optimization and Control
pdf ↗ page arXiv:2610.39383 ↗

Many applications of multi-objective reinforcement learning (MORL) require policies that balance conflicting objectives while satisfying safety constraints. We study safe MORL with zero constraint violation throughout learning, covering both cumulative and stepwise constraints. A key challenge is to explore sufficiently under unknown dynamics and constraint costs without violating the constraints. For a given preference over objectives, we develop an algorithm to learn a safe Pareto optimal policy by combining optimistic reward estimates with pessimistic cost bounds. With high probability, every policy executed over $T$ episodes incurs zero constraint violation. The algorithm returns a safe Markov policy induced by the averaged occupancy measure and achieves an $\widetilde{O}(1/\sqrt{T})$ suboptimality gap under smooth Tchebycheff scalarization. We further develop a preference-free algorithm that first explores safely without a prespecified preference and then computes a safe policy for any given preference without further interaction. Over $T$ exploration episodes and $K$ planning iterations, it retains the same safety guarantee and achieves an $\widetilde{O}(1/\sqrt{T}+1/\sqrt{K})$ suboptimality gap. Both algorithms require knowledge of a policy that strictly satisfies the constraints and its costs. We then relax these requirements, incurring at most constant cumulative violation. To our knowledge, we provide the first sample-efficient MORL algorithms that guarantee safety for every executed policy.

fields
Optimization and Control
pdf ↗ page arXiv:2610.39409 ↗

Training language models whose parameters and optimizer state exceed a single node's memory requires sharding these tensors across devices. Under tensor parallelism (TP) or fully sharded data parallelism (FSDP), matrix-aware optimizers such as Muon introduce communication to perform global matrix operations across shards. We propose Dobb (Distributed Optimizer with Block-diagonal Eigenbases), a matrix-aware optimizer designed to compute updates locally within parameter shards. Dobb approximates the input-activation second moment with diagonal blocks and tracks a complete basis within each block. It projects momentum into these bases, applies sign normalization to the coefficients, and reconstructs the update. When each block lies within one shard under TP or FSDP, Dobb applies its matrix update locally, requiring no communication beyond data-parallel synchronization of the activation second moments. We benchmark Dobb against Dion, a distributed matrix-aware optimizer designed to retain the benefits of orthonormalized updates while reducing communication. On GPT-2 XL (1.56B parameters), Dobb with 16 blocks reaches a validation loss of 2.476, compared with 2.511 for Dion at rank fraction 1/16. Under FSDP on 32 H100 GPUs, Dobb reduces the amortized optimizer-call time from 124.1 ms for Dion to 9.2 ms.

comments
33 pages, 3 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.39412 ↗

Coupled convex optimisation equilibria, bilinear saddle and potential systems, and nonlinear electronic device laws lead naturally to inclusions of the form $0\in Hx+A(Bx)-b$, where $A$ and $B$ are maximal monotone but their composition need not be monotone. We introduce a new class of splitting algorithms that solve such inclusions. Introducing the intermediate graph variable $y\in Bx$ exposes a directed two-row system. A one-parameter family of kernels produces a lower-triangular warped-resolvent iteration evaluated with one application of $H$ and the ordinary resolvents $J_{αA}$ and $J_{βB}$. Appropriate specializations of the problem data and algorithmic parameters recover forward–backward, inertial, primal–dual, and Douglas–Rachford constructions, while setting $H=b=0$ generates three novel algorithms for the pure composition $0\in A(Bx)$. Convergence of the coupled method is certified by an explicit nonnegative two-block gain matrix. Its Schur condition yields contraction in particular weighted norms, global linear convergence, and residual error estimates. For the general problem class, our convergence condition is shown to be sharp for an explicitly constructed linear family. When the problem is specialized to a pure composition, we prove convergence under the weaker assumption that only one operator is strongly monotone. This weaker regime is illustrated on a nonlinear circuit problem. We further illustrate our methods by solving inference problems for cascaded equilibrium neural networks.

comments
32 pages, 4 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.39480 ↗

Wind Farm Layout Optimization places turbines to maximize the expected energy under a wind rose, each turbine lowering the wind downwind. In the EndoWake model the wind field is a variable, propagated by linear inequalities, and layouts are certified by branch-and-check. On a ladder of grids it certifies the $10\times10$ grid and leaves the larger grids open after one hour. We tighten the relaxation by a convexification computed rather than derived: every pattern of turbines inside a small tile of the grid is enumerated once with its power and enters the master as a column. The device is valid because the wind field is antitone, and exact, for the cubic power curve, with a Benders cut at integer layouts. Reduced-cost fixing and propagation between overlapping tiles shrink the master before the tree search, and the tree repeats the fixing at every improving incumbent. The incumbent comes from a tile heuristic or an LP dive. On the same computer as the branch-and-check, the $12\times12$ and $14\times14$ grids close in 48 and 395 seconds. The $16\times16$ grid is certified on five seeds from random starts, one job per seed, the heuristic on a GPU, in 1413 seconds under the uniform rose and 6484 seconds under a non-uniform one. Times are medians. A pre-specified test set of 36 unseen instances with forbidden cells confirms the advantage in the axial setting. Certified means closed at the solver's gap of $10^{-4}$: the optimum lies within it plus a residual of at most 0.00042%.

comments
25 pages, 1 figure, 8 tables. Submitted to international journal. Replication package: https://doi.org/10.5281/zenodo.23636074
fields
Optimization and Control
pdf ↗ page arXiv:2610.39503 ↗

A central topic in online and stochastic optimization is to design algorithms that do not require tuning of hyperparameters. Successful strategies in online learning include AdaGrad-style learning rates, Conic Blackwell algorithms, and parameter-free algorithms. However, these classes require different, often difficult, analyses. We develop a unifying family of Online Convex Optimization (OCO) algorithms that require no user-tuned learning rate on convex domains that may be unbounded. The construction lifts the domain to a cone by adding one scalar coordinate, an idea going back to Blackwell (1954). The lifted subgradients are orthogonal to the corresponding lifted decisions, leaving the comparator scale free to optimize in the regret analysis. Applying Follow-the-Regularized-Leader (FTRL) and Online Mirror Descent (OMD) on the cone recovers Conic Blackwell Algorithm (CBA) and Conic Blackwell Algorithm Plus (CBA$^+$) on bounded domains in Hilbert spaces and extends them to finite-dimensional normed spaces with a strongly convex squared norm. For arbitrary nonempty closed convex domains in these spaces, a known gradient bound yields parameter-free regret guarantees. Surprisingly, on an unconstrained Hilbert space, the construction recovers the Krichevsky–Trofimov (KT) coin-betting algorithm exactly. We also give a parameter-free algorithm for unconstrained domains that requires no gradient bound.

fields
Optimization and Control
pdf ↗ page arXiv:2610.39531 ↗

The optimal power flow (OPF) problem is a classical non-convex optimization problem with nonlinear constraints and multiple potential solutions. Existing methods often fail to find the global optimal solution, motivating the development of a method to identify multiple local solutions. This paper applies the optimal control principle to solve the OPF problem, aiming to systematically explore all feasible solutions within a single run. We first handle the constraints in the OPF problem using the penalty method and the Lagrange multiplier, and then reformulate it as an optimal control problem. The connection between the two problems is established by the maximum principle. Moreover, a numerical algorithm is proposed to solve this optimal control problem. The state trajectory of the system can rapidly and stably converge to the solution of the OPF problem. By designing the initial control sequence, the proposed method can successfully find multiple solutions and escape local solutions. Finally, simulations were conducted on several representative test systems to validate the potential of the proposed method in identifying multiple solutions for non-convex problems.

fields
Optimization and Control
pdf ↗ page arXiv:2610.39613 ↗

Electric vehicles produce no tailpipe emissions, but charging them produces emissions that depend on the time-varying generation mix of the electricity consumed. We study an Electric Vehicle Routing Problem with a carbon-aware objective that accounts for charging-related emissions alongside conventional routing costs. The problem determines routing, charging, and waiting decisions, allowing charging demand to be shifted toward periods with lower grid carbon intensity. Because these decisions depend on forecasts of future carbon intensity, we propose a decision-focused learning approach so that the training of the model employed for predicting the carbon intensity of the grid over time is solver-aware. In particular, we train a linear predictor using approximate SPO+ directions and employ a time-limited Large Neighborhood Search followed by exact postprocessing as the underlying solver. Experiments on realistic Germany-based instances show that explicitly considering charging-related emissions reduces realized emissions by 28.76% on average relative to carbon-blind optimization, although at the expense of higher non-carbon operating cost. Moreover, decision-focused training reduces realized total cost by 2.30% on average relative to conventional prediction-focused learning and performs better on 75.5% of the test instances, despite substantially lower pointwise predictive accuracy. Finally, we show that its average advantage remains positive across varied solver configurations and carbon-cost weights.

fields
Optimization and Control
pdf ↗ page arXiv:2610.39645 ↗

Long-haul truck electrification requires rapid energy replenishment near freight demand, although dispersed hubs may lack sufficient grid capacity. We study a "Swap-Locally, Charge-Centrally" architecture embedded in a relay freight network: swapping remains close to freight flows, charging can be shifted to grid-suitable hubs, and co-location is retained where economical. A multi-period, two-stage stochastic location-inventory-fleet model coordinates station deployment, replenishment assignments and grid-bounded charging capacity with scenario-dependent battery stocks, batch sizes and incremental fleet requirements. Corridor electrification competes with temporary diesel operation. Building on submodularity-based constraint generation for location-inventory systems, we give an alternative scalar partial-minimization proof that the battery value function is submodular, show that the fleet recourse is affine in the binary swap-station decisions, and develop a Lovász-cut Benders decomposition with hub-period block cuts and a convex battery oracle with analytic gradients and memoization. On a seven-state southeastern U.S. freight network, the method reaches gaps below 0.01% on all five instances, the largest in about four minutes, whereas a strengthened extensive formulation reaches this tolerance only on the two smallest instances within three hours. Stochastic planning avoids the capacity shortfalls of a mean-value plan, and joint planning avoids the battery and fleet costs that sequential siting shifts downstream. The optimized network uses remote charging selectively, keeps most replenishment local, and expands geographic coverage before intensifying capacity within its committed deployment plan.

fields
Optimization and Control
pdf ↗ page arXiv:2610.39652 ↗

AdaGrad-style methods can simultaneously adapt to both the order and constants of smoothness in centralized optimization. However, existing extensions to federated optimization with heterogeneous client objectives and multiple local steps require the smoothness order to be specified in advance. We address this limitation with AdaFed, a federated method that adapts across several regimes under a single choice of parameters. In the deterministic setting, AdaFed achieves an $O(1/T)$ convergence rate for both smooth nonconvex and smooth convex objectives, and an $O(1/\sqrt{T})$ rate for Lipschitz nonsmooth convex objectives up to logarithmic factors. Under a light-tailed stochastic-gradient noise assumption, these guarantees extend to the stochastic setting with additional logarithmic factors and noise-dependent terms. Experiments across the three problem classes further support our theoretical findings.

fields
Optimization and Control
pdf ↗ page arXiv:2610.39716 ↗

Modern machine learning models are often overparameterized, i.e., have more parameters than training data. This typically implies that the loss function admits multiple minimizers so that training methods (and their hyperparameter choices) have significant influence on the computed solution. We study this so-called implicit bias phenomenon in the context of training deep linear diagonal networks. Previous work has shown that the gradient flow for learning such networks converges to (almost) sparse solutions when initialized small. For an arbitrary number of layers, we extend this analysis to the practically more realistic (stochastic) gradient descent iterations. Our approach identifies (stochastic) gradient descent as a perturbed (stochastic) mirror gradient descent. This allows us to establish convergence and characterize the limiting solution, relating it to weighted $\ell_1$-minimization. Moreover, we provide sufficient conditions on the step sizes and quantify the influence of the step sizes on the implicit bias.

comments
38 pages, 14 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.39717 ↗

This paper addresses the stability analysis of a class of linear infinite-dimensional port-Hamiltonian systems formulated within the variational framework. We derive verifiable conditions for the equivalence of the Hamiltonian-induced energy norm and the natural state-space norm, as well as for the generation of a contraction semigroup by the associated system operator. The semigroup generation result is obtained by establishing dissipativity and verifying the required range condition. The proposed conditions simplify the functional-analytic stability analysis of this class of systems in a manner similar to established results for the Stokes-Dirac setting.

fields
Optimization and Control
pdf ↗ page arXiv:2610.39724 ↗

The standard quadratic optimization problem consists of minimizing a quadratic form over the standard simplex. It has highly relevant applications ranging from portfolio optimization to machine learning. However, if the quadratic form is neither convex nor concave, this problem is NP-hard. We study a distributionally robust chance-constrained variant whose ambiguity set is a Wasserstein ball around the sampled distribution and make four contributions. First, although the problem is nonconvex in the decision variable, we exploit its linear dependence on the uncertain matrix to reduce the problem to a mixed-integer quadratic optimization problem. Second, we show that a judicious choice of matrix norm—the entrywise maximum norm—makes this reformulation both exact and tractable, and we describe the induced worst-case distribution. Third, our formulation is, by construction, the minimization of the worst-case Value-at-Risk of the random quadratic form; this unifies it with existing frameworks for uncertain standard quadratic optimization problems, in particular under chance constraints, and we identify natural settings in which it collapses to a single deterministic instance. Finally, we report numerical experiments on positive-definite and indefinite instances which quantify how the model parameters drive the optimal value and solution time, and expose the computational cost of indefiniteness.

comments
29 pages
fields
Optimization and Control
pdf ↗ page arXiv:2610.39823 ↗

We develop an algorithm for computing the convex envelope of the bilinear function $f(x,y)=xy$ over possibly nonconvex polygonal domains. Building on existing methods for convex polytopes, our approach uses the Karush-Kuhn-Tucker conditions and an analysis of the contact points between affine underestimators and the graph of $f$. Nonconvex domains admit additional contact configurations that prevent several simplifications available in the convex case. We resolve these configurations explicitly and show that the envelope admits a finite polyhedral subdivision with affine, quadratic, or rational expressions on its cells. For orthogonal polygons, whose edges are horizontal or vertical, we establish substantial reductions in the generator sets needed to compute the envelope. We also present methods for constructing such domains as relaxations of two-dimensional projections of nonlinear optimization problems. An illustrative example quantifies the loss in relaxation strength caused by convexifying the domain before computing the envelope. Computational experiments on MINLPLib instances show that cuts derived from orthogonal polygons strengthen root relaxations and reduce branch-and-bound nodes in aggregate.

comments
32 pages, 13 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.39826 ↗

In this paper, we propose two iterative methods, the modified Picard method (MPM) and the generalized Traub method (GTM), to solve a new generalized absolute value equation (NGAVE). We establish their convergence under appropriate assumptions. Additionally, numerical examples demonstrate the effectiveness and applicability of the developed algorithms.

comments
14 Pages
fields
Optimization and Control
pdf ↗ page arXiv:2610.39933 ↗

Privacy accounting bounds the cumulative privacy cost of Differentially Private Stochastic Gradient Descent but does not determine how to allocate a fixed budget across iterations. We formulate the complete Gaussian noise-variance schedule as an open-loop control under a composed zero-Concentrated Differential Privacy constraint, explicitly accounting for schedule selection. For expected quadratic terminal tracking, we prove that every local minimizer exhausts the certified budget, yielding an exact-budget simplex formulation. We introduce Privacy-Budget Adjoint Mirror Descent (PB-AMD), combining pathwise adjoint gradients with entropic updates that preserve positivity, charge floors, and the prescribed budget. Under regularity and coercivity assumptions, we establish existence and budget stability of optimal schedules, design-to-training utility stability, and deterministic, stochastic, and sample-average stationarity guarantees. A linear-quadratic reduction yields an explicit square-root allocation law. Experiments demonstrate tracking improvements over several allocation rules and predictive improvements over uniform allocation in a learning-rate restart setting, where learning-rate allocation performs similarly. Comparisons at a common stationarity tolerance show lower schedule-optimization times than projected gradient descent on the tested problems. The framework connects certified privacy accounting with optimization through nonlinear training dynamics.

fields
Optimization and Control
pdf ↗ page arXiv:2610.39954 ↗

We introduce a new class of problems, termed multi-split multiple-sets implicit convex feasibility problems (MSMS-ICFPs), define a proximity function for it and analyze its properties under certain assumptions on the involved general point-to-set operators. Additionally, we discuss its properties for a special class of point-to-set operators. For these kinds of point-to-set operators, we deploy a new iterative algorithm to solve the associated MSMS-ICFP and show that any sequence generated by it converges in norm to a solution of the MSMS-ICFP whenever a solution exists (i.e., in the consistent case). We also define a generalized proximity function for the MSMS-ICFP using the Bregman distance. Based on this function, we present a generalized simultaneous projection gradient algorithm for the split feasibility problem with multiple output sets, by examining various related results. We conclude by discussing several further special cases of the MSMS-ICFP.

fields
Optimization and Control
pdf ↗ page arXiv:2610.39991 ↗

Military installation energy readiness depends on having sufficient resources to sustain mission-critical loads throughout a prolonged utility outage. This paper develops a method to help operators manage energy resources during normal grid-connected operation while preserving islanded readiness. A robust viability kernel identifies combinations of battery energy, fuel, and load-shifting capability sufficient to sustain critical load under uncertain demand and photovoltaic generation. A probability bound translates stochastic generator start failures and recovery into a deterministic generator count selected to meet a specified availability requirement at islanding. Case studies for a fourteen-day islanding requirement at 0.999 islanding-entry availability show that advance warning of an outage can be used to prepare resources to meet a higher readiness requirement before islanding begins. The case studies further demonstrate that economic-only operation and the evaluated fixed battery reserve policy can fail to sustain critical load for the required duration, whereas enforcing the resource-dependent requirement preserves readiness at a modest increase in modeled grid-connected operating cost. These results demonstrate how active resource management can preserve long-duration energy readiness. The framework also helps commanders understand how readiness changes with operating conditions, even when the available resources remain the same.

comments
32 pages, 5 figures, 3 tables, submitted to Military Operations Research
fields
Optimization and Control
pdf ↗ page arXiv:2610.40078 ↗

For a finite empirical target, the exact reverse diffusion is driven toward training points by an attraction whose strength diverges as the forward noising time decreases to zero. We study whether this terminal localization persists under progressively measurable score errors that may themselves be singular. For reverse Ornstein–Uhlenbeck diffusions, from an arbitrary initial law and under a deterministic error envelope \(E\) imposed along the perturbed trajectory satisfying \(t\int_t^T E(σ)/σ\,dσ\to0\), we prove almost-sure convergence to a training point, together with explicit uniform bounds on a terminal window with probability arbitrarily close to one. Every training point has positive terminal probability, although the terminal selection probabilities need not match the empirical weights. The results cover power-law errors \(E(t)=O(t^{-γ})\), \(0<γ<1\), including infinite squared-error energy. For suitable errors in this range, the exact and perturbed full path laws can be mutually singular while their terminal laws share the same finite support. For suitable switched perturbations at the critical scale \(t^{-1}\), arbitrarily small positive amplitudes can produce a nonzero terminal displacement with arbitrarily high probability. These results quantify stochastic robustness of empirical terminal attraction without requiring absolute continuity of the full path laws.

fields
Optimization and Control, Probability
pdf ↗ page arXiv:2610.40374 ↗

We consider the problem of finite-sample identification of an unknown LTI system from a finite hypothesis class. In contrast to existing results that assume the hypothesis class contains the true system, we consider the misspecified setting, where the true system does not belong to the hypothesis class. We first characterize the resulting estimation target and its dependence on the data-generation scheme. We then establish a finite-sample lower bound on the failure probability that any identification algorithm must incur. Finally, we analyze the robustness of an existing exponential weighting-based identification algorithm to the misspecification and derive a finite-sample upper bound on its failure probability. Our results illustrate when using a misspecified finite hypothesis class can provide an advantage over identification without prior knowledge of the candidate systems.

fields
Optimization and Control
pdf ↗ page arXiv:2610.40387 ↗

Automated mechanism design has enabled the learning of complex auction mechanisms using neural networks. However, designing non-truthful auctions remains challenging because bidders' equilibrium strategies depend on the auction mechanism and thus evolve as the mechanism is optimized. In this work, we formulate auction design as a Stackelberg game with multiple strategic followers and develop a fully first-order algorithm for revenue optimization in non-truthful auctions. We establish non-asymptotic guarantees for hypergradient approximation and show that, under standard smoothness and strong-monotonicity assumptions, our method reaches an $O(ε)$-stationary point using $\tilde{\mathcal{O}}(ε^{-2})$ first-order oracle calls. Experiments on symmetric and asymmetric single-item auctions, as well as multi-item auctions, show that our method converges faster than second- and zeroth-order baselines and scales better as the number of bidders increases. Our method also discovers auctions that achieve revenue close to truthful baselines. These results provide a scalable framework for automated mechanism design beyond truthful auctions.

fields
Optimization and Control
pdf ↗ page arXiv:2610.40403 ↗

We study a constrained sequential decision problem for detecting regions of interest from noisy online measurements collected by a team of energy-constrained mobile sensors. The sensor motion is restricted to a precomputed set of feasible paths that satisfy mobility constraints, limited available energy by requiring return to charging stations, and avoidance of known obstacles. We cast the resulting active path selection as a multi-armed bandit problem and propose an iterative search algorithm that adaptively assigns paths using confidence bounds computed from the collected data. We also propose a graph-based method to construct low-cardinality path covers under the team's constraints. We establish finite-time and anytime probabilistic correctness guarantees for the proposed algorithm, derive non-asymptotic upper bounds on the times required to detect all regions of interest and to label all nodes, and show that these bounds match algorithm-independent lower bounds up to constant factors for a broad class of problem instances. Using numerical simulations, we illustrate the behavior of the proposed approach and the effect of path redundancy and team size on search performance.

comments
24 pages, 5 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.40431 ↗

This paper presents a numerical investigation of soft-to-hard terminal constraint convergence for optimal control problems governed by a second-order ordinary differential equation and the one-dimensional heat equation. The study complements the analytical convergence theory through comparisons with exact solutions and independently computed numerical approximations. For the heat equation, a fully discrete Crank–Nicolson finite-difference formulation is validated against exact modal solutions, exhibiting approximately second-order convergence in the terminal-state and midpoint-sampled control errors under simultaneous space-time mesh refinement. Numerical experiments demonstrate the predicted first-order penalty convergence for benchmark problems and investigate the admissibility threshold governing finite-energy exact terminal controllability. Additional modal experiments examine the dependence of terminal-error convergence rates on spectral regularity, illustrating intermediate rates consistent with the theoretical estimates and asymptotic predictions. The results provide computational evidence supporting the soft-to-hard convergence framework and clarify the roles of discretization, target admissibility, and spectral regularity.

comments
26 pages, 5 figures, 3 tables
fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2610.40461 ↗

Ground-state search in two-dimensional Ising spin glasses on large toroidal lattices remains challenging for local-update heuristics because rugged energy barriers impede relaxation across metastable states. Equivalent to zero-field toroidal Max-Cut problems, these spin-glass instances also serve as standard benchmarks for optimization heuristics. Many Monte Carlo approaches combine single-spin flips or cluster moves with temperature ladders or annealing schedules, yet even with tuned parameters, rarely achieve rapid, reliable ground-state convergence at scale. Here, we address the need for faster ground-state search through cooperation between replicas. We introduce ranked greedy cluster exchange (RGCX) and combine it with fixed-temperature Metropolis sweeps to form single-temperature RGCX. Replicas are ranked by cut to determine the pair-processing order. Each pair deterministically exchanges every disagreement cluster that raises the better replica's cut, retaining the complement and conserving the pair's summed cut. On the 20,000-spin Gset instance G81, the estimated runtime to reach the certified optimum with 99% success probability (TTS99) was 12.1 s on an 8-core desktop computer. With the same population size, exchange interval and temperature, the method reached the best known cuts on all 17 toroidal Gset graphs, including 9 certified optima. These findings advance ground-state search on large two-dimensional tori by establishing single-temperature RGCX as an efficient population-based method that combines ranked greedy cluster exchange with fixed-temperature Metropolis dynamics.

comments
14 pages including appendices, 4 figures, 3 tables
fields
Optimization and Control
pdf ↗ page arXiv:2610.40515 ↗

This paper develops a constrained linear-quadratic (LQ) optimal control framework within the behavioral approach. Unlike classical formulations that rely on state-input representations, our method treats both the system dynamics and the constraints as trajectory-level objects. The system is modeled through a kernel representation, while inequality constraints are captured using behavioral inequalities defined over infinite-dimensional convex cones. Using quadratic differential forms (QDFs) to encode performance indices, we formulate the constrained LQ problem as a convex variational optimization over trajectories. By employing Gateaux differentials, we derive the stationarity and complementarity conditions and show that they admit a representation as an augmented behavioral system whose unique decomposition into autonomous and controllable sub-behaviors yields a complete parameterization of all optimal constrained trajectories. The resulting conditions constitute a behavioral analogue of the Karush-Kuhn-Tucker (KKT) framework. A numerical example illustrates the effect of inequality constraints on the optimal behavior. The framework provides a general, trajectory-level representation for constrained optimal control and opens avenues for closed-loop and data-driven extensions.

comments
Accepted for publication at IEEE Indian Control Conference 2027
fields
Optimization and Control
pdf ↗ page arXiv:2610.40542 ↗

Retailers can learn customer preferences by experimenting with different assortments. However, the cost of each experiment and the operational burden of repeatedly changing product offerings can make extensive experimentation impractical. We study how much a retailer can improve its final assortment decision using customer observations from one (or a very small number of) fixed experimental assortments. We consider the multinomial logit model, where product revenues are known but customer preferences are unknown. In this setting, we jointly design the experimental assortment and the rule for selecting a final assortment from observed customer choices to minimize worst-case regret: the expected revenue loss of the final assortment relative to an optimal assortment under the true preferences, maximized over possible customer preferences. We first characterize exactly the minimax regret and an optimal assortment when no experimentation is possible. We then show, surprisingly, that offering a single experimental assortment to just one customer can already substantially reduce regret, depending on how the products' revenues compare. We derive the exact minimax regret and an optimal experimental policy in this setting. When a single fixed experimental assortment is offered to many customers, we give a geometric characterization of the limiting minimax regret and construct an asymptotically optimal policy. Depending on product revenues, this single experiment can yield no improvement over no experimentation or nearly complete regret reduction. Finally, we extend our analysis to multiple experimental assortments chosen in advance, characterizing the limiting minimax regret, constructing asymptotically optimal policies, and identifying which collections of assortments allow worst-case regret to vanish as the number of customer observations grows.

fields
Optimization and Control
pdf ↗ page arXiv:2610.40557 ↗

We study how curvature estimated from gradient differences can accelerate proximal-extragradient quasi-Newton methods. Existing global guarantees for QNPE, A-QNPE, and OL-OQN learn Hessian approximations online and incur dimension dependence through regret bounds. We introduce certified curvature reuse: one finite-difference probe per iteration refreshes a group of Hessian columns, while a path-length certificate controls the error of stale columns and determines the step. Each iteration uses at most three gradient queries and one regularized linear solve (or trust-region step), without a gradient line search or an inner oracle-querying loop. In the convex and strongly convex settings, bisection on stored scalar quantities selects a near-maximal certified stepsize; in the nonconvex setting, a uniform certificate gives an explicit learning rate. With other problem parameters fixed, the convex method attains $O(\min\{k^{-2},dk^{-3}\})$ in a single run, with no logarithmic factor or additive dimension term, matching accelerated gradient descent (AGD) for $k\lesssim d$ and improving on A-QNPE thereafter. In the strongly convex setting with condition number $κ$, a single run matches AGD's $(1-Θ(κ^{-1/2}))^k$ rate for $k\lesssim d\logκ$ and achieves a superlinear upper envelope, eventually scaling as $(1+k^2/B^2)^{-k}$ with $B=\tilde O(dκ)$, improving on QNPE. In the nonconvex setting, the method finds an $\varepsilon$-stationary point in $O(\min\{d^{1/3}\varepsilon^{-3/2},\varepsilon^{-7/4}\})$ gradient queries, improving on OL-OQN's $O(d^{1/4}\varepsilon^{-13/8})$. For sparse Hessians, $d$ is replaced by an effective dimension $χ\le d$. We also compare our bounds with lazy-Hessian, double-loop, and cutting-plane methods.

comments
Full version, 5 figures. Includes all proofs in the appendix
fields
Optimization and Control
pdf ↗ page arXiv:2610.40608 ↗

Probability67

We prove various invariance properties for half-space geometric and exponential last passage percolation and the half-space log-gamma polymer, analogous to the full-space invariances proved by Dauvergne. We use the RSK and geometric RSK correspondences to establish a conditional distributional identity between the half-space models and the corresponding full-space models, which allows us to directly transfer the invariance results in the full space to the half space.

comments
44 pages, 5 figures
fields
Probability, Combinatorics
pdf ↗ page arXiv:2610.37694 ↗

We study the generations at which the distinguished spine of a critical branching random walk occupies the spatial minimum. Under finite positive offspring variance and any nonconstant law of independent real edge increments, their number up to generation $N$ is $(\log N)^{1+o(1)}$ almost surely and has order $\log N$ in probability, with ties included. The same conclusions hold for the unique-minimum event. No spatial moment assumption is needed. The proof combines counting estimates from the spine decomposition with uniform control of extremal multiplicity in an ordinary surviving tree. For a selected minimizer, its one-time probability is the ordinary survival probability $q_n$, and recurrence is equivalent to $\sum_nq_n=\infty$. We also exhibit a critical infinite-variance offspring family for which the weak-minimum event occurs only finitely often, for every nonconstant increment law. We determine the polynomial order of its last occurrence and, for Gaussian or Laplace increments, prove quantitative eventual separation of the spine from the minimum. The sharp frequency constant and limiting distribution in the nonconstant finite-variance model remain undetermined.

fields
Probability
pdf ↗ page arXiv:2610.37714 ↗

Local-to-Global theorems are a cornerstone of many of recent developments in theoretical computer science from coding theory and PCPs all the way to analyzing mixing time of Markov chains. Building on trickledown theorems on simplicial complexes, several techniques have been established to obtain tighter local-to-global theorems to analyze the spectral gap of the Glauber dynamics, namely matrix trickledown, ${\mathcal C}$-Lorentzian polynomials and more recently Bochner type inequalities. In this paper, we adopt non-local local-to-global/Bochner type inequalities on "cones", corresponding to the local neighborhood of a given vertex, to show that the Glauber dynamics mixes in polynomial time to sample proper colorings of maximum degree $Δ$ graphs as long as $q\geq 1.7408Δ$.

comments
26 pages
fields
Probability, Combinatorics
pdf ↗ page arXiv:2610.37721 ↗

Baricz et al. [BPV2011] posed the question of whether the $K$-distribution (or gamma-gamma distribution) satisfies the ageing property known as the new is better than used (NBU) property. In this paper we address this question by establishing that, under certain parameter conditions, the gamma-gamma distribution satisfies the new is worse than used (NWU) property rather than the NBU property. For the remaining parameter ranges, we show that the gamma-gamma distribution is neither NBU nor NWU. The proofs rely on tools from the theory of stochastic orders of random variables. Moreover, by exploiting the fact that the random variable that follows the $K$-distribution is actually the product of two independent gamma random variables, we obtain alternative proofs of our results. Similarly, by exploiting the fact that the random variable that follows the beta-prime distribution is actually the quotient of two independent gamma random variables, we establish analogous NBU/NWU properties for this distribution. We also establish sufficient conditions under which the product of two independent positive random variables possesses the NWU and decreasing failure rate (DFR) properties. On the other hand, we show that the survival function of the $K$-distribution is hyperbolically completely monotone by representing it as the Laplace transform of a random variable belonging to the class of generalized gamma convolutions. As a consequence, we establish some monotonicity properties of the Mills ratio and hazard rate function of the $K$-distribution. These results provide further insight into the ageing and monotonicity properties of the gamma-gamma distribution. In addition, we derive a new integral representation and two new series representations, as well as bounds, for the survival function of the $K$-distribution.

comments
20 pages
fields
Probability
pdf ↗ page arXiv:2610.37725 ↗

We consider the general mother-dependent neutral mutation model defined in Blancas, Fittipaldi and Hernández-Torres (2026), consisting of a multitype branching process in which every individual carries one of $d$ alleles and each mutant child acquires a type different from that of its mother, according to a prescribed distribution. We assume that the total offspring distribution is critical and belongs to the domain of attraction of an $α$-stable law, with $α\in(1,2)$, while mutations are rare. Extending the results of Blancas and Rivero (2018), we prove the finite-dimensional convergence of the rescaled Markov chain that records, in each allelic generation, the sizes of the type-specific clone subfamilies and the mutant populations they produce. The limiting clone masses form a multitype Jiřina process driven by stable subordinators with drift, whose branching mechanism combines the stable reproduction law with the mother-dependent mutation matrix.

fields
Probability
pdf ↗ page arXiv:2610.37815 ↗

Let $(U_t)_{t\in\mathbb R}$ be a stationary Ornstein–Uhlenbeck process in $\mathbb R^d$ whose coordinate processes $(U_t^{(i)})_{t\in\mathbb R}$, $1\le i\le d$, are independent, centered, and have covariance function $\mathbb E [U_s^{(i)}U_t^{(i)}]=e^{-|t-s|/2}$. For every $T>0$, we obtain an explicit formula for the probability that the convex hull $\mathrm{conv}\{U_t:0\le t\le T\}$ contains the origin. We obtain a similar formula for a circular Ornstein–Uhlenbeck loop whose covariance is the normalized $T$-periodization of this kernel. For each fixed dimension $d$, we determine the precise long-time asymptotics of the non-absorption probabilities, which decay as explicit constants times $T^{d-1} e^{-T/2}$ as $T\to\infty$. We also show that, as $d\to\infty$, the absorption probabilities in both models undergo a transition from $0$ to $1$ around $T=2d$, with a common Gaussian limiting profile on the scale $\sqrt d$. We also obtain explicit formulas for the probability that $σZ$ belongs to the convex hull of Brownian motion or Brownian bridge on $[0,1]$ in $\mathbb R^d$, where $Z$ is an independent standard Gaussian vector and $σ\ge0$. The large-$σ$ asymptotics recover the known formulas for the expected volumes of these convex hulls. Finally, we compute the conic intrinsic volumes of the closed positive hulls of deterministic Ornstein–Uhlenbeck spirals and their circular analogues in Hilbert spaces. Their Grassmann angles coincide with the corresponding Ornstein–Uhlenbeck absorption probabilities. After suitable rescaling, the small-time limits of these conic intrinsic volumes recover the formulas of Gao–Vitale and Gao for the intrinsic volumes of the Brownian body and its Brownian-bridge analogue.

comments
66 pages
fields
Probability
pdf ↗ page arXiv:2610.37911 ↗

We derive a series of ``regularization by noise in high probability" results for incompressible Navier-Stokes equations $(d\geq3)$, via a new mechanism based on fixed point argument: For initial values in critical Besov space $\dot{B}_{q,\infty}^{-1+d/q}~ (1\leq q<\infty)$, we can expect unique global solutions with $C_{w^*,loc}\big([0,\infty);\dot{B}_{q,\infty}^{-1+d/q}\big)$-paths in high probability if the equations are perturbed by well-constructed additive type noise; for initial values in the ``end-point space" $\dot{B}_{\infty,\infty}^{-1}$ where the equations are locally ill-posed in deterministic setting \cite{BP08}, we can still expect unique solutions on $[0,T]$ (with ``modified" $*$-weak continuous paths) in high probability for large enough $T>0$, if the equations are perturbed by a well-constructed additive type noise plus a ``small" linear multiplicative noise. This means that the regularizing effect can be strengthen by small additional linear multiplicative noise in the sense that the Picard iteration remains effective for values in the largest critical space $\dot{B}_{\infty,\infty}^{-1}$. This work has nothing to do with AI models.

fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2610.38018 ↗

We study the probability simplex of a finite connected weighted graph with an Onsager operator combining logarithmic-mean transport and mass-conserving Fisher reaction. For every fixed positive reaction parameter, we prove that the entropy Hessian has a finite global lower bound if and only if the original transport graph has diameter at most two. Near a boundary probability, the corresponding criterion is that its positive support reaches every vertex in at most two steps. The proof controls all potential directions under arbitrary multiscale boundary degeneration. For graphs of diameter at most two, the optimal lower bound is Lipschitz on bounded parameter intervals, including the pure-transport endpoint. We also determine the largest instantaneous logarithmic-amplitude dissipation function depending only on the graph and the current amplitude, and construct two-level probabilities attaining it. Its positivity has the same two-step criterion. As consequences, we obtain graph-dependent entropy-decay estimates and exact projective contraction bounds without assuming nonnegative entropic curvature.

fields
Probability, Differential Geometry
pdf ↗ page arXiv:2610.38129 ↗

It is trivial that $1$-dimensional $2$-neighbor lattice percolation percolates. Coupier, Henry, Jahnel and Köppl proved the $2$-neighbor lattice percolation percolates in dimension 2; and then for sufficiently large dimensions, Bäumler, Jahnel, Köppl, Lodewijks, Reeves and Tóbiás showed this is still true. In this paper, we verify that the $2$-neighbor lattice percolation percolates in all dimensions $d\ge 3.$

comments
12 pages
fields
Probability
pdf ↗ page arXiv:2610.38200 ↗

We establish strong Gaussian approximations for centered stationary random fields on $\mathbb Z^d$, $d\ge2$, represented as measurable functions of i.i.d.\ innovations. Under finite $p$th moments, $p>2$, and sufficiently fast decay of spatial dependence, we construct a single coupling of the field with an i.i.d.\ Gaussian field. Its partial sums, scaled by the long-run standard deviation, approximate those of the original field almost surely, uniformly over all rectangular prefixes and all observation scales. Over a cube of side length $n$, the approximation error is $O_{\mathrm{a.s.}}(n^{\max\{d/p,(d-1)/2\}})$ up to logarithmic factors. While $d/p$ is the familiar moment term, the surface term $(d-1)/2$, absent for independent planar arrays, emerges as a cost of dependence, and cannot be removed even for finite-range Gaussian fields. The assumptions accommodate nonlinear and noncausal fields without imposing mixing. The proof combines a permanent dyadic blocking, a local Gaussian coupling in tensor Haar coordinates driven by a Doob martingale with vanishing conditional third moments, and a comparison of the resulting dependent Gaussian blocks with white noise.

fields
Probability, Statistics Theory
pdf ↗ page arXiv:2610.38202 ↗

We consider the tensor principal components analysis (tensor PCA) problem on the sphere, in which we are asked to recover an unknown vector in $\mathcal{S}_N=\{x\in\mathbb{R}^N:\lVert x\rVert^2=N\}$ from a noisy observation of its $k$-th tensor power, for a fixed $k\ge3$. Tensor PCA exhibits a well-studied information-computation gap: global algorithms such as spectral methods and sum-of-squares work above an algorithmic threshold, below which we know matching lower bounds (against these and some other restricted models of computation). In contrast, local algorithms such as Markov chains were only known to succeed from a random initialization at a polynomially larger signal-to-noise ratio, and were believed to be inferior to global algorithms for tensor PCA. Continuing the program initiated in Part I [arXiv:2610.16705], we show that spherical Langevin dynamics, when supplemented with annealing and ergodic averaging, achieves polynomial-time strong recovery above the algorithmic threshold from a uniformly random initialization. Together with Part I, our results demonstrate that local Markov chains can succeed all the way down to the algorithmic threshold from an uninformative cold start.

comments
Companion paper to arXiv:2610.16705 (Part I). 71 pages, 1 figure
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2610.38206 ↗

We analyze the limiting dynamics of two copies of a disordered mean-field spherical $p$-spin system coupled non-reciprocally to one another and initialized independently of the disorder. We prove that, on every finite time interval, as the system size tends to infinity, the empirical correlation and integrated response functions converge almost surely and in $L^q$ for $q \geq 1$, uniformly in time, to the unique non-random solution of a system of coupled integro-differential equations. For even $p$-spin models, we establish stationarity and exponential decay of the correlation and response functions in the high-temperature regime. In the special case of the spherical Sherrington–Kirkpatrick model, we derive explicit representations of the limiting correlation and integrated response functions. These representations allow us to characterize the long-time dynamics throughout the full range of temperatures. In particular, we prove the occurrence of aging in the low-temperature regime and fluctuation-dissipation behavior in the high-temperature regime, and provide a separate characterization of the dynamics at the critical temperature.

fields
Probability
pdf ↗ page arXiv:2610.38230 ↗

This thesis studies finite projections of transient regenerative processes, constructed by conditioning regeneration cycles to be finite. It develops comparisons between the original and projected laws, including finite-time bounds and best-approximation properties for specified metrics and comparison classes. Applications concern birth-and-death processes, Markov chains and semi-Markov processes, with explicit queueing examples. Structural results describe projections associated with different regeneration states, invariant measures and connections with Martin boundary kernels. The thesis also studies reconstruction of birth-and-death rates from passage-time laws and continued-fraction representations of Laplace-Stieltjes transforms for skip-free semi-Markov processes, together with truncation-error bounds. This is a corrected English edition of a Romanian doctoral thesis completed in 1998 and defended in 1999. The preface distinguishes the historical work from corrections and later additions made for this edition.

comments
89 pages; corrected English edition (2026) of the author's Romanian doctoral thesis, State University of Moldova, 1998; defended 15 January 1999
fields
Probability
pdf ↗ page arXiv:2610.38339 ↗

We introduce a new framework for stochastic variational inequalities with oblique reflections generated by non-symmetric matrix coefficients. The loss of symmetry fundamentally changes the structure of the reflected dynamics: besides the dissipative component, it produces a genuinely gyroscopic component describing rotational effects that are invisible to the associated energy forms. To capture this hidden component, we consider planar obstacle problems and we lift the dynamics to an extended phase-space system, where the dissipative and gyroscopic mechanisms are naturally separated. This leads to a new notion of solution, for which we establish existence and uniqueness. The resulting framework allows for genuinely rotated reflections, which can lead to angle-controlled rotations.

comments
30pp., submitted for publication
fields
Probability
pdf ↗ page arXiv:2610.38381 ↗

We develop a framework for calibrating passive market impact, defined as the price response to liquidity-providing limit orders, in contrast to the impact of liquidity-consuming market orders. We build on the model of Ouazzani Chahdi, Rosenbaum, and Szymanski (arxiv:2412.07461), which combines Hawkes-driven market-order flow with queue-reactive limit-order and cancellation dynamics. Within this model, we show that the price decomposes into a universal propagator term driven by signed order-flow imbalance and a state-dependent correction that captures the dependence of price sensitivity on volume at the best quotes. This decomposition links limit-order-book microstructure to standard propagator models and yields a regression on two observable signals: the propagator signal and the queue-weighted order-flow imbalance. We calibrate the model on high-frequency order-book data and find that the passive-impact term explains substantial variation in prices beyond the classical propagator, improving both model fit and the accuracy of predicted impact curves.

fields
Probability
pdf ↗ page arXiv:2610.38442 ↗

We study clusters of the Brownian loop soup on $\mathbb{R}^3$ and of random walk and metric-graph loop soups on $\mathbb{Z}^d$ and $\widetilde{\mathbb{Z}}^d$ within a unified framework. For the continuum model, when the one-arm exponent $ξ(α)$ is positive, we prove that almost surely every cluster has Hausdorff dimension $3-ξ(α)$. A key step is to show that, conditioned on the one-arm event, a crossing cluster has capacity comparable to the crossing scale with uniformly positive probability. This gives one-arm estimates of order $αr^{-ξ(α)}$, uniformly down to zero intensity, and shows that $ξ(α)$ is strictly decreasing and left-continuous. Moreover, $1-ξ(α)\asympα$ as $α\downarrow0$. As another application of the one-arm estimates, we prove that several critical values coincide, resolving a conjecture of Jego and Lupu in arXiv:2601.04840. The proof combines a decoupling technique with a multiscale recursive argument to control the combined effects of large and small loops. These methods also extend to loop soups on $\mathbb{Z}^d$ and $\widetilde{\mathbb{Z}}^d$ for $d=3,4,5$, yielding capacity lower bounds of order $r$, $r^2/\log r$, and $r^2$ for the cluster of the origin, conditioned on the one-arm event, throughout the small-loop decay regime. In particular, these bounds imply strict polynomial comparisons between one-arm probabilities at different intensities in dimension three. We also show that the small-loop decay regime on $\widetilde{\mathbb{Z}}^d$ has upper endpoint $\frac{1}{2}$ by adapting the OSSS sharpness framework to the truncated loop soup.

comments
52 pages, 1 figure
fields
Probability
pdf ↗ page arXiv:2610.38510 ↗

Let $p\in(0,1/2]$ be fixed, and let $d,n$ be positive integers satisfying $d=pn$. Let $Q_n$ be an $n\times n$ random combinatorial matrix whose rows are independent and uniformly distributed over the vectors in $\{0,1\}^n$ having exactly $d$ ones. For an arbitrary deterministic invertible $n\times n$ matrix $M$, we establish two-sided bounds for the smallest singular value of $Q_nM$. More precisely, for every $\varepsilon\in(0,1)$, \[ \mathbb P\!\left( \varepsilon\le s_n(Q_nM)\cdot \|M^{-1}\|_{\mathrm{HS}} \le \varepsilon^{-2} \right) \ge 1-C\left( \varepsilon+d^{-1/2}+e^{-c\,\operatorname{sr}(M^{-1})} \right)-2e^{-cn}, \] where positive constants $C, c$ depend only on $p$ and $\operatorname{sr}$ denotes the stable rank. Consequently, for any sequence of deterministic invertible matrices $M$ satisfying $\operatorname{sr}(M^{-1})\to\infty$, $s_n(Q_nM)$ is typically of order $\|M^{-1}\|_{\mathrm{HS}}^{-1}$. In particular, taking $M=\mathbf I_n$ recovers the known $n^{-1/2}$ scale for $s_n(Q_n)$.

fields
Probability
pdf ↗ page arXiv:2610.38588 ↗

We study conditioning on long survival for time-inhomogeneous Markov chains on finite state spaces. We assume that a sequence of substochastic transition kernels converges to an irreducible substochastic kernel and that the transition probabilities admit asymptotic expansions up to order $n^{-2}$. Under these assumptions, we construct a positive space-time harmonic function and prove that the limiting path distributions under conditioning on long survival are given by the corresponding Doob h-transform. We also investigate the long-time behavior of the resulting conditioned process. Finally, we apply our general theory to an elephant random walk, a generalized Pólya urn model, time-inhomogeneous Wright–Fisher and Moran models, and noncolliding random walks.

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

[Kosygina et al. 2023] showed that the rescaled polynomially self-repelling walk does not converge to any Brownian motion perturbed at extrema (BMPE). Motivated by this result, we introduce an explicit candidate for the scaling limit, the polynomially self-repelling motion (PSRM), and study its properties. The construction relies on a new family of continuous stochastic flows, called polynomially self-repelling flows, introduced in [Yu 2026]. A key ingredient in relating the limiting process of the rescaled walk to the PSRM is a joint Ray-Knight theorem for rescaled local time processes, extending the classical Ray-Knight theorems of [Tóth 1996].

comments
66 pages, 2 figures
fields
Probability
pdf ↗ page arXiv:2610.38591 ↗

We study directed last passage percolation with geometric weights in a spatially inhomogeneous environment. We derive an explicit limit shape and establish fluctuation limits for the passage time, showing that, depending on the strength of the inhomogeneity, the limiting fluctuations are governed by Fredholm determinants associated with either the Airy or Bessel kernel. Our approach is based on an exact relation between the passage time and the smallest particle of the $q$-deformed Jacobi unitary ensemble ($q$-JUE). As part of our analysis, we derive the macroscopic limiting density of the $q$-JUE, which provides a natural $q$-deformation of the classical Wachter distribution, as well as of the limiting distribution of the Meixner ensemble. We further establish Airy and Bessel scaling limits for the smallest particle, which are of independent interest.

comments
45 pages, 8 figures
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2610.38646 ↗

The present work discusses the birthday problem and the birthday person problem, two classical problems in probability theory widely used to illustrate situations in which human intuition diverges from mathematical results. Taking the work of [1] as its main reference, the study analyzes the probability of birthday coincidences within groups of people, considering a year with 365 days and assuming that all birth dates are equally likely. The birthday problem seeks to determine the probability that at least two people in a group share the same birthday, showing that, even in relatively small groups, the probability of a coincidence increases rapidly due to the large number of possible pairwise comparisons among individuals. In contrast, the birthday person problem investigates the probability that a previously selected person shares the same birthday as another member of the group. This probability increases more slowly, since the number of relevant comparisons is restricted to the pairs formed by the selected person and the remaining members of the group. Despite the interpretative differences, both problems share a similar mathematical foundation based on combinatorial analysis and probability theory. In addition to the theoretical development, numerical results and graphical representations are presented to illustrate the behavior of the probabilities involved and to visualize how the likelihood of coincidences increases as the number of people grows. Finally, applications related to computing and cryptography are discussed, particularly the study of collisions in hash functions and the so-called birthday attack. The discussion highlights the importance of probabilistic reasoning in understanding apparently unlikely phenomena, while also emphasizing how the growth in the number of possible combinations directly influences the results obtained.

comments
17 pages, 6 figures
fields
Probability
pdf ↗ page arXiv:2610.38749 ↗

Particle Gibbs samplers with backward sampling are widely used for sampling the smoothing distribution of state-space models, but, with few particles, the new trajectory often coincides with the current one at many time steps. A known but rarely used remedy replaces the random selection of the final particle by a Metropolis–Hastings move which avoids the current particle. We show that, with backward sampling, this remedy only helps at the last time steps, because its effect on the update rates decays geometrically with the distance to the final time. We propose instead Metropolized backward sampling, which makes such a move at every step of the backward pass, forcibly switching trajectories whenever possible. Additionally, we introduce a coupled version which prevents proposing the current trajectory, maximizing the chances of an actual switch versus the current trajectory and performing perfect sampling when the state-space model has no observations, a feature not shared by backward sampling. We prove that, at every time step, both methods dominate backward sampling as they update the state more often and have smaller lag-one autocorrelations than it does. Our methods are drop-in replacements for backward sampling, and can be used to improve any particle Gibbs sampler.

comments
12 pages + appendix. A Lean formalization was AI-generated after the draft of the paper was written as an experiment. I have subsequently edited the documentation of the formalization for better readability, and discussed the process, as well as difference between the AI-formalized and my original proofs in the appendix. https://adriencorenflos.github.io/formalization/metropolized-CSMC/
fields
Probability
pdf ↗ page arXiv:2610.38753 ↗

We determine the leading small-time Wasserstein action of the full spatial laws of centered KPZ and dynamical $Φ^4_3$, both started from zero. The leading term is Gaussian, with an explicit heat-trace constant. A common comparison also determines the ratio of length to displacement. For KPZ, a first-chaos cancellation yields a quadratic coupling error. For $Φ^4_3$, two weighted entropies and an adjoint estimate give comparison bounds uniform in the spectral cutoff. Integrating a Gaussian rotation gives a differentiable realization of the full law; the comparison holds at every positive time.

fields
Probability
pdf ↗ page arXiv:2610.38785 ↗

Randomly connected networks are ubiquitous in computer science, physics or biology. A central question is whether, and how, their collective dynamics depend on the choice of the distribution of the random couplings. Forty years ago, Geman and Hwang formulated a precise version of this \emph{universality} question for randomly connected neural networks. We come back to these conjectures, review what was proven since, provide a few new extensions and propose new conjectures in this paper. For $n$ neuron networks with couplings with a mean scaling as $1/n$ and light enough tails, two classes of limits are expected. For \emph{weakly heterogeneous} couplings, with variance $o(1/n)$, the network is predicted to converge to a McKean–Vlasov equation, and a broad literature has established this under general assumptions. For \emph{strongly heterogeneous} couplings, with variance of order $1/n$, the limit is a non-Markovian equation driven by a self-consistent Gaussian process. After landmark results for Gaussian couplings, universality was only recently established for linear interactions, while the continuous-time nonlinear case relevant to neuroscience remained open. Here, in the weakly heterogeneous regime, we prove quenched convergence on every time interval under a fourth-moment assumption only, and convergence in probability under an assumption slightly stronger than a second moment. In the strongly heterogeneous regime, we prove convergence for nonlinear interactions in continuous time, averaged over sub-Gaussian couplings and on every time interval, by a relative-entropy comparison with Gaussian couplings. We then extend the conjecture to heavy-tailed couplings, and propose a limit driven by a self-consistent $α$-stable process, for which we prove existence for every $α\in(0,2)$ and uniqueness for $α\in[1,2)$, and provide extensive numerical evidence in all three cases.

fields
Probability
pdf ↗ page arXiv:2610.38893 ↗

We give an analytic proof of the comparison conjectured by Das, Łochowski, Matsuda and Perkowski for the fractional Brownian level-crossing constant: for standard fractional Brownian motion, $c_H>\mathbb{E}|Z|^{1/H}$ when $0<H<1/2$ and $c_H<\mathbb{E}|Z|^{1/H}$ when $1/2<H<1$, where $Z\sim N(0,1)$. At $H=1/2$, both constants equal one. The main tool is Gaussian comparison under ordering of increment variances. It applies because truncated variation is translation invariant and lattice-submodular, as follows from its minimum-total-variation characterization. A tangent variogram produces Brownian motion with an independent Gaussian drift on the upper side, and a periodic Brownian bridge on the lower side. The former has an explicit stationary reflection rate. For the latter we calculate an integrated cyclic crossing count by first-passage Laplace transforms. Elementary hyperbolic, theta-series, and Gamma inequalities then give strict comparisons on both full parameter ranges. No numerical integration, simulation, interval certificate, or quantitative local expansion at $H=1/2$ is used.

fields
Probability
pdf ↗ page arXiv:2610.38894 ↗

We study heterogeneous bootstrap percolation on uniform simple graphs with prescribed degrees of mean $d\to\infty$ and deviations at most $C\sqrt d$. Thresholds are independently one with probability $(1-c/d)/d$ and two otherwise; seeds form an independent uniform set of prescribed size $a$. Let $T_a$ be the terminal number of active vertices and $b$ be one minus the mean number of threshold-one descendants of a reached vertex. Let $K\sim d^2$ be the quadratic response coefficient. If $b>0$ and $nb^3/K\to\infty$, we prove, uniformly over seed counts $a$, $ \mathbb{P}(T_a\ge n/2)=Φ(\frac{a-nα_{\mathrm{det}}}{w})+o(1)$ with $w=\sqrt{nb/K}$, where $α_{\mathrm{det}}$ is the exact empirical response-barrier center and $Φ$ is the standard normal distribution function. Put $a_0=(n/K)^{1/3}$. If $d^4/n\to0$, $a/a_0\to x>0$ and $λ=ba_0\to\ell\in\mathbb{R}$, then $\mathbb{P}(T_a\ge n/2)\to p(x,\ell)$, the one-sided Brownian parabolic survival probability. A sequential absolute-error law joins these regimes. A graphical counterexample shows that replacing the exact center by its leading term can cause limiting probability error $1/2$. The proof balances adaptive early-exploration transfer against late concentration at a tunable physical horizon, despite exponentially rare simplicity. We also prove quantitative and mesoscopic-seed refinements in explicitly narrower regimes. The only external graph-enumeration input is a stated reduction of McKay–Wormald's estimate; the probabilistic estimates for the cascade argument are proved in the text and appendices.

comments
47 pages. No figures
fields
Probability, Combinatorics
pdf ↗ page arXiv:2610.38912 ↗

We show that, for any infinite transitive graph $G$, the infinite cluster after supercritical percolation almost surely inherits the anchored isoperimetry of $G$. Moreover, the probability of violating the corresponding isoperimetric inequality decays exponentially in the isoperimetric profile of the host graph. This was previously known only for nonamenable transitive graphs, $\mathbb{Z}^d$, and very recently for transitive graphs of polynomial growth. Our proof combines the thinning-and-sprinkling technique with a novel counting algorithm.

comments
11 pages, 2 figures
fields
Probability, Combinatorics
pdf ↗ page arXiv:2610.38941 ↗

A binary-output dice enterprise uses independent rolls of a die with unknown face probabilities $\mathbf p$ (along with fair coin flips) to simulate a coin with bias $f(\mathbf p)$. We determine which power-law tails, uniform over the closed probability simplex, are attainable for the number $N$ of rolls. For continuous $f$ with values in $(0,1)$ and $q>0$, some enterprise for $f$ satisfies $\sup_{\mathbf p}\mathbb{P}_{\mathbf p}(N>n)=O(n^{-q})$ if and only if $f$ can be approximated uniformly by polynomials of degree $k$ with error $O(k^{-2q})$. When this holds, the same tail bound is attained by an oblivious enterprise, which chooses its number of rolls before rolling. The characterization extends to multiple dice, with total degree on a product of simplices; it then suffices to roll the dice in a fixed cyclic order. For $q>1$, these enterprises have a uniformly bounded expected number of rolls.

comments
13 pages, no figures
fields
Probability
pdf ↗ page arXiv:2610.38964 ↗

We introduce a general form of Ising–Kac interactions through heat-kernel averaging, with the heat-time parameter replacing the role of the interaction range. From the viewpoint of Dirichlet forms theory, this construction provides an intrinsic analogue of the mesoscopic averaging in classical Kac models when translation invariance is unavailable. We then investigate limits of this model on graph approximations of the Sierpiński gasket. For the associated Glauber dynamics, we establish a hierarchy of scaling limits for the magnetization field. First, at fixed interaction heat time and inverse temperature, we derive a nonlocal hydrodynamic equation on the continuum gasket. Second, as the heat time vanishes and the inverse temperature approaches its mean-field critical value, suitably rescaled hydrodynamic solutions converge to the solution of the deterministic Allen–Cahn equation. Finally, under a joint scaling of graph refinement, interaction heat time, and inverse temperature near criticality, we prove convergence of critical magnetization fluctuations to the solution of the dynamical $Φ^4$ equation. These results provide a concrete realization of the Ising-$Φ^4$ correspondence in a geometric setting with non-integer spectral dimension.

fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2610.38982 ↗

We present a unified treatment of various large deviation principles in the context of random walks induced by actions of countable groups. The fundamental notion undergirding the global perspective is that of weakly almost additive random walks, inspired by earlier works on the metric geometry of group actions as well as by recent developments in the theory of nonadditive thermodynamic formalism. We treat large deviations of the renormalized vector-valued distance function from the origin for groups acting simultaneously, by isometries and in a weakly almost additive fashion, on an arbitrary number of metric spaces. The foremost class of examples is provided by group actions with contracting elements, which encompasses, among others, actions on Gromov-hyperbolic spaces and mapping class group actions on Teichmüller spaces. We further establish large deviation principles for quasimorphisms on countable groups, and for random walks generated by compositions of Euclidean isometries; also, we discuss extensions and streamlining of known large deviation results for singular values of random matrix products. Finally, in all the contemplated cases, we investigate the analytic properties of the rate function, leveraging its expression as the Fenchel-Legendre transform of a pressure function for certain nonadditive sequences of potentials on shift spaces.

comments
56 pages, 1 figure. Comments are welcome
fields
Probability, Dynamical Systems, Group Theory, Metric Geometry
pdf ↗ page arXiv:2610.39033 ↗

We study the large size dynamics of a fully asymmetric spherical Sherrington- Kirkpatrick model, allowing for a distinguished random signal that interacts with the evolving spin configuration. We first derive the large-N dynamical mean-field limit and characterize the law of a typical coordinate by an effective Gaussian process whose covariance must satisfy a self-consistency relation. The resulting formulation is intrinsically nonlocal in time and is not, in its usual form, a closed finite-dimensional dynamical system. Our main contribution is an autonomous spectral representation of this limiting dynamics. We introduce an auxiliary stationary chain of Gaussian replicas whose one-step marginal reproduces the effective field appearing in the dynamical mean- field equation. Applying a matrix-valued Herglotz representation, or equivalently Fourier analysis in the replica index, converts the covariance structure of the chain into a family of finite-dimensional matrix-valued evolution equations indexed by the unit circle. The macroscopic observables, including the signal overlap, are then recovered from explicit spectral integrals. This representation replaces the original two-time self-consistency problem by an autonomous spectral closure and provides a convenient framework for both analysis and numerical computation. We prove the validity of the representation and compare its predictions with direct simulations of the finite-dimensional system

fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2610.39115 ↗

We study rough differential equations (RDEs) driven by Brownian (Itô) rough paths with uniformly locally integrable drifts. The diffusion coefficient is assumed to be uniformly elliptic, of class $C^{2+}$ in space and of bounded variation in time, while the drift is $q$-integrable in time and $p$-integrable in space, uniformly on balls of a fixed radius, for some $p,q$ satisfying the Krylov–Röckner condition $\frac dp+\frac2q<1$. We show that, for almost every realization of the Itô rough path lift of the Brownian motion, such an RDE has a unique solution for every initial value. In other words, for almost every realization of the Itô lift, the corresponding rough differential equation has exactly one solution in the class of Davie-type solutions, for every initial value; this is the appropriate notion of path-by-path uniqueness for the corresponding stochastic differential equation (SDE) with multiplicative noise. The proof follows the strategy of Shaposhnikov (2016). The principal new ingredients are the stability of RDEs with bounded variation perturbation and Davie-type estimates for the flow of the driftless equation with non-constant diffusion coefficients, which we derive from known maximal regularity estimates for the corresponding parabolic partial differential equations (PDEs).

fields
Probability
pdf ↗ page arXiv:2610.39153 ↗

We study Gibbs averaging of finite Markov chains with a prescribed stationary distribution $π$. Given a transition matrix $P$ and the Gibbs kernel $G$ induced by a state-space partition, we prove that $GPG$ is an information projection for every admissible Bregman generator $φ$, with divergences defined using transition probabilities relative to $π$. A Pythagorean identity characterizes this projection and recovers the relative entropy and weighted Frobenius cases. A dual characterization identifies $GPG$ as a kernel closest to stationarity among those with the same projection chain as $P$; for relative entropy, it maximizes the entropy rate. The identities also give monotonicity under partition coarsening. For every reversible ergodic baseline $P$, Gibbs averaging cannot increase the squared weighted Frobenius distance to stationarity at any positive integer time, and the inequality is strict unless $P=GPG$. The corresponding mixing time therefore cannot increase. To choose the partition, we identify the divergence of $G$ from stationarity as the exact worst-case divergence of $GPG$ over all $π$-stationary baselines $P$. This objective depends only on the block masses. We give an exact algorithm for concave block costs, including those arising from relative entropy and power generators $φ(u)=u^p$ with $1<p<2$, and a greedy approximation algorithm with a provable guarantee for $p>2$. For power generators $φ(u)=u^p$ with $p>1$, the objective is proportional to Tsallis entropy of order $2-p$: its minimization favors imbalanced block masses when $1<p<2$ and balanced block masses when $p>2$, while all $k$-block partitions have the same objective value when $p=2$. A numerical experiment compares the resulting projected chains with a local Metropolis sampler on a multi-modal $π$.

comments
33 pages, 4 figures
fields
Probability, Information Theory, Optimization and Control
pdf ↗ page arXiv:2610.39239 ↗

We prove that the martingale dimension of a broad class of strongly local regular Dirichlet forms is bounded above by a small-scale version of spectral dimension. This resolves a conjecture of Hino for this class of spaces, extending his earlier results beyond self-similar fractals. Our proof uses differentiation of energy measures to select good blow-up scales and construct approximately harmonic coordinates. We then study weak limits of their Euclidean image measures and combine an integration-by-parts argument with uniform Sobolev inequalities to establish the dimension bound.

comments
51 pages; comments are welcome
fields
Probability
pdf ↗ page arXiv:2610.39312 ↗

In this paper, we study the terminal laws and Poisson boundaries obtained by stopping random walks on countable groups. For a transient walk, we give a direct Green-potential characterization of randomized stopping distributions and show that the terminal law determines the mean stopping time. On free groups, this yields finitely supported randomized stopping distributions at a positive total variation distance from every ordinary stopping distribution. We construct symmetric, fully supported recurrent measures of finite entropy on countable locally finite groups and obtain ordinary strict boundary enlargements when the group is not Choquet-Deny. For generating source and terminal measures of finite entropy, positive asymptotic entropy of the source forces the stopping time to have finite mean. A direct proof of the finite-mean entropy formula and boundary preservation then shows that a finite-entropy stopping chain has at most one strict enlargement. An exact stopped-word entropy identity shows that infinite-mean ordinary stopping with a finite-entropy terminal law has infinite conditional history entropy.

comments
26 pages, 3 figures
fields
Probability, Group Theory
pdf ↗ page arXiv:2610.39345 ↗

Inspired by birds flying through cluttered environments, Karaman and Frazzoli showed that high-speed flight through an ergodic random forest exhibits an ultimate speed limit: above a critical speed, almost surely no infinite collision-free trajectory exists for a single bird. This paper formulates a corresponding bulk-transport problem for many birds. We construct an explicit directed corridor network in a Poisson disk forest and impose a common temporal headway at its waypoints. The maximum current equals a minimum vertex-cut capacity and is achieved by repeated flight along vertex-disjoint paths. The same schedule maximizes completed traversals at every finite horizon, with constant forward speed and no internal waiting. For a forest belt of fixed depth, exact transverse superadditivity yields an almost-sure deterministic current-density limit. A uniform shape theorem for an asymmetric planar dual identifies the current when depth and width grow together. For diverging depth bounded by a constant times width, this current equals the width-first, depth-second limit and is independent of the positive aspect ratio. When diagonal corridors are available, bulk current is positive at sufficiently low obstacle intensity and zero at sufficiently high intensity. For stochastic demand, an upstream admission queue is stable at every rate below the finite-network capacity.

fields
Probability
pdf ↗ page arXiv:2610.39378 ↗

We extend Seginer's matrix norm comparison to tensors with optimal dependence on the tensor order. For a real tensor $T$ of order $k\ge2$ with centered, integrable, independent and identically distributed entries, we prove $\mathbb{E} f(T)\le\mathbb{E}\lVert T\rVert_{\mathrm{inj}} \le C\sqrt{k\log k}\,\mathbb{E} f(T)$, where $f(T)$ is the largest Euclidean norm of a one-dimensional fiber and $C$ is universal. The comparison holds for every finite rectangular format, and the entry law may depend on both the dimensions and the tensor order. We show that the factor $\sqrt{k\log k}$ is optimal by considering Rademacher tensors on $[2]^k$.

comments
27 pages
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2610.39389 ↗

Let $A$ be an $n\times n$ real symmetric random matrix whose entries above the diagonal are independent, each with largest atom at most $β\in (0,1)$. The diagonal entries have an arbitrary joint distribution and are independent of the entries above the diagonal. We prove that \[ \mathbb{P}[\mathrm{rank}(A)\le n-k]\le 2e^{-c_βnk},\qquad 1\le k\le n, \] where $c_β>0$ depends only on $β$. This extends Han's corank bound to the full range $1\le k\le n$. No moment assumptions are needed, and the entries need not be centered or identically distributed. In particular, the case $k=1$ gives an exponential singularity bound under the uniform atom assumption. Our argument also gives a new proof of the exponential singularity bound for symmetric Rademacher matrices obtained by Campos, Jenssen, Michelen, and Sahasrabudhe. For every fixed $p\in (0,1)$, it yields the exponential singularity bound conjectured by Costello and Vu for the adjacency matrix of the Erdős–Rényi random graph $G(n,p)$, where the case $p=1/2$ was previously proved by Han.

comments
17 pages
fields
Probability
pdf ↗ page arXiv:2610.39424 ↗

We study a two-dimensional degenerate stochastic differential equation with oblique reflection and spectrally positive strictly stable noise of index in $(1,2)$, motivated by join-the-shortest-queue systems with heavy-tailed interarrival times. A polynomial-exponential Lyapunov function and fixed-time minorization establish positive Harris recurrence and exponential ergodicity in weighted total variation. We construct the invariant law from a stable path and prove its absolute continuity. Regulator identities describe stationary dependence and recover the joint Laplace transform from the queue marginal. Idleness inherits the classical stable Ornstein-Uhlenbeck tail; the queue has a sharp exponential tail with a polynomial prefactor whose power is half the stable index and a positive constant represented through regeneration. Conditional on small idleness, idleness divided by the conditioning threshold and the queue converge to independent beta and size-biased limits. Under large-queue conditioning, normalized idleness and queue excess converge to independent Mittag-Leffler and exponential limits.

fields
Probability
pdf ↗ page arXiv:2610.39471 ↗

We establish a weighted contraction principle for sublinear Markov semigroups on noncompact state spaces. Its abstract inputs are a Lyapunov drift condition and a strict local contraction of oscillations on a Lyapunov sublevel set. For locally uniformly parabolic diffusion semigroups, the latter is obtained by applying the parabolic Harnack inequality to both the upper evolution and its conjugate lower evolution: if $u=T_t\varphi$, then $u-m$ and $M-u$ solve the upper and lower Bellman equations, respectively. Combining the resulting local oscillation contraction with the Lyapunov drift yields a strict contraction in a weighted oscillation seminorm, a unique invariant sublinear expectation in the finite-Lyapunov-moment class, and weighted exponential convergence for Borel observables controlled by the Lyapunov function. To treat bounded Borel data for $G$-SDEs, we use a canonical covariance-law representation, progressively measurable state maps compatible with conditioning and pasting, and a stopped dynamic programming principle. A probabilistic Krylov–Safonov argument then gives positive-time Hölder regularisation before viscosity identification, thereby avoiding a measurable-data envelope argument. The abstract result is verified for ordinary locally uniformly elliptic SDEs, multiplicative $G$-SDEs, and the full equation with quadratic-variation drift \[ dX_t=b(X_t)\,dt +\sum_{i,j=1}^m h_{ij}(X_t)\,d\langle B^i,B^j\rangle_t +\sum_{j=1}^mσ_j(X_t)\,dB_t^j. \] For the full equation the hypotheses are expressed through the effective drift and covariance and are required uniformly over all covariance scenarios. Finally, the contraction and stochastic continuity of the associated stationary process yield ergodicity in the sense of Feng and Zhao.

fields
Probability
pdf ↗ page arXiv:2610.39492 ↗

Triadic closure is a natural mechanism for modeling the clustering phenomenon observed in many real-world networks. Given a possibly random undirected graph $H$, we consider pairs of non-adjacent vertices that have a common neighbor. Conditional on $H$, each such pair is joined by an edge independently and simultaneously, with a probability depending on the degrees of its endpoints and on the number of their common neighbors. The resulting graph is called a triadic closure of $H$. We study the effect of this operation on local convergence. More precisely, we prove that if a sequence of potentially random finite undirected graphs of $\left( H_n \right)_{n \in \mathbb{N}}$ converges locally in probability to a rooted graph $H^*$, then the corresponding sequence of triadic closures converges locally in probability to the same triadic closure of $H^*$. As a consequence, we obtain a general limit theorem for the clustering coefficients of triadic closures. In particular, we show that the triadic closures can have a strictly positive limiting clustering coefficients even when the limiting clustering coefficients of the parent graph sequence is zero. Finally, we apply our results to several classical sparse random graph models including Erdős-Rényi, configuration, preferential attachment models and compute the limiting clustering coefficients of their triadic closures.

comments
46 pages, 4 figures
fields
Probability, Mathematical Physics, Combinatorics
pdf ↗ page arXiv:2610.39535 ↗

This note supplies the details of the cavity lower bound used in "The Mézard-Parisi formula" [8]. Specifically, we show that small perturbations that do not change the limiting free energy can be chosen so that the asymptotic Gibbs measures arising in the Aizenman-Sims-Starr lower bound satisfy both the Ghirlanda-Guerra identities and the cavity equations. These calculations are standard and require only minor modifications of arguments already available in the literature. We record them here for completeness, avoiding a lengthy repetition of these arguments in [8].

fields
Probability
pdf ↗ page arXiv:2610.39542 ↗

This paper proves the Mézard-Parisi formula for the free energy of random $K$-sat and diluted $p$-spin models with even $p$, completing an approach developed in earlier work of the author and collaborators. The upper bound was established by Franz and Leone. Here the matching lower bound is proved for a general class of diluted models under symmetry and integrability assumptions. The main new contribution is a proof of an approximate form of the Mézard-Parisi reproducibility hypothesis without assuming that the overlap distribution has finite support.

fields
Probability
pdf ↗ page arXiv:2610.39545 ↗

We study four paths that join the starting site to the final position of a simple random walk of \(N=L^2\) steps on the infinite cubic lattice. The paths are selected on the walk trace—the graph of visited sites and traversed bonds—by different rules: the undirected shortest path \(S_1\), the directed shortest path \(S_2\), the time-respecting shortest path \(S_3\), and the depth \(D_e\) of the final site in a depth-first-search tree. Monte Carlo simulations for \(L\) up to 32768 give mean lengths scaling as \(L^{d_O}\), with \(d_{S_1}=1.48005(9)\), \(d_{S_2}=1.49868(5)\), \(d_{S_3}=1.51205(5)\), and \(d_{D_e}=1.7099(7)\), so that \(d_{S_1}<d_{S_2}<d_{S_3}<d_{\rm LE}<d_{D_e}\), where $d_{\rm LE}=1.62400(5)$ is the known loop-erased-random-walk exponent. Imposing traversal directions increases the shortest-path exponent, and imposing time order increases it further; these constraints therefore change the scaling exponent, not only the amplitude. For every path, the standard deviation scales with the same exponent as the mean, so it is scale-invariant, unlike the visited-site mass; the rescaled length distributions collapse onto a finite-width scaling function. No analytical theory currently predicts these exponents; our results provide precise numerical benchmarks for future studies of path geometry on random-walk traces.

fields
Probability
pdf ↗ page arXiv:2610.39612 ↗

We show that the transformer architecture emerges as the score of last-token laws in a natural statistical model of language, where sentences are empirical measures of tokens, a language is a law on $P(S^d)$, and our prior belief is that sentences carry no structure at all. By the maximum-entropy principle, we select the law closest to this prior in relative entropy among those reproducing an observed sentence-level statistic. We discuss the relevance of the statistic in the posterior interaction between tokens and we build a statistic, able to capture that interaction, with Luce's choice axiom truncated at the lowest relational order. This procedure gives the softmax choice rule, with the attention cross-moment as its mean parameter. The query–key matrix is then the Lagrange multiplier of a maximum-entropy problem inside each sentence, and the value matrix the multiplier of the constraint over the language, so that the two are untied. Under the optimal entropic law we then show that a transformer head appears in the score of the last-token law. For ordered sentences, causal masking follows from the masked reference choice rule, and with a next-token cross-moment the score equals one causally masked attention head. We also discuss multi-head attention, weight-tied unembedding, and a heuristic reading of residual blocks as projected Langevin steps.

comments
38 pages, 3 figures
fields
Probability
pdf ↗ page arXiv:2610.39614 ↗

We estimate the Lévy distance to the symmetric Bernoulli distribution for normalized Boolean convolution powers of a probability measure with mean zero and variance one. If the absolute moment of order $r$ is finite, we obtain the upper bounds $o(n^{-(r-2)/6})$ for $2<r<5$ and $O(n^{-1/2})$ for $r\ge5$. The proof relies on an inequality that controls the Lévy distance to the Bernoulli law by the values of the reciprocal Cauchy transform at two points. For each $r\ge2$, we also construct a single fixed distribution whose absolute moments are finite exactly up to order $r$, and show that the exponent $\min\{(r-2)/6,1/2\}$ cannot be improved. Under only a finite second moment assumption, the convergence can be arbitrarily slow.

comments
19 pages
fields
Probability, Operator Algebras
pdf ↗ page arXiv:2610.39743 ↗

We study the asymptotic behavior of a sequence of Galton-Watson processes with inhomogeneous immigration when the limit of the means of the offspring distributions is equal to 1. Under a growth condition on the variances of the offspring distributions, assuming the locally uniform convergence of the expectation functions of properly scaled immigration processes towards a càdlàg function, and the locally uniform convergence of the mean absolute deviation functions of the scaled immigration processes in question towards zero, we establish a functional limit theorem for the sequence of Galton-Watson processes with inhomogeneous immigration in question towards a deterministic limit process. We also provide some applications, among others, we show that a recent result of Rahimov and Sharipov (2024) on a functional limit theorem for a sequence of nearly critical Galton-Watson processes with dependent immigration can be recovered using our result.

comments
21 pages
fields
Probability
pdf ↗ page arXiv:2610.39771 ↗

For one-dimensional strict local martingales of the form $\mathrm{d} X_t=σ(X_t) \mathrm{d} W_t$ starting from $X_{0}=x_{0}>0$, we prove the strong rate $\mathbb{E}\left[|X^h_N-X_T|\right] \lesssim h^{\min\{θα,\frac{1}{2}\}}$ for a discrete scheme~$X^h$ truncated at a level $h^{-α}$, with time step~$h$, as $h\downarrow 0$, where~$θ$ depends on the truncation property. For the CEV model $σ(x)\equiv x^{1+γ}$ in particular, the rate is~$\frac{1}{2}$ for any $γ\in (0,1)$ (up to a logarithmic pre-factor at $γ=\frac{1}{2}$).

comments
17 pages, 5 figures
fields
Probability
pdf ↗ page arXiv:2610.39896 ↗

In this paper, we first develop novel tools of independent interest in the field of stochastic calculus related to SDEs with distributional drift, namely the formulation of a quasi-Stroock-Varadhan martingale problem in the sense that the test functions are of class $C^{1,2}$ instead of solutions of Kolmogorov type PDE. This has several applications, among which, the time restriction and the notion of conditional rough martingale problem and related solution.

fields
Probability
pdf ↗ page arXiv:2610.39903 ↗

We carry out a Lie point symmetry analysis of the coupled integro-differential system satisfied by the conditional Gerber–Shiu functions of a dependent jump-diffusion risk model. In the model, claim sizes are exponential, the intensity of the next claim arrival depends on whether the current claim exceeds a random threshold, and both the volatility and the premium rate may depend on the surplus. We write the system as the restriction to the half-line of a far-field operator with prescribed exterior data, derive the complete set of determining equations, including the condition imposed by the nonlocal convolution term, and solve them. The resulting group classification holds for every surplus-dependent volatility and premium of the form considered and for every absolutely continuous or constant threshold distribution. A non-trivial symmetry beyond scaling and superposition exists if and only if the volatility and the premium rate are constant, and it is then exactly the translation in the surplus variable. We construct the optimal system of one-dimensional subalgebras. We show that the invariant solutions of the combined translation–scaling generators exist precisely when a $2\times2$ generalized Lundberg determinant vanishes, and we give this determinant for an arbitrary threshold distribution, with explicit forms for the constant and exponential thresholds. We prove existence and sign properties of the adjustment coefficient, derive its sensitivities to all model parameters, and establish Cramér–Lundberg-type asymptotics for the Gerber–Shiu functions, including the limit of the ratio between the two regimes. A numerical study shows that claim-size-driven dependence lowers the adjustment coefficient markedly below that of an independent model with the same mean claim intensity.

fields
Probability
pdf ↗ page arXiv:2610.39920 ↗

A surprisingly wide variety of important random fractal metric spaces in modern probability theory can be viewed as self-similar random quotients of the real line, including the continuum random tree, Liouville quantum gravity surfaces, the trace of Brownian motion in $\mathbb{R}^d$, and self-similar ($s=2d$) long-range percolation on $\mathbb{R}$. We prove that the metric and resistance growth dimensions are well-defined in a certain sense for every random metric space in a class containing all of the above examples. Our results are new for the trace of Brownian motion.

comments
27 pages
fields
Probability
pdf ↗ page arXiv:2610.39953 ↗

We prove that the harmonic measure of simple random walk on the Poisson–Voronoi tessellation in $\mathbb{H}^d$ is almost surely singular with respect to Lebesgue measure on the boundary. This answers a question of Benjamini, Paquette, and Pfeffer in the hyperbolic plane and establishes the analogous result in higher dimensions. Our proof is based on ergodic theory of rerooting relations and their boundary extensions.

comments
20 pages
fields
Probability, Dynamical Systems
pdf ↗ page arXiv:2610.40067 ↗

Let $π_n$ be a uniform parking function of size $n$. We determine the scale at which its first $k$ coordinates cease to be close in total variation to $k$ independent uniform variables on $\{1,\ldots,n\}$. The distance is comparable to $1\wedge \sqrt{k\log(k+1)/n}$, uniformly for $n\ge2$ and $1\le k\le n$, and tends to one above the scale $n/\log n$. At the critical scale $k\simλn/\log n$, it converges to $2Φ(\sqrt{λ/π})-1$, where $Φ$ is the standard normal distribution function. A key ingredient is the Lorentzian property of the occupation generating polynomial of parking functions. Together with a strengthened Han inequality, this yields a relative entropy estimate for approximation by the product of the one-coordinate marginals.

comments
9 pages, 1 figure. Includes a 1.5-page section on AI use (in writing the paper and formalizing its results in Lean 4)
fields
Probability
pdf ↗ page arXiv:2610.40082 ↗

We study multi-excited random walks on infinite locally finite trees. The model is described by placing a stack of ``cookies'' at each vertex, with one cookie consumed on each successive visit. As long as cookies remain, the walk is in an excited regime and makes nearest-neighbour steps according to a prescribed sequence of biases. Once the stack is exhausted, the walk is in a non-excited regime and moves uniformly among the neighbouring vertices. The model is closely connected to foraging ecology, where repeated visits to a location can deplete local resources and thereby influence the attractiveness of that location for future visits. We prove that the process exhibits a sharp phase transition between recurrence and transience. The critical threshold is determined by the branching-ruin number of the tree, which is equal to the Hausdorff dimension of the tree's boundary under a suitable metric. Our result substantially extends Zerner's recurrence-transience criterion for multi-excited random walks on $\mathbb Z$ [Probab. Theory Related Fields 133 (2005)] to general trees.

comments
39 pages
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2610.40084 ↗

The two-dimensional stochastic Navier-Stokes equations with a shear-thickening viscosity driven by multiplicative noise are studied. After the problem is formulated as an abstract stochastic evolution equation on suitable function spaces, the existence and uniqueness of strong solutions are established through local monotonicity methods. Moment estimates are then obtained and used to prove the existence of an ergodic invariant probability measure via the Krylov-Bogolyubov technique. The uniqueness of the ergodic invariant measure is subsequently established by constructing a generalized coupling through a controlled auxiliary equation. Finally, the results are extended to other types of viscosities as well as to different stochastic hydrodynamical models.

fields
Probability
pdf ↗ page arXiv:2610.40086 ↗

We study planar random spatial graphs defined by inserting an edge between every point of a homogeneous Poisson process on the unit square and a nearest-neighbour within a fixed cone of directions (if there is such a point). We prove large-sample distributional limit theorems for the total Euclidean edge length of the graph, where the limit distribution is either Gaussian (due to contributions from the bulk) or, when one or both of the boundaries of the cone of directions align with the edges of the square, a convolution of Gaussian with a non-Gaussian law arising from boundary effects due to long edges near a boundary. This work extends previously known cases, including the ordinary nearest-neighbour graph (full cone of directions), where the Gaussian limit theorem was obtained by Bickel & Breiman and Avram & Bertsimas, and Bhatt & Roy's minimal directed spanning forest (with 'south-west' directions), where the non-Gaussian limit theorem was obtained by Penrose & Wade.

comments
33 pages, 2 figures
fields
Probability
pdf ↗ page arXiv:2610.40140 ↗

We study the sizes of optimal packings and coverings of conditioned branching processes by balls with growing radii. We find a universal limiting constant, and thereby establish universality of packing and covering numbers across different scales and different offspring distributions. To be precise, for $μ$ an offspring distribution with mean $1$ and finite variance $σ^2$ we let $T_n$ be a Bienaymé tree with offspring distribution $μ$ conditioned to have size $n$. We prove that the packing number (resp. covering number) of $T_n$ with balls of radii $1\ll γ_n \ll n^{1/2}$ is asymptotically equivalent to $\mathfrak{C} n /(σ^2 γ_n^2)$ (resp. $\mathfrak{C} n /(4σ^2 γ_n^2)$), for a universal constant $\mathfrak{C}$. We also show that the order of limits can be exchanged and that the same limit occurs when we first consider the limiting covering number of $T_n$ by balls of fixed radius $R$, and thereafter let $R$ tend to $\infty$. We then extend these results to the Brownian continuum random tree conditioned to have mass $1$. For this model, we prove that the packing (resp. covering) number with balls of radii $\varepsilon$ are asymptotically equivalent to $\mathfrak{C}/\varepsilon^2$ (resp. $\mathfrak{C}/(4\varepsilon^2)$), for the same constant $\mathfrak{C}$, in contrast with a conjecture by Aldous. Finally, our results answer a question by Devroye, Eide and Pralat on the asymptotic burning number of mean $1$ finite variance Bienaymé trees of size $n$, by showing that it lies between $(c+o(1)) n^{1/3}$ and $(2c+o(1))n^{1/3}$ with high probability, for a constant $c$ that only depends on the offspring variance.

comments
74 pages, 8 figures
fields
Probability, Combinatorics
pdf ↗ page arXiv:2610.40150 ↗

We study the empirical spectral distribution (ESD) of the random matrix $M_N=\frac1N\sum_{i=1}^N f(|πY_i|^2)\,Y_iY_i^\top$, where $π$ is a rank $k$ orthogonal projector on $\R^p$, $Y_1,\dots,Y_N$ are i.i.d. standard Gaussian vectors, and $k\to \infty$, $p/N\to γ$. We here assume that $f(x)=g(x/k)$ for some function $g$ discontinuous at $x=1$. We show that the asymptotic ESD is characterized by a Marchenko–Pastur equation, independently of $k$. We also show that the result extends to sub Gaussian random vectors $Y_i$ and to the case where the projector is replaced with a more general weight $φ(Y_i)$. Last, in the Gaussian case, we study the emergence of outliers due to the weighting.

fields
Probability
pdf ↗ page arXiv:2610.40368 ↗

We establish multidimensional exponential convergence of the lifted Bass gradient flow in martingale optimal transport. Let $μ\le_{cx}ν$ be an irreducible pair, with compact convex target support, source support strictly inside the target support, and target density bounded above and bounded away from zero almost everywhere on its interior. For every bounded $σ(X)$-measurable initial state, the flow converges exponentially in $L^2$ to the global minimizer with the prescribed mean, and the functional value gap decays exponentially. Both bounds hold at every nonnegative time with the exact initial errors as prefactors. The quantitative step is strong convexity on sets with a common $L^\infty$ bound and a fixed mean. We prove it by interpolating entropic endpoint potentials, using two conditional copies to cancel the unknown potential increment, and obtaining a Hessian lower bound uniform in the regularization parameter. Removing the regularization yields curvature for the original functional; the known qualitative theory supplies a common bound for the orbit. This extends the one-dimensional exponential-convergence result of Backhoff-Veraguas, Pammer, and Schachermayer. The main result is formalized in Lean 4. AI was used in preparing the paper (see Section 8).

comments
38 pages, 8 figures (4 in each language). Complete English version followed by the Russian version. Lean 4 verification sources included as ancillary material
fields
Probability
pdf ↗ page arXiv:2610.40404 ↗

We prove that the limiting velocity for (nearest-neighbour) random walk in i.i.d. random environment is deterministic when the local environment is supported on two points. No ellipticity is assumed. The proof uses a clever adaption (suggested by ChatGPT) of coupling arguments previously developed by the authors. It extends to i.i.d. environments where the local environments are mixtures of two such points.

fields
Probability
pdf ↗ page arXiv:2610.40464 ↗

When a resident community oscillates, can a rare mutant invade, and with which probability? We study a multitype birth-and-death process with interactions, in which population sizes are of the order of a carrying capacity $K$, and whose large-population limit, as $K\to\infty$, has a hyperbolically stable limit cycle for the $D-1$ resident types. We introduce a single individual of a new type. We prove that, as long as the mutant population is smaller than $\varepsilon K$ for a small $\varepsilon>0$, the resident population sizes divided by $K$ stay close to a moving point of the cycle, whose asymptotic phase moves by at most $O(\varepsilon)$ per period. We deduce that, for large $K$, the mutant dies out quickly if its growth rate averaged over one period, $f(\bar{\mathbf n})$, is negative, and that it invades with positive probability, in a time close to $\ln K/f(\bar{\mathbf n})$, if $f(\bar{\mathbf n})$ is positive. This justifies a criterion used heuristically in ecology for decades. The invasion probability, unlike $f(\bar{\mathbf n})$, depends on the phase of the cycle at which the mutant arises. We give it explicitly through Kendall's formula, and show that its average over the cycle, weighted by the birth rate of the mutant, equals $f(\bar{\mathbf n})$. In predator-prey, competitive and mutualistic examples, the invasion probability varies by a factor between $2$ and $600$ along the cycle, and individual-based simulations agree quantitatively with the theory. After invasion, the oscillations may vanish, persist on a cycle of higher dimension, or give way to chaotic coexistence.

comments
30 pages, 7 figures
fields
Probability
pdf ↗ page arXiv:2610.40466 ↗

Given two independent $n$-point samples drawn from possibly distinct probability distributions on a compact 2-dimensional surface, we minimize the total squared distance over all perfect bipartite matchings. Under regularity assumptions, the expected matching cost minus $n$ times the squared 2-Wasserstein distance between the sampling distributions grows logarithmically with $n$. We determine this difference up to an additive $o(1)$ error, including the dependence of the logarithmic coefficient and constant term on geometry and sampling distributions, and establish the existence of a universal constant shared by these formulas. Our analysis expresses the expected matching cost in terms of the cost of transporting a heat-smoothed sample back to its original points. The reductions giving this relation hold in every dimension and for general costs under suitable assumptions, with consequences beyond the setting studied here. In two dimensions, the relation is exact up to an additive $o(1)$ error, so determining the matching cost amounts to evaluating the smoothing cost with the same accuracy. We obtain this evaluation by subdividing the domain and exploiting cancellations between the sample and its own smoothing.

fields
Probability, Mathematical Physics, Optimization and Control, Statistics Theory
pdf ↗ page arXiv:2610.40509 ↗

We prove quantitative sub-ballisticity for the self-avoiding walk on the lattice $\mathbb{Z}^d$, $d\geq 2$. Namely, we obtain an explicit exponential rate of decay for the probability that a self-avoiding walk of length $n$ reaches distance at least $vn$, in terms of $v>0$. As a consequence, we show that the displacement of an $n$-step self-avoiding walk is at most $n/\exp(c\log^* n)$ with very high probability. Previously, only a non-quantitative $o(n)$ bound was known from the work of Duminil-Copin and Hammond. Along the way, we show that at criticality the partition function of bridges of length $n$ is on average bounded by $C/\log\log n$, which we believe to be of independent interest. Our approach is based on a quantitative analysis of the original nonconstructive proof of Duminil-Copin and Hammond using ideas from proof theory.

fields
Probability, Logic
pdf ↗ page arXiv:2610.40520 ↗

We consider a drainage network model represented by a system of coalescing random walks exhibiting long range dependence before coalescence. This model was introduced by Gangopadhyay et. al. [GRS04] and Coletti et. al. [CFD09] proved its convergence to the Brownian web under diffusive scaling. Santos et. al. [SVZ24] considered a branching version of this model where branching occurs with low probabilities varying with the scaling parameter and showed that any sub-sequential limit contains a copy of the Brownian net. It was conjectured that the limit is indeed the Brownian net. In this work we prove this conjecture. Further, compared to [SVZ24], we explore the question of scaling limit in a wider spectrum of scaling regime. This work contributes to the broader understanding of the basin of attraction of the Brownian net.

fields
Probability
pdf ↗ page arXiv:2610.40555 ↗

How does the number of sampled opinions affect the time required to reach consensus in distributed consensus dynamics? We study the synchronous $h$-\textsf{Majority}, in which every node independently samples $h$ nodes uniformly at random with replacement in each round and adopts a most frequent sampled opinion, breaking ties uniformly at random. We show that $h$-\textsf{Majority} achieves the nearly-optimal trade-off between the sample size and the consensus time, among a broad class of consensus dynamics. In particular, we prove the following results. For every sample size $h \ge 3$ and for every initial configuration, we prove that the process reaches consensus with high probability within $\widetilde{O}\left(1+\min\left\{\frac{1}{\min\{h^2p_{\max},1\}},\frac{\sqrt{n}}{h}\right\}\right)$ rounds, where $n$ is the number of nodes and $p_{\max}$ is the largest initial fraction of nodes supporting any single opinion. This is the first bound on the consensus time for $h$-\textsf{Majority} that holds for every $h\ge3$ and every initial configuration. When the initially most popular opinion has a sufficiently large lead over every other opinion, we show that all nodes adopt this opinion with high probability within $O(\log n/\min\{h^2p_{\max},1\})$ rounds. We establish a matching lower bound up to polylogarithmic factors for any fixed update rule that treats all opinions symmetrically and that selects either a sampled opinion or the node's current opinion.

fields
Probability
pdf ↗ page arXiv:2610.40562 ↗

Let $f$ be a Rademacher random multiplicative function supported on the squarefree integers, and let $M(x)=\sum_{n\le x}f(n)$. We prove a two-sided law of the iterated logarithm normalized by the full predictable quadratic variation \[ Q(x)=\sum_{p\le x}\bigg(\sum_{\substack{m\le x/p\\ P(m)<p}}f(m)\bigg)^2 \] of the martingale obtained by revealing the prime signs. Almost surely, \[ \limsup_{x\to\infty}\frac{M(x)}{\sqrt{2Q(x)\log\log x}}=1, \qquad \liminf_{x\to\infty}\frac{M(x)}{\sqrt{2Q(x)\log\log x}}=-1. \] The same equalities hold with $\log\log Q(x)$ in the denominator. The almost sure cluster set of the normalized sum is $[-1,1]$. This gives a self-normalized version of the questions of Wintner and Erdős on almost sure fluctuations. We also prove that $Q(x)/q(x)$ cannot converge in probability to $1$ for any positive deterministic function $q$. Moreover, \[ \limsup_{x\to\infty} \frac{|M(x)|}{\sqrt{x}(\log\log x)^{1/4}} \] is either an almost surely finite and positive random variable with nondegenerate distribution or infinite almost surely. We do not determine which alternative holds.

fields
Probability, Number Theory
pdf ↗ page arXiv:2610.40605 ↗

We prove that flat Jackiw–Teitelboim (JT) gravity arises as a conformal scaling limit of random flat combinatorial disks. We give a clean criterion, formulated in terms of branching explorations, for a discrete model to converge to this conjecturally universal limit. For simplicity, we apply this criterion to a Boltzmann ensemble of disks with rectilinear boundary, defined by summing over combinatorial types and integrating over lengths. As the length of a distinguished side tends to infinity, the rescaled surface converges in law to a continuum random surface prescribed by Ferrari's path-integral formulation of JT gravity. Convergence is in the topology of smooth convergence of the conformal factors on compact subsets of the interior when uniformizing in a fixed domain; the limiting conformal factor is described by a harmonic Gaussian field closely related to holomorphic multiplicative chaos. The crux is a branching exploration of flat JT gravity whose lengths evolve as conditioned Cauchy processes and whose unexplored components are conditionally independent. We construct this exploration using a conformal welding theorem proved in a companion paper, and show that it is the scaling limit of Budd's row-by-row exploration of the discrete disks, analogous to the peeling of random planar maps. Under a tightness condition, our criterion upgrades this convergence to a conformal scaling limit for the discrete disks. Other natural combinatorial disk models admit analogous first-row recursions, providing a route to their scaling limits.

comments
39 pages, 8 figures
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2610.40645 ↗

Mathematical Physics58

We argue that the scattering amplitude of a single minus helicity gluon with arbitrarily many positive helicity gluons is topological. The amplitude is constant in chambers of kinematic space, its resonances are located at walls and its factorization is determined by wall-crossing. Yangian invariance dictates the amplitude to be determined by a 2d null Wilson loop that can be lifted into a positive and transverse 3d link. By reinterpreting wall-crossing and the Weinberg soft theorem as skein relations and Reidemeister moves of the subknots, we construct a state-counting description consisting of adding the `corners' of their HOMFLY-PT polynomials. Beyond the classical limit, we argue that this provides a conjectured but precise connection to topological field and string theory. The new formula is rigorously derived via a Lean-formalized dependency graph (DAG) as detailed in a companion paper, laying out the precise assumptions including Reidemeister III invariance. It is further tested exhaustively, including novel `star' kinematics where the amplitude and state count are shown to become Catalan numbers, in agreement with knot theory literature.

comments
11 pages
fields
Mathematical Physics, Geometric Topology
pdf ↗ page arXiv:2610.10673 ↗

We define and study the notion of partial Airy ideals, which are certain linear systems of PDEs that may contain less equations than variables. We show that they admit a unique solution of exponential type (the partition function) modulo a choice of initial condition. We construct a large class of examples of partial Airy ideals attached to spectral curves using twisted free-field representations of $\mathcal{W}(\mathfrak{gl}_r)$-algebras at self-dual level. This generalizes the results of Bouchard- Borot-Chidambaram-Creutzig-Noshchenko by significantly enlarging the set of admissible spectral curves, provided they come with additional data that we call colour. We show that the differential constraints on the partition function are equivalent to a set of equations on the associated correlators, which we call coloured loop equations. We find a recursive residue formulation for the solutions of those equations, the coloured blobbed topological recursion}, which is a generalization of the currently known forms of topological recursion. It includes the blobbed topological recursion of Borot-Shadrin as a special case, giving it a natural interpretation within the formalism of partial Airy ideals.

comments
62 pages
fields
Mathematical Physics, Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2610.33232 ↗

Ordinary $0$-form symmetries $G$ can mix with $1$-form symmetries $Π_2$ to form a $2$-group $\mathcal{G}$. We give a concrete lattice definition for a class of finite $2$-group symmetries in terms of local relations among symmetry operators. These relations identify the Postnikov class $[ρ]\in H^3(BG,Π_2)$ that characterizes the mixing. We develop a method to extract anomalies of these symmetries in one spatial dimension by restricting symmetry operations to an interval and comparing their composition near its endpoints. We also construct explicit qubit symmetry actions in $d=1,2,3$ spatial dimensions for a $2$-group with $G=Π_2=\mathbb{Z}_2$. These actions share the same nontrivial Postnikov class but include both anomaly-free and anomalous realizations. Their cohomological anomalies are classified by $H^{d+2}(B\mathcal G,U(1))$, which is $\mathbb{Z}_2$ for $d=1,2$ and $\mathbb{Z}_2\times\mathbb{Z}_2$ for $d=3$, and our constructions realize every class in these dimensions. Our results connect higher-group symmetry and its anomalies to concrete lattice operations, providing a microscopic framework for studying anomalous symmetries.

comments
44 pages, 9 figures
fields
Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2610.37745 ↗

Preparing complex quantum states of light for quantum information processing tasks often proceeds by converting from simpler states via experimentally accessible operations. We provide fundamental bounds on such probabilistic conversions, both exact and approximate. To do so, we establish a theory of weak, fully relative majorization that compares the disorder of phase-space functions. Our framework is versatile and can be tailored to different systems and sets of allowed operations. Focusing on Wigner functions in multimode photonic systems, we establish rigorous no-go results and tradeoff relations for exact and approximate conversions involving squeezed states, cat states, Gottesman–Kitaev–Preskill states, and Fock states. In doing so, we derive novel bounds and recover known tight ones. Our results demonstrate that phase-space disorder imposes strong limitations on photonic state preparation.

comments
47 pages, 6 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.37755 ↗

We solve the Klein-Gordon oscillator in a non-commutative phase space, generalized using Dunkl derivatives, both with and without interaction with a uniform magnetic field. For each of these cases, we begin by introducing the Dunkl derivative into the standard commutative phase space to evaluate the reflection parity symmetries. Then, using the Seiberg-Witten map, we extend the generalized system to a non-commutative phase space. In both cases, we determine the eigenfunctions and the energy spectrum exactly (which correspond to generalized Landau levels when a magnetic field is present). Furthermore, we compute the non-relativistic limit of the system and graphically analyze the behavior of the energy spectra. Our results demonstrate that the combination of the Dunkl deformation parameters, the non-commutative phase space geometry, and the magnetic field produces a parity-dependent modification of the energy levels. Finally, we verify that when the external magnetic field or the non-commutative parameters vanish, our exact solutions correctly reduce to the commutative Dunkl models established in previous works.

comments
20 pages, 3 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.37820 ↗

Covariant integral quantization is developed on the double discrete cylinder phase space, with the torus as configuration space, and yields the Wigner distribution and the stellar representation. This phase space is particularly well suited to translationally invariant states, such as the Gottesman Kitaev Preskill (GKP) states. These states are central to fault-tolerant quantum computing architectures, yet their quantum resources are still under investigation. The stellar representations of ideal GKP logical states, which behave as phase eigenstates of the double discrete cylinder, have no zeros on this phase space, whereas those of their superpositions have infinitely many. The vacuum, although Gaussian, has zeros on this phase space, and the zeros of finitely squeezed GKP states move with the widths of the peaks and of the envelope, and reach this phase space for fine-tuned widths. These features echo the role of the vacuum as the resource that makes GKP-based architectures hard to simulate.

comments
39 pages, 6 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.37831 ↗

We formulate the standard quantum teleportation protocol within the framework of deformation quantization, employing the Stratonovich–Weyl (SW) correspondence and the associated star product on the coadjoint orbits of $SU(2)$. Each qubit is represented by a spherical phase space $S^2$ endowed with the Kirillov–Kostant–Souriau (KKS) symplectic structure. Within this setting, we explicitly construct the phase space representations of the entangled Bell resource, the controlled-NOT and Hadamard operators, the projective measurements, and the conditional Pauli corrections. We demonstrate how the quantum information initially encoded in the Wigner function for the input qubit is redistributed through bipartite and tripartite phase space correlations. Upon consideration of a conditional unitary transformation, the measurement outcome produces a Wigner function on the receiver's coadjoint orbit that is related to the input by an outcome-dependent rotation, which can subsequently be inverted through the implementation of an appropriate Pauli correction. The covariance of the SW correspondence provides a geometric interpretation of this process, in which quantum information is redistributed and reconstructed without transferring the underlying symplectic geometry. Our formulation can also be extended to study quantum teleportation in more general phase space geometries equipped with suitable star products.

comments
20 pages, no figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.37861 ↗

Algebraic quantum field theory describes a quantum system through its observables, their localisation in spacetime, and the states that assign them expectation values. The separation of the specification of observables from the choice of a state makes it possible to compare vacuum, thermal and charged representations without assuming that they share a preferred Hilbert space. We develop the framework from familiar quantum mechanics, construct the free scalar field, and explain how causality and positive energy constrain local measurements. The Reeh–Schlieder theorem, the structure of local von Neumann algebras and the split property reveal key differences between quantum theory in the continuum (i.e. QFT) and ordinary quantum mechanics with finitely many degrees of freedom. Superselection theory relates observable charges to statistics and internal symmetries. Finally, local covariance and perturbative and homological methods extend the discussion to curved spacetime, interactions and gauge theories. We also discuss measurement theory and quantum information aspects of AQFT.

comments
Review on algebraic quantum field theory, 30 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2610.37904 ↗

This paper considers the eigenmode problem for a waveguide with a resistive film. An integral equation for the surface current on the film is formulated. A method for evaluating the kernel is described, and an explicit expression for the kernel is derived for rectangular and circular waveguides.

comments
8 pages, 3 figures
journal
Soviet Journal of Communications Technology and Electronics, vol. 31, no. 2, pp. 33-39, February 1986
fields
Mathematical Physics
pdf ↗ page arXiv:2610.37907 ↗

We develop a systematic method to compute the high overtone expansion of Kerr quasinormal modes on normal angular branches to arbitrary order. We first obtain the expansion of the angular eigenvalue at large frequencies by a simple polynomial recursion. Using this result in an alternative form of the radial Teukolsky equation, we find that all the WKB corrections are defined on a fixed genus-one spectral curve, and that the quantum periods at the second and higher orders are expressed in terms of only two elliptic periods. This allows us to determine the expansion coefficients order by order. We confirm that the truncated expansions reproduce quasinormal frequencies obtained by solving the angular and radial equations directly, for scalar, electromagnetic and gravitational fields. We also compare the scalar results with the exact WKB analysis of extremal Kerr black holes.

comments
37 pages. A Mathematica package is available at https://doi.org/10.5281/zenodo.23691045
fields
Mathematical Physics
pdf ↗ page arXiv:2610.38019 ↗

For a charged particle, a spacetime symmetry need preserve the electromagnetic potential only up to a gauge transformation. Starting from the standard Noether–Bessel-Hagen construction, we make explicit the reduction from the relativistic gauge-invariant worldline charge to the generalized constants of nonrelativistic velocity-dependent mechanics, retaining the quasi-invariance boundary term throughout. With the convention $S_p=-mc\int ds+q\int A$, the canonical worldline one-form is $P=-m u^\flat+qA$, and a Killing vector satisfying $\mathcal L_XA=dχ_X$ generates $C_X=P(X)-qχ_X$. Its low-velocity limit is the Noether–Bessel-Hagen charge of the coordinate-time Lagrangian, from which generalized linear momentum, angular momentum and energy follow generator by generator. A uniform magnetic field gives an elementary gauge-dependent representative but gauge-invariant translational charge. The Darwin interaction then supplies the conservative $O(c^{-2})$ many-particle realization after field elimination, while a closed particle–field system is governed by the total stress-energy Killing charge. The result is an explicit reduction map linking three established descriptions without identifying their distinct conserved quantities.

comments
Accepted for publication in Europhysics Letters
fields
Mathematical Physics
pdf ↗ page arXiv:2610.38128 ↗

A topological Anderson insulator is an insulator whose non-trivial topological phase is induced by disorder. We develop a homogenization theory of this phenomenon for constant-coefficient elliptic systems perturbed by fluctuations oscillating at scale $\varepsilon$. Periodic fluctuations of every order below that of the operator, with appropriate amplitudes, do not average out: they produce an order-one correction $M$ given by a second-order (Born) formula, and the operator converges in the norm-resolvent sense to its homogenized limit. In particular, electric potentials and magnetic fields of zero mean, usually regarded as topologically trivial perturbations, generate corrections $M$ that change the topological phase. Fluctuations confined to a half-plane create an interface that carries the bulk-difference invariant of the homogenized operator for all $\varepsilon$ sufficiently small, a property that is stable under local defects. For random fluctuations, rare regions typically fill the homogenized gap, which becomes a pseudo-gap, and the standard interface index need no longer be defined. We define an index along cuts deformed so as to avoid the rare regions, and prove that it equals almost surely the bulk-difference invariant of the operator homogenized in the Born approximation, for first-order alloys with vanishing low moments and for a class of second-order systems with scalar disorder at criticality that includes the BHZ model.

comments
81 pages, 8 figures. Main paper (45 pages) followed by the supplementary material (36 pages)
fields
Mathematical Physics
pdf ↗ page arXiv:2610.38150 ↗

We develop a rigorous mathematical framework for the nonequilibrium thermodynamics of semilinear stochastic partial differential equations. The invariant Gaussian measure of the associated Ornstein-Uhlenbeck process, which need not be time-reversible, serves as the reference measure. We define thermodynamic quantities in terms of probability densities and derive the entropy balance equation. We obtain explicit expressions for the entropy production rate and prove that its vanishing in the stationary state is equivalent to time reversibility. Sample-path entropy production is identified with the logarithm of the Radon-Nikodym derivative of the forward path measure with respect to the time-reversed path measure and is shown to satisfy fluctuation theorems. For nonstationary systems, sample-path entropy production decomposes into housekeeping heat and free-energy dissipation, each satisfying an integral fluctuation theorem. Both have nonnegative expectations, and the mean free-energy dissipation equals the decrease in relative entropy with respect to the stationary distribution. The theory is applied to semilinear stochastic heat equations with spatially correlated noise, a random polymer model, a nonlinear model with a divergence-free drift, and two coupled stochastic heat equations in contact with heat baths at different temperatures.

comments
69 pages, no figure
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2610.38166 ↗

We derive rigorous lower bounds on the ground-state energy of the coherently driven Bose–Hubbard model using a Lieb–Yamazaki positive-operator decomposition. The resulting quadratic bounding Hamiltonian is diagonalized by displacement and Bogoliubov transformations, yielding explicit stability conditions and finite-volume bounds in arbitrary dimension. We establish the thermodynamic-limit energy density and characterize the excitation spectrum of the bounding Hamiltonian. We also derive its Gaussian-state observables, including filling, number fluctuations, and second-order correlations, and identify regimes of antibunching and sub-Poissonian statistics. Numerical calculations assess the tightness of the bounds across representative parameter regimes.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.38464 ↗

We study nonlinear response of charge transport in relativistic kinetic theory within the relaxation time approximation. For a classical gas of massless charged particles coupled to an external $U(1)$ gauge field, we organize the Boltzmann equation perturbatively in the source and derive a recursive solution for the distribution function to arbitrary response order. At second order we analytically obtain fully retarded three-point correlators at generic frequencies and momenta, verify the Ward identities implied by charge conservation. We also discuss the general properties of these correlators, including their analytic structure, consistency limits, and relation to Schwinger–Keldysh effective theories of diffusive fluctuations.

comments
14 pages. Any questions and comments welcome
fields
Mathematical Physics
pdf ↗ page arXiv:2610.38571 ↗

For the first Painlevé equation, we relate three nonlinear Stokes maps associated with a full turn around infinity to modular transformations of the two-parameter tau function through the identity $\boldsymbol S_π\circ\boldsymbol S_0\circ \boldsymbol S_{-π}=\mathsf S\circ\mathsf T$. Here the subscripts label Borel directions, while $\mathsf S$ and $\mathsf T$ denote the modular generators. Working under the analytic assumptions of the topological recursion and exact WKB constructions, we compare Stokes multipliers of the associated isomonodromy system while tracking the homology basis of its elliptic spectral curve under rotations of the independent variable. For the sectors considered, we identify the known parameter transformation induced by an $8π/5$ rotation with the modular $T$-action and derive a new explicit parameter relation realizing the $S$-action for a $2π/5$ rotation. We also determine the multiplicative factors in the corresponding tau-function relations, including their normalization constants. Together, these results give an explicit realization of single-valuedness after one full turn around infinity for both the Painlevé transcendent and its tau function, with the tau-function prefactors cancelling by Abel's five-term identity for the Rogers dilogarithm.

comments
30 pages, 7 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.38584 ↗

We derive a relation between Goldbach representations and photon-number statistics in a quantum-optical setup. Considering an even-number Fock state injected into a stochastic beam splitter with uniformly distributed transmissivity and projections of the two output modes onto prime subspaces, we demonstrate that each successful outcome corresponds to an Goldbach representation and that the averaged detection probability is exactly proportional to the number of Goldbach representations. Then, employing the Hardy–Littlewood asymptotic formula, we demonstrate that the post-measurement state generated by a beam splitter with fixed transmissivity exhibits standard quantum limit scaling of the ultimate precision limit in terms of phase estimation, whereas an equally weighted superposition of Goldbach representations exhibits Heisenberg scaling. These results provide a quantum-optical realization of Goldbach representations and relate their statistics of with quantum metrology.

comments
6+6 pages, 3 figures
fields
Mathematical Physics, Number Theory
pdf ↗ page arXiv:2610.38675 ↗

Fuzzy sphere Hamiltonians for (2+1)D conformal field theories are usually written directly on the lowest Landau level. We introduce a framework organizing them as descendants of local ``mother theories'' on $S^2\times\mathbb R$. We start with the example of Ising mother theory built from two charged Dirac fermions coupled to a real mediator $φ$. Integrating out $φ$ and the higher Landau levels produces the fuzzy Hamiltonian, while integrating out the fermions gives a conventional local $φ$ effective field theory flowing to the Ising point. Mild modifications of the same theory reach the Gaussian point (tricritical route) and the Lee-Yang continuation. Exploring the space of mother theories, we next promote $φ$ to a complex field $Φ$ and construct a new example, whose descendant is an easy-plane ferromagnet on the fuzzy sphere. Its spontaneous symmetry breaking phase gives a pseudo-Goldstone relativistic scalar, similar to the model introduced by Y.-C. He, while its critical point is non-relativistic, providing the first example of $z=2$ scaling on the fuzzy sphere. Remarkably, it admits exact one-magnon solutions, and the $z=2$ critical point can be found analytically. We then outline a rich landscape of further applications of our approach.

comments
5 pages + references + a page of End Matter + 15 pages of Supplemental Materials; 3 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.38702 ↗

These six lectures, delivered at the University of New Brunswick 6-21 October 2026, are an introduction to instantons in quantum mechanics and quantum field theory for senior undergraduate and beginning graduate students. The first four lectures deal solely with particle mechanics, building the necessary background for the last two that cover applications in semi-classical field theory.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.38717 ↗

Deep lid-driven cavities contain strong motion beneath the lid and much weaker recirculation at depth, so agreement in bulk velocity is an incomplete assessment of a computed flow. We examine data-free physics-informed neural networks (PINNs) for steady, two-dimensional incompressible flow in a cavity of depth-to-width ratio five at Reynolds numbers 100, 250, 500 and 1000. An established hard-constrained streamfunction formulation is combined with prescribed regional collocation, transferred initialization, and selected residual-scaling and envelope variants. Independent spectral/$hp$ calculations with the same Gaussian-regularized lid provide the reference fields. For a cavity of depth-to-width ratio $D/W=5$ at Reynolds numbers $\mathrm{Re}=100$, 250, 500, and 1000, evaluation on a common $121\times605$ grid gives interior relative velocity discrepancies of 5.130\%--7.850\%. Over the same cases, floor-region relative velocity discrepancies remain below 5\%, with absolute RMS discrepancies ranging from $1.255\times10^{-10}U$ to $2.332\times10^{-9}U$, where $U$ is the lid-velocity scale. In a separate $161\times801$ assessment at $\Rey=1000$, the refined workflow lowers interior velocity discrepancy from 5.624\% to 2.658\% and gauge-aligned pressure RMS discrepancy from $2.793\times10^{-3}$ to $1.167\times10^{-3}ρU^2$. The improvements compare accumulated training workflows and do not isolate regional sampling. Configuration rankings depend on both region and observable. These finite-budget comparisons establish where the retained workflows agree with the reference and where rotational-field discrepancies remain substantial.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.38814 ↗

We establish a direct connection between the entanglement bootstrap and the Doplicher–Haag–Roberts theory of superselection sectors for two-dimensional quantum spin systems. Under the entanglement-bootstrap assumptions, we prove Haag duality and establish a one-to-one correspondence between simple entanglement-bootstrap anyon types and irreducible superselection sectors. For each fusion channel, we further construct an affine bijection from density matrices on the entanglement-bootstrap fusion space to normalized positive intertwiners in the corresponding operator-algebraic fusion channel. These results connect the entropic and operator-algebraic descriptions of anyons directly, without passing through exactly solvable lattice models.

fields
Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2610.38821 ↗

This paper studies the moduli space of "good" periodic Hamiltonians, i.e., periodic Hamiltonians with nondegenerate Floquet spectrum. The corresponding Floquet states determine a geometric model for the moduli space of such Hamiltonians. The model is expressed in terms of configuration spaces, flag manifolds, and principal bundles. A corollary of the main result is the complete determination of the rational cohomology ring of the space of good periodic Hamiltonians. The paper also considers the adiabatic driving of a 1-parameter family of good periodic Hamiltonians. We formulate two conjectures describing the resulting asymptotic quantum evolution. These are Floquet analogues of the adiabatic theorem in quantum mechanics.

fields
Mathematical Physics, Algebraic Topology, Differential Geometry
pdf ↗ page arXiv:2610.38845 ↗

Generalized symmetries are sensitive to the tangential structure of spacetime. We study this interplay for massless QED on oriented non-spin four-manifolds, where the photon becomes a spin$^c$ connection and the path integral sums over spin$^c$ structures. The shifted flux quantization extends the magnetic 1-form symmetry into a $w_2$-twisted 1-form symmetry: its $2π$ rotation acts as a gravitational sign, fixed by the normal bundle of the surface the operator wraps. The obstruction to treating it as an ordinary magnetic 1-form symmetry is an order-two mixed magnetic-gravitational anomaly, which is classified by reduced oriented bordism and detected on the Wu manifold. In a fixed spin$^c$ sector, this anomaly is removable by a counterterm, so it is a property of the sum over spin$^c$ structures. We discuss its consequences for gapped, Coulomb, and Higgs phases. The chiral anomaly is governed by the index of the spin$^c$ Dirac operator, so rational chiral defects carry gravitational as well as electromagnetic responses. A spin$^c$ Hall topological field theory cancels the electromagnetic part but leaves a framing anomaly. At the level of anomaly inflow, this is canceled for every rational angle by stacking a neutral, generally noninvertible Witten-Reshetikhin-Turaev layer. The same framing subtlety affects the chiral defects of QED on curved spin manifolds. The complex projective plane illustrates each of these features explicitly.

comments
53 pages + appendices = 80 pages, 10 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.38907 ↗

We study a translation-invariant BCS functional of superconductivity for a system of spin-$1/2$ fermions with spin-dependent chemical potentials, $μ_+\neqμ_-$. Numerical work of Caldas and Mota and analytical work of Freiji, Hainzl, and Seiringer has suggested an unusual first-order phase transition in spin-imbalanced BCS models, in which the normal state becomes globally unstable while remaining locally stable. Here, we prove that a first-order phase transition occurs in such spin-imbalanced BCS functionals. For each sufficiently small fixed spin imbalance and sufficiently low temperature, there is a coexistence coupling $λ_{\mathrm{fo}}$ strictly below the linear-stability threshold $λ_{\mathrm{lin}}$ of the normal state at which the Cooper pair density exhibits a nonzero jump and the minimized energy has a kink. The methodological insight is a coercivity estimate obtained by decomposing the BCS energy minimization into two parts, where the ``inner'' problem minimizes over the one-particle density matrices at fixed pairing and can be exactly solved by a Legendre–Fenchel transform.

comments
34 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.38961 ↗

We consider symmetric hyperbolicity and well-posedness in the context of natural equations, which are closed subobjects of jet bundles over natural bundles. We show how non-natural equations can be "naturalized", and we discuss how a precise version of "minimal coupling" offers a (provably unique, up to isomorphism) method for constructing natural equations from certain equations defined on a single manifold. We discuss how to define symmetrizers, hyperbolizations, and constraints for minimally coupled natural equations, and we show how these can be used to recover standard existence and uniqueness results, relative to any choice of background structure (a metric, for minimally coupled systems). Additionally, we show that minimal coupling and naturality together imply that the causal cones associated with a (first order, quasilinear, minimally coupled) naturally symmetric hyperbolic natural equation must always coincide with the metric lightcones, and that a certain rank-2 tensor, associates with a natural hyperbolization, must always be divergence free relative to the associated Levi-Civita derivative operator.

comments
19 pages
fields
Mathematical Physics, Analysis of PDEs, Category Theory, Differential Geometry
pdf ↗ page arXiv:2610.39107 ↗

We derive eigenstate comparisons from ordered Schrödinger operators, extending energy bounds to overlaps, spatial distributions and nodes. For three form-ordered operators with discrete comparison ground states, suppose the upper ground-state energy lies in the lower operator's ground-state gap. Three comparison spectral values then bound all three squared ground-state overlaps and guarantee a simple discrete intermediate ground state. Related gap estimates control low-energy subspaces and individual excited-state overlaps under additional gap conditions. In one dimension and radially, a single crossing of the potential difference relative to the energy shift orders ground-state likelihood ratios and monotone observables; a nondecreasing difference suffices. The results cover asymmetric wells and shortened right Dirichlet walls, with coordinatewise comparisons for submodular reference potentials and coordinatewise nondecreasing perturbations. A two-sided Sturm argument orders corresponding internal nodes for nondecreasing potential differences, even between orthogonal one-dimensional excited states. For Yukawa ground states, Hulthén comparisons bound overlaps, radial moments and the density at the nucleus; the latter two-sided bounds hold for screening $0<δ<2/\sqrt6$. Optimizing scaled Hulthén majorants gives a lower bound of approximately $1.13611$ for $n^2δ_c(n,0)$, where $δ_c(n,0)$ is the critical screening for the $n$th $s$-wave bound state. This bound is optimal within that two-parameter comparison family.

comments
16 pages, 2 figures, 1 table. Core numerical code: https://github.com/Hronrad/ordered-schrodinger-eigenstates
fields
Mathematical Physics
pdf ↗ page arXiv:2610.39136 ↗

Applying some simple rules, established in group theory literature, generated are codes (easy to modify as required) for obtaining $SU(3)$ irreducible representations (irreps) for a given number of nucleons in a given oscillator shell $η$ with $η\le 8$. In this approach, first the $SU(3)$ irreps are obtained for spinless fermions in a given $η$ shell. Using the codes developed, tables of $SU(3)$ irreps are generated for identical nucleons (protons or neutrons) with a given total spin $S$. Similarly, the $SU(3)$ irreps are generated for nucleons with a given spin-isospin $SU(4)$ irrep. Some applications of these tables for $η=4$ shell for $52 \le \mbox{Z,N} \le 78$ nuclei with proxy-$SU(4)$ symmetry are presented. Also, the procedure used for the shell model $SU(3)$ limits is easy to be extended for the $SU(3)$ limit of various interacting boson models and some examples for these are also presented.

comments
34 pages, 14 tables, 4 figures, article based on the talk given in SDANCA-2026 held in Sofia (Bulgaria) in September 2026
fields
Mathematical Physics
pdf ↗ page arXiv:2610.39357 ↗

We study higher genus polylogarithms associated with the D'Hoker-Hidding-Schlotterer (DHS) connection defined on families of Riemann surfaces of any genus with marked points. Under separating degenerations of Riemann surfaces, we show that the DHS connection can be constructed by gluing the Brown-Levin (BL) connections on elliptic curves and the Knizhnik-Zamolodchikov (KZ) connections on pointed Riemann spheres. Therefore, the associated higher genus polylogarithms can be described explicitly as power series in deformation parameters and their logarithms for the families of Riemann surfaces whose coefficients are expressed by multiple zeta values and elliptic multiple zeta values.

comments
19 pages, 4 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.39382 ↗

We derive analytic expressions for observable dynamics under the fully quantized trilinear Hamiltonian, governing quantum three-wave mixing and parametric amplification. Starting from a coherent pump and vacuum signal and idler, the calculation reorganizes the Heisenberg expansion into resummed depletion and return profiles, yielding directly evaluable expressions for all 1st-, 2nd- and 3rd-order correlations. The construction uses no parametric approximation or fitted parameters. Representative numerical benchmarks show errors of order $10^{-12}$ throughout the entire pump depletion, and below $10^{-3}$ across dozens of depletion-and-back-conversion cycles, up to the first total collapse of the oscillation. The first-depletion treatment additionally provides 4th-order correlations, accommodates bright squeezed-pump inputs and reveals phenomena important to future optical quantum technologies. The framework can be extended to higher moments.

comments
6 pages, 3 figures, plus 111 pages of Supplemental Material. MATLAB code and Python notebooks included as ancillary files
fields
Mathematical Physics
pdf ↗ page arXiv:2610.39387 ↗

The aim of this work is to define and investigate the generalized Jaynes-Cummings (JC) Hamiltonian by means of supersymmetric (SUSY) quantum mechanics methods. We have considered trigonometric and hyperbolic Pöschl-Teller (PT) potentials as two natural ingredients to modify the standard JC model. We show that these generalized JC Hamiltonians have a list of characteristics in common with the JC Hamiltonian, for example: matrix intertwining, excitation number symmetry, Rabi frequency, formulas for atomic inversion and classical and revival times. Therefore, we conclude that JC Hamiltonians can be considered as one example of a wider a class of generalized Hamiltonians which can be useful in broader interaction problems.

comments
19 pages, 4 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.39401 ↗

We construct generalized Frobenius structures on Hurwitz spaces of arbitrary genus using extended primary differentials. Through contour integrals involving the Cauchy kernel, we derive explicit dispersionless Lax representations for the principal hierarchies of these structures and their almost-dual counterparts. We also construct solutions to the open WDVV equations for both the original and almost-dual structures, and derive explicit principal hierarchies for the resulting rank-one extensions. Finally, we show that these constructions admit Shramchenko deformations.

comments
51 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2610.39411 ↗

We study one-dimensional quasiperiodic operators with $α$-Hölder monotone potentials and long-range hopping satisfying $|T(x,y)|\leq \varepsilon e^{-ρ|x-y|}$. Under an explicit smallness condition on $\varepsilon$, we establish uniform Anderson localization for such operators in the regime $ρ>αβ$, where $β$ is the exponential strength of frequency resonances. Our proof extends the arithmetic localization strategy for monotone quasiperiodic Schrödinger operators by Jitomirskaya and Kachkovskiy to the long-range setting, without relying on the Lyapunov exponent.

comments
Comments welcome
fields
Mathematical Physics, Dynamical Systems, Spectral Theory
pdf ↗ page arXiv:2610.39448 ↗

We formulate the static, spherically symmetric vacuum equations of power-law metric $f(R)$ gravity as a covariant autonomous system using the $(1+1+2)$ formalism. The finite critical sets include the scale-invariant Clifton–Barrow solution, a Minkowski endpoint shared by the Schwarzschild family, and degenerate boundaries of the normalized chart. The Clifton–Barrow equilibrium is an outward-radial attractor over a positive interval of the power-law parameter, whereas the Schwarzschild endpoint is a saddle of the polynomially extended system. Poincaré compactification, supplemented by secondary and weighted charts, resolves several asymptotic regimes. In particular, normally attracting sheets at large normalized curvature occur in the positive-curvature sector and are separated from the negative-curvature Clifton–Barrow equilibrium. Metric reconstruction also identifies a selected scalar-flat family with a regular throat, one asymptotically flat end, and a curvature-singular end. These results organize the regular reduced chart and the boundary regimes resolved here; they do not constitute a complete classification of static spherical vacua. All stability statements concern the static radial flow.

comments
17 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.39484 ↗

For Gaussian white noise the Itô and Stratonovich prescriptions differ by $O(dt)$ per time step, which accumulates into the familiar spurious drift $\tfrac12 D\,II'$. We show that for renewal shot noise with state-dependent gain, $\dot x=-C(x)-I(x)ξ[t]$ with $ξ[t]$ a train of Dirac spikes of finite random amplitude, the two prescriptions differ by a finite amount at every event, and that where $I$ vanishes the difference can become qualitative. The Marcus kick, the jump-process counterpart of the Stratonovich prescription, is the flow map of $dx/ds=I(x)$: no kick can cross a zero $x^\ast$ of $I$, for any jump and waiting-time statistics. The Itô kick is only the tangent map of that flow. For $I(x)=1+βx$ it crosses $x^\ast=-1/β$ if and only if $ξβ>1$ and collapses the whole line onto $x^\ast$ at $ξβ=1$; below threshold it is itself a Marcus kick with a remapped jump law. Bounded jump laws thus have a threshold, while unbounded ones leak across the barrier for \emph{any} parameters. The discrepancy cannot be absorbed into a renormalised drift beyond lowest order, and only the Marcus kick is generated by a single operator, which makes the master equation of Bianucci, Bologna and Mannella (2026) intrinsically Marcus. Numerically, the standard Heun kick is a second-order truncation of the Marcus map that preserves the barrier only because its order is even; it shortens every jump, biasing second moments in proportion to the squared jump amplitude and the jump kurtosis, and depleting the region near the barrier. We give the exact-flow integrator that replaces it.

comments
Submitted to FNL
fields
Mathematical Physics
pdf ↗ page arXiv:2610.39511 ↗

While universal approximation theorems theoretically underpin the representation capabilities of machine learning models, they have two shortcomings: They do not focus on efficient representations and they tend to be insensitive to depth and other heuristically important properties. In this work we show that these two shortcomings are intertwined. We prove that machine learning models which are deeper or have higher-order interactions can efficiently represent a larger set of functions, i.e. have larger efficient reach. It follows that deep Boltzmann machines (DBMs) have maximal efficient reach, restricted Boltzmann machines (RBMs) sub-maximal, and k-body generalizations of RBMs form a hierarchy between the two, even though all are universal. More generally, (i) we provide a full characterization of machine learning models with maximal efficient reach; (ii) we derive separations between deep and shallow models for three representation tasks; and (iii) we prove that the efficient reach of shallow models constitutes an infinite hierarchy indexed by the interaction order. The proofs draw on different methodologies, namely on (i) a recent characterization of universal spin models; (ii) computational complexity bounds for spin models; and (iii) communication complexity bounds applied to shallow models. This work shows that universal machine learning models can strongly differ in their efficient representation capabilities, and provides a theoretical foundation for heuristic observations.

comments
34 pages of main text + 32 pages of appendices, 14 figures, 2 tables
fields
Mathematical Physics
pdf ↗ page arXiv:2610.39731 ↗

For general central charge, we give a combinatorial formula and a geometric realization of the formal expansion of the rank-one Virasoro irregular conformal block of type $(0,0,1)$ at its irregular singular point. We realize the normalized block as a coefficientwise matrix element on the localized equivariant Hilbert–Fock space associated with Hilbert schemes of points on $\mathbb C^2$. At $c=1$, we prove the author's conjecture and express the parameter-independent coefficients in terms of skew-tableau numbers and Littlewood–Richardson coefficients, establishing their nonnegativity and integrality. The proof combines sectorial asymptotics of screening integrals with Laguerre–Jack evaluations. We express the screening kernel using the flow of a degree-raising differential operator and compute the Jack coefficients of its exponential from the one-box Pieri rule and the shifted Jack coefficient formula of Okounkov and Olshanski.

comments
33 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2610.39786 ↗

We provide an exact Egorov-type formula, given by a convergent expansion in the semi-classical parameter $\varepsilon > 0$, for the propagation of a certain class of analytic Wick observables with super-exponentially decaying coefficients, under the action of a time-dependent quadratic Hamiltonian. This work generalizes a result established by S. Breteaux for polynomial symbols, and includes the spatially cutoff $P(\varphi)_2$ model, as well as a variant of the Höegh-Krohn model.

comments
30 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2610.39806 ↗

The one-dimensional Ising chain with inverse-square interactions is a paradigmatic long-range system: it exhibits the unusual Thouless transition, with a discontinuity in the spontaneous magnetization, yet its full field-dependent thermodynamics remains unknown in closed form. We develop the high-temperature expansion of its free energy while retaining the dependence on a uniform magnetic field at every order. We prove that, after a natural rescaling of the coupling, each coefficient is a rational polynomial in the squared hyperbolic tangent of the reduced field. Remarkably, at each order $n$ the field-dependent free-energy coefficient of a finite, periodically repeated ring is an exact polynomial of degree at most $n$ in $L^{-2}$. The infinite-chain coefficient is its constant term and can therefore be reconstructed from $n+1$ finite rings without numerical extrapolation. Using this reconstruction, we determine the full field-dependent expansion through order 26: 26 polynomials containing 377 rational coefficient entries. We further derive exact formulas, valid at every order, for the coefficients of the two highest powers of the field variable using matching determinants and a cycle-Laplacian reduction. These results reveal an unexpected algebraic structure in the microscopic thermodynamics of the inverse-square chain and provide high-order information about its magnetic response.

comments
70 pages 1 figure
fields
Mathematical Physics
pdf ↗ page arXiv:2610.39815 ↗

In order to obtain the displacement field, both generally in the case of an arbitrary body force and specifically in the case of a conservative body force, the mechanical problem of statics of three-dimensional stress-gradient non-local medium is analytically solved on unbounded domain by considering a system of equations consisting of an equilibrium equation, infinitesimal strain, and both scalar- and tensor-type stress-gradient Eringen three-dimensional models. Since the system of equations is linear, for each model the solution is obtained in the form of a superposition of the local-type displacement field, common to each model, and the non-local-type displacement field, specific to the non-locality operator of the model. Among the three scalar-type and five tensor-type considered models, six distinct analytical displacement field expressions are obtained for an arbitrary body force: one expression specific to a scalar-type model, three specific to individual tensor-type models, while each of the remaining two expressions are common to one scalar- and one tensor-type model. The displacement vector fields are graphically represented in the case of gravitational body force, yielding five different models, since two tensor-type models become the same when the force is conservative.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.39888 ↗

These notes provide an introduction to Haagerup noncommutative $L^p$ spaces for quantum field theorists. The aim is to explain how the familiar calculus of density matrices, fractional powers, and Schatten norms extends to local observable algebras of type~III, where an intrinsic trace is unavailable. We develop the construction first for a matrix algebra, making the crossed product, its trace, and the dual action explicit, before passing to general von Neumann algebras. Particular attention is paid to the representation of normal states by Haagerup densities and to the distinction between the crossed-product trace and the canonical Haagerup functional used to compute expectation values. As a concrete application, we calculate the sandwiched Rényi divergence for a coherent excitation of a chiral current, verifying monotonicity under restriction and the Rényi quantum null energy condition at every real order $α>1$. The presentation assumes familiarity with quantum mechanics and elementary quantum field theory, while introducing the operator-algebraic concepts needed for the construction and calculation.

comments
43 pages, 1 figure
fields
Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2610.40174 ↗

We study an optimization inverse spectral problem (OISP) for a one-dimensional Sturm–Liouville operator on a finite interval. The problem is to find a potential $V \in L^p(0,1)$ that realizes a prescribed finite set $λ_1^* < λ_2^* < \dots < λ_m^*$ and has the smallest $L^p(0,1)$-distance from an a priori given potential $V_0 \in L^p(0,1)$. We formulate and prove results on the regularity of the isospectral manifold, the existence of an OISP solution, and an explicit analytic representation of the optimal potential by means of a power map applied to a linear combination of squared eigenfunctions. Using a unified differential-algebraic approach to squared eigenfunctions, we show that whenever these squares are linearly dependent, the corresponding potential can be expressed in terms of them and is an analytic function. For $p=2$, we prove that nondegenerate stationary points are isolated and that the number of global minima is finite provided that each of them is nondegenerate. For every $1<p<\infty$, we establish uniqueness for the first eigenvalue when $λ_1^*\geλ_1(V_0)$ and generic global uniqueness in the sense of Baire category in $L^p(0,1)$. A separate section provides examples with at least two global minima for $m=1,2$ in the presence of a sufficiently high finite symmetric barrier. We describe an iteration with frozen eigenfunctions and a local Newton–KKT method with continuation in the spectral data, and state explicitly the limits of their guarantees. The final part discusses applications of OISP theory to nonlinear boundary value problems and to applied problems of diagnostics and optimal spectral design of acoustic and electromagnetic resonators.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.40231 ↗

We prove that the three-dimensional chiral $\Z_p$ Clifford quantum cellular automata of Haah and of Sun–Yang–Wang–Tantivasadakarn–Chen are, for every odd prime $p$, not finite-depth quantum circuits, even after tensoring with arbitrary ancillary degrees of freedom and composing with translations. Previously such statements were known only inside the Clifford category. As a consequence, the group of three-dimensional QCA modulo stabilized circuits and translations is not finitely generated. The key ingredient is a new invariant of invertible subalgebras, which we conjecture to be the square of the total quantum dimension of the hosted anyon theory, modulo rational squares.

fields
Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2610.40235 ↗

In this article, we address the possibility of topological quantum spin liquids with only short-range (spin) correlations in the whole phase diagram in a ladder system, through an exactly solvable model which represents a generalization of the two-dimensional Kitaev honeycomb spin model to a ribbon geometry. This system gives rise to $\mathbb{Z}_2$ gauge fields emerging in a static way in the ground state through Majorana fermions which then produce either $0$ or $π$ flux. Through a quantum field theory perspective, mathematical and Density Matrix Renormalization Group results, we present our progress on the geometrical, topological and physical classification of this model through observables navigating on the whole phase diagram presenting three spin-liquid phases with a spin gap and a metallic phase in the sense of Majorana fermions. We propose a bulk-edge correspondence revealing the presence of protected zero-energy Majorana fermions at the edge in the phases with a gap and revealing also the presence of itinerant Majorana fermions in the bulk in the topological liquid phase. The proposed approach allows us to distinguish between properties of the brickwall ladder giving rise to a special line and those of the square ladder allowing for the gapless Majorana liquid phase. This model gives some hope on finding solutions for topological quantum spin models, e.g. with $π$ flux, on a square lattice geometry. This approach also allows for a correspondence onto models of topological superconductivity.

comments
23 pages, 12 Figures, To be Submitted to Reports on Progress in Physics
fields
Mathematical Physics
pdf ↗ page arXiv:2610.40297 ↗

We prove that weak long-range many-body interactions preserve the bulk gap of a free fermion system and that a quasi-local spectral flow transports the free ground state to ground states of the interacting system. Let $Φ_h$ be a free fermionic interaction, possibly including pairing terms, whose infinite-volume Majorana coefficient operator $h$ has no spectrum in $(-g,g)$, and let $\mathcal V$ be an even self-adjoint many-body interaction. For sufficiently small $|λ|$, we construct pure ground states $ω_λ$ of the interacting bulk system $Φ_λ=Φ_h+λ\mathcal V$ and quasi-local automorphisms $β_{0,λ}$ such that $ω_λ=ω_0\circβ_{0,λ}$, where $ω_0$ is the free ground state of $Φ_h$. Each $ω_λ$ has a GNS Hamiltonian with gap at least $g-C_*|λ| \|\mathcal V\|_*$, where $\|\cdot\|_*$ is the relevant interaction norm. Our result allows polynomial decay of both the free coefficients and the many-body interaction. For two-site interactions on a uniformly discrete point set $Γ\subset\mathbb{R}^d$, a sufficient condition is decay as $(1+|x-y|)^{-\varpi}$ with $\varpi>2d$, for both the hopping and pairing coefficients and the interaction terms. The spectral-flow generator preserves the spatial exponent of the polynomial interaction norm, and its automorphisms satisfy locality bounds at that exponent. If $h$ and $\mathcal V$ have stretched-exponential decay, so does the spectral-flow generator. The proof constructs the spectral flow and establishes the gap through an excitation-number comparison, using polynomial propagation bounds for evolved interactions proved in a companion paper.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.40299 ↗

It is well known that in the celebrated Cox-Ingersoll-Ross process for interest rates there exists a critical relation among the model parameters. In the present work, we explain this critical relation by studying the symmetries of the stochastic differential equation and compute the solution of the model using this symmetry. In this way we also recover results of a recent paper where this property has been studied within a broader context by analyzing the relationships among the symmetries of stochastic differential equations and their corresponding forward Kolmogorov equations.

comments
14 pages
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2610.40316 ↗

We extend the generalized transfer-matrix method introduced in [H. Ghaemi-Dizicheh, Phys.\ Rev.\ B \textbf{107}, 125155 (2023)] to one-dimensional spinful non-Hermitian tight-binding lattices with matrix-valued Abelian and non-Abelian gauge couplings. We derive a minimal channel-resolved transfer matrix and identify its eigenvalues with the generalized Bloch factors. The same transfer matrix determines the periodic- and open-boundary spectra, generalized Brillouin zone, skin localization, and finite-sample scattering conditions. In the Abelian limit, the model separates into fixed spin sectors, yielding exact spectral results and closed finite-length transport expressions in terms of Chebyshev polynomials. These results reveal bipolar spin-dependent skin localization and distinguish the reciprocal hopping scale, which governs poles, zeros, and reflectionlessness, from the directed-amplification factor controlling transmission asymmetry, transparency, and invisibility. For non-Abelian gauge fields, noncommuting link matrices coherently mix the spin sectors, such that four transfer eigenmodes jointly determine the non-Bloch spectrum and transport eigenchannels. We show that this mixing produces spin-hybridized lasing and coherent-perfect-absorption channels, Zeeman-tunable lasing thresholds, and direction-dependent reflectionless transport accompanied by pronounced spin conversion. The resulting boundary-condition criteria describe lasing, coherent perfect absorption, reflectionlessness, transparency, and invisibility, while identifying spin polarization and conversion as experimentally accessible signatures that distinguish Abelian from non-Abelian non-Hermitian transport.

comments
28 pages, 7 Figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.40317 ↗

Exceptional points (EPs), at which two quasinormal frequencies and their eigenvectors coalesce, can strongly enhance the spectral instability of black hole quasinormal modes. We investigate this behavior in Kerr–Newman spacetimes through pseudospectra and condition numbers for neutral massless scalar fields and coupled gravitoelectromagnetic (GE) perturbations. For the scalar field, we follow the $(\ell,m)=(1,1)$ spheroidal branch and derive the energy norm from the stress-energy tensor. For GE perturbations, we use a coupled four-field system equipped with a positive radiative energy. At the selected near-EP backgrounds, the condition numbers of both modes in the close pair exceed those of the two more-damped modes shown for comparison at the same background. Along a matched GE parameter path, the frequency splitting follows a square-root law and the condition numbers grow as the inverse square root of the distance to the EP. The pseudospectral contours resolve the transition from individual-mode sensitivity to the collective response of the pair. Within the discretized problems and energy norms considered here, these results quantify the amplification of spectral instability near EPs and provide a basis for studying their contribution to black-hole ringdown.

comments
12 pages + appendices, 6 figures, 5 tables
fields
Mathematical Physics
pdf ↗ page arXiv:2610.40323 ↗

We consider bulk-gapped fermion systems whose infinite-volume bulk is obtained by adding sufficiently weak even many-body interactions to a free Hamiltonian with spectral gap $g>0$, allowing polynomial spatial decay of both parts. We prove quantitative local determination of low-energy states: whenever another interaction agrees with the bulk interaction inside a finite or infinite region $U$, with bulk terms crossing its boundary unchanged or removed, all its states with excitation energies in $[0,3g/4]$ have local expectations close to those of the bulk ground state deep inside $U$. The error decays with the distance to the complement of $U$, independently of the interaction terms supported outside $U$ and of the chosen low-energy state. Quantitative local determination has strong consequences. (i) The bulk interaction has a unique algebraic ground state. (ii) A strong "local perturbations perturb locally" (LPPL) principle holds: arbitrary distant defects change local ground-state expectations only by a spatially decaying error. (iii) Low-energy excitations in finite samples remain localized near the boundary for all times, up to spatially decaying tails, uniformly over arbitrary even boundary terms. (iv) Correlations from deep inside $U$ to outside $U$ are small, with quantitative bounds in terms of spatial separation and distance to $U^c$. To prove local determination of low-energy states, we combine quasi-adiabatic transport of the free ground state to the interacting bulk ground state with a new condition, local excitation detectability (LED). A companion paper establishes gap stability and constructs the transport for weak interactions, while we prove LED at sufficiently weak coupling. The abstract theorem is nonperturbative and applies whenever the transport and LED hypotheses hold.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.40337 ↗

Escorted free energy simulations reduce dissipation with a flow field that follows the equilibrium distribution. A continuous flow, however, cannot transfer probability between metastable basins. We show that any escort then faces a variance floor set by the change in basin weights, and lift it by adding teleportation: jumps at a rate proportional to the driving rate. We derive the corresponding nonequilibrium identity, the zero-dissipation condition, and the minimal number of jumps it requires, and illustrate the gain on an exactly solvable model and a tilted double well.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.40428 ↗

Twinor theory is formulated as a spacetime-based counterpart to twistor theory using holomorphic reductive Cartan geometry modelled on complexified $(A)dS_4$. The fundamental spin-tractor bundle defines Dirac twinors, its symmetric powers define ladder twinors, and their extremal Lorentz components define chiral twinors. The general \textit{twinor field equation} is $D\mathbf Y=\mathbf J$. Its adjacent contractions and mixed divergence are constrained by source relations; no additional equation is imposed on its completely symmetric projection. On a flat torsion-free Lorentzian background, the adjacent equations with the mass-normalization source and vanishing additional contracted sources, together with vanishing mixed divergence, reproduce the massive \textit{Dirac–Fierz–Pauli system}; the massless chiral realization gives the zero-rest-mass equations. Within the fixed mass normalization, the reality condition yielding a positive real mass squared is the \textit{anti-de Sitter reality condition} on the particle scale, independently of the cosmological scale and background curvature. The mass-coupling phase is therefore present in the classical connection before quantization. Nonlinear gravity is formulated through the full adjoint curvature, with energy–momentum and spin currents specifying Einstein–Cartan dynamics without requiring an action. The adjoint Bianchi identity constrains source compatibility, while a BGG-type sequence organizes torsion-free infinitesimal deformations. Matter interactions enter through the coupled connection and contracted source relations, with curvature compatibility recorded by $D\mathbf J=\mathcal F_D\mathbf Y$. Both chiralities are retained, and the additional consistency requirements for interacting higher-spin fields are distinguished from the underlying bundle construction.

comments
21 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2610.40435 ↗

Newton's law of universal gravitation describes the attraction between two masses through an inverse-distance potential. In Einstein's theory gravity gravitates: each mass reshapes the spacetime geometry through which the other acts. More than a century later, extracting the two-body interaction from this coupled geometry remains a fundamental analytical challenge. Even without motion or radiation, the static sector of the interaction harbours an infinite hierarchy of field couplings: the purest laboratory for gravitational non-linearity. Here we determine the static interaction from ninth to twelfth order in Newton's constant for arbitrary mass ratios, and derive a closed expression for the first backreaction beyond the Schwarzschild test-body limit to all orders in the gravitational coupling. We achieve both advances by formulating the problem around the stationary interaction energy. An exact one-body background resums one source's self-interaction, stationarity reduces the fields required from the other, and integrated response identities reveal cancellations across the coupled modes. Complementary expansions then resolve the complete mass dependence at finite order. Together, these results bridge the gap between an infinitesimal probe and comparable masses, exposing hidden analytical simplicity within Einstein's theory and providing essential building blocks for modelling orbital dynamics and gravitational-wave generation.

comments
22 pages, 5 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.40462 ↗

The celebrated Evans–Searles, respectively Gallavotti–Cohen, fluctuation theorem concerns certain universal statistical features of the entropy production rate of a classical system in a transient, respectively steady, state. In this paper, we review and compare several possible extensions of these fluctuation theorems to quantum systems. We present, in an introductory way, the approach proposed in a recent series of works [Lett. Math. Phys. 114, 32 (2024): doi:10.1007/s11005-024-01777-0], [Rev. Math. Phys 38, 2461006 (2026): doi:10.1142/S0129055X24610063], [Commun. Math. Phys. 406, 201 (2025): 10.1007/s00220-025-05360-z] and [J. Math. Phys. 67, 022101 (2026): doi:10.1063/5.0311182] including a previously missing extension of the Gallavotti–Cohen (steady state) version of the FT to two-time measurement entropy production in the algebraic setting of quantum dynamical systems. We focus on the open quantum systems, where a small system interacts with several (infinitely extended) reservoirs, and discuss the following approaches: naive, two-time measurement, phase space contraction and ancilla state tomography. We review the connection with modular theory. The latter provides a way to extend the classical notions to the quantum domain. We discuss the quantum version of the principle of regular entropic fluctuations, introduced in the classical context in [Nonlinearity 24, 699 (2011): doi:10.1088/0951-7715/24/3/003]. Finally, we relate the statistical properties of these various notions of entropy production to spectral resonances of quantum transfer operators and apply this approach to a paradigmatic model of non-equilibrium statistical mechanics: the spin-fermion model. The results presented here shed a new light on the nature of entropic fluctuations in quantum statistical mechanics.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.40463 ↗

We show that the ensemble of unimodular Gottesman$-$Kitaev$-$Preskill distributions fails to form a rigged quantum $3$-design and quantify the replica defect that determines this failure. This is established by rederiving a second moment formula for symplectic lattices in a self-contained manner.

comments
Comments welcome!
fields
Mathematical Physics, Number Theory
pdf ↗ page arXiv:2610.40481 ↗

We study antiferromagnetic spin systems on random regular graphs through the lens of the phase transitions characterized by the complex zeros of the partition function. Our motivating examples include the hardcore model and the antiferromagnetic Potts model (including proper $q$-colorings at $β=0$). For both models on random $d$-regular graphs, we establish, with high probability over the graph, zero-free regions throughout the interior of the replica-symmetric regime. Asymptotically, this regime extends up to tree occupation density $$α< α_{\mathrm{RSB}}(d) = (2\log d - 2\log\log d + 2 - 2\log 2 + o_d(1))/d$$ for the hardcore model and up to degree $$d < d_{\mathrm{RSB}}(q) = (2q-1)\log q - 2\log 2 + o_q(1)$$ for proper $q$-colorings. Leveraging the standard algorithmic implications of zero-freeness, we obtain deterministic polynomial-time algorithms that multiplicatively approximate the corresponding partition functions at fixed rational parameters throughout this regime, with high probability over the graph. Our algorithmic guarantees significantly improve upon prior work and extend beyond the parameter ranges reached by previously known search algorithms. To establish our results, we first develop reinforced small subgraph conditioning, which resolves short-cycle fluctuations in the complex plane by lifting classical small subgraph conditioning on random regular graphs to random holomorphic functions. Second, we overcome the standard second-moment barrier caused by the exponential blowup of the bare second moment inside the replica-symmetric phase, by showing that replica symmetry implies a nonpositive Bethe functional and upgrading planted overlap concentration to an exponentially small bound, which enables a typical-graph truncation that controls complex second moments up to the replica symmetry breaking threshold.

fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2610.40510 ↗

Seven-dimensional supergravity provides holographic access to strongly coupled six-dimensional superconformal theories through its highest-dimensional supersymmetric AdS vacua. Its unique spinor-bilinear geometry and massive higher-form dynamics make systematic analysis and solution-finding distinctively challenging. Relative equivariant localization can obtain supersymmetric observables in odd dimensions from fixed-point data on an auxiliary even-dimensional filling, without an explicit solution. We extend this approach to seven dimensions in maximal Cartan-gauged supergravity with all gauge fields active. We formulate the Euclidean action and Killing-spinor equations in terms of field strengths, and construct a bilinear system adapted to the change in spinor reality conditions from symplectic-Majorana to Majorana. On the non-null gauged active spinor branch, independent, oppositely R-charged spinors are paired by Majorana conjugation on the same complex background. One algebraic gauging correction and two algebraic bilinear projections suffice to extend the equal-charge sector to independent Cartan charges, and the underlying efficient reorganization also applies in the Lorentzian theory. Massive 3-form self-duality fixes the quartic anomaly class and determines the higher-form fixed-point datum from Abelian moment maps. Localization at the single fixed point of the filling recovers the general supersymmetric AdS$_7$ black-hole action, without extending the solution. We prove gauge-covariant Killing-spinor invariance under the combined supersymmetric Killing flow and R-symmetry action, deriving the linear chemical-potential constraint. Extremizing the constrained entropy functional and requiring real positive stationary entropy yields the nonlinear charge relation within the Euclidean analysis, equivalent to Lorentzian horizon extremality for the known spherical black-hole family.

comments
38 pages
fields
Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2610.40514 ↗

We develop an algebraic theory of fusion, mobility, and statistics in abelian gapped fracton orders and topological phases. The framework generalizes the algebraic description of abelian anyons to systems with restricted-mobility and spatially extended excitations. We consider translation-invariant bosonic systems whose pointlike and extended excitations have finite fusion order. The basic objects are braided fusion complexes (BFCs): chain complexes encoding fusion and mobility, equipped with a braiding chain map encoding statistics. Their equivalence classes define braided fusion theories (BFTs). Our framework encompasses arbitrary translation-invariant Pauli codes, as well as all abelian anyon theories in two spatial dimensions, including chiral theories. We give evidence for the conjecture that every nondegenerate BFT can be realized as the excitation theory of a gapped phase and that the BFT describing such a phase is a phase invariant. We derive constraints on pointlike fusion and mobility, showing, for example, that neither the Pauli X nor Z sectors of the X-cube and anisotropic models can occur alone in a nondegenerate BFT. For nondegenerate theories with only pointlike excitations, we extract a simpler theory of mutual statistics, consisting of a fusion module and a map to its statistical dual. This theory of mutual statistics is an invariant of the BFT and, at odd fusion order, gives an equivalent description of the full braided fusion theory. We interpret remote detection as the generalization of mutual statistics to fracton orders. In the BFC setting, we give a precise formulation of the excitation-detector principle: every nontrivial excitation can be detected by an operator supported at spatial infinity, and every nontrivial detector detects some excitation. Assuming a unique infinite-space ground state, we prove that this principle is equivalent to nondegeneracy.

comments
81 pages + 73 pages of appendices. 7 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.40596 ↗

We give the first polynomial-time algorithm to estimate the partition function of the antiferromagnetic Ising model on the uniformly random $d$-regular graph to arbitrarily high accuracy for all inverse temperatures up to the Kesten-Stigum threshold. This is the entire regime in which the model is "replica symmetric," and is conjectured to be optimal for polynomial-time counting and sampling. To achieve our algorithmic result, we establish the absence of Fisher zeros for the partition function in a constant-width strip around the interval from $0$ up to the Kesten-Stigum threshold, with high probability over the randomness of the input graph. AI Disclosure: The overarching vision and proof architecture were developed solely by the authors without AI input. GPT 5.5 Pro was used, with extensive guidance from the authors, for only a few minor technical aspects of the proof. The authors independently verified correctness and wrote everything by hand. We take full responsibility for its contents. A more detailed statement can be found in Section 1.2.

comments
98 pages
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2610.40598 ↗

Efficient control of quantum devices requires the knowledge of their environmental noise, yet the commonly measured power spectrum does not fully characterize non-Gaussian fluctuations of realistic environments. Here we show that exceptional points (EPs) in the noise-averaged dephasing response can expose observable signatures of non-Gaussian statistics, distinguishing environments with identical lower-order statistics. We also introduce a theoretical model that describes dephasing environments in terms of identical independent noise sources while preserving the power spectrum. Given a calibrated single-source model, the largest EP order extracted from the measured dephasing response determines the number of sources and predicts the higher-order statistics of the combined noise. We illustrate an atomtronic readout that maps distinct EP signatures onto an evolving ensemble-averaged atomic interference pattern. Our results connect non-Hermitian dynamics to environmental noise statistics, providing a route to characterize noise in quantum devices used in computing, metrology, and precision measurement.

comments
Comments are welcome
fields
Mathematical Physics
pdf ↗ page arXiv:2610.40612 ↗

Numerical Analysis57

Physics-Informed Neural Networks approximate the solution of boundary value problems by minimizing the strong-form residual, their accuracy is often limited near corner and crack singularities, sharp layers and localized features and the enforcement of Neumann boundary conditions remains challenging. In hp-Variational Physics-Informed Neural Networks, the problem is formulated in a Petrov-Galerkin weak form, reducing the differentiation order applied to the neural network, while boundary constraints are imposed through penalty terms. The variational residual is evaluated using fixed Gauss quadrature points and the strong-form residual on a fixed collocation set, which may fail to capture regions of rapid variation. To address this issue, we integrate hp-Variational Physics-Informed Neural Networks with Residual-based Adaptive Refinement. During training, the strong-form residual is computed on a dense candidate pool and points with the largest residuals are added adaptively to the collocation set. Since the weak formulation is defined in $H^{1}(Ω)$, it avoids the $H^{2}(Ω)$ regularity requirement that fails on cracked and non-convex domains. The proposed method is validated on four two-dimensional elliptic problems and consistently achieves substantial reductions in relative $L^{2}$, absolute $L^{\infty}$ and relative $H^{1}$ semi-norm errors through adaptive residual-driven point placement.

comments
22 pages, 5 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.37670 ↗

In this paper, we propose and analyze a new skew-symmetric Nitsche-augmented mixed scheme for the generalized Oseen equations with non-solenoidal convective fields, subject to mixed boundary conditions. The scheme is based on a continuous pseudostress-velocity augmented dual-mixed finite element formulation, in which the Dirichlet datum is imposed naturally, whereas the prescribed normal trace of the pseudostress is incorporated into the $H(div,)$ stress space. We establish the well-posedness of the continuous formulation by means of a classical lifting argument and its corresponding homogeneous problem. The essential boundary condition is then weakly enforced in the discrete scheme through suitable stabilizing Nitsche terms. We establish the existence and uniqueness of the solution to the discrete scheme, allowing the use of general conforming approximation spaces for both the pseudostress and the velocity. Moreover, in the case of homogeneous Dirichlet boundary conditions and general Neumann data, we establish the stability of the Nitsche scheme. Under mild regularity assumptions on the exact solution, we prove optimal convergence rates in an energy norm. Finally, numerical experiments in two and three dimensions confirm the theoretical convergence rates and assess the performance of the proposed scheme for non-solenoidal convective fields and solutions exhibiting boundary layers.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.38032 ↗

This paper develops and analyzes an energy-based discontinuous Galerkin method for the Westervelt equation in the acoustic-velocity-potential formulation with spatially varying material parameters and nonlinear absorbing boundary conditions. The semi-discrete scheme is constructed from the underlying energy balance and incorporates an additional consistent term to accommodate the strong damping operator within the discrete energy framework. Numerical fluxes are designed at both interelement and physical boundaries to provide a unified treatment of interior and boundary dissipation. For the nonlinear analysis, we study an auxiliary variable-coefficient linearized problem and establish stability and a priori error estimates, including the additional terms induced by the solution-dependent absorbing boundary flux. These estimates are combined with a fixed-point argument to prove existence, uniqueness, and convergence of the nonlinear semi-discrete approximation under suitable regularity, smallness, and nondegeneracy assumptions. Numerical experiments confirm the theoretical convergence results and illustrate the performance of the proposed method.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.38058 ↗

Electrical impedance tomography (EIT) reconstructs the conductivity inside an object from voltage and current measurements on its boundary. The resulting inverse problem is nonlinear and severely ill-posed. Neural networks offer a flexible computational approach, but training physics informed neural networks for EIT and relating their training loss to reconstruction accuracy remain challenging. We develop a novel constrained neural stream function method for planar EIT with Lipschitz conductivities. The method builds the conductivity constraints and prescribed boundary voltages into the neural trial functions and replaces the second order conductivity equation with a first order system in strong form. The measured current is also used to construct a fixed baseline for the stream function. For this formulation, we derive error estimates that relate the sampled neural objective to errors in the physical boundary currents and the reconstructed conductivity. The error estimates separate the contributions from neural approximation, measurement noise, and sampling. Numerical experiments further demonstrate that the proposed method achieves high reconstruction accuracy with both exact and noisy boundary data.

fields
Numerical Analysis, Analysis of PDEs
pdf ↗ page arXiv:2610.38064 ↗

High-dimensional partial differential equations (PDEs) remain challenging for spectral methods due to the exponential growth of multidimensional coefficient spaces. We propose TensorSpectra, a low-rank spectral framework that directly parameterizes spectral coefficient tensors in canonical polyadic (CP) form, reducing representation complexity from $\mathcal{O}(N^d)$ to $\mathcal{O}(dNr)$. TensorSpectra combines structure-preserving spectral calculus, de-aliased nonlinear interactions, operator-aware residual weighting, and progressive low-rank corrections to enable efficient PDEs solving in compressed coefficient space. We further establish a theoretical framework connecting spectral truncation, low-rank approximation, and optimization errors. Extensive experiments across five PDE families and 24 benchmark configurations demonstrate State-Of-The-Art accuracy among five representative baselines, with TensorSpectra consistently achieving the lowest relative $L^2$ errors. More broadly, our findings offer a new perspective on high-dimensional PDEs solving, suggesting that exploiting intrinsic low-rank structure in spectral coefficient space provides a viable alternative to conventional physical-space approaches.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.38087 ↗

Randomized numerical linear algebra (RNLA) has fundamentally changed the landscape of scientific computing over the last twenty to thirty years. While early breakthroughs focused primarily on low-rank approximation and least-squares problems, randomized techniques are now used to solve a broad range of linear algebra problems, supporting applications spanning data science, optimization, and computational engineering. This paper surveys some of the main ideas of RNLA, focusing on methods that are effective in practice and on simple theoretical bounds that can be used to understand them. We highlight the core benefits of randomization: improved scalability, algorithmic simplicity, and—contrary to what the name may suggest—remarkable reliability and numerical stability. Topics include sketching, low-rank approximation, least squares, orthogonalization and approximate orthogonalization, randomized Krylov subspace methods, preconditioning, trace and spectral density estimation, row and column selection algorithms, posterior error estimation, randomized regularization, and tensor-structured randomness.

comments
186 pages; to appear in Acta Numerica
fields
Numerical Analysis
pdf ↗ page arXiv:2610.38157 ↗

Multi-fidelity learning uses low-fidelity information (coarse-scale PDE models) together with limited high-fidelity data (fine-scale solutions) to obtain high-accuracy PDE solutions. It is a data-driven approach to downscale reduced-order models to solve PDEs efficiently and accurately. Standard multi-fidelity learning focuses on one operator or PDE; given a new PDE, retraining using additional coarse-fine solution pairs may be required, which is costly. In this work, we propose an in-context multi-fidelity learning framework for learning multiple multi-fidelity operators with one shared model. The model is trained using paired low- and high-fidelity examples as demonstrations from multiple operators, together with a new coarse-scale solution query, to predict the corresponding fine-scale solution. Once trained, given a new PDE operator, a few (fewer than five) coarse-fine demonstration pairs, and a low-cost coarse query, the model predicts the corresponding fine-scale solution without fine-tuning. When the target operator appears in the training dataset but has a different prediction goal, such as predicting beyond the training time interval, no additional demonstrations are needed. Instead, the model uses training coarse-fine pairs from that PDE and information from other training operators. Testing then only requires generating a low-cost coarse-scale solution query, without fine-tuning. Notably, our smallest model contains only 255,364 trainable parameters, corresponding to approximately 456 parameters per training operator for 560 operators.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.38179 ↗

In this paper, we propose and analyze two novel structure-preserving projection schemes for the incompressible miscible displacement problem in porous media. These schemes are specifically designed to preserve two essential physical properties–concentration bounds and the mass balance identity, and are accompanied by a rigorous error analysis for the projection approach. Both schemes are second-order accurate in space but differ in temporal accuracy: one is first-order and the other is second-order. Methodologically, both schemes comprise a prediction step for the concentration variable, based on a second-order modified upwind discretization together with an implicit-explicit finite difference approximation, followed by a projection (or correction) step that enforces the desired physical constraints, namely bounds and mass conservation. For the first-order temporal scheme, the velocity and pressure are solved at the first step on staggered spatial grids with explicit treatment of concentration. In contrast, for the second-order scheme, to ensure well-posedness and to suppress non-physical oscillations in the simulation, the velocity and pressure are solved at the final step with the concentration treated implicitly. A rigorous numerical theoretical framework is established for the first-order scheme, encompassing optimal-order error estimates, stability, and proofs of the existence and uniqueness of the numerical solutions. The numerical analysis framework is further extended to the more involved second-order scheme, and the corresponding theoretical results are briefly outlined. Finally, numerical examples, including some 'real' simulations, are presented to verify the theoretical findings and demonstrate the strong performance of the proposed schemes. In particular, the occurrence of viscous fingering is successfully captured and confirmed by the numerical results.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.38219 ↗

We introduce a damped variant of the stochastic mirror descent method for systems of non-smooth nonlinear ill-posed operator equations in Banach spaces. At each iteration, the method samples a random subset of the equations, performs a mirror-descent step in the dual space with an adaptive step size derived from the discrepancy principle, and applies a damping term that prevents the iterates from drifting away from the initial guess. The scheme accommodates non-smooth forward operators through a family of bounded linear surrogates, admits general $p$-convex penalty functionals which also includes trained convex penalty, allows the noise level to differ from equation to equation, and dispenses with two classical requirements, namely reflexivity of the image space and Gâteaux differentiability of the forward operator. We study its regularization properties under an \textit{a posteriori} stopping rule by proving first that the iteration terminates after finitely many steps almost surely, and then that the mean-square error of the iterates tends to zero as the noise level vanishes. Numerical experiments on a system of non-smooth semilinear inverse source problems and the identification of a diffusion coefficient confirm the theoretical analysis and shows improved convergence results.

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

Physics-informed holomorphic neural networks (PIHNNs) exploit complex-analytic representations to satisfy homogeneous PDEs by construction, but their extension to nonhomogeneous problems is nontrivial. We propose a hybrid physics-informed holomorphic neural network (HPIHNN) framework based on a decomposition of the solution into particular and homogeneous components. The particular component is computed by a spectral method on a simple extended domain, while the homogeneous component is approximated by a PIHNN trained only on the boundary with modified boundary data. The resulting formulation avoids meshing complex geometries and retains the dimensionality-reduction advantage of holomorphic representations. The method is applied to nonhomogeneous Poisson, Stokes, biharmonic, linear elasticity, and Helmholtz equations. Numerical experiments covering complex geometries, corner singularities, and nearly incompressible regimes demonstrate that the proposed method accurately resolves the corresponding solutions and, in the considered tests, generally achieves lower errors and shorter training times than standard PINNs. The results indicate that coupling spectral particular solutions with holomorphic neural approximations provides an efficient approach to nonhomogeneous PDEs on complex domains.

comments
34 pages, 14 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.38269 ↗

We present a hybrid CutFEM–IFEM method for 2D Poisson problems with an immersed fluid–fluid interface and an embedded fluid–solid interface on a single unfitted mesh. The proposed method leverages the strengths of both unfitted finite element methods and immersed interface techniques to handle complex interface geometries and strong discontinuities efficiently. A composite equivalent polynomial representation of the Heaviside and Dirac delta functions is used to integrate on triply-cut cells. Moreover, the IFEM basis functions are enriched with the lift functions exactly representing solution and flux jumps. Numerical examples show optimal convergence for linear and quadratic elements, with accuracy comparable to that of a mesh fitted to both interfaces.

fields
Numerical Analysis, Mathematical Physics
pdf ↗ page arXiv:2610.38271 ↗

A novel Data-driven STochastic Asymptotic Regularization (\texttt{D-STAR}) method is proposed for solving linear and nonlinear ill-posed inverse problems, which incorporates a data-driven drift and a stochastic diffusion mechanism. Both known and unknown noise level cases are accommodated by the method, thereby making the framework applicable to a broader range of practical inverse problems. For known noise level, a modified discrepancy principle is employed, whereas for unknown noise level, a heuristic stopping rule based solely on noisy data is developed. For each stopping rule, an appropriate diffusion term is defined and the well-posedness of the associated stochastic differential equation is demonstrated. The finite termination of \texttt{D-STAR} method under both stopping rules is established and its convergence to the exact solution in the noise-free setting is proved. For the noisy data, stability and the regularization property in the mean-square sense are further established. In addition, the uncertainty quantification of the proposed method and its comparison with the Stochastic Asymptotic Regularization (\texttt{SAR}) method under both rules are provided. Furthermore, it is shown that local minima arising in the Data-Driven Iteratively Regularized Landweber (\texttt{DDIRLI}) method may be escaped. Finally, detailed numerical experiments, including comparisons with existing \texttt{DDIRLI} and \texttt{SAR} methods, are presented on X-ray computed tomography and nonlinear schlieren tomography for both stopping rules, thereby demonstrating the performance of \texttt{D-STAR}.

fields
Numerical Analysis, Probability
pdf ↗ page arXiv:2610.38279 ↗

In many inverse problems, evaluating the forward operator is computationally expensive, making it common practice to accelerate inference with a less costly approximate model. However, such approximations introduce unwanted bias and must be carefully accounted for to ensure the reliability of the solution. This phenomenon is particularly pronounced in Bayesian inference, where accurate posterior characterisation typically requires a large number of forward model evaluations. In this paper, we focus on the approximation error model (AEM), which compensates for the modelling error by adjusting the likelihood density. More precisely, AEM incorporates the model error into the additive Gaussian noise distribution. A central challenge in this approach is how to choose the modified noise mean and covariance in a principled way. To address this, we propose a new framework, optimal approximation error (OAE) which determines the noise model by minimising the expected information loss, measured via the Kullback-Leibler (KL) divergence between the true and approximate posterior distributions. We show that the standard enhanced error approach (EEA) is recovered as the minimiser of the expected divergence between likelihoods rather than posteriors and develop OAE as a direct alternative targeting posterior accuracy. We establish bi-convexity of the OAE objective, introduce a regularised, provably convergent proximal alternating minimisation scheme, and derive closed-form expressions in the Gaussian linear setting. We further show that OAE estimates computed from empirical training data are statistically consistent. Numerical experiments on a linear CT problem and a nonlinear Darcy-flow problem show that OAE improves posterior accuracy relative to both the uncorrected and EEA-corrected likelihoods.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.38434 ↗

Recent advances in hardware architecture have highlighted the importance of reduced-precision arithmetic for improving performance and reducing energy consumption in large-scale scientific applications. However, uniformly low-precision methods can suffer from numerical instability, especially in fundamental linear algebra routines. Mixed-precision strategies therefore play an important role in balancing efficiency, stability, and accuracy. In this paper, we focus on the block Householder QR decomposition using the WY representation and study its behavior in reduced- and mixed-precision settings. Starting from a uniform half-precision variant, we show that performing norm computations with fp32 accumulation is necessary to avoid overflow and underflow on large matrices. Based on this observation, we introduce mpWYQR, a mixed-precision algorithm that increases the precision of only selected computations and avoids most of the precision conversions required by the existing mixed-precision blocked QR algorithm (mpBQR3) introduced in [L. M. Yang, A. Fox, and G. Sanders, SIAM J. Sci. Comp., 43.3 (2021), pp. A1723–A1753]. Our analysis shows that mpWYQR accuracy is governed by low-precision unit roundoff, and that its error bound exceeds that of mpBQR3 by only a constant factor, with identical heuristic bounds. In experiments across a range of matrix sizes and condition numbers, we show that mpWYQR retains mpBQR3 accuracy while running up to $18\times$ faster and using less memory. We also discuss the performance cost of computing inner products in higher precision, and the library support needed for an efficient GPU implementation.

comments
22 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2610.38537 ↗

Feedback delay networks (FDNs) are recursive filter structures used to synthesise artificial reverberation. Their feedback matrix governs both energy exchange between delay lines and the computation required at every sample, making its design central to balancing an FDN's acoustic performance and implementation efficiency. In this work, we develop an FDN-specific structured pruning method that connects these acoustic and computational concerns, allowing high-order dense orthogonal designs to be fitted to efficient implementations. The feedback matrix is replaced by stages of fixed permutations and small orthogonal blocks. We characterise connectivity growth with the network depth and derive exact conditional block updates for matrix fitting, followed by refinement against the reference FDN magnitude response. The resulting factors admit direct vectorised evaluation, with arithmetic cost and coefficient storage scaling linearly with network size for fixed block size and depth. On an Apple M2, the selected staged kernels achieve feedback-multiplication speedups over dense BLAS ranging from approximately threefold to over twentyfold across the tested network sizes, while substantially reducing coefficient storage. Objective metrics and listening tests indicate that the proposed staged approximations closely preserve the spectral and temporal character of their dense references. An analysis of processor utilisation and register reuse explains why execution time depends on more than the operation count. Finally, block size and depth provide practical control over response fidelity, storage, and real-time cost, allowing acoustic design to precede the choice of an efficient implementation.

comments
11 pages, 8 figures, 4 tables. Submitted to the IEEE Open Journal of Signal Processing
fields
Numerical Analysis
pdf ↗ page arXiv:2610.38768 ↗

Geometric Volume-of-Fluid (VOF) on unstructured polyhedral meshes reconstructs the interface orientation from the volume fractions of a stencil of neighbours; on irregular cells and in the presence of wisps it degrades, and the curvature built on it drives the parasitic currents of capillary flows. We transport, consistently to the volume fraction of every cell, the wetted fraction of every face area. From the area and volume fractions, closed-form equations recover the interface normal and position of a cell, for the first time in VOF: the normal from one sum over the cell's own faces, the divergence theorem on the liquid sub-volume, and the plane's position from a second, without neighbours or iteration. Both identities are exact for a plane on hexahedral, perturbed and polyhedral cells. On a sphere and an ellipsoid the normal has the order of the face fractions, the position is second order for every state and mesh, and a quadric through one ring of recovered normals gives a converging curvature where the reference models show none. Transported with the plane clipping, the ring normal, the same identity on the union of the cell's ring, stabilises the state and carries a sphere over 3.3 diameters bounded and conservative, first order in the face fractions as the clipping law predicts, at plicRDF's position and shape errors. A preliminary transport implementation with one paraboloid per cell, its frame from the normal, its curvature tensor from the ring and its position from the volume fraction, carries the sphere bounded and conservative over the resolution ladder with face fractions of order 2.8 per period with the exact normal and 2.1 with the ring quadric's normal over N = 32 to 128. The loop has the order of the normal it is fed; a transported normal of second order is the research goal. This document is the basis on which the further development of the method is documented.

comments
45 pages, 9 figures, 18 tables. Code: https://github.com/tmaric/TwoPhaseFlow (branch davof) and https://github.com/leia-openfoam/leia (branch development)
fields
Numerical Analysis
pdf ↗ page arXiv:2610.38863 ↗

We resolve Kroó's 2004 conjecture on homogeneous polynomial approximation in every dimension, without smoothness or curvature assumptions. For every origin-symmetric convex body $K\subset\mathbb R^d$ with nonempty interior, every continuous real function on $\partial K$ is uniformly approximated by sums of homogeneous polynomials of degrees $n$ and $n+1$ as $n\to\infty$. Moreover, approximation of the constant function by homogeneous polynomials of degree $2n$ is uniform over all such bodies in each fixed dimension. Via homogenization, we also resolve Kroó's 2019 weighted approximation conjecture for every convex admissible weight on Euclidean space. The key construction produces homogeneous polynomials with a common Gaussian boundary profile and localization errors controlled by arbitrary polynomial weights. Its analytic core is a weighted Gaussian approximation theorem: for \(d\ge2\), sufficiently broad Gaussians on $\mathbb R^{d-1}$ can be approximated by $e^{-f}F$, where $f$ is nonnegative, convex and Lipschitz with $f(0)=0$, and $F$ is a Schwartz function with Fourier support in an arbitrarily small ball about the origin. Small Fourier support allows Taylor truncation to a lower degree, while the remainder enforces decay through homogenization. We then use positive spherical quadrature and degree raising to yield the full approximation theorem.

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

Anisotropic error estimates are determined for the $L^2$-orthogonal projection onto discontinuous finite element spaces in two and three dimensions. These estimates are determined in $W^{m,p}$-seminorms, in which $p \in [1,\infty]$ and $0 \le m \le k+1$, where $k \ge 0$ is the polynomial degree. The analysis relies on a geometric condition that is equivalent to the maximum angle condition. As an application, an apriori error analysis is presented for a hybridizable discontinuous Galerkin discretization of the Poisson problem on two and three dimensional anisotropic meshes.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.38892 ↗

In variable-step operator learning, agreement at observed step sizes does not by itself determine predictions at other temporal resolutions. We propose an operator whose step-size dependence is prescribed by a first-order Duhamel approximation of semilinear dynamics. It combines exact linear propagation with a local nonlinear function of the field and its derivatives, allowing evaluation below the observation interval without supervision densely sampled across step sizes. Under suitable conditions and at fixed spatial resolution, we prove that agreement between models at two step sizes controls their prediction differences throughout a prescribed range. We also give conditions for local identifiability of both components from two step sizes, supporting interpretation of the learned structure. A latent extension applies the same construction to learned fields. We evaluate the base model on two synthetic problems and the extension on two real datasets against several baselines.

comments
22 pages, 1 figure
fields
Numerical Analysis
pdf ↗ page arXiv:2610.39041 ↗

Given a positive function $ρ$ on the unit sphere $\mathbb{S}^2$, the classical Minkowski problem asks for a closed convex surface in $\mathbb{R}^3$ with Gauss curvature $1/ρ(ν)$ at the point with outer normal $ν$. In terms of the support function $h$, it is the Monge–Ampère equation $\det(\nabla^2h+hσ)=ρ$ on $\mathbb{S}^2$, uniquely solvable up to translation when $ρ$ has zero first moment. We solve it by continuation from the sphere: along the linear path $ρ_t=(1-t)+tρ$, the solution $h(t)$ evolves in the artificial time $t$, and its velocity $\partial_th$ solves a linear elliptic equation in divergence form whose kernel consists of the translations. In time we use the explicit Euler or trapezoidal method with step $τ$; in space, spherical harmonics of degree at most $L$ with a Lagrange multiplier for the kernel. For $ρ\in H^{s+2}(\mathbb{S}^2)$ with real $s\ge4$, we prove that all numerical solutions stay strictly convex, with $H^1$ errors $O(τ+L^{-(s+1)})$ for Euler and $O(τ^3+L^{-(s+1)})$ for the trapezoidal scheme, including data quadrature, under independent thresholds for $τ$ and $L$. The proof rests on a priori estimates for the perturbed equation satisfied by each iterate, which keep every step uniformly elliptic, and on the exactly quadratic determinant, which raises the trapezoidal order from two to three. The continuation thus supplies a good initial guess for Newton's method: from the final state it converges quadratically to the Galerkin solution, itself within $O(L^{-(s+1)})$ of the exact solution, whereas started directly from the sphere its first undamped step left the convex cone in our ellipsoid test. Experiments illustrate the rates, use the multiplier as a compatibility diagnostic, reconstruct convex polyhedra from facet normals and areas, and locate umbilics with indices.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.39047 ↗

We study the positivity conjecture of Fasi and Higham [SIAM J. Matrix Anal. Appl. 40 (2019), Conjecture 3.2], which concerns the Taylor coefficients of the reciprocal of the denominator $q_{k,m}(z)$ of the Padé approximant to the matrix exponential. The conjecture asserts that these coefficients are positive whenever $m$ is odd. We prove full positivity for $k=0$ and eventual positivity whenever the unique positive real zero of $q_{k,m}$ is the unique zero of minimal modulus. We also give an explicit computable sufficient threshold beyond which all coefficients are positive. Using Hermite scaling with leading-coefficient normalization, we prove that this spectral minimality holds for each fixed odd $m$ and all sufficiently large $k$. The unrestricted conjecture is nevertheless false. We give exact rational counterexamples and prove a transient scaling theorem showing that on the scale $n\asymp\sqrt{k+1}$ the normalized coefficients converge to an explicit oscillatory Hermite profile. For $m=5$ this profile is negative at one point, yielding infinitely many counterexamples. The counterexamples are not diagonal, and the diagonal case $k=m$, which is the case relevant in practice, remains open. These results do not imply a failure of the Fasi–Higham algorithm. Rather, they delimit the range in which the auxiliary positivity conjecture can be used as a theorem.

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

Capacitively coupled plasmas (CCP) are widely used in semiconductor manufacturing, where fluid models provide an efficient approach to the simulation of the low-temperature discharge. The model considered in this work couples the electron and the ion continuity equations, the electron energy equation and the Poisson's equation for the electric potential. We investigate the numerical schemes for the simulation of the 1D-CCP. In particular, a semi-implicit Scharfetter-Gummel (SG) scheme is adopted for the Poisson's equation, while the remaining equations are solved using the implicit SG schemes. The proposed strategy can be naturally extended to the 2D cases. Several alternative schemes are also discussed and tested. Numerical experiments compare these methods in terms of the admissible time step $Δt$, total simulation time, accuracy against a reference solution and robustness of the scheme. We propose a numerical scheme for the 1D-CCP and, to the best of our knowledge, provide the first detailed numerical analysis of such a scheme for CCP.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.39140 ↗

We develop a framework for equilibrated residual a posteriori error analysis of finite element methods, based on decomposing vector- and tensor-valued Sobolev spaces into $H^2$ and $H^1$ spaces. To estimate the residual functional acting on $H^2$ component, the method reconstructs symmetric and piecewise polynomial tensors on vertex patches in broken $H(\operatorname{div}\operatorname{div})$ spaces. We apply the proposed framework to conforming finite element discretizations of biharmonic equation, Poisson's equation, and linear elasticity in mixed form. As a result, we obtain several novel equilibrated residual a posteriori error estimates, providing guaranteed error control for energy error of biharmonic equation, $L^2$ norm error of Poisson's equation, and stress error of mixed linear elasticity. They also serve as the first polynomial-degree-robust a posteriori lower bounds of discretization errors. Numerical experiments illustrate the effectiveness of the $H^2$-based error estimators.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.39210 ↗

We develop a fast method for the rigid alignment of voxelized three-dimensional density functions over $\mathsf{SO}(3)$ using sliced optimal transport. Our approach efficiently transforms each density map into a tensor of one-dimensional quantile functions, taken from central slices over the unit sphere, such that the Euclidean distance of the transformed volumes approximates the sliced 2-Wasserstein distance. Our formulation is therefore compatible with existing, fast, voxel-based Euclidean alignment algorithms. We provide theoretical analysis and numerical experiments demonstrating that the sliced 2-Wasserstein distance is a robust metric for comparing three-dimensional shapes and for computing their rigid alignment.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.39214 ↗

We propose and analyze an arbitrary-order globally divergence-free (GDF) discontinuous Galerkin (DG) method for the two-dimensional linear magnetic induction equation on unstructured triangular meshes. To the best of our knowledge, this is the first work to provide a rigorous energy-based analysis of high-order GDF-DG methods. First, we incorporate the edge normal-trace evolution into a closed, strictly local semidiscrete operator acting on the elementwise magnetic field alone. Then, we introduce two local modifications to the continuous electric field: a weighted patch moment correction that enforces local polynomial orthogonality and a vertex-patch stabilization that damps the remaining high-order modes. On shape-regular, quasi-uniform periodic triangulations, we prove semidiscrete energy stability with a sufficiently large mesh-independent penalty and establish a priori error estimates for smooth solutions. Numerical experiments support the analysis.

comments
20 pages, 1 figure, 1 table
fields
Numerical Analysis
pdf ↗ page arXiv:2610.39299 ↗

Algebraic multigrid (AMG) is one of the most effective algorithms for solving large sparse linear systems and consists of a setup phase followed by a solve phase. As supercomputer performance improves and the number of MPI processes increases, AMG faces serious challenges in algorithmic scalability and parallel scalability. To address these issues, we propose an asynchronous concurrent algebraic multigrid (ACAMG) model based on an MPI process grouping strategy for setup and solve. The setup and solve phases execute asynchronously and concurrently on separate MPI process groups. This organization can both preserve AMG hierarchy quality through an appropriate choice of the setup-group size and achieve time overlap between the two phases through asynchronous concurrent execution. Based on this model, we design and implement the MPI ACAMG algorithm. Theoretical analysis and numerical experiments show that the algorithm exhibits better algorithmic and parallel scalability. For example, for a three-dimensional diffusion problem with spatially localized anisotropy, ACAMG not only reduces the solve-phase iteration count compared with the conventional method, but also achieves speedups of 4.74 and 19.36 at 64 and 128 processes, respectively.

comments
23 pages, 6 figures, 5 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2610.39303 ↗

We develop and analyze a family of conforming, energy-stable spatial semidiscretizations of the Shliomis ferrofluid model in two and three space dimensions. Unlike many existing numerical analyses, we treat the system without introducing magnetic diffusion. The limited spatial control supplied by the energy law complicates the treatment of magnetic nonlinearities in the error analysis. Our formulation retains the rotational coupling and nonlinear magnetic relaxation and incorporates the magnetic normal-flux condition naturally, overcoming the dimensional restriction and boundary-enforcement difficulties of the two-potential approach of Benavides, Nochetto and Shakipov (2026). The error analysis combines consistent stabilization of the Maxwell constraint with a cancellation arising from exact incompressibility and the pointwise symmetry of the Hessian of the magnetic potential. We prove global solvability of the semidiscrete scheme and establish a priori error estimates for sufficiently regular exact solutions under explicit approximation and projection-stability assumptions. We also construct an averaged $\mathrm{H}^2$-conforming projector, following Girault and Scott (2002), that is defined on $\mathrm{L}^1(Ω)$, and establish its Sobolev approximation and stability properties. These properties are needed for the error analysis and are of independent interest.

comments
34 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2610.39325 ↗

We develop a contour-based method for applying Riemann–Liouville fractional integrals in a Jacobi fractional polynomial basis with an endpoint weight. A Gamma-ratio representation reduces the action to contour quadrature and banded ultraspherical solves. For a fixed number of contour nodes, the cost and storage are linear in the polynomial dimension. For fractional equations, we construct selected diagonals of a short rational approximation directly and use their banded factorizations as reusable right preconditioners for Krylov iterations. Numerical experiments show accurate integral actions and substantially reduced solution costs across Abel, multi-order, BBO, deferred-correction, eigenvalue, and boundary-value problems.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.39388 ↗

The randomized Kaczmarz (RK) method is a widely used and effective class of iterative algorithms for solving large-scale linear systems. For inconsistent systems, however, the persistent variance caused by randomization prevents the method from converging exactly to the least-squares solution. In this paper, we introduce a residual-tracking control variate framework for reducing this variance while retaining the row-action structure and low per-iteration cost of RK. The resulting variance-reduced RK method uses constant step sizes, accesses only sampled rows of the coefficient matrix, and requires \(O(m+n)\) auxiliary storage. We prove that the proposed method converges linearly in expectation to the unique least-norm solution for general linear systems, including inconsistent and rank-deficient cases, with a convergence factor of the same order as that of the RK method. Furthermore, we incorporate the momentum acceleration into our framework and provide theoretical guarantees for its improved convergence rate. Numerical experiments illustrate the effectiveness of the proposed methods, particularly for ill-conditioned systems and high-accuracy computations.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.39537 ↗

We introduce a positivity-preserving drift-implicit square-root Euler method for the free Cox–Ingersoll–Ross (CIR) equation driven by free Brownian motion. The method is obtained by discretizing the square-root equation implicitly in the drift and preserves strict positivity of the numerical solution without any step-size restriction. Under the Feller condition, we establish the uniqueness of the global strictly positive solution and derive an upper bound for its operator norm. A key ingredient for the error analysis is a free stochastic differential representation of the inverse square-root process. Another key ingredient is an a priori grid-point error estimate for sufficiently small step sizes that yields uniform upper and strictly positive lower spectral bounds for the numerical solution on any fixed finite time interval. These results support the strong convergence of order $1$ and improve the classical results. Moreover, both the exact and numerical solutions are exponentially stable with respect to perturbations of the initial value. The numerical stability holds for arbitrary step sizes, and the associated discrete decay rate converges to its continuous counterpart as the step size tends to zero. Numerical experiments confirm the theoretical results.

comments
29 pages, 4 figures, 1 table
fields
Numerical Analysis
pdf ↗ page arXiv:2610.39631 ↗

The L2 discretization of the Caputo derivative is attractive for its high-order accuracy, but its analysis on nonuniform temporal meshes is complicated due to the lack of a monotone structure in the discrete coefficients. This difficulty is particularly significant for deriving sharp $L^2$ error estimates in the presence of the typical weak singularity of subdiffusion solutions near the initial time. In this work, we develop a coefficient-recombination framework for the L2 method on nonuniform meshes. Under the adjacent step-ratio condition $0.86\le ρ_k\le 1.16$, $k\ge2$, we prove that the recombined L2 coefficients are positive and monotone. A key ingredient is a cross-row recombination technique: with the recombination parameter associated with a fixed time level, all coefficient rows retain positivity and monotonicity, which allows us to close an induction for the $L^2$ error analysis. For solutions exhibiting the standard initial weak singularity, we derive an $L^2$ error estimate on nonuniform meshes satisfying the step-ratio condition. On a modified graded mesh with grading parameter $r>1$, the estimate yields the convergence rate $\mathcal{O}\!\left(N^{-\min\{rα,\,3-α\}}\right)$, and hence recovers the optimal order $\mathcal{O}(N^{-(3-α)})$ whenever $r\ge(3-α)/α$. Numerical experiments on random nonmonotone meshes and modified graded meshes confirm the theoretical estimates.

comments
25 pages, 2 figures, 3 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2610.39642 ↗

We prove rate-optimal convergence of the standard adaptive finite element method with conforming Lagrange elements for the Poisson problem for Dörfler marking with any bulk parameter $θ\in (0,1)$. This removes the smallness restriction on the bulk parameter that has persisted in the classical theory of optimal adaptive finite element methods.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.39719 ↗

We analyze higher-order quasi-Monte Carlo (QMC) Galerkin discretizations for a singularly perturbed reaction-diffusion problem with an affine-parametric reaction coefficient. We derive error estimates that are robust with respect to the perturbation parameter $\varepsilon$. To this end, we establish $\varepsilon$-uniform stability and mixed-parametric regularity estimates in an $\varepsilon$-weighted energy norm, with constants independent of the parameter dimension and of $\varepsilon$. These estimates imply robust dimension truncation estimates and dimension-independent higher-order QMC error bounds for linear quantities of interest. Assuming an abstract, $\varepsilon$-robust finite element approximation property, we combine the parametric estimates with the spatial discretization analysis to derive a general fully discrete QMC-FE error estimate with constants independent of both the parameter dimension and $\varepsilon$. We verify this approximation property for a one-dimensional model problem using continuous piecewise affine finite elements on Shishkin meshes. Numerical experiments illustrate the predicted robustness and convergence rates.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.39734 ↗

We analyze the combined discretization of singularly perturbed reaction-diffusion problems with perturbation parameter $\varepsilon\in (0,1]$ and with parametric, Gevrey-regular reaction term, by $hp$-Galerkin FE methods and by higher-order polynomial lattice rules. We establish $\varepsilon$-robust algebraic convergence rates for the combined QMC $hp$-FEM approximation that are not subject to the curse of dimensionality (CoD) in the parametric reaction coefficient, and only limited by the sparsity and the $\mathfrak{s}_{y}$-Gevrey regularity of the reaction coefficient expansion. On the interval $(-1,1)$, we establish an $\varepsilon$-robust, root-exponential convergence rate $\exp(-σ\, p_{\mathrm{FE}}^{1/\mathfrak{s}_{x}})$ for $hp$-Galerkin FEM for reaction-diffusion problems under $\mathfrak{s}_{x}$-Gevrey regularity assumptions on the reaction coefficient and the source term, a result that can be of independent interest. Numerical experiments are consistent with the theoretical bounds.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.39738 ↗

We develop a transfer principle that lifts continuous elliptic Carleman estimates to mesh-uniform estimates for conforming Galerkin discretizations. The main difficulties are twofold: discrete states generally lack the \(H^2\)-regularity required by the continuous estimate, and the Carleman parameter \(s\) must be controlled relative to the mesh size \(h\). We overcome both by introducing a shifted continuous problem whose Galerkin solution is exactly the conforming reconstruction of a prescribed discrete state. Weighted approximation then transfers the inequality back to the original discrete operator without adding stabilization, and yields the range \(s\le ch^{-4/5}\) for radial weights. We verify the framework for piecewise affine finite elements with consistent or lumped mass on fitted, uniformly shape-regular meshes, and for standard Cartesian finite differences through their finite-element realization. As an application, we study the discrete Calderón problem for bounded complex Schrödinger potentials in dimension \(d\ge3\). Assuming agreement in a fixed connected boundary neighborhood and uniform stability of the discrete Dirichlet problems, we obtain stability from Dirichlet inputs and variational flux observations on independently prescribed, possibly disjoint boundary patches. The resulting estimate in \(H^{-r}\), \(r>d/2\), retains the single logarithmic data term and the \(O(h^{1/2})\) mesh remainder of the full-data estimate.

fields
Numerical Analysis, Analysis of PDEs
pdf ↗ page arXiv:2610.39750 ↗

We propose a modern all-at-once framework for PDE-based Bayesian inversion by introducing the PDE residual as probabilistic information. In this framework, the PDE residual is treated as a soft constraint with a residual covariance and is directly incorporated into the likelihood function. The new hybrid likelihood function eliminates PDE solves, thus reducing expensive computational costs, while performing rigorous Bayesian inference. Theoretically, we establish the well-posedness of the posterior with uncertainty quantification, and numerically, we propose two efficiency inversion algorithms based on two posterior sampling methods. In particular, one algorithm is based on Metropolis-within-Gibbs MCMC method with a PDE-informed block- diagonal Gaussian prior, and the other is based on a joint sampling strategy. Numerical experiments for a semiconductor inverse problem confirm that the proposed Bayesian all-at-once approach yields a speedup of approximately a factor of two, while having a comparable reconstruction quality as the conventional reduced-based setting.

fields
Numerical Analysis, Probability
pdf ↗ page arXiv:2610.39783 ↗

We propose a semigroup-aware structured kernel neural operator for source-driven evolution PDEs. Unlike generic time-conditioned kernel models, the proposed formulation represents temporal dependence through a latent exponential propagator \(e^{tA_θ}\), where \(A_θ\) is a learned latent generator. This provides a structured transition from a non-ODE kernel representation to an ODE-inspired kernel operator whose latent temporal evolution satisfies the composition principle of evolution semigroups. For time-dependent forcing terms, a direct kernel-based evaluation requires repeated quadrature over delayed kernel evaluations. To address this computational bottleneck, we derive a latent-first reformulation of the source term: the forcing field is projected onto the kernel-induced latent space, where its accumulated effect is represented as the solution of a forced linear latent dynamical system. For a fixed learned kernel, this reformulation is exact. The resulting system can then be integrated using a \(φ_1\)-based exponential integrator, yielding a source-evaluation path that is structurally aligned with the learned latent propagator. The resulting framework combines geometry- and physics-conditioned low-rank kernel factorization with alternative source-evaluation paths based on either explicit Duhamel quadrature or latent exponential integration. Dissipativity constraints on the latent generator and identity-preserving corrections near the initial time are optional architectural components. Numerical experiments on advection-iffusion-reaction (ADR) problems compare the non-ODE and semigroup-aware formulations, evaluate the quadrature and \(φ_1\) source paths, and assess predictive accuracy and computational cost.

fields
Numerical Analysis, Analysis of PDEs
pdf ↗ page arXiv:2610.39845 ↗

Symplectic model order reduction of Hamiltonian systems yields reduced dynamics that conserve the reduced Hamiltonian along exact trajectories, avoiding the artificial energy drift that can arise from conventional projection methods. For large-scale spatial discretizations, however, basis construction and reduced-operator assembly can involve substantial offline costs. Randomized numerical linear algebra can reduce these costs through low-dimensional sketches while supporting streaming and parallel implementations. We develop randomized techniques for two parts of the offline stage while preserving the Hamiltonian structure of the reduced dynamics. First, we introduce the one-pass sketched randomized cSVD (Ops-rcSVD), a one-pass randomized variant of the complex-SVD algorithm. Combining randomized range finding with an independent left sketch, Ops-rcSVD constructs an ortho-symplectic reduced basis from a single pass over the snapshot ensemble. Second, for quadratic Hamiltonian systems, we introduce a randomized reduced-Hamiltonian assembly based on sketching the reduced basis and operator actions, yielding a reduced Hamiltonian system by construction. We derive bounds for the snapshot projection error, uniform-in-parameter perturbation bounds for the sketched reduced Hamiltonian, and an energy-norm estimate for the difference between reduced and sketched reduced trajectories. Experiments on large-scale systems show that Ops-rcSVD attains projection accuracy comparable to deterministic and two-pass randomized constructions while reducing basis-construction time. They further demonstrate accurate sketched reduced-Hamiltonian assembly when storing the complete snapshot ensemble is no longer feasible.

comments
30 pages, 5 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.39893 ↗

Learning continuous-time dynamical systems from data is an active area of research. The Koopman formalism is often used here, because it is a flexible approach that is informative about the system's fundamental properties. The formalism represents dynamical systems through linear operators acting on a suitable function space. A practical difficulty arising in the numerical approximation of Koopman operators is the choice of a ``dictionary'', meaning an effective finite-dimensional representation of the function space. In this paper, we focus on learning dynamical systems in continuous-time, and so we consider numerical approximations of the Koopman generator instead of the Koopman operator. Our main contribution is a data-driven random-feature method to obtain a parsimonious and effective function representation for Galerkin approximation methods such as gEDMD. The representation we construct is data-informed, which allows us to improve upon data-agnostic methods. We empirically demonstrate the suitability of our method for forecasting tasks and system analysis. The numerical experiments show that our approach is accurate, and faster than iterative optimization. Further, we prove convergence of our approximation of the vector field and the resulting trajectories. In addition to the numerical results, we also make theoretical contributions, including a general convergence criterion for the semigroup generated by the gEDMD approximation and a counterexample showing that gEDMD does not generally preserve exponential boundedness. With our contribution, we advance the frontier of efficiently learning continuous-time dynamics from data, towards interpretable and mathematically robust modelling based on the Koopman framework.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.39897 ↗

The adaptive cross approximation (ACA) algorithm is a powerful tool for constructing low-rank matrix approximations using only a small subset of matrix entries. While extensively studied for real and complex matrices, its extension to quaternion algebras, remains largely unexplored. This paper presents the first comprehensive framework for adaptive cross approximation operating natively in the quaternion algebra H. Unlike approaches that rely on real embeddings or complexifications, our method preserves the algebraic structure of quaternions throughout the computation, avoiding information loss and maintaining the natural correlations between quaternion components. We develop a fully quaternionic ACA algorithm with rigorous theoretical foundations, including convergence analysis, error bounds, and complexity estimates. The algorithm achieves O(r(m+n)) complexity per iteration and demonstrates quasioptimal approximation properties comparable to the quaternion singular value decomposition (QSVD), but with significantly reduced computational cost. We provide a detailed MATLAB with numerical experiments on color image compression. Our results show that native quaternion ACA outperforms significantly the basic SVD algorithm in terms of computational efficiency, with very close approximation accuracy.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.39901 ↗

This paper presents a MATLAB toolbox for working with split quaternions and split quaternion matrices. Split quaternions, also known as coquaternions, form a four-dimensional associative non-commutative algebra over the real numbers with a signature (+,+,-,-). The toolbox provides two main classes: SplitQuaternion for scalar-valued split quaternions and SplitQuaternionMatrix for matrix-valued split quaternions. The implementation includes arithmetic operations, algebraic functions, matrix operations, linear algebra utilities, and various conversion methods. The toolbox is designed to be intuitive for users familiar with MATLAB's standard matrix operations while providing the full power of split quaternion algebra. This paper details the implementation, provides numerous examples, and demonstrates the toolbox's capabilities through practical demonstrations. The MATLAB toolbox is accessible at https://github.com/SalmanAhmadi-Asl/Split_Quaternion.git.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.39904 ↗

Accurate prediction of iron losses in transformers, electric motors, and generators at elevated frequencies requires accounting for eddy currents in laminated magnetic cores during field simulation. We study local material models for these lamination losses that resolve the inhomogeneous magnetic-field distribution across the thickness of the respective steel sheets via one-dimensional diffusion equations. This allows to incorporate skin-effect and eddy-current losses in the laminations at each material point of a two- or three-dimensional magnetic-field simulation. The macroscopic material response is described implicitly through a minimization problem involving a set of internal variables which encode the load history and current state of the material. The variational structure of these problems allows us to prove well-posedness, to include anisotropy and hysteresis, and to develop efficient globally convergent solvers for the evaluation of the macroscopic material response. The proposed framework thus allows to efficiently and reliably predict magnetic behaviour of laminated core material over a wide frequency range and is well-suited for integration into nonlinear magnetic field solvers.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.39952 ↗

We investigate the mean-square convergence of a three-level multigrid reduction-in-time (MGRIT) method based on F-relaxation for linear stochastic evolution equations driven by additive Gaussian noise. The method combines exponential Euler time stepping on the finest grid with implicit Euler discretizations on the two coarser grids. The inexact solution of the intermediate-level full approximation scheme problem gives rise to coupled error recursions involving two interlevel propagator discrepancies. Under a common spectral decomposition of the drift and noise covariance operators, we establish a geometric contraction estimate in a modal mean-square norm, with a contraction factor uniform in the temporal grids and both coarsening factors. We further derive fixed-iteration temporal error bounds that are uniform in the first coarsening factor and explicitly quantify the dependence on the second. For a fixed iteration count $k$ and a fixed second coarsening factor, we prove an $O(ΔT_1^r)$ error bound relative to the finest-grid reference solution for $0<r\le k+1$ provided that $\mathcal R_{r,B}<\infty$. We also prove that the error-propagation operator is nilpotent on each fixed temporal grid, ensuring finite termination of the iteration. Numerical experiments illustrate the theoretical convergence behavior and compare temporal critical-path work under a unit-cost model.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.39962 ↗

In many applications, we are interested in studying an object of interest $x$. However, its properties are often not directly measurable. Instead, we only observe $y = F(x)$, where the (known) function $F$ is referred to as the forward mapping. To infer about $x$ from the observation $y$, we seek an (approximate) inverse mapping $x \approx F^{-1}(y)$. This process is known as solving the inverse problem. In practice, the inverse mapping $F^{-1}$ may be ill-defined or discontinuous, which forces us to choose a certain solution from many possible ones based on prior assumptions on $x$. Such assumptions about $x$ are typically incorporated into the inversion process through regularization. Therefore, the first part of this course focuses on the classical regularization theory of inverse problems. In the second part, we transition to algorithmic approaches for solving inverse problems. The foundation for this lies in the variational formulation of inverse problems, where reconstructions are obtained by minimizing specific functionals. Here, we will explore key optimization principles, discuss their practical implementation, and examine how they contribute to robust reconstructions. Today, classical methods are often modified to incorporate data-driven machine learning techniques, which improve the empirical performance. However, this often comes at the cost of explainability or convergence guarantees. Such properties are critical, for example, in medical applications, where one wants to be confident that reconstructed abnormalities are of physical nature and not phantoms resulting from the method. For these reasons, we discuss a number of machine learning methods for inverse problems, such as unrolling techniques, learned regularizers and plug-and-play methods, and explore their performance guarantees.

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

We present a hybridizable discontinuous Galerkin (HDG) method for one-dimensional blood flow in arterial networks with Windkessel boundary conditions. The scheme uses a Harten–Lax–van Leer (HLL) numerical flux and implicit time integration. After spatial discretization, the complete network—including cell states, hybrid traces, junction conditions, and dynamic $\mathrm{RCR}$ terminal pressures—is written as a residual index-one differential–algebraic equation (DAE) and integrated with variable-step, variable-order backward differentiation formulas. The implicit formulation removes the CFL stability restriction of explicit schemes and allows variable-order, variable-step solvers. The resulting single global residual and Jacobian for the network and its terminal dynamics also provide a natural interface for monolithic coupling with external nonlinear models. We establish local solvability and a semi-discrete energy balance, and show numerically optimal convergence rates for both solution variables in the $L^2$ norm and the broken $H^1$ seminorm. The solver is validated against established benchmarks, including an aortic bifurcation and a $37$-artery network, and is further applied to a cerebral arterial network. Mass conservation is observed in a synthetically generated anatomical liver network of $8\,\mathrm{k}$ vessels, and strong-scaling studies are performed on synthetic networks of $50\,\mathrm{k}$ and $100\,\mathrm{k}$ vessels.

comments
33 pages, 18 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.40080 ↗

In this work, we develop a mass-conservative subdiffusive tumor-nutrient model coupled through chemotaxis and memory-dependent reaction exchange, together with structure-preserving variable-step linear relaxation schemes. A weighted Riemann-Liouville identity is proved and used to construct a variational energy and the associated energy dissipation law for the proposed model. Both the model and the associated variational energy dissipation law are asymptotically compatible with their integer-order counterparts as the fractional order approaches one. For numerical approximation, we discretize the Riemann-Liouville fractional derivatives using the L1R formula on nonuniform time meshes and derive the associated discrete weighted inequality. We first construct a variable-step linear relaxation scheme for the subdiffusive model. Then, to mitigate alternating perturbations induced by the auxiliary-variable error and amplified by the L1R convolution at small fractional orders, we construct a temporally damped linear relaxation scheme. Since temporal damping leaves the auxiliary-variable recurrence unchanged, we further introduce an a posteriori relaxation correction to reduce alternating errors in the auxiliary variable. All three schemes preserve total mass, are proven to satisfy discrete variational energy dissipation laws using the discrete weighted inequality, and remain consistent with the integer-order limit. Several numerical examples are presented to validate the accuracy and stability of the proposed schemes.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.40120 ↗

We present an adaptive bitwidth allocation method for quantizing low-rank factors in hierarchical matrices in order to decrease storage while meeting a given constraint on their reconstruction error. For the bitwidth allocation we formulate a discrete storage minimization problem and show that an optimal assignment can give larger singular values at least as many bits as smaller ones. We further develop a greedy algorithm that meets the specified max-norm quantization error budget. We investigate a hierarchical block partition in which all of the non-diagonal blocks are represented by quantized low-rank factors and only dense blocks remain dense; in this way a global reconstruction bound related to $η_k$ and $R_k$ is obtained, with the former and latter being bounds on the truncation and reconstruction arithmetic errors, respectively. Extensive simulations, carried out with kernel and BEM matrices under block-relative budgets, indicate that the proposed method achieves a reduction in storage of up to $44.3\times$ when compared to storing the complete matrix densely in FP64, and a reduction of up to $5.70\times$ when compared to the FP64 low-rank factors within the same partition, together with measured reconstruction errors that remained below the maximum norm bounds in all the hierarchical tests.

comments
37 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2610.40134 ↗

We establish an algebraic upper bound for the Lebesgue constant of multivariate polynomial interpolation on $\mathfrak R$-Leja lower grids. For each fixed dimension $d\geq2$ and every nonempty finite lower set $A\subset\mathbb N_0^d$, let $P_A$ denote the corresponding grid with $N=|A|$ nodes. We prove $Λ(P_A)\leq C_dN^{β_d}$, where $q_d=d/(d-1)$ and $β_d=1+q_d^{-1}\log_2(1+2^{q_d})$. The exponent satisfies $β_2=2.160964\ldots$ and increases to $\log_2 6=2.584962\ldots$ as $d\to\infty$, improving both the cubic estimate and the exponent $3-1/d$ obtained from quadratic prefix bounds. Our proof exploits the binary structure of known univariate estimates to control sums of powers of Lebesgue constants over interpolation prefixes. A weighted Hölder inequality and a disjoint-box packing argument then transfer these prefix-moment bounds to arbitrary lower sets. The resulting estimate is uniform over all lower-set shapes and choices of disk Leja maximizers, with constants depending only on $d$.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.40177 ↗

We consider three-dimensional imaging of compactly supported anisotropic electric media from fixed-frequency polarimetric Maxwell far-field data. Maxwell transversality creates an obstruction absent from scalar Born inversion: each measurement determines only a projected action of the tensor-valued Fourier transform. We first resolve this obstruction by a finite-dimensional polarimetric inversion. For a general complex $3\times3$ contrast, three incidence–observation configurations are necessary, and we give an explicit three-configuration design that is sufficient at every nonzero interior Fourier point. Its Gram determinant yields quantitative conditioning information and exhibits the loss of recoverability at the boundary of the accessible Fourier ball. After tensor demixing, the inverse problem reduces componentwise to restricted Fourier inversion on the unit ball, which we regularize by spectral cutoff in three-dimensional ball generalized prolate spheroidal wave functions. For discrete acquisition, a combined reconstruction error estimate separates the effects of measurement noise, polarimetric amplification, off-grid Fourier mismatch, quadrature error, Born modeling error, and spectral truncation. Numerical tests examine polarimetric conditioning and use analytically generated Born data to compare three- and six-configuration recovery and assess off-grid sensitivity. Reconstructions from full-Maxwell volume-integral data assess the effects of noise, wavenumber, and basis choice, as well as the recovery of different tensor components.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.40180 ↗

This article presents two new multilevel hierarchical matrices to perform fast kernel matrix-vector products in $d$ dimensions $(d>1)$, namely $\mathcal{H}_{hw}^{\prime}$, $\mathcal{H}_{hw}^{\prime \prime}$. We introduce a novel hybrid weak admissibility condition to construct these hierarchical matrices. More precisely, at coarser levels of the tree (i.e., larger blocks), we use a weak admissibility condition, wherein \textbf{far-field} and \textbf{vertex-sharing} clusters are considered admissible, while at the finer levels (i.e., smaller blocks), the \textbf{adjacent} clusters are treated as admissible. The admissible blocks at coarser levels of $\mathcal{H}_{hw}^{\prime}$ and $\mathcal{H}_{hw}^{\prime \prime}$ are represented using semi-nested and fully nested bases, respectively. In both hierarchical matrices, the finer levels at which adjacent clusters are treated as admissible are constructed in a non-nested fashion. Thus, they can be viewed as a hybrid of $\mathcal{H}$ and $\mathcal{H}^2$ matrices. We use adaptive cross approximation (ACA) and nested cross approximation (NCA) to construct non-nested and nested bases, respectively. The fast matrix-vector products are performed using the proposed hierarchical matrix formats. To evaluate the performance and usefulness of the proposed hierarchical matrices, we conduct some numerical experiments. The numerical results show that they outperform their uniform admissibility counterparts in terms of storage and matrix-vector product cost, demonstrating the effectiveness of the proposed hybrid formats. We also show that the proposed formats are competitive with the standard (or strong) admissibility-based $\mathcal{H}^2$-matrices. Furthermore, we showcase some interesting applications of the proposed hierarchical matrices.

comments
27 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2610.40195 ↗

Transferable neural network (TransNet) has demonstrated great potential for solving partial differential equations (PDEs) with high accuracy and efficiency. However, it struggles significantly when dealing with PDEs featuring anisotropy or sharp solutions. In this work, we propose an adaptive transferable neural network (A-TransNet), a novel machine learning framework that adaptively expands neurons in regions with large solution gradients to effectively capture complex solution behaviors. Instead of relying on training or random sampling, the location parameters of newly added neurons are determined by integrating the active subspaces method and local gradient analysis based on posterior gradient information. This adaptive strategy enables neurons to be allocated where they are most needed, thereby improving the resolution of anisotropic and sharp features without additional computational costs. Moreover, the shape parameters of new neurons are automatically determined from the neuron density induced by their locations, further enhancing the network representation capability. An iterative neuron expansion strategy is developed, together with rigorous analysis of stability, a posteriori error estimation, and convergence of the proposed A-TransNet method. Extensive numerical experiments on challenging PDE problems with anisotropic and sharp solutions demonstrate that A-TransNet achieves superior accuracy, efficiency, and robustness compared with existing methods.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.40201 ↗

We consider tau approximations of a general eigenvalue problem for a $K$-th-order linear differential operator in one dimension, and we show that the approximate spectrum satisfies a resolvent-based spectral determinant property, which we use to investigate it. More specifically, we analyze the spectral determinant property for a second-order Sturm-Liouville eigenvalue problem approximated using Gegenbauer tau methods. Notably, a quantitative error analysis identifies two values of the Gegenbauer parameter $γ$ leading to better approximation properties. These values correspond to Legendre polynomials and their derivatives. Moreover, we discuss the behavior of the largest eigenvalue of the tau approximation. The results are validated with a numerical implementation.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.40307 ↗

Given a nonempty set of matrices $\mathcal{E} \subseteq \mathbb{C}^{m \times n}$ and a matrix $A \not\in\mathcal{E}$, a matrix nearness problem (or matrix distance problem) consists in finding a matrix in $\mathcal{E}$ that is closest to $A$, in some norm, as well as the corresponding distance. This article is a survey of matrix nearness problems and of numerical algorithms for their solution. We pay special attention to modern related topics, such as Riemannian optimization and pseudospectra, that were not discussed in depth in previous reviews about this topic. Besides collecting known facts, we also prove some foundational results that, at least in the present form, we could not locate in the literature.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.40313 ↗

Neural networks are commonly used to learn the solution operators of PDEs such as the Navier-Stokes equations and viscous conservation laws. On standard benchmarks, moderately sized and often shallow networks achieve small errors that decay at algebraic rates with the network size. These observations are not well described by the current approximation theory, which treats the solution operator as a generic map and derives worst-case bounds over large classes of operators. We show that the structure of the equations and their properties explain the observed behavior. For semilinear parabolic equations, the approximation costs separate into two terms, where one is controlled by an invariant of the governing law and the other by the data. The constitutive law can be parameterized as a single block whose size for accuracy $η$ is $O(η^{-pχ}\logη^{-1})$ for every $p>p_f$, where the structural exponent $p_f$ only depends on the computation graph of $f$. This exponent does not depend on the dimension and is in fact zero for polynomial laws, so for the two-dimensional Navier-Stokes equations the nonlinear block costs only $O(\logη^{-1})$ parameters. The data enters through encoding layers with a bounded number of learned weights per mode, so neither term grows with the grid resolution or the time step. While the analysis only uses the max-norm error of the pointwise block, we show that one obtains approximation bounds in a stronger norm along the whole trajectory. For viscous Hamilton-Jacobi equations with a $C^s$ Hamiltonian, the approximation requires on the order of $η^{-1/s}$ parameters, and we prove a matching lower bound, up to logarithms. This shows that solution operators for this class of problems have low structural complexity, even though they are nonlinear maps between infinite-dimensional spaces.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.40384 ↗

The singular value decomposition (SVD) provides optimal low-rank approximations of real and complex matrices by the Eckart–Young theorem, and SVD-based tensor decomposition algorithms such as the higher-order singular value decomposition (HOSVD) and the tensor train singular value decomposition (TT-SVD) inherit quasi-optimality guarantees from it. We extend the SVD to matrices over a finite-dimensional $\ast$-algebra $K$. Our main contribution is a characterization of the algebras $K$ for which every matrix admits an SVD, and of the inner products on $K$ for which the Eckart-Young theorem holds. We introduce a notion of ordered SVD, show that ordered SVDs reveal the rank of a matrix over $K$ and yield optimal truncations, and give an explicit algorithm that computes an ordered SVD from the structure of the algebra. We then extend the Tucker, tensor train, and tree tensor network (TTN) decompositions and their SVD-based decomposition algorithms to tensors over $K$, and show that TT-SVD retains a quasi-optimality guarantee over every such $K$, whereas HOSVD, ST-HOSVD, and TTN-SVD do so when $K$ is commutative. Viewed in real or complex coordinates, these constructions give novel decomposition formats of ordinary tensors. We illustrate our new methods by compressing data from a variety of scientific applications, and show that they can achieve lower approximation error than their classical counterparts at equal storage.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.40450 ↗

This paper presents a Lagrangian framework to solve Wasserstein Hamiltonian flows (WHF) under two-point boundary conditions on large finite graphs. Characterized by a coupled system of discrete master equation and Hamilton-Jacobi (HJ) equation on the probability simplex, this formulation defines the macroscopic WHF. While classical density-based solvers can track this flow, they face severe memory and computational bottlenecks as the graph scale grows. To bypass these limitations, we introduce the stochastic Hamiltonian process (SHP), a sample-based mathematical framework that tracks individual particle dynamics rather than the full node-wise density. We parameterize the time-dependent potential using neural network, yielding the Neural SHP solver. Numerical experiments on synthetic graphs demonstrate the scalability of our method relative to density-based baselines. Furthermore, we validate Neural SHP across two large-scale real-world networks, a PubMed citation network and a massive road network, demonstrating its robust efficiency for graph partition and routing problems on complex graph structures.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.40497 ↗

We introduce NEOPIC, a framework for learning the field operator in particle-based methods applied to kinetic plasma simulations. Its key novelty is a neural operator that acts directly on the empirical measure of the particles, rather than on a grid, and is evaluated at the particle positions. No mesh or tree is needed and, unlike grid-based neural operators, no deposition onto a mesh takes place, so the particle noise that dominates the inputs of particle simulations is not aliased. Since it replaces only the field solve, it serves as a plug-and-play field solver for particle-based methods: it can be trained on data from particle-in-cell, particle-in-Fourier or tree codes, and combined with any time integrator, including implicit schemes. We prove that the discrete evaluation coincides with the continuous operator at any number of particles (representation equivalence) and derive an error analysis that separates sampling, learning and time-stepping errors: up to the learning error, NEOPIC has the error structure of standard Monte Carlo particle methods. We show that the particle noise in the training data acts as an implicit regularizer, which gives guidance on the number of training particles in relation to the particle numbers used at inference. A complexity analysis shows that NEOPIC is an $O(N_p)$ method whose constants are set by the architecture alone, independently of any mesh or tree. Numerical experiments on electrostatic benchmarks in two and three dimensions, including Landau damping, two-stream and bump-on-tail instabilities, a cyclotron mini-app and a Penning trap, confirm the theoretical findings. A single model trained on several mini-apps generated by different reference methods captures all of them and remains stable up to twice the training time window, which points towards foundation models for fields in particle-based methods.

comments
84 pages, 19 figures, 3 tables. Code: https://github.com/srikrrish/operator_learning (tags neopic-arxiv-v1, neopic-arxiv-v1-nufft); analysis scripts: https://github.com/NEOPIC-framework/neopic-paper-scripts
fields
Numerical Analysis
pdf ↗ page arXiv:2610.40528 ↗

Algebraic Geometry45

We consider the problem of constructing maximal curves with few automorphisms over finite fields. Our main ingredient is the determination of the \(\operatorname{PGL}_2\!\left(\overline{\mathbb F}_p\right)\)-stabilizer of the roots of the Chebyshev polynomials, apart from two exceptional cases already treated in the literature. We prove that, in all other cases, the only nontrivial Möbius symmetry is the sign involution. This settles the general case for the automorphism groups of the corresponding Chebyshev curves. We further construct an infinite family of maximal curves of unbounded genus whose only nontrivial automorphism is the hyperelliptic involution. This reveals a contrasting phenomenon to the common heuristic that curves with many rational points tend to have large automorphism groups.

comments
16 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.37777 ↗

We construct a natural spectrahedral relaxation of a rigidly convex set (rcs) that depends only on the cubic part and on the degree of the defining real zero polynomial. For quadratic polynomials, we prove exactness and for a product of linear polynomials, we show that a higher order version of our relaxation is exact. We also establish a way of tightening the relaxation by moving the origin inside the rcs, and that the rcs is recovered by sweeping the origin over its interior. To obtain all these results we use a linear form that is closely connected to the zeros of a given real zero polynomial. We also prove that any rcs can be written as an affine linear slice of the cone of non-negative polynomials. Using this, we can define a hierarchy of tightenings that are spectrahedral shadows. We can show that this tightening is exact if the given polynomial admits a determinantal representation. This tightening is similar to a tightening of a hyperbolicity cone due to Kummer, Plaumann, and Vinzant.

comments
35 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.37850 ↗

The goal of this paper is to introduce a new notion of hyperbolicity for compact complex manifolds with trivial canonical bundle, called \textit{Calabi–Yau hyperbolicity}. We investigate its fundamental properties and establish a characterization in terms of the fundamental group. In particular, we show that no compact Kähler Calabi–Yau manifold is Calabi–Yau hyperbolic, highlighting the genuinely non-Kähler nature of this notion. We also investigate different techniques for constructing examples of such manifolds. Finally, we examine the relationship between Calabi–Yau hyperbolicity and Kobayashi hyperbolicity in the examples considered, highlighting obstructions to the latter in the Calabi–Yau setting.

comments
38 pages
fields
Algebraic Geometry, Complex Variables, Differential Geometry
pdf ↗ page arXiv:2610.37996 ↗

We study the geometry of Hurwitz–Brill–Noether spaces with vanishing conditions at a totally ramified point. Degeneration to a curve with an elliptic tail simplifies the combinatorics of Larson, Larson–Larson–Vogt, and Aggarwal, giving inductive proofs of Aggarwal's results in the one-point setting, and yields an efficient recursion for the algebraic Euler characteristics. Finally, when the expected dimension is negative, we give a numerical criterion ensuring the universal Hurwitz–Brill–Noether locus admits a component of expected relative dimension, generically finite over its image in the Hurwitz space, analogous to the existing results of Pflueger and Teixidor i Bigas for classical Brill–Noether loci.

comments
51 pages, 8 figures, 2 tables. Comments welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.38023 ↗

In this paper we study the Abel-Jacobi map of a genus 2 curve over $\mathbb{C}(t)$ arising from a double cover of $\mathbb{P}^2(\mathbb{C})$ branched along six lines. We utilize the so-called Mumford representations to conduct the calculations. As an application, we give an alternative proof of classical results on quartics and bitangents. Furthermore, we obtain a method to give explicit defining equations of quartic curves that have the six lines as bitangents and apply it to determine the number of connected components of the realization space.

comments
18 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.38071 ↗

Inspired by recent work of Inoue and Hallam-Lahdili, we prove an equivariant Miyaoka-Yau inequality with a correction term for smooth Fano manifolds admitting Kähler-Ricci solitons. It recovers the usual Miyaoka-Yau inequality in the Kähler-Einstein case. Our proof uses weighted equivariant Bogomolov-Gieseker and Langer inequalities for torsion-free sheaves, together with a weighted slope estimate for the canonical extension sheaf. We also construct toric examples showing that the existence of a soliton implies neither weighted semistability of the canonical extension sheaf nor nonnegativity of the equivariant Miyaoka-Yau number.

comments
v1: 54 pages; An earlier version of this paper was included as the second part of arXiv:2607.25181. The original manuscript has since been divided into two independent papers. Comments are welcome
fields
Algebraic Geometry, Complex Variables, Differential Geometry
pdf ↗ page arXiv:2610.38137 ↗

We study the asymptotic distributions of the Betti and Hodge numbers of the moduli spaces $\overline{\mathcal M}_{g,n}$ of stable pointed curves and the all-light Hassett spaces $\overline{\mathcal M}_{g,0|n}$, for fixed genus $g\ge1$ as the number of markings tends to infinity. We prove central limit theorems for the full Betti distributions, whose variances grow linearly in $n$ with leading coefficients independent of the genus. For the normalized even Betti numbers, we establish refined local limit theorems with estimates uniform in degree. These local estimates yield asymptotic formulas for individual even Betti numbers and determine the sharp central ultra-log-concavity thresholds $\frac{3(e-2)}{2(3-e)}$ and $3$, respectively. For $g\ge2$, the off-diagonal Hodge components form proportions of exact orders $n^{-1/2}$ and $n^{-1}$ of the total cohomology of the two spaces, respectively. The conditional distributions of the Hodge difference $p-q$ given $p\ne q$ converge, for both spaces, to a single discrete law independent of the genus. We also prove that tautological classes account for all but a proportion of exact order $n^{-1}$ of the even cohomology of $\overline{\mathcal M}_{g,n}$. The tautological degree distribution converges to the standard Gaussian under the centering and scaling of the ambient even Betti distribution. An explicit asymptotic formula for the ratio of the ordinary Euler characteristics of the light and heavy spaces answers a question of Kannan, Serpente and Yun. The proofs combine the heavy/light substitution with a stratification of the light spaces by stable cores, singularity analysis of Hodge generating functions, and refined Fourier estimates exploiting Poincaré duality.

comments
38 pages
fields
Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2610.38161 ↗

Let $V$ be a complex vector space of dimension $mk$ ($m\ge2$). A morphism from a positive-dimensional projective variety $f\colon X\to\mathrm{Gr}(k,V)$ is $m$-direct-sum if $V=U_{x_1}\oplus\cdots\oplus U_{x_m}$ for every $m$ pairwise distinct points $x_1,\dots,x_m$ on $X$, where $U_x\subset V$ is the subspace represented by $f(x)$. We show that $X$ is necessarily a smooth rational curve. When the so-called drill $d(f)$ of $f$ is $1$ or when the rank $k$ is at most $2$, we give complete classifications of $f$ up to the automorphisms of $\mathrm{Gr}(k,V)$. As applications, we classify all so-called skew scrolls in $\mathbb{P}^3$, which completely answers a question of Day. Then we show that if $X\subset \mathbb{P}(V)$ is a smooth, projective, nondegenerate subvariety whose higher-order Terracini locus is empty, then $X$ is the rational normal curve, which strengthens the critical Terracini rigidity discovered by Ballico and Chiantini. By using the same machinery, we also prove a dual version of Terracini rigidity. Finally, we show that $m$-unisolvent systems form an abelian category of finite length and that $7$ is the least diagonal exponent of a simple rank-three $2$-unisolvent system.

comments
25 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.38184 ↗

In this paper, we answer two basic questions concerning algebraic cycles on orthogonal Shimura varieties attached to lattices. First, we prove that Kudla's special cycles and Heegner cycles have the same rational span in every codimension. This fills a gap in the codimension-one argument of \cite[Remark 2.4]{BLMM17}, pointed out by Bruinier–Zuffetti \cite{BZ26}. Second, in dimension at least ten, we prove that the rational Picard group of the Baily–Borel compactification is generated by the Hodge class. The proof of the second result reduces, via isotropic induction on the discriminant form, to the K3-type case treated in our previous work.

comments
20 pages, any comments are welcome!
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2610.38187 ↗

A Calabi-Yau threefold of type K is a free quotient $X=(S\times E)/G$ of the product of a K3 surface and an elliptic curve. We construct a family of geometric Bridgeland stability conditions on $X$ by using Liu's product construction on $S\times E$ and then inducing along the Galois covering. The family has dimension $2h^{1,1}(X)$, and is disjoint from the $\widetilde{\GL}_2^+(\R)$-orbit of Li's stability conditions. These threefolds carry a K3 fibration, and the pushforward of an object from a smooth K3 fiber is (semi)stable if and only if it is (semi)stable on the K3 surface.

comments
11 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.38298 ↗

We prove that a quasi-$F$-split strict Calabi–Yau variety $X$ of dimension $d$ over an algebraically closed field $k$ of odd characteristic $p$ admits a smooth projective lifting over $W(k)$ if $p\geq d-1$, or if $p=d-2$ and $H^0(X,T_X)=0$. We also prove $W_3(k)$-liftability in odd characteristic.

comments
46 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.38427 ↗

Quoric manifolds are quaternionic analogues of quasitoric manifolds introduced by Hopkinson. Given a quoric manifold over a simple polytope, we study the stratification induced by the faces of the polytope. We then show that the equivariant derived category of constructible sheaves with respect to the face stratification is equivalent to the derived category of constructible DG-modules over a DG-algebra defined on the orbit space. Finally, we prove that the associated DG-algebra is formal.

comments
44 pages
fields
Algebraic Geometry, Algebraic Topology
pdf ↗ page arXiv:2610.38456 ↗

We study closed embeddings of the complex affine line into affine three-space. We prove that, for every such embedding, the complete-intersection normal map identifies the $\mathbb{A}^1$-fundamental sheaf of its complement with $\mathbf{K}_2^{\mathrm{MW}}$. The proof compares torsors under arbitrary strongly $\mathbb{A}^1$-invariant group sheaves. A nodal projection expresses a torsor by a normal parameter and finitely many node parameters. Extension across the node axes gives equations for the latter. Their correction terms increase a nilpotent filtration generated by the Milnor-Witt symbols of the branch-height differences. We deduce the vanishing of the first Alexander sheaf of every complex embedded line. We also construct polynomial rectifications using finite inverses and affine modifications, including rectifications of the Shastri trefoil and a harmonic figure-eight over $\mathbb{Z}[a]/(a^2-a+1)$, with arbitrary base change. The companion repository (https://github.com/qft98romanov-hash/abhyankar-moh-trefoil) contains explicit rectifiers, their inverses, proofs, and symbolic checks. We prove that a normal map with a polynomial section and geometric generic affine-line fiber is a coordinate projection. We formulate the remaining rectifiability and descent questions; the general complex rectifiability problem is not settled here. An appendix treats other fields, normal orientations, and arithmetic descent.

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

If $X$ is a K3 surface with complex multiplication by a CM field $E$, Kazuhiro Ito proved that the height of the reduction of $X$ in characteristic $p>0$, and its Artin invariant if it is supersingular, can be computed from the decomposition of $p$ in $E$. We present analogous results for cubic fourfolds by using the main theorem of complex multiplication for cubic fourfold, proved by Rikuto Ito.

comments
22 pages
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2610.38498 ↗

Using vector bundle theory, we prove that an essential hyperplane arrangement in an $\ell$-dimensional vector space over a field of characteristic zero is free if and only if its module of logarithmic derivations of order $p$ is free for some $1\le p\le\ell-1$. The same statement holds for multiarrangements.

comments
10 pages
fields
Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2610.38550 ↗

We prove that every smooth well formed Fano or Calabi-Yau weighted complete intersection admits a nef-partition. As an application, we establish the existence of weak Landau-Ginzburg models for all such Fano weighted complete intersections.

comments
9 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.38727 ↗

We prove that every smooth complex projective contact Fano manifold is homogeneous under its connected contact automorphism group. The argument extends and simplifies the incidence method of our earlier proof of the LeBrun–Salamon conjecture. After the classical reductions, balanced transverse rational maps through every point yield tangent sections extending across the nodal boundary. These establish irreducibility and nonlinearity of the general variety of minimal rational tangents associated with contact lines, enabling Hwang's descent theorem to produce global vector fields generating the tangent bundle. Consequences include very ampleness of the contact line bundle, embeddedness of every balanced rational map, Kähler–Einstein existence, K-polystability, and the LeBrun–Salamon conjecture.

comments
22 pages. All comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.38736 ↗

The well-established theory of D-modules gives a framework to study linear differential equations from the perspective of algebraic geometry. A significant advancement in this theory has been the introduction of Twistor D-modules by Claude Sabbah and Takuro Mochizuki: These objects expose inherent, but hidden information of the underlying differential equations in an elegant way. We explain the foundational concepts of Twistor D-modules and give concrete examples of these objects. We introduce a notion of rigidity for Twistor D-modules, which these examples fulfill. We conclude with a certain algebraicity conjecture about rigid Twistor D-modules, which we prove in a special case.

comments
112 pages. Questions and suggestions welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.38751 ↗

Let $X\subset\mathbb{P}^n_\mathbb{C}$ be a smooth hypersurface of degree $d\ge2$, with $n\ge3$. We prove that an $m$-dimensional integral projective family of lines sweeping a variety of dimension $y$ satisfies $m\le\max\{2y-d-1,n-3\}$. This proves the de Jong-Debarre conjecture for $d\le n$ and the Beheshti-Starr bound for lines on smooth hypersurfaces for $d\ge n+1$.

comments
16 pages, comments welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.38812 ↗

We prove the existence of moduli spaces for algebraic stacks with a weak action of $Θ= [\mathbb{A}^1/\mathbb{G}_m]$ (including stacks of filtered objects and unstable $Θ$-strata) for which the center admits a good moduli space and the retraction to the center has flat, finitely presented relative inertia, providing a stack-intrinsic generalization of the existence of non-reductive Geometric Invariant Theory quotients. As an application, we construct quasi-projective coarse moduli spaces of principal bundles over a smooth projective curve with non-reductive structure groups, including moduli spaces of Ramanathan unstable principal bundles of fixed Harder–Narasimhan type.

comments
68 pages, comments welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.38837 ↗

The classical Gaschütz Lemma states that for a surjective morphism $G\to H$ of finite groups, generators $h_1,\ldots,h_d$ of $H$ can be lifted to generators $g_1,\ldots,g_d$ of $G$, provided that $G$ can be generated by $d$ elements. We prove an analog of this statement for linear algebraic groups. This has applications to the algebraic-geometric theory of linear differential equations: We show that every regular singular differential embedding problem over the rational function field has a regular singular solution. We also establish a purely algebraic variant of the Riemann-Hilbert correspondence on the punctured projective line that works over any countable algebraically closed field of characteristic zero.

comments
46 pages
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2610.38919 ↗

We classify possible Amitsur groups of smooth imprimitive Fano threefolds defined over $\cc$ that admit a faithful action of a finite group.

comments
48 pages; comments welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.38963 ↗

We develop an intrinsic theory of spectral structures on holomorphic vector bundles over compact Riemann surfaces, generalising eigenspace decompositions without eigenvalues. Their geometric realisations are presentations of vector bundles as pushforwards of line bundles along finite branched covers. We construct their analytic moduli stack locally of finite presentation and identify it with the relative Picard stack of the universal family of finite covers. We prove that the forgetful morphism to the stack of vector bundles is representable by analytic spaces and is smooth and surjective on a distinguished smooth open substack. Consequently, every holomorphic family of vector bundles locally admits spectral presentations along smooth connected simply branched covers, and these presentations can be deformed alongside the underlying bundles. The relative Picard description yields explicit local dimension formulas and recovers the stack of regular Higgs bundles as base change along the Hitchin base. We also characterise the additional data supplied to a spectral structure by a regular Higgs field as a global twisted generator, and give examples of smooth connected spectral structures which cannot arise from any Higgs field.

comments
81 pages, 28 examples
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2610.38972 ↗

We show that there are infinitely many choices of the multiplicities in the logarithmic transformation step of the Alpöge–Claude construction which produce a complex threefold diffeomorphic to the six-sphere. Moreover, distinct choices of the multiplicities yield biholomorphically inequivalent complex structures.

comments
15 pages
fields
Algebraic Geometry, Complex Variables, Differential Geometry
pdf ↗ page arXiv:2610.39102 ↗

We prove the Nekrasov–Shatashvili vanishing blowup equation for the local Gromov–Witten theory of smooth weak del Pezzo surfaces, by identifying its unique formal solution with the inverse of the local-relative correspondence. We construct this inverse through an associative set-partition convolution and establish the identification using Zagier's recursion for the Bloch–Okounkov $n$-point function. The proof applies in all genera and includes non-toric surfaces.

comments
32 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.39127 ↗

We introduce generalized Iskovskikh surfaces and study their relation to quasi-étale double covers. As an application, we prove that a del Pezzo surface of degree $2$ over an infinite field of characteristic different from $2$ is unirational if it has a rational generalized Eckardt point. This resolves a previously open case not covered by Manin's construction.

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

Let $X=V_5$ be the quintic del Pezzo threefold. Along the negative zero-tilt-slope paths for rational-curve ideal classes, degree five is the first degree admitting a positive point correction. We determine the resulting degree-five outer good moduli space: it is reduced with exactly two irreducible components, a normal ten-dimensional principal branch and a smooth corrected branch $X\times\mathrm{Gr}(2,7)$. Their scheme-theoretic intersection is a normal determinantal ninefold. Along its singular locus, the principal branch has transverse rank-one $2\times 4$ determinantal singularities, while the intersection has the corresponding $2\times 3$ singularities. We construct an explicit small resolution of the principal branch as the projectivization of a rank-five extension bundle over the blow-up of the Altavilla–Petković–Rota Kuznetsov-component sixfold along its point locus. Uniform wall exclusion and point-correction bounds for degrees two through five establish the first correction threshold; the corrected degree-five factors are precisely the ideals of elliptic linear sections parametrized by $\mathrm{Gr}(2,7)$.

fields
Algebraic Geometry
pdf ↗ page arXiv:2610.39336 ↗

We prove Bloch's conjecture for (anti-)symplectic automorphisms of smooth projective complex K3 surfaces of Picard number two. Together with the recent result for abelian surfaces and the known K3 cases, this settles the remaining case of Bloch's conjecture for (anti-)symplectic automorphisms of smooth projective complex surfaces with trivial canonical bundle. More generally, we prove Bloch's conjecture for (anti-)symplectic derived autoequivalences of projective K3 surfaces whose Picard number is at least three, or is two with anisotropic Néron–Severi lattice. The key new result is the congruence property of the subgroup generated by reflective involutions in $O(U\oplus N)$ for anisotropic even lattices $N$ of signature $(1,1)$. Combined with the local generation theorem and Chow-theoretic criterion of Li–Yu–Zhang, this gives the required reflective decompositions and their consequences for zero-cycles.

comments
Comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.39368 ↗

We prove the three balancing inequalities conjectured by the authors about 20 years ago: moving one unit from a larger index to a smaller one cannot decrease a mixed tautological intersection number, whether the two distinguished insertions are psi classes, kappa classes, or Hodge Chern classes.

comments
14 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.39462 ↗

Let $C_{p, 2}(\mathbb{P}^{n})$ denote the Chow variety parametrizing effective algebraic $p$-cycles of degree two on $\mathbb{P}^{n}$. We show that its rational cohomology is pure Tate and concentrated in even degrees. An anti-invariant Chern class identity yields a presentation of the cohomology ring as a fiber product, which in turn determines the cohomology over $\mathbb{Z}[1/2]$. We identify the ordinary Poincaré polynomial with the known virtual formula, determine the optimal ranges over which the coefficients stabilize, and compute the nonrational Poincaré series of the stable space $D(2)$. For the Lawson–Michelsohn map $D(2)\longrightarrow D(\infty)$, the first nonzero rational homotopy kernel occurs in degree eight and is one-dimensional, while the integral kernel has rank one. Finally, we compute the relative homology of the pair $(D(2),BU)$ over $\mathbb{Z}[1/2]$ and show that additional cohomology generators and nonzero rational homotopy kernels arise in unbounded degrees.

comments
16 pages. Comments are welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.39498 ↗

We classify finite groups of automorphisms of smooth quartic threefolds over $\mathbb{C}$. Every such group embeds into one of $17$ maximal groups, which we realize by explicit equations and matrix generators. Among finite subgroups of $\mathrm{PGL}(5,\mathbb{C})$ preserving a smooth quartic threefold, there are exactly $24$ maximal ones up to conjugacy, and we use them to determine the $194$ groups that occur as full automorphism groups. As an application, we classify the finite groups of projective automorphisms of smooth quartic surfaces and show that there are exactly $12$ maximal ones up to conjugacy in $\mathrm{PGL}(4,\mathbb{C})$.

comments
30 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.39627 ↗

We introduce a solid ring of arithmetic differential operators analogue to Berthelot's D-dagger, and its derived infinity-category of solid quasi-coherent modules. We show that there is a fully faithful functor from Berthelot's derived category of bounded complexes of D-dagger-modules with coherent cohomology into our new category.

fields
Algebraic Geometry
pdf ↗ page arXiv:2610.39799 ↗

We prove that a smooth projective threefold or fourfold whose bounded derived category admits no nontrivial semiorthogonal decomposition has nef canonical divisor, confirming the Kawatani–Okawa conjecture in these dimensions. The proof combines the classification of extremal contractions with constructions of admissible subcategories. In dimension four, we refine the descriptions of isolated surface fibers and construct exceptional objects supported on certain fibers.

comments
26 pages; Comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.39838 ↗

We study compatibility of perverse truncations for morphisms between Ngô fibrations with rationally smooth total spaces. We show that, under an effective rank inequality, equivariant pullbacks preserve the normalized perverse truncations. Applied to the diagonal, this gives multiplicativity of perverse truncations for Hitchin systems with rationally smooth total spaces.

fields
Algebraic Geometry
pdf ↗ page arXiv:2610.39945 ↗

We prove an equivalence between the existence of a unique Kähler-Einstein metric on a degeneration of Fano varieties and uniform CM minimization. This proves a discretely valued analogue of the (uniform) Yau-Tian-Donaldson conjecture, in the sense of non-Archimedean geometry. As a main tool, we prove that Ding stability of a degeneration implies uniform Ding minimization, proving a converse to work of Blum-Xu. We also prove an analogous result in geometric invariant theory (GIT), stating that uniform GIT height minimization of a family of points is equivalent to GIT stability, proving a converse to work of Wang, Wang-Xu and the author.

comments
30 pages, comments welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.39996 ↗

In this note we show that Terao's freeness conjecture holds for arrangements of at most nine planes in the complex projective $3$-space. Moreover, we show that every essential and irreducible free arrangement of at most nine planes in $\mathbb{P}^{3}_{\mathbb{C}}$ is divisionally free, and we list all intersection lattices of such arrangements. Our approach is based on Ziegler's restriction theorem and a simple count involving the numbers of multiple lines. As a by-product, we show that Cynk–Szemberg octic arrangements are never free. Finally, motivated by a recent work of Dimca and Pokora, we present examples of weak Ziegler pairs of plane arrangements, including pairs of octic arrangements leading to rigid double octic Calabi–Yau threefolds.

fields
Algebraic Geometry
pdf ↗ page arXiv:2610.40028 ↗

Physical heuristics suggest that the space of Bridgeland stability conditions of a projective Calabi-Yau manifold $X$ should be related to the moduli space of complex structures on its mirror $X^\vee$. On the other hand, recent work in the literature introduces a modular partial compactification, $\mathcal{A}\mathrm{Stab}(X)$, of a quotient of the space of stability conditions on $\mathcal{D}^{b}(X)$. We provide some mathematical evidence for the aforementioned heuristics by proving that for curves and surfaces, certain boundary strata in $\mathcal{A}\mathrm{Stab}(X)$ describe degenerate complex structures on $X^\vee$. Along the way, we introduce a criterion for producing boundary points of $\mathcal{A}\mathrm{Stab}(\mathcal{D})$ when $\mathcal{D}$ is an arbitrary $k$-linear triangulated category. As a byproduct, we deduce the existence of Bridgeland stability conditions on certain quotients of the derived categories of K3 and Enriques surfaces.

comments
40 pages, 1 figure
fields
Algebraic Geometry, Mathematical Physics, Symplectic Geometry
pdf ↗ page arXiv:2610.40035 ↗

We investigate the question of which Brill–Noether special linear series on a curve on a K3 surface lift to the surface. Work of Reid, Donagi–Morrison, Green–Lazarsfeld, Lelli-Chiesa, and others shows that Brill–Noether special linear series admits lifts in many cases, in particular when the linear series computes the Clifford index of the curve. Using the recently defined notion of harmonic filtrations of Lazarsfeld–Mukai bundles, we show the same is true for a linear series computing the Brill–Noether special Clifford index, an analogue of the classical Clifford index considering only Brill–Noether special linear series, and show that the Brill–Noether special Clifford index is constant in linear series on K3 surfaces.

comments
32 pages, 1 table. Comments welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.40074 ↗

Assuming the existence of good minimal models, we give a bimeromorphic classification of compact connected Kähler manifolds admitting a holomorphic 1-form without zeros.

comments
38 pages
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2610.40097 ↗

We prove that the moduli space $\mathcal{A}_6$ of principally polarized abelian sixfolds has Kodaira dimension zero, determining the remaining case in the Kodaira classification of the spaces $\mathcal{A}_g$. More precisely, every nonzero scalar Siegel modular form of genus six, weight $k$ and positive boundary order $b$ satisfies $k\geq 7b$, with equality precisely for powers of the weight-fourteen harmonic theta series of Dittmann, Salvati Manni and Scheithauer. The canonical ring is therefore a polynomial ring on one generator of degree two. We also prove numerical dimension zero and construct the unique projective $\mathbb{Q}$-factorial terminal minimal model. Its Picard number is one and its canonical divisor has order two. The perfect cone compactification is a Mori dream space, and the birational automorphism group of $\mathcal{A}_6$ is trivial. The proof combines normal vanishing on the Prym locus, polar intersections on abelian boundary fibers, and an exact theta calculation. A discrepancy estimate recovers the modular open subset from the minimal model.

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

Let $p$ be a prime. We construct a coherent formalism of geometric operations on Cartier modules with coefficients in ind-coherent sheaves on noetherian derived $\mathbb F_p$-schemes. For such a scheme $X$, we consider the stable presentable category $\mathrm{Cart}(X)$ of ind-coherent sheaves $M$ equipped with a structural morphism $F_{*,X}M \to M$, where $F_X$ denotes the Frobenius endomorphism. We construct pushforward functors for arbitrary morphisms and exceptional pullback functors for separated morphisms almost of finite type, together with coherent composition and base-change equivalences. We single out conditions under which these functors admit further adjoints. On derived schemes separated and almost of finite type over $\mathbb F_p$, we construct compatible closed symmetric monoidal structures given by shriek tensor products, and establish which functors are symmetric monoidal. The constructions arise from a general procedure for forming functor formalisms of Cartier objects, using their description as lax limits and the universal properties of span $2$-categories developed by Cnossen–Lenz–Linskens [arXiv:2505.19192].

comments
85 pages. Comments very welcome!
fields
Algebraic Geometry, Category Theory
pdf ↗ page arXiv:2610.40200 ↗

Let $\overline{\mathbf{Y}}(w)\to\overline{\mathbf{X}}(w)$ be the ramified Galois cover of compactified Deligne–Lusztig varieties. Our objects of study are the Lefschetz numbers for the action of the finite covering group $T^{wF}$ on the coherent cohomology of the structure sheaf of $\overline{\mathbf{Y}}(w)$. The Lefschetz numbers for all elements of $T^{wF}$ determine the virtual $T^{wF}$-representation given by the alternating sum of these cohomology groups. In the two cases of Deligne–Lusztig surfaces of type $A_2$ and ${}^{2}A_2$, we give explicit formulas for the Lefschetz numbers for a generator of the stabilizer of an irreducible component. It follows that the equivariant Euler characteristic of the compactification $\overline{\mathbf{Y}}(w)$ is not virtually free as a virtual module over the covering group.

comments
60 pages, 4 figures
fields
Algebraic Geometry, Number Theory, Representation Theory
pdf ↗ page arXiv:2610.40335 ↗

We study cohomological Donaldson-Thomas invariants of perfect complexes in a semistable degeneration of projective Calabi-Yau threefolds, with smooth components $X_1,X_2$ meeting along a smooth anticanonical surface $S$. The generic fiber of degeneration family is a $(-1)$-shifted symplectic stack. Over the special fiber, the derived restriction to $S$ is derived Lagrangian, and its homotopy fiber product is also $(-1)$-shifted symplectic. Our goal is to relate the categorical DT invariants of the generic fiber moduli, induced by periodic cyclic homology of matrix factorization category of 0-shifted potential functions over such moduli, to that of the special fiber obtained via derived Lagrangian intersection and geometric quantization. This is achieved via construction of a flat Gauss-Manin connection that relates the generic fiber cohomological DT invariants to that of the special fiber. The geometric framework, universal trace diagrams, and fourfold foliation were developed jointly with Jacob Kryczka in arXiv:2510.20325. Here we construct ordinary critical realizations, oriented cyclic-to-bar comparisons, and Gauss-Manin operators, and verify finite specialization in explicit moduli problems. We workout our construction via several explicit examples such as Grassmannians, Relative Hilbert Schemes and moduli space of pure 2 dimensional sheaves with support moving in a fixed linear system of divisors in the ambient threefold.

comments
183 pages, comments are welcome
fields
Algebraic Geometry, Symplectic Geometry
pdf ↗ page arXiv:2610.40336 ↗

We study the moduli space of $λ$-connections with ramified singularities on a smooth projective curve $X$. We construct a quasi-projective relative moduli scheme $M^α_{\mathrm{Hod}} \to Λ$ of $α$-stable $λ$-connections over a base parameter space $Λ$. This moduli space connects the irregular de Rham moduli space ($λ=1$) and the irregular Dolbeault moduli space of Higgs bundles equipped with non-zero irregular local exponents ($λ=0$). Furthermore, we show that $M^α_{\mathrm{Hod}}$ is smooth over $Λ$ and carries a canonical relative symplectic form $ω_{M^α_{\mathrm{Hod}}/Λ}$, yielding a natural Poisson structure on the total space.

comments
40 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.40352 ↗

We prove that KSB-stable varieties introduced by Kollár and Shepherd-Barron as a generalization of Deligne-Mumford's stable curves are stable in the sense of geometric invariant theory (GIT). More precisely, we show that KSB-stable varieties are asymptotically GIT-stable with respect to a sequence of linearizations defined by the Hodge bundle.

comments
21 pages. Comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.40583 ↗

Information Theory44

Classical pooled-testing rules choose pool sizes to reduce the number of tests. In practice, however, samples arrive over time, pools take time to form, testing capacity is finite, and positive pools create bursts of follow-up work. These operational features can make the test-efficient pool size far from the delay-efficient one. We formulate pooled testing with stochastic arrivals and finite testing capacity as a queueing system, and derive exact performance representations and asymptotic scaling laws for fixed-batch Dorfman testing and a dynamic two-threshold policy. The analysis reveals three distinct design regimes. When test usage is the main concern, the classical Dorfman rule is recovered and the optimal pool size scales with the inverse square root of prevalence. When delay accumulated while the laboratory is busy testing another batch matters, positive pools create service-time variability that grows more rapidly with pool size than the mean retesting burden, and the optimal scale shifts to the inverse cube root of prevalence. When waiting to assemble a pool is itself costly, the optimal fixed pool size remains bounded even as prevalence becomes very small. Under severe capacity scarcity, congestion remains relevant at the classical Dorfman scale: the square-root law survives, but with a capacity-dependent constant. Dynamic pooling separates two operational decisions that fixed pool sizes conflate. A lower threshold determines when routine testing should begin, while an upper threshold limits pooling when backlog is high. The lower threshold follows the cube-root scale, whereas the upper threshold primarily acts as congestion control. The results show how prevalence, capacity, and delay jointly determine pooling decisions and explain why operationally optimal pools can be much smaller than those suggested by test-efficiency calculations alone.

fields
Information Theory, Optimization and Control, Probability
pdf ↗ page arXiv:2610.37729 ↗

Closed-form fractional programming (FP), weighted MMSE (WMMSE), and the 2026 surrogate-enhanced methods SEFP and XMMSE all maximize the weighted sum rate by iteratively maximizing a surrogate linear in the interference power. We show that this family admits a unique best member: the interference-conjugate transform (ICT), which replaces each rate term $\log(1+a/b)$ by $\max_{κ\ge0}[Ω(κa)-κb]$, where $Ω$ is the closed-form partial convex conjugate of the rate in the interference variable and the optimal multiplier is the interference price $a/(b(a+b))$. We prove that, for any fixed price, $Ω(κ\,\cdot)$ is the pointwise largest own-signal function compatible with a valid interference-linear lower bound, and that tightness at an anchor forces the price. Hence all four benchmark surrogates, which share this price and differ only in their own-signal term, are dominated pointwise by ICT. At SINR $γ$, the benchmarks' own-signal curvature exceeds the true curvature by factors behaving as $γ/2$ (FP/WMMSE) and $(\logγ)/2$ (SEFP/XMMSE), against $1+1/(γ(γ+2))$ for ICT, and this ordering carries over to the certified ascent per iteration and the asymptotic linear convergence rate. ICT yields closed-form updates at the benchmarks' per-iteration cost for single-antenna power control, uplink joint scheduling and power control, and multi-cell MISO beamforming, and the first solver-free algorithm for sum-least-$q$th-percentile rate maximization, via a $K$-dimensional convex dual with closed-form gradient and Hessian and a certified duality gap. In uplink scheduling, ICT improves proportional-fairness utility over FP by +7.03 and over SEFP by +3.35 (60/60 drops) using 18.7 iterations per slot vs. 49.7 and 38.0; in MISO beamforming with $M=8$, it reaches 99.9% of its final value in a median of 9 iterations vs. 16 (XMMSE) and 1160 (FP/WMMSE).

fields
Information Theory
pdf ↗ page arXiv:2610.37794 ↗

The short-time Fourier transform (STFT) characterizes the local frequency content of time-varying signals by evaluating the discrete Fourier transform over a sliding analysis window. The STFT is governed by a fundamental resolution trade-off: a short window localizes rapid transients in time at the cost of frequency resolution, whereas a long window resolves closely spaced harmonics at the expense of temporal resolution. The Universal Short-Time Fourier Transform (U-STFT) resolves this trade-off sequentially by modeling the analysis window duration as a data-adaptive state variable that indexes the number of hops included in the current observation interval. At each frame, a bank of candidate window durations is scored using normalized order-three Rényi entropy to quantify joint time-frequency concentration. A window length trellis aggregates the resulting $\mathcal{O}(3^M)$ candidate window schedules with linear complexity per frame, guaranteeing a cumulative mix-loss regret bound of $\mathcal{O}((k+1)\log M)$ relative to any hindsight window schedule with $k$ resolution changes over $M$ frames. By linearity of the Fourier transform, posterior expectation across the candidate bank yields a single spectrum equivalent to an STFT evaluated with a data-adaptive effective window, while an envelope-normalized synthesis stream guarantees exact overlap-add reconstruction. Evaluations on synthetic and marine bioacoustic signals demonstrate adaptive resolution tracking, enhanced spectral concentration, and exact time-domain invertibility.

comments
12 pages; 7 figures; SANE 2026, ASA 2026
fields
Information Theory
pdf ↗ page arXiv:2610.37795 ↗

A unified Fourier framework for quantum weight enumerators of prime-power-dimensional qudits is developed in this paper. We introduce the notions of Weyl power spectrum and Weyl-conjugation autocorrelation for the Weyl-operator quantities nderlying the Shor–Laflamme weight enumerators. Representing these quantities as formal vectors, we show that they form a symplectic Fourier transform pair, from which the quantum MacWilliams identity follows by applying the Hamming-weight functional. This framework extends to a family of twisted Fourier transforms, including the Rains shadow transform. We show that identical-copy Bell sampling corresponds to a twisted autocorrelation related to the shadow enumerator through Weyl translation and Hamming projection. We further prove that all twisted Fourier transforms are Weyl translations of either the ordinary MacWilliams transform or the Rains shadow transform. This two-class reduction implies that the twists yield no additional independent coefficientwise positivity constraints under compatible projections. Nevertheless, the framework leads to refined MacWilliams and shadow identities that retain more Fourier information than ordinary Hamming weight enumerators. We employ these refined identities in linear programming, together with simplex mapping and shadow-coset counting, to exclude surviving candidate weight distributions. These techniques yield tighter bounds for binary and qutrit quantum codes, including nonexistence results for specific code parameters.

comments
19 pages, 1 figure, 3 tables
fields
Information Theory
pdf ↗ page arXiv:2610.37894 ↗

Unmanned Aerial Vehicles (UAVs) are increasingly deployed in wireless networks; however, ensuring secure communication and efficient energy usage remains challenging. This paper addresses the joint trajectory optimization and resource allocation problem in UAV networks in the presence of a tethered UAV flying center and a malicious ground eavesdropper. In the proposed model, UAVs are equipped with energy harvesting capabilities and can adaptively switch between transmitting, jamming, and relaying roles to deliver data to a tethered UAV center for optimized network performance. An optimization problem is formulated to maximize a utility function that balances secrecy rate, energy consumption, and interference. To address the high non-convexity of the problem and its real-time decision requirements, a Proximal Policy Optimization (PPO)-based Deep Reinforcement Learning (DRL) algorithm is proposed to solve the problem and learn the network dynamics. Extensive simulation results demonstrate that the proposed approach achieves superior secrecy performance, lower energy consumption, and reduced interference compared to conventional and DRL-based methods.

comments
This paper has been submitted for possible publication as a journal paper and is currently under review
fields
Information Theory
pdf ↗ page arXiv:2610.37897 ↗

We quantify the error of the strict-radius Kraskov–Stögbauer–Grassberger (KSG-1) mutual-information estimator on a Gaussian channel as the sample size \(n\) grows and the channel becomes nearly deterministic. For fixed dimension \(p\) and neighbor index \(k\), we define the resolution parameter \(u_n=ne^{-I_n}\), where \(I_n\) is the true mutual information in nats. When \(u_n\to u\in(0,\infty)\), we prove that the estimation error converges in mean square to a computable deterministic bias \(B_{p,k}(u)\). Sampling fluctuations therefore vanish, while an additive bias can persist. We derive this bias from an explicit marked-Poisson law for the neighborhood counts, characterize its small-\(u\) asymptotics, and show that it tends to zero as \(u\to\infty\). The same law describes how often neighborhoods saturate, meaning that they make the largest possible contribution to the estimate. The limiting saturation probability decreases continuously and strictly from one to zero, allowing a Gaussian-model bias correction on fixed critical intervals. Finite-sample experiments show substantial bias even when the true information lies below the estimator's logarithmic ceiling and saturated neighborhoods are rare. Saturation-based correction reduces estimation error in these experiments, though recovering the resolution parameter from the observed saturation fraction can remain difficult when saturation is rare.

fields
Information Theory
pdf ↗ page arXiv:2610.37941 ↗

This paper presents a federated learning (FL) framework for semantic communication (SemCom) over the multiple access channel (MAC), where multiple distributed transmitters simultaneously convey semantic information to a common receiver using end-to-end learned semantic representations. Semantic feature extraction, compression, wireless transmission, and semantic inference are jointly optimized through FL-based SemCom. Unlike conventional SemCom systems that train users independently, simultaneous semantic transmissions over the MAC enable concurrent training of multiple transmitters within the same transmission interval, thereby reducing training overhead and channel usage. Federated semantic aggregation is incorporated with shared and personalized encoder components, allowing transmitters with limited local training data to benefit from semantic representations learned from transmitters possessing larger datasets while preserving local adaptation. Evaluated using the CIFAR-10 dataset over fading channels, the proposed approach maintains high semantic inference accuracy under shared wireless access and significantly improves performance under severe data imbalance. In the meantime, simultaneous semantic transmissions can significantly reduce training overhead while preserving robust semantic performance across distributed transmitters with heterogeneous local datasets. These results highlight the potential of combining FL and SemCom to support scalable and communication-efficient edge intelligence in future wireless networks.

fields
Information Theory
pdf ↗ page arXiv:2610.37951 ↗

We prove a new lower bound on the $b$-symbol weight of codewords in dual Melas codes, which is strictly better than known results. We employ a new strategy that translates a pattern counting problem in linear-feedback shift register sequences to a problem on orbits of binary polynomials under a certain action. We use the same techniques to provide an improved lower bound on the burst-covering radius of Melas codes and a new upper bound on the critical exponent of dual Melas codes. We then define a new randomness postulate on (families of) binary sequences, based on the definition of infinite Poisson generic sequences. We conjecture that codewords in the dual Melas code satisfy this postulate, and we show partial progress in establishing this conjecture. We also show how a relaxed version of the problem can be completely resolved, and relate the conjecture to the first part of the paper, giving a justification of why the improved bounds on the $b$-symbol weight were somewhat to be expected.

comments
25 pages
fields
Information Theory
pdf ↗ page arXiv:2610.38017 ↗

This paper studies when list-decodability guarantees for error-correcting codes of good distance can go beyond the classical Johnson radius and gives a corresponding efficient list-decoding algorithm for Reed-Solomon codes up to this new radius. The Johnson bound shows that any error-correcting code with distance $δ$ is automatically list-decodable with small list size up to a certain radius $J(δ)$ around any received word $r$. We show that if the received word $r$ is known to have some codewords that are somewhat close to it (we call these ``hints"), then $C$ is list-decodable with small list size up to an even larger radius around $r$. We determine the optimal list-decoding radius in this setting for single and multiple hints over both large and small alphabets and show that this radius is the optimum of a natural convex program. Remarkably, even a single hint that is $(J(δ)-ε)$-close to $r$ improves the list-decoding radius around $r$ to $J(δ)+ε'$. Finally, we give an efficient algorithm, based on the weighted Guruswami-Sudan decoder, that list-decodes Reed-Solomon codes up to this optimal radius.

fields
Information Theory
pdf ↗ page arXiv:2610.38022 ↗

Bounds based on Integral Probability Metrics (IPMs) are ubiquitous in machine learning and statistics, appearing, e.g., in generalization, alignment, fairness, and privacy. IPMs reduce the discrepancy between two distributions to a single worst-case gap between expectations. This compression is costly: for rare events, safety failures, or under-represented groups, IPM-based bounds are loose or vacuous. We introduce a non-linear generalization of IPMs, which we term Integral Probability Boundaries (IPBs). Unlike IPMs, IPBs provide bounds that are tight at the extremes. We derive their basic properties and present algorithms for estimating them in practically relevant settings. We demonstrate the usage of IPBs in both theoretical and practical applications for alignment, judge-free performance estimation, and fairness, where they enable us to obtain sharp bounds on performance and fairness gaps, e.g., 15 p.p. more precise estimates on fairness gaps for rare groups in a realistic generative modeling task, compared to the state of the art.

comments
NeurIPS 2026
fields
Information Theory
pdf ↗ page arXiv:2610.38036 ↗

We revisit the Gray-Wyner problem of lossy compression of bivariate Gaussian sources under the quadratic distortion measure and derive the exact second-order asymptotics. Specifically, we first identify the boundary rate tuples using the explicit first-order asymptotics by Yu (TIT 2023) and then characterize the tradeoff among three second-order coding rates subject to a constraint on the joint excess-distortion probability. Our main contribution is the achievability proof, where we derive a covariance shell covering lemma that is analogous to the type covering lemma for the discrete case. In particular, our covering lemma classifies the source sequences into power shell types via their empirical covariance matrix. For each such power shell type, we derive sufficient conditions on the compression rates so that covering within distortion levels are achievable. Finally, asymptotical analysis via the Berry-Esseen theorem yields the desired result.

fields
Information Theory
pdf ↗ page arXiv:2610.38306 ↗

Current wireless communication systems are designed based on channel models obtained under the assumption of far-field operation, where electromagnetic waves can be approximated by a planar wave. In those circumstances, dualpolarized antennas seem to be the optimal solution for maximizing the spectral efficiency. However, the recent research on XLMIMO systems represents a paradigm shift, since communication may take place in the near-field and an additional degree of freedom can be achieved. This work presents a modular, lowcost tripolarized antenna at 2.4 GHz band, that is used to experimentally validate theoretical findings about tripolarized antennas, which are commonly based on orthogonal infinitesimal dipoles. The evaluation is carried out in two indoor scenarios and one outdoor scenario, with transmitter comprising multiple tripolarized antennas and a receiver equipped with a single tripolarized antenna. We show that this type of antenna can increase the number of spatial streams up to three or extend the region where terminals are able to achieve two spatial streams

comments
Submitted to IEEE Communications Magazine
fields
Information Theory
pdf ↗ page arXiv:2610.38377 ↗

Random access codes (RACs) encode a $q$-ary input string into fewer $q$-ary symbols while allowing any requested input symbol to be recovered with probability above the random-guessing value $1/q$. However, it remains unclear what asymptotic guarantees on compression and recovery probability should be required of RACs. We address this question by introducing the notion of asymptotically good RACs and give two polynomial-time constructions. First, an $[n,k,d]_q$ linear code with $d\ge2$, together with an encoder based on its orthogonal-array property, yields an $(n,n-k)_q$-RAC with worst-case decoding success probability \[ p_{\rm wc}=\frac{1}{q}+\left(1-\frac{1}{q}\right)\frac{d-2}{n}. \] These OA-RACs are asymptotically good whenever the underlying linear codes are, and Garcia–Stichtenoth algebraic-geometry codes give a concrete polynomial-time realization. Second, a direct-sum strategy using OA-RACs derived from $q$-ary Hamming codes and the trivial $(1,1)_q$-RAC yields asymptotically good RAC families at every prescribed RAC rate $R_{\rm RAC}=(n-k)/n\in(0,1)$. Numerical results demonstrate favorable finite-length performance of both constructions.

comments
13 pages, 5 figures,
fields
Information Theory
pdf ↗ page arXiv:2610.38429 ↗

Allowing for small fraction of errors in retrieved stored binary patterns, Hopfield-Hebbian neural network (NN) associative memory dynamics [14] achieves linearly scaled capacity. The famous proportionality constant $α_c\approx 0.14$ is obtained in a large dimensional scenario as the ratio of the number of reliably stored patterns $m$ and the patterns' length $n$ under the assumption that uniformly randomly chosen binary patterns are \emph{independent} among themselves. While such an idealized scenario is now well understood, more practical scenarios with correlated/noisy datasets remaining challenging even for classical statistical mechanics replica approaches. We consider precisely such practical settings where each \emph{archetype} pattern is replaced with $M$ correlated \emph{examples} with parameter $r$ governing the quality of correlation. We develop a powerful Random Duality Theory (RDT) based framework to analyze correlated data and already on the first level of RDT lifting obtain capacity characterizations that remarkably well match behavior exhibited through simulated dynamics. Moreover, characterizations explicitly feature correlation parameters $M$ and $r$, which allows to precisely determine their effects on phase-transitioning behavior of the underlying dynamics. Our results are also a well-fitting complement to the existing literature. Namely, to circumvent challenging statistical mechanics analyses, an alternative combination of spectral and replica methods is considered in [4]. We confirm that [4]'s elegant spectral characterizations are excellent approximations in the low correlated regime. At the same time, we also close the gap in the regimes with higher correlation levels where spectral methods deviate from the practical dynamics performance.

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

We prove achievability below the symmetric information rate (SIR) under block maximum a posteriori (MAP) decoding for a fixed-degree MacKay-Neal (MN) socket ensemble on the quaternary insertion-deletion-substitution channel used to model DNA reads. For every integer $\ell\ge4$, the $(\ell,3,3)$ socket ensemble, with one transmitted bit fixed and an independent uniform known offset, has limiting rate $r_\star=6/\ell$ bits per stored nucleotide. If the joint SIR $J_t$ of a fixed number $t$ of reads under independent, uniformly distributed input nucleotides exceeds $r_\star$, the ensemble-average full extended-word block error is $O(1/n)$, and deterministic graph-offset sequences attain the same limiting rate and message-average error bound. This result concerns the discrete rate family $6/\ell$, not arbitrary rates approaching a given SIR. The channel permits arbitrarily many insertions and unbounded drift, with no alignment supplied to the receiver. The proof combines established MN parity and distance estimates with a strict arbitrary-candidate-list bound and a list construction that accounts for hidden output boundaries.

comments
14 pages
fields
Information Theory
pdf ↗ page arXiv:2610.38440 ↗

We study the expected number of random linear observations required to recover a prescribed information symbol. For ensembles with uniformly random supports, independently sampled nonzero coefficients, and uniformly bounded column weights, we prove that the asymptotic normalized expected recovery time is at least $π/4$ under optimal decoding. The result holds over finite or infinite fields and extends the lower bound previously established for binary fully symmetric codes under peeling decoding. For singleton - pair observations, we determine the exact limiting expectation and show that optimal and peeling decoding have the same limit, independently of the field and coefficient distribution. The minimum within this family is approximately $0.793933445$, which explicit constructions attain asymptotically over every fixed finite field.

fields
Information Theory
pdf ↗ page arXiv:2610.38446 ↗

In this paper, we propose a novel uplink Hybrid Non-Orthogonal Multiple Access (NOMA) architecture assisted by Rydberg Atomic Quantum Receivers (RAQRs) to improve energy efficiency by addressing the physical constraints of atomic sensing. We formulate a joint optimization problem encompassing phase measurements and multi-user power allocation to minimize the total transmit power. This problem is particularly challenging due to the non-linear amplitude-only observations of atomic vapor cells. To decomposes the resulting non-convexity, we develop a hierarchical three-layer decomposition optimization framework that systematically decouples the global problem. The inner layer employs a customized Expectation Maximization-Gerchberg-Saxton (EM-GS) algorithm to resolve phase ambiguity and estimate equivalent channel gains. The middle layer derives closed-form optimal power allocation solutions via Karush-Kuhn-Tucker (KKT) conditions. The outer layer utilizes linear Minimum Mean Square Error (MMSE) detection for high-reliability signal recovery. Simulation results demonstrate the superiority of the proposed framework over conventional RF-based Hybrid NOMA. Notably, the atomic architecture achieves approximately a 93% reduction in total power consumption compared to Orthogonal Multiple Access (OMA) baselines while maintaining strict backward compatibility, thereby laying a solid foundation for practical deployment in next-generation green communication networks.

comments
13 pages, 13 figures
fields
Information Theory
pdf ↗ page arXiv:2610.38451 ↗

Shortest-path optimality does not guarantee that a memoryless graph generator preserves a prescribed source-target correspondence. We study whether reordering legal shortest edits can retain this correspondence without changing the pairing, mandatory edits, or sampling budget. Under a common Poisson clock, we establish an exact criterion for endpoint coupling recoverability: the source-blind Markov projection attains the unavoidable clock-error floor if and only if routes to distinct targets do not share graph states. Routes to the same target may merge without sacrificing endpoint fidelity. This characterization leads to an exact finite-state routing formulation and a legality-preserving scheduling procedure with recovery certificates. A marker-free construction demonstrates how shared edge structure can retain source distinctions, while a capacity-constrained family exhibits a sharp separation in paired error between edit orders with identical marginal error. Finally, a target-conditioned aliasing bound connects structural route design to the terminal fidelity of a learned graph-only generator. These results characterize when legal edit ordering can preserve a prescribed coupling under fixed operational costs.

comments
14 pages. Theoretical preprint
fields
Information Theory
pdf ↗ page arXiv:2610.38486 ↗

Let $X$ be a random vector in $\mathbb{F}_2^m$, and let $X'$ be an independent copy. We prove that, for every $\varepsilon>0$, there is a subspace $G$ with $\dim G\le 2^{320(1+\varepsilon)/\varepsilon}H(X)$ such that $H(q_GX)\le(1+\varepsilon)(H(q_GX+q_GX')-H(q_GX))$. In particular, the quotient entropy is at most $(1+\varepsilon)(H(X+X')-H(X))$. The coefficient is independent of the ambient dimension, and its exponential order in $1/\varepsilon$ is necessary. The structural result is a logarithmic rigidity estimate for finite weighted families of laws with averaged subspace entropy sparsity. A common variational quotient controls both a family and its convolution family without decreasing the original family's normalized mean entropy defect. Posterior families preserve averaged sparsity, and a fresh-index argument combines a local-to-global estimate with the entropic Marton theorem to increase the defect ratio at a fixed multiplicative sparsity cost. We also obtain two-input almost-additivity and concentration of moderate-doubling sets on subspace cosets at the same exponential scale. The constants are not optimized.

comments
14 pages, no figures
fields
Information Theory, Combinatorics, Probability
pdf ↗ page arXiv:2610.38525 ↗

In the study of constraint satisfaction problems (CSPs), the non-redundancy of a relation measures the maximum number of clauses in a CSP instance which can be logically independent. In the last few years, CSP non-redundancy has found a number of applications including in query complexity, sparsification, kernelization and streaming. In this paper, we present a novel technique for upper-bounding the non-redundancy of some relations using locally decodable codes (LDCs) and locally correctable codes (LCCs). More precisely, known limitations on the structure of 2-query LDCs and LCCs can be translated into limitations on the size of certain non-redundant CSP instances. This technique builds on a technique used by Brakensiek and Guruswami [STOC 2025] to bound non-redundancy via techniques from matching vector codes. Using LDCs and LCCs, we give improved upper bounds on non-redundancy of the BCK predicate pioneered by Bessiere, Carbonnel, and Katsirelos [AAAI 2020] as well as its well-studied Boolean variant. We also give the first example of a Boolean predicate whose non-redundancy is provably not of the form $n^{k\pm o(1)}$ for some positive integer $k$.

comments
24 pages
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2610.38664 ↗

Streaming federated learning (SFL) allows clients to train a shared model from continuously arriving data without retaining large local datasets. Such streams often exhibit temporal dependence, yet its effect on generalization remains poorly understood. In this paper we study the expected generalization gap of the aggregated model when client data follow Markov processes, using information-theoretic and rate-distortion techniques. Our framework accommodates heterogeneous Markovian dynamics across clients and distinguishes temporal dependence from information acquired during local learning. We establish bounds under cross-entropy loss, specializing them to Linear Next-Token Prediction (LNTP) and Self-Attention Next-Token Prediction (SANTP). These results quantify the effects of client count, communication rounds, sample size, data dimension, mixing time, and context length. In particular, they reveal a communication–generalization tradeoff: although frequent aggregation may help optimization, it can weaken generalization guarantees. They also suggest a potential advantage of distributed over centralized streaming learning under a fixed total data budget. Temporal dependence enters through the square root of the mixing time. By analyzing the history-state process, we obtain refined bounds with improved context-length dependence under suitable mixing conditions. Experiments on GPT-style language-model pretraining with TinyStories and real-world time-series forecasting illustrate how collaboration and communication frequency influence generalization under temporal dependence

comments
78 Pages, 5 Figures
fields
Information Theory
pdf ↗ page arXiv:2610.38686 ↗

Local Coordinate-wise Linear (LCL) properties, introduced by Levi, Mosheiff, and Shagrithaya (2025), capture coding-theoretic properties such as list decoding and list recovery. They showed that every LCL property has the same rate threshold for random linear codes (RLC) and random Reed–Solomon codes (RRS). Brakensiek, Chen, Dhar, and Zhang (2025) extended this to random additive codes. Thus any property of all subspace design codes holds for RLCs and RRS at the same rate. In this work, we improve the probabilistic guarantees in the RRS local equivalence theorem and extend the equivalence to all known subspace design constructions individually. Each such construction, including folded Reed–Solomon codes, has the same LCL threshold as RLC and RRS codes. We apply these results to alphabet-size bounds for curve decoding. Curve decoding, introduced by Goyal and Guruswami (2025) and Carmon et al. (2026), is a row-span-constrained LCL property implying proximity gaps (PG), correlated agreement (CA), and mutual correlated agreement (MCA), relevant to IOPs and SNARKs. Informally, a rate-$R$ code $C \subset \mathbb{F}^n$ is $(\ell,δ,a,b)$-curve decodable if any degree-$\ell$ curve $u:\mathbb{F}\to\mathbb{F}^n$ that is $δ$-close to $C$ on at least $a$ points has at least $b\leq a$ nearby codewords lying on a degree-$\ell$ curve in $C$. Goyal and Guruswami (2025) and Goyal, Guruswami, Sun, and Wootters (2026) established curve decodability for RLC and RRS codes at radius $δ$ approaching $1-R$, but with large alphabets in $\ell$ and $η:=1-R-δ$. Using our improved LCL equivalence and rank-sensitive counting inspired by Goyal and Guruswami (2026), we exponentially improve alphabet requirements while matching the best known values of $(a,b)$. For $\ell=O(1)$, our alphabet-size bounds match the best known for list decoding, and improves results for PG, CA, and MCA.

comments
60 pages
fields
Information Theory
pdf ↗ page arXiv:2610.38862 ↗

Can measurements chosen adaptively, in response to earlier outcomes, be exponentially more informative than measurements fixed in advance? In many quantum settings, adaptivity helps at most polynomially; known exponential advantages require coherent measurements across copies or restricted measurements. We show an exponential advantage measuring one copy at a time, with no quantum memory kept between state copies, even when the nonadaptive learner may perform arbitrary global measurements on each copy. We construct explicit families of multi-qubit states in which a scalar parameter is encoded in one of exponentially many candidate observables, with an auxiliary marker indicating which one. An adaptive protocol identifies the relevant observable and then measures it using only single-qubit measurements and one round of adaptation. At fixed accuracy, it needs logarithmically many copies as the qubit count grows, whereas every nonadaptive protocol needs exponentially many. The same mechanism yields an exponential gap in local asymptotic minimax mean squared error constants, tight up to the exponential base. The states are separable and classical in label-dependent product bases; no entanglement or other nonclassical correlations are required. The gap comes from measurement incompatibility: the candidate observables cannot be measured jointly, so a fixed measurement must divide its information budget among them, while adaptivity selects the informative one. Accordingly, the separation disappears when the candidate observables commute, and cannot occur with fully observed classical samples. Measurement incompatibility thus emerges as a resource for quantum learning, distinct from entanglement and quantum memory, that classical feedback alone can exploit.

comments
32 pages, 0 figures
fields
Information Theory
pdf ↗ page arXiv:2610.38922 ↗

Generative communication uses transmitted information to control stochastic generation at the receiver. A fundamental question is how much source-specific information must be communicated so that outputs generated at the receiver satisfy prescribed fidelity and reliability requirements while preserving the conditional source distribution. We address this question for sources on compact Riemannian manifolds by developing a generative rate-distortion-perception (GRDP) framework without common randomness. We formulate an asymptotic operational GRDP function under a geodesic distortion radius and a failure-probability constraint, and establish its single-letter characterization through an equivalent informational formulation. Furthermore, for the informational formulation with the high-reliability limit, we derive a geometric lower bound determined by the largest source probability mass of a region with bounded geodesic diameter, together with an upper bound based on probabilistic coverings of the source manifold. Small-radius analysis of the lower bound reveals the roles of intrinsic dimension and scalar curvature in the required communication rate. For uniformly distributed sources on compact homogeneous Riemannian manifolds, we prove that the bounds coincide, yielding an exact characterization of the limiting GRDP function. We further specialize this result to unit spheres, obtaining an explicit expression that relates the minimum communication rate to the geodesic distortion radius and intrinsic dimension, revealing that for the $d$-dimensional unit sphere with $d\ge2$, increasing the communication rate by $d$ bits per source symbol can reduce the distortion radius by more than half.

fields
Information Theory
pdf ↗ page arXiv:2610.39024 ↗

This paper investigates a quantum relay-assisted free-space optical (FSO) communication system in which a decode-and-forward relay is powered by time-switching optical energy harvesting and forwards the decoded information using displaced squeezed signaling (DSS). To obtain a physically con sistent description of turbulence-induced loss for non-classical signaling, each hop is modeled as a pure-loss bosonic chan nel whose random transmissivity follows a truncated Gamma Gamma law, i.e., the Gamma-Gamma irradiance conditioned on the physically admissible range of a transmittance. Under this channel, coherent states remain pure, whereas squeezed states are mapped to mixed Gaussian states. Under Helstrom-optimal detection, the average error of the coherent hop is derived in exact Laplace-series form. For the DSS hop, we derive the output states, a closed-form Gaussian fidelity with rigorous two sided bounds on the Helstrom error, and prove the existence of a loss-aware optimal photon partition. Furthermore, we prove that optimized squeezing preserves both the turbulence-induced diversity order and the leading asymptotic constant of coherent relaying, so that its benefit is a finite-photon-budget effect, and that an interior throughput-optimal harvesting fraction exists. A covariance-preserving benchmark with an exact series representation yields an analytical upper bound on the achievable throughput whose absolute gap vanishes as the relay photon budget grows. Numerical results based on the exact mixed-state Helstrom error quantify the benefit of squeezing and the regime in which it is useful.

fields
Information Theory
pdf ↗ page arXiv:2610.39091 ↗

Delay-Doppler (DD) modulations, such as Zak-transform-based orthogonal time frequency space (Zak-OTFS) modulation, represent the channel as a sparse set of delay and Doppler shifts, which makes them well suited for radar sensing. Sensing with a single DD frame, however, is unambiguous only when the channel spread factor, i.e., the product of the delay and Doppler spreads, is below one. Long-range mobility scenarios, including drones, airplanes, low Earth orbit (LEO) satellites, and underwater acoustic links, typically violate this crystallization condition, so that a single frame aliases the target delays, Doppler shifts, or both. Existing methods add a time-frequency pilot to a conventional DD frame and resolve the aliasing in only one dimension. We propose a frame design that combines multiple DD bases with different delay and Doppler periods, which together cover an overspread channel, on the same bandwidth and frame size. For two frames, we show that modular arithmetic on the wrapped peak positions uniquely recovers each target by pairing the peaks through their common projection and their gains, and we derive the condition under which this pairing is ambiguous. We implement the design with two superimposed Zak-OTFS frames and propose two receivers: dual-frame sensing (DS), which performs the joint detection directly, and DS with cross-pilot cancellation (DS-XC), which additionally cancels the cross-pilot interference, re-estimates the gains by joint least squares, and removes ghost targets. Both receivers keep a detection rate close to one as the spread factor grows, and DS-XC also achieves the lowest false-alarm rate and channel normalized mean squared error (NMSE). In a 100 km drone scenario, DS-XC detects 98% of the targets, compared with 81% for the best baseline, with a complexity that grows near-linearly with the time-bandwidth product for a fixed number of targets.

comments
13 pages, 7 figures, 4 tables
fields
Information Theory
pdf ↗ page arXiv:2610.39110 ↗

We study distributed storage over public communication channels where privacy is realized using shared secret keys. Specifically, a user wishes to store a file across $L$ servers such that any subset of at least $t$ servers can reconstruct the file, while any subset of at most $z$ colluding servers learns no more than a fraction $α$ of the file. Unlike classical secret-sharing models that assume secure communication channels between the user and each server, we consider a setting where all transmissions occur over a public channel and the user shares an individual secret key of length $n$ bits with each server. For a fixed key length $n$, we characterize the trade-off between the privacy leakage parameter $α$ and the maximum file size that can be securely stored. Additionally, we determine the minimum local randomness, public communication, and storage required to achieve this optimal trade-off.

comments
A preliminary version of this work was presented at the 2023 Allerton Conference on Communication, Control, and Computing
fields
Information Theory
pdf ↗ page arXiv:2610.39112 ↗

Semantic entropy, the entropy of the meanings among a language model's sampled answers, is estimated from the verdicts of a judge that declares pairs of answers equivalent or not, and automatic judges err in ways that depend on the answers they compare. The existing minimax theory covers only judges whose false-equivalence probability is the same for all pairs. We model a known judge that declares two answers with meanings $a$ and $b$ equivalent with probability $q+ΔM_{ab}$, for a symmetric matrix $M$ and $q$ bounded away from $0$ and $1$, and show that for three meanings the rate is set by tree statistics on four answers, while on an open set of channels the consistency threshold is set by trees on five. For every channel in an explicit open class, the minimax squared risk is of order $N^{-1/3}$ with $N=n^4Δ^6$ on polynomial weak windows on which $n^5Δ^8$ exceeds a multiple of $\log n$, and of order $\min\{1,N^{-1/3}\}$ on every polynomial weak window when the tree functions on at most four vertices are injective. The exponent comes from a cubic degeneracy at the equitable point. On an open set of channels in the class, the four-vertex tree functions take equal values at two distributions with different entropies. For such a channel, on every polynomial weak window, the minimax risk is of the order of the sum of $\min\{1,N^{-1/3}\}$ and a term that decays exponentially in $n^5Δ^8$, so no estimator is consistent while $n^5Δ^8$ stays bounded, even as $N\to\infty$. For $Δ=n^{-β}$ with $β>1/2$, channels of the class with injective four-vertex tree functions allow consistent estimation exactly for $β<2/3$, and the channels of this open set exactly for $β<5/8$, at which the risk exponent drops from $1/12$ to $0$. Computer-assisted certificates show that both kinds of channels occur on open sets.

comments
47 pages, 5 figures, 3 tables. Code: https://github.com/yahiko-l/pair-dependent-semantic-entropy
fields
Information Theory
pdf ↗ page arXiv:2610.39196 ↗

Proximity gaps and correlated agreement underpin the soundness of interactive oracle proofs. We establish these properties for general one-point algebraic geometry (AG) codes, extending corresponding results for Reed-Solomon codes. For codes of length $n$ over $\mathbb F_q$ with designed distance $n-m$, write $ρ=m/n$ and fix $ρ\in(0,1)$. For polynomial curves of degree at most $\ell$ and any $0<\varepsilon<1$, we prove correlated agreement with multiplicative slack $\varepsilon$ and soundness $O(\ell(\ell+1)/(\varepsilon q))$ whenever $e\le(1-\varepsilon)(n-m)/2$, with no additional genus penalty. This gives asymptotically good AG code families from Garcia–Stichtenoth tower of unbounded length over a fixed field with soundness bounds independent of $n$, beyond the RS restriction $n\le q$. We also establish mutual correlated agreement up to radius $(1-\sqrtρ-η)n$, with soundness $O(\ell n/(η^3q))$ for $0<η<1-\sqrtρ$. Our half designed distance proof combines auxiliary divisors, simultaneous Berlekamp-Welch interpolation, and error-incidence counting to obtain a common polynomial representation without a Polishchuk-Spielman divisibility lemma. Finally, two counterexamples on the Garcia-Stichtenoth tower show limitations beyond half the minimum distance, at radii below the Johnson bound and with positive slack. The first requires a positive constant soundness lower bound independent of $q$ and $n$, precluding a uniform $O(1/q)$ guarantee throughout the Johnson regime. The second fixes the field and lets the relative gap above half distance tend to zero while ruling out correlated agreement for every soundness parameter $σ<1$, with positive limiting rate and relative error radius.

comments
43 pages
fields
Information Theory
pdf ↗ page arXiv:2610.39256 ↗

By exploiting the spatial selectivity of wireless channels, physical layer security (PLS) protects confidential wireless transmissions. Flexible reflectors (FRs), which are passive metallic plates mounted on movable platforms, offer a low-cost and low-complexity solution for reshaping the propagation environment. However, their potential for secrecy-oriented signal propagation shaping has not been explored. In this paper, we study an FR-aided secure communication over non-line-of-sight links and jointly optimize the positions and rotations of FRs to maximize the secrecy rate under geometric reflection and mutual-blocking constraints. For the single-FR case, we propose a Fibonacci segmentation search (FSS) method, which partitions the feasible region into multiple unimodal intervals and obtains the optimal solution with Fibonacci search over the unimodal intervals. To reduce the computational overhead, we also propose a low-complexity cross-entropy search (CES) method, which employs Gaussian mixture model-based adaptive importance sampling to localize promising search intervals before deterministic refinement. After deriving the blocked placement interval induced by the deployed FRs and integrating it into a sequential deployment scheme, we extend the FSS and CES methods to the multi-FR case. Simulation results show that our proposed FSS method achieves significant secrecy rate performance gains over various benchmark schemes, and our proposed CES method achieves a favorable runtime-performance tradeoff. These results indicate that FRs provide a low-cost and reconfigurable mechanism for PLS.

comments
This work has been submitted to the IEEE for possible publication. 13 pages, 13 figures
fields
Information Theory
pdf ↗ page arXiv:2610.39290 ↗

Consider two terminals that observe correlated uniform binary vectors and separately compress their observations to one bit. We prove that, for every blocklength and every correlation parameter in $(-1,1)$, the Fisher information retained by the resulting pair of bits is maximized by matching parity functions of an appropriate degree, thereby resolving a conjecture of Amari and Kobayashi. The proof combines a Fourier-based bound on the derivative of the normalized covariance with a scalar inequality for signed polynomials subject to a global range constraint.

fields
Information Theory
pdf ↗ page arXiv:2610.39355 ↗

We study the maximal length of MDS algebraic geometry codes from genus-two curves over finite fields. Let $C_\mathcal{ L}(D,G)$ be such a code over $\mathbb F_q$, with length $n$ and dimension $k$. Assume that $3\leq k\leq n-3$. We prove that $n<(2q+10\sqrt q+16)/3$. This bound holds for every prime power $q$ and for both parities of $k$. It gives a uniform upper bound of $2q/3+O(\sqrt q)$ for the maximal length. The explicit bound is strictly smaller than $q+1$ when $q\geq125$.

fields
Information Theory, Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2610.39364 ↗

We study the length of maximum distance separable algebraic geometry codes from curves of arbitrary positive genus. For fixed genus, we prove that the asymptotic ratio of the length to the field size is at most $1/2$ when both the dimension and the codimension grow faster than the logarithm of the field size. We also give explicit bounds under logarithmic dimension conditions. The bounds hold in every characteristic and are uniform in the curve and the evaluation set. The proof combines character sums on the Jacobian with an estimate for sums of distinct points.

fields
Information Theory
pdf ↗ page arXiv:2610.39434 ↗

This paper investigates an uplink rate-splitting multiple access (RSMA) network empowered by a Rydberg atomic quantum receiver (RAQR) to maximize energy efficiency (EE). To overcome the amplitude-only measurement limitation of the considered direct readout RAQR, we devise a phase alignment mechanism that linearizes the received signal while retaining full channel energy, thereby enabling tractable optimization. The resulting non-convex fractional EE problem is transformed via Dinkelbach's method. For IoT scenarios with symmetric rate requirements, we derive exact closed-form power allocation from the Karush-Kuhn-Tucker (KKT) conditions, which yields a globally optimal bisection search with negligible computational latency. For asymmetric rate requirements, we develop a generalized block coordinate descent-based power allocation (BCD-PA) framework that eliminates reliance on expensive interior-point solvers. We further propose a low-complexity paired allocation (LC-Paired) that exploits user pairing and closed-form bandwidth solutions via the Lambert-W function. Simulation results confirm that the KKT-based scheme attains the highest EE, while the BCD-PA offers a flexible complexity-performance trade-off. The LC-Paired scheme drastically reduces computational cost with only moderate EE degradation.

comments
13 pages, 7 figures
fields
Information Theory
pdf ↗ page arXiv:2610.39615 ↗

Byrne, Gluesing-Luerssen, and Ravagnani determined the number of codewords with a prescribed nonzero support in a linear maximum sum-rank distance code whose blocks have a common number of columns. Their formula depends only on the code parameters and the support dimensions. Evaluating it for arbitrary parameters gives a family of necessary nonnegativity conditions for existence. We prove their conjecture that this family is equivalent to the condition at the vector of total dimension $d+1$ obtained by filling the longest blocks first, where $d$ is the distance parameter. The resulting explicit criterion applies over every finite field $\mathbb F_q$, for all row numbers $n_i\leqslant m$ and $1\leqslant d<N$, where $m$ is the common number of columns and $N$ is the total number of rows. It also covers the boundary cases in which this vector fills each of its nonzero blocks completely, not explicitly included in the conjecture's displayed parameter range. The proof uses a generating function and an exchange identity to reduce the problem to vectors obtained by filling the longest blocks first. We then estimate alternating sums of elementary symmetric polynomials, with a separate argument for $q=2$. The dual conditions admit the same reduction. For codes that exist, the joint condition follows from sphere-packing bounds for the code and its dual. An infinite family of parameters satisfies the joint condition but admits no such linear code.

comments
18 pages
fields
Information Theory
pdf ↗ page arXiv:2610.39655 ↗

Reconfigurable Intelligent Surfaces (RIS) are a promising solution for improving millimeter-wave (mmWave) communications by controlling signal propagation. Yet, selecting the optimal RIS configuration remains challenging due to the high-dimensional search space and signaling overhead. We propose a Deep Reinforcement Learning (DRL) framework for blind passive beamforming, where a Deep Q-Learning (DQL) agent learns an adaptive policy to select near-optimal RIS configurations while sounding only few codewords, without channel state information. Results show that our approach outperforms Q-Learning (QL) and conventional baselines in convergence, performance, and overhead reduction.

comments
Accepted at AIxNET 2026. 6 pages. Copyright may be transferred to IEEE after publication, after which this version may no longer be accessible
fields
Information Theory
pdf ↗ page arXiv:2610.39827 ↗

We develop a unified framework for the instantaneous total level crossing rate (LCR) of products of independent positive nonstationary fading processes. Universal upper and lower bounds are first derived from an exact decomposition of the product derivative and signed crossing imbalance, requiring only factor-wise crossing statistics. We then introduce the drifting Gaussian-derivative (DGD) class, in which each conditional derivative is Gaussian with possibly nonzero drift. For products of DGD factors, an exact Gaussian-mixture representation yields bounds that jointly capture aggregate drift and derivative fluctuations. The lower bound reduces under stationarity to a known $\ell_2$ bound, whereas, to the best of the author's knowledge, the upper bound is new even in the stationary case. Furthermore, the bounds are asymptotically exact in drift-dominated regimes. The framework is specialized to nonstationary Double-Rayleigh fading and to quasi-identically distributed DGD factors, with closed forms for products of $α$-$μ$ envelopes. Numerical results show that the DGD bounds closely bracket the exact LCR.

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

This paper investigates the value of communica- tion (VoC) in cooperative multi-agent tracking under rate- constrained information exchange. Although prior work has studied distributed tracking, quantized communication, and robust fusion, it remains unclear at what communication rate most of the achievable tracking gain is obtained, beyond which additional communication resources yield only marginal benefit. We consider stationary agents that observe a moving target through heterogeneous range and bearing measurements, perform local extended Kalman filtering (EKF), quantize their posterior state means, and fuse exchanged information via covariance intersection (CI). Performance is evaluated versus communication rate relative to no-communication baselines, a centralized oracle, and a CI-perfect reference. The results show that communication is not uniformly beneficial: very low rates can degrade performance due to coarse quantization, whereas moderate rates recover most of the achievable gain. In the considered scenario, increasing the rate from 4 to 12 bit/s per agent reduces the root-mean-square error (RMSE) from 13.93 m to 6.35 m, while a further increase to 32 bit/s per agent improves it only marginally to 5.93 m. This reveals a clear knee region at moderate rates, beyond which the remaining loss is mainly due to the conservatism of the fusion architecture. Overall, the proposed framework characterizes low-rate degradation, communication-efficient operation, and diminishing returns, while highlighting the joint role of rate and sensing geometry in determining communication benefit.

fields
Information Theory
pdf ↗ page arXiv:2610.40010 ↗

We develop a state discrimination approach to unassisted quantum communication through a noisy quantum channel. Starting from the operational duality between entanglement recovery and state discrimination, we construct entanglement-generation codes with explicit decoders constructed from Petz recovery maps. The resulting error bounds hold for every number of channel uses and are expressed in terms of Petz-Rényi coherent information. For product sources, they yield exponential error decay at rates below coherent information.

fields
Information Theory, Mathematical Physics
pdf ↗ page arXiv:2610.40358 ↗

Quantum error correction is essential for fault-tolerant quantum computing. High-rate quantum low-density parity-check (qLDPC) codes have emerged as a promising approach to reducing the substantial physical qubit overhead of quantum error correction, enabling encoding rates exceeding $1/2$ in blocks of approximately one thousand physical data qubits. However, their practical implementation requires decoders that combine high accuracy with low latency to keep pace with quantum hardware. Existing decoders of high-rate qLDPC codes can achieve high accuracy but often incur substantial computational latency, whereas neural network decoders have yet to be demonstrated for high-rate qLDPC codes. Here, we introduce \emph{neural triage decoding}, a framework that uses syndrome consistency to adaptively allocate neural computation. A local neural message-passing network rapidly predicts error corrections, additional iterations reduce residual syndrome violations, and a rarely invoked diversification stage searches for consistent corrections to the remaining shots. We demonstrate that the \texttt{Triage} decoder can decode ultra-high-rate qLDPC codes encoding a few hundred logical qubits, including lifted-product and Kasai codes, achieving state-of-the-art accuracy comparable to the near optimal algorithmic decoders while reducing decoding latency by approximately one to two orders of magnitude. Our framework is inspired by a rigorous analysis of the exact bitwise marginal decoder, revealing a distance-independent syndrome-inconsistent error floor. In addition, we show the robustness of neural network decoders to mismatched error priors. Our results establish adaptive neural decoding as a promising route towards fast, accurate, and scalable quantum error correction in the near term.

comments
5 pages, 4 figures with Methods. We will release the fully supplementary information in the second update soon
fields
Information Theory
pdf ↗ page arXiv:2610.40490 ↗

We develop design methodologies for the rate profile of polarization-adjusted convolutional (PAC) codes tailored to successive cancellation list (SCL) decoding. The crux of our approach is two-fold: first is the creation of a modified density evolution Gaussian approximation (DEGA), called conditional DEGA (CDEGA), to analyze the decoding process in the presence of errors; second is the creation of a dangerous-path occupancy metric to find the conditional occupancy of bit-errors in a finite list. Our approach not only illuminates the role of rate-one precoding, but also provides insight into why certain information sets are particularly well suited to PAC codes. We demonstrate the usefulness of CDEGA and dangerous-path metrics with algorithms that create new information sets, as well as precoders that are extremely sparse yet competitive. In particular, we design codes of length $N \leq 512$ with various rates and list sizes, all of which offer at least half a dB gain over traditional PAC codes at an FER of $10^{-3}$ and improve upon state-of-the-art results.

fields
Information Theory
pdf ↗ page arXiv:2610.40512 ↗

Predicting how many tokens a large language model (LLM) will decode, using only prefill-phase hidden states, is a key primitive for inference scheduling. We show that current benchmarks conflate predictor quality with task hardness: when the target model, dataset, or sampling configuration changes, reported accuracy collapses even though the predictor is unchanged. We trace this instability to an overlooked error source—the inherent stochasticity of autoregressive decoding—and derive bounds that every prefill-side method must obey. Our analysis treats decoding as a stopped stochastic process. The per-step stopping probability of a response is not constant but ramps up over hundreds of steps, so the decode length inherits a central limit theorem from the many local decisions that determine where a response ends; this yields per-prompt normality with an explicit error term, together with an affine variance law $σ=αμ+b$ whose slope is the coefficient of variation of the number of response segments. Empirically, the normal law reproduces the per-prompt MAE and the central mass of the decode-length distribution to within a few percent, and the residual departures from normality (mild right skew, slight excess kurtosis) are the ones predicted by the sampling-noise correction. Under fixed model, data, and sampling conditions, a broad design space of predictors (MLP, EGTP, FiLM, soft-label, and Mixture-of-Experts variants) converges to similar performance close to the bound, confirming that \emph{system error dominates model error}. We argue for a benchmarking protocol that fixes the model, data, and sampling parameters and that reports relative-error metrics alongside absolute ones. Code and analysis tools are available at https://github.com/ShwStone/DecodingPredict.

comments
26 pages, 4 figures
fields
Information Theory
pdf ↗ page arXiv:2610.40541 ↗

Advanced power adjusting block withholding attacks such as PAW and T-PAW have been analyzed so far under a global-reset version of the proportional scheme (GRP), which is rarely used in practice. In this paper, we analyze T-PAW, which contains FAW and PAW as special cases, under the block-dependent payout schemes deployed in practice: Pay-Per-Last-N-Shares (PPLNS), round-based Proportional (PROP) and exponential-decay (EXP). We derive the revenue ratios analytically, by renewal arguments for PPLNS and through the stationary carry process of an open round for PROP and EXP. We further introduce Power Adjusting Hopping (PAH), where an adversary of any size adjusts its power allocation towards the pool according to the blockwork age of the round without withholding any block, and derive its revenue ratios under PROP and EXP. We show that GRP misestimates the T-PAW gain in a scheme-dependent direction: it overstates the gain under PROP up to an order of magnitude and understates it under EXP for the original slush decay rate. PROP is highly vulnerable to PAH, while EXP faces a trade-off: a slow decay invites PAH and a fast decay invites T-PAW. PPLNS is the least vulnerable scheme: it is immune to PAH and it mitigates, but does not eliminate, T-PAW. All analytical results are verified by Monte Carlo simulations.

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

Can entangling codewords across independent uses of a quantum channel improve the rate of classical communication? An old conjecture states that there is no such entanglement advantage for all channels. Although Hastings's result and follow-up works disproved this conjecture, it turns out that enormous dimension is required to construct a channel where entanglement enhances classical communication. This indicates that there might be no entanglement advantage for many physical channels, or for all low dimensional channels. Motivated by recent progress on (generalized) amplitude damping channels, we propose a general Schur-weighted block entropy inequality, and show that there is no entanglement advantage for all phase-covariant channels including multi-level amplitude damping channels, generalized dephasing channels, and damping-dephasing channels. As a by-product, we also recover the recently established result that there is no entanglement advantage for all qubit channels.

code
github.com/pxwu24/additivity-of-classical-communication ∎ Lean project (Lean/lakefile.toml, Lean/lean-toolchain) builds, no sorry at 8a8cc11, checked 2026-10-30 build details
comments
See the companion github repository https://github.com/pxwu24/additivity-of-classical-communication for the presentation of the results and a complete Lean verification
fields
Information Theory, Mathematical Physics
pdf ↗ page arXiv:2610.40585 ↗

Number Theory38

We formulate Poisson summation with periodic weights in forms adapted to arithmetic sums (arithmetic Poisson summation formulas, APSF), in scalar, polynomial-congruence and vector-divisibility versions, extending Berndt's arithmetic Poisson formula. We use APSF as a common framework to rederive Ramanujan's formula for $ζ(2m+1)$ and its character analogues due to Katayama and Berndt-Straub, the functional equations of $ζ$, of Dirichlet's beta function and of Estermann's function, and the exponents of Tolev and Chen-Wang for power-free values of $x^2+y^2+1$ and $x^2+y^2+z^2+k$. It also gives reciprocity laws with Kelvin-function kernels for Lambert series twisted by a Dirichlet character over imaginary quadratic fields of arbitrary class number; asymptotic formulas with error terms for $r$-free values of $x_1^2+\cdots+x_n^2+k$, with Gaussian-weighted versions and the meromorphic continuation of the associated Dirichlet series; an argument of Terras, relating two-dimensional Bessel series for all odd zeta values and even Dirichlet beta values; and a Gaussian representation of a Mersenne-Fermat prime detector.

comments
42 pages, 2 figures
fields
Number Theory, Classical Analysis and ODEs, Complex Variables
pdf ↗ page arXiv:2610.36606 ↗

Place closed Euclidean balls of radius r at the points of (1/2, 1/2, ..., 1/2) + Z^n. The view-obstruction problem for spheres asks for the least r such that every ray from the origin into the open positive orthant meets a ball. Equivalently, it asks for D_n = sup_v min_{t in R} sum_i ||t v_i - 1/2||{Z}^2 over positive integer vectors v, where ||x||{Z} denotes the distance from x to the nearest integer. The values for n <= 5 are classical. We prove D_6 = 107/312, attained only by permutations of (12, 9, 7, 5, 3, 2), and D_7 = 73/180, attained only by permutations of (11, 10, 8, 7, 4, 3, 1). The proof reduces the supremum to a finite search. The key facts are an exact lower bound d_n(v) >= delta^2_U for every rational subspace U perpendicular to v, a matching fiber upper bound, and Banaszczyk's transference theorem, applied along the Korkine-Zolotarev flag of the dual lattice v^perpendicular intersection Z^n. The search is quotiented by signed coordinate permutations and carried out entirely in exact rational arithmetic. It terminates with a certificate: no node of the search is left unresolved, and every surviving candidate is evaluated exactly. The method also recovers the known values for n = 3, 4, 5.

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

In this paper we obtain $ζ$-Platonic cube form of our almost linear formula. From this follows, for example, the $ζ$-Platonic equivalent of the Fermat-Wiles theorem. The last result represents the point of contact between the Hardy-Littlewood integral and the Fermat-Wiles theorem and also with one of the Platonic solid - cube.

fields
Number Theory
pdf ↗ page arXiv:2610.37723 ↗

Denote by $Φ_m(X,Y)\in\Z[X,Y]$, $m\geqslant 1$ the sequence of binary cyclotomic forms, so that $Φ_m(T,1)\in\Z[T]$, $m\geqslant 1$ is the sequence of cyclotomic polynomials. We prove that, for $m\geqslant 3$, the fundamental domain $ \cal{O}_m:= \{ (x,y)\in\R^2\; \mid \; Φ_m(x,y)\leqslant 1\} $ of $Φ_m$ is a convex subset of $\R^2$ if and only if $m$ is equal to $p$, $2p$ or $2^k$ with $p$ an odd prime and $k\geqslant 2$. Finally we investigate the convexity of the fundamental domains attached to some products of binary forms $Φ_m$.

journal
Polynesian Journal of Mathematics, 2026, 4 (7), pp.1-14
fields
Number Theory
pdf ↗ page arXiv:2610.37735 ↗

We establish necessary and sufficient conditions for a complex polynomial to have a prescribed multiset of roots, expressed in terms of its coefficients and complete homogeneous symmetric polynomials. These conditions extend the classical Vieta formulas and yield explicit formulas for the coefficients of the corresponding quotient. We apply our results to obtain characterizations of Kronecker polynomials through identities involving symmetric polynomials and construct Borwein multiples of products of cyclotomic polynomials.

fields
Number Theory
pdf ↗ page arXiv:2610.37743 ↗

We give a complete classification of minimal value set polynomials (MVSPs), settling a problem introduced by Carlitz, Lewis, Mills and Straus in 1961. For MVSPs $F \in \mathbb{F}_q[x]$ with more than two values, earlier work showed that their value sets $\left\{F(a): a \in \mathbb{F}_q\right\}$ can be reduced to the form $\mathcal U^v=\{u^v:u\in \mathcal U\}$, where $\mathcal U$ is a vector space over a subfield of $\mathbb F_q$, and $v\geq 1$ is a suitable integer. This classification proceeds through two parallel constructions, according to whether $\mathcal U$ is itself a field or not, governed respectively by the cyclic multiplicative structure and by the additive linearized structure. In both cases, Hasse derivatives impose constraints on the root multiplicities of a distinguished factor of $F$, leading to a factorization that preserves the underlying structure in a polynomial of smaller degree and thus allows the argument to be iterated.

comments
24 pages
fields
Number Theory
pdf ↗ page arXiv:2610.37877 ↗

For a smooth cubic surface $S/\mathbb{Q}$, the absolute Galois group acts on the $27$ lines of $S_{\overline{\mathbb{Q}}}$, giving a subgroup \[ G_S\subseteq W(E_6). \] We study the distribution of $G_S$ when the twenty coefficients of a defining cubic form are chosen independently from a large interval $[-H,H]$. We prove that, for every $\varepsilon>0$, the number of smooth integral cubic forms of height at most $H$ for which \[ G_S\neq W(E_6) \] is \[ O_\varepsilon\!\left(H^{19+1/21+\varepsilon}\right). \] The principal obstruction is the unique subgroup $W(E_6)^+$ of index $2$. By a theorem of Saito, membership in this subgroup is equivalent to the signed discriminant of the cubic surface being a square. A recent square-value estimate of Bonolis, Pierce, and Woo then gives the exponent $19+1/21$. For each of the other five conjugacy classes of maximal subgroups of $W(E_6)$, recent results on rational points in projective thin sets give the sharper bound $O(H^{19})$. We also prove the lower bound \[ N_{\mathrm{exc}}(H)\gg H^{16} \] by counting cubic surfaces containing a fixed rational line, and exhibit an $H^{14}$-sized exceptional family with no rational line, arising from rational Eckardt points. These examples lead us to conjecture that \[ N_{\mathrm{exc}}(H)=H^{16+o(1)}. \] Finally, we investigate whether Bhargava's proof of van der Waerden's conjecture for $S_n$ can be adapted to the index-$2$ $E_6$-problem. A double-discriminant argument gives the desired $H^{19+\varepsilon}$ bound whenever the product of the strongly square-dividing primes is sufficiently large. The remaining difficulty comes from weak square divisibility.

comments
14 pages, written autonomously with ChatGPT
fields
Number Theory
pdf ↗ page arXiv:2610.37945 ↗

In 1985 Kohnen used the Shimura correspondence to prove a general formula relating the coefficients of half-integral weight modular forms of level $ 4N $ transforming with respect to the theta multiplier to central values of $ L $-functions for twists of newforms of level $ N $. This generalized previous work with Zagier. In this paper, we prove a Kohnen-Zagier type formula using Yang's Shimura correspondence for powers of the eta multiplier in level $ 1 $, relating the coefficients of half-integral weight modular forms to central values of $ L $-functions for twists of newforms of level $ 6 $. To do so we develop some of the theory of modular forms transforming with respect to powers of the eta multiplier and introduce Shintani lifts of level $ 6 $, with Fourier coefficients given in terms of cycle integrals.

comments
28 pages
fields
Number Theory
pdf ↗ page arXiv:2610.38051 ↗

We prove that Cavallar and Lemmermeyer's list of $58$ norm-Euclidean complex cubic fields is complete. The proof combines a classical discriminant bound with exact certificates of non-Euclideanity. The unit action reduces their verification to finite lattice enumeration with rigorous interval arithmetic. An independent covering computation confirms norm-Euclideanity for the $58$ fields.

comments
14 pages
fields
Number Theory
pdf ↗ page arXiv:2610.38073 ↗

The analytic Emerton-Gee stack is a rigid analytic moduli stack of $(\varphi,Γ)$-modules over the Robba ring, and is expected to play a fundamental role in the categorical $p$-adic local Langlands correspondence for locally analytic representations. In this paper, we establish the fundamental geometric properties of the analytic Emerton-Gee stack: it is a rigid analytic Artin stack, normal, a local complete intersection, and equidimensional of the expected dimension. As an application, our normality result removes the reducedness hypothesis in the paper of Le, Strauch, and Wang, thereby yielding an unconditional proof of the conjecture on the global sections of the analytic Emerton-Gee stack formulated by Emerton, Gee, and Hellmann.

comments
81 pages
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2610.38115 ↗

Let $S=(s_1,s_2,\cdots)$ be a strictly increasing sequence of positive integers. For any real number $α>0$, let $S_α=(\lfloorαs_1\rfloor,\lfloorαs_2\rfloor,\cdots)$. We prove that if $s_{n+1}\le 2s_n$ for every positive integer $n$, then there exists $0<α<1$ such that $S_α$ is strongly complete. In addition, this gives a negative answer to a problem of Ma and Chen in [Acta Arith. 203 (2022), 307–318]. We also prove that the same result is true if $s_{n+1}\le 2s_n$ for all sufficiently large $n$.

fields
Number Theory
pdf ↗ page arXiv:2610.38288 ↗

We prove that every vector of $\mathrm{II}_{8n+1,1}$, with $n\ge1$, is a sum of two roots if and only if $n=1$ or $2$. This settles the Borisov–Nuer conjecture and implies the existence of Ulrich line bundles for every very ample polarization on a complex unnodal Enriques surface. For vectors of negative norm, we express the number of root decompositions as a Fourier coefficient of a vector-valued theta series, reducing existence to positivity. The main analytic difficulty is to obtain estimates uniform over lattices of unbounded determinant. We address this by combining a reduction based on primitive sublattices of codimension one and least determinant with explicit bounds for theta norms and Fourier coefficients of cusp forms.

comments
29 pages
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2610.38414 ↗

We study the complexity of two fundamental problems attached to p-adic lattices: computing an N-orthogonal basis, and deciding whether a given basis is N-orthogonal. When the norm is supplied through an explicit diagonal representation, both problems are polynomial. However, in the black-box model, where the ultrametric norm N is fixed and only accessible through an evaluation oracle, we prove that both problems require $Ω$(p^{v-1} ) queries in the worst case, where v $\le$ n is the largest multiplicity of a commensurability class of N and n is the dimension of the ambient vector space. We then analyse the optimality of these bounds by providing explicit algorithms. Our results answer formally an open question of Zhang, Deng and Wang and refine the recent results of Duan and Wu by providing pointwise query bounds depending on the norm's structure, in addition to uniform bounds.

fields
Number Theory
pdf ↗ page arXiv:2610.38535 ↗

Let $K$ be a local field with absolute Galois group $G_{K}$ and let $k$ be a finite field of characteristic $p$. We prove that every continuous representation $G_K\to \operatorname{GL}_{n}(k)$ lifts to a continuous representation $G_K\to\operatorname{GL}_{n}(W(k))$ where $W(k)$ is the ring of infinite Witt vectors over $k$.

comments
10 pages
fields
Number Theory
pdf ↗ page arXiv:2610.38581 ↗

Let $E/F$ be a quadratic field extension. For any positive integer $n$ an integral hermitian form over $E/F$ is called $n$-universal if it represents all integral hermitian forms of rank $n$ over $E/F$. We study $n$-universal hermitian forms when $F$ is a local field of characteristic $\neq 2$ or a number field. In the local case, we characterize $n$-universal integral hermitian forms and provide finite criterion sets for $n$-universality. In the number field case, we show that an indefinite integral hermitian form is $n$-universal if and only if it is $n$-universal everywhere locally.

comments
23 pages
fields
Number Theory
pdf ↗ page arXiv:2610.38831 ↗

The Jensen–Pólya criterion expresses the generalized Riemann hypothesis (GRH) for Dedekind zeta-functions as a real-rootedness condition on their Jensen polynomials. Previous asymptotic results require large shifts, while computations establish real-rootedness in the Riemann case through a finite range of degrees. Here we study the unshifted family as the degree tends to infinity. For every number field $K$, we prove unconditionally that $J_{K,d}(X)$ is nonzero and has at least $d-C_K\sqrt{d\log d}$ distinct negative real zeros for all sufficiently large $d$, where $C_K>0$ depends only on $K$. Therefore, the proportion of real zeros tends to one with error $O_K(\sqrt{\log d/d})$. The main theorems have been autoformalized in Lean~4 by AxiomProver.

comments
16 pages (extends and generalize old work by the author and others to the unshifted setting). Comments welcome
fields
Number Theory
pdf ↗ page arXiv:2610.38870 ↗

The present article proves (assuming GRH and a minor technical result) the veracity of Serre's conjectures for the field $\Q(\sqrt{13})$. In doing so, we prove a ``reduction to level 1'' result that holds for any real quadratic field with narrow class number one. However we can only establish the needed base cases for $\Q(\sqrt{13})$.

fields
Number Theory
pdf ↗ page arXiv:2610.38884 ↗

In this paper, we apply the Fourier series technique to establish a new formula for the product of the generalized Bernoulli function and the Bernoulli function. As applications, we derive some reciprocity formulas for generalized Dedekind character sums. In particular, we show that the reciprocity formulas of Berndt, Can, and others follow as special cases.

comments
27
fields
Number Theory
pdf ↗ page arXiv:2610.39075 ↗

Robin's criterion reduces the Riemann hypothesis to an inequality for colossally abundant (CA) numbers, and Wu's theorem reduces the test further to the subclass CA2. We study this reduction numerically and consider smaller subsets on which the same criterion remains sufficient. We also show that the logarithmic decay law suggested by Briggs's computations follows from Ramanujan's conditional bounds. To investigate the next term, we compare the normalized Robin difference with Ramanujan's oscillatory expression involving the nontrivial zeros of the zeta function. The resulting difference has a slowly varying component on both CA and CA2. Its scaled values continue to vary over the computed range, leading to questions about convergence, upper bounds, and higher-order terms. We describe the sampling used in the figures and estimate the error from truncating the sum over zeros.

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

The space $M(ρ;\mathcal{E})$ of weakly holomorphic modular forms for a dimension-$r$ complex representation $ρ$ of $\mathrm{SL}_2(\mathbb{Z})$ with growth prescribed by $\mathcal{E}$ at the cusp is a free module over $\mathbb{C}[E_4,E_6]$. We first prove that a $\mathbb{C}[E_4,E_6]$-linearly independent homogeneous family $F_1,\ldots,F_r$ in this module gives a basis if and only if $\sum_{i=1}^r \operatorname{wt}(F_i)=12\operatorname{tr}\mathcal{E}$. We then extend this criterion to Jacobi forms. As applications, we determine the generator weights of free modules of $\mathrm{O}(D_{8d}^+)$-invariant Jacobi forms of index $D_{8d}^{+}(p)$, where $D_{8d}^{+}$ is an even unimodular lattice extending $D_{8d}$, $d\ge2$, and $p=2,3,5$.

comments
36 pages
fields
Number Theory
pdf ↗ page arXiv:2610.39270 ↗

We study the Erdős–Moser equation $1^k+2^k+\dots+(m-1)^k=m^k$ and its analogue in arithmetic progressions, $\sum_{i<m,\ i\equiv b \pmod q} i^k=m^k$, by means of centres of mass, through what we call the half-mass principle. For the progression equation we show that a solution with exponent $k$ has at most $\lfloor k/\log 2+3/2\rfloor$ terms for all $k<10^{55}$, which is best possible for real solutions and replaces an exponential bound; that for $k=3$ solutions with exactly $n$ terms exist if and only if $n\in\{3,4,5\}$, and then infinitely many; and that there are no solutions at all for $k=4$, more generally for every $k=2^s\ge 4$, and for every even $k$ with $4\le k\le 24$. These results rest on a uniform estimate for the Erdős–Moser equation: the real exponent $κ_m$ for which $1^κ+\dots+(m-1)^κ=m^κ$ satisfies $κ_m=\log 2\,(m-3/2-γ_m/m)$ with $0<γ_m<1/(8\log 2)$ for every $m\ge 3$. The method also explains the constants: $3/2$ is a Steiner quotient $(ρ^2+d^2)/2d$, and $25/12-3\log 2=1/12-f''(\log 2)/2$ with $f(λ)=λ/(e^λ-1)$, which explains why this number is so small.

comments
27 pages
fields
Number Theory
pdf ↗ page arXiv:2610.39315 ↗

Let \(q=p^e\) be a prime power and \(n\geq1\). Let \(L=\F_{q^n}\) and \(K=\F_q\). We study the trace distribution of \(r\)-primitive \(k\)-normal elements of \(L\) over \(K\). We first derive exact formulas for the number of \(k\)-normal elements of \(L\) with a prescribed trace in \(K\). For \(r\mid q^n-1\), \(0\leq k\le n-1\), and \(a\in K\), let \(\mathcal{N}_{r,k}(a)\) denote the number of \(r\)-primitive \(k\)-normal elements of \(L\) with trace \(a\). We establish a sufficient condition for \(\mathcal{N}_{r,k}\) to be constant on \(K^\times\). We also identify a subgroup \(H_r\) of \(K^\times\) and prove that \(\mathcal{N}_{r,k}\) is constant on each coset of \(H_r\). Finally, we obtain a necessary and sufficient character-sum condition for \(\mathcal{N}_{r,k}\) to be constant on \(K^\times\).

fields
Number Theory
pdf ↗ page arXiv:2610.39510 ↗

The proof by Ch. Hermite of the transcendence of the number e in 1873 is the model on which most transcendence proofs for constants of analysis are based. The Schneider-Lang Theorem gives an opportunity to understand the strategy behind the proof. We only outline the main ideas, without providing technical details, for which we refer to the bibliography.

journal
Polynesian Journal of Mathematics, 2026, 4 (14), pp.1-13
fields
Number Theory
pdf ↗ page arXiv:2610.39810 ↗

We show that short averages of the Fibonacci partition function over $(H, H + H^α]$ can be significantly smaller than long averages over $(0,H]$, for any constant $α\in (0,1)$. This provides a negative answer to a question that we asked in our previous work on this topic (Journal of Number Theory, 2024).

fields
Number Theory
pdf ↗ page arXiv:2610.39817 ↗

For the quadratic family $f_c(x) = x^2 + c$ over $\Q$, we isolate a general $S$-unit and ABC template for rational periodic cycles: under the ABC conjecture, any rational quantity built from the consecutive-point sums of a rational period-$n$ cycle whose value and shift-by-$1$ are both $S$-units (with $S$ the support of the denominator of $c$) has logarithmic height at most $(1+\eps)\sum_{p \in S} \log p + O_\eps(1)$. Specializing to period $3$ in the change of coordinates $u = x_0 + x_1$ and $v = x_0 + x_2$, the period-$3$ condition reduces to $v = -1/(1+u)$, forcing the parameter $t = u$ to satisfy $t, t+1 \in \Z[S^{-1}]^\times$; the template then yields, under ABC, $\max\{|a|,|b|,|a+b|\} \le C_\eps \rad(d)^{1+\eps}$ for $t = a/b$ in lowest terms. We also characterize the period-$3$ locus on the $(u,v)$-plane intrinsically, isolating the ghost curve. Extending the height bound to higher periods remains an open structural question.

fields
Number Theory, Dynamical Systems
pdf ↗ page arXiv:2610.39820 ↗

We evaluate the characteristic polynomial of a random unitary matrix at the points on the unit circle where the polynomial takes real values. In analogy to the Riemann zeta function we call these the ``random matrix Gram points''. On the random matrix side we answer in the affirmative a question of Richard Hall, who expected that zeta on the Gram points should be larger than typical. We prove that for any fixed positive $k$, the $2k$th moment of the characteristic polynomial averaged over the random matrix Gram points is larger than the $2k$th moment of the characteristic polynomial averaged over the whole unit circle. For large $N$ the leading-order asymptotic term is the same size, but all lower-order terms are larger. In an appendix we show how to adapt the heuristic recipe of Conrey–Farmer–Keating–Rubinstein–Snaith to conjecture moments of zeta at Gram points, and show by example that the second and fourth moments calculated by following the recipe agree with previously proven results.

fields
Number Theory, Mathematical Physics
pdf ↗ page arXiv:2610.39856 ↗

Let $p$ be a prime such that $2$ is a primitive root modulo $p$. We prove that, for every three-element set $L\subseteq\mathbb{F}_p$ and every integer $n\geq1$, there exists a symmetric $n\times n$ matrix over $\mathbb{F}_p$ with zero diagonal, off-diagonal entries in $L$, and rank $O_{p,L}(n^{1/3})$. This answers a question of Bukh for all such primes and, in particular, settles the case $L=\{1,4,6\}\subseteq\mathbb{F}_{19}$ singled out on his problem list. When $0\notin L$, a standard polynomial argument shows that the exponent $1/3$ is optimal. The proof combines a geometric construction in characteristic two with an incidence matrix factorization over $\mathbb{F}_p$. The same construction yields integer lifts $L'$ of the prescribed sets $L$ and symmetric $L'$-matrices of rational rank $O_{p,L}(n^{1/3})$. When $0\notin L'$, this improves Bukh's general quadratic lower bound, giving matrices of order $Ω_{p,L}(r^3)$ and rational rank at most $r$.

comments
10 pages
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2610.39908 ↗

We study analogues over number fields and the probabilistic congruence input that enters averaged versions of this problem. We prove an asymptotic formula for the least common multiple of ideals in a fixed ray class, record local equidistribution estimates for random $S_n$-polynomials, and give a conditional reduction of the averaged higher degree problem to explicit dispersion and large prime collision estimates. We also formulate an individual quadratic number field analogue and reduce it to a prime ideal quadratic root equidistribution statement together with a geometric pair counting estimate. The Galois group counting input is updated using Bhargava's theorem over $\mathbb Q$ and the determinant method estimates of https://arxiv.org/abs/2610.35030 .

fields
Number Theory
pdf ↗ page arXiv:2610.39911 ↗

We prove the Church–Farb–Putman conjecture that \[ H^{N_n-i}(\mathrm{SL}_n(\mathbb Z);\mathbb Q)=0, \qquad N_n=\binom n2,\quad n\ge2,\quad 0\le i<n-1. \] The proof relies on Franke's filtration of the weighted automorphic cochain complex, developed in his proof of Borel's conjecture. We treat trivial and nontrivial cuspidal support separately. For nontrivial support, we combine a degree calculation with the Chenevier–Lannes lower bound of $11$ for the motivic weight of level-one regular algebraic cuspidal representations of rank at least two. This reduces the contributing inducing data to a trivial factor and a Speh factor attached to such a representation. We construct primitives for closed lifts of cohomology classes in the filtration quotients by combining an Eisenstein residue identity with a cochain homotopy and finite distributions in the spectral parameters. A finite-filtration lifting argument then yields vanishing for nontrivial cuspidal support. The trivial-support case is treated using Franke's topological model.

fields
Number Theory
pdf ↗ page arXiv:2610.39960 ↗

Given a field $L$ and polynomial $f(x)/L$, one can consider the indices of the profinite iterated monodromy groups formed over the ground field within the profinite iterated monodromy groups over elements transcendental over $L$. For any countable Hilbertian field $k$, we show random Galois fixed field extensions almost surely make the indices infinite over all ground field elements, with certain conditions on $f(x)$. This is a generalization of a result in arXiv:2012.03076 by Dittmann and Kadets.

fields
Number Theory
pdf ↗ page arXiv:2610.40017 ↗

Motivated by conjectures arising in part from the study of class-$\mathcal{S}$ vertex algebras associated with four-dimensional supersymmetric field theories, we study multiple $q$-zeta functions attached to finite-dimensional simple Lie algebras. We prove their conjectured quasimodularity for all classical Lie algebras of types $A$, $B$, $C$, and $D$, as well as a more general Weyl-symmetrized version in which the exponents attached to the positive roots are allowed to vary, under a suitable parity condition. Our proof is based on a substantially more general result. We introduce new combinatorial objects, called sets of level one and pairs of level two, which generalize the configurations arising from classical root systems. To these we associate multivariable lattice sums and prove that, under a natural admissibility condition, they are Fourier expansions of polar quasi-Jacobi forms of level one and level two, respectively. Quasimodularity of the Lie-theoretic $q$-series follows by specialization of the elliptic variables. The positive roots of type $A$ form a set of level one, and those of types $B$, $C$, and $D$ are described by pairs of level two. The proof combines a structural analysis of these new combinatorial configurations with reduction procedures and induction on the rank. The resulting framework applies to a much wider class of lattice sums than those coming from root systems and supports more general quasimodularity conjectures for $q$-series associated with integral hyperplane arrangements.

comments
46 pages, 2 appendices
fields
Number Theory, Combinatorics, Representation Theory
pdf ↗ page arXiv:2610.40034 ↗

Let $G$ be the group of complex points of a connected split reductive group defined over ${\mathbb Q}$. We study the standard intertwining operator between representations parabolically induced from essentially tempered cohomological representations of Levi subgroups of maximal parabolic subgroups. Under certain algebraicity, purity, and criticality hypotheses, the operator is holomorphic and invertible at a particular point of evaluation. The relative Lie algebra cohomology of these induced representations is one-dimensional in the lowest nonzero degree. Under prescribed rational generators of these one-dimensional spaces, we show that the intertwining operator is a nonzero rational multiple of a certain product of ratios of local $L$-factors. This is a cohomological version of Langlands's calculation of the Gindikin-Karplevic formula. The main theorem provides a local input for the arithmetic study of special values of Langlands–Shahidi $L$-functions.

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

Let $K/\mathbb{Q}$ be a Galois extension of number fields with Galois group $G$. Let $χ$ be any character on $G$ and $κ(χ)$ be the leading coefficient of the Laurent series of the Artin $L$-function $L(s,χ)$ at $s=1$. Cho, Lemke Oliver, and Zaman (2026) recently established a conditional bound for $κ(χ)$ assuming GRH for the Dedekind zeta function of $K$. Up to implied constants, we show that the extremal values of these bounds are attained for an infinite family of extensions $K/\mathbb{Q}$ and all irreducible faithful characters $χ$, provided $G$ is a regular Galois group over $\mathbb{Q}$. All characters $χ$ are permitted without restriction when $G$ is abelian, $A_n, S_n$, or any sporadic group. Our method removes the assumptions of GRH and Artin's holomorphy conjecture from an argument of Duke (2003) by following the strategy of Lemke Oliver, Thorner, and Zaman (2024) on the existence of extremal class numbers for number fields of arbitrary degree. Key ingredients include progress by Débes (2017) towards Malle's conjecture, and an Artin $L$-function large sieve by Lemke Oliver and Smith (2024).

comments
17 pages
fields
Number Theory
pdf ↗ page arXiv:2610.40267 ↗

We present a geometric method for deriving theta function identities from automorphisms of positive definite quadratic forms. Given an automorphism of a quadratic form with matrix $A$, we construct a rational isometry of $I_n\otimes A$ that fixes the diagonal subspace pointwise. Elementary lattice decompositions and finite character sums then yield explicit transformation formulas for the associated theta functions. As applications, we give a geometric proof of Schultz's generalization of the Borweins' cubic theta identity and recover two related quadratic theta identities.

comments
6 pages
fields
Number Theory
pdf ↗ page arXiv:2610.40408 ↗

We establish the leading asymptotic for the shifted correlations of divisor functions.

fields
Number Theory
pdf ↗ page arXiv:2610.40439 ↗

Motivated by the classical study of additive representation functions and the combinatorial phenomenon of sum-difference asymmetry, we investigate the subtractive representation function $d_{\mathcal{B},\mathcal{A}}(n)$, which counts the number of solutions of the equation $n = b - a$ with $a\in \mathcal{A}$ and $b\in \mathcal{B}$. Specifically, we study lower bounds and the asymptotic behavior of $d_{\mathcal{B},\mathcal{A}}(n)$ under polynomial density constraints of orders $x^α$ and $x^{1-α}$, where $0 < α< 1$. We first establish a general lower bound for the first moment of $d_{\mathcal{B},\mathcal{A}}(n)$. Furthermore, by employing a recursive construction, we prove that this lower bound is essentially optimal under certain regularity assumptions on the counting functions. Finally, utilizing probabilistic methods, we show the existence of sets for which $d_{\mathcal{B},\mathcal{A}}(n)$ has a logarithmic point-wise upper bound.

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

An even lattice $L$ of signature $(2,1)$ is Petersson-rigid if the orthogonal group of its discriminant form acts absolutely irreducibly on the space of cusp forms of weight $\frac32$ for its Weil representation, a space of dimension at least two. We prove, with computer assistance, that there are exactly twelve such lattices up to isometry, and we determine their root bases. Four of them are theta lattices, whose cusp forms are lifts of unary theta series. On each, the space is $\mathbb C F_0\otimesσ_0$ for one form $F_0$ and an irreducible $σ_0$, so the Petersson norm is $\|F\|^2=t_μ\|c_F(μ)\|^2$ for all cusp forms $F$, with one $t_μ>0$, $μ$ the least exponent of $F_0$ and $c_F(μ)$ the coefficient of $q^μ$ in $F$. We prove that the harmonic weak Maass forms of weight $\frac12$ in the $σ_0$-isotypic part with a pole of least possible order are exactly the forms $\mathcal H_F$ with principal part $q^{-μ}\overline{c_F(μ)}$, and $ξ_{1/2}\mathcal H_F=F/t_μ$. For the four theta lattices it is a theorem that $t_μ=\frac{s-1}{12}\sqrt s$, with $s$ the square-free part of $|\det L|/2$, and the $\mathcal H_F$ come from umbral moonshine. For the eight others we compute $F_0$, $t_μ$ and $\mathcal H_{F_0}$: the Hecke eigenvalues are integers and, at the primes computed, the $a_p$ of an elliptic curve, and for three of the eight $F_0$ is explicit as an eta-theta product. We prove, for every prime $p>3$, a closed formula in $p$ and one class number for the difference $g(X_0(4p)/w_p)-g(X_0(2p)/w_p)$ of the genera of two Atkin-Lehner quotients of modular curves. In a family $\mathcal D_p$ of discriminant forms, $p$ an odd prime, containing three of the eight, comparison with that classification shows that $\mathcal D_p$ is rigid exactly when $X_0(4p)/w_p$ has genus $1$ and $X_0(2p)/w_p$ has genus $0$.

comments
43 pages, 3 tables. Paper III of a series (arXiv:2608.19706, arXiv:2609.02843). Every statement marked [C] is reproduced by a script and a log of the reproduction archive, Zenodo, doi:10.5281/zenodo.23770095
fields
Number Theory
pdf ↗ page arXiv:2610.40519 ↗

As AI's mathematical capabilities rapidly improve, meaningful benchmarks are shifting from university-level problems and math olympiads to research-level mathematics. The Ramanujan Challenge is a benchmark comprised of research-level problems in number theory, including unpublished results and open conjectures. It presented concrete formulas for mathematical constants whose correctness can be checked numerically, while their proofs may require non-obvious mathematics. Here, we analyze the Challenge submissions, measuring the relative success of different AI models, Computer Algebra Systems (CAS), and formal tools. We find correct submissions that are conceptually distinct from the official solutions, and a proof of one of the published open conjectures. Evaluating the submissions exposed a second challenge: judging complex proofs reliably at scale. We introduce an AI-assisted evaluation pipeline for natural language proofs, CAS code, and Lean formalizations that assesses semantic and logical correctness. Compared with the conventional one-shot LLM judgment, our pipeline reduces false-positive verdicts on natural language proofs from 23% to 6% and improves judgment accuracy on supporting code from 46% to 58%. This approach provides a methodology for evaluating research-level mathematics at scale, with potential applications across mathematics and AI for science.

fields
Number Theory
pdf ↗ page arXiv:2610.40551 ↗

Differential Geometry37

We prove a uniqueness theorem for stationary integral $n$-cycles asymptotic to a pair of n-planes satisfying the symmetric angle condition. For the general angle condition, we obtain a classification for complete smooth embedded oriented minimal submanifolds with vanishing first de Rham cohomology that are asymptotic to a pair of $n$-planes.

comments
14 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.37816 ↗

We establish the generalized Cartan-Hadamard conjecture, including rigidity in the equality case. As a corollary, we obtain that isoperimetric regions are bounded. We prove the conjecture for Alexandrov spaces with two sided curvature bounds as well. A sharp Michael-Simon-type inequality for hypersurfaces in these spaces is also shown.

fields
Differential Geometry, Analysis of PDEs, Metric Geometry
pdf ↗ page arXiv:2610.37817 ↗

In previous papers, the first named author and E. Bryden explored Sobolev like inequalities relating the norm of a Riemmanian metric $g_1$, in terms of a background Riemannian metric $g_0$, in order to estimate the distance function $d_{g_1}$. Although $|g_1|_{g_0}$ is not the gradient of the distance function $d_{g_1}$, it was shown that a Morrey and Sobolev inequalities hold in their appropriate domains. In this paper we see that these results can be extended to the case where $g_1$ is a Rough Riemannian metric, something roughly analogous to an $L^{\infty}$ metric. We show that the proof of the Morrey and Sobolev inequality go through, with appropriate adjustments, as well as convergence results. We also adapt previous examples from the literature to the rough Riemannian metric case which show the hypotheses from the main theorems are necessary.

comments
16 pages, 1 figure, comments welcome
fields
Differential Geometry, Metric Geometry
pdf ↗ page arXiv:2610.37884 ↗

We determine the intrinsic Fisher geometry of the two-parameter circular wrapped normal family. Although its finite parameters form a cylinder, its metric completion is a disk: adjoining the uniform law extends the Fisher metric to a positive-definite real-analytic metric. The Gaussian curvature vanishes at the added point, is positive nearby, and tends to $-1/2$ as the underlying standard deviation tends to zero. We prove that the curvature has exactly one nonuniform zero radius and exactly one critical radius, the latter a nondegenerate positive maximum. Opposite points sufficiently close to uniformity are joined by a unique minimizing geodesic through the uniform law, so their intrinsic distance is not attained inside the nonuniform family. In contrast, identifying the means of real normal distributions modulo a period retains a complete hyperbolic cylinder with an infinitely distant cusp. Wrapping strictly decreases Fisher information in every nonzero tangent direction, while the information deficit and its fixed-order derivatives are exponentially small as the standard deviation tends to zero. The curvature theorem is proved by convergent series and explicit analytic remainder estimates; numerical figures serve only as illustrations.

comments
19 pages, 2 figures
fields
Differential Geometry, Statistics Theory
pdf ↗ page arXiv:2610.37985 ↗

In this paper, we construct new explicit parametrizations of Mannheim pairs in Euclidean 3-space. Unlike the known examples in the literature, which are essentially slant helices or general helices, the curve presented here is neither a helix nor a slant helix. We provide the full Frenet apparatus, the explicit Cartesian coordinates expressed in terms of elementary functions, and the corresponding Mannheim partner curve. The construction is based on a specific choice of the angular function that governs the curve's tangent indicatrix, leading to integrable expressions.

comments
22 pages, 1 figure
fields
Differential Geometry
pdf ↗ page arXiv:2610.38111 ↗

We develop a parabolic formulation of the Uhlenbeck gauge fixing theorem and use it to prove the maximal existence of the Yang-Mills flow in vector bundles over compact $n$-dimensional Riemannian manifolds for $n \geq 4$. We apply Moser's iteration technique \cite{Mo1} to give a new proof of the bound of the curvature. Using an idea of Hamilton on the Ricci flow \cite{Ha}, we also provide a new proof on uniform estimates of higher order derivatives. Furthermore, we investigate the blow-up of the Yang-Mills flow at the maximal existence time and improve an asymptotical result of Hong-Tian \cite{HT1}.

comments
This replaces Hong's paper arxiv.org/abs/1701.00601
fields
Differential Geometry
pdf ↗ page arXiv:2610.38124 ↗

We improve a parabolic version of Uhlenbeck's gauge fixing theorem for the Yang-Mills flow. This allows us to prove new existence of weak solutions of the Yang-Mills flow having with better properties than Struwe's weak solution on four manifolds in \cite {St2}. Finally, we apply the new parabolic version of Uhlenbeck's gauge fixing theorem to solve the Struwe problem in \cite {St2} and prove uniqueness of weak solutions to the Yang-Mills flow on compact four-manifolds with initial value $A_0 \in W^{1, 2}(M)$.

fields
Differential Geometry
pdf ↗ page arXiv:2610.38134 ↗

The classical Blaschke-Lebesgue problem seeks the convex body of minimal volume among all convex bodies of prescribed constant width. In this paper, we investigate the necessary conditions for volume minimizers of the $n$-dimensional Blaschke-Lebesgue problem via the inverse Gauss map and the inverse Weingarten transformation. We first introduce a generalized support function for hypersurfaces induced by the inverse Gauss map, characterize the Wigner caustic of constant width bodies, and accordingly construct convex bodies of constant width from prescribed functions. Building upon there results and applying the Brunn-Minkowski inequality, we establish a high-dimensional necessary condition: for almost every antipodal pair of a volume minimizer, one point is non-regular; at the other point, the minimum principal curvatures equals the reciprocal of the constant width. As an application, we provide a new proof for the two-dimensional Blaschke-Lebesgue theorem. Furthermore, we study the dimension-raising construction of Lachand-Robert and Oudet, and prove that every convex body produced by this construction satisfies our necessary condition. Finally, we put forward a conjecture stating that the sequence obtained by iterating this construction starting from a line segment yields minimizers for the Blaschke-Lebesgue problem for all dimensions.

comments
15 pages, no figures
fields
Differential Geometry
pdf ↗ page arXiv:2610.38257 ↗

Visualizing geodesic structures associated with general Riemannian metrics is a challenging problem in computational differential geometry. In this work, we present a computational framework for visualizing geodesics and geodesic spheres on a three-dimensional Riemannian manifold equipped with the metric $g=\text{diag}(1,x^2,1), x>0$. The associated Christoffel symbols and curvature tensors are computed symbolically, and the resulting geodesic equations are solved using both \texttt{SciPy}'s numerical integration method and a Physics-Informed Neural Network (PINN). The two solutions are compared to assess the accuracy of the neural network approximation. We further develop geodesic spike diagrams and surface visualizations to illustrate the deformation of geodesic spheres relative to their Euclidean counterparts. Intrinsic Riemannian surface area and volume are estimated numerically using the induced metric and the Riemannian volume density, respectively. For the chosen metric and a geodesic ball of radius one, the computed area and volume are approximately $0.362\%$ and $0.364\%$ smaller than the corresponding Euclidean values at the base grid resolution. A grid-refinement study is also performed to examine the sensitivity of these estimates to numerical resolution. The proposed framework demonstrates how symbolic differential geometry, numerical integration, and PINNs can be combined to investigate and visualize geometric structures associated with Riemannian metrics.

comments
21 pages, 8 figures, 3 tables
fields
Differential Geometry
pdf ↗ page arXiv:2610.38260 ↗

Let $M_n=(\mathrm{PU}(2)^n\rtimes S_n)\backslash\mathrm{PU}(2^n)$ be the space of projective $n$-qubit unitaries modulo local unitaries and permutations of the qubits. We prove that for all sufficiently large $n$ the manifold $M_n$ carries exactly two $\mathrm{PU}(2^n)$-invariant Einstein metrics up to scaling. Both Einstein metrics have uniformly bounded diameter after normalizing two-qubit costs, although approximating a Haar-random unitary requires exponentially many two-qubit gates. In contrast, we construct non-Einstein metrics with nonnegative Ricci curvature and exponentially growing typical control distances, and determine the sharp curvature threshold for this family.

comments
31pages, no figures
fields
Differential Geometry
pdf ↗ page arXiv:2610.38340 ↗

Let $U$ be a smooth affine variety of the form $U=\mathrm{P}^n\setminus H$, where $H\subset\mathrm{P}^n$ is a smooth connected hypersurface. We prove that every smooth projective compactification of the complex manifold $U$, by adding a smooth connected divisor, is isomorphic to $\mathrm{P}^n$. The proof uses the rational Reeb index of the normal circle bundle and positive $S^1$-equivariant symplectic homology. This paper is motivated by the work of Chi Li and Zhengyi Zhou, and makes a generalization to their result.

fields
Differential Geometry, Algebraic Geometry, Symplectic Geometry
pdf ↗ page arXiv:2610.38376 ↗

In this paper, we give a new proof of Perelman's pseudolocality theorem for Ricci flow, which does not rely on Perelman's Harnack-type inequality. The key step is an estimate relating initial local $μ$-entropy to pointed Nash entropy at later spacetime points. The argument also works for other reasonable geometric flows, like the $G_2$-Laplacian flow, at a scale depending on its deviation from Ricci flow and its scalar curvature lower bound. As a consequence, we can also prove the quantitative rigidity results concerning pointed Nash entropy due to Hein-Naber and Bamler for such geometric flows. In the appendix, we also show that the other results in Bamler's work (arXiv:2008.07093), when suitably modified, remain valid for Laplacian flow with bounded torsion. These include log-Sobolev/Poincaré inequality for conjugate heat kernel measure, heat kernel estimates, and dependence of the pointed Nash entropy on its basepoint.

fields
Differential Geometry
pdf ↗ page arXiv:2610.38408 ↗

In this paper, we establish a new estimate on the time-derivative of pointed Nash entropy and use it to give a new proof of backward pseudolocality for Ricci flow. The proof does not rely on Bamler's compactness theorem and structure theory concerning limits of Ricci flows. Our methods also work for other reasonable geometric flows, like the $G_2$-Laplacian, at a scale depending on its deviation from Ricci flow and its scalar curvature.

fields
Differential Geometry
pdf ↗ page arXiv:2610.38418 ↗

We construct an explicit length-minimizing curve in a polynomial rank-two sub-Riemannian structure on $\R^4$. Its arclength parametrization is $C^{1,1/2}$ and is not $C^{1,α}$ near an interior point for any $α>1/2$. Minimality is proved by an approximate calibration chosen separately for each competitor. The example admits a minimizing lift to a rank-two Carnot group of step five. Generalizations are announced.

comments
14 pages
fields
Differential Geometry, Metric Geometry, Optimization and Control
pdf ↗ page arXiv:2610.38481 ↗

We introduce the sequence curvature–dimension condition $SCD(K,N)$ for complete refinement systems of finite metric probability spaces. The condition couples a transport action bound with entropy comparisons along a single probability section through the prescribed refinement layers. Within a bounded comparison range, we prove that midpoint comparisons on three consecutive layers characterize the condition on every fixed finite segment. If, in addition, the refinement sequence converges in the measured sense in its intrinsic bridge realization, then $SCD(K,N)$ is equivalent both to the vanishing of single-layer midpoint defects and to the entropic curvature–dimension condition $CD^{e}(K,N)$ of the limit. In the reverse direction, a $CD^{e}(K,N)$ bound on the limit yields quantitative recovery estimates that identify shrinking transport scales on which finite layers retain its second-order curvature comparison. These estimates are uniform over endpoint measures and include Dirac masses. Examples illustrate the effects of the refinement rule, the layer metrics and the reference measures.

comments
54 pages
fields
Differential Geometry, Probability
pdf ↗ page arXiv:2610.38538 ↗

In this paper, we construct explicit examples of Mannheim pairs, in the classical sense, in Minkowski 3-space $\mathbb{L}^3$, one for each of the five types of such pairs. In our main examples the Mannheim curve is neither a helix nor a slant helix. For each example we give the complete Frenet apparatus of both curves of the pair and their Cartesian coordinates in terms of elementary functions. The construction writes the tangent indicatrix in angular coordinates and uses a suitable auxiliary angle function, which reduces all the relevant integrals to elementary form; it is carried out both starting from the Mannheim curve and starting from its partner. In these coordinates, we also characterize the helices and the slant helices with timelike axis. We also prove, for the five types, that a Mannheim curve is a slant helix if and only if its partner is a helix, and we give an explicit example of such a pair.

comments
51 pages, 2 figures
fields
Differential Geometry
pdf ↗ page arXiv:2610.38541 ↗

We construct analogues of Riemann minimal examples among surfaces in the Euclidean 3-space whose mean curvature is given by a prescribed function on the unit sphere in terms of their Gauss map. Specifically, we obtain a 2-parameter family of complete, properly embedded surfaces foliated by circles and straight lines and invariant under a nontrivial translation.

fields
Differential Geometry
pdf ↗ page arXiv:2610.38563 ↗

Statistical manifolds, introduced by Amari in information geometry, carry a pair of dual torsion-free connections $(\nabla,\nabla^{*})$ together with a Riemannian metric. In this chapter we survey the theory of \emph{statistical solitons}, that is, vector fields and constants that solve the Ricci-soliton equation simultaneously for $\nabla$ and $\nabla^{*}$, together with the statistical analogue of almost quasi-Yamabe solitons. We discuss two principal settings: (i) statistical warped products $\R\times_f N_2$ and $N_1\times_f\R$ for (pseudo) Riemannian manifolds $N_{1}$ and $N_{2}$, where the soliton equation constrains the warping function; and (ii) statistical submanifolds of Kenmotsu statistical manifolds, where the position of the Reeb field $ξ$ relative to the submanifold and the presence of concircular or concurrent vector fields determine the Einstein, $η$-Einstein or quasi-Einstein character of the submanifold. We further review the results of Blaga and Chen on gradient solitons and statistical structures, in particular the connections $\nabla^θ$ defined by a $1$-form, volume formulas and bounds for the Ricci tensor. We also describe Chen-type inequalities for statistical warped product submanifolds, which give the extrinsic context in which such solitons live. Key steps of the proofs, remarks on the sharpness of hypotheses, worked examples, and open problems are included.

comments
27 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.38723 ↗

We study the arrival time equation of the mean-convex horizontal mean curvature flow in the Heisenberg group. We prove existence of viscosity solutions when the initial set is horizontally mean-convex and either non-characteristic, or axisymmetric and with horizontal mean curvature extending continuously across the characteristic set. A key ingredient is an approximation scheme by sets with prescribed Riemannian mean curvature, which preserves the mean-curvature bounds up to an arbitrarily small error. We further show that, when the evolving level sets form a generalized \(C^2\)-foliation, the horizontal mean curvature blows up around characteristic points. This provides an obstruction to self-similar evolution in the axisymmetric class considered above and, in particular, shows that the Pansu sphere cannot evolve self-similarly.

fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2610.38929 ↗

Let $\overline{X}$ be a compact complex surface with a Gauduchon metric, and let $D\subset\overline{X}$ be a smooth connected divisor. We construct an Uhlenbeck compactification of the moduli space of rank-two parabolic Hermitian–Einstein connections with prescribed holomorphic determinant.

fields
Differential Geometry
pdf ↗ page arXiv:2610.38958 ↗

We study the topology and regularity of small sub-Riemannian balls under an index condition on length-minimizing curves in the metric tangent space. We prove that sufficiently small spheres are Lipschitz hypersurfaces homeomorphic to Euclidean spheres, while closed balls are homeomorphic to Euclidean closed balls, and open balls are diffeomorphic to Euclidean open balls. These results improve the known ones and extend them beyond two-step distributions. The proof relies on uniform Lipschitz estimates for the distance, of independent interest.

fields
Differential Geometry, Metric Geometry, Optimization and Control
pdf ↗ page arXiv:2610.38962 ↗

In this paper, we show that any Kähler $C$-space of classical type has nonnegative cross quadratic bisectional curvature and positive dual cross quadratic bisectional curvature. As a consequence, such manifolds are Fano. This confirms a substantial part of a conjecture of Ni-Zheng (Conjecture 1.5 in \cite{NZ}).

comments
60 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.39012 ↗

Using the tools developed by Kennard, Wylie, and Yeroshkin for weighted sectional curvature bounds, we generalize a theorem of Wilhelm to show that Synge's Theorem holds for manifolds with density that have positive weighted intermediate Ricci curvature and a sufficiently large first systole. Furthermore, we provide a sphere theorem for compact manifolds with positive weighted intermediate Ricci curvature.

comments
14 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.39015 ↗

We study left-invariant Gray $\mathcal{A}$-metrics (cyclic-parallel Ricci tensor) on nilpotent Lie groups, focusing on the algebraic condition that the Ricci operator belongs to the quasicentroid $\operatorname{QC}(\mathfrak{n})$ of the Lie algebra $\mathfrak{n}$. We review and develop the abstract structure theory of quasicentroids, and prove a Central Decomposition Theorem: any nilpotent Riemannian Lie algebra with $\operatorname{Ric} \in \operatorname{QC}(\mathfrak{n})$ decomposes as a central product of ideals $\mathfrak{i}_j = E_{λ_j} \oplus \mathfrak{z}$, where $\mathfrak{z}$ is the center of $\mathfrak{n}$ and $E_{λ_j}$ are the negative Ricci eigenspaces. Endowed with the restricted metric, each factor $\mathfrak{i}_j$ is itself a Gray $\mathcal{A}$-space. Finally, we investigate when the general $\mathcal{A}$-metric condition reduces to $\operatorname{Ric} \in \operatorname{QC}(\mathfrak{n})$. We prove this equivalence unconditionally for two-step nilpotent algebras and whenever the metric admits a nice basis, and provide a general characterization via the vanishing of two trace identities.

comments
Any comments, corrections, or suggestions are deeply appreciated. 25 pages
fields
Differential Geometry, Representation Theory
pdf ↗ page arXiv:2610.39184 ↗

The von Mises–Fisher (vMF) distribution is the natural exponential family analogue of the normal distribution on the unit hypersphere. We bring together previous results of its dually flat structure and establish new results on the information geometry of the family of vMF distributions. In particular, we characterize the exponential and mixture autoparallel submanifolds, and give the classification of doubly autoparallel submanifolds. Furthermore, we derive explicit formulas for the unique minimizers of the Kullback-Leibler divergence on these submanifolds and establish the corresponding projection theorems.

comments
All comments are welcome!
fields
Differential Geometry
pdf ↗ page arXiv:2610.39249 ↗

We develop the weighted Sobolev and Hölder analysis needed to study perturbations of complete asymptotically conical (AC) Ricci shrinkers. Weighted elliptic estimates yield a global weighted divergence-free slice in spaces that retain the asymptotic data at infinity. As a geometric application, we prove pointed Gromov-Hausdorff rigidity of nontrivial AC shrinkers with vanishing infinitesimal solitonic deformation space.

fields
Differential Geometry
pdf ↗ page arXiv:2610.39814 ↗

We derive an interior planarity estimate for space-time proper mean curvature flows of $n$-dimensional submanifolds of $\mathbb R^{n+p}$, $n\geq5$, that are uniformly quadratically pinched up to the Andrews-Baker threshold $\frac{4}{3n}$. The estimate is parabolically scale-invariant and it requires neither curvature nor entropy bounds. The proof combines Naff's gradient estimates with a localization argument in the spirit of Ecker and Huisken. In dimensions five and six, Naff's estimates alone do not give the gradient terms a sign. We bound these terms from below with an argument we developed in a previous work. As a consequence, for $n\geq5$, and by known results for $2\leq n\leq4$, every space-time proper ancient solution that is uniformly $\frac{4}{3n}$-pinched is either a static affine $n$-plane or lies in a fixed affine $(n+1)$-dimensional subspace. This replaces the finite entropy and polynomial curvature growth assumptions of Lee, Naff and Zhu by space-time properness, and improves their pinching constant in dimensions two, five and six. For closed flows, we extend Lynch's planarity estimate to a larger range of exponents.

comments
13 pages. Comments are welcome!
fields
Differential Geometry
pdf ↗ page arXiv:2610.39877 ↗

Spectral curves of constant mean curvature tori in Euclidean three-space are real hyperelliptic curves carrying two meromorphic differentials with integral periods. These transcendental period conditions are studied through Whitham deformations, which deform the curve while preserving the periods. We extend Whitham deformations to all real hyperelliptic curves of this type, by holding fixed the plane spanned by the periods, or this plane together with its complex structure. Under mild nondegeneracy conditions the resulting isoperiodic sets are manifolds of dimensions three and one, respectively. Along the one-dimensional isoperiodic sets, a generalization of the Willmore energy is a local parameter away from its critical points, to which the spectral curves of tori belong. Finally, using homology bases adapted to the branch points, we find discrete invariants of the isoperiodic sets of doubly periodic curves: a triple of integers and a refined conformal type.

fields
Differential Geometry
pdf ↗ page arXiv:2610.39935 ↗

We classify connected, simply connected, noncompact three-dimensional trans-Sasakian $η$-Einstein manifolds. In [1], we showed that, in the compact case, such a manifold is either of $β$-Kenmotsu type or homothetic to a Sasakian manifold. In this paper, in the noncompact case, we find families of trans-Sasakian $η$-Einstein manifolds that are neither $β$-Kenmotsu nor homothetic to Sasakian manifolds. These families have infinitely many degrees of freedom. We give these nontrivial metrics explicitly. We also give a structure theorem for the case in which the characteristic vector field is Palais-nonregular.

comments
48 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.39971 ↗

We establish two types of Alexandrov–Fenchel inequalities for the weighted curvature integrals of static convex domains in space forms. The first type consists of a complete family of inequalities involving three weighted curvature integrals, with the second Minkowski type inequality of Xia [Calc. Var. Partial Differential Equations 55 (2016), Art. 96] and the weighted almost Schur lemma of Li and Xia [J. Differential Geom. 113 (2019), pp. 493–518] as special cases. The second type consists of a complete family of inequalities involving two weighted curvature integrals, confirming a conjectured geometric inequality by Hu and Li [Trans. Amer. Math. Soc. 375 (2022), pp. 5587–5615]. The key novelty lies in observing that, via the orthogonal projection map, the weighted curvature integrals for domains in space forms admit a natural interpretation in terms of mixed volumes of Euclidean convex bodies, thus reducing the problem to the classical Alexandrov–Fenchel inequalities in convex geometry.

comments
34 pages. Comments are welcome!
fields
Differential Geometry
pdf ↗ page arXiv:2610.40087 ↗

Let $F=αΦ(q,s)$ be a regular generalized $(α,β)$-metric, where $q=\|β\|_α^2$ and $s=β/α$, endowed with the Busemann–Hausdorff or Holmes–Thompson volume. We derive explicit comparison formulas for the induced hypersurface volume and the associated volume mean curvature and use them to study two transfer problems suggested by the Randers case. The first asks whether the same hypersurface is isoparametric for $α$ and $F$; the second asks whether the same regular foliation is isoparametric for both metrics. Exact local and global criteria are obtained. Their Randers specializations recover the corresponding hypersurface transfer and the condition $df(W)=\varphi(f)$. We also prove an all-normal induced-volume rigidity theorem and construct a complete non-Randers example realizing both transfer mechanisms.

comments
26 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.40128 ↗

Spectral curves of constant mean curvature tori in Euclidean three-space are real hyperelliptic curves carrying two meromorphic differentials with integral periods. Deformations that preserve the periods, called Whitham deformations, are well understood for nonsingular curves, where the isoperiodic sets are manifolds. We extend Whitham deformations to curves with ordinary double points that are fixed by the real involution. At such curves the isoperiodic sets remain manifolds and are transverse to the curves with double points, so Whitham deformations can change the genus of the spectral curve. We describe how the double points open, and when the derivative of the normalized Willmore energy vanishes at a nodal curve. By inserting double points, we show that every value of a discrete invariant of the isoperiodic sets found in previous work occurs.

fields
Differential Geometry
pdf ↗ page arXiv:2610.40197 ↗

This paper extends the classical results of Eisenhart (1923) and Levi-Civita (1896) on the classification of pairs of germs of Riemannian metrics with the same geodesics, either as parametrized curves (affine equivalence) or as unparametrized curves (projective equivalence), to sub-Riemannian metrics on arbitrary step 2 distributions: at every stable point in the projective case and at every point in the affine case. This extends the results of Zelenko (2004) for contact and even-contact distributions and the affine result of Lin and Zelenko (2024) for step 2 distributions with ad-surjective Tanaka symbols; our projective result covers the ad-surjective case as well. In the affine case, we prove that if a sub-Riemannian metric admits an affinely equivalent metric that is not constantly proportional to it, then locally it is a product of two sub-Riemannian metrics. In the projective case, we prove the 2019 conjecture of Jean, Maslovskaya, and Zelenko on generalized Levi-Civita pairs; in particular, the distribution admits a product structure, the squares of its components are involutive, and the restrictions of the two metrics to each leaf of the corresponding foliation are conformal to each other under the appropriate pullback. The proof is based on a new graph-theoretic formalism, in which compatible moving frames are represented by the vertices and edges of certain graphs. As a byproduct, we introduce a new discrete invariant of step 2 nilpotent graded Lie algebras, the characteristic tuple. The compatible graphs are used on the open dense set where this tuple is locally constant; the resulting bracket relations are identities between smooth tensors, so they extend by continuity across the points where the tuple jumps. Consequently, our classification holds without any assumption of local constancy of the characteristic tuple.

comments
81 pages, 1 table. Based on the PhD thesis of the first author, written under the supervision of the second author and defended at Texas A&M University in September 2026
fields
Differential Geometry
pdf ↗ page arXiv:2610.40288 ↗

We present an operator-theoretic framework for the Ollivier–Ricci curvature of (one-parameter families of) random walks generated by positive semigroups on graphs. On a metrically complete graph $(G,d)$ that is $d$-locally finite, we introduce a class of admissible semigroup random walks whose infinitesimal first-order approximation is itself a random walk. We prove that the Ollivier–Ricci curvature of an admissible semigroup random walk is well-defined and completely determined by its first-order approximation. We then establish a variational representation of the curvature of random walks in terms of a notion of the initial-time generator. This representation applies in particular to admissible semigroup random walks. Finally, we use this representation to define an operator-theoretic Ollivier–Ricci curvature for operators acting on spaces of functions over general metric spaces and establish sufficient conditions for well-definedness. This framework contains, in particular, Markovian random walks associated with discrete Laplacians.

comments
20 pages. Comments and suggestions are welcomed
fields
Differential Geometry, Probability
pdf ↗ page arXiv:2610.40301 ↗

In this paper, we prove that a connected complete Kähler manifold of complex dimension at least two satisfying $\Ric\geq\varepsilon Rg\geq0$ for a fixed $\varepsilon>0$ is compact or Ricci-flat.

comments
35 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.40419 ↗

We generalize a method first introduced by Li, Yau, Simon, and Topping (for closed surfaces immersed in the flat Euclidean space), and we establish a global-in-nature estimate, with an explicit cut-locus contribution, on the Willmore energy of closed surfaces that are immersed in a complete Riemannian three-manifold and need not be embedded. Our estimate applies to ambient spaces whose sectional curvature is bounded above and whose injectivity radius may be finite. For positive upper curvature bounds, the global weighted estimates require an explicit radius restriction. The Willmore energy is bounded below by a functional involving the self-intersection number of the surface and the injectivity radius of the ambient space. Furthermore, by investigating in what sense our inequalities are optimal and realized by geodesic spheres in constant curvature spaces, we are led to introduce a weighted version of the Willmore functional, which is adapted to geodesic spheres in the model spaces and takes the sectional curvature of the ambient space into account. As a corollary, we obtain sufficient conditions for an immersed surface in a curved space to be embedded.

comments
20 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.40546 ↗

We study robust features of smooth surfaces in 4-space associated with contact with lines and hyperplanes. We investigate the local and multi-local singularities of orthogonal projections and height functions that describe these contacts and their corresponding geometric loci on the surface. At an $A_4$-singularity of a height function, we show that the $A_3$-curve and the $A_1A_2$-curve are generically tangent with contact of order $2$. We further establish criteria for the versality of the families of height functions and orthogonal projections in terms of the regularity of the $B_2$-curve and $S_2$-curve, respectively. Finally, we obtain the $[A_2]$- and $(A_0S_0)_2$-curves arising from multi-local singularities of orthogonal projections and describe their tangency properties at the $B_3$- and $H_3$-singularities.

comments
24 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.40604 ↗

Statistics Theory30

Stochastic-gradient Langevin methods are sampling algorithms that replace the gradient of the log probability density by a noisy, possibly biased evaluation. We study how such gradient-evaluation errors affect the Euler and randomized midpoint discretizations of Langevin dynamics by comparing each noisy chain with its exact-gradient counterpart. For continuously differentiable, strongly log-concave targets with globally Lipschitz gradients, we derive comparison bounds under a sub-Gaussian condition on the gradient noise. The resulting 2-Wasserstein bounds hold uniformly over iterations, and are linear in both the step size and the $L^2$ norm of the evaluation bias, with a square-root dependence on dimensionality. To the best of our knowledge, no comparable 2-Wasserstein bounds have previously been established for randomized midpoint with noisy gradients. For Euler, our results complement recent Wasserstein bounds by allowing biased evaluations, and by not requiring additional regularity assumptions on the evaluation errors.

comments
26 pages, 3 figures
fields
Statistics Theory, Numerical Analysis
pdf ↗ page arXiv:2610.37858 ↗

Kernel methods face two recurrent bottlenecks: the cubic cost of inverting an $n\times n$ kernel matrix, as in kernel ridge regression, and the evaluation of kernel integrals, as required in kernel quadrature. Existing low-rank kernel and Gaussian process approximations primarily address the former bottleneck, but do not control the downstream quadrature error when both the kernel matrix and kernel mean are approximated, particularly when the integrand lies outside the kernel reproducing kernel Hilbert space. We address both challenges through an operator-adapted finite-feature approximation. Specifically, we construct a finite-dimensional working kernel from the eigenvalues and eigenfunctions of a second-order differential operator. We establish convergence guarantees for the resulting finite-feature estimators in kernel quadrature, with extension to other related kernel methods. Our results show that, with $m \lesssim n$ basis functions, the truncated estimator attains the corresponding benchmark statistical rates. The theory covers fixed/random designs, noisy/noiseless observations, oversmoothing/undersmoothing regimes, and Matérn/Gaussian-type weights. We provide explicit error bounds that quantify the roles of the spectral cutoff, regularization parameter, lengthscale, sampling geometry, and operator boundary condition. We verify the convergence results in numerical experiments.

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

In recent years, optimal transport has emerged as a useful framework for constructing distribution-free multivariate two-sample tests by transporting observations to a reference distribution under a suitable transportation cost. However, existing optimal transport-based tests can perform poorly in high dimension, low sample size (HDLSS) settings, and their performance depends critically on the choice of the reference distribution and transportation cost. We investigate this phenomenon and show that suitable choices can substantially improve their performance. Motivated by this analysis, we introduce a class of two-sample tests based on optimal derangements that do not require an external reference distribution. The minimum distance pairing test of Rosenbaum arises as a special case when the optimization is restricted to a subclass of derangements, thereby revealing a connection between this method and optimal transport. We propose the optimal derangement (ODER) test and its distribution-free variant, the ODER-SHC test, obtained by restricting the minimization to derangements consisting of a single Hamiltonian cycle. We establish their consistency under both HDLSS and classical large-sample asymptotic regimes. We also develop corresponding procedures based on the $L1$ distance and establish their high-dimensional consistency under conditions involving coordinate-wise energy distances. These $L1$ distance based tests can also discriminate between two high-dimensional distributions with identical first two moments but different marginal distributions. Analyses of benchmark datasets and extensive simulation studies demonstrate the performance of the proposed methods across a variety of alternatives and data settings.

fields
Statistics Theory
pdf ↗ page arXiv:2610.38519 ↗

Although flocking behaviour has been studied extensively in active matter physics and mathematical biology, methods for assessing parameter estimability remain underdeveloped. For models formulated as stochastic differential equations (SDEs), we develop a Hessian-based diagnostic framework that detects unidentifiable directions and indicates whether, and how, estimation precision can be improved. The framework utilizes the submartingale structure of the loss function's Hessian and tracks its minimum eigenvalue over time. Under convergence of the time-averaged Hessian, we prove that this eigenvalue grows linearly for identifiable models, but only sublinearly, as $o(t)$, for unidentifiable ones; for a specific type of parameter redundancy, this $o(t)$ bound is tightened to $o(\sqrt{t}\log t)$. Applying the framework to stochastic flocking models, we demonstrate that, in identifiable settings, the magnitude of the eigenvalue reflects the attainable estimation precision. We further uncover a physical mechanism of unidentifiability: as the system approaches the ordered state, the parameters become algebraically degenerate, even though the model contains no trivial redundancy. Identifiability therefore depends on the dynamical regime, not only on model structure. Our framework offers a practical tool for reliable parameter estimation, not only in flocking models but in SDE models across diverse fields.

comments
18 pages, 5 figures, Supplementary Information available as an ancillary file
fields
Statistics Theory
pdf ↗ page arXiv:2610.38615 ↗

We study ridge regression based on uniformly subsampled observations in high-dimensional linear models, where the number of predictors and the sample size grow proportionally. Subsampling is implemented through independent Bernoulli indicators with a common selection probability. We establish central limit theorems for linear contrasts of the ridge estimator, allowing for non-Gaussian predictors and general population covariance matrices. Under a vanishing-signal assumption, we obtain an explicit bias correction in the isotropic case and develop consistent estimators of the asymptotic variances. These results enable asymptotically valid tests for linear contrasts of the regression parameter in the isotropic setting. Our proofs exploit the resolvent representation of the ridge estimator and combine leave-one-out arguments with deterministic equivalents from random matrix theory.

fields
Statistics Theory
pdf ↗ page arXiv:2610.38763 ↗

The Rosenblatt transform maps a random vector to independent uniform variables through successive conditional distribution functions; for laws on $\mathbb{R}^{\mathbb{N}}$ with atomless conditional distributions and a fixed order of the coordinates, it is the almost surely unique monotone triangular map with this property. For a fixed reference law, transform-based tests remain valid under every fixed admissible order, but that choice can still affect their statistical power. We extend the generalized Rosenblatt transform to laws on countable products of standard Borel spaces, which requires, in addition to an order on the index set, a total order on each component space. For fixed orders, we establish identification and uniqueness results for this extended generalized Rosenblatt transform (EGRT) that parallel those for the classical transform. We then characterize order dependence in two senses: first demonstrating conditions under which the EGRT is invariant under linear extensions of prescribed partial orders, and second showing that under every admissible order the output of the EGRT retains all the statistical information from the input observations over reference-dominated families. We close with a brief discussion of what these results mean for the relationship between order choice and goodness-of-fit testing.

fields
Statistics Theory
pdf ↗ page arXiv:2610.38818 ↗

Principal-agent hypothesis testing studies statistical contracts in which a principal rewards an agent according to data the agent generates. Existing work focuses on the single-shot setting, where the agent produces a single dataset. We extend the framework to sequential settings, where evidence accumulates over time, rewards may be deferred to the end or disbursed incrementally, and the agent may stop the contract at a strategically chosen stopping time. We call a contract null-deterring if no ''null agent'' (those whose data-generating distribution lies in the null hypothesis) can profit in expectation under any stopping rule, and our main conceptual result shows that such contracts are characterized by e-processes. We then turn to the agent's best response and identify the optimal stopping rule through the Snell envelope of the reward process. We develop simpler, more interpretable approximations that often require the agent to have only partial knowledge of its distribution.

comments
26 pages; 3 figures
fields
Statistics Theory
pdf ↗ page arXiv:2610.38872 ↗

Scientific domain knowledge in regression often concerns structural relationships among model terms, which are typically encoded as parameter constraints. Since such relationships rarely hold exactly in practice, prior distributions should encourage them while at the same time retaining support for scientifically plausible departures. Accounting for these relationships becomes more pressing in modern regression, where high-dimensionality is usually present and regularisation is essential. $R^2$ decomposition priors provide an interpretable foundation for regularisation by placing a prior on total explained variance and distributing the implied signal across model terms. We introduce the Proximal R2 prior, which uses proximal relaxations to encode these relationships as soft constraints on the variance allocation. Our formulation yields differentiable posteriors compatible with standard gradient based samplers. Theoretically, we prove that our prior preserves the characteristic marginal properties of global-local shrinkage priors. Moreover, we establish posterior consistency and contraction rates in growing dimensions, showing that the inclusion of structural relationships and proximal methods do not alter the shrinkage properties. Notably, these results demonstrate that the structural constraints in the model do not hinder posterior recovery. Simulation studies and real-data applications to interaction and generalised additive models demonstrate that our prior improves parameter recovery, out-of-sample prediction, and sampling efficiency over existing constrained and unconstrained shrinkage priors, even under structural misspecification.

fields
Statistics Theory
pdf ↗ page arXiv:2610.38879 ↗

Neural networks are powerful memorizers which are often able to interpolate their training data even when the labels have been randomized. While there exists an extensive literature on the memorization capacity of fully connected networks, in practice more specific architectures with problem-dependent properties are preferred, such as convolutional networks for image classification. In this paper we consider convolutional networks which are invariant with respect to a given arbitrary finite group of orthogonal transformations, which may include translations, reflections, and/or rotations of images and invariances of higher order tensors. We prove upper bounds on the size of an invariant convolutional neural network with threshold activations that is required to interpolate a given dataset with two classes. Our bounds are formulated in terms of a complexity measure that takes the invariant structure into account and is instance-specific, i.e., it is related to the mutual arrangement of the classes in the given dataset and their geometric properties rather than the number of samples. Our proof is constructive: for given input data, instances of an interpolating network can be computed via a randomized algorithm with high probability. In numerical experiments we investigate the practical effectiveness of this algorithm.

fields
Statistics Theory
pdf ↗ page arXiv:2610.38938 ↗

Estimating conditional parameters, such as heterogeneous treatment effects, often requires rich covariate adjustment, even when the parameters are reported along only a few dimensions. Fitting nuisance functions on the full sample makes all observations available for adjustment, but creates dependence between fitted scores and the observations at which they are evaluated, which is typically avoided by cross-fitting. We develop pointwise inference with full-sample nuisance predictions for exactly identified conditional moment equations, recovering conditional average treatment effects as a special case. We localize the estimating equations around the reporting point using distributional nearest neighbors (DNN), a U-statistic-based averaging procedure. Under sufficient conditions on the local design, orthogonality, prediction accuracy and quantitative deletion stability, the estimator is asymptotically normal, and a frozen-score jackknife consistently estimates its limiting covariance with nuisance predictions held fixed. In simulations, full-sample and cross-fitted inference perform similarly, with coverage shortfalls from nuisance approximation error, spatial bias and heavy studentized tails. An application to 401(k) eligibility using Survey of Income and Program Participation data finds similar estimates across nuisance prediction methods, with wide normal-reference intervals.

comments
36 pages (including appendices and references), 4 figures, 5 tables; supplementary material: 12 pages, 2 figures, 17 tables
fields
Statistics Theory
pdf ↗ page arXiv:2610.38965 ↗

We studied simultaneous recovery of a latent group count, subject partition, and signature means from multiview ordinal ranks. A normalized reference rearrangement score is an affine Spearman correlation; the problem concerns the information retained by several such scores and their noise geometry. We develop an ordered-gap estimator with direction-specific concentration radii. Its finite-sample guarantee separates signature noise, missing groups, and candidate coverage, and allows the group count to grow under an attainable-margin condition. A coordinatewise partition followed by label-tuple refinement recovers groups even when every individual coordinate has population collisions. A binary-code construction explains why the one-dimensional inverse-group margin restriction need not govern a retained coordinate bank. We derive actual-law concentration from bounded ranking modules and a fixed-dimensional combinatorial central limit theorem under an observed permutation representation. A binary ordinal submodel gives logarithmic exact-recovery information scales. A subject-effect construction distinguishes persistent overlap from reducible measurement noise, and an additional ordinal anchor quantifies how new information lowers that error floor. Five focused simulation scenarios illustrate direction-specific calibration, growing-group recovery, coordinate collision resolution, variance reduction, and the effect of an additional ordinal anchor.

comments
24 pages, 4 figures
fields
Statistics Theory
pdf ↗ page arXiv:2610.38986 ↗

Learning independence is fundamental to statistical inference and machine learning, yet learning independence between entire time series by a test remains challenging when only a single observation record is available. Existing guarantees often rely on structural or mixing assumptions, while stationarity and ergodicity alone do not permit consistent testing. In this work, we identify a class-level boundary governed by shared nontrivial Koopman eigenvalues, which represent common persistent oscillatory frequencies of the two processes. When no such eigenvalues are shared, we extend shift-based rank calibration with finite-window dependence witnesses and a data-adaptive threshold to construct a deterministic, weakly consistent test with finite-sample false-positive control, without quantitative mixing assumptions. Conversely, we show that no possibly randomized test can achieve vanishing false-positive probabilities under every independent jointly totally ergodic law while consistently detecting every dependent jointly totally ergodic law with a shared nontrivial eigenvalue. This impossibility already holds for binary observations and persists within any prescribed nonempty open eigenvalue window, identifying a spectral obstruction to universal learning of full-process independence.

fields
Statistics Theory
pdf ↗ page arXiv:2610.38999 ↗

We study Bayesian estimation of conditional densities represented by normalized squares of orthogonal polynomial series. We specify the conditional density without modeling the marginal distribution of covariates. A prior on smoothness, the number of terms, and the coefficients gives adaptive posterior contraction at the minimax rate without a logarithmic factor when the normalized square-root representation of the true density is bounded away from zero and sufficiently smooth. For one outcome and $d_x$ covariates, the rate over classes with degree smoothness $s$ is $n^{-s/(2s+d_x+1)}$. The posterior predictive density attains the corresponding minimax squared Hellinger risk. For bounded nonnegative representations in Legendre and Chebyshev classes, we establish the minimax rate at every $s>0$. A prior that also permits a small mixture with the reference density adapts over these classes up to a logarithmic factor and retains the exact rate on the positive, sufficiently smooth subclass. Additional results concern identification, conditional distribution functions and quantiles, coefficient recovery and uniform convergence, independent Gaussian coefficient priors, and selection of polynomial terms.

fields
Statistics Theory
pdf ↗ page arXiv:2610.39177 ↗

The median of the beta distribution has no closed form, but it is closely tied to the median of the gamma distribution. Kerman's approximation has the ratio form $g(α)/(g(α)+g(β))$ with $g(x) = x - 1/3$, a lower bound on the gamma median, and it is a lower bound on the beta median for $1/3 < α< β$. The ratio form built from the true gamma median is a tighter lower bound, asymptotically exact as $β\to \infty$. The ratio form built from the Wilson-Hilferty approximation to the gamma median, implicit in a classical approximation to the $F$ distribution but little known as an approximation to the beta median, is an upper bound on the edge $α= 1$ and for large shape parameters. The ratio form that is exact on the lines $α= 1$ and $β= 1$ yields a new approximation to the gamma median, which is an upper bound on it for shape parameter below 1 and a lower bound above 1; no ratio form gives the beta median exactly. For large shape parameters, the logit of the median has an explicit second-order expansion. For small shape parameters, bounds in elementary functions are asymptotically tight, and odds-corrected forms of the low-$α$ asymptote, with an elementary factor that is exact on the edges $α= 1$ and $β= 1$, are, numerically, one-sided bounds within 0.44% of the median that are exact on the lines $α= 1$, $β= 1$, and $α= β$. Steering their exponents with four fitted constants, and interpolating between two ratio forms where both shape parameters exceed 1, gives an approximation in elementary functions that is exact on those lines and numerically within 0.065% of the median over the whole domain. Most of the proofs are machine-verified in Lean 4.

comments
49 pages, 11 figures. The Lean 4 formalization and Python code that reproduces the figures and numerical checks are in the ancillary files
fields
Statistics Theory
pdf ↗ page arXiv:2610.39202 ↗

Self-normalising test statistics for time series circumvent the lag-specification of long-run variance estimators by employing an inconsistent estimator for studentization. This leads to asymptotically pivotal test distributions under stationarity, but not for nonstationary sequences. Focusing on the multiple changepoint problem, we propose an alternative self-normalised test statistic which is asymptotically pivotal even if the noise is nonstationary. Central to our argument are statistical functionals which are invariant under temporal reparametriation, i.e. clock-changes. Simulations show that the proposed procedure is more conservative than competing bootstrap procedures, but considerably more powerful against multiple changes and more reliable in terms of size for highly nonstationary time series in larger samples.

comments
Keywords: Changepoint testing, nonstationarity, temporal dependence, self-normalisation
fields
Statistics Theory
pdf ↗ page arXiv:2610.39404 ↗

This paper studies robust uncertainty quantification for separable nonlinear least squares (SNLLS) problems. We propose two identification methods, (i) Residual-Perturbed Gradient (RPG) and (ii) Global-Fit-Gap (GFG), to construct joint distribution-free confidence regions for both the linear and nonlinear parameters. By exploiting assumed group invariance of the noise (such as symmetry or exchangeability), we apply random perturbations (such as sign-changes or permutations) to build the regions based on resampling and ranking. We prove that both methods guarantee non-asymptotically exact coverage (type I error). Finally, we illustrate the constructions through two numerical experiments: (i) identifying generalized finite impulse response (GFIR) systems using Laguerre polynomials with an adjustable decay rate and (ii) fitting Gaussian radial basis function (RBF) models with variable knots and widths.

comments
Accepted for publication at the 65th IEEE Conference on Decision and Control (CDC 2026)
fields
Statistics Theory
pdf ↗ page arXiv:2610.39549 ↗

We propose a variational Bayesian framework for variable selection with multiple responses across heterogeneous populations. The prior dependence among the inclusion indicators allows variable-selection information to be shared at different levels across populations and responses, while regression coefficients remain population- and response-specific. When the appropriate sharing structure is unknown, a data-driven rule adaptively determines the scope of information sharing from marginal association evidence. The resulting variational algorithm is computationally scalable and can be implemented using either individual-level or summary data. Under regularity conditions, we establish selection consistency and convergence properties of the variational parameters at fixed iterations of the algorithm for fixed dimension case. In high dimensions, we establish model-selection consistency and coefficient contraction in both $\ell_1$ and $\ell_2$ norms. Simulation studies show competitive variable selection performance and demonstrate the potential gains from joint analysis. We further illustrate the summary-data implementation using genome-wide association summary statistics from the 2021 Global Lipids Genetics Consortium study for four lipid traits across five populations.

comments
18 pages, 1 figure, 2 tables. Supplementary material (54 pages) is available as an ancillary PDF
fields
Statistics Theory
pdf ↗ page arXiv:2610.39677 ↗

In binary classification problems, plug-in classifiers can sometimes achieve faster excess risk rates than the underlying estimation rate. In this work, we study a supervised classification problem based on repeated independent observations of Ornstein-Uhlenbeck paths, with both time-homogeneous and time-inhomogeneous drifts. We show that, under a suitable separation condition on the class-dependent drifts, a plug-in classifier attains an excess risk of quadratic order in the corresponding parametric or nonparametric estimation error. The theoretical approach utilizes the Wiener chaos representation and spectral theory to characterize the log-likelihood ratio as a quadratic form of Gaussian random variables, enabling a precise analysis of margin behaviour and deviation results. This extends the fast-rate results from classification problems with linear discriminant models and Gaussian white noise models to dynamical diffusion systems with Gaussian structure.

comments
44 pages, 4 figures
fields
Statistics Theory
pdf ↗ page arXiv:2610.39726 ↗

The Sinkhorn divergence, the debiased entropic optimal transport cost, determines a metric tensor on probability measures defined along curves, due to Lavenant et al. We construct a real-analytic Hilbert manifold of measures, the smooth stratum, on which this tensor is a weak Riemannian metric, and we continue Eguchi's construction of a geometry from a divergence to the third order. The stratum consists of the measures with a positive Sobolev density on a closed Riemannian manifold, and the strata form a scale whose intersection is the Fréchet manifold of smooth positive densities of Ay. Following it, we characterize the metric through the gradients of mean values: its cotangent form is a spectral reweighting of the Dirichlet form of a Markov chain, so the metric is of the same kind as the Fisher-Rao and the Otto metric, and on the stratum it is bounded by a multiple of the Fisher-Rao metric (but not conversely). At third order, the Sinkhorn divergence is self-dual: both connection forms of Eguchi's construction coincide with the Levi-Civita form of the metric, and the cubic tensor vanishes, as a consequence of the transposition symmetry of the transport problem. On every stratum, the Levi-Civita form is represented, so the stratum has a real-analytic Levi-Civita connection, which on the Fréchet manifold is the connection of Ay and Schwachhöfer.

fields
Statistics Theory, Information Theory
pdf ↗ page arXiv:2610.39850 ↗

A graphical model represents multivariate interactions through conditional independence, but requires jointly observed samples to be fitted to data. When individuals cannot be tracked and only marginal observations are available, as with destructive measurements leading to cross-sectional data, the problem of graphical modeling is confounded with that of assembling a joint law. We show how simultaneous graphical modeling and joint law assembly can be realized via a multi-marginal optimal transport problem with graphical cost. Focusing on Gaussian marginals, we generate a joint law satisfying the Markov properties prescribed by a given graph. Within the class of joint distributions respecting the graph and marginals constraints, our construction selects a member by making the interactions set by the graph as strong as possible under a dependence budget measured by relative entropy. In the empirical setting, where only estimates of the marginals are available, we examine the stability of the problem under perturbations of both the marginals and of the graph weights. The resulting error splits into an estimation term, vanishing with the sample size, and a specification term, which quantifies the cost of a misspecified graph. Finally, we illustrate these findings by numerical experiments.

fields
Statistics Theory
pdf ↗ page arXiv:2610.40070 ↗

Decomposable graphical models are usually adopted for their computational convenience rather than derived from a data-generating mechanism. We show that a special class of them arises naturally from the irreversible accumulation of events along a branching history. Each event is attached to an edge of a latent rooted tree and is inherited by everything below that edge; an observation records which events have occurred at a randomly chosen node, not necessarily a leaf. When the tree is a path, this is the cumulative coding of an ordinal variable, whose indicators form a Markov chain; in the general tree case the Markov chain is replaced by a junction tree. The conditional independence graph of the event indicators is always decomposable and, in fact, is the line graph of the tree (maximal cliques correspond to nodes where two or more edges meet and separators are the single events on the edges joining two such nodes). The graph determines the tree up to the choice of root. A connected graph arises in this way if, and only if, it is chordal, any two of its maximal cliques share at most one vertex, no vertex is in three maximal cliques, and the graph is such that any two maximal cliques share at most one vertex. This provides a simple graphical test for compatibility with the mechanism (necessary but not sufficient, as irreversibility also constrains the distribution's support). The structure breaks down if we look at just the leaves, and measurement error destroys the exact screening and leads to a denser graph rather than simply a weaker dependence. We discuss inference, provide diagnostics for departures such as recurrent events, illustrate them on some simulated data and discuss their application in the context of mutation accumulation and lineage tracing where both ancestral and descendant types are sampled together.

comments
29 pages, one figure
fields
Statistics Theory
pdf ↗ page arXiv:2610.40127 ↗

In this paper, we propose a general regression-assisted estimator of the population mean based on local regression with associated kernels, a broad class that encompasses both classical (symmetric) kernels, such as the Gaussian and Epanechnikov kernels, and asymmetric kernels, such as the gamma kernel. We establish the asymptotic properties of the proposed estimator, including explicit expressions for the bias, mean squared error, and asymptotic normality, under a unified framework that applies to any kernel in this class. Through simulation studies on nonnegative data and one real-data application, we compare the finite-sample performance of the estimator based on the gamma kernel with those relying on the Gaussian and Epanechnikov kernels. When the data are supported on the positive real line, symmetric kernels suffer from boundary bias near zero due to mass assignment outside the support, whereas the gamma kernel, naturally adapted to $[0,\infty)$, alleviates this effect. The results confirm that the choice of kernel within the associated matters in practice, and that asymmetric kernels provide a reliable and efficient alternative when the underlying regression function is supported on the positive real line or exhibits marked asymmetry.

comments
30 pages, 1 figure
fields
Statistics Theory
pdf ↗ page arXiv:2610.40163 ↗

Synthetic data are widely used for training modern AI systems. However, their statistical understanding remains limited. It is well recognized in statistics that repeated self-training on synthetic data can amplify errors inherited from pre-trained models, leading to model collapse. Verification plays a crucial role in selecting high-quality synthetic data to help prevent model collapse and improve model performance. We study verified self-training in a linear regression framework, where a pre-trained estimator generates synthetic data with injected generation noise and a verifier selects samples according to a verification threshold. Post-training on the accepted samples updates either all coordinates (full fine-tuning) or only an active subset (partial fine-tuning). Our analysis reveals three potentially counterintuitive effects. We establish that tighter verification does not always lead to lower prediction risk. We also find that a suitable level of injected generation noise can reduce prediction risk, while excessive noise can increase it. Moreover, full and partial fine-tuning can respond differently to the same verification rule, since pre-training error in the frozen coordinates affects both sample selection and post-training risk. We analyze these effects by deriving finite sample risk bounds for four separate regimes determined by the relative scales of the verification threshold, generation noise, and pre-training error. The bounds precisely characterize how verification affects prediction risk across these regimes. In particular, we quantify how the generation noise, the effective accepted sample size, and the covariance of the accepted covariates affect prediction risk. The analysis extends to iterative verified full fine-tuning, where sufficiently tight verification reduces the initial error contribution at a geometric rate.

fields
Statistics Theory
pdf ↗ page arXiv:2610.40254 ↗

Although score-based generative models (SGMs) have achieved remarkable success in real-world sample generation tasks, it is still far from sufficient to understand them from a mathematical perspective. In this paper, we aim to provide enhanced convergence guarantees for two existing SGMs in $\mathcal{W}_2$-distance beyond log-concavity. More precisely, we develop a novel framework of {\color{black}discretization} error analysis for Euler-Maruyama (EM) and Poisson midpoint (PM) time discretization schemes for SGMs. Under a non-log-concavity condition, we show that $\tilde{\mathcal{O}}(\sqrt{d}/ε)$ iterations suffice to approximate the target distributions in $ε$-accuracy for the classical EM-based SGM, considerably improving upon the existing iteration complexity $\tilde{\mathcal{O}}(d/ε^2)$. Notably, the novel framework of error analysis also enables us to establish an $\tilde{\mathcal{O}}(\sqrt{d}/ε^{2/3})$ iteration complexity for the PM-based SGM in $ε$-accuracy, significantly outperforming current state-of-the-art Wasserstein convergence guarantees for SDE-based diffusion samplers.

fields
Statistics Theory
pdf ↗ page arXiv:2610.40308 ↗

We study high-dimensional nonparametric regression under multisource covariate shift, where $\mathrm J$ sources of training data share a common regression function but differ in their covariate distributions, sample sizes, and noise variances. Our goal is to combine these sources to estimate the regression function accurately under a target covariate distribution. We propose an oracle weighted neural estimator and establish its minimax optimality up to logarithmic factors through matching upper and lower bounds. The resulting rate is $\mathsf n_{\rm eff}^{-2p/(2p+K)}$, where $p$ and $K$ denote the effective smoothness and dimension of the regression function, and the effective sample size is \begin{align} \mathsf n_{\rm eff} =\sum_{j=1}^{\mathrm J} \frac{n_j}{(1+σ_{ρ,j})σ_{ε,j}^{2}}. \nonumber \end{align} Here, $n_j$ is the sample size of source $j$, $σ_{ε,j}^{2}$ is its noise variance, and $σ_{ρ,j}$ controls the deviation between the covariate distribution of source $j$ and the target covariate distribution. We also develop an adaptive procedure that requires no knowledge of source noise variances or covariate-shift parameters. Under suitable conditions, this procedure attains the oracle minimax rate up to logarithmic factors.

fields
Statistics Theory
pdf ↗ page arXiv:2610.40331 ↗

When two forecasts of a tail, such as prediction intervals at high coverage, extreme quantiles or expected shortfall (ES), are compared by a consistent score, the score difference is known in advance except on the days on which the outcome falls beyond a forecast. The number of these exceedances, not the number of observations, is the effective sample size. For intervals at miscoverage level $α$, the number of observations a comparison needs grows like $1/α$ while the number of exceedances it needs does not, and for some pairs of forecasts no test can do better. A confidence sequence that is valid at all times and needs no distributional assumption attains this rate; Hoeffding-type procedures, calibrated by the range of the score difference, need $1/α$ times more. When exceedances are scarce, the Diebold-Mariano test declares the less conservative forecaster better with at least, asymptotically, the probability of observing no exceedance, whichever forecaster is actually better; the usual small-sample corrections do not remove this, while a bootstrap-t version largely does. For (value-at-risk, ES) forecasts, a less conservative ES can be shown without assumptions to be worse on the days on which it is less conservative, but never to be better without an assumption on the loss tail. In 250-day windows of 97.5% forecasts for seven stock indices, 18.4% of significant Diebold-Mariano results favouring the less conservative model contradict the ranking on the remaining days, against 6.9% of those favouring the more conservative one.

comments
23 pages, 2 figures, 5 tables. Code and data: https://doi.org/10.5281/zenodo.23770670
fields
Statistics Theory
pdf ↗ page arXiv:2610.40366 ↗

We develop a theory for estimating the kernel parameters of Bergomi-type stochastic volatility models from option-price time series. The framework allows positive kernels that may be singular at the origin, including the pure power-law kernel of the rough Bergomi model. Using the option-price representation of cumulative forward variance, we formulate the statistical experiment as exact observations of this quantity on increasingly fine time-maturity grids over a fixed horizon. The model has an infinite-dimensional state driven by a single Brownian motion, resulting in a rank-one leading covariance across maturities. Our construction takes maturity differences and then logarithmic time increments. Approximating the resulting diffusion coefficients by maturity-averaged kernels removes the unobserved forward variance curve from the leading term. Positivity of the kernel allows the leading covariance to be recovered from the marginal variances, motivating a weighted marginal composite likelihood contrast. We prove consistency without relative rate restrictions between the time and maturity meshes, allowing the true parameter to lie on the boundary. Under additional regularity and nondegeneracy assumptions and explicit mesh rate conditions, we establish $\mathscr F_1$-stable asymptotic normality, where $\mathscr F_1$ is the terminal model $σ$-field. The Gaussian limit has deterministic sandwich covariance and is independent of $\mathscr F_1$, so the limit is preserved under equivalent changes of probability measure. We also provide sufficient mesh rate conditions for the pure power-law kernel.

fields
Statistics Theory
pdf ↗ page arXiv:2610.40425 ↗

Spectral clustering commonly assigns communities by clustering a low-dimensional representation, whereas likelihood refinement can improve an initial assignment using the observed edges. We ask whether sharp community-recovery accuracy can be retained when the refinement no longer accesses individual edges. We develop spectral likelihood-ratio clustering for stochastic block models using one regularized adjacency eigensystem and the original vertex degrees. The method estimates connection probabilities and updates each vertex's label by a likelihood-ratio classifier on reconstructed rows. The refinement accepts any sufficiently accurate initialization, including one computed from the same graph. Its expected misclassification proportion is bounded by a constant times the error of a raw-edge oracle classifier, plus the probability that initialization misses the required accuracy. Repeated k-means++ on the retained spectral coordinates supplies one complete procedure with a constant-factor oracle guarantee. The oracle knows the model parameters and the other labels. The guarantee holds for a fixed number of communities, comparable positive block probabilities and community sizes, and a nondegenerate normalized block matrix. It allows arbitrarily slowly diverging expected degrees under the stated upper sparsity condition. We explain the likelihood-ratio construction first, then the regularization and exact-degree correction required by the general result. The proof combines sharp local testing, truncated spectral-row estimates and leave-one-out comparisons.

fields
Statistics Theory
pdf ↗ page arXiv:2610.40531 ↗

We establish structural properties of the nonparametric maximum likelihood estimator (NPMLE) for $d$-dimensional Gaussian mixtures whose means lie in a hypercube. We show that, with high probability, the NPMLE based on $n$ independent observations self-regularizes by fitting a mixture model with $O((\frac{\log n}{\log\log n})^d)$ components, achieving the optimal model complexity without explicit model selection. Furthermore, the NPMLE exhibits a structural adaptation property: For data drawn from a finite mixture, the number of fitted components is bounded in probability as $n\to\infty$. Our proof applies a multivariate Jensen-type bound to control the typical number of critical points of the KKT function associated with the first-order optimality conditions. The key step is to lower bound its gradient norm uniformly on complex spheres. We establish this lower bound by decomposing the KKT function into an empirical fluctuation term and a relative density estimation error term, combining small-ball probability estimates for the former with polynomial approximation and Hellinger error bounds for the latter.

fields
Statistics Theory
pdf ↗ page arXiv:2610.40566 ↗

Network dependence is widely regarded as a fundamental obstacle to inference: outcomes linked through a graph are not independent, the graph is rarely observed in full, and models for how dependence propagates are easily misspecified. We show that for a broad class of responses generated through a random network, the obstacle is smaller than it appears. We study a heterogeneous spatial autoregression on a sparse graphon, in which each node's response is a weighted average of its neighbors' responses with a node-specific, nonparametric coefficient plus a node-specific input, and we prove that sample means and smooth functions of vector means are asymptotically Gaussian down to average degree nearly logarithmic in the population size, allowing unbounded graphons with hubs and heavy-tailed inputs. The limiting variance interpolates exactly between two regimes according to the sampling fraction. When the observed nodes are a vanishing fraction of the population, the variance is the marginal variance of the response, the ordinary sample variance is consistent, and the usual $t$-interval is valid with no knowledge of the network. The proof averages over the graph rather than conditioning on it, isolating the behavior of the response through an exact identity for resolvents of Markov kernels and controlling the network noise by an Efron-Stein inequality; neither step requires the walk-by-walk covariance bounds of fixed-network analyses. Consequences for regression with node-level and network-derived covariates are derived.

fields
Statistics Theory
pdf ↗ page arXiv:2610.40630 ↗

Classical Analysis and ODEs24

Consider a translation-bounded measure on the line. We can rotate the measure, distributing the mass proportionally to the area, to create a two-dimensional rotationally invariant translation-bounded measure. We show that the diffraction of the two-dimensional object is the normalised rotation of the diffraction of the original measure. We discuss some examples and generalisation beyond $d=2$.

comments
24 pages, 1 figure
fields
Classical Analysis and ODEs, Mathematical Physics, Functional Analysis
pdf ↗ page arXiv:2610.37992 ↗

We study how often $n$ distinct integer dilates of a periodic function can all lie above a fixed threshold or all lie below its negative. We consider continuous functions $f:\mathbb R\to[-1,1]$ that are $1$-periodic, even, strictly decreasing on $[0,1/2]$, and satisfy $f(0)=1$ and $f(t+1/2)=-f(t)$. This class includes the cosine and the triangle wave. For $0\leqα<1$, let $ρ_α\in(0,1/4]$ be determined by $f(ρ_α)=α$, and let $F_α(n)$ denote the infimum of these proportions over all sets of $n$ distinct positive integer frequencies. We prove that $F_α(n)\geq 4ρ_α^n$ and that the limit $\lim_{n\to\infty}F_α(n)^{1/n}$ exists for every threshold. When $ρ_α^{-1}$ is an integer, we obtain \begin{align} F_α(n) &\leq C_αn^{\log_2((1-ρ_α)/(1-2ρ_α))}ρ_α^n, \end{align} and hence the limit equals $ρ_α$. Otherwise, the limit belongs to the interval $[ρ_α,\lfloorρ_α^{-1}\rfloor^{-1}]$. The upper bound in the reciprocal case uses a cyclic covering construction previously studied in the context of circular graphs. We give a self-contained proof of the corresponding optimal modulus.

comments
16 pages, 1 table
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.38135 ↗

In this article we investigate spherical maximal operators $\mathfrak m^α$ of real order $α$ acting on radial functions in the hyperbolic space $\mathbb H^n$. We show that for every $n\geq 2$, $1<p\leq\infty$ and $α>(1-n)/2$, $\mathfrak m^α$ is bounded on $L^p_{\mathrm{rad}}(\mathbb H^n)$ if and only if \begin{align*} \begin{cases} α>1-n+\frac np, & 1<p\leq 2, α>\frac1p-\frac{n-1}2, & 2<p\leq\frac{2n}{n-1}, α\geq\frac{1-n}p, & p>\frac{2n}{n-1}. \end{cases} \end{align*} Moreover, we show that for $1<p\leq 2n/(n-1)$ and \begin{align*} α= \begin{cases} 1-n+\frac np, & 1<p\leq 2, \frac1p-\frac{n-1}2, & 2<p\leq\frac{2n}{n-1}, \end{cases} \end{align*} $\mathfrak m^α$ is bounded from $L^{p,1}_{\mathrm{rad}}(\mathbb H^n)$ to $L^{p,\infty}_{\mathrm{rad}}(\mathbb H^n)$.

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

We investigate higher-order $q$-difference equations obtained by successive applications of a $q$-analogue of addition and the $q$-middle convolution. We construct an $n$-dimensional system of linear $q$-difference equations and derive a single $q$-difference equation whose coefficients are polynomials of degree at most $1$ in the independent variable. Under certain conditions on the parameters, the resulting equation is a generalized $q$-hypergeometric equation of order $n$. We also obtain a multiple Jackson integral representation of solutions and give sufficient conditions for its convergence. By suitably choosing the functions appearing in the integrand and specializing the parameters, we obtain $q$-hypergeometric series solutions of type ${}_n φ_{n-1}$.

comments
57 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.38286 ↗

We classify the arithmetic nature of the Dirichlet eigenvalues of a homogeneous nonlocal one-dimensional $p$-Laplacian problem with power-type nonlinearity $|u|^{q-2}u$. For rational $p,q>1$, either all eigenvalues are algebraic or all are transcendental. Algebraicity holds exactly when the interval length is an algebraic multiple of a distinguished scale determined by a beta value. This scale is transcendental. When $p=q$, the criterion reduces to algebraicity of the interval length divided by $π$,independently of the rational exponent.

comments
6 pages
fields
Classical Analysis and ODEs, Number Theory
pdf ↗ page arXiv:2610.38471 ↗

The difference operator $J$ arising from the higher order occurrence for the $L$-orthogonal polynomials is studied using various families of matrix orthogonal polynomials. The matrix orthogonal polynomials determine the polar decomposition of $J$ and its adjoint $J^\ast$ considered as operators on $\ell^2(\mathbb{N})$. The special case of symmetric $J$ leads to the case where the matrix polynomials reduce to diagonal matrix polynomials. The example of the symmetric case with constant coefficients for $L=2$ is discussed in detail.

comments
30 pages
fields
Classical Analysis and ODEs, Spectral Theory
pdf ↗ page arXiv:2610.38603 ↗

The Fredholm determinant of the sine kernel has an expression as an integral containing a Painlevé transcendent $r$ satisfying Painlevé V, in the same way that the Fredholm determinant of the Airy kernel has an expression involving the Hastings-McLeod solution of Painlevé II. In this paper we use Padé approximation to approximate the poles of this Painlevé transcendent $r$ in the complex plane. We use Padé approximation near $0$, Hermite-Padé approximation near $0$ and two-point Padé approximation near $0$ and infinity.

comments
20 pages, 10 figures
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.38625 ↗

We establish sparse domination for the $q$-variation of functional calculus families $\{\varphi(tL)\}_{t>0}$ on spaces of homogeneous type. Under generalized Gaussian estimates, we consider holomorphic multipliers of injective accretive operators, and Sobolev-type spectral multipliers of non-negative self-adjoint operators. For the Sobolev-type multipliers, we show that our regularity assumption is sharp in general except the endpoint. As corollaries, we obtain weighted $q$-variational estimates for Bochner-Riesz means and regularized Schrödinger groups. Finally, we give several examples of operators to which our results apply.

comments
42 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.38711 ↗

In this note we first consider the Heisenberg uncertainty principle. We show that it acts as a {\bf forcing mechanism} in the following sense. Real functions that approach its limit are close to Gaussian distributions, with proximity both in the sense of total variation distance and Wasserstein-1 distance. We next consider the uncertainty principle for functions defined on finite Abelian groups, and show that it acts as a forcing mechanism in the following sense. Functions that approach its limit are close (after translation and modulation by a complex exponential) to indicator functions of some subgroup, with proximity measured in ${\mathbb {L}}^1$-norm.

fields
Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2610.38909 ↗

Recently two new integrated recurrences were given for the Kummer function which together with the six recurrences already given in standard literature gave a total of eight recurrences, each one linking the baseline function to one of it's eight contiguous functions. Two new recurrences for the Tricomi function are given here which complete the set of eight recurrences for the Tricomi function linking it to it's contiguous functions. The involution presented previously is examined in detail for the recurrences of Cylinder, Associated Legendre and Kummer/Tricomi functions. This involution converts any given recurrence to a recurrence with the parameter shifts reversed, which creates conjugate pairs. One pair for Cylinder functions, two pairs for Associated Legendre functions and 4 pairs each for Kummer and Tricomi functions. Uniqueness is proven using Wronskians for the integrated recurrence relations, such that contiguous functions are single occupancy slots with only one integrated recurrence possible for each slot and for each independent solution of the ODE. For Cylinder and Associated Legendre functions this is simple, as the recurrences are identical for each independent solution. However, for Kummer and Tricomi functions the recurrences are different. This difficulty is bypassed using Gamma functions to scale the Tricomi recurrences to match the Kummer recurrences for each conjugate pair. It is not possible to match globally. This allows uniqueness to be proven using Wronskians on a pair by pair basis. Hence the involution system behaves like a Pauli Exclusion principle for contiguous functions, with only one recurrence possible for each solution of the ODE.

comments
Submitted to Journal of Integral Transforms and Special Functions, 2026
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.39023 ↗

Let $(φ_i)_{i=1}^n$ be an orthonormal system on a probability space with $\|φ_i\|_\infty\leq L$. We prove that, for every $2\leq k<n$, there is a set $I$ of at least $n-k$ indices such that $$ \|f\|_2\leq CM_k\sqrt{\log(e+M_k)}\|f\|_1 $$ for every $f$ in the span of $(φ_i)_{i\in I}$, where $M_k=L\sqrt{\frac{n}{k}\log(2k)}$. This replaces the logarithmic exponent $\frac{5}{2}$ in the corresponding theorem of Guédon, Mendelson, Pajor, and Tomczak-Jaegermann by $\frac{1}{2}$. We also obtain a partition into two sets of cardinality $\frac{n}{2}+O(\sqrt n)$ for which both spans satisfy the resulting norm comparison, and for uniformly bounded systems the proportional estimate is $C\sqrt{\log n\log\log n}$ for sufficiently large $n$. This is the third paper in a series systematically using gradient descent as a proof mechanism in harmonic analysis, following the $Λ(p)$ and Bernoulli restricted isometry papers of Burstein, Iosevich, and Krause, and the descent here is entropic mirror descent. We represent each function in an $L_1$ ball by a probability measure of controlled relative entropy, and this entropy pays for the corrections to the predictions of its coefficients. Processing the thresholds from large to small, we obtain a single weighted bound for all the corrections, which we turn into a finite description of approximate coefficient squares and then into a conditional Rademacher estimate, and symmetrization completes the argument directly on the $L_1$ ball. We also record consequences for concentration and for recovery from coefficient measurements.

fields
Classical Analysis and ODEs, Probability
pdf ↗ page arXiv:2610.39025 ↗

We establish sparse bounds for the trilinear Hilbert transform $$ T(f_1,f_2,f_3)(x):=\textrm{p.v.}\int_{\mathbb R} f_1(x-t)f_2(x-2t)f_3(x-3t)\,\frac{dt}{t}, $$ with averaging exponents arbitrarily close to $2$ from above. As a consequence, we extend OpenAI's $L^3\times L^3\times L^3\to L^1$ bound (entry 086 in the OpenAI Research Catalog) to $L^{p_1}\times L^{p_2}\times L^{p_3}\to L^r$ throughout the range $$ 2<p_1,p_2,p_3<\infty, \qquad \frac1r=\frac1{p_1}+\frac1{p_2}+\frac1{p_3}, \qquad \frac23<r<2, $$ and obtain corresponding weighted estimates for weights in multilinear Muckenhoupt classes. Our proof relies on the normalized local estimate and stopping time argument developed in OpenAI's work.

comments
17 pages. Comments Welcome!
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.39096 ↗

In this paper, we demonstrate that complex bandlimited signals can be uniquely recovered (up to a global phase factor) from two families of wavelet transform magnitudes, sampled at twice the Nyquist rate in two frequency bins. These families come from translations of the fixed dilated Morlet wavelet and a fixed companion wavelet. The companion wavelet admits an augmented Morlet–Gaussian representation. We rewrite the two families as two modulated Gaussian convolution measurements of an auxiliary bandlimited signal. Using a Gaussian convolution uniqueness result, we prove that samples on \((4B)^{-1}\mathbb{Z}\) determine every signal in \(PW_B^2\) (up to a global phase factor). Compared with earlier wavelet phase retrieval results, our approach requires significantly fewer sampling points.

fields
Classical Analysis and ODEs, Information Theory
pdf ↗ page arXiv:2610.39145 ↗

We determine the optimal constant in the $L^p$-derivative inequality for the uncentered Hardy–Littlewood maximal operator on the real line for every $1<p<\infty$. It is the unique number $γ_p\in [0,1]$ satisfying $(2p-1)γ_p+(p-1)γ_p^{(2p-1)/(p-1)}=p$. As $p$ goes from $1$ to $+\infty$, $γ_p$ decreases from $1$ to $\sqrt2-1$, and at the endpoints the limiting arguments recover the classical total-variation and Lipschitz inequalities, with the qualitative regularity ingredient at the $BV$ endpoint supplied by Aldaz and Pérez Lázaro.

comments
20 pages, 4 figures
fields
Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2610.39178 ↗

In this article, we study a weighted analogue of the totally geodesic $k$-plane transform on the real hyperbolic space. Throughout the article, we are concerned with the mapping properties of this transform. Particularly, we first consider the existence of the operator on weighted Lebesgue spaces, where the weights under consideration are natural to the geometry of the hyperbolic space. Then, we proceed to see the $L^p$-improving mapping properties of the said transform on radial functions. Further, we also prove end-point boundedness results on Lorentz spaces of radial functions. Lastly, we look into the problem of weighted $L^p$-$L^p$ boundedness, and obtain partial results in this direction. In the way of obtaining these results, we also give a spherical integral representation of the weighted totally geodesic $k$-plane transform.

comments
47 pages, 2 figure
fields
Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2610.39502 ↗

A method of solution for the inverse scattering problem for the linear fifth order Schr${\rm\ddot{o}}$dinger operator is found. Two closed systems of linear singular integral equations are obtained. From solutions to these equations, potential on the left and right half-axes is restored unambiguously.

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

Let $n,k\ge 2$ and $N_{n,k} = \binom{n+k}{k}-1$. We prove that if $f \in L^{p}(\mathbb{R}^{N_{n,k}})$ and $\hat{f}$ is supported on the $n$-dimensional Parsell-Vinogradov manifold, then $f \equiv 0$ whenever $1\le p < p_{c}(n,k) = n+ \binom{n+k}{n+1}$. This improves the bound by Agranovsky and Narayanan, and generalizes the moment-curve result of Guo-Iosevich-Zhang-Zorin-Kranich. The exponent $p_{c}(n,k)$ is sharp when $n=2$ or $k=2$, since it matches the convergence exponent $p_{n,k}^{\mathrm{Tar}}$ of Tarry's problem. Our result also yields a general lower bound $p_{n,k}^{\mathrm{Tar}} \ge p_{c}(n,k)$, improving Ikromov's bound by $n-1$. The proof combines the rotation symmetry of Parsell-Vinogradov manifold with the essential orthogonality of rotated covering boxes.

comments
12 pages, 3 figures
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.39739 ↗

For a scalar equation $y^{(n)}=\varphi(x,y,\dots,y^{(n-1)})$ the $S$-function of the extended Prelle–Singer method is a vector $S=(S_0,\dots,S_{n-2})$, the null-form vector of Chandrasekar, Senthilvelan, Lakshmanan and collaborators, and the jet gradient of a first integral solves the adjoint of the variational equation. We describe the solutions of the system satisfied by $S$ intrinsically, and determine which of them come from first integrals. Over the field $C$ of first integrals the solutions are exactly the hyperplanes of the $n$-dimensional space $VV$ of symmetry characteristics, recovered from $n-1$ independent characteristics by a Plücker formula; in flow-box coordinates they are the hyperplane fields on the local space of leaves. A solution is the $S$-vector of a first integral if and only if the corresponding hyperplane field is integrable. This Frobenius condition splits into the $S$-system itself plus $\binom n3$ further differential conditions, so it is vacuous for $n=2$ and a genuine restriction for every $n\ge3$, for which we give an explicit non-realisable solution. The same picture explains why $λ$-symmetries and $S$-functions coincide only when $n=2$: line fields and hyperplane fields agree only on surfaces. For the computation of $S$ we record that the system is equivalent to one scalar equation for the last component, which is the Riccati form of the adjoint variational equation, and we spell out what this does and does not imply for a rational search.

fields
Classical Analysis and ODEs, Mathematical Physics
pdf ↗ page arXiv:2610.40033 ↗

In contrast to Christ's theorem that the lacunary spherical maximal operator is bounded from $H^1(\mathbb R^d)$ to $L^{1,\infty}(\mathbb R^d)$ ($d\geq2$), we show that the lacunary bilinear spherical maximal operator $$ \mathcal B_{\mathrm{lac}}(f,g)(x) =\sup_{\ell\in\mathbb Z} \Bigl|\int_{\mathbb S^{2d-1}}f(x-2^\ell y)\,g(x-2^\ell z)\,dσ(y,z)\Bigr| $$ is not bounded from $H^1(\mathbb R^d)\times H^1(\mathbb R^d)$ to $L^{1/2,\infty}(\mathbb R^d)$ for any $d\geq1$. In particular, it is not bounded from $L^1(\mathbb R^d)\times L^1(\mathbb R^d)$ to $L^{1/2,\infty}(\mathbb R^d)$. More precisely, for every sufficiently large integer $N$, we construct two finite linear combinations of smooth, compactly supported, mean-zero $H^1(\mathbb R^d)$-atoms for which the ratio of the weak $L^{1/2}$ quasinorm to the product of the two Hardy norms is at least $c_d\log(N+1)$. This lower bound holds already for the supremum over a suitable set of $N$ dyadic radii. For $d=1$ this answers the case $p=q=1$ of a question in Borges's survey. For every $k\ge3$ and $d\ge1$, a modification of the construction proves that the lacunary $k$-linear spherical maximal operator does not map $(H^1(\mathbb R^d))^k$ into $L^{1/k,\infty}(\mathbb R^d)$. We also indicate extensions to certain hypersurfaces and to horizontal spherical averages on the Heisenberg group.

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

Consider a planar Hamiltonian differential equation with a nondegenerate center at the origin. The Tangential Center Problem asks for a characterization of polynomial perturbations for which the center persists at first order. This problem plays a fundamental role in the study of the center-focus problem. We propose an effective algorithmic approach to the Tangential Center Problem for planar polynomial Hamiltonian differential equations. Using this approach, we obtain a complete solution of the quadratic Tangential Center Problem. We further apply it to a non-generic family of cubic Hamiltonian differential equations containing the planar Hamiltonian Lotka–Volterra equation. For a general cubic polynomial perturbation, we derive necessary and sufficient conditions for the vanishing of the corresponding first Poincaré–Pontryagin–Melnikov function and characterize all tangential centers.

comments
23 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.40311 ↗

We prove that every set $S = \bigcup_{n \geq 0} [ t_{2 n + 1} , t_{2 n} )$, where $t_0 > t_1 > \cdots > 0$ and $t_n \to 0$, admits no Riesz spectrum. This extends the result of Kozma, Nitzan, and Olevskii \cite{KNO} to a wide class of countable unions of intervals.

comments
12 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.40400 ↗

Motivated by Zygmund's differentiation conjecture and Stein's conjecture for Lipschitz vector fields, we study bilinear singular integral and maximal operators along variable curves given by $$ \begin{aligned} BH_a^α(f,g)(x) &= \operatorname{p.v.}\int_{\mathbb R} f(x-t) g\left(x + a(x)t^α\right)\,\frac{dt}{t},\\ BM_a^α(f,g)(x) &= \sup_{r>0}\frac{1}{2r}\int_{-r}^{r} \left|f(x-t)g\left(x+a(x)t^α\right)\right|\,dt,\\ BSH_c^α(f,g)(x) &= \operatorname{p.v.} \int_{\mathbb R} f(x-t) g(x + t^α)\, \frac{dt}{t-c(x)}, \end{aligned} $$ where $α> 0$ and $a,c:\mathbb R\to\mathbb R$ are measurable. For every $α>0$ and $0<A<B<\infty$, we construct a smooth, globally Lipschitz coefficient $a:\mathbb R\to(A,B)$ such that, for every Hölder conjugate pair $1<p,q<\infty$, no strong–type $L^p(\mathbb R)\times L^q(\mathbb R)\to L^1(\mathbb R)$ estimate holds for $BH_a^α$ or $BM_a^α$ on $C_c^\infty(\mathbb R)\times C_c^\infty(\mathbb R)$; moreover, there exist nonnegative smooth inputs in $\bigcap_{s>1}L^s(\mathbb R)$, one of which is compactly supported, whose outputs under $BH_a^α$ and $BM_a^α$ do not belong to $L^1(\mathbb R)$. For any measurable $a:\mathbb R\to\mathbb R$, $BM_a^α$ maps $L^p(\mathbb R) \times L^q(\mathbb R)$ boundedly into $L^r(\mathbb R)$ whenever $1<p,q\leq\infty$, $1/r = 1/p + 1/q$, and $r > 1$, and maps $L^p(\mathbb R) \times L^q(\mathbb R)$ into weak $L^1(\mathbb R)$ when $1/p+1/q=1$, with constants independent of $a$. Finally, we investigate the shifted operator $BSH_c^α$, including dyadic-integer-valued $c$, and prove that there is a measurable choice of $c$ such that the operator admits no bounded $L^p(\mathbb R) \times L^q(\mathbb R) \to L^{r,\infty}(\mathbb R)$ estimates in the range $1 \leq p,q \leq \infty$ and $\frac{1}{2}<r<\infty$, resolving an open problem posed by Gaitan and Lie.

comments
22 pages
fields
Classical Analysis and ODEs, Dynamical Systems
pdf ↗ page arXiv:2610.40472 ↗

For every nonconstant real polynomial P of degree k and every positive rational exponent a/b, minimizing the spherical energy with potential |P(t)|^{a/b} admits a discrete solution with at most $\binom{d+2ak-1}{2ak}+\binom{d+2ak-2}{2ak-1}$ support points, where a/b is reduced. This finite-replacement consequence needs no denominator threshold. Under a multiplicity-sensitive denominator condition, we prove the stronger conclusion that every minimizer has an explicit uniform support bound; suitable negative positive-semidefinite perturbations preserve that bound. We present these consequences before the machinery. The main arguments simplify irrational-power finite-rank rigidity and give a Nash-curve ramification obstruction, stable under entire scalar additions, for powers, logarithms, and rational poles. The latter yields uniform finite supports on compact semialgebraic curves without assuming that the supports are semialgebraic. The known p-frame finite-replacement principle is distinguished from the extensions developed here. No unconditional discreteness theorem for general irrational p is claimed.

comments
22 pages, 0 figures
fields
Classical Analysis and ODEs, Algebraic Geometry, Functional Analysis
pdf ↗ page arXiv:2610.40475 ↗

Recently, Krukowski characterised the classical Fourier transform on the real line in terms of its behaviour with respect to differentiation. For locally compact abelian groups, he obtained a characterisation based on the behaviour of the Fourier transform under the shift. Each of these results assumed that the operator (to be characterised) is an integral transform (with a kernel satisfying suitable regularity conditions), paired with a normalisation which he refers to as the Dirac delta property. In this paper, we obtain analogous results for the group Fourier transform on the Heisenberg group. Here, the differentiation property is formulated in terms of the behaviour of the group Fourier transform with respect to the left-invariant vector fields, and the shift property is based on its behaviour under right translation. Both of these characterise the group Fourier transform on the Heisenberg group, once paired with a Dirac delta property. Our results assume that the transform is continuous and linear, and do not require it to be an integral transform a priori.

comments
20 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.40508 ↗

Dynamical Systems23

An odd polynomial oscillator has a periodic orbit given by a quadrature. When the zeros of the energy polynomial are all simple or all of even multiplicity, that quadrature is elementary exactly when the polynomial is a perfect square, and the time is a sum of inverse tangents. Recovering the displacement inverts that relation, algebraic when their coefficients are commensurate, making a closed form a Galois question. This paper identifies the group as the monodromy group of a rational map, computes its branch data from the parameters, and shows the branch value at the phase-angle singularity never vanishes, so every decomposition pairs the amplitudes reciprocally. In the commensurate family with distinct real factors, the orbit is radical exactly when the primitive inversion degree is at most four, or when reciprocal pairs leave a reduced spring of that degree. Radical orbits occur at the fifth, ninth, thirteenth and seventeenth force orders, the last only for reciprocal members, an expression recorded for each. The multiplicity hypothesis cannot be dropped. Factoring the energy polynomial into square and squarefree parts turns the quadrature into a differential of the third kind on a hyperelliptic curve, where elementarity is a torsion condition on the divisor of its poles with a vanishing holomorphic remainder. The first nonsquare elementary member appears at the ninth force order, and the power pullback inverts in closed form at every such order, giving a radical orbit for a confining spring of arbitrarily high degree with a sufficient condition for positive coefficients.

comments
36 pages, 5 figures
fields
Dynamical Systems, Mathematical Physics
pdf ↗ page arXiv:2610.37730 ↗

Periodic attractors of spatially extended systems possess not one period but a hierarchy of periods, one for each level of observation and symmetry quotient, and this hierarchy separates how a pattern evolves from how it fits the finite domain. For a synchronous threshold model of cyclic dominance on an $L\times L$ torus, equivalent to the three-color cyclic cellular automaton of Fisch, Gravner and Griffeath, we measure for every attractor a \emph{tuple} of periods: that of the populations ($\Tpop$), of the full configuration ($\Tst$), and of the configuration up to color rotations ($\Tcol$), lattice symmetries ($\Tgeo$) and the full space–color group ($\TG$). Equivariance implies exact divisibility relations and the factorization $\Tst=\TG\,m$, where $m$ counts the applications of the symmetry $h$ that maps the configuration onto itself after $\TG$ steps: $\TG$ and the type of $h$ belong to the pattern, $m$ to the lattice, and the attractors are relative periodic orbits whose full period emerges from the interaction between the intrinsic dynamics and the lattice symmetries. A family of attractors built around a pair of counter-rotating spirals, with $\Tpop=24$ and $\TG=8$, persists from $L=9$ to $L=40$ while $\Tst$ takes values from 24 to 960, given in every case by the order of $h$; on a rectangular $9\times12$ torus it takes the value 48, absent from all square tori. With more than $4.5\times10^5$ runs at each of $L=8$ and $L=9$ we estimate the basins of attraction: fixed points take 95–97\% of the configuration space, and no single period is enough to tell the oscillating attractors apart. The same analysis locates local diversity: it is balanced whenever the cycle has a color symmetry and, on large lattices, it is concentrated at the spiral cores.

comments
27 pages, 20 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2610.37990 ↗

We investigate the strong stable sets of the geodesic flow on hyperbolic surfaces and their relation to the injectivity radius. We prove that the strong stable set of a vector does not coincide with its stable horocycle if and only if the injectivity radius along the associated geodesic ray is not bounded away from zero and the ray does not diverge through a cusp. In that case, the strong stable set is an uncountable union of stable horocycles. In previous works, we considered the particular cases where the ray meets arbitrarily short closed geodesics or closed horocycles. Here we complete the study by treating the third possible case, where the ray meets closed hypercycles of arbitrarily small length.

comments
16 pages, 3 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2610.38099 ↗

Hofbauer, Kon and Saito (J. Math. Biol. 2008) showed that a Lotka-Volterra interaction matrix $A$ with negative diagonal can be qualitatively permanent only if (C1) every cycle of length $\ge 2$ of $A$ is nonpositive and (C2) every negative cycle contains exactly one negative entry. They conjectured that these conditions are also sufficient, and proved this for $n\le 3$. We give a $5\times 5$ integer matrix with seven nonzero off-diagonal entries that satisfies (C1) and (C2) but is not qualitatively permanent. For an explicit integer growth vector the system has an interior equilibrium, and an asymptotically stable heteroclinic cycle on the boundary of the orthant attracts an open set of interior orbits. Adding non-interacting species gives counterexamples for every $n\ge 5$. The interactions form a one-way feedback loop (two one-sided benefits and one one-sided harm) together with a predator of two prey. The verification is elementary except for one heteroclinic connection, which lies in a face that is not Volterra-Lyapunov stable. For it we prove a connection lemma based on invasion graphs.

comments
11 pages, 1 figure. Ancillary file: exact-arithmetic verification script (Julia)
fields
Dynamical Systems
pdf ↗ page arXiv:2610.38374 ↗

Several chemical and biological systems produce spontaneous spirals in their dynamical behavior, such as the Belousov-Zhabotinsky reaction in chemistry and the slime mold Dictyostelium in biology. In a previous study, such spiral wave formation was accurately replicated with a computational spatial system known as the Ideal Storage Cellular Automaton Model (ISCAM). Here, a more detailed investigation is presented of the ability of this model to generate spontaneous spirals depending on its parameter values. A dynamical systems analysis is performed, and bifurcation diagrams, phase space diagrams, and snapshots of the model's spatial dynamics are presented for a range of parameter values. This analysis reveals that spiral waves can only be sustained in the system when the parameter values of the model fall well within the regime of a so-called Neimark-Sacker bifurcation.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.38710 ↗

Early-warning methods can indicate that a system is approaching a loss of stability, but they do not usually reveal whether the approaching bifurcation is supercritical or subcritical. We investigate whether this distinction can be made from noisy pre-transition observations. For this investigation, we extend a regression-based stability method by including the leading cubic nonlinear term, whose sign is used to predict the bifurcation type. We test the method on a stochastic pitchfork model and a spatial stochastic Swift-Hohenberg equation. In both models, classification improves with longer observation horizons, closer proximity to the bifurcation, stronger noise, and larger nonlinear effects. However, these conditions are also linked to a higher risk of noise-induced tipping in the subcritical case. The useful early-warning window is therefore determined by a balance between obtaining enough information to identify the bifurcation type and doing so before noise-induced tipping becomes too likely. In spatially extended systems, we find that observing the full spatial field allows classification over shorter observation horizons, and performance improves when a broader range of spatial modes contributes to the observed dynamics. Altogether, we identify the conditions under which the method can reliably distinguish between supercritical and subcritical bifurcations.

comments
43 pages, 39 figures, 2 tables. Code available at https://github.com/Paul-A-Sanders/Criticality_classification
fields
Dynamical Systems
pdf ↗ page arXiv:2610.38866 ↗

Restricting the linear dynamics of a graph to selected vertices generally introduces memory, because interactions can pass through hidden vertices before returning. The resulting rational memory kernels give isospectral reduction a dynamical interpretation and identify latent graph symmetries with symmetries of the observed evolution.

comments
8 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.38995 ↗

Tipping points refer to abrupt, substantial, and often irreversible transitions in dynamic systems that can be triggered by minor perturbations. Existing tipping mechanisms are usually classified by the nature of the trigger: bifurcation-induced tipping occurs when a parameter crosses a critical threshold, noise-induced tipping is caused by random perturbations, rate-induced tipping occurs when a system fails to track a moving attractor, and phase-induced tipping is triggered by timed perturbations relative to an oscillatory state. In this paper, we identify a new mechanism for tipping: frequency-induced tipping, in which periodic forcing drives a transition through resonant amplification. This occurs by destabilization of an equilibrium via subthreshold perturbations of the appropriate frequency. Filippov analysis of a piecewise-smooth model identifies admissible crossings that lead either to predator loss or to extinction of predator and prey, and numerical simulations show that tipping persists after smoothing of the thresholds. These results extend the current tipping framework to include critical transitions under recurrent environmental forcing.

comments
27 pages, 9 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2610.39113 ↗

Delayed feedback is a fundamental mechanism in many systems and is often modeled by delay differential equations (DDEs). While delays are frequently assumed to be constant, in realistic feedback processes they may depend on the state and even be defined implicitly or in a nested fashion by the feedback relation itself. In this work, we address the question of how such implicit and nested state-dependent delays affect the observed behavior of a class of externally forced systems with negative switched feedback. Our motivating example and principal case study is the piecewise-smooth limiting form of a conceptual DDE model for the El Niño-Southern Oscillation (ENSO) with a negative feedback term subject to implicit state-dependent delay. We prove, for a wider prototypical class of DDEs with switched negative feedback and more general forcing, that (subject to an explicit condition on the parameters) any finite level of nested state-dependent delay and the limiting implicit delay are dynamically invisible: they all generate exactly the same trajectory, namely, that of the corresponding constant-delay DDE. We also discuss how the delayed argument functions organize the temporal order of reactions (TOR) in this regime, and show that a more stringent condition is required to ensure TOR for nested state-dependent delays.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.39281 ↗

For a continuous self-map f of a real interval L, let ent(f) denote the supremum of the topological entropies of the restrictions of f to its compact invariant sets; for a compact interval this is the usual topological entropy. For a class P of maps, the entropy spectrum of P is the set of values ent(f) taken by the maps f in P. We determine the entropy spectra of the three standard classes of chaotic maps of the compact interval [0,1]. Devaney chaotic maps have spectrum [(1/2) log 2, infinity], maps of positive entropy have spectrum (0, infinity], and Li-Yorke chaotic maps have spectrum [0, infinity]; thus every entropy compatible with the known lower bounds actually occurs, and the three spectra are strictly nested. Mixing maps have spectrum ((1/2) log 2, infinity], and Devaney chaotic maps with at least two fixed points have spectrum [log 2, infinity]. As a consequence, a Devaney chaotic map of the interval attains the minimal entropy (1/2) log 2 only if it has a unique fixed point and is not mixing. For an arbitrary interval, compact or not, maps with a point of least period n have spectrum [log sigma_n, infinity], where sigma_n are the Stefan constants, and Li-Yorke chaotic maps have spectrum [0, infinity]. The proofs combine a truncation theorem for maps of non-compact intervals, showing that clipping a map to a compact subinterval never creates entropy; a horseshoe argument showing that two fixed points force entropy log 2 on transitive maps; and explicit constructions, including an exact piecewise linear family, a mixing map of infinite entropy, and a square-root construction that halves the entropy of a transitive map.

comments
12 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.39443 ↗

Determining the maximum number of crossing limit cycles in planar discontinuous piecewise linear systems separated by a straight line is a central problem in nonsmooth dynamical systems and a natural piecewise-linear counterpart of Hilbert's sixteenth problem, yet its sharp uniform upper bound has long remained an open problem. In this paper, we prove that any such system admits at most three crossing limit cycles. Combined with known examples realizing three crossing limit cycles, this result establishes that three is the sharp uniform upper bound.

comments
23 pages, 4 figures
fields
Dynamical Systems, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.39490 ↗

For a time-homogeneous Markov process, the fixed-lag solution operator \( (T_τf)(x)=\mathbb E[f(X_{t+τ})\mid X_t=x] \) of the Kolmogorov backward equation evolves observables linearly and deterministically, even when the dynamics are stochastic. We approximate this operator using a two-stage method where we first approximate this operator directly from data, without knowledge of the governing equation (e.g., Fourier Neural Operator), and then compress the Galerkin projection onto a finite-dimensional observable space that is fixed in advance or selected variationally. The error analysis traces the learning error of the estimator, the sampling error of the Galerkin inner products, and the invariance and reconstruction properties of the observable space to the computed spectra and forecasts. The sampling error enters only through a multiplicative factor. Near an isolated spectral cluster, the invariance defect of a subspace controls its distance from the target invariant subspace. The forecast error is controlled by the one-step error of the reduced model and the projection error of the observable; when the measure is invariant and the reduced model preserves constants and is stable on mean-zero observables, the bound is uniform in the horizon. For deterministic dynamics, a learning rate for Fourier neural operators (FNOs) gives one explicit bound for the learning error. Numerical experiments illustrate spectral approximation and forecasting, including long-rollout stability and a comparison with extended dynamic mode decomposition (EDMD) when fewer transition pairs than basis functions are observed.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.39580 ↗

The Nikolaevskiy equation is a model of short-wave pattern formation coupled to a neutral long-wave mode, and it is believed that all of its spatially periodic steady states are unstable. Existing results are formal, numerical, or restricted to a small neighbourhood of onset. We give computer-assisted proofs of three results. First, for every wavenumber q in [0.9, 1.1] and every control parameter r between the onset value (1-q^2)^2 and 4, the equation has a nontrivial, real-analytic, odd steady roll; these rolls form a single continuous two-parameter family that bifurcates from the trivial state at onset, with an explicit amplitude bound proportional to the square root of the distance to onset. Second, every roll of this family with r in [0.25, 4] is spectrally unstable on the real line: its linearisation has a Bloch eigenvalue with real part at least 6.7e-4, and at least 0.13 for r >= 0.575. Third, at nine sample points we enclose, at a small Bloch number, the eigenvalue numerically identified with the long-wave (Matthews-Cox) branch; its real part is positive at seven points and negative at two, while strongly unstable eigenvalues exist at all nine. The proofs combine a parametrised Newton-Kantorovich theorem, a desingularisation near onset, Taylor-model bounds on parameter boxes, and a Weyl-sequence argument for the Bloch spectrum; all estimates are evaluated in rigorous interval arithmetic.

comments
16 pages, 5 figures. Submitted to SIAM J. Appl. Dyn. Syst. (2026)
fields
Dynamical Systems, Analysis of PDEs
pdf ↗ page arXiv:2610.39611 ↗

We study metric and topological slow entropy for translations on a class of finite-volume $S$-arithmetic homogeneous spaces with a real and $p$-adic factor. We consider translations whose real component is quasi-unipotent and whose $p$-adic component lies in a compact open subgroup. At polynomial scales, we show that the metric and topological slow entropies coincide and are determined by the chain structure of the real adjoint action. In particular, the non-Archimedean component contributes no additional polynomial slow entropy. Our result extends the slow entropy formula of Kanigowski, Vinhage, and Wei for quasi-unipotent flows on real homogeneous spaces to this $S$-arithmetic setting.

comments
13 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.39722 ↗

We study the periodic problem in the Calculus of Variations and give a complete characterization of the positive definiteness of the second variation, extending the Reid Roundabout Theorem to periodic boundary conditions. Two formulations are established: one in terms of conjugate and semi-coupled points, and one in terms of the existence of a symmetric solution of the associated Riccati equation satisfying a boundary inequality. We show by an explicit example that the latter condition, while sufficient, is not necessary except in dimension one. As applications, we obtain sufficient conditions for weak and strong local minimizers of periodic solutions of the Euler-Lagrange equation.

fields
Dynamical Systems, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.39811 ↗

The space of tilings by rectangles form an interesting collection of multidimensional subshifts. Here, we study cocycles on such tiling spaces and provide an algorithmically decidable necessary and sufficient condition for the tiling space associated with a collection of rectangles to admit a nontrivial cocycle. Along the way, we also prove that the tiling spaces corresponding to a class of rectangular tile sets satisfy certain mixing properties.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.39907 ↗

Given a dynamical system $(X,T)$ and an ergodic invariant measure $μ$, a $μ$-typical point $x\in X$ under $T$ visits arbitrarily small neighbourhood of $x$. We will use techniques based on extreme value theory and Laplace functional for point process to show that, for interval maps with suitable mixing and anti-clustering conditions, the limiting distributions of the record times and values of the return process $Y_j(x)=-\log d(T^jx,x)$, after possible normalisation, has Poisson-type laws.

fields
Dynamical Systems, Probability
pdf ↗ page arXiv:2610.39928 ↗

We construct, for each deterministic Turing machine that halts on all inputs, one polynomial vector field with rational coefficients that performs the same logical computation at unit Euler step, at every smaller or variable step in $(0,1]$ with divergent sum, and along the flow. This unifies discrete-time and continuous-time computation by polynomial dynamics, which earlier characterizations treated separately. For a machine making $T$ transitions in space $H$, a logical scale $h=2^{-s}$ with $s=O(H)$ suffices, with physical time $O(s(T+s))$, drift disturbances up to $h^{2K}$ for a fixed exponent $K$, and $2Ks+3$ fractional bits at unit step. On a fixed compact domain, polynomial time and robust eventual decision characterize P and PSPACE, respectively, with polynomial scale thresholds and no supplied stabilization horizon in the space case. Without sign, floor or conditional primitives, margin amplification at bounded speed, overlapping polynomial gates and interval-product estimates give the common realization, from which we derive shared logical traces, fixed-field PSPACE-complete prediction and a robust safety family with polynomial certificates common to all Euler steps and the flow.

comments
93 pages. Ancillary files: exact local checks (Python 3, standard library only)
fields
Dynamical Systems
pdf ↗ page arXiv:2610.40025 ↗

In this article, we study algebraic relations among rational maps on $\mathbb{P}^1$ and among their preperiodic points. Working over $\mathbb{C}$, we characterize algebraic families of positive-dimensional varieties in $(\mathbb{P}^1)^N$ and tuples of maps $(f_1, \ldots, f_N)$ for which the subvariety is dynamically special for a Zariski-dense set of parameters. Moreover, outside of well-understood elliptic phenomena, we show that all families of maps and subvarieties that bifurcate are maximally bifurcating. Working over $\overline{\mathbb{Q}}$, we characterize arithmetic and geometric potential bigness for the canonical line bundle associated to families of endomorphisms of $(\mathbb{P}^1)^N$ when restricted to the subvarieties. As consequences, we obtain uniform bounds for the periods and preperiods of relations among non-exceptional maps, and we show uniform bounds on the geometry of preperiodic points satisfying these relations. Over $\overline{\mathbb{Q}}$, our results yield corresponding uniform bounds for points and subvarieties satisfying a height gap.

comments
79 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.40147 ↗

We prove a uniform form of the dynamical Manin-Mumford conjecture for split endomorphisms $Φ= \left(f_1,\ldots,f_n\right): \left(\mathbb{P}^1\right)^n \to \left(\mathbb{P}^1\right)^n$ over $\mathbb{C}$, where each $f_i$ has degree $d \geq 2$ and at most one $f_i$ is exceptional. Specifically, we bound the number of irreducible components of $\overline{\operatorname{Prep}\left(Φ\right)\cap V\left(\mathbb{C}\right)}^{\operatorname{Zar}}$ uniformly, depending only on $\left(n,d,\operatorname{deg} V\right)$. We also obtain uniform statements for the dynamical Bogomolov conjecture. Our approach combines a degeneration argument via ultrafilters with a new non-archimedean rigidity theorem, along with the quantitative dynamical Zhang's inequality by Mavraki and the second author.

fields
Dynamical Systems, Number Theory
pdf ↗ page arXiv:2610.40152 ↗

We study the density of ergodic subrelations in the canonical Polish space of subequivalence relations of a probability-measure-preserving countable Borel equivalence relation. Our main result establishes rich ergodicity for ergodic treeable equivalence relations. The proof combines a strongly increasing exhaustion with relative ergodic hyperfinite decomposition. As an application, for every $2\leq r<\infty$, we show that the product of the dyadic odometer action of $\mathbb{Z}$ with the Bernoulli action of $\mathbb{F}_r$ has a richly ergodic orbit relation, whereas the Bernoulli action of $\mathbb{Z}\times\mathbb{F}_r$ does not. Thus rich ergodicity of a free ergodic action is not determined by the acting group.

comments
12 pages, comments welcome
fields
Dynamical Systems, Logic
pdf ↗ page arXiv:2610.40237 ↗

This study introduces a new approach for building surrogate models, in the form of Reduced Order Models (ROMs), for PDE-constrained optimization. A physics-constrained data-driven framework is developed to transform large-scale non-linear optimization problems into ROM-constrained optimization problems. Unlike conventional methods, which suffer from instability of the forward sensitivity function, the proposed approach projects optimization problems to system dynamics optimization problems in Hilbert space to increase stability, diminish memory requirements, and lower computational cost. The present approach is applied to shape optimization of a 2D flapping wing section at $Re=2,400$, where the non-linear interaction of the wing with fluid includes chaotic flow structures. It is shown that the proposed approach can significantly enhance the time-averaged thrust force and propulsive efficiency by 37\% and 40\%, respectively. We also tested this approach for a 3D flapping wing and the results reveal the potential of the proposed approach for more complex optimal designs in the aerospace industry.

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

We study properties of generic compact invariant subsystems of a fixed Smale space in the Hausdorff topology. For a transitive Smale space, we show that the hyperspace of all subsystems contains an open and dense family of NMC subsystems, a dynamically degenerate class with finite orbit structure. A substantially different picture emerges in the closure of the infinite transitive locus: minimality, unique ergodicity, and zero topological entropy are generic, while subsystems conjugate to regular Toeplitz shifts are dense. Despite generic zero entropy, typical subsystems exhibit large oscillations in complexity: we prove that they have infinite slow entropy at the polynomial scale, and their slow entropy at the stretched-exponential scale is equal to one. For mixing Smale spaces, we further study the closure of the infinite totally transitive subsystems. In this hyperspace, minimality, unique ergodicity, and zero entropy remain generic; the conjugacy class of any Sturmian subshift is dense; and uniquely ergodic subsystems whose invariant measure is weakly mixing form a residual set. In particular, topological weak mixing is generic in this space.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.40438 ↗

Functional Analysis20

Orlicz spaces are a natural generalization of classical Lebesgue spaces. They are built upon convex growth functions and provide a flexible framework for studying integrability conditions beyond power-type behavior. In this survey paper, we present the basic definitions, main properties, and fundamental results concerning Orlicz spaces, and also discuss the Marcinkiewicz interpolation result for Orlicz spaces.

fields
Functional Analysis, Analysis of PDEs
pdf ↗ page arXiv:2610.38455 ↗

We develop a theory of local Hardy and $bmo$ spaces on a connected Lie group with polynomial growth whose Lie algebra is endowed with a filtration. Under suitable assumptions, we prove that the local Hardy spaces enjoy an appropriate atomic decomposition, are compatible with Calderón–Zygmund operators, and can be identified with certain Triebel–Lizorkin spaces, as it happens in the classical settings.

comments
65 pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.38562 ↗

We show that the convolution product $\ell^1(G)\times \ell^1(G)\to \ell^1(G)$ is not an open map if $G$ is either non-abelian or contains an element of infinite order. The case $G=\mathbb Z$ solves a problem posed by Kania and Maślany.

comments
6 pages. Comments welcome!
fields
Functional Analysis
pdf ↗ page arXiv:2610.38722 ↗

In this article, we consider a Feller process whose resolvent has the strong Feller property. Using the Dynkin operator of this process, we define local realizations of the generator on an open subset $U$ of its state space. In particular, this allows us to describe the generator of the process killed upon leaving a regular, open subset $U$ as a realization of a maximal operator subject to Dirichlet boundary conditions. Besides the definition via the Dynkin operator, we also consider other possible definitions of such a local realization: a definition in terms of the unkilled semigroup, a definition based on approximation with elements of the generator and a probabilistic definition using martingales. Under mild additional assumptions, we prove that all these definitions are equivalent.

fields
Functional Analysis, Probability
pdf ↗ page arXiv:2610.38761 ↗

For a bounded sequence $y=(y_n)\subset E^*$ and $0<p<\infty$, let $$ G_p(y)=\{x\in E:(y_n(x))\in\ell_p\}, $$ and call $y$ $p$-strongly normal when $G_p(y)$ is dense in $E$. We study the spectra obtained by passing to subsequences and, for Schauder basic sequences, to normalized successive blocks. Their possible values are exactly $$ \varnothing,\quad (0,\infty),\quad (1,\infty),\quad [r,\infty),\quad (r,\infty)\qquad (r>1), $$ and the possible pairs are precisely the nested pairs. Every admissible pair has a normalized weakly null $1$-unconditional basic realization, even in the fixed dual $\ell_\infty(\mathfrak c)=\ell_1(\mathfrak c)^*$, and may be realized with empty spectrum for the original sequence. We also determine sharp universal perturbation classes: $\ell_p$ for $p$-strong normality at a fixed exponent, $c_0$ for the whole subsequence spectrum, and $\ell_1$ for the block spectrum. More generally, for every proper symmetric Banach sequence ideal $A\subsetneq c_0$, membership of the error sequence in $A$ is exactly the universal condition preserving density of the $A$-summability domain. Finally, we extend the author's 2012 selection example from exponent one to every $p>0$ and to every proper symmetric Banach sequence ideal. The good subsequences are exactly those whose index sets have uniformly bounded runs of consecutive integers; in the good case the detected quotient is isomorphic to $c_0$ and the whole selected sequence is weak-star Schauder basic.

comments
24 pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.38853 ↗

Let $X$ be a metric space without isolated points. In this paper we prove that $E$ is a $G_δ$-set in $X$ if and only if there exists a continuous function $f:X\to\mathbb{R}$ whose big Lipschitz derivative is infinite precisely on $E$. To this end, we introduce a new generalization of the classical Takagi function to the setting of metric spaces.

fields
Functional Analysis
pdf ↗ page arXiv:2610.38856 ↗

In the present paper we are building one more bridge between the theory of ideals on the set of natural numbers and the theory of spaces of functions of bounded variation. It is already known that $F_σ$ ideals (that is, ideals of the form $\text{Fin}(φ)$, where $φ$ is a lower semicontinuous submeasure on $\mathbb{N}$) lead to a nice generalization of different concepts from the theory of functions of bounded variation (Waterman variation and Chanturya classes). In this paper we show that analytic P-ideals (that is, ideals of the form $\text{Exh}(φ)$, where $φ$ is a lower semicontinuous submeasure on $\mathbb{N}$) lead to a generalization of spaces of functions continuous in $Λ$-variation. The properties of this generalization are investigated.

fields
Functional Analysis
pdf ↗ page arXiv:2610.38891 ↗

We classify Bessel families in separable Hilbert spaces under coarse equivalence relations: $f$ and $\tilde f$ are equivalent if the seminorms $\|T_f\,\cdot\|$ and $\|T_{\tilde f}\,\cdot\|$ of their analysis operators are mutually dominated, up to constants, after pullback along operators $w,\tilde w$ of a prescribed class $\mathcal O$. In contrast with orbit relations such as unitary or similarity equivalence, these relations ignore redundancy and the geometry of the index set, and compare frames, nonframes and compact families on the same footing. They are level $-1$ of the comparison categories of the companion article, and we compute the levels $0$ and $k\ge1$: they are trivial for bounded, injective, bounded below, isometric and upper semi-Fredholm comparison operators, and for invertible or unitary ones level $1$ is a stabilizer-type group of the family. For bounded $\mathcal O$ the classes are given by the singular numbers up to constants; injective operators add the kernel dimension, bounded below operators or isometries add upper semi-Fredholmness, and invertible, unitary or surjective operators give the kernel dimension and the dyadic multiplicity sequence of the spectrum up to bounded displacement on the logarithmic scale, which splits each remaining class into continuum many. Upper semi-Fredholm operators give only three noncompact classes, whereas Fredholm operators give continuum many, so that the Fredholm relation is strictly finer. For each relation we determine exactly which families are equivalent to an orthonormal basis, and we compute an operator Banach–Mazur distance, $\log(\sup_ns_n/\tilde s_n\cdot\sup_n\tilde s_n/s_n)$. As applications, we obtain a relative Paley–Wiener stability theorem for Bessel families and the invariance of Schatten membership and of $\int\|f\|^2$ under coarse equivalence.

comments
41 pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.39002 ↗

Let $H$ be a complex Hilbert space with $\dim H\ge2$. We show that the additive surjections on $\mathcal{B}(H)$ and on its self-adjoint part $\mathcal{B}_s(H)$ that preserve mutual strong numerical-radius orthogonality in one direction are precisely the maps of the form $A\mapsto cUAU^*$, where $U$ is a unitary or antiunitary operator on $H$ and $c$ is a nonzero complex or real scalar, respectively.

comments
14 pages
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2610.39080 ↗

We study the Levenberg–Marquardt method for nonlinear inverse problems in Banach spaces under a Hölder stability estimate. Under suitable assumptions on the geometry of the Banach space and the Fréchet derivative of the measurement operator, we establish the well-definedness of the method, local convergence and convergence rates for exact data, and the monotonic decrease of the Bregman distance up to the stopping index for noisy data. These results extend the corresponding Hilbert space theory to the Banach space setting.

fields
Functional Analysis, Numerical Analysis
pdf ↗ page arXiv:2610.39131 ↗

In 1952, Michael posed a question about functional continuity of commutative Fréchet algebras in his memoir, known as Michael's problem in the literature. We settle this in the affirmative along with its equivalent forms. Indeed, we continue our previous works to directly attack these problems. We show that the test case for this problem -- the Fréchet algebra $\cal U$ of all entire functions on $\ell^\infty$ -- is, in fact, a Fréchet algebra $\cc[[X]]$, if there exists a discontinuous character on $\cal U$. An important tool is a topological version of the tensor (symmetric) algebra over a Banach space. The elementary, but crucial, idea is to express the test algebra $\cal U$ as a {\it weighted Fréchet symmetric algebra} over the Banach space $\ell^1$. We summarize the effects of our affirmative solution in terms of important applications in automatic continuity theory, including affirmative answers to two significant, long-standing problems from 1966 and 1978.

comments
64 pages. Version 5 of 2006.11134 due to the following reasons: (1) The long manuscript has been divided in two parts based on two different approaches; (2) proof of Theorem 3.1 (main theorem) has been elaborated; (3) alternative proof is also given; and (4) significant applications in automatic continuity theory have been added (e.g., affirmative solution to Forster's problem (1966)
fields
Functional Analysis
pdf ↗ page arXiv:2610.39260 ↗

For positive semidefinite matrices $A,B$ and $1/2\leα\le1$, we establish $\operatorname{Tr}\!\left[A\,D\log(A^α+B^α)(B^α)\right] \le s^s(1-s)^{1-s}\operatorname{Tr}[A^αB^{1-α}]$, where $s=(1-α)/α$, with the optimal coefficient. The proof uses a superoperator representation of the directional derivative of the logarithm and an Araki-type estimate for the derivative of a fractional power. Both this inequality and its symmetric-quotient counterpart extend to positive trace-class $A$ and positive, possibly unbounded, self-adjoint $B$ on a separable Hilbert space.

fields
Functional Analysis, Mathematical Physics
pdf ↗ page arXiv:2610.39598 ↗

Rencently, Fang, Hou, Jiang, and Zhang reduced Halmos's third problem to invertible operators with conjugate bi-geometric form. An operator has such a form if, with respect to an orthogonal decomposition, it admits a representation $$ T = \begin{pmatrix} A & C \\ 0 & B \end{pmatrix}, \quad A^*, B \in B_1(O_δ),$$ where $O_δ=\{z\in\mathbb C:|z|<δ\}$ for some $δ>0$, and $B_1(O_δ)$ denotes the rank-one Cowen–Douglas class. We restrict our attention to the case $B=A^*$ with strictly positive coupling $C$, and settle Halmos's third problem for this class of operators. More precisely,we prove that every such operator $T$ is invertible and that $T^{-1}$ has a nontrivial closed invariant subspace. This result contributes to the study of Halmos's third problem within the conjugate bi-geometric framework.The proof combines monotone solutions of operator Riccati equations with strong operator convergence to construct invariant subspaces for associated Hamiltonian operator matrices.

comments
12pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.39605 ↗

After some personal recollections of Jean-Pierre Kahane, this paper gives a gentle introduction to the Gleason-Kahane-Zelazko theorem. The theorem states that a normalised complex-linear functional on a unital complex Banach algebra is multiplicative whenever it does not vanish on invertible elements. Neither continuity of the functional nor commutativity of the algebra is assumed. We give a detailed account of three proofs: the original argument of Gleason and, independently, Kahane and Zelazko; the polynomial proof of Roitman and Sternfeld; and a proof by the author. We explain the complex analysis behind each: a special case of Hadamard's factorisation theorem, a polynomial argument using the fundamental theorem of algebra, and the Pólya-Saxer theorem on zero-free entire functions and their derivatives. The elementary entire-function lemma needed for the first proof is proved in full; the Pólya-Saxer theorem is used without proof. We give full details of the algebraic argument common to the three proofs, which deduces multiplicativity from the preservation of squares, including the non-commutative case. We then discuss applications and counterexamples, and present an extension to Ransford's generalised spectra using the Roitman–Sternfeld argument. We conclude with a brief guide to the more recent literature.

comments
30 pages. Paper submitted to a volume in memory of Jean-Pierre Kahane
fields
Functional Analysis, History and Overview, Number Theory
pdf ↗ page arXiv:2610.39769 ↗

In this paper, we apply higher-order tangent bundles and higher-order derivative maps to study countable subgroups of the deffeomorphism group ${\rm Diff}(M)$ of a closed smooth manifold $M$. Using this framework, we introduce the concept of higher order $μ$-discreteness for subgroup $Γ< {\rm Diff}(M)$. As applications, we show that both the strong Novikov conjecture and the coarse Baum–Connes conjecture hold for countable groups with higher order $μ$-discreteness.

fields
Functional Analysis
pdf ↗ page arXiv:2610.40062 ↗

We consider shift operators on infinite directed trees. We prove that under very mild assumptions on the structure of the tree, the resulting operator is universal (in the sense of Rota). We show connections between the spectrum of the operator and the frequency of branching in the tree.

fields
Functional Analysis, Classical Analysis and ODEs, Spectral Theory
pdf ↗ page arXiv:2610.40089 ↗

We establish algebraic characterizations of Toeplitz operators on the Hardy space on the annulus. As an application, we characterize compact perturbations of Toeplitz operators.

comments
14 pages
fields
Functional Analysis, Complex Variables, Operator Algebras
pdf ↗ page arXiv:2610.40118 ↗

Lefèvre, Li, Queffélec, and Rodríguez-Piazza [12] recently characterized the sequences $β$ for which the weighted Hardy space $H^2(β)$ has the same bounded composition operators as the Hardy space $H^2$. We investigate the analogous questions for the compactness and the $p$-Schatten classes: for which sequences $β$ does the space $H^2(β)$ have the same compact or $p$-Schatten class composition operators as $H^2$?

fields
Functional Analysis, Complex Variables
pdf ↗ page arXiv:2610.40148 ↗

We study positive measure-symbol Toeplitz operators between Gaussian radial–angular mixed-norm Fock spaces throughout the full range of exponents, including infinity. We obtain a complete characterization of boundedness in terms of weighted local masses of the symbol measure, or equivalently in terms of its Gaussian Berezin profile. The criterion separates the transfer of angular integrability from that of radial summability and remains valid in the quasi-Banach and endpoint regimes. We further characterize compactness and obtain the corresponding essential-norm estimates through the asymptotic behavior of the same local-mass and Berezin profiles, and determine the mappings involving the large and little outer-endpoint spaces. We also prove an independent characterization of bounded positive Toeplitz sesquilinear forms. The proofs combine atomic recovery, localized Gaussian matrix estimates, and Rademacher extraction.

comments
36 pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.40236 ↗

We investigate the structure of kernels of finite-rank perturbations of truncated Toeplitz operators. By realizing a perturbed truncated Toeplitz operator on a model space as a suitable matrix-valued truncated Toeplitz operator on an enlarged model space, we identify its kernel with a coordinate projection of the kernel of an associated block Toeplitz operator. This realization enables us to transfer the nearly $S^*$-invariant structure of Toeplitz kernels to the perturbed truncated setting. More precisely, for a perturbation of rank at most $n$, we show that the kernel of the perturbed truncated Toeplitz operator is nearly $S^*$-invariant with defect at most $2n+1$. We then extend the method to truncated Toeplitz operators on multiband spaces. In this setting, a perturbation of rank at most $n$ again preserves the finite-defect nearly $S^*$-invariant structure of the kernel, with the explicit upper bound $2n+2$ for the defect.

comments
33 Pages, Comments are welcome
fields
Functional Analysis
pdf ↗ page arXiv:2610.40295 ↗

Representation Theory20

Let $A$ be a finite Hopf algebra over a Noetherian commutative ring $R$. For any map $f : R \to k$ where $k$ is a field, there is a natural map on the cohomology of $A$ under this change of coefficients $H^\ast(f): H^\ast(A, R) \otimes_R k \to H^\ast(A_k, k)$. In this paper we examine this map for $R = \mathbb Z[ζ]$ the cyclotomic integers with $ζ$ an $\ell$th root of unity. We show that under a finite generation assumption, the induced map gives a homeomorphism on the spectra of the two cohomology rings. Finally, we turn to small quantum groups defined over $\mathbb Z[ζ]$ and show that, with mild restrictions on $\ell$, every fiber map whose residue field has a good prime characteristic induces an isomorphism on cohomology.

comments
15 pages
fields
Representation Theory
pdf ↗ page arXiv:2610.37693 ↗

Using a mixture of theoretical tools and computer calculations, we describe the Lie subalgebras and the Lie sub-superalgebras generated by the sets of reflections in the group algebras of the exceptional finite reflection groups.

comments
30 pages. The GAP code we used for the calculations is available for download as a supplementary file with this submission
fields
Representation Theory, Group Theory
pdf ↗ page arXiv:2610.37890 ↗

Using the data of the Dynkin diagrams, we build graphical calculi for representing the positive roots of Kac-Moody algebras and the representations of quivers. Once developed, we use these to analyze the asymptotic size of the root and representation spaces, and discuss how this relates to the Gabriel-Kac theorem, the correspondence between these two structures. We give a refinement of this correspondence in terms of the trichotomy of growth rates for Kac-Moody algebras depending on if they are of finite, affine, or indefinite type, which is done in terms of what we call ``tree like" representations.

comments
46 Pages, 22 figures
fields
Representation Theory, Combinatorics
pdf ↗ page arXiv:2610.37969 ↗

We construct explicit test vectors in the minimal $U(n)$-types of cohomological principal series representations of $\mathrm{GL}_n(\mathbb C)$, together with Schwartz functions, for which the Flicker zeta integrals equal the corresponding Asai $L$-factors. Both the vectors and the Schwartz functions are independent of $s$, with all normalization constants given explicitly. We construct the vectors through a polynomial realization of Schur modules. Schur orthogonality reduces the Flicker integrals to Mellin transforms of Whittaker functions, and Godement sections yield a recurrence for their Jacquet integrals. The lower-rank vectors depend on the remaining integration variables, preventing a direct reduction to lower-rank Flicker integrals. We overcome this difficulty by combining growth estimates derived from the recurrence with the Asai functional equation. This proves that the holomorphic quotient of the Flicker integral by its Asai $L$-factor is constant. An explicit asymptotic calculation shows that this constant is exactly one.

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

We prove that big theta lifts have finite length for thirteen split exceptional dual pairs arising from the minimal representations of the split real groups of types $E_6$, $E_7$, and $E_8$.

fields
Representation Theory
pdf ↗ page arXiv:2610.38222 ↗

Let $\mathbf F$ be a non-archimedian local field of odd residue characteristic, ${\mathcal O}={\mathbf F}[\![t]\!]\subset{\mathcal K}={\mathbf F}(\!(t)\!)$. We consider the subgroup $\widehat{\mathrm{GL}}(2,{\mathcal O})={\mathcal K}^\times\cdot{\mathrm{GL}}(2,{\mathcal O})\subset{\mathrm{GL}}(2,{\mathcal K})$, and the normalizer ${\mathrm{GL}}'(2,{\mathcal O})\subset{\mathrm GL}(2,{\mathcal K})$ of an Iwahori subgroup $I\subset{\mathrm{GL}}(2,{\mathcal K})$. We calculate the $Γ$-functions for irreducible special representations of $\widehat{\mathrm{GL}}(2,{\mathcal O})$ and ${\mathrm{GL}}'(2,{\mathcal O})$.

fields
Representation Theory, Algebraic Geometry
pdf ↗ page arXiv:2610.38371 ↗

In this paper we define comonoidal structures on additive $\Bbbk$-linear $2$-categories which guarantee the existence of a monoidal structure on the corresponding $2$-categories of $2$-representations.

fields
Representation Theory, Category Theory, Quantum Algebra
pdf ↗ page arXiv:2610.38460 ↗

We prove that an Artin algebra has finite representation type if its indecomposable finitely generated modules are determined, up to isomorphism, by their composition factors. This gives an affirmative answer to the conjecture on composition factors and finite representation type recorded by Auslander, Reiten and Smalo.

comments
35 pages
fields
Representation Theory, Commutative Algebra, Rings and Algebras
pdf ↗ page arXiv:2610.38813 ↗

We determine the bigraded Frobenius series of the superspace coinvariant ring $R^{(1,1)}_{\mathbb{Z}_r\wr\mathfrak{S}_n}$ for the wreath products $\mathbb{Z}_r\wr\mathfrak{S}_n$, which is the quotient of the ring $\mathbb{C}[x_1,\ldots,x_n]\otimes\bigwedge[θ_1,\ldots,θ_n]$ of polynomial-valued differential forms by the ideal generated by diagonal $\mathbb{Z}_r\wr\mathfrak{S}_n$-invariants with vanishing constant term. The bigraded multiplicity of each irreducible character is a sum over standard Young $r$-tableaux of an expression determined by the flag major index and flag descent number. This refines the Frobenius series graded by fermionic degree found by Bhattacharya–Rhoades (2026). It specializes at $r=2$ to the hyperoctahedral group $\mathfrak{B}_n$ case, and it specializes at $r=1$ to recover the theorem of Murai–Rhoades–Wilson (2025) on the symmetric group $\mathfrak{S}_n$. We give new formulas for the bigraded multiplicities of hook characters of the superspace coinvariant ring in types $A$ and $B$, yielding upper bounds on trigraded multiplicities of the sign character of $R^{(1,2)}_{\mathfrak{S}_n}$ and the determinant character of $R^{(1,2)}_{\mathfrak{B}_n}$. As a corollary, we deduce a conjecture of F. Bergeron (2024) on hook components of $R^{(1,1)}_{\mathfrak{S}_n}$.

comments
43 pages, 2 figures
fields
Representation Theory, Combinatorics
pdf ↗ page arXiv:2610.38875 ↗

Let $G$ be a quasi-split reductive group over a finite extension $F$ of $\mathbb{Q}_p$. We study the Fargues-Scholze categorical Langlands correspondence at generic parameters $φ$, namely those whose semisimplification does not coincide with that of any parameter with nontrivial monodromy. Extending the theory of quasi-exceptional sets on the nilpotent cone developed by Bezrukavnikov to the setting of disconnected reductive groups which arise as stabilizers of semisimple generic parameters, to any irreducible representation $ρ$ of such a group we construct sheaves labeled $\overline{\nabla}_ρ$, $\overlineΔ_ρ$, $IC_ρ$, and $δ_ρ$ on the moduli stack of L-parameters for $G$. Using forthcoming work of Hamann, Hansen, and Mann on geometric Eisenstein series compatibility, the (conjectural, in general) behavior of the correspondence at generous parameters, and the (conjectural, in general) agreement between Fargues-Scholze and classical semisimple L-parameters we prove that these sheaves correspond under the Fargues-Scholze functor to the sheaves $i_{b!}π$, $i_{b\sharp}π$, $i_{b\sharp!}π$, and $i_{b!*}π$ on $\text{Bun}_G$, where $π$ is a smooth irreducible representation with Fargues-Scholze parameter $φ$. As applications we prove t-exactness properties of the Fargues-Scholze functor specialized at a generic parameter, and that Hecke operators are perverse t-exact on the generic locus. We also construct and study foundational properties of Hecke eigensheaves at generic parameters, compute non-semisimplified Fargues-Scholze parameters on the generic locus, and construct a Fargues-Scholze-theoretic version of the BM-O bijection at generic parameters.

comments
50 pages, comments welcome
fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2610.38954 ↗

In this paper, we construct the canonical basis for the modified mirabolic quantum $\mathfrak{sl}_n$. We then study the associated $\dot{U}_v(\mathfrak{sl}_n)$-module and $\dot{U}_v(\mathfrak{sl}_n)$-comodule structures and prove the positivity of this basis with respect to these two structures.

fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2610.39010 ↗

Neeman's metric on a triangulated category assigns lengths to morphisms and allows us to construct triangulated metric completions of the category. We prove that the metric completion of a triangulated category with respect to a constant metric is always a subcategory of the Verdier quotient by the thick subcategory generated by cones of zero-length morphisms, and we provide a sufficient criterion for equality. To that end, we define continuous functors between completions which induce triangulated functors between completions. Moreover, we give two applications. First, we show that the additive equivalence discovered by Cummings and Gratz between the Paquette-Yildirim completion and a specific metric completion of an Igusa-Todorov discrete cluster category is, in fact, a triangulated equivalence. Second, we fully classify metric completions of bounded derived categories of coherent sheaves over weighted projective lines of domestic or tubular type.

comments
29 pages, 2 figures
fields
Representation Theory, Algebraic Geometry, Category Theory
pdf ↗ page arXiv:2610.39035 ↗

We relate affinizations of braided monoidal categories to braided module categories, allowing a twist by a braided monoidal automorphism. Our main theorem establishes a bijection between twisted braided structures on a right module category and extensions of its action to the corresponding twisted affinization. We also show that the twisted affinization is the free twisted braided module category on one object. We give explicit presentations of twisted affinizations, both as monoidal categories and as module categories, using invertible dots and reflection relations. We also describe the relation to cylinder twists and tensor-pair cylinder twists, including the naturality condition needed to obtain a braided module structure. As applications, we obtain module-category presentations of the affine Kauffman and affine oriented skein categories and an orientation-reversing twisted version of the latter. We realize the disoriented skein category as a quotient of this twisted affinization by a single additional relation.

comments
31 pages
fields
Representation Theory, Category Theory, Quantum Algebra
pdf ↗ page arXiv:2610.39456 ↗

We present a direct proof of the well-known classification of finite-dimensional representations of the Yangian $Y(\mathfrak{sl}_2)$ following an approach by Chary-Pressley for $U_q(\mathfrak{ \hat sl_2})$.

comments
12 pages with Appendix
fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2610.39589 ↗

Let $Λ$ be a finite dimensional algebra over a field $\mathbf{k}$. We introduce the reachable syzygy quiver of $Λ$, a directed multigraph whose vertices are the isomorphism classes of indecomposable nonprojective direct summands of iterated syzygies of simple modules, and whose arrows record nonprojective summands of first syzygies. The projective dimension of a vertex is one plus its directed path height, allowing the global and finitistic dimensions of $Λ$ to be read off from this height function. This formula holds for every finite dimensional algebra, but its states are arbitrary modules. We show that when the first syzygy of an indecomposable module admits a closed combinatorial description from the bound quiver, this state space reduces to a smaller combinatorial quiver, making the global and finitistic dimensions exact computable invariants. We carry this out in three stages. Over a special biserial algebra, the Liu–Morin closure theorem identifies the reachable syzygy quiver with a string-syzygy quiver whose vertices are string modules. Over a string algebra, this compresses to the relation-chain quiver of Xin and Zhang, recovering their global dimension formula along with a parallel formula for the finitistic dimension. Over an arbitrary biserial algebra, the universal formula holds, but uniform compression to paths or strings is impossible, with the Skowroński–Waschbüsch algebra providing a witness. Finally, we show two string algebras may share the same Gabriel quiver but have distinct global dimensions, proving the ideal of relations is indispensable for these invariants, and we prove that a pointwise homological reduction to a string algebra on the same quiver preserving the monomials of the relations is impossible.

fields
Representation Theory, Rings and Algebras
pdf ↗ page arXiv:2610.39672 ↗

Characteristic tilting modules play a central role in the theory of standardly stratified algebras, for instance in Ringel duality. They are constructed from the standard modules, which are determined by a partial order on the simple modules. In this paper, we characterize characteristic tilting modules intrinsically. We show that a tilting module is a characteristic tilting module if and only if the matrix of composition multiplicities of its indecomposable direct summands is triangular with respect to suitable orderings of the summands and of the simple modules. In this case, the standard modules and all the corresponding partial orders are recovered from the tilting module. As an application, we prove that the tilting correspondence of Geiss, Leclerc and Schröer between a GLS path algebra and its associated hereditary algebra restricts to a bijection between characteristic tilting modules. In particular, we obtain GLS path algebras that are not quasi-hereditary with respect to any partial order but for which every tilting module is a characteristic tilting module.

comments
31 pages
fields
Representation Theory, Rings and Algebras
pdf ↗ page arXiv:2610.39805 ↗

Let $F$ be a non-archimedean local field and let $K_μ$ be a standard parahoric subgroup of $GL_n(F)$. We express the diagonal values of normalized parahoric Whittaker eigenfunctions with trivial central character using blockwise Casselman–Shalika formulas with the appropriate modulus factor. Every irreducible generic Iwahori-spherical representation has a one-dimensional fixed space for a suitable parahoric, with no invariants under a strictly larger parahoric. The full Hecke character of this line determines the representation. We compute its adjacent-block Hecke eigenvalues and, under additional irreducibility hypotheses, obtain an explicit finite formula on every Bruhat cell using an opposite induced model, Whittaker-preserving intertwiners, and Demazure–Whittaker operators. We apply these formulas to local Rankin–Selberg integrals for $GL_n\times GL_1$ and for compatible parahorics in $GL_n\times GL_m$. In the latter case, the lowest Laurent coefficient and the equal-rank functional equation determine the integral. Explicit translations and rescalings then give test vectors for the local $L$-factor.

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

Let $G$ be a $p$-adic unipotent group and let $H$ be an algebraic subgroup of $G$. Given a unitary character $χ$ of $H$, we consider the monomial representation $\operatorname{Ind}_{H}^{G}χ$. To the character $χ$, we associate the affine subspace $$ X_χ=f+\mathfrak h^\perp\subset\mathfrak g^*$$ where $f$ is a linear form associated with $χ$. We describe the irreducible representations occurring in the central decomposition of $\operatorname{Ind}_{H}^{G}χ$ in terms of the coadjoint orbits in $\mathfrak g^*$ that meet $X_χ$. We also determine the corresponding measure class on the unitary dual $\widehat G$. Furthermore, we study the multiplicities of the irreducible representations in this decomposition. As an application, we compute the Plancherel formula for $\operatorname{Ind}_{H}^{G}χ$ when $H$ is a normal algebraic subgroup of $G$ and the multiplicities are finite.

fields
Representation Theory
pdf ↗ page arXiv:2610.40099 ↗

The group $G = SL(n+2,\R)$ has a parabolic subgroup $P = MAN$ whose unipotent radical is a Heisenberg group. We study representations induced from a character of $P$, and using the Lie algebra action on the space of $K$-finite vectors we find the points of reducibility and the complementary series. We identify solutions to the conformally invariant systems of differential operators as subrepresentations.

comments
24 pages
fields
Representation Theory
pdf ↗ page arXiv:2610.40102 ↗

In this paper, we introduce a `reduced' form of permutation twisted cohomology as introduced by Balmer–Gallauer and further developed by Miller. This ring is bigraded by a well-chosen choice of endotrivial complex, rather than multigraded by a family of endotrivial complexes. The Balmer spectrum of the small derived category of permutation modules openly immerses into the homogeneous spectrum of this ring. We also show that for $p$-groups, Miller's `remixed' twisted cohomology ring also admits the Balmer spectrum as an open subspace, and confirm in both cases it can be upgraded to have Dirac scheme structure; furthermore, we prove that the two open covers witnessing this are in general different.

comments
24 pages. Comments welcome
fields
Representation Theory, Algebraic Geometry, Algebraic Topology, Category Theory
pdf ↗ page arXiv:2610.40602 ↗

Complex Variables18

Let $X$ be a Stein manifold, and let $K=\{h\le0\}$ be a compact sublevel set of a strictly plurisubharmonic function $h$ defined near $K$. It is known that $K$ is meromorphically convex in $X$ if and only if $dd^ch$ extends to a Hodge form on $X$. We show that if $H_2(X,\mathbb Z)$ is the direct sum of a free abelian group and a torsion group, for example if it is finitely generated, then any extension of $dd^ch$ to a Kähler form on $X$ can be modified, after replacing $h$ by a positive multiple, into a Hodge form. Thus meromorphic convexity of $K$ is equivalent to the extendability of $dd^ch$ as a Kähler form. We also show that the topological assumption cannot be dropped: we construct a Stein manifold $X$ of dimension $6$ with $H_2(X,\mathbb Z)\cong\mathbb Q$, a sublevel set $K$ as above that is not meromorphically convex although $dd^ch$ extends to a Kähler form, and a totally real torus in $K$ that is isotropic for a Kähler form but is not meromorphically convex. This shows that the Hodge condition in Guedj's characterization of meromorphically convex totally real submanifolds cannot be weakened to a Kähler condition, and gives counterexamples to two criteria stated by Cieliebak and Eliashberg.

fields
Complex Variables
pdf ↗ page arXiv:2610.38055 ↗

Let $n\geq 2$ and $k\geq 1$ be integers. We study finite order meromorphic solutions of the nonlinear differential-difference equation \begin{equation*} f^{n}(z)f'(z)+P_{d}(z,f)=p_{1}(z){\rm e}^{α_{1}z^{k}}+p_{2}(z){\rm e}^{α_{2}z^{k}}, \end{equation*} where $P_{d}(z,f)\not\equiv 0$ is a difference polynomial in $f$ of degree $d\leq n-1$ whose coefficients are small meromorphic functions with respect to $f$, $p_{1},~p_{2}$ are nonzero meromorphic functions with $T(r,p_{j})=o(r^{k})$, $j=1,2$, and $α_{1}\neqα_{2}$ are nonzero constants. We prove that every such solution has order exactly $k$, and obtain sufficient conditions on $n,~d,~k$ for the equation to admit no finite order meromorphic solution with $N(r,\frac{1}{f})=S(r,f)$. Our results extend the known ones from linear exponents $z$ to polynomial exponents $z^{k}$, and replace the linear difference polynomials with the degree restriction $d\leq n-2$ assumed in the literature by general ones of degree $d\leq n-1$. Examples show that the restrictions on $n$ and $d$ are sharp.

fields
Complex Variables
pdf ↗ page arXiv:2610.38247 ↗

We develop a value distribution theory for finite analytic morphisms between proper connected quasi-smooth Berkovich curves over a complete algebraically closed non-Archimedean field. The central tool is a multi-tail Dirichlet Green function on finite truncations of a generalized skeleton, which makes non-Archimedean potential theory on skeleta compatible with global Nevanlinna asymptotics. Using it, we prove the first main theorem as an exact identity relating the characteristic, counting, and proximity functions. For logarithmic targets we establish a second main theorem in both ramified and level-one truncated forms. The defect relation is also given. The theory provides a Berkovich-analytic framework for non-Archimedean value distribution, bridging classical Nevanlinna theory and its $p$-adic counterpart.

comments
page 40
fields
Complex Variables, Algebraic Geometry
pdf ↗ page arXiv:2610.38435 ↗

In this paper, we show that the domain $\mathbb H$ serves as a unifying domain for $\mathbb G_2, \mathbb E$ and $\mathbb P$ by proving that each of these domains is an analytic retract of $\mathbb H$. Further, we prove that the bidisc $\mathbb D^2$ and the Euclidean unit ball $\mathbb B_2$ are also analytic retracts of $\mathbb H$. Then the rational $\overline{\mathbb H}$-inner functions, i.e., the rational maps from $\mathbb D$ into $\overline{\mathbb H}$ whose boundary values lie in the distinguished boundary of $\mathbb H$, are characterized. Two different versions of Schwarz type lemma for $\mathbb H$ are established of which one provides a necessary and sufficient condition. Finally, capitalizing on the theory of $\mathbb H$, we present alternative proofs to a few known results on $\mathbb P$ from the literature.

comments
This is a part of our long draft arXiv:2506.15149v1
fields
Complex Variables
pdf ↗ page arXiv:2610.38677 ↗

For each integer $h\ge1$, let $Z_h$ be the closure in the complex plane of the roots of nonzero integer polynomials whose coefficients have absolute value at most $h$, with no degree restriction. We prove that $Z_h$ is regular closed off the real axis: every non-real point of $Z_h$ is a limit of interior points. The root-closure identification of Espigulé and Juher, for which we include a self-contained proof, shows that the same closure arises from monic polynomials and that outside the closed unit disc it is the connectedness locus of $h+1$ equally spaced collinear similarities. The main step proves that this locus is regular closed off the real axis; this was known for $h=1$ by Calegari, Koch and Walker, for $h\ge19$, and inside an explicit lens. The symmetry $z\mapsto1/z$ then gives the full-plane statement. The proof adapts the method of traps of Calegari, Koch and Walker, using a neighboring-piece criterion, short chains through consecutive digits, and Rouché's theorem. We also classify the convex attractors.

comments
25 pages, 3 figures. Figure-generation code, numerical data and exact-arithmetic checks included as ancillary files
fields
Complex Variables, Dynamical Systems
pdf ↗ page arXiv:2610.38971 ↗

Hermitian Clifford analysis is a refinement of Euclidean Clifford analysis obtained by imposing a complex structure on $\R^{2n}$ and considering the simultaneous null solutions (the $h$-monogenic functions) of two mutually adjoint Hermitian Dirac operators. This survey collects, in a unified notation and without proofs, the main results obtained along this line of research between 2008 and 2026. We review the matrix Borel–Pompeiu, Koppelman and Cauchy formulae, first for domains with Liapunov or Ahlfors–David regular boundary and then for Jordan domains whose boundary is fractal in the sense of Mandelbrot; the associated Cauchy transform, Hilbert transform, Hardy projections and their mapping properties, including Hölder norm estimates in terms of the $d$-sum of a Whitney decomposition; the jump decomposition, Dirichlet and Riemann boundary value problems in each setting, including the linear Riemann problems with variable circulant coefficients and their nonlinear counterparts. We also review a duality theory for the module of germs of $H$-monogenic matrix functions, together with its Euclidean model (the annihilators of harmonic differential forms) and its algebraic prerequisites (a Poincaré lemma and a Mittag–Leffler theorem for circulant matrices); the function theory associated with a Hermitian version of the Helmholtz equation, the corresponding $\bar\partial$-problem and its application to a formal two-dimensional Maxwell-type system; and finally, the parallel development in the quaternionic Hermitian setting, where four Dirac operators and circulant $(4\times 4)$ matrices take over.

fields
Complex Variables
pdf ↗ page arXiv:2610.39087 ↗

We study the inverse problem for Julia limiting directions in the Eremenko-Lyubich class $\mathcal B$, which is the class of transcendental entire functions with a bounded set of singular values, and its meromorphic generalization $\mathcal B_{mer}$. Every nonempty compact subset of the circle can be the set of Julia limiting directions of an entire $f\in\mathcal B$. For finite unions of nondegenerate closed arcs, the corresponding $f\in\mathcal B$, even with every finite order at or above an explicit bound determined by the arc lengths, can be attained. We also refine the series construction of the latter two authors to obtain $f\in \mathcal B_{mer}$ with any prescribed order and the set of Julia limiting directions.

comments
25 pages, comments are welcome!
fields
Complex Variables, Dynamical Systems
pdf ↗ page arXiv:2610.39103 ↗

This paper investigates the higher order Teodorescu transform in the context of generalized partial-slice monogenic functions. By introducing the generalized poly-partial-slice Cauchy kernel, we derive some integral formulas including higher order Borel-Pompeiu formula and Cauchy integral formula for generalized poly-partial-slice monogenic functions. Furthermore, we define the higher order Teodorescu transform in this context and establish its existence, continuity, and some mapping properties. These results extend classical integral methods in Clifford analysis to the generalized poly-partial-slice setting.

fields
Complex Variables
pdf ↗ page arXiv:2610.39238 ↗

We establish uniform estimates for degenerate complex Monge–Ampère equations on compact Hermitian manifolds under weak Orlicz integrability assumptions on the densities. Our estimates apply uniformly to Hermitian metrics and to semipositive uniformly non-collapsing reference forms. For arbitrary big reference forms, we obtain uniform relative $L^\infty$-estimates with respect to the extremal function with minimal singularities, and establish continuity of the resulting solutions on the regular locus. As an application, we prove the existence of solutions with minimal singularities to degenerate complex Monge–Ampère equations associated with big forms. The proofs combine local Orlicz estimates with pluripotential-theoretic envelope techniques and uniform control of the Monge–Ampère masses, overcoming the lack of invariance of the total Monge–Ampère mass in the Hermitian setting.

comments
36 pages, Comments are welcome!
fields
Complex Variables, Differential Geometry
pdf ↗ page arXiv:2610.39259 ↗

We give an affirmative solution of the original Corona problem (1962) for certain bounded pseudoconvex domains or polydomains in $\mathbb{C}^n$, including the balls and polydiscs, by using the Gleason solvability property of such domains for $H^\infty(G)$. In fact, we establish an equivalency of the Corona problem and Gleason's problem (1964) in the theory of several complex variables. Indeed, we extend our recent works on both problems based on the functional analytic approaches, and extend recent work of Clos, as well as apply the usual Banach algebra method. As an application, we establish the I. J. Schark's theorem for these $G$'s. We also obtain a welcome extension of a result of Krantz and Li (1995) for a bounded, strictly pseudoconvex domain in $\mathbb{C}^n$ with $C^3$ boundary.

comments
37 pp. The arXiv: 2302.03433 is divided in 3 parts: (1) discusses the test case for the corona problem, Extracta Math. Vol 41 (2026), which also gives a solution to Fornaess and Ovrelid's problem (1983); (2) this manuscript provides a solution to the original corona problem; and (3) provides solutions to corona and Gleason's problems for certain familiar Banach spaces of holomorphic functions
fields
Complex Variables, Functional Analysis
pdf ↗ page arXiv:2610.39425 ↗

We introduce a natural notion of generalized order for entire and meromorphic functions and express it in terms of their Taylor coefficients. More precisely, one formula uses the least singular values of Hankel matrices of the coefficients, and the other uses their determinants. These formulas generalize the classical coefficient formula for the order of entire functions and its extensions by Edrei and Sheremeta. The proof combines a theorem of Pommerenke with a bound for the Nevanlinna characteristic that results from a convergence theorem for rational approximants introduced by Prokhorov. We also characterize the largest class of growth scales for which the associated generalized order is well-behaved.

comments
19 pages
fields
Complex Variables
pdf ↗ page arXiv:2610.39453 ↗

We investigate graph domains and graph curves from the viewpoints of $\mathrm{BMOA}$, Zygmund regularity, and asymptotic geometry. First, we prove that every graph domain is a $\mathrm{BMO}$ domain, which provides a proof of a statement of Astala and Zinsmeister. We then use a Weierstrass-type function to construct a Bishop-Jones quasicircle that is asymptotically conformal but not asymptotically smooth. This example yields the strict inclusions \[ \mathrm{VMOA}(\mathbb H) \subsetneq \mathrm{BMOA}(\mathbb H)\cap B_0(\mathbb H), \qquad \mathrm{SS}(\mathbb R) \subsetneq \mathrm{SQS}(\mathbb R)\cap\mathrm{S}(\mathbb R). \] Finally, by a localized lacunary construction, we produce a compactly supported locally absolutely continuous function $f$ with $f'\in\mathrm{BMO}(\mathbb R)\setminus\mathrm{VMO}(\mathbb R)$ whose graph is an asymptotically conformal chord-arc curve that is not asymptotically smooth.

fields
Complex Variables
pdf ↗ page arXiv:2610.39567 ↗

In this paper, we study $\varphi$-uniform/-inner uniform domains in metric spaces. In our first main result, we establish quantitative characterizations of three different definitions of $\varphi$-uniformity/-inner uniformity in length spaces. In our second main result, we obtain a geometric sufficient condition of $\varphi$-uniform/-inner uniform domains in doubling length spaces, which extends the corresponding result of Guo-Huang-Wang [arXiv 2025] and Gao-Guo-Huang-Wang [arXiv 2025] for linear case.

comments
18 pages
fields
Complex Variables
pdf ↗ page arXiv:2610.39574 ↗

In this paper, we prove that a smooth strongly pseudoconvex Kähler–Finsler metric $F$ satisfying the constant radial curvature condition \[ Ω(χ,\barχ)χ=cF^2χ, c\in\mathbb R\setminus\{0\}, \] is induced by a Hermitian Kähler metric of holomorphic sectional curvature $2c$. Under the Abate–Patrizio curvature symmetry \[ \langleΩ(\cdot,\barχ)χ,χ\rangle =\langleΩ(χ,\barχ)\cdot,χ\rangle, \] this result gives Hermitian rigidity for nonzero constant holomorphic sectional curvature and the classification of complete simply connected metrics of negative curvature. As an application, we show that the Kobayashi metric of a bounded strongly convex domain with smooth boundary is Kähler–Finsler if and only if the domain is biholomorphic to the unit ball. We also prove that the universal cover of a bounded strongly pseudoconvex domain $D $ with smooth boundary is biholomorphic to the unit ball if and only if its Kobayashi metric is a smooth strongly pseudoconvex Kähler–Finsler metric. Furthermore, we give two explicit examples to illustrate the distinction between the weakly Kähler–Finsler and Kähler–Finsler conditions.

comments
18 pages, no figures
fields
Complex Variables
pdf ↗ page arXiv:2610.39989 ↗

We study probability measures on the space of holomorphic functions on the unit disk that are invariant under pre-composition by conformal automorphisms and give no mass to constant functions. We determine the slowest possible growth of functions supported by such measures. Let $M_f(R)$ denote the maximum modulus of $f$ on the hyperbolic ball of radius $R$ centered at the origin. We show that given a non-decreasing function $G:[1,\infty)\to(0,\infty)$, there exists an $\textrm{Aut}(\mathbb{D})$-invariant probability measure $μ$ on $\textrm{Hol}(\mathbb{D}, \mathbb{C}) \setminus \{\textrm{constant functions} \}$ such that $\log^+ M_f(R)=O_f(G(R))$ for $μ$ almost every $f$ if and only if $\int_1^\infty (R/G(R)) \, dR <\infty$. For the lower bound, we use a mass transport argument to show that almost every trajectory of the gradient flow of $\log |f|$ has finite energy. To establish sharpness, we construct holomorphic functions of slow growth on infinite Riemann surfaces.

comments
16 pages
fields
Complex Variables
pdf ↗ page arXiv:2610.40057 ↗

We consider a metric graph analog of a classical extremal problem for Riemann surfaces studied by Teichmüller, Jenkins, Strebel, and others. In particular, we prove that on any finite metric graph with a marked point, there is a unique open subtree which maximizes a metric graph analog of the reduced modulus, and we also give an equivalent characterization of this optimal subtree in terms of balanced harmonic measures.

comments
13 pages. No AI tools were used
fields
Complex Variables, Probability
pdf ↗ page arXiv:2610.40168 ↗

We give a parametrization of the class of real meromorphic functions in the plane for which the preimage of $\{0,1,\infty\}$ is contained in the real line, and all singular values belong to $\{0,1,\infty\}$. As corollaries, we obtain a new parabolic type criterion and prove that all such functions are limits of rational functions of the same class.

comments
13 pages
fields
Complex Variables
pdf ↗ page arXiv:2610.40202 ↗

We study Shimoda's theorem on the holomorphicity of a function $f(z,w)$ defined in a bidisc $U\times V=\left\{ \left| z \right|<1 \right\}\times \left\{ \left| w \right|<1 \right\},$ which is holomorphic with respect to $w\in V$ for each fixed $z\in U$ and is holomorphic with respect to $z\in U$ for each fixed $w\in E$, where $E\subset V$ is a countable set with at least one limit point in $V$. Shimoda proved that in this case $f(z,w)$ is holomorphic in $U\times V$ except for a nowhere dense closed subset of $U\times V$. We prove a converse: for any relatively closed nowhere dense set $S\subset U$ such that $\partial U\bigcup S$ is connected, there exists a function satisfying the conditions of Shimoda's theorem that is holomorphic in $(U\setminus S)\times V$ and doesn't extend holomorphically to any point of $S\times V$.

fields
Complex Variables
pdf ↗ page arXiv:2610.40381 ↗

Rings and Algebras16

We give a deterministic polynomial-resource black-box identity test for noncommutative algebraic branching programs (ABPs), using ordinary matrix evaluations of the output polynomial. Given an alphabet of size $m\ge1$ and an ABP vertex bound $S\ge1$, we construct one fixed tuple of integer matrices of order $R=(m+2)d(d+1)/2$, where $d=(m+2)S$, with entry bit length $O(d\log(d+1))$. Every nonzero polynomial computed by an ABP with at most $S$ vertices has a nonzero evaluation at this tuple. The construction accesses neither the hidden ABP nor its intermediate gates. A rectangular variant improves the order to $O(m^{3/2}S^2)$. Matrix order, description length, and all returned entries are counted; the total resources are polynomial. The result holds in characteristic zero and in characteristic $p>\binom d2$. The main ingredient is a fixed polynomial frame spanning the joint cyclic module of every matrix tuple from every prescribed vector. A compensating block makes a tagged encoding nilpotent of index at most three, while preserving the original cyclic module. A differential exterior-vector argument then gives a single triangular recurrence with polynomially many outputs. Its shared left-linear circuit is converted into actual integer query matrices by coefficient duality. Two-sided pairing further gives deterministic nonadaptive reconstruction of an equivalent ABP from polynomially many output-only matrix queries. The same frame gives polynomial-cardinality explicit trace separators for simultaneous-conjugation orbit closures, and a fixed nilpotent substitution for bounded-dimensional recognizable series. The latter also tests rational formulas whose given syntax is defined at the scalar origin. We provide complete proofs, construction costs, and exact implementation checks.

comments
24 pages. There's statement about reproducibility and Lean verification in section 5
fields
Rings and Algebras, Combinatorics
pdf ↗ page arXiv:2610.37677 ↗

We introduce a homotopical framework for Nijenhuis operators on semistrict Lie $n$-algebras ($n$-term $L_\infty$-algebras) for every $n \ge 1$ and, more generally, on arbitrary $L_\infty$-algebras. A Nijenhuis operator is defined as a family $N = (N_q)_{q \ge 1}$ of multilinear maps, with $N_1$ linear, realizing an $L_\infty$-morphism from an $N$-twisted copy of the structure to the original one. We prove that this condition is equivalent to the vanishing, at every arity $m$, of the $m$-th Nijenhuis torsion up to a correction term $Λ^N_m$ formed by higher-component substitutions, and we provide a closed combinatorial formula for $Λ^N_m$ as a sum over set partitions. Along the way, we show that the arity-$k$ Nijenhuis torsion factors canonically as a composite of $k$ commuting elementary slot deformations. The resulting objects form a category $\mathbf{NijLie}_n$; we establish that $\mathbf{NijLie}_m$ embeds as the full subcategory of $\mathbf{NijLie}_n$ on objects concentrated in the bottom $m$ degrees for all $m \le n$. These levels assemble into a tower whose first three stages are classical Nijenhuis Lie algebras, the Nijenhuis Lie $2$-algebras of Das, and the newly introduced Nijenhuis Lie $3$-algebras. We characterize the strict and skeletal objects at every level, introduce $n$-term representations up to homotopy of a Nijenhuis Lie algebra, and prove that the semidirect product construction establishes an equivalence between the category of such representations and split abelian $\mathbf{NijLie}_n$-extensions. Finally, two corrections to published level-three identities are documented, and all component identities up to arity five are verified via computer algebra.

fields
Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2610.37698 ↗

We classify the finite algebras $\mathbf{A}$ for which there is no value $p$ satisfying $\frac{1}{|A|}<p<1$ in the equational probability spectrum of $\mathbf{A}$. We will use the classification to determine which finite algebras have minimal equational probability spectrum. In our final section, we explore the relationship, for finite algebras, between the properties of (i)~having a finite equational probability spectrum and (ii)~being an abelian algebra.

comments
30 pages
fields
Rings and Algebras, Logic, Probability
pdf ↗ page arXiv:2610.37841 ↗

We construct ternary analogs of dendriform algebras and quadri-algebras, generalizing the well-known binary case. These new structures are defined in terms of nonsymmetric operads. We construct these new operads using ternary operations defined in terms of ternary Rota-Baxter operators. The relations defining these operads lie in the quadratic subspace of the kernel of a rewriting morphism from a free operad to the operad generated by one associative ternary operation and one (or two commuting) unary operators satisfying the ternary Rota-Baxter relation(s). We use computational algebra to compute a basis for the quadratic component of the kernel and thereby obtain the quadratic relations which define these new operads. In the dendriform case, we obtain 3 operations satisfying 10 relations. In the quadri-algebra case, we obtain 9 operations satisfying 50 relations. The latter computations combine modular and rational arithmetic, but we are able to provide certificates of the results which can be verified in characteristic 0.

comments
34 pages
fields
Rings and Algebras, Combinatorics
pdf ↗ page arXiv:2610.37848 ↗

Let $(K,v)$ be a Henselian valued field of rank one and of mixed characteristic $(0,p)$, with value group $Γ$ dense in $\mathbb{R}$ and residue field $k$. We compute all the graded pieces of the filtration induced by $v$ on the Milnor $\mathrm{K}$-theory modulo $p$ of $K$, in terms of the exterior powers of the $\mathbb{F}_p$-vector space $Γ/pΓ$ and of the modules of differential forms of $k$. This extends to the non-discrete setting a classical theorem of Kato concerning complete discretely valued fields. We also prove that, when $(K,v)$ is maximally complete, no class escapes this filtration by accumulating at a limit. As an application, we prove the inequality $\dim_p(K)\geq\dim_{\mathbb{F}_p}(Γ/pΓ)+\dim_p(k)$ between Kato's $p$-dimensions, and we show that it becomes an equality as soon as $(K,v)$ is maximally complete.

comments
42 pages. Comments welcome :)
fields
Rings and Algebras, K-Theory and Homology
pdf ↗ page arXiv:2610.37961 ↗

We study separable simplicial algebras and Azumaya simplicial algebras.

fields
Rings and Algebras
pdf ↗ page arXiv:2610.38229 ↗

Birkhoff and Pierce asked in 1956 whether the field $\mathbb{C}$ of complex numbers admits a lattice order compatible with addition and multiplication. We answer the question affirmatively. Using a valuation with value group $\mathbb{Q}$, we construct a positive cone $P$ by a transfinite recursion of countable ordinal length. At each stage we extend a lattice order on a subspace while preserving its lattice operations in the whole field and maintaining multiplicative closure of the ambient positive cone. These subspaces eventually exhaust $\mathbb{C}$. The construction depends on choices of a valuation extension, compatible rational powers and vector-space bases. The cone $P$ contains $1$ and satisfies $\{x\in P\setminus\{0\}:x^{-1}\in P\}=\mathbb{Q}_{>0}$. The induced order is not total: $i$ is incomparable with $0$. For a chosen transcendental element $t$ and $i^2=-1$, one may prescribe $0\vee i=(t+i)/2$ and $0\vee(-i)=(t-i)/2$. Varying the first extension yields exactly $2^{\mathbf c}$ distinct lattice positive cones on $\mathbb{C}$, where $\mathbf c=|\mathbb{C}|$. The count concerns cones as subsets of $\mathbb{C}$.

comments
24 pages, no figures
fields
Rings and Algebras
pdf ↗ page arXiv:2610.38300 ↗

Let $X$ be a nonempty set and $E$ an equivalence relation on $X$. The semigroup $T_E(X)$ consists of all transformations on $X$ that preserve $E$. Although the collection of all regular elements of $T_E(X)$ is not, in general, a subsemigroup, we investigate maximal regular subsemigroups of $T_E(X)$ containing the group of units $G_E(X)$. We construct two such maximal regular subsemigroups, denoted by $\mathcal{M}_1$ and $\mathcal{M}_2$, and show that their maximality holds in full generality for an arbitrary set $X$ and an arbitrary equivalence relation $E$ that is neither the identity relation nor the universal relation on $X$ (whether finite or infinite, uniform or non-uniform). Furthermore, when $X$ is finite and $E$ is a uniform equivalence relation with exactly two classes of cardinality at least $2$, we provide a complete classification by proving that they are the only maximal regular subsemigroups containing $G_E(X)$.

comments
19 pages, no figures
fields
Rings and Algebras, Group Theory
pdf ↗ page arXiv:2610.38341 ↗

We study entrywise powers of totally positive matrices. Our first question is which matrices remain totally positive under every positive Hadamard power. We call them eternally totally positive. Our second question concerns a fixed totally positive matrix: what is the smallest exponent after which all of its entrywise powers are totally positive? We call this number the Hadamard threshold of the matrix. Unlike the usual critical exponent, this threshold depends on the individual matrix. We give a complete characterization in order three, obtain explicit bounds for the transition exponent, and construct symmetric matrices that realize every threshold in $[0,1)$. We also prove the basic transformation rules and continuity of the threshold on the normalized $3\times3$ totally positive cone. For higher orders, we introduce the logarithmic core and use it to expand each minor near the zero exponent. This reduces the $4\times4$ problem to the full determinant and the $3\times3$ submatrices. For symmetric $4\times4$ matrices, we show that a positive-definite logarithmic core makes the full determinant positive for every positive exponent. A two-parameter Hankel family then realizes every threshold in $(1,2)$. Hence the exact range of thresholds in the symmetric order-four case is $[0,1)\cup(1,2)$; neither $1$ nor $2$ is attained. We also give a recursive symmetric ETP criterion in every order and an explicit classification for symmetric Toeplitz matrices of order four. In order five, a certified example exhibits an intermediate-power obstruction in a nonprincipal minor. An explicit order-three condition and a finite critical-point test give a complete order-five test.

comments
25 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2610.38757 ↗

We introduce NS-Leibniz bialgebras and establish their equivalence with matched pairs and Manin triples of NS-Leibniz algebras. In the coboundary case, skew-symmetric solutions of the NS-Leibniz Yang–Baxter equation yield NS-Leibniz bialgebras and correspond to $\mathcal{O}$-operators for the dual regular representation. We study quasi-triangular and factorizable structures, and relate factorizable tensors to quadratic Rota–Baxter NS-Leibniz algebras of any fixed nonzero weight. We also construct compatible bialgebra structures from skew-adjoint Nijenhuis operators commuting with the Rota–Baxter operator.

comments
38 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2610.39190 ↗

In this paper, we introduce and study averaging Zinbiel bialgebras. We first define representations of averaging Zinbiel algebras and prove a semi-direct product characterization. We then introduce matched pairs and Manin triples of averaging Zinbiel algebras, and characterize averaging Zinbiel bialgebras by these two structures. We show that every averaging Zinbiel algebra induces a pre-Lie algebra, and that every averaging Zinbiel bialgebra induces a pre-Lie bialgebra. We also study coboundary averaging Zinbiel bialgebras and introduce the \(S\) admissible Zinbiel Yang-Baxter equation. Its symmetric solutions give rise to averaging Zinbiel bialgebras. Finally, we investigate averaging operators on quadratic Rota-Baxter Zinbiel algebras and relative Rota-Baxter operators on averaging Zinbiel algebras.

comments
29 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2610.39220 ↗

We continue our investigation of certain associativity properties (namely, alternativity, power-associativity, or being a Jordan ring) of the non-associative multiplication defined on the Grothendieck group of the category of finite-dimensional Leibniz bimodules which we started in \cite{FW}. Namely, we prove that for every finite-dimensional non-zero Leibniz algebra over an arbitrary field this Grothendieck ring is not power-associative. As a consequence, the Grothendieck ring is also neither alternative nor a Jordan ring. This corrects and generalizes some of our results in the last section of \cite{FW}.

comments
7 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2610.39342 ↗

We prove that every local or 2-local derivation of the Block Lie algebra $\B(q)$, with both basis indices in $\Z$, is a derivation for all $q\in\C$. The proofs use the known description of ordinary derivations, Laurent polynomials, and coefficient comparisons.

comments
13 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2610.39741 ↗

Let $K$ be a field and $L_K(E,w)$ the Leavitt path algebra of a row-finite weighted graph $(E,w)$. Suppose that $L_K(E,w)$ is not isomorphic to an ordinary Leavitt path algebra. We prove that the ideal lattice of every countably generated unital $K$-algebra embeds as a closed interval into the ideal lattice of $L_K(E,w)$. The embedding preserves multiplication of ideals modulo the lower endpoint of the interval. It follows that the ideal lattice of $L_K(E,w)$ is not distributive and that ideal multiplication in $L_K(E,w)$ is not commutative. Moreover, we show that if $(E,w)$ is countable, then $L_K(E,w)$ has exactly $|K|^{\aleph_0}$ ideals, prime ideals, left primitive ideals, and right primitive ideals.

fields
Rings and Algebras
pdf ↗ page arXiv:2610.39842 ↗

A ring is right pure semisimple if every right module is a direct sum of finitely generated modules, and the pure semisimplicity conjecture asserts that every such ring is of finite representation type. In this article, a division ring extension $H\subseteq T$ is constructed such that the bimodule ${}_HT_T$ has right dimension sequence $(1,2,2,2,\dots)$ and $T$ is infinite-dimensional as a left $H$-space. The division ring $T$ is the union of the fraction division rings of the nearest-neighbour quantum Laurent algebras with parameter $1/2$, and $H$ is the image of $T$ under a compatible family of conjugations. The extension is controlled by right bases of every length and by two-sided flags of adjacent division subrings, which identify all iterated right duals up to explicit twists. It follows that the triangular ring $\left(\begin{smallmatrix}H&T\\0&T\end{smallmatrix}\right)$ is right pure semisimple but neither left pure semisimple nor of finite representation type, so that the pure semisimplicity conjecture fails.

code
github.com/oasisss6666/pure-semisimplicity-lean ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at e4905ea, checked 2026-10-30 build details
comments
10 pages. Lean 4 formalization of the main theorem: https://github.com/oasisss6666/pure-semisimplicity-lean . The repository includes an earlier manuscript snapshot corresponding to the formalization. Comments and corrections are welcome, especially concerning relevant work that may have been overlooked in the introduction
fields
Rings and Algebras
pdf ↗ page arXiv:2610.39883 ↗

We study local derivations and local automorphisms of finite-dimensional nilpotent complex Lie and right Leibniz algebras. We prove that every non-abelian Lie algebra in this class admits both a local derivation which is not a derivation and a local automorphism which is not an automorphism. The constructions use a derivation $D$ satisfying $0\ne D([L,L])\subseteq Z(L)$. For non-abelian right Leibniz algebras, both existence statements hold whenever the dimension is at most seven or the nilpotency class is at most four. We construct an eight-dimensional non-Lie algebra of class five satisfying $\LocDer(A)=\Der(A)$ and $\LocAut(A)=\Aut(A)$. Consequently, eight and five are the least possible dimension and nilpotency class, respectively, for either equality.

fields
Rings and Algebras
pdf ↗ page arXiv:2610.40348 ↗

Group Theory15

We investigate the reduced norm-one group $\mathrm{SL}_1(D)$ of a central division algebra $D$ of odd degree over $\mathbb{Q}$. Using the Brauer-Hasse-Noether theorem and the Margulis-Platonov theorem, we derive a criterion for abstract simplicity in terms of local division completions. For a division algebra of degree $15$ with local invariants $1/3$, $-1/3$, $1/5$, and $-1/5$, the construction yields a candidate example of an infinite, torsion-free, nonabelian simple linear group. This would provide an affirmative answer to Problem 16.78 of the Kourovka Notebook. The argument was generated using an AI system and has not yet been independently verified by human mathematicians.

fields
Group Theory
pdf ↗ page arXiv:2610.37703 ↗

We provide obstructions to the existence of quasiisometric embeddings of right-angled Artin groups into products of trees, hyperbolic spaces, and other right-angled Artin groups.

comments
21 pages. Split off and expanded from arXiv:2605.12300
fields
Group Theory, Metric Geometry
pdf ↗ page arXiv:2610.37824 ↗

Let $G$ be a finite group and $S$ be a subset of $G$ with $1\not\in S$. $S$ is called a $CI$-subset of $G$ if for any $T\subset G$, whenever $Cay (G,S)\cong Cay (G,T)$, there is an element $σ\in Aut(G)$ such that $S^σ=T$. For a positive integer $m$, $G$ is called an $m$-$CI$-group if all subsets $S$ of $G \setminus \{1\}$ with $|S|\leq m$ and $S^{-1}=S$ are $CI$-subsets. In this paper, we show that the generalized quaternion group of order $4n$ is a $4$-$CI$-group if and only if $n$ is odd.

comments
9pages,1f figure
fields
Group Theory
pdf ↗ page arXiv:2610.38470 ↗

In this article we prove that if $H$ is a normal subgroup of a finite group $G$ with $G/H$ cyclic, then the kernel of the transfer map $G/G' \longrightarrow H/H'$ equals $(G:H)$ times the order of the cokernel of the natural map $M(H) \longrightarrow M(G)$.

fields
Group Theory, Number Theory
pdf ↗ page arXiv:2610.38640 ↗

We prove that all affine Coxeter groups admit contractible Vietoris-Rips complexes. More precisely, for any affine Coxeter group $W_a$ there exists a finite generating set $A$ such that $\mathcal{VR}_t(W_a;A)$ is contractible for all $t\ge 1$. We prove this as a special case of a more general result about certain groups. Let $G$ be a group and $H$ a subgroup. A subgroup $F\le G$ is a supplement of $H$ in $G$ if $G=HF$. We prove that for $H\le G$ with $F$ a supplement of $H$ in $G$, for generating sets $A_H$ and $A_G$ of $H$ and $G$ satisfying certain conditions involving $F$, the Vietoris-Rips complexes $\mathcal{VR}_t(G;A_G)$ and $\mathcal{VR}_t(H;A_H)$ are homotopy equivalent for all $t\ge 1$. In particular this applies to affine Coxeter groups, since free abelian groups admit contractible Vietoris-Rips complexes. Beyond these general results, we also investigate affine Coxeter groups $W_a$ specifically using the standard generating set $S$, and prove contractibility of $\mathcal{VR}_t(W_a;S)$ for large enough $t$.

comments
20 pages, 3 figures
fields
Group Theory, Geometric Topology
pdf ↗ page arXiv:2610.38703 ↗

Chapman, Dinur, and Lubotzky recently introduced the theory of non-commutative error-correcting codes, generalizing classical coding theory to arbitrary groups via $δ$-robust subsets used to detect proper subgroups. Building on this foundation, this paper systematically studies an analogue of random codes for arbitrary groups, exploring the extent to which the classical Gilbert-Varshamov (GV) bound holds in this non-commutative setting. While random universal codes of linear size in free groups are shown to be asymptotically bad, we establish a complete characterization for general families of finite groups. Specifically, a family of finite groups admits good random codes (forming a GV family) if and only if it exhibits uniform polynomial maximal-subgroup growth. Furthermore, we provide explicit quantitative bounds on the rate and optimal distance range based on intrinsic parameters, proving that families of finite solvable groups always form GV families and determining the exact probabilistic rate for direct powers of a fixed finite simple group.

comments
18 pages, 1 table
fields
Group Theory, Information Theory
pdf ↗ page arXiv:2610.38804 ↗

For each $n\geq 2$, we construct a finitely generated group $W_n$ with a conjugacy class such that the conjugacy diagram of this class has exactly $n$ ends. For this class, we compute the quotient spaces of the space of derivations of the group algebra $\mathbb{C}[W_n]$ modulo quasi-inner and inner derivations, as well as the corresponding component of the first Hochschild cohomology.

comments
12 pages, 1 figure
fields
Group Theory, Rings and Algebras
pdf ↗ page arXiv:2610.38841 ↗

As another variation of profinite properties, we define the notion of natural profinite invariants: functorial invariants, inducing isomorphisms for every Grothendieck pair. We give a characterisation of when adjoint functors are natural profinite invariants and describe a strategy on how to disprove natural profinite invariance. By means of examples we show that the notions of profinite invariance and natural profinite invariances are logically independent.

comments
12 pages, any comments are welcome
fields
Group Theory
pdf ↗ page arXiv:2610.38991 ↗

We study complete regular dessins with underlying graph ${\mathcal K}_{2^e,2^f}$, where $e\geq f\geq 2$, whose automorphism groups are non-metacyclic. Together with the cases of coprime orders and odd-prime-power orders, this is one of the basic classes needed for Jones's open classification problem for regular dessins of complete bipartite graphs. Within the 2-power case, the present paper treats the subcase in which the commutator subgroup is cyclic; it is the first of three papers devoted to the non-metacyclic case. Our approach is group-theoretic. The automorphism group $G$ of a regular dessin of ${\mathcal K}_{2^e,2^f}$ admits an exact bicyclic factorization $G=\langle b\rangle\langle w\rangle$ of type $(2^e,2^f)$ with $\langle b\rangle\cap\langle w\rangle=1$. For a fixed group $G$, two exact generating pairs give isomorphic dessins exactly when they lie in the same orbit under ${\rm A}ut(G)$. Thus the classification reduces to three group-theoretic tasks: determining the isomorphism classes of the possible groups $G$, characterizing their exact bicyclic generating pairs, and computing $|{\rm A}ut(G)|$. Berkovich and Janko divided the relevant non-metacyclic groups, through parameterized presentations, according to whether the commutator subgroup is cyclic, contains a cyclic subgroup of index $2$, or contains a cyclic subgroup of index $2^r$ with $r>1$. However, their classification does not identify which parameter values in these presentations define isomorphic groups; this problem was raised by Janko in {J}. We carry out these steps for the cyclic-commutator case. This settles Janko's isomorphism-classification problem in this case and yields a complete classification and enumeration of the corresponding regular dessins.

comments
31 pages, no figures. This work was partially supported by NSFC: 12061092; Yunnan Applied Basic Research Projects: {202501AT070016}}
fields
Group Theory
pdf ↗ page arXiv:2610.39407 ↗

Let $A$ be a nonempty subset of a group $G$. A right subfactor relative to $A$ is a subset $B$ maximal under inclusion among those for which every element of $AB$ has a unique representation as $ab$, with $a\in A$ and $b\in B$. Left subfactors are defined analogously using $BA$. The infima and suprema of the cardinalities of right and left subfactors define four \emph{subindices}. A subset is called \emph{index-stable} if its four subindices coincide. For any infinite group $G$, every nonempty finite subset of $G$ is index-stable. For finite groups, the situation is more complicated. We prove that for a two-element subset of a finite group, the left and right subindices coincide pairwise. Let $A=\{x,y\}$ with $x\ne y$, and let $X$ be the cyclic subgroup generated by $x^{-1}y$. Then the lower subindex of $A$ is $|G:X|\cdot\lceil |X|/3\rceil$, and the upper subindex is $|G:X|\cdot\lfloor |X|/2\rfloor$. These formulas imply that $A$ is index-stable if and only if $|X|$ is one of $2,3,4,5,7$. For any two-element subset of a finite group $G$, the lower subindex is at least $\lceil |G|/3\rceil$, and the upper subindex is at most $\lfloor |G|/2\rfloor$. We establish necessary and sufficient conditions for equality in each of these bounds. All two-element subsets of a finite group are index-stable if and only if every element of the group has order $1$, $2$, $3$, $4$, $5$, or $7$. We give a complete structural classification of such groups.

fields
Group Theory
pdf ↗ page arXiv:2610.39463 ↗

We consider the problem of deciding whether or not there is an epimorphism from the class of finitely presented groups to a fixed finite group. We show this problem is $\mathsf{NP}$-complete when the target is a non-nilpotent dihedral group. This complements work of Kuperberg and Samperton (2018, Geom. Topol.) who showed the same result when the target is a fixed finite non-abelian simple group. We also include a survey of complexity and reduction results when the source and target are classes of finitely presented groups.

comments
12 pages. The present article was split from arxiv:2501.05283
fields
Group Theory
pdf ↗ page arXiv:2610.39487 ↗

We introduce a model of random semigroups analogous to Gromov's density model for random groups. For a fixed number $n\ge 2$ of generators and a density parameter $δ\in (0,1)$, we impose a uniformly chosen set of $\lfloor n^{2δl}\rfloor$ relations of the form $u=v$, where $u,v$ are distinct words of length at most $l$, and study the resulting semigroup as $l\to\infty$. We prove that, with overwhelming probability, above density $1/2$ the semigroup is trivial, while below density $1/2$ it contains a free subsemigroup of rank two, has a Golod-Shafarevich semigroup algebra over every field, and has a homomorphic image which generates a non-elementary hyperbolic group. We also show that the small cancellation condition $C(m)$ holds with overwhelming probability whenever $δ<1/2m$. Finally, for $n\ge 3$, at critical density $1/2$ we obtain a subsequential limiting distribution on finite semigroups, with positive mass at the trivial semigroup and unbounded support in size. This contrasts with random groups, which have order at most two with overwhelming probability at critical density.

comments
27 pages, comments are welcome!
fields
Group Theory, Probability
pdf ↗ page arXiv:2610.39673 ↗

Suppose we have a finite thick generalised quadrangle whose automorphism group $G$ acts primitively on both the set of points and the set of lines. Then $G$ must be almost simple. Furthermore, $\textrm{soc}(G)$ cannot be isomorphic to ${}^2 B_2(2^{2m+1})$ or ${}^2 G_2(3^{2m+1})$, where $m$ is a positive integer. In this paper, we show that $\textrm{soc}(G)$ cannot be isomorphic to ${}^2 F_4(2^{2m+1})$.

fields
Group Theory
pdf ↗ page arXiv:2610.39690 ↗

We give constructions of $κ$-existentially closed groups having few automorphisms, giving negative solutions to a question of Kaya and Kuzucuoğlu in the Kourovka Notebook.

fields
Group Theory
pdf ↗ page arXiv:2610.39700 ↗

We show that a discrete group is hermitian if and only if it is FC-hypercentral, that is, if and only if it does not have any nontrivial ICC quotients. In particular, a finitely generated group is hermitian if and only if it is virtually nilpotent. The main step is an elementary, self-contained proof that every hermitian ICC group is trivial, based on a finite-set separation property of nontrivial ICC groups.

comments
7 pages; preliminary version
fields
Group Theory, Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2610.40226 ↗

Commutative Algebra14

We study width over commutative noetherian local differential graded (DG) rings with bounded homology. We establish a derived width formula and prove amplitude inequalities for the derived completion of derived Hom and tensor products. As applications, we obtain Iversen's amplitude inequality and a criterion ensuring that regular sequences on a DG-module are regular on the DG-ring. These applications recover results for DG-modules with finitely generated homology and also hold for derived complete DG-modules. Finally, we characterize Cohen–Macaulay DG-rings by the existence of a bounded derived complete DG-module of finite injective dimension whose amplitude equals that of the DG-ring. This provides a version of Bass' conjecture for derived complete DG-modules.

comments
18 pages
fields
Commutative Algebra, Rings and Algebras
pdf ↗ page arXiv:2610.37878 ↗

We introduce and study the notion of End-semidualizing modules which are generalizations of semidualizing modules in the classical sense, and also extend the notion of $S-R$ semidualizing bimodules studied by Holm-White and Wakamatsu. By constrast with these notions, End-semidualizing modules exist abundantly. We characterize these modules by the inclusion of projective and flat modules in their Auslander class, or injective modules in their Bass class, and give criteria for when these Foxby classes satisfy the two-out-of-three property. Over commutative Noetherian rings, we prove base-change and duality results, and characterize local depth inequalities by the inclusion of all modules of finite flat or injective dimension in the corresponding classes.

fields
Commutative Algebra, Rings and Algebras
pdf ↗ page arXiv:2610.37924 ↗

Let $R$ be a normal $F$-finite ring of characteristic $p>0$. We show that one effective $\mathbb{Q}$-divisor $Δ$, with $K_R+Δ$ $\mathbb{Q}$-Cartier of index prime to $p$, computes the big test ideal. This answers a question of Schwede and Smith. More generally, we prove their conjecture that test module of a Cartier algebra acting on an ideal is the test module of a single map $ψ$ in the algebra and even the image of $ψ$. We prove a global version for schemes quasi-projective over an $F$-finite local ring as well. In particular, every such normal, locally strongly $F$-regular scheme admits an effective boundary $Δ$ for which $(X,Δ)$ is locally strongly $F$-regular and $K_X+Δ$ is $\mathbb{Q}$-Cartier of index prime to $p$.

comments
Comments are very much welcome!
fields
Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2610.38163 ↗

Let $(R,\mathfrak{m},k)$ be a commutative Noetherian ring which is either local or positively graded over the field $k$. We provide a method based on liftings for constructing free coresolutions of $k$ over $R$. We apply this method to twisted trivial extensions of the node $k[u,v]/(uv)$ to build a family of positively graded $k$-algebras of dimension $1$ over which $k$ is an infinite graded syzygy, resolving an open question of Iyengar in the negative. We also prove a formula for alternating sums of lengths of Ext modules when $R$ is positively graded, and use it to show that a graded free coresolution of $k$ cannot dualize to a resolution unless $R$ is Artinian Gorenstein.

fields
Commutative Algebra
pdf ↗ page arXiv:2610.38393 ↗

A polynomial Krull domain is a Krull domain contained between $\mathbb Z[X]$ and $\mathbb Q[X]$. The domains of this class are precisely the Noetherian integrally closed domains between these polynomial rings by a result of Heinzer, and they have been recently classified by Chang and the second author of this paper as rings of polynomials which are integer-valued over a finite set of ultrametric balls in $\mathbb C_p$, as $p$ ranges through the set of primes in $\mathbb Z$. We show here that every ideal class of a polynomial Krull domain contains a prime ideal. Furthermore, given such a Krull domain $R$, we prove that there exists a polynomial Krull domain $R'$ that is Dedekind, contains $R$ and has the same class group as $R$.

comments
any comment is welcome
fields
Commutative Algebra, Number Theory
pdf ↗ page arXiv:2610.38457 ↗

For a simplicial poset $P$, Stanley assigned the face ring $A_P$, which is the quotient of the polynomial ring $S:=K[t_x \mid x \in P \setminus \{\widehat{0} \}]$ by the ideal $I_P$. This is a generalization of Stanley-Reisner rings, but the grading of $S$ is more involved. Building on our previous paper, we further develop and complete the study of the local cohomology modules $H_{I_P}^i(S)$. In our categorical framework, $\mathrm{Ext}_S(A_P, S)$ ``encodes" all the information of $H_{I_P}^i(S)$. We treat $H_{I_P}^i(S)$ in a reasonably explicit way. In particular, Lyubeznik numbers $λ_{i,j}(A_P)$ can be simply expressed in terms of $[\mathrm{Ext}_S^*(\mathrm{Ext}_S^*(A_P,S), S)]_\bf{0}$, and depend only on the homeomorphism class of the underlying space of the CW complex associated with $P$ and $\mathrm{char}(K)$.

comments
27 pages, comments are welcome
fields
Commutative Algebra
pdf ↗ page arXiv:2610.38478 ↗

Let $S=\mathbb{K}[x_1,\ldots,x_n]$ be a polynomial ring over a field $\mathbb{K}$. For a polymatroidal ideal $I\subseteq S$ generated in degree $d$, we prove $$ω(I^{(s)})=\operatorname{reg} I^{(s)}=\operatorname{reg} I^s=sd\qquad(s\ge1),$$ where symbolic powers use all associated primes and $ω$ denotes the largest degree of a minimal generator. Thus every symbolic power has a degree resolution. The argument uses a regularity bound for supermodular prime intersections, obtained from Takayama's formula and a homological estimate for noncover complexes. For every nonzero proper squarefree monomial ideal $L$, we also show $\operatorname{reg} L^{(s)}\le s\min\{m,λ(L)-\operatorname{ht}L+1\}$, where $m$ counts the minimal primes and $λ(L)$ is the support size, and obtain equality for skeleton and pure skeleton ideals. Finally, for every $d\ge3$, we construct a simple graphic matroid whose basis ideal is generated in degree $d$ and has a second symbolic power that is not componentwise linear.

comments
16 pages, 1 figure
fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2610.38655 ↗

For finite $S \subseteq \mathbb{C}$, we study additive factorizations in $\mathbb{N}_0[S]$ and their behavior under adjoining generators. We construct rational and quadratic examples with infinitely many atoms but without atomicity, including a quadratic example in which every pure power of each generator is an atom. Adjoining generators algebraically independent over $\mathbb{Q}(S)$ preserves atomicity and the standard factorization properties, while unique factorization ascends from the individual monoids under joint linear disjointness for positive algebraic generators. Using the theorem of Evertse, Schlickewei, and Schmidt, we prove that positive real generators give finitely many factorizations of each prescribed length. Thus, bounded and finite factorization are equivalent, and half-factoriality implies finite factorization. We exhibit a set of two quadratic generators that separates half-factoriality from unique factorization and give an augmentation criterion for half-factoriality when every monomial is an atom. Lastly, we characterize complete integral closure for positive rational generators.

comments
16 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2610.39309 ↗

We study the depth of symbolic powers of edge ideals, focusing on local properties of graphs. First, we give several sufficient conditions for the symbolic depth function to be non-increasing, using local properties of graphs and local cohomology. Next, we give a counterexample to a conjecture of Minh, T.N. Trung, and Vu concerning the stable value of the symbolic depth function, where the difference between the conjectured value and the actual value can be arbitrary large. Finally, we study a conjecture of Muta stating the depth of a symbolic power of an edge ideal is at least that of the corresponding ordinary power. We prove it for graphs whose connected components are unicyclic or bipartite.

comments
22 pages,
fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2610.39630 ↗

In this paper, we show that every commutative von Neumann regular ring is a quotient of a characteristic-zero Bézout domain by its principal Jacobson radical. We then characterize the commutative semisimple rings that occur as quotients of Dedekind domains. For a finite product of fields $R=\prod_{i=1}^n k_i$, such a presentation exists exactly when the cardinals $|k_i|^{\aleph_0}$ are all equal. When this condition holds, the source may be taken to be a characteristic-zero semilocal principal ideal domain, and the quotient ideal may again be its Jacobson radical.

fields
Commutative Algebra
pdf ↗ page arXiv:2610.40185 ↗

We show that the local rings of quasianalytic Denjoy-Carleman classes need not be Noetherian. More precisely, we construct quasianalytic Denjoy-Carleman classes $C^M$ whose local rings $C^M(\mathbb{R}^d,0)$ are not Noetherian for any $d\geq 2$. Conversely, we exhibit quasianalytic classes whose local rings in dimension two are regular and Noetherian. Our approach is based on the problem of exact division: if $f=\varphi g$, where $f\in C^M$, $\varphi$ is real-analytic, and $g\in C^\infty$, under which conditions does it follow that $g\in C^M$? We introduce a quantitative scale-growth condition on the defining weight sequence $M$ and prove that exact division holds in two variables whenever this condition is sufficiently strong relative to the rate at which the nonreal branches of the complex zero set of $\varphi$ approach the real plane. We also construct quasianalytic weight sequences with prescribed growth thresholds and establish corresponding counterexamples to exact division. These yield nonclosed principal ideals and, consequently, non-Noetherian local rings.

fields
Commutative Algebra
pdf ↗ page arXiv:2610.40265 ↗

A dynamical system can be associated to the process of decomposing iterated Frobenius pushforwards of modules into indecomposable direct summands. Via this connection, we apply the theory of Markov chains to study asymptotic counts of multiplicities of indecomposable summands in the iterated Frobenius pushforwards of the given module, as the number of iterations grows. Our results recover and extend the existing results on the existence of the (generalized) F-signature due to Hashimoto–Symonds, Hashimoto–Kobayashi, Smith–Van den Bergh, Tucker, and Yao. We also develop further the theory of F-contributors, the modules for which the multiplicity grows at the maximal possible rate. As a key algebraic input, we define and develop strongly F-regular modules, extending Hochster–Huneke's notion of strongly F-regular rings. We use strongly F-regular modules to prove convergence of the relevant sequences and algebraically characterize F-contributors, when the underlying ring admits a module-finite strongly F-regular extension or has dimension at most two.

comments
Comments are welcome
fields
Commutative Algebra, Algebraic Geometry, Dynamical Systems
pdf ↗ page arXiv:2610.40392 ↗

The determinantal complexity of a polynomial is the order of the smallest matrix whose entries are polynomials of degree at most one and whose determinant equals the polynomial. A lower bound for the permanent in this measure is the algebraic form of the question whether the permanent is harder to compute than the determinant. Over the complex numbers, the best known lower bound grows cubically in the size of the permanent. It holds even when the permanent only has to be a limit of such determinants. I prove that the cubic lower bound holds over every algebraically closed field of odd characteristic $p$, with a constant that depends on $p$. Hence the cubic bound does not depend on characteristic zero. I also prove the bound for Pfaffians, which are square roots of determinants of skew symmetric matrices. Lower bounds for Pfaffians imply the same bounds for determinants. Further, I prove the bound, divided by $a$, for matrices whose entries are polynomials of degree at most $a$. All three results come from one lower bound for smooth hypersurfaces. I prove it in every characteristic by counting intersection points together with their multiplicities.

comments
18 pages; stand-alone; submitted to International Mathematical Research Notices
fields
Commutative Algebra
pdf ↗ page arXiv:2610.40484 ↗

We construct an explicit DG algebra structure on the minimal free resolution of the quotient of a polynomial ring by the edge ideal of any split graph (that is, a graph whose vertex set is a disjoint union of a clique and an independent set). The algebra structure is based on a simple combinatorial notion, which we call the fixing edge of a pair of edges, that directly captures the structure of the underlying graph. Our construction involves an explicit description of the minimal free resolution of the edge ideal of such a graph, including formulas for both the Betti numbers and the differentials.

comments
29 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2610.40540 ↗

Metric Geometry14

For the similarity kernel $e^{-|x-y|}$, we determine the probability measure of maximum diversity on every planar disk and three-dimensional ball, answering a question of Leinster and Roff. In each dimension the measure is uniform on the boundary up to a threshold. Above it, the support is a closed central ball and the outer sphere, separated by a mass-free annulus. In dimensions two and three, their conjecture of finitely many supporting spheres therefore holds only up to the respective threshold. We obtain the measure explicitly up to one scalar root in three dimensions and through Fredholm integral equations and a scalar contact equation in the plane. Computations in dimensions four and five suggest that interior supporting spheres appear one at a time.

comments
32 pages, 1 figure
fields
Metric Geometry, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.38031 ↗

The diagonals of a regular pentagon dissect it into eleven pieces and draw a pentagram; the dodecahedron dissected by the twelve face planes of its inner core gives Kramer's seven "elementary cells" of 1982. We define the stellation dissection of a golden regular polytope in any dimension as the dissection of the convex hull of its final regular stellation by the facet hyperplanes of the core, show that the core has phi^(-d) of the inradius of the hull for d = 2, 3, 4, and carry the dissection out for the first time on the 120-cell. The foundation is the arithmetic of the golden ring Z[phi], the ring of integers of Q(sqrt 5): vertices and hyperplanes live in Z[phi]^d, every orientation test is the exact sign of an element of Z[phi], decided with integers, and the pieces are named by sign vectors. We develop this foundation from scratch (conjugation, norm, units, the primes sqrt 5, 2, 3, the exact sign test, the lattice x -> (x, conj x), the vertex modules of the dodecahedron and the 120-cell, the icosian ring) and let it carry the geometry. The definition bifurcates in dimension four: the star cut at depth phi^(-4), a unit, has 2,455,201 cells in 338 orbits of H4; the hereditary cut at depth 1 - phi^(-4) = sqrt 5 / phi^2, a unit times the ramified prime, induces the three-dimensional dissection on every facet and has 8,161 cells in 8 orbits. New here: all vertices of the dodecahedral and of the hereditary dissection lie in the vertex module of the polytope being cut, whereas the star cut needs the denominators 2, 3 and 5; the seven kinds of pieces of the dodecahedron are exactly the I_h-orbits of sign vectors, with stellation layer equal to the number of plus signs. We catalogue the four-dimensional pieces and treat the circumscribed disc, ball and 4-ball. Every number quoted is recomputed exactly by a script whose output is reproduced in an appendix.

comments
37 pages, 14 figures; catalogue of the 338 orbits and the output of the exact checks in the appendices
fields
Metric Geometry, Number Theory
pdf ↗ page arXiv:2610.38369 ↗

In 1991, Laczkovich asked whether every measurable set of positive measure in $\mathbb R^d$ can be mapped onto a cube with a Lipschitz map. We show that the answer is positive for every $d$. Our results also give a positive answer for Kolmogorov's problem on contractions onto polygons with small measure loss in the case of Jordan measurable sets.

fields
Metric Geometry
pdf ↗ page arXiv:2610.38834 ↗

The Betke–Henk–Wills conjecture predicts a bound for lattice-point counts in terms of successive minima. Malikiosis introduced the discrete monotonicity property for normalized residue counts as a sufficient condition for this bound and its extension to nonsymmetric convex bodies. We prove that every compact convex set satisfies this property for lattice subgroups of rank at most two, in arbitrary ambient dimension.

fields
Metric Geometry
pdf ↗ page arXiv:2610.39026 ↗

We introduce $κ$-covering minima by requiring the permutation simplices of one independent lattice frame to fit into translates of a common dilate of a convex body. We prove a lower bound for their normalized product, with coefficient $(n+1)/2^n$ for centrally symmetric bodies and an explicit dependence on Minkowski asymmetry in general. On Euclidean balls, the supremum over full-rank lattices of the ratio of the resulting fitting radius to the covering radius has order $\sqrt n$. We also establish basic comparisons with classical lattice minima and bounds under products, projections, Minkowski addition, and free direct sums. We extend the definition by allowing projected periodic lattice triangulations. These extended minima agree with the classical covering minima on ellipsoids.

fields
Metric Geometry
pdf ↗ page arXiv:2610.39034 ↗

We prove that every bounded set of diameter one in four-dimensional Euclidean space can be covered by seven balls of diameter strictly smaller than $0.9999$. In particular, the Borsuk number satisfies $b_4\le7$. The proof combines geometric arguments based on contact points of the circumball with an exact finite computation. For small and large circumradius, the covering centres are constructed analytically. In the remaining range, a suitable triangle of contact points reduces the problem to a four-parameter family of ball polytopes. The parameter cube is subdivided into 23494 boxes. For each parameter box, candidate centres are found by nonlinear optimization, and the resulting covering is verified using exact rational interval arithmetic and paraboloid lifting.

fields
Metric Geometry, Combinatorics
pdf ↗ page arXiv:2610.39078 ↗

We show that a metric measure space $(X,d,\mathfrak{m})$ with finite upper $N$-density that satisfies $\mathsf{MCP}(K,N)$ is $N$-rectifiable. This removes a unique tangent requirement from arXiv:2505.01151.

comments
Comments welcome!
fields
Metric Geometry
pdf ↗ page arXiv:2610.39083 ↗

We study Lipschitz-volume rigidity for non-collapsed ${\rm RCD}(K,N)$ spaces, possibly with boundary. We prove that a measure-preserving $1$-Lipschitz map between such spaces restricts to an isometry from the interior of the domain onto its image, where the latter is equipped with the intrinsic length distance. We then characterize when this interior rigidity extends to an isometric bijection between the whole spaces, in terms of the behavior of the map on the boundaries. Along the way, we establish a rigidity result of independent interest in a more general class of rectifiable metric spaces.

comments
40 pages
fields
Metric Geometry, Differential Geometry
pdf ↗ page arXiv:2610.39493 ↗

In this work, we formalize the concept of intrinsic dimension of objective landscapes introduced in Li et al. (2018), which measures the structural complexity of learning problems by training along randomly generated subspaces. We define the intrinsic dimension of a set $Θ\subset\mathbb{R}^p$ as the minimal dimension $d_{\mathrm{int}}(Θ)$ such that a random plane of dimension $d_{\mathrm{int}}(Θ)$ in $\mathbb{R}^p$ intersects $Θ$ with probability one. We show that it is a generalized notion of co-dimension that depends on the global geometry of $Θ$. We study mathematical properties of the intrinsic dimension and develop techniques to estimate the intrinsic dimension of sets $Θ$ that arise in learning problems. More specifically, we derive upper and/or lower bounds where $Θ$ is the set of optimal parameters in student-teacher settings with shallow and deep ReLU networks, including finite and infinite sample cases, and with and without regularization. We discuss how our theory leads to novel types of generalization bounds, thereby showing that the intrinsic dimension is a measure of learning complexity. Our results connect techniques from seemingly different areas of machine learning research such as classification of symmetries of ReLU networks and stochastic geometry.

fields
Metric Geometry
pdf ↗ page arXiv:2610.39674 ↗

Petty conjectured that every n-dimensional real normed space contains n+1 equidistant points. The conjecture was proved in dimensions three and four by Petty and Makeev, respectively. We prove the five-dimensional case: every five-dimensional real normed space contains six equidistant points. The proof uses a bordism of equilateral configurations and a homological obstruction.

comments
21 pages
fields
Metric Geometry, Functional Analysis
pdf ↗ page arXiv:2610.39967 ↗

We investigate sub-Riemannian geodesic flows on 5-dimensional nilpotent Lie groups endowed with left-invariant Riemannian metrics. Up to isomorphism, there are exactly two such groups: the Heisenberg group $H_5$ and the 5-dimensional nilpotent Lie group with a 2-dimensional commutator subgroup. For each group, we study geodesic flows associated with both left-invariant (LL) and right-invariant (LR) distributions, deriving explicit descriptions of the corresponding geodesics and comparing their integrability properties. While the LL systems are known to be Liouville integrable, and even superintegrable, we show that LR systems are Liouville integrable only in two cases: on the Heisenberg group and, for the second group, on a distinguished invariant level set.

fields
Metric Geometry, Differential Geometry, Dynamical Systems
pdf ↗ page arXiv:2610.40013 ↗

This paper is about comparing the Gromov-Hausdorff distance between a pair of sets to the Hausdorff distance between the pair. Recent work on this problem has focused on two settings, Riemannian manifolds and metric graphs. Here, we focus on embedded submanifolds of Euclidean space endowed with the Euclidean metric. We prove that when $\mathcal{M}\subset\mathbb{R}^n$ is a compact connected embedded submanifold without boundary, with positive reach, and $\mathrm{A}\subset\mathcal{M}$ is a subset that is sufficiently dense in $\mathcal{M}$ with respect to the reach, the Gromov-Hausdorff distance between $\mathrm{A}$ and $\mathcal{M}$ is bounded below by $1/2$ of the Hausdorff distance between them. We extend this result in two ways. First, we show that the factor $1/2$ can be improved using Jung's theorem. Second, we prove bounds on the Gromov-Hausdorff distance for pairs of subsets of $\mathcal{M}$. When $\mathbb{S}^{1}$ is equipped with the two-dimensional Euclidean metric, the Gromov-Hausdorff distance between $\mathbb{S}^{1}$ and any sufficiently dense subset of $\mathbb{S}^{1}$ can be expressed explicitly as a function of the Hausdorff distance between the two. We use interleavings between geometric simplicial complexes, nerve lemmas, properties of reach and the nearest-point projection map, and the fundamental class to produce the inequalities for general $\mathcal{M}$. We use the Borsuk-Ulam theorem for $\mathcal{M}=\mathbb{S}^1\subset \mathbb{R}^2$.

comments
32 pages, 9 figures
fields
Metric Geometry, Algebraic Topology
pdf ↗ page arXiv:2610.40286 ↗

For a given $λ> 0$, a convex body in $\mathbb{R}^n$ is called $λ$-convex if it is the intersection of balls of radius $1/λ$. We show that among all $λ$-convex bodies in $\mathbb R^n$ of a given surface area, volume is minimized by the $λ$-convex lens, that is, the intersection of two balls of radius $1/λ$. This confirms a conjecture of Borisenko in all dimensions $n \geq 2$. Moreover, we extend this reverse isoperimetric inequality to all model spaces of constant curvature in arbitrary dimension and arbitrary $λ> 0$.

comments
24 pages, 3 figures
fields
Metric Geometry, Differential Geometry
pdf ↗ page arXiv:2610.40291 ↗

A metric space admits an almost bi-Lipschitz embedding into a Euclidean space if and only if it is almost homogeneous. We prove the sufficient direction, complementing the known necessary condition. More quantitatively, we bound the target dimension and the embedding constants for every logarithmic exponent $γ>1$. The bounds depend only on the covering parameters in the almost homogeneity condition. In particular every doubling metric space admits such an embedding. This answers a question of Margaris and Robinson and the almost bi-Lipschitz part of a question of Olson and Robinson. As a consequence, the difference set of the image is doubling, which answers the difference-set questions of Olson and Robinson and of Margaris.

comments
12 pages
fields
Metric Geometry
pdf ↗ page arXiv:2610.40601 ↗

Geometric Topology13

We give a constructive three-dimensional proof of Costantino and Thurston's universality theorem for fundamental shadow links. More precisely, every compact connected oriented three-manifold with empty or toroidal boundary can be obtained by integral Dehn filling along a subset of the boundary components of a fundamental shadow link exterior.

fields
Geometric Topology
pdf ↗ page arXiv:2610.37718 ↗

We construct a marked integral delooping of a connected quandle's covering monoid, realizing its rack space as a homotopy fiber. For finite connected quandles at primes $p$ not dividing a point-stabilizer order, we determine the local $A_\infty$ type and the ordinary rack cohomology shuffle algebra over fields of characteristic $p$. We compute integral quandle homology in all positive degrees for finite connected regular cyclic Alexander quandles and the tetrahedral quandle. At such primes dividing the quandle order, rack-space homotopy groups have exponentially many cyclic direct summands of fixed $p$-power order in each sufficiently large degree.

comments
33 pages, 1 figure
fields
Geometric Topology
pdf ↗ page arXiv:2610.38066 ↗

We determine the largest dimensions in which right-angled hyperbolic polytopes of finite volume can exist. The dimension is at most eight in general, and at most four when all vertices lie at infinity. Both bounds are attained, improving the previously known upper bounds of twelve and six. Our proofs use elementary properties of hyperbolic polytopes together with bounds for configurations of points on spheres.

code
github.com/sashakolpakov/CoxeterPolytopes ∎ Lean project (formal/lakefile.toml, formal/lean-toolchain) builds, no sorry at 36eeadd, checked 2026-10-30 build details
comments
6 pages; GitHub repository at https://github.com/sashakolpakov/CoxeterPolytopes/
fields
Geometric Topology, Metric Geometry
pdf ↗ page arXiv:2610.38900 ↗

It has been of particular interest in recent years to relate categorifications of quantum knot invariants like the Jones polynomial to Floer-theoretic invariants like knot Floer homology using spectral sequences. In pursuit of Rasmussen's conjecture, Dowlin constructed a family of invariants with properties like those of Khovanov and Rozansky's $\mathfrak{sl}_n$-homology theories. In this paper, we explore these invariants for $L$-space knots and thin knots. In particular, for $n\geq 2$ the invariants of thin knots can be computed from a change of coefficients from the minus flavor of knot Floer homology, and the same holds for an $L$-space knot exactly when an explicit condition relating $n$ to its Alexander polynomial is satisfied.

fields
Geometric Topology
pdf ↗ page arXiv:2610.38927 ↗

We construct an infinite family of smooth 2-component links of 2-spheres $Σ_k\subset S^2\times S^2$ whose respective components are smoothly concordant but which are pairwise not topologically concordant in any topological $\mathbb{Z}$-homology cobordism. In particular, the $Σ_k$ are pairwise non-concordant in $(S^2\times S^2)\times[0,1]$.

comments
10 pages, 2 figures
fields
Geometric Topology
pdf ↗ page arXiv:2610.38979 ↗

We show that every bounded discrete harmonic function with respect to the cotangent Laplacian on a Delaunay triangulation of the Euclidean plane is constant; equivalently, the cotangent-weighted triangulation has the Liouville property. Our main theorem establishes this property for a more general class of connected weighted geometric graphs in the plane. Furthermore, we show that a planar Delaunay triangulation with cotangent weights could be transient but is recurrent if edge lengths are uniformly bounded.

comments
16 pages, 4 figures
fields
Geometric Topology
pdf ↗ page arXiv:2610.39242 ↗

Ohyama, Taniyama and Yamada showed that finite type knot invariants are insensitive to the unknotting number: for any integer n and any knot K, there is an unknotting number 1 knot which cannot be distinguished from K by any finite type invariant of order $\le n$. We generalize this result in three directions. First, we prove an analogous result for all higher order unknotting number given by $C_n$-moves. Second, we give several extensions to the link case. Third, we show that a similar result holds for ribbon 2-knots.

comments
18 pages; no AI tools were used at any stage
fields
Geometric Topology
pdf ↗ page arXiv:2610.39474 ↗

The complement of a knot in $\mathbb{S}^3$ is a fundamental object in $3$-manifold topology and serves as a primary building block in the study of geometric structures on manifolds. For a large class of knots, these complements admit complete hyperbolic metrics, motivating the development of various frameworks for their classification and analysis. A twist knot is formed by applying a series of half-twists to a closed loop and linking the ends. In this article, we present explicit topological and combinatorial descriptions of all twist knot complements via the construction of suitable cell structures. Our method produces a closed $3$-dimensional pseudomanifold with a single vertex, arising from prescribed face pairings of a faceted $3$-ball. Removing the vertex yields the complement of the corresponding twist knot. The construction naturally induces ideal triangulations of these knot complements, several of which are shown to be facet-minimal. Beyond providing concrete models, our approach offers new perspectives on the topology of knot complements and leads to some open research problems.

comments
23 pages, 6 figures
fields
Geometric Topology, Combinatorics
pdf ↗ page arXiv:2610.39593 ↗

Let $B$ be a quaternion division algebra over a number field $k$ that gives rise to arithmetic Fuchsian or Kleinian groups, and let $\mathcal{O}$ be a maximal order of $B$. We show that every closed orientable Riemannian manifold isospectral to a principal congruence hyperbolic surface $X_\mathcal{O}(\mathfrak{a})$ is isometric to $X_{\mathcal{O}'}(\mathfrak{a})$ for some maximal order $\mathcal{O}'$ of $B$, provided that no prime factor of $\mathfrak{a}$ ramifies in $B$ and that $\mathfrak{a}$ satisfies a mild condition at the primes over $2$. This is a converse to the construction of Vignéras, which produces isospectral manifolds from maximal orders of different types. In particular the spectral genus of $X_\mathcal{O}(\mathfrak{a})$ has at most $t(B)$ elements, and $X_\mathcal{O}(\mathfrak{a})$ is spectrally rigid when the type number $t(B)$ is one. In dimension three we prove the same statements for manifolds that, in addition, have the same complex lengths of closed geodesics. The proof rests on a local result that characterizes, by traces alone, the subgroups of $\mathrm{SL}(2)$ over a $p$-adic ring that are conjugate into a principal congruence subgroup by traces. As applications, every principal congruence Hurwitz surface is spectrally rigid, among them Klein's quartic, the Fricke-Macbeath surface and the surfaces of the first Hurwitz triplet, which partially answers a question of Reid.

comments
v1. 16 pages
fields
Geometric Topology, Differential Geometry, Number Theory
pdf ↗ page arXiv:2610.39874 ↗

We prove that every representation of a closed surface group of genus at least $3$ into $\mathrm{PSL}(2,\mathbb{R})$ that is sufficiently close (but not equal to) a representation that has non-compact solvable image has a simple closed separating curve that is mapped to a non-trivial elliptic element in $\mathrm{PSL}(2,\mathbb{R})$. This can be seen as evidence for an affirmative answer to a question of Bowditch and a conjecture of Goldman.

comments
13 pages, 2 figures
fields
Geometric Topology
pdf ↗ page arXiv:2610.40040 ↗

By Gilmer's splitting lemma, the linking form of a rational homology sphere that bounds a 4-manifold is the orthogonal sum of a metabolic summand and a summand presented by a form of the rank of the intersection form. The lemma underlies Gilmer's slice genus theorem and the rank criteria of Murakami-Yasuhara and Gilmer-Livingston for nonorientable surfaces and the 4-dimensional clasp number. We show that the lemma and these results, as stated, are false. For each prime $p \equiv 3 \pmod 8$ we construct knots bounding smooth Möbius bands, and knots bounding smooth punctured tori with clasp number one, whose linking forms have no such summand of rank at most two. We then determine what remains true: the lemma holds up to Witt equivalence and for cube-free orders, and its conclusions about summands hold away from exceptional primes and for orientable surfaces of genus at least two. Finally, we find the optimal Witt-class bound for the topological nonorientable 4-genus.

fields
Geometric Topology, Mathematical Physics, Algebraic Topology
pdf ↗ page arXiv:2610.40183 ↗

For split links the even Khovanov spectrum is a smash product of the spectra of the pieces; the odd one is not. For $T(2,m)\sqcup T(2,n)$ we show that the odd spectrum is, in each quantum grading, a wedge of spheres and copies of a suspension of $\mathbb{CP}^{2}$. Using the skein cofiber sequence at the level of spectra, we prove that for fixed $q-m-n$ the number of these copies is determined by finitely many small links and stabilizes for large $m$ and $n$. The $\mathbb{CP}^{2}$ summand of $T(2,3)\sqcup T(2,3)$, due to Schütz and Rajapakse, persists in quantum grading $m+n+8$ for all $m,n\ge3$. We conjecture that the number of copies of $\mathbb{CP}^{2}$ equals the number of copies of $\mathbb{RP}^{2}\wedge\mathbb{RP}^{2}$ in the even spectrum.

comments
37 pages, 6 figures, 2 tables
fields
Geometric Topology, Algebraic Topology
pdf ↗ page arXiv:2610.40245 ↗

We generalize a method devised by Mark and Paupert for finding group presentations of the single-cusped standard Picard modular groups $\text{PU}(2, 1; \mathcal{O}_d)$, where $\mathcal{O}_d$ is the ring of integers of $\mathbb{Q}(i\sqrt{d})$, to a more general class of lattices in $\text{PU}(2, 1)$. As an application, we give presentations for the so-called \textit{sisters} of the standard Picard modular groups for $d=3, 7,$ and $11$. In particular, this shows that the sister of $\text{PU}(2, 1; \mathcal{O}_7)$ is a perfect group.

comments
25 pages
fields
Geometric Topology, Group Theory
pdf ↗ page arXiv:2610.40568 ↗

Algebraic Topology10

We compute the $RO$-graded Tambara functor of $H\underline{\mathbb{Z}}$ for every finite cyclic group. We introduce a valuation language for homotopy groups: for prime-power cyclic group equivariant, classes are represented by compatible vertex arrays or by edge arrays. In these coordinates we compute products, restrictions, transfers, Weyl actions, and norms. Then we assemble the results into arbitrary finite cyclic group equivariant case. Besides the computation, we also develop the Tate compression theory, which is used in the computation. The Tate compression diagram cut an equivariant spectra into several layer, which the homotopy group can be describe directly by each layers. From it we also give a filtration for $π_\star(H\underline{\mathbb{Z}})$, compatible with products, restrictions, transfers, Weyl actions, and norms.

comments
73 pages
fields
Algebraic Topology
pdf ↗ page arXiv:2610.37885 ↗

Given an orientable rank-$d$ vector bundle over a $d$-manifold, the Euler class is the unique obstruction to finding a nowhere-zero section. An equal norm Parseval frame is a certain collection of sections, one of whose properties is that the lengths of each vector at each point are equal. This makes the Euler class an obvious obstruction to finding such a frame. In this work we show that this is the only obstruction so long as the number of sections is at least $2d+2$. We also identify precise obstructions when the number of sections is $2d$ and produce examples showing that for smaller numbers of sections it is sometimes impossible to find Parseval frame fields.

comments
23 pages. Comments Welcome
fields
Algebraic Topology, Functional Analysis
pdf ↗ page arXiv:2610.38669 ↗

We verify that saturated complicial sets model the right limit of the $\infty$-categories of $(\infty,n)$-categories, whereas the canonical comparison with the left limit is not an equivalence. By contrast the category of strict $ω$-categories is equivalent to both the right and left limits of the categories of strict $n$-categories.

fields
Algebraic Topology, Category Theory
pdf ↗ page arXiv:2610.38698 ↗

Fiedorowicz conjectured that every finite simply connected CW complex is homotopy equivalent to the classifying space of a finite monoid. We prove this conjecture. Our main construction takes a finite monoid M and a map from a finite connected CW complex into the classifying space of M, and produces a new finite monoid whose classifying space is homotopy equivalent to the mapping cone of the given map. Applying this construction successively to the attaching maps of a finite CW model proves the result. As an explicit example of the algorithm, we construct a 1795-element monoid whose classifying space is homotopy equivalent to two dimensional complex projective space.

comments
19 pages
fields
Algebraic Topology, Group Theory, Rings and Algebras
pdf ↗ page arXiv:2610.38760 ↗

The Freudenthal Suspension Theorem states that the connectivity of the unit map $X\rightarrowΩΣX$ of the suspension-loop adjunction for a pointed space $X$ is twice the connectivity of $X$ itself. We extend this theorem to $X$ being a pointed $(\infty,\infty)$-category, i.e. an oriented space in the sense of Gepner–Heine.

comments
18 pages
fields
Algebraic Topology, Category Theory
pdf ↗ page arXiv:2610.38949 ↗

We give a new proof of the generalized Segal conjecture for the cyclic group of prime order p, i.e. the fact that the Tate diagonal of any bounded below spectrum is a p-completion. The idea, inspired by Hahn and Wilson's argument, is to use descent along the equivariant map from the p-fold tensor power of the field with p elements to its topological Hochschild homology. The only computational input that we use is the calculation of the homotopy rings of this topological Hochschild homology and its Tate construction, together with the map induced by the cyclotomic Frobenius.

comments
5 pages, 2 figures
fields
Algebraic Topology, K-Theory and Homology
pdf ↗ page arXiv:2610.39440 ↗

We investigate equivariant affineness in spectral algebraic geometry: the phenomenon where $\infty$-categories of quasi-coherent sheaves of a spectral stack are equivalent to $\infty$-categories of modules over an equivariant ring spectrum. In the nonequivariant case, this is known as 0-affineness, and has been studied by Gaitsgory, Mathew–Meier, amongst others. Allowing for equivariant phenomena opens up a much wider class of spectral stacks to be studied through the lens of spectra. The spectral stacks at the heart of our analysis are oriented elliptic curves, their associated Hilbert schemes, and related constructions. When working over the universal base, so the moduli stack of oriented elliptic curves, we show that these spectral stacks are $U(1)$-, $U(n)$-, and $SU(n)$-equivariantly affine, with associated $G$-ring spectrum Gepner–Meier's equivariant topological modular forms $\mathrm{TMF}_G$. Our results also encompass the groups $Sp(n)$ as well as all finite products of such groups. Our most general result is a relative statement over an arbitrary base stack. These results can be viewed as an integral and global refinement of Greenlees' algebraic model for modules over rational $U(1)$-equivariant elliptic cohomology.

comments
58 pages + appendices and references. Comments are welcome!
fields
Algebraic Topology, Algebraic Geometry, K-Theory and Homology
pdf ↗ page arXiv:2610.39583 ↗

Across mathematics, formality results are usually established through general criteria rather than by constructing explicit equivalences. These criteria include domination, puncturing, highly-connected formality, intrinsic formality, formality descent, formality in families, purity, etc. In this article, we prove that all these criteria are instances of a single theorem, formality transmission. This unifying framework allows us to extend these criteria in several directions, beyond characteristic zero and to differential graded algebras over operads or properads, leading to diverse new formality results.

comments
36 pages
fields
Algebraic Topology, Algebraic Geometry, Quantum Algebra
pdf ↗ page arXiv:2610.39767 ↗

We prove a projection formula for homotopy fixed points of trivial actions of finite $p$-groups. More precisely, for every bounded-below, $p$-complete spectrum $X$ whose mod-$p$ homology is $I$-complete, the canonical map \[ (\mathbb S_p)^{BG}\otimes X \overset{\simeq}{\rightarrow} X^{BG} \] is an equivalence for every finite $p$-group $G$, where $I$ is the augmentation ideal of the Steenrod algebra. Building on earlier joint work with Burklund, our proof combines the Adams–Gunawardena–Miller calculation with an adaptation of Carlsson's induction. As an application, using the work of Yuan, we construct height-one semiadditive lifts of such spectra and show that their cohomology of $p$-finite spaces depends only on the $1$-type.

fields
Algebraic Topology
pdf ↗ page arXiv:2610.40209 ↗

We show that all compact hyperkähler manifolds are bigraded strongly formal in the sense of Milivojević and Stelzig, proving that in the context of pluripotential homotopy theory they play the same role as compact Kähler manifolds in rational homotopy theory. Indeed, the main result arises from general algebraic considerations on categories of objects with more differentials, that of multicomplexes and commutative $n$-differential graded algebras. For them we discuss a standard model category structure, introduce a generalization of the $\partial\bar{\partial}$-Lemma and establish an algebraic formality theorem.

comments
Comments are welcome!
fields
Algebraic Topology, Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2610.40639 ↗

Logic10

We investigate the relationship between base-extension semantics, Beth semantics, and Prawitz's ecumenical logic. We first present a base-extension semantics for the propositional fragment of Prawitz's system and prove that it is sound and complete. The semantics interprets intuitionistic and classical operators directly within a common proof-theoretic framework, without reducing the classical operators to their intuitionistic counterparts by means of a translation. We then analyse the effect of incorporating Beth-style clauses into base-extension semantics. When arbitrary bases are admitted and $\bot$ is governed by atomic explosion, these clauses trivialise. By contrast, when $\bot$ is treated as a basic sentence and attention is restricted to consistent bases, the Beth-style clauses for atoms and disjunction characterise, respectively, classical atoms and classical disjunction in Prawitz's system. We also obtain equivalent, path-independent formulations of the classical clauses for atoms, disjunction, and implication. These results reveal that the consistency constraint is not merely a technical restriction: within base-extension semantics, it transforms clauses originally associated with intuitionistic semantics into semantic characterisations of classical operators.

fields
Logic
pdf ↗ page arXiv:2610.38871 ↗

We show that, in ZF set theory, the existence of "coset correct means" on all groups is equivalent to the Hahn-Banach Theorem, as well as to the existence of invariant means on abelian groups.

comments
5 pages, comments welcome!
fields
Logic, Functional Analysis, Group Theory
pdf ↗ page arXiv:2610.38944 ↗

We give an example of a directed set whose Tukey spectrum is not closed under stationary limits. This is a counterexample to a theorem due to Isbell from the 60's. We isolate a combinatorial principle arising from our example, between stationary reflection and weak compactness.

comments
23 pages, comments are welcome!
fields
Logic
pdf ↗ page arXiv:2610.38947 ↗

We look at a two-variable logic over finite graphs that allows Presburger quantifiers: linear arithmetic inequalities between the number of elements that satisfy subformulas. The prior literature shows that closing two-variable logic under Presburger quantification leads to undecidability, while closing under \emph{local quantification} -- the counts are always over neighbors of a given node -- preserves decidability. Here we show decidability of satisfiability for an intermediate logic that allows both local counts and global counts, but where the linear constraints do not mix the two. The proof requires a significant extension of the prior machinery developed for two-variable logic with counting. As a corollary we obtain decidability of satisfiability for an important family of Graph Neural Networks (GNNs). GNNs are a popular graph learning formalism. For example, in a variation of GNNs considered in the past literature, local aggregation is used in each layer to create modified values at each vertex of a graph, and then global aggregation is used in a final layer to obtain a single numerical value for the graph as a whole. Our logic is motivated by the fact that mixing of local counting and global aggregation in GNNs has been shown to lead to undecidability. Our results here show that if global and local aggregation are separated, one regains decidability. Decidability of other static analysis problems, like equivalence of GNNs, follows from the decidability of satisfiability.

fields
Logic
pdf ↗ page arXiv:2610.39108 ↗

Given a real $x\in 2^ω$, how many reals are there that are simpler (or equally simple) to describe than $x$. With ``simpler to describe" characterized by $K$-complexity of initial segments (hence we call such $y$ with $y\leq_K x$ a solution to $x$), if $x$ is infinitely often $K$-trivial (hence i.o. $K$-trivial), then a simple counting argument shows that the number of solutions to $x$ is countable. If $x$ is non i.o. $K$-trivial, then must it admit uncountably many solutions? Motivated by this question, we show that: (1) There is a non i.o. $K$-trivial $x$ such that most of its solution is i.o. $K$-trivial. i.e., Only countably many solution to $x$ are non i.o. $K$-trivial. In particular, the cardinality of $K$-degree of $x$ is countable. (2) There is a minimal pair of K-degree (meaning their common solutions are all $K$-trivial) so that each of the pair is non i.o. $K$-trivial, generalizing a result of Csima and Montalbán (where the pair is not required to be non i.o. $K$-trivial but non $K$-trivial). (3) There is a non i.o. $K$-trivial $x$ whose $Δ_K$ complexity grows arbitrarily slow (in a weak sense: $\inf_{m\geq n}Δ_K(x\upharpoonright m)\leq h(n)$ with $h$ a given unbounded and nondecreasing function) such that $x$ admits uncountably many solutions. (4) An ample excess lemma holds for non i.o. $K$-trivial. Namely: $$ \sum_n 2^{-(K(x\upharpoonright n)- \log_2 n)}<\infty. $$ for all non i.o. $K$-trivial $x$. Actually, this even holds for non i.o. $b$-$K$-trivial with $b$ only depends on the universal prefix free machine. The same argument also gives a constant complexity return phenomenon for $K$-trivial where this constant only depends on the universal prefix free machine.

fields
Logic
pdf ↗ page arXiv:2610.39172 ↗

Can random real carry arbitrary information. In terms of (Turing) computability, Kučera and Gács addressed this question in affirmative. i.e., Every real $x\in 2^ω$ is computable from some Martin-Löf random real. This result motivated quantitative versions of coding into random reals. i.e., How many bits of the random oracle are needed to compute the first $n$ bits of $x$. Barmpalias and Lewis-Pye obtained a coding that uses $n+O(\log n)$ many bits. Is it possible for the coding to use $n$ bits exactly? This is equivalent to say, if every real is $rK$-reducible to a Martin-Löf random real. In this paper, we prove that such a coding does not exist. i.e., There exists some real that is not $rK$-reducible to any Martin-Löf random real.

fields
Logic
pdf ↗ page arXiv:2610.39174 ↗

We study finite-terminating, address-only step recursion on the nonnegative reals, from zero, unit successor and projections. For reduced positive rational strides $s=a/q$ and $t=b/v$, we prove $\mathcal{C}s\subseteq\mathcal{C}t$ if and only if $q$ divides $v$, for both the bounded and unbounded algebras $\mathcal{C}\in{\mathcal{B},\mathcal{U}}$. The bounded compiler preserves earlier global majorants on every auxiliary input. Mixed rational stride sets are classified by least common denominators and supernatural denominators. Primitive-recursive translated-coordinate grid codes characterize the unbounded algebras and yield $\mathcal{U}{1/q}\cap\mathcal{U}{1/v}=\mathcal{U}{1/\gcd(q,v)}$. For bounded intersections, we prove an exact reduction: all corresponding identities hold if and only if the single identity $\mathcal{B}{1/2}\cap\mathcal{B}_{1/3}=\mathcal{B}_1$ holds, equivalently if the Boolean parts of the integer successor and addition algebras under scalar bounded recursion coincide. A Boolean reconstruction reduces general functions to predicates; a clipped fine-grid simulation with a frozen global resource bound identifies the union of predicate precision classes with the addition level. These reductions do not decide the resulting predicate equality, so literal bounded intersections remain unresolved. We also prove that unbounded-program equality is $Π^0_1$-complete and extensional bounded-algebra membership is $Σ^0_2$-complete. The model has no free real arithmetic or Zeno limits; semantic majorant validity is distinguished from syntax transformation.

fields
Logic
pdf ↗ page arXiv:2610.39746 ↗

For a strictly increasing $G:\mathbb{N}\to\mathbb{N}$ with $G(0)\geq 1$, we study minimal-basis function algebras generated by recursion along generalized inverses of its iterates. Bounded recursion requires an earlier pointwise majorant; unbounded recursion has no such requirement. If the orbit $G^{[t]}(0)$ has no polynomial upper bound, we obtain exact fixed-function membership spectra, reverse-divisibility inclusion, and indexed intersections that need not be single-stride algebras. Every finite divisibility-downset is realized in both regimes, and mixed strides admit fixed functions expressing any finite monotone Boolean condition on their additive stride monoid. For every generator, the realized bounded spectra form a bounded meet-semilattice: a construction sharing a bounding input coordinate realizes finite intersections without an unrestricted selector. Polynomial orbit growth is equivalent to definability of each of ordinary predecessor, unary doubling, and addition in any fixed unbounded stride algebra. In this case the algebra is ordinary primitive recursion relative to its inverse map, giving full collapse for primitive-recursive $G$. Ordinary predecessor belongs to a bounded stride algebra exactly when the orbit is polynomially bounded and $G$ has bounded successive differences; equivalently, ordinary bounded recursion embeds. A locality obstruction explains the additional bounded requirement, and two primitive-recursive generators with quadratic orbits have opposite bounded collapse behavior.

fields
Logic
pdf ↗ page arXiv:2610.39774 ↗

A \emph{Johnson graph} $J(n,k)$ is a graph whose vertices are the $k$-element subsets of an underlying set of size $n$ where two vertices are adjacent if they intersect in a subset of size $k-1$. We extend the definition to allow infinite parameters and we study a natural limit theory $T_{\mathcal{J}}$ of Johnson graphs. We show that $T_{\mathcal{J}}$ is complete and we give an axiomatisation of $T_{\mathcal{J}}$, from which we obtain a complete description of the models of $T_{\mathcal{J}}$. We use this to show tameness properties of $T_{\mathcal{J}}$, namely that $T_{\mathcal{J}}$ is $ω$-stable of Morley rank $ω$, but not monadically dependent. In particular it follows that the class of all finite Johnson graphs is stable, and therefore dependent but not monadically dependent.

fields
Logic
pdf ↗ page arXiv:2610.40054 ↗

Given a collection of mathematical objects and a natural notion of equivalence (such as isomorphism), we want to find a complete classification. This paper presents methods for proving anti-classification results, that is, when a complete classification is not possible using certain classifying invariants. The problem of using real numbers as classifying invariants is well understood. In this case, the obstruction to classifiability is ergodicity. We consider classifiability by higher rank objects, such as countable sets of real numbers, and present a simple ergodicity-like obstruction for classifiability. This method is particularly useful when applied in various models of ZF where even weak fragments of the axiom of choice fail.

fields
Logic
pdf ↗ page arXiv:2610.40440 ↗

Quantum Algebra10

In this note, we illustrate our recent results regarding structure theory of orthogonal Quantum Matrix algebras \cite{OP-BMW,OP-reciprocal,OP-ortho} using the simplest nontrivial example: the RTT-algebra associated with the canonical orthogonal R-matrix of type $O(3)$ (see, e.g., \cite{FRT}). By introducing a suitable linear order on the set of generators, we obtain a set of quadratic relations defining the algebra. Next, we investigate relations among its higher-degree polynomials. As a result, we verify `in components' the Cayley-Hamilton and the reciprocal relations, obtained earlier with the use of the R-matrix techniques. We explicitly calculate the coefficients of the characteristic polynomials of quantum matrices and propose a conjecture regarding the form of the Hilbert-Poincaré series for the RTT-algebra.

fields
Quantum Algebra, Mathematical Physics, Rings and Algebras
pdf ↗ page arXiv:2610.37813 ↗

We prove a Poincaré–Birkhoff–Witt theorem for the distinguished affine super Yangian $Y=Y_{1/2,1/2}(\widehat{\mathfrak{sl}}(m|n))$, where $m,n\geq2$ and $m\neq n$. With respect to the current filtration, there is a canonical isomorphism \[ \operatorname{gr}_F Y\cong U\!\left(\operatorname{uce}\!\left( \mathfrak{sl}(m|n)\otimes\mathbb C[z^{\pm1},u] \right)\right), \] where $\operatorname{uce}$ denotes the universal central extension. For any totally ordered classical basis homogeneous in parity and current degree, ordered supermonomials in arbitrary fixed filtered lifts form a vector-space basis of $Y$, with odd exponents restricted to zero or one. The proof identifies the classical presentation through Steinberg Lie superalgebras and establishes injectivity using evaluation homomorphisms, iterated coproducts in degreewise completions, and coefficientwise tensor separation.

fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2610.38952 ↗

Let $p>5$ be a prime. In this paper, we show that a pre-modular fusion category of global dimension $2p$ is either pointed or tensor equivalent to $\text{Rep}(D_{2p})$.

comments
13pages, comments welcome
fields
Quantum Algebra, Category Theory
pdf ↗ page arXiv:2610.39318 ↗

We determine the graded automorphism group of the multiparameter quantum matrix algebra $\mathcal O_{λ,\mathbf p}(M_n(\Bbbk))$ over an arbitrary field $\Bbbk$ for all $n\ge2$ and $λ\ne1$. No other restrictions are assumed on $\mathbf p$ or $λ$. Every graded automorphism is a torus automorphism, possibly followed by transposition or by simultaneous reversal of the row and column indices. We give the precise parameter conditions for these two involutions. As an application, we also determine the full automorphism group when the multiplicative group generated by the parameters is torsion-free.

fields
Quantum Algebra, Rings and Algebras
pdf ↗ page arXiv:2610.39366 ↗

For a discrete group $G$, we construct an $(n+1)$-dimensional $G$-equivariant Alterfold topological quantum field theory from a $G$-equivariant $S^n$-algebra satisfying strong semisimplicity, complete finiteness, and Morita invariance. We use state sum on triangulation to define a partition function and prove that it is invariant under local surgery relations and is invariant under gauge transformations relative to the boundary. If the input is given a reflection-positive structure, the theory is unitary. For $n=2$ and input reconstructed from a strict faithful spherical $G$-fusion category, the restriction to ordinary $G$-cobordisms is naturally isomorphic to the Turaev–Virelizier state-sum HQFT \cite{turaev20123}. A Tambara-Yamagami example recovers the Quon language \cite{liu2017quon} as a $\mathbb{Z}_2$-equivariant Alterfold TQFT.

comments
79 pages
fields
Quantum Algebra, Mathematical Physics, Category Theory, Geometric Topology, Operator Algebras
pdf ↗ page arXiv:2610.40041 ↗

We construct a quantum cluster algebra structure on the standard $\mathbb Z[q^{\pm1/2}]$-form of the bosonic extension algebra $\widehat A(b)$ for every positive braid $b$ and every symmetrizable generalized Cartan matrix. The proof realizes this algebra as the degree-zero part of a localization of a larger quantum unipotent coordinate ring, obtained by thickening a word for $b$. For symmetric Cartan matrices, this realization also gives a monoidal categorification of the quantum cluster algebra.

comments
48 pages
fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2610.40058 ↗

Differential calculi on non-irreducible quantised flag manifolds of the $\mathrm{A}$-series have recently been investigated using Lusztig positive root vectors, revealing that several features of classical differential geometry persist in the noncommutative setting. We extend this investigation to quantised flag manifolds associated with the lowest-rank quantum groups of types $\mathrm{C}$ and $\mathrm{D}$ whose classical spaces are holomorphic contact manifolds. Building on the Heckenberger–Kolb framework, we construct covariant first order differential calculi. The maximal prolongations of calculi restricted to contact directions have lower dimensions than their classical counterparts. In type $\mathrm{C}_2$, however, adjoining the Reeb direction yields a three-dimensional calculus on the contact flag manifold whose maximal prolongation has classical dimension. Adjoining the remaining simple-root direction yields a four-dimensional calculus on the full flag manifold, again with a maximal prolongation of classical dimension. For both calculi, we explicitly present the exterior algebras and identify them with those of the corresponding framing calculi on the quantum group. In type $\mathrm{D}_4$, we show that adjoining the Reeb direction yields a nine-dimensional calculus on the contact flag. We conjecture that its maximal prolongation also has classical dimension.

comments
49 pages. Comments are welcome!
fields
Quantum Algebra, Differential Geometry, Rings and Algebras
pdf ↗ page arXiv:2610.40076 ↗

For any finite-dimensional quasi-Hopf algebra $A$, we define the notion of a stable twist of $A$. We show that stable twists form a strict 2-group $\2ust(A)$, which is equivalent to $\OAut(\C{A})^{\rev}$. Given a group homomorphism $ρ: G \to \ost(A)$, we determine the obstruction in $H^3(G,Z_G(A))$ to lift $ρ$ to a $G$-action on $\C{A}$. We also establish a bijection between such liftings and cocentral cleft extensions of $\k[G]$ by $A$. The main application of $\2ust(A)$ is the computation of $\OAut(\C{A})$, together with an explicit description of the corresponding tensor autoequivalences. We apply this framework to pointed Hopf algebras $A$ that arise as central extensions of Taft algebras by cyclic groups, and we explicitly determine all of their tensor autoequivalences. The equivariantizations of $\C{A}$ by $\ost(A)$ produce a new family of Hopf algebras $\N(n,ξ)$ of dimension $2nm$, where $ξ$ is a scalar of order $m\mid n$ such that neither $\N(n,ξ)$ nor its dual has the Chevalley property. In dimension 24, we prove that $\N(6,-1)$ and its dual are precisely the Hopf algebras $H$ for which neither $H$ nor $H^*$ has the Chevalley property. This completes the classification of nonsemisimple Hopf algebras of dimension 24.

comments
Latex 91 pp
fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2610.40228 ↗

We construct a diagrammatic presentation by generators and relations for all dihedral pointed fusion categories $\mathrm{Vec}_{\mathrm{D}_{2n}}^ω$. Applying a jellyfish algorithm on our diagrammatics, we obtain an explicit closed formula for a complete set of normalized 3-cocycle representatives of $\mathrm{D}_{2n}$. As applications of our diagrammatics, we prove a universal property and show that in some cases we can recover affine $A$ unshaded subfactor planar algebras. We then extend our presentation to obtain diagrammatics for all pivotal structures on $\mathrm{Vec}_{\mathrm{D}_{2n}}^ω$.

comments
31 pages
fields
Quantum Algebra
pdf ↗ page arXiv:2610.40498 ↗

Given a graph $G$, does it have quantum symmetries, or in other words, is the algebra of the quantum automorphism group non-commutative? In the world of ordinary groups, determining whether a finitely presented group is commutative is undecidable. This is an immediate consequence of the Adian-Rabin theorem, which shows that many natural properties of finitely presented groups are undecidable. In this paper, we prove an Adian-Rabin theorem for quantum automorphism groups of graphs, showing that many natural properties of the quantum automorphism group of a graph (including having quantum symmetries) are undecidable. We also show that it's undecidable to determine if the discrete quantum automorphism group is non-trivial. Our methods are based on solution groups of linear system nonlocal games, and we also prove an Adian-Rabin theorem in this context.

comments
21 pages
fields
Quantum Algebra, Combinatorics, Group Theory, Operator Algebras
pdf ↗ page arXiv:2610.40590 ↗

Category Theory7

Cons-lists are fundamental to functional programming, and are well-understood as initial algebras, and as a concrete construction of free monoids. In category theory, such list objects can be axiomatised internal to any monoidal category, with nil and cons maps, and a recursion mechanism. When strengthened to support parametrised recursion, they can be shown to give the free monoid construction. We study a small variant on parametrised list objects called parametrised symmetric list objects, in a symmetric monoidal category, where the two frontmost elements are allowed to be permuted. We show that this gives a construction of free commutative monoids, and develop some related theory.

comments
Presented at MSFP'26
fields
Category Theory
pdf ↗ page arXiv:2610.37944 ↗

Generalizing a known result in the context of homological categories, we show that, in a regular protomodular category $\mathcal{C}$ equipped with a posetal, monocoreflective subcategory whose coreflector inverts monomorphisms, every torsion theory, in a non-pointed sense, satisfying suitable properties gives rise to a torsion theory in the category $\operatorname{Arr}(\mathcal{C})$ of arrows in $\mathcal{C}$. Moreover, we show that the induced torsion theory in $\operatorname{Arr}(\mathcal{C})$ satisfies the same good properties of the original one in $\mathcal{C}$, allowing to iterate the process. Examples of this situation can be found in protomodular varieties of universal algebras with more than one constant or in duals of elementary toposes.

fields
Category Theory
pdf ↗ page arXiv:2610.37956 ↗

Layered control architectures provide a powerful paradigm for synthesizing controllers for complex systems. Yet, translating guarantees at each layer to system-level guarantees is challenging due to the interactions between layers. To address this problem, this paper presents a categorical perspective on layered control architectures. Individual systems are represented as control coalgebras, their interactions are specified as morphisms to mediators, and system-level behaviors are obtained via composition defined categorically as a pullback. To analyze the safety of these systems, we formulate control barrier morphisms (CBMs), the categorical generalization of control barrier functions. We prove that feedback controllers satisfying a CBM condition render the associated safe subobject forward invariant. It is through CBMs that we can establish the safety of layered systems: given a CBM at each layer subject to compatibility conditions, the universal property of the pullback implies the existence of a CBM for the composed system. Safety of a full-order model being safety filtered by a reduced-order model is recovered as a specialization of the categorical framework.

fields
Category Theory, Optimization and Control
pdf ↗ page arXiv:2610.38108 ↗

There are many types of equivalence relations in mathematics, each one enjoying its own defnition, but many of them can also be defined by transformations of morphisms: Green's relations, orbit relations, conjugacy, equality of orbit closures, equivalence of Cauchy sequences, stable isomorphism. We unify them through the comparison category of a comparison datum, read at levels $-1,0,1,2,\dots$ (comparisons in both directions, connected components, homotopy groups). Its normal form is a full subcategory of a Grothendieck construction $\int_VH$ cut out by a map $s$; the classical relations are traced back to it by restriction along $s$, enrichment by a cost (limit relations) and filtered colimits (stabilization). If the map $σ$ transporting morphisms into a $2$-category is arbitrary, every relation occurs, so the constraint is the regularity of $σ$. We grade data along seven regularity classes. The rigid and diagonal classes are classified completely (on finite groups, by the double coset relations); completely functorial data contain conjugacy and obey a dichotomy on nil monoids. Whether every relation on a monoid is level $0$ of a completely functorial datum is open.

comments
31 pages
fields
Category Theory
pdf ↗ page arXiv:2610.38143 ↗

Accessibility results are established for (Cartan-Eilenberg) strongly FP-injective complexes, by first proving the accessibility of Strongly FP-injective modules and then utilizing the pseudopullback theorem. We also prove that every acyclic complex of weakly FP-projective modules has weakly FP-projective cycles over left $<\aleph_m$-coherent rings for a non-negative integer $m$. This is achieved by introducing the cotorsion pairs $\bigl(\mathcal{C}\aleph_mP\text{-}proj,\mathcal{C}\aleph_mP\text{-}inj\bigr)$, cogenerated by all $\aleph_m$-presentable weakly FP-projective modules, and proving that acyclic complexes of modules from the class $\mathcal{C}\aleph_mP\text{-}proj$ have weakly FP-projective cycles for every non-negative integer $m$.

fields
Category Theory, Rings and Algebras
pdf ↗ page arXiv:2610.38859 ↗

We study the category $\mathbf{Dep_{aff}}$ of finite posets and opfibrations between them, and prove that it is a perfect operator category in the sense of Barwick. Based on its additional properties, we propose a definition for a dependent operator category, and formulate a notion of dependent affine operad in a fibered way. In the particular case of $\mathbf{Dep_{aff}}$, we investigate the basic theory of such operads, establishing that the category of algebras for an operad is monadic over a canonical presheaf topos of "dependent sets". We finally extend this theory to a setting where we allow variable duplication, which we refer to as general dependent operads.

comments
38 pages, comments welcome!
fields
Category Theory
pdf ↗ page arXiv:2610.39597 ↗

We extend the process-matrix framework for defining indefinite causal orders to a broad class of generalised physical theories. We give a simple re-axiomatisation of spacetime contexts in terms of naturality over classical probes, which precisely captures non-contextual assignment together with compatibility with convexity and coarse-graining within local laboratories. Using this compositional perspective, we give a clean characterisation of theories in which abstract spacetime contexts admit a process-matrix representation, and we pin down the precise conditions (satisfied by classical theory, quantum theory, and a Boxworld-like theory) under which the supermap and process-matrix perspectives on higher-order processes coincide.

fields
Category Theory
pdf ↗ page arXiv:2610.40448 ↗

Operator Algebras6

In this paper we establish two main results concerning the comparison theory of positive elements in approximately homogeneous $C^{*}$-algebras with diagonal maps. The first is an existence theorem which interfaces with the rank problem; given a Villadsen algebra $A$, we construct a convex cone that induces an embedding of a semigroup into $Cu(A)$. This semigroup is identified with the set of strictly positive, lower-semicontinuous affine maps on the trace simplex of $A$. The second is a construction of an AH algebra that produces an obstacle to classifying the approximate unitary orbits of positive elements in terms of their spectral data. Our counterexample sheds light on a critical topological obstruction when attempting to understand equivalence classes of $*$-homomorphisms from $C_{0}((0,1])$ to an arbitrary $C^{*}$-algebra of stable rank one.

comments
38 pages, Comments are welcome!
fields
Operator Algebras
pdf ↗ page arXiv:2610.38142 ↗

Li proved that the noncommutative tori $A_θ$ and $A_{gθ}$ are strongly Morita equivalent whenever $g\in\mathrm{SO}(n,n|\mathbb{Z})$ and $gθ$ is defined. We study equivariant extensions of these equivalences for canonical finite cyclic group actions. Let $W\in\mathrm{GL}_n(\mathbb{Z})$ satisfy $W^tθW=θ$, $W^k=I_n$ and $1\notin\operatorname{spec}(W)$, and write $ρ(R)=\operatorname{diag}(R,(R^t)^{-1})$. If $gρ(W^t)g^{-1}=ρ(P)$ for some $P\in\mathrm{GL}_n(\mathbb{Z})$, we equip Li's $A_{gθ}$--$A_θ$ Heisenberg equivalence bimodule with a compatible $\mathbb{Z}_k$-action. Consequently, the crossed products $A_{gθ}\rtimes_{α_{P^t}}\mathbb{Z}_k$ and $A_θ\rtimes_{α_W}\mathbb{Z}_k$ are strongly Morita equivalent. For the canonical flip action by $\mathbb{Z}_2$, we prove that Morita equivalence of crossed products implies Morita equivalence of the underlying tori in every dimension, and prove the converse in dimensions two through four. For each fixed dimension $2\leq n\leq 4$, the complete invariants are the central rank and canonical $K_0$-trace range of the underlying torus, with the latter taken up to positive scaling. For the standard cyclic group actions of orders $2$, $3$, $4$ and $6$ on rotation algebras, we prove that the crossed products are Morita equivalent exactly when the action orders agree and the parameters lie in the same fractional-linear $\mathrm{GL}_2(\mathbb{Z})$-orbit, generalizing the result of Bönicke et al.\ from irrational to arbitrary real parameters. We also construct infinite families of distinct parameters giving Morita-equivalent crossed products for each fixed $W$ satisfying the stated hypotheses.

comments
36 pages; Comments are welcome
fields
Operator Algebras
pdf ↗ page arXiv:2610.38695 ↗

We study the problem of geometric characterization of Banach-compact and $\mathcal A$-compact operators on Hilbert $C^*$-modules in terms of uniform structures generated by seminorms. Previously, such a criterion for $\mathcal A$-compactness of adjointable operators was obtained by Troitsky for countably generated range modules with a suitable system of seminorms. Using locally unital $C^*$-algebras as modules over themselves, we establish fundamental limitations of such characterizations. Namely, we show that for nonunital locally unital $C^*$-algebras not only does Troitsky's criterion fail to extend, but, more generally, no system of seminorms can characterize $\mathcal A$-precompactness by total boundedness, nor Banach-compactness of bounded operators or $\mathcal A$-compactness of adjointable operators by total boundedness of the images of the unit ball. Moreover, the same statement holds for Hilbert $C^*$-modules $\mathcal N$ whenever the algebra $\mathbf K(\mathcal N)$ of $\mathcal A$-compact operators is locally unital and nonunital. We also study Troitsky-type systems of seminorms and their relation to $\mathcal A$-precompactness. We prove that every $\mathcal A$-precompact subset is totally bounded with respect to the strongest of such structures. Consequently, for Hilbert $C^*$-modules admitting a standard frame, all the corresponding notions of total boundedness coincide.

fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2610.39164 ↗

We characterise coarse embeddability of box spaces into Hilbert space in terms of a-T-menability of the associated Higson-Lafforgue-Skandalis (HLS) groupoids. Moreover, we prove that a-T-menability and metric amenability are independent for HLS groupoids: all four possible combinations occur among HLS groupoids associated with approximating sequences of the free group $\mathbb F_2$. The two separating examples are constructed using relative expansion and twisted spectral-gap techniques, respectively.

fields
Operator Algebras
pdf ↗ page arXiv:2610.39479 ↗

We introduce the notion of inner $\mathrm{C}^{\ast}$-selfless groups and study their structural properties. We prove a Fourier coefficient extraction theorem for invariant subalgebras of crossed products by such groups under a compatibility assumption on the action. Consequently, every inner $\mathrm{C}^{\ast}$-selfless group has the relative $\mathrm{C}^{\ast}$-invariant subalgebra rigidity property, and every finite product of such groups has the $\mathrm{C}^{\ast}$-invariant subalgebra rigidity property. We also introduce another group-theoretic notion, which we call cyclic Powers property. This implies inner $\mathrm{C}^{\ast}$-selflessness, complete $\mathrm{C}^{\ast}$-selflessness, and the Powers property, among others. We establish it for groups admitting a topologically free extreme boundary action on a compact Hausdorff space with more than two points, and for Zariski-dense discrete subgroups of $\mathrm{PSL}(d,\mathbb K)$ containing a biproximal element, where $\mathbb K$ is a local field and $d\geq2$. In particular, we obtain the Powers property for $\mathrm{PSL}(d,\mathbb Z)$, $d\geq3$, answering a question posed more than twenty years ago by Bridson-de la Harpe. Finally, we show that every non-trivial mixed identity-free discrete group has the relative invariant subalgebra rigidity property for its group von Neumann algebra. This shows that the Baumslag-Solitar groups $\mathrm{BS}(m,n)$ with $|m|,|n|\geq2$ and $|m|\ne|n|$ have the relative ISR property, thereby answering a question of Dudko-Jiang.

comments
42 pages
fields
Operator Algebras, Group Theory
pdf ↗ page arXiv:2610.40198 ↗

This paper provides a human digestion of a proof of the spectral isometry conjecture for $C^*$-algebras found by GPT-6 Astra. We prove that every unital surjective complex-linear spectral isometry between unital $C^*$-algebras is a Jordan isomorphism. Without the assumption that the map preserves the identity, it is a central unitary multiple of a Jordan isomorphism. The main step is to show that an entire one-parameter group of unital spectral isometries consists of algebra automorphisms. To prove this, we extend the group to the bidual, which splits into finite and properly infinite summands. On the finite part, we use quadratic and cubic trace identities and on the properly infinite part, we apply a structure theorem for maps that preserve square-zero elements. To show that both summands are invariant, we use holomorphic dependence on the parameter together with a uniform resolvent bound, which ensures that self-adjoint elements have images with real spectrum. We then apply the group theorem to inner automorphisms conjugated by the original spectral isometry. This reduces the problem to the commutative case, where Nagasawa's theorem completes the proof.

comments
9 pages
fields
Operator Algebras
pdf ↗ page arXiv:2610.40470 ↗

Symplectic Geometry4

We study the equivariant geometric quantisation of a non-compact hypertoric variety of complex dimension $2n$ using symplectic cutting. When the defining arrangement is cooriented so that its base region is non-empty and bounded, fibre rotation has proper moment map and produces compact Kähler orbifold cuts carrying the residual torus action. We introduce the moment polyptych of such a cut, a polytopal complex assembled from truncated arrangement regions, and show that its vertices and local lattice data determine the fixed points, tangent weights, and finite orbifold groups required for equivariant orbifold Riemann-Roch localisation. Even for a smooth hypertoric manifold, a reducible core forces every cut in the outer cut chamber to have non-trivial cyclic isotropy, while the cuts are smooth if and only if the manifold is the cotangent bundle of its distinguished compact toric subvariety, which is then a product of projective spaces. For a positive regular integral level $d$ in the outer cut chamber, algebraic cutting identifies the cut's quantisation with a finite filtration piece of the circle-graded quantisation of the original hypertoric variety, whose successive quotients recover the individual circle-weight spaces. We prove that the higher cohomology of the pre-quantum line orbibundle vanishes at every such level, so that the localised index is the character of the actual space of sections. Finally, a residual weight $x$ occurs at level $d$ if and only if $\mathcal{S}(x) \leq d$, where $\mathcal{S}$ is the arrangement slack function, with multiplicity $\binom{d - \mathcal{S}(x) + n}{n}$. Thus, each finite stage admits a weighted lattice-point description whose multiplicity function is supported on the lattice points in the support of the level-$d$ moment polyptych.

comments
57 pages, 14 figures
fields
Symplectic Geometry, Algebraic Geometry
pdf ↗ page arXiv:2610.37724 ↗

An exact symplectomorphism of finite type Liouville manifolds is called 'strict' if it has bounded primitive; such symplectomorphisms are well known to induce deformation equivalences and hence equivalences of wrapped Fukaya categories. Here we note that an arbitrary symplectomorphism of Weinstein manifolds, with no assumptions at infinity, can be used to construct an equivalence of Fukaya categories. We combine this with a pointwise criterion for constructing such symplectomorphisms to improve two statements in the mirror symmetry literature -- for very affine hypersurfaces and multiplicative hypertoric varieties -- where Fukaya categories were calculated for a Liouville form not known to be strictly exact symplectomorphic to the natural Kähler Liouville form on the space in question. All results are obtained using ChatGPT Astra.

comments
13 pages
fields
Symplectic Geometry
pdf ↗ page arXiv:2610.37808 ↗

We define mathematically the Point-Splitting Perturbative Chern-Simons Theory. The framing anomaly arise directly from the dependence of the configuration space of points on the frame.

fields
Symplectic Geometry
pdf ↗ page arXiv:2610.40211 ↗

We extend the formalism of Point-Splitting-Perturbative-Chern-Simons to include Wilson Loops.

fields
Symplectic Geometry
pdf ↗ page arXiv:2610.40213 ↗

History and Overview2

The last year has seen a shift in AI-assisted mathematics, with frontier language models producing proofs of and counterexamples to long-standing open conjectures. However, studying only the current set of major breakthroughs provides an incomplete picture of LLM capabilities and the computational resources needed to achieve reported results. To address this, we introduce a new dataset, OpenConjecture, which collects conjectures from mathematics papers published on the arXiv since February 2026. We use these conjectures as a source of open mathematical problems, and apply frontier GPT models to a random sample of 200 of these conjectures over three passes using a reproducible protocol without problem-specific mathematical guidance. Rather than attempt expert verification of these candidate solutions, we analyze the types of problems for which LLMs produce solutions and the characteristics of these solutions. The models we test produce candidate solutions for roughly 60% of the conjectures, with counterexamples about 1.3 times more common than proofs. We estimate solution novelty, assess how solutions cite and relate to existing literature, and analyze whether the proposed resolution relies on either an error in or underspecification of the conjecture. We find that models sometimes propose resolutions that are outside the authors' intent (e.g., proposing the trivial group as a counterexample) and that a number of proofs follow closely from existing results, but that some resolutions exhibit at least moderate novelty. Our findings underscore the need for evaluations that go beyond correctness to assess fidelity to the intended statement, attribution, and the nature of the mathematical contribution.

fields
History and Overview
pdf ↗ page arXiv:2610.40382 ↗

We've heard a lot about AI in math from Fields medalists, AI labs, and established professors. However, the personal stakes are highest for early career researchers. Hoping to provide a platform for graduate students and postdocs to voice their opinions, concerns, and experiences, we wrote and distributed a survey on AI in math. In this article, we share the responses to our survey. All responses are anonymous, and respondents came from almost $60$ institutions and at least $5$ countries. Our survey included both multiple choice questions and more open-ended free response questions. If you are a senior mathematician or university administrator reading these survey results, our goal is for you to understand the concerns of the younger generations and use your authority to take action accordingly. If you are an early career mathematician reading these survey results, we hope you find comfort in the knowledge that your experiences are shared by many others. If you are not a mathematician, we hope you come away from this article with a deeper understanding of the goals, values, and concerns of the community.

comments
11 + 15 pages, 18 figures
fields
History and Overview
pdf ↗ page arXiv:2610.40584 ↗

K-Theory and Homology2

An independent ample groupoid $G$ comes equipped with a discrete groupoid $G_d$ and a proper étale correspondence $Ω:G_d\to G$. Discretisation with respect to a homological invariant $\mathcal{H}$ holds when $\mathcal{H}(Ω)$ is an equivalence. We show for example that discretisation with respect to the $K$-theory spectrum $\mathbb{K} \mathfrak{B}_G$ of the permutative category of bisections always holds, establish excision and continuity for this invariant, and use all this and explicit resolutions by independent groupoids to compute it for several families of ample groupoids. We also prove discretisation with respect to invariants of the Steinberg algebra $\ell[G]$ such as (homotopy) algebraic $K$-theory in several particular cases, and carry out computations.

comments
49 pages
fields
K-Theory and Homology, Operator Algebras, Rings and Algebras
pdf ↗ page arXiv:2610.38791 ↗

We develop an analytic framework for the explicit construction of Kasparov products on uncountably generated Hilbert modules over non-separable C$^*$-algebras by extending the classical Kasparov bimodule picture. In particular, this yields a well-defined functor from the category of general C$^*$-algebras whose restriction to separable C$^*$-algebras coincides with classical KK-theory and which satisfies several properties expected of non-separable KK-theory. A key idea of the extension is to replace a single Fredholm operator on a Kasparov bimodule with a net and to encode the directed system of separable C$^*$-subalgebras. We also introduce the notion of freely complementable Hilbert modules and develop cropping techniques to extend Kasparov's technical theorem beyond the countably generated setting. It naturally gives rise to a sufficiently broad class of C$^*$-algebras that provides a non-commutative analogue of paracompactness and includes all $σ$-unital algebras.

comments
40 pages, comments are welcome!
fields
K-Theory and Homology, Operator Algebras
pdf ↗ page arXiv:2610.40351 ↗

Spectral Theory2

We prove that every spectral union of four bounded intervals tiles the real line by translations. The argument combines periodicity of spectra, cofactor identities for the secular determinant, and a common tiling complement for the finite spectral fibers. We also establish a rigidity theorem for six complex numbers with prescribed vanishing power sums.

fields
Spectral Theory
pdf ↗ page arXiv:2610.37975 ↗

We prove the sharp Berezin–Li–Yau inequality for Riesz means of order at least one for Aharonov–Bohm operators on bounded planar domains with Dirichlet boundary conditions. This confirms a conjecture posed by Frank and Hansson in 2008. We also obtain an improved lower bound for individual eigenvalues and extend it to the case of magnetic potentials with bounded magnetic field. These results are then applied to deduce estimates for Riesz means of orders between zero and one, and for Aharonov–Bohm eigenvalues on product domains.

comments
14 pages
fields
Spectral Theory, Mathematical Physics
pdf ↗ page arXiv:2610.40223 ↗

Revised papers475

Let $g=g_M+u^2h$ be a Poincaré–Einstein (asymptotically hyperbolic Einstein, AHE) metric of class $C^{3,α}$ on $N^{n+1}=M^q\times F^p$, where $(F,h)$ is compact with unit volume and $\Ric_h=λh$, $λ\le 0$. We show that if the conformal infinity $[γ]$ has positive Yamabe constant, then \[ u\;\ge\;Θ[γ]:=\sup_η\Big(\min_{\dN}ψ_η\Big)\Big(\frac{\min_{\dN} s_η}{n(n-1)}\Big)^{1/2}>0, \] the supremum being over representatives $η\in[γ]$ of positive scalar curvature and $ψ_η$ the boundary warping function of $η$. In particular $u\ge (\Y[γ]/n(n-1))^{1/2}\minψ_{η_Y}$ for the Yamabe metric $η_Y$. The estimate rests on a comparison principle between $\ln u$ and Lee's eigenfunction, which also applies to each factor of a multiply warped product, and pointwise yields $u\ge(\minψ_η)\,w_η$ when $\Y[γ]\ge 0$. We give an explicit bound in terms of the product representative of $[γ]$, show that the hypotheses force $q\ge 3$ and $\partial M$ connected, prove lower semicontinuity of $Θ$ in the boundary data, and discuss examples (hyperbolic Fermi coordinates, AdS–Schwarzschild) showing that the hypothesis $λ\le0$ cannot be removed.

fields
Differential Geometry
pdf ↗ page arXiv:0710.2699 ↗

We consider the $L^p$ Hardy inequality involving the distance to the boundary for a domain in the $n$-dimensional Euclidean space. We study the dependence on $p$ of the corresponding best constant and we prove monotonicity, continuity and differentiability results. The focus is on non-convex domains in which case such constant is in general not explicitly known.

comments
A redundant multiplicative factor has been removed from the statement of Lemma 4 and from formulas (4.3), (4.7), (4.13), and (5.2). Inequality (4.14), which was included as a minor remark, has also been corrected. We are grateful to Professor Vladimir Bobkov for pointing this out to us
fields
Analysis of PDEs
pdf ↗ page arXiv:1509.09107 ↗

Suppose $M$ is a countable ab-initio (uncollapsed) generic structure which is obtained from a pre-dimension function with rational coefficients. We show that if $H$ is a subgroup of $\mbox{Aut}\left(M\right)$ with $\left[\mbox{Aut}\left(M\right):H\right]<2^{\aleph_{0}}$, then there exists a finite set $A\subseteq M$ such that $\mbox{Aut}_{A}\left(M\right)\subseteq H$. This shows that $\mbox{Aut}\left(M\right)$ has the small index property.

comments
20 pages
fields
Logic, Group Theory
pdf ↗ page arXiv:1510.00586 ↗

Let $S$ be an upper cluster algebra, which is a subalgebra of $R$. Suppose that there is some cluster variable $x_e$ such that ${R}_{{x}_e} = S[{x}_e^{\pm 1}]$. We try to understand under which conditions ${R}$ is an upper cluster algebra, and how the quiver of $R$ relates to that of $S$. Moreover, if the restriction of $(Δ,W)$ to some subquiver is a cluster model, we give a sufficient condition for $(Δ,W)$ itself being a cluster model. As an application, we show that the semi-invariant ring of any complete $m$-tuple flags is an upper cluster algebra whose quiver is explicitly given. Moreover, the quiver with its rigid potential is a polyhedral cluster model.

comments
27 pages, 7 figures. Final version to appear
fields
Commutative Algebra, Representation Theory
pdf ↗ page arXiv:1707.04661 ↗

We enumerate complex curves on toric surfaces of any given degree and genus, having a single cusp and nodes as their singularities, and matching appropriately many point constraints. The solution is obtained via tropical enumerative geometry. The same technique applies to enumeration of real plane cuspidal curves: We show that, for any fixed $r\ge1$ and $d\ge2r+3$, there exists a generic real $2r$-dimensional linear family of plane curves of degree $d$ in which the number of real $r$-cuspidal curves is asymptotically comparable with the total number of complex $r$-cuspidal curves in the family, as $d\to\infty$.

comments
Compared with the published version, the multiplicity formulas before Theorem 3.1 are corrected thanks to the Hannah Markwig notification
fields
Algebraic Geometry
pdf ↗ page arXiv:1807.11443 ↗

We investigate four well-known negative translations of classical logic into intuitionistic logic within a substructural setting. We find that in \emph{affine logic} the translation schemes due to Kolmogorov and Gödel both satisfy Troelstra's criteria for a negative translation. On the other hand, the schemes of Glivenko and Gentzen both fail for affine logic, but for different reasons: one can extend affine logic to make Glivenko work and Gentzen fail and {\it vice versa}. By contrast, in the setting of \emph{Łukasiewicz logic}, we can prove a general result asserting that a wide class of formula translations including those of Kolmogorov, Gödel, Gentzen and Glivenko not only satisfy Troelstra's criteria with respect to a natural intuitionistic fragment of Łukasiewicz logic but are all equivalent.

comments
arXiv admin note: text overlap with arXiv:1404.0570
fields
Logic
pdf ↗ page arXiv:1912.00012 ↗

In this paper, we investigate linear stability properties of the 2D isentropic compressible Euler equations linearized around a shear flow given by a monotone profile, close to the Couette flow, with constant density, in the domain $\mathbb{T}\times \mathbb{R}$. We begin by directly investigating the Couette shear flow, where we characterize the linear growth of the compressible part of the fluid while proving time decay for the incompressible part (inviscid damping with slower rates). Then we extend the analysis to monotone shear flows near Couette, where we are able to give an upper bound, superlinear in time, for the compressible part of the fluid. The incompressible part enjoys an inviscid damping property, analogous to the Couette case. In the pure Couette case, we exploit the presence of an additional conservation law (which connects the vorticity and the density on the moving frame) in order to reduce the number of degrees of freedom of the system. The result then follows by using weighted energy estimates. In the general case, unfortunately, this conservation law no longer holds. Therefore we define a suitable weighted energy functional for the whole system, which can be used to estimate the irrotational component of the velocity but does not provide sharp bounds on the solenoidal component. However, even in the absence of the aforementioned additional conservation law, we are still able to show the existence of a functional relation which allows us to recover somehow the vorticity from the density, on the moving frame. By combining the weighted energy estimates with the functional relation we also recover the inviscid damping for the solenoidal component of the velocity.

comments
Withdrawn due to an error in the analysis of shear flows near Couette: the weight v defined in (5.19) was incorrectly treated as self-adjoint in the energy identities. The results for the exact Couette flow are unaffected and were subsequently included, improved and extended in arXiv:2101.01696
fields
Analysis of PDEs
pdf ↗ page arXiv:2003.01694 ↗

We construct two Fréchet algebras admitting countably many mutually inequivalent Fréchet algebra topologies. The second example is a modification of the maiden (and first) example of a non-Banach Fréchet algebra with two inequivalent Fréchet algebra topologies, considered by Read to show that the famous Singer-Wermer conjecture does not hold in the Fréchet case. We discuss a couple of avatars of the Singer-Wermer conjecture in Fréchet algebras. In particular, this conjecture (and so, its weaker version, too) does hold by the second example which also admits countably many mutually equivalent Fréchet algebra topologies. However the stronger version of this conjecture (i.e., the Kaplansky's conjecture) does not hold by the second example.

comments
17 pages; A talk based on this paper was delivered at the Intl. Conference on Topological Algebras and Their Applications (ICTAA 2021), held online and organized from Estonia
journal
Proceedings of ICTAA 2021, Mathematics Studies 8, Estonian Mathematical Society, Tartu, 2021, pp. 121-137
fields
Functional Analysis
pdf ↗ page arXiv:2003.13243 ↗

We study the moduli spaces of flat surfaces with prescribed conical singularities. Veech showed that these spaces are diffeomorphic to the moduli spaces of marked Riemann surfaces, and endowed with a natural volume form depending on the orders of the singularities. We show that the volumes of these spaces are finite. Moreover we show that they are explicitely computable by induction on the Euler characteristics of the punctured surface for almost all orders of the singularities.

comments
37 pages, 4 figures
fields
Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2004.03198 ↗

We provide a complete combinatorial classification of critically fixed anti-Thurston maps, i.e., orientation-reversing branched covers of the 2-sphere that fix every critical point. The first step in the proof, and an interesting result in its own right, is a combinatorial classification of critically fixed anti-rational maps as "Schottky maps" associated with certain plane graphs. Both of these classification results heavily rely on an orientation-reversing version of Thurston's theory, including the canonical decomposition of anti-Thurston maps, which we develop in this paper. We use our combinatorial framework to answer special instances of the global curve attractor and twisting problems, and to resolve the Hurwitz existence problem in the setting of critically fixed anti-rational maps. Finally, we give some applications to the study of anti-rational maps with symmetries and to critically fixed anti-polynomials.

comments
69 pages, 20 figures, comments welcome. Expanded and overhauled introduction, new figures, new subsection on the Hurwitz existence problem, cleanup of various arguments
fields
Dynamical Systems
pdf ↗ page arXiv:2006.10788 ↗

In 1952, Michael posed a question about functional continuity of commutative Fréchet algebras in his memoir, known as Michael's problem in the literature. We settle this in the affirmative for the non-commutative Fréchet algebras, along with its equivalent form. Indeed, we continue our previous works to directly attack these problems. We show that the existence of a discontinuous character on the non-commutative test case for this problem -- the Fréchet algebra ${\cal U}_{nc}$ of all entire functions on $\ell^\infty$ -- allows us to generate another Fréchet algebra topology on ${\cal U}_{nc}$, inequivalent to the usual Fréchet algebra topology. An important tool is a topological version of the tensor algebra over a Banach space. The elementary, but crucial, idea is to express the test algebra ${\cal U}_{nc}$ as a {\it weighted Fréchet tensor algebra} over the Banach space $\ell^1$. We give some important applications in automatic continuity theory. In particular, we provide affirmative answers to significant, long-standing problems from 1967 (extending Johnson's result for non-commutative, semi-simple Fréchet algebras; Dales' survey, Question 9), 1976 (extending Esterle's result, giving another approach for Michael's problem for more general $(F)$-algebras), and 1978 (a weaker version of an equivalent form of the non-commutative Michael's problem; Dales' survey, p. 143).

comments
59 pages. Version 4 of 2006.11134 contains the 2nd approach for non-commutative Frechet algebras and significant applications in automatic continuity theory (e.g., extending Johnson's result (1967) for non-commutative, semi-simple Frechet algebras). Note that the long manuscript has been divided in two parts, so Version 5 (new submission) contains the 1st approach for commutative Frechet algebras
fields
Functional Analysis
pdf ↗ page arXiv:2006.11134 ↗

Let $q$ be an odd prime, and let $T_{q}:\mathbb{Z}\rightarrow\mathbb{Z}$ be the Shortened $qx+1$ map, defined by $T_{q}\left(n\right)=n/2$ if $n$ is even and $T_{q}\left(n\right)=\left(qn+1\right)/2$ if $n$ is odd. The study of the dynamics of these maps is infamous for its difficulty, with the characterization of the dynamics of $T_{3}$ being an alternative formulation of the famous Collatz Conjecture. This series of papers presents a new paradigm for studying such arithmetic dynamical systems by way of a neglected area of ultrametric analysis which we have termed $\left(p,q\right)$-adic analysis, the study of functions from the $p$-adics to the $q$-adics, where $p$ and $q$ are distinct primes. In this, the first paper, working with the $T_{q}$ maps as a toy model for the more general theory, for each odd prime $q$, we construct a function $χ_{q}:\mathbb{Z}_{2}\rightarrow\mathbb{Z}_{q}$ (the Numen of $T_{q}$) and prove the Correspondence Principle (CP): $x\in\mathbb{Z}\backslash\left\{ 0\right\}$ is a periodic point of $T_{q}$ if and only there is a $\mathfrak{z}\in\mathbb{Z}_{2}\backslash\left\{ 0,1,2,\ldots\right\}$ so that $χ_{q}\left(\mathfrak{z}\right)=x$.

comments
53 pages
journal
P-Adic Num Ultrametr Anal Appl 16, 143-199 (2024)
fields
Dynamical Systems
pdf ↗ page arXiv:2007.15936 ↗

We consider the problem of adaptive inference on a regression function at a point under a multivariate nonparametric regression setting. The regression function belongs to a Hölder class and is assumed to be monotone with respect to some or all of the arguments. We derive the minimax rate of convergence for confidence intervals (CIs) that adapt to the underlying smoothness, and provide an adaptive inference procedure that obtains this minimax rate. When the regression function is monotone in $k_{+}$ of its $k$ arguments, the minimax expected length over a Hölder class with exponent $γ'$ of CIs that maintain coverage over a rougher class with exponent $γ$ is of order $n^{-1/(2+k_{+}/γ'+(k-k_{+})/γ)}$. The rate is unchanged if the rougher class restricts the smoothness only at the point, along the nonmonotone arguments. Under monotonicity along a closed convex cone that contains no line, only the dimension of its linear span enters the rate. The procedure differs from that of Cai and Low (2004), intended to yield shorter CIs under practically relevant specifications. It is valid in finite samples under Gaussian errors with a known variance. The proposed method applies to general linear functionals of the regression function.

comments
33 pages, plus a 41-page supplement
fields
Statistics Theory
pdf ↗ page arXiv:2011.14219 ↗

We interpret the log-Brunn-Minkowski conjecture of Böröczky-Lutwak-Yang-Zhang as a spectral problem in centro-affine differential geometry. In particular, we show that the Hilbert-Brunn-Minkowski operator coincides with the centro-affine Laplacian, thus obtaining a new avenue for tackling the conjecture using insights from affine differential geometry. As every strongly convex hypersurface in $\mathbb{R}^n$ is a centro-affine unit-sphere, it has constant centro-affine Ricci curvature equal to $n-2$, in stark contrast to the standard weighted Ricci curvature of the associated metric-measure space, which will in general be negative. In particular, we may use the classical argument of Lichnerowicz and a centro-affine Bochner formula to give a new proof of the Brunn-Minkowski inequality. For origin-symmetric convex bodies enjoying fairly generous curvature pinching bounds (improving with dimension), we are able to show global uniqueness in the $L^p$- and log-Minkowski problems, as well as the corresponding global $L^p$- and log-Minkowski conjectured inequalities. As a consequence, we resolve the isomorphic version of the log-Minkowski problem: for any origin-symmetric convex body $\bar K$ in $\mathbb{R}^n$, there exists an origin-symmetric convex body $K$ with $\bar K \subset K \subset 8 \bar K$, so that $K$ satisfies the log-Minkowski conjectured inequality, and so that $K$ is uniquely determined by its cone-volume measure $V_K$. If $\bar K$ is not extremely far from a Euclidean ball to begin with, an analogous isometric result, where $8$ is replaced by $1+ε$, is obtained as well.

comments
Appended an erratum at the end of the published version. We replace the widthdrawn Theorem 6.4 with a corrected lemma, stressing that this does not change the validity of any of the other results in the paper. In particular, we give corrected proofs of Theorems 1.2, 1.5 and 1.7, with their original statements and constants unchanged
fields
Functional Analysis, Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2104.12408 ↗

In this paper, we consider the stationary Stokes equations in an exterior domain three-dimensional under a slip boundary condition without friction. We set the problem in weighted Sobolev spaces in order to control the behavior at infinity of the solutions. In this work, we try to investigate the existence and uniqueness up to an element of a nontrivial kernel of the weak solutions related to this problem in $L^p-$theory when $p>3$. Our proofs are based on obtaining inf-sup conditions that play a fundamental role.

fields
Analysis of PDEs
pdf ↗ page arXiv:2111.05822 ↗

Muchnik's paradox says that enumerable betting strategies are not always reducible to enumerable strategies whose bets are restricted to either even rounds or odd rounds. In other words, there are outcome sequences x where an effectively enumerable strategy succeeds, but no such parity-restricted effectively enumerable strategy does. We characterize the effective Hausdorff dimension of such $x$, showing that it can be as low as 1/2 but not less. We also show that such reals that are random with respect to parity-restricted effectively enumerable strategies with packing dimension as low as $\log\sqrt3$. Finally we exhibit Muchnik's paradox in the case of computable integer-valued strategies.

comments
Correcting errors
fields
Logic
pdf ↗ page arXiv:2201.07007 ↗

We will define and study some generalisations of pure $\mathfrak{g}$-braid groups that occur in the theory of connections on curves, for any complex reductive Lie algebra $\mathfrak{g}$. They make up local pieces of the wild mapping class groups, which are fundamental groups of (universal) deformations of wild Riemann surfaces, underlying the braiding of Stokes data and generalising the usual mapping class groups. We will establish a general product decomposition for the local wild mapping class groups, and in many cases define a fission tree controlling this decomposition. Further in type A we will show one obtains cabled versions of braid groups, related to braid operads.

comments
v4 (43pp., 7figg.): more minor improvements (e.g., added remarks on type-D parts of Levi root subystems), added references, updated funding acknowledgement/addresses and metadata; v3 is closest to published version; comments welcome!
fields
Geometric Topology, Algebraic Geometry, Rings and Algebras
pdf ↗ page arXiv:2204.08188 ↗

For a split quasireductive supergroup $G$ defined over a field, we study structure and representation of Frobenius kernels $G_r$ of $G$ and we give a necessary and sufficient condition for $G_r$ to be unimodular in terms of the root system of $G$. We also establish Steinberg's tensor product theorem for $G$ under some natural assumptions.

comments
This version corrects errors in the published article. An erratum has been submitted to Algebras and Representation Theory
journal
Algebr. Represent. Theory 27 (2024), 927-959
fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2206.06000 ↗

We will define and study (moduli) spaces of deformations of irregular classes on Riemann surfaces, which provide an intrinsic viewpoint on the `times' of irregular isomonodromy systems in general. Our aim is to study the deeper generalisation of the G-braid groups that occur as fundamental groups of such deformation spaces, with particular focus on the generalisation of the full G-braid groups.

comments
v4 (34pp., 3 figg.): more minor improvements (e.g., generalized statement/proof of Lem. 2.2), added references, updated addresses and metadata; v3 is closest to published version; comments welcome!
journal
Transform. Groups 30 (2025), 591-631
fields
Algebraic Geometry, Group Theory, Geometric Topology
pdf ↗ page arXiv:2208.02575 ↗

We determine the wall divisors on irreducible symplectic orbifolds which are deformation equivalent to a special type of examples, called Nikulin orbifolds. The Nikulin orbifolds are obtained as partial resolutions in codimension 2 of a quotient by a symplectic involution of a Hilbert scheme of 2 points on a K3 surface. This builds on the previous article arXiv:2009.04873 in which the theory of wall divisors was generalized to orbifold singularities.

comments
Final version to appear in Journal of Pure and Applied Algebra
fields
Algebraic Geometry
pdf ↗ page arXiv:2209.03667 ↗

We study variants of the mixed finite element method (mixed FEM) and the first-order system least-squares finite element (FOSLS) for the Poisson problem where we replace the load by a suitable regularization which permits to use $H^{-1}$ loads. We prove that any bounded $H^{-1}$ projector onto piecewise constants can be used to define the regularization and yields quasi-optimality of the lowest-order mixed FEM resp. FOSLS in weaker norms. Examples for the construction of such projectors are given. One is based on the adjoint of a weighted Clément quasi-interpolator. We prove that this Clément operator has second-order approximation properties. For the modified mixed method we show optimal convergence rates of a postprocessed solution under minimal regularity assumptions -- a result not valid for the lowest-order mixed FEM without regularization. Numerical examples conclude this work.

comments
The claim made in earlier versions of this manuscript, that the coefficients in (10) can always be chosen non-negative, is false in general. The present version does not rely on non-negativity. The author thanks Rami Masri (Brown University) and coauthors for pointing this out. Some typos have been fixed. A new section (Appendix A) has been added
fields
Numerical Analysis
pdf ↗ page arXiv:2210.14063 ↗

Real-time systems consist of a set of tasks, a scheduling policy, and a system architecture, all constrained by timing requirements. Many everyday embedded systems, within devices such as airplanes, cars, trains, and spatial probes, operate as real-time systems. To ensure safe failure rates, response times-the time required for the exection of a task-must be bounded. Rate Monotonic real-time systems prioritize tasks according to their arrival rate. This paper focuses on the use of the central limit of response times built in \cite{zagalo2022} and an approximation of their distribution with an inverse Gaussian mixture distribution. The distribution parameters and their associated failure rates are estimated through a suitable re-parameterization of the inverse Gaussian distribution and an adapted Expectation-Maximization algorithm. Extensive simulations demonstrate that the method is well-suited for the approximation of failure rates. We discuss the extension of such method to a chi-squared independence test adapted to real-time systems.

comments
Accepted to IEEE Transactions on Computers
fields
Statistics Theory
pdf ↗ page arXiv:2211.01720 ↗

This article is the $10^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. In this part, we obtain families of Type-2 isomorphic circulant graphs $C_{np^3}(R)$ w.r.t. $m$ = $p$, and related Abelian groups where $p$ is a prime number and $n\in\mathbb{N}$. Theorems \ref{c1} and \ref{c4} are the main results. In Theorem \ref{c4}, it is proved that for $i$ = 1 to $p$, circulant graphs $C_{np^3}(R^{np^3,x+yp}_i)$ are isomorphic of Type-2 w.r.t. $m$ = $p$ and they form Abelian group $(T2_{np^3,p}(C_{np^3}(R^{np^3,x+yp}_i)), \circ)$ where $T2_{np^3,p}(C_{np^3}(R^{np^3,x+yp}_i))$ = $\{θ_{np^3,p,jn}(C_{np^3}(R^{np^3,x+yp}_i))$ = $C_{np^3}(R^{np^3,x+yp}_{i+j}) :$ $j$ = $0,1,...,p-1$ and $i+j$ in $C_{np^3}(R^{np^3,x+yp}_{i+j})$ is calculated under addition modulo $p \}$, $1 \leq x \leq p-1$, $0 \leq y \leq np - 1$, $1 \leq x+yp \leq np^2-1$, $y\in\mathbb{N}_0$, $p,np^3-p\in R^{np^3,x+yp}_i$ and $i,n,x\in\mathbb{N}$. Using Theorem \ref{c4}, a list of $T2_{np^3,p}(C_{np^3}(R^{np^3,x+yp}_i))$, each containing $p$ isomorphic circulant graphs $C_{np^3}(R^{np^3,x+yp}_i)$ of Type-2 w.r.t. $m$ = $p$, for $p$ = 3,5,7, $n$ = 1,2 and $y$ = 0 is given in the Annexure and more such families of Type-2 isomorphic circulant graphs are presented in \cite{v24}.

comments
This is a slightly modified version of its previous submission
fields
Combinatorics
pdf ↗ page arXiv:2211.06970 ↗

We give an account of Mazur's proof that, for an elliptic curve over $\mathbb{Q}$, if it admits a nonconstant mapping from $X(N)$ defined over the complex numbers $\mathbb{C}$, for some $N$, then it also admits a nonconstant mapping from $X_0(M)$ for some (possibly different) $M$ defined over the rational numbers $\mathbb{Q}$. We also briefly discuss two open questions of Khare concerning uniformisations of elliptic curves by noncongruence modular curves. This expository note is based on the author's expository talk in March 2022 during the 2nd Trimester Program on "Modularity and the Generalised Fermat Equation" held online and organised by Bhaskaracharya Pratishthana in Pune, India.

comments
8 pages; this is the final version as published in the journal mentioned below
journal
Contemporary Mathematics vol 849, 2026, AMS, pp. 33-42
fields
Number Theory
pdf ↗ page arXiv:2212.14412 ↗

We study the system of partial differential equations which characterizes the Pearcey integral from the viewpoint of the exact WKB analysis. It is shown that the Borel transform of the WKB solutions to the system can be written as a linear combination of the branches of an algebraic function of degree $4$. Moreover, some connection formulas for the system are given.

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

Given $\mathbb{F}_{q^{n}}$, a field with $q^n$ elements, where $q $ is a prime power and $n$ is positive integer. For $r_1,r_2,m_1,m_2 \in \mathbb{N}$, $k_1,k_2 \in \mathbb{N}\cup \{0\}$, a rational function $F = \frac{F_1}{F_2}$ in $\mathbb{F}_{q}[x]$ with deg($F_i$) $\leq m_i$; $i=1,2,$ satisfying some conditions, and $a,b \in \mathbb{F}_{q}$, we construct a sufficient condition on $(q,n)$ which guarantees the existence of an $r_1$-primitive, $k_1$-normal element $ε\in \mathbb{F}_{q^n}$ such that $F(ε)$ is $r_2$-primitive, $k_2$-normal with $\operatorname{Tr}_{\mathbb{F}_{q^n}/\mathbb{F}_q}(ε) = a$ and $\operatorname{Tr}_{\mathbb{F}_{q^n}/\mathbb{F}_q}(ε^{-1}) = b$. For $m_1=10, \; m_2=11,\; r_1 = 3, \; r_2 = 2, \; k_1=2,\;k_2 = 1$, we establish bounds on $q$, for various $n$, to determine the existence of such elements in $\mathbb{F}_{q^{n}}$. Furthermore, we identify all such pairs $(q,n)$ excluding 10 possible values of $(q,n)$, in fields of characteristics 13.

comments
Main Result (Theorem 3.1) has some errors
fields
Number Theory
pdf ↗ page arXiv:2304.08749 ↗

By utilizing the technique introduced in our previous work to construct Hopf superalgebras by reversing the Radford-Majid bosonization, we classify non-semisimple pointed Hopf superalgebras of dimension up to 10 over an algebraically closed field of characteristic zero.

comments
Corrected labels and added a previously omitted isomorphism class in dimension 8. Corrigendum submitted to the journal
journal
Rev. Roumaine Math. Pures Appl. 69 (2024), no. 3-4, 539-573
fields
Quantum Algebra
pdf ↗ page arXiv:2306.12637 ↗

In paper I of this series we gave positive formulae for expanding the product $\mathfrak S^π\mathfrak S^ρ$ of two Schubert polynomials, in the case that both $π,ρ$ had shared descent set of size $\leq 3$. Here we introduce and give positive formulae for two new classes of Schubert product problems: separated descent in which $π$'s last descent occurs at (or before) $ρ$'s first, and almost separated descent in which $π$'s last two descents occur at (or before) $ρ$'s first two respectively. In both cases our puzzle formulae extend to $K$-theory (multiplying Grothendieck polynomials), and in the separated descent case, to equivariant $K$-theory. The two formulae arise (via quantum integrability) from fusion of minuscule quantized loop algebra representations in types $A$, $D$ respectively.

fields
Combinatorics
pdf ↗ page arXiv:2306.13855 ↗

We extend a positive Ricci curvature gluing theorem of Perelman to a range of positive intermediate curvature conditions, ranging from positive scalar curvature up to (and including) positive sectional curvature. As an application of this, we demonstrate that the observer moduli space of metrics with positive intermediate Ricci curvatures can have non-trivial higher homotopy groups. Further applications include deriving a sufficient condition for the existence of a metric with positive intermediate Ricci curvature and totally geodesic boundary.

comments
Final version, minor changes, to appear in Mathematische Annalen
fields
Differential Geometry, Geometric Topology
pdf ↗ page arXiv:2308.06996 ↗

We compute various types of iterated integrals of Eisenstein-Kronecker forms that are constructed from the Kronecker theta function. Furthermore, we relate the generating series of Gromov-Witten invariants of elliptic curves to these iterated integrals.

comments
v3 is the published version in CNTP; v4 is a minor revision with some typos corrected
journal
Communications in Number Theory and Physics, Vol. 20, Issue 2 (2026), pp. 309-351
fields
Complex Variables, Mathematical Physics, Algebraic Geometry
pdf ↗ page arXiv:2310.08018 ↗

We establish an analog of a theorem of Stallings which asserts the homomorphisms between the universal nilpotent quotients induced by a homomorphism $G \to H$ of groups are isomorphisms provided a pair of homological conditions are satisfied. Our analogy does not have a homomorphism between $G$ and $H$ but instead $G,H \leq G_0$ that satisfies a similar homological condition. We derive a few applications of this result. First, we show that there exist pairs of non-isomorphic number fields whose absolute Galois groups have isomorphic universal nilpotent quotients. We show that there exists pairs of non-isometric hyperbolic $n$-manifolds whose fundamental groups are residually nilpotent and have isomorphic universal nilpotent quotients. These are the first examples of residually nilpotent Kleinian groups with arbitrarily large nilpotent genus. Complex hyperbolic 2-manifold examples are given as well. Considering Riemann surfaces and complex hyperbolic 2-manifolds as projective curves and surfaces defined over a number field, we show the (outer) action of the absolute Galois group of the field of definition on the universal nilpotent quotients of the geometric fundamental groups are equivalent. This is in contrast to fact that the (outer) Galois action on the geometric fundamental group of a projective hyperbolic curve determines the curve by work of Mochizuki. In particular, the nilpotent representation theory of the geometric fundamental group is not anabelian.

comments
Theorem 1.9 is false as stated. The correct version requires additional assumptions and we no longer have an examples. There is nothing that can be salvaged
fields
Group Theory, Algebraic Geometry, Geometric Topology, Number Theory
pdf ↗ page arXiv:2310.08283 ↗

Given a Kaehler manifold polarised by a holomorphic ample line bundle, we consider the circle bundle associated to the polarisation with the induced transversal holomorphic structure. The space of contact structures compatible with this transversal structure is naturally identified with a bundle, of infinite rank, over the space of Kaehler metrics in the first Chern class of the polarisation. We show that the Einstein-Hilbert functional of the associated Tanaka-Webster connections is a functional on this bundle, whose critical points are constant scalar curvature Sasaki structures. In particular, when the group of automorphisms is discrete, these critical points correspond to constant scalar curvature Kaehler metrics in the first Chern class of the polarisation. We show that the Einstein–Hilbert functional satisfies some monotonicity properties along some one-parameter families of CR-contact structures that are naturally associated to test configurations, and that its limit on the central fibre of a test configuration is related to the Donaldson-Futaki invariant through an expansion in terms of an extra real parameter. As a by-product, we obtain an original proof that the existence of constant scalar curvature Kaehler metrics on a polarized manifold implies K-semistability. We also show that the limit of the Einstein-Hilbert functional on the central fibre coincides with the ratio of the equivariant index characters pole coefficients of the central fibre.

comments
44 pages. Submitted version of the paper
fields
Differential Geometry, Algebraic Geometry
pdf ↗ page arXiv:2310.11625 ↗

We propose a novel quantum algorithm for solving linear optimization problems by quantum-mechanical simulation of the central path. While interior point methods follow the central path with an iterative algorithm that works with successive linearizations of the perturbed KKT conditions, we perform a simulation working directly with the nonlinear complementarity equations. Using a two-stage quantum eigenpath traversal schedule, this approach yields an algorithm for solving linear optimization problems involving $m$ constraints and $n$ variables to $\varepsilon$-optimality using $\widetilde{O}\!\left((m+n)^{3/2}\,\varepsilon^{-1}+(m+n)^{1/2}\,\varepsilon^{-3/2}\right)$ queries to an oracle that evaluates a potential function. In the standard gate model (i.e., without access to quantum RAM), our algorithm can obtain $\varepsilon$-precise solutions to LO problems using at most $$\widetilde{O}\!\left(\left[\frac{(m+n)^{3/2}}{\varepsilon} + \frac{(m+n)^{1/2}}{\varepsilon^{3/2}}\right] \cdot \mathrm{nnz}(A)\right)$$ elementary gates, where $\mathrm{nnz}(A)$ is the total number of non-zero elements found in the constraint matrix.

comments
44 pages, 1 figure, appeared as a talk at QIP 2025
fields
Optimization and Control
pdf ↗ page arXiv:2311.03977 ↗

We study function fields of curves over a base field $K$ which is either a global field or a large field having a separable field extension of degree divisible by $4$. We show that, for any such function field, Hilbert's 10th Problem has a negative answer, the valuation rings containing $K$ are uniformly existentially definable, and the finitary holomorphy rings are definable by a universal-existential formula. In order to obtain these results, we develop further the usage of local-global principles for quadratic forms in function fields to definability of certain subrings. We include a first systematic presentation of this general method, without restriction on the characteristic.

comments
61 pages. Accepted for publication in Transactions of the American Mathematical Society
fields
Number Theory
pdf ↗ page arXiv:2311.06044 ↗

We study stochastic generalized Nash equilibrium (GNE) problems with heterogeneous, stochastic uncertainty in the cost functions. To address the distributional uncertainty, we let each agent construct an individual Wasserstein ambiguity set around an empirical distribution obtained from private data. We establish finite-sample robustness guarantees for any distributionally robust (DR) GNE. Focusing on variational equilibria, we derive a DR variational inequality (VI) reformulation and establish asymptotic consistency with the nominal stochastic game. Under mild conditions, we derive an exact finite-dimensional generalized Nash equilibrium reformulation. We then quantify how heterogeneous worst-case distributions affect monotonicity, and derive conditions for uniqueness and equilibrium sensitivity. To compute a variational DR GNE, we propose an inexact projected method and establish convergence under vanishing oracle errors, an asymptotic error bound under bounded oracle errors, and linear convergence under exact oracle evaluations.

fields
Optimization and Control
pdf ↗ page arXiv:2312.03573 ↗

Let $\mathcal{S}$ be a small category admitting binary products. There exists a canonical dictionary expressing the structure and properties of monoidal $\mathcal{S}$-fibered categories in terms of the external tensor product in place of the usual internal tensor product. In this paper, we specialize this dictionary to the setting of triangulated $\mathcal{S}$-fibered categories, by studying how the general translation process interacts with shift functors. Our results provide a satisfactory abstract framework to study monoidal structures from the perspective of perverse sheaves.

comments
37 pages; v2: revised introduction, some references added; v3: new title, structure of the paper modified (main results unchanged)
fields
Category Theory, Algebraic Geometry
pdf ↗ page arXiv:2401.13491 ↗

We prove an asymptotically sharp bound for the minimal doubling of a small measurable subset of a compact connected Lie group, settling a conjecture of Breuillard and Green. Namely, let $G$ be a compact connected Lie group of positive dimension $d_G$ with Haar probability measure $μ_G$, and let $ε> 0$. We show that for all compact subsets $A$ of sufficiently small measure we have \[μ_G(A^2) \geq \left(2^{d_G-d_M} - ε\right)μ_G(A),\] where $d_M$ is the maximal dimension of a proper closed subgroup. This recovers, by a different method, the small-measure doubling theorem of Jing–Tran–Zhang for $G=\mathrm{SO}_3(\mathbb{R})$. More generally, for every $ε>0$ and any pair of non-empty compact subsets $A,B$ of sufficiently small measure, we prove the Brunn–Minkowski-type inequality: \[ μ_G(AB)^{\frac{1}{d_G-d_M}} \geq (1-ε)\left( μ_G(A)^{\frac{1}{d_G-d_M}} + μ_G(B)^{\frac{1}{d_G-d_M}}\right).\] We also prove an inverse theorem in the semi-simple case: for any fixed $K\geq1$ and $δ>0$, every compact $K$-approximate subgroup of sufficiently small positive Haar measure is covered by $C(d_G,K)$ translates of the $δ$-neighbourhood of a proper closed connected subgroup. Our approach combines this inverse theorem with optimal transport and its recent applications to the Brunn–Minkowski inequality.

comments
39 pages. Revised exposition following anonymous comments. The stability result is moved to a separate paper
fields
Group Theory, Combinatorics
pdf ↗ page arXiv:2401.14062 ↗

This paper aims to study the decomposition group of a nonsingular plane cubic under the light of the log Calabi-Yau geometry. Using this approach we prove that an appropriate algorithm of the Sarkisov program in dimension 2 applied to an element of this group is automatically volume preserving. From this, we deduce some properties of the (volume preserving) Sarkisov factorization of its elements. We also confirm an expectation by Blanc, Pan and Vust on the splitting property of the canonical complex of a nonsingular plane cubic. Within a similar context in dimension 3, we exhibit in detail an interesting counterexample for a possible generalization of a theorem by Pan in which there exists a Sarkisov factorization obtained algorithmically that is not volume preserving.

comments
26 pages, 10 figures. Final version published. I thank both referees for their valuable comments that contributed to the improvement of this paper. The main result (Theorem 1.1) had its proof shortened
journal
Transformation Groups, 31(2), 2026
fields
Algebraic Geometry
pdf ↗ page arXiv:2402.13968 ↗

To study diffusion processes on the p-Wasserstein space $\mathscr P_p$ for $p\in [1,\infty)$ over a separable, reflexive Banach space $X$, we present a criterion on the quasi-regularity of Dirichlet forms in $L^2(\mathscr P_p,Λ)$ for a reference probability $Λ$ on $\mathscr P_p$. It is formulated in terms of an upper bound condition with the uniform norm of the intrinsic derivative. We find a versatile class of quasi-regular local Dirichlet forms on $\mathscr P_p$ by using images of Dirichlet forms on the tangent space $L^p(X\to X,μ_0)$ at a reference point $μ_0\in\mathscr P_p$. The Ornstein–Uhlenbeck type Dirichlet form and process on $\mathscr P_2$ are an important example in this class. We derive an $L^2$-estimate for the corresponding heat kernel and an integration by parts formula for the invariant measure.

comments
Sect. 3.2 & Sect. 4 revised
fields
Probability
pdf ↗ page arXiv:2402.15130 ↗

Convergence of stochastic integrals driven by Wiener processes $W_n$, with $W_n \to W$ almost surely in $C_t$, is crucial in analyzing SPDEs. Our focus is on the convergence of the form $\int_0^T V_n\, \mathrm{d} W_n \to \int_0^T V\, \mathrm{d} W$, where $\{V_n\}$ is bounded in $L^p(Ω\times [0,T];X)$ for a Banach space $X$ and some finite $p > 2$. This is challenging when $V_n$ converges to $V$ weakly in the temporal variable. We supply convergence results to handle stochastic integral limits when strong temporal convergence is lacking. A key tool is a uniform mean $L^1$ time translation estimate on $V_n$, an estimate that is easily verified in many SPDEs. However, this estimate alone does not guarantee strong compactness of $(ω,t)\mapsto V_n(ω,t)$. Our findings, especially pertinent to equations exhibiting singular behavior, are substantiated by establishing several stability results for stochastic transport equations and conservation laws.

comments
29 pages; some proofs and examples have been revised
fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2404.16157 ↗

The e-BH procedure is an e-value-based multiple testing procedure that provably controls the false discovery rate (FDR) under any dependence structure between the e-values. Despite this appealing theoretical FDR control guarantee, the e-BH procedure often suffers from low power in practice. In this paper, we propose a general framework that boosts the power of e-BH without sacrificing its FDR control under arbitrary dependence. This is achieved by the technique of conditional calibration, where we take as input the e-values and calibrate them to be a set of "boosted e-values" that are guaranteed to be no less -- and are often more -- powerful than the original ones. Our general framework is explicitly instantiated in three classes of multiple testing problems: (1) testing under parametric models, (2) conditional independence testing under the model-X setting, and (3) model-free conformalized selection. Extensive numerical experiments show that our proposed method significantly improves the power of e-BH while continuing to control the FDR. We also demonstrate the effectiveness of our method through an application to an observational study dataset for identifying individuals whose counterfactuals satisfy certain properties.

comments
Under minor revision at Journal of the Royal Statistical Society: Series B
fields
Statistics Theory
pdf ↗ page arXiv:2404.17562 ↗

In 1961, Dirac showed that chordal graphs are exactly the graphs that can be constructed from complete graphs by a sequence of clique-sums. In an earlier paper, by analogy with Dirac's result, we introduced the class of $GF(q)$-chordal matroids as those matroids that can be constructed from projective geometries over $GF(q)$ by a sequence of generalized parallel connections across projective geometries over $GF(q)$. Our main result showed that when $q=2$, such matroids have no induced minor in $\{M(C_4),M(K_4)\}$. In this paper, we show that the class of $GF(2)$-chordal matroids coincides with the class of binary matroids that have none of $M(K_4)$, $M^*(K_{3,3})$, or $M(C_n)$ for $n\geq 4$ as a flat. We also show that $GF(q)$-chordal matroids can be characterized by an analogous result to Rose's 1970 characterization of chordal graphs as those that have a perfect elimination ordering of vertices.

fields
Combinatorics
pdf ↗ page arXiv:2405.02099 ↗

We show that a locally finite, connected graph has a coarse embedding into a Hilbert space if and only if there exist bond percolations with arbitrarily large marginals and two-point function vanishing at infinity. We further show that the decay of the two-point function is stretched exponential with stretching exponent $α\in[0,1]$ if and only if the $L^1$-compression exponent of the graph is at least $α$, leading to a probabilistic characterization of this exponent. These results are new even in the particular setting of Cayley graphs of finitely generated groups. The proofs build on new probabilistic methods introduced recently by the authors to study group-invariant percolation on Cayley graphs [28,29], which are now extended to the general, non-symmetric situation of graphs to study their coarse embeddability and $L^1$-compression exponents.

comments
Revised and accepted version, to appear in "International Mathematics Research Notices"
fields
Probability, Metric Geometry
pdf ↗ page arXiv:2406.04222 ↗

We consider a gas of bosons interacting through a three-body hard-core potential in the thermodynamic limit. We derive an upper bound on the ground state energy of the system at the leading order using a Jastrow factor. Our result matches the lower bound proven by Nam-Ricaud-Triay and therefore resolves the leading order. Moreover, a straightforward adaptation of our proof can be used for systems interacting via combined two-body and three-body interactions to generalise a result by one of the authors (Ann. Henri Poincaré, 2026) to hard-core potentials.

comments
9 pages. Final version published in Letters in Mathematical Physics
journal
Lett Math Phys 116, 43 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2406.09019 ↗

We study the asymptotic distribution of the Galois orbits of generic sequences of algebraic points of small height in a projective variety over a number field. Our main result is a generalization of Yuan's equidistribution theorem that applies to heights for which Zhang's lower bound for the essential minimum is not necessarily an equality. It extends to all projective varieties a theorem of Burgos Gil, Philippon, Rivera-Letelier and the second author for toric varieties. It also applies to sums of canonical heights for an algebraic dynamical system, and in particular it recovers Kühne's semiabelian equidistribution theorem. We also generalize previous work of Chambert-Loir and Thuillier to obtain new logarithmic equidistribution results. Finally we extend our main result to the quasi-projective setting recently introduced by Yuan and Zhang.

comments
83 pages. Minor revision, results unchanged. Section numbering has been changed to match the published version
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2407.14978 ↗

We study a nonlocal Cahn-Hilliard model for a multicomponent mixture with cross-diffusion effects and degenerate mobility. The nonlocality is described by means of a symmetric singular kernel. We define a notion of weak solution adapted to possible degeneracies and prove, as our first main result, its global-in-time existence. The proof relies on an application of the formal gradient flow structure of the system (to overcome the lack of a priori estimates), combined with an extension of the boundedness-by-entropy method, involving a careful analysis of an auxiliary variational problem. This allows to obtain solutions to an approximate, time-discrete system. Letting the time step size go to zero, we recover the desired nonlocal weak solution where, due to their low regularity, the Cahn-Hilliard terms require a special treatment. Finally, we prove convergence of solutions for this class of nonlocal Cahn-Hilliard equations to their local counterparts.

fields
Analysis of PDEs
pdf ↗ page arXiv:2408.07396 ↗

The main purpose of this paper is to provide new, more uniform model-theoretic and combinatorial proofs of the preservation theorems established in [5] and [8]. More precisely, we show that randomization preserves both $NIP$ and stability: if a first-order theory $T$ has $NIP$, then so does $T^R$, and if $T$ is stable, then so is $T^R$. Our proofs rely on the systematic use of simple models of $T^R$ and quantitative combinatorial methods. In the $NIP$ case, we use indiscernible arrays and Rademacher mean width, whereas in the stable case, we use a Ramsey lemma for cross-blocks and sequential Rademacher mean width. Using simple models of $T^R$ has the advantage of allowing us to re-prove these theorems in a simpler and quantitative manner. We finally turn our attention to $NSOP$ in randomization. We show that based on the definition of $NSOP$ given in [14], $T^R$ is stable if and only if it is $NIP$ and $NSOP$.

comments
34 pages. In this version, the section on stability has been completed, and further supplementary explanations have been provided in the NIP section. Comments welcome. k.khanaki @ gmail.com
fields
Logic, Combinatorics
pdf ↗ page arXiv:2408.15014 ↗

This work establishes the existence of rate-independent elastoplastic evolutions driven by dislocation fields in single crystals via a homogenisation procedure. We use the theory of space-time currents to place the Small-Distortion Geometric Model of [arXiv:2609.23728] on a rigorous footing and conduct the homogenisation by using recently developed normal-to-integral strict approximation results for space-time currents which respect the inherent space-time structure. We prove both a homogenisation and recovery result and thus demonstrate that the field version of the Small-Distortion Geometric Model is well-justified from microscopic principles.

comments
56 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2410.02906 ↗

We establish a precise correspondence between points of the $m=4$ tree momentum amplituhedron and origami crease patterns. As an application, we prove that the BCFW (Britto-Cachazo-Feng-Witten) cells triangulate the $m=4$ tree amplituhedron both in momentum space and in momentum-twistor space. As another application, we show that every nondegenerate weighted planar bipartite graph $Γ$ admits a t-embedding, i.e., an embedding of the planar dual of $Γ$ such that the sum of angles of white (equivalently, black) faces around each vertex is equal to $π$.

comments
79 pages, 16 figures. First paper in the series (see arXiv:2606.03439 for part 2). v2: Major revision. Added a proof of the BCFW tiling conjecture in momentum-twistor space via T-duality and a new proof of the origami-amplituhedron correspondence using double-dimer model identities. Full changelog at the end of the introduction. v3: Minor updates
fields
Mathematical Physics, Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2410.09574 ↗

The Coleman power series defined on a Lubin–Tate tower of extensions over $K$ are compatible with respect to two formal group laws: the multiplicative formal group law and some Lubin–Tate formal group law defined over $\mathcal{O}_K$. We ask if it is possible to generalize Coleman series in order to find series which are compatible with respect to any two Lubin–Tate formal group laws in the same way. We provide a precise formulation of this question and a partial answer towards the classification of all such power series that involves the eigenspaces of Coleman's trace operator. Some additional eigenspaces of Coleman's trace operator are also introduced. These new eigenspaces are used to construct certain fixed points of the $ψ$-operator on the family of trianguline dihedral $(\varphi, Γ)$-modules.

fields
Number Theory
pdf ↗ page arXiv:2410.10029 ↗

We study Fourier-Mukai equivalences of (families of) abelian varieties and K3 surfaces in positive and mixed characteristics. We first prove in any characteristics that Fourier-Mukai partners of abelian varieties are again abelian varieties. We subsequently focus on the canonical lifts of ordinary abelian varieties and ordinary K3 surfaces. For such schemes, we show that Fourier-Mukai equivalences on the special fibers can be lifted to the canonical lifts. We also prove that the relative Fourier-Mukai partners of the canonical lifts are in bijection with the Fourier-Mukai partners of the special fibers. We conclude by demonstrating that the last result can be used to recover the ordinary case of a result originally proved by Honigs, Lombardi and Tirabassi.

comments
25 pages. v3: made several revisions reflecting comments from a referee and S. Moore
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2410.14065 ↗

In many control problems, actions consume a resource budget, such as a wear allowance, and the probability of exhausting it within a given horizon must stay below a tolerance. A simple, widely used approach is to augment the state with the remaining budget, subtract an interior barrier from the utility and penalize exhaustion, so that policy-gradient methods can be applied unchanged. We clip the combined one-step reward from below at a level m to keep the returns of exploratory policies finite. The clip level is a price of failure risk, since the clipped value decomposes exactly into the utility before failure, the cost of the interior margin and m times a geometric failure risk. Consequently, an approximately optimal policy maximizes utility net of margin cost among policies with no greater risk. Its risk exceeds that of any comparison policy by at most order 1/m and can be certified from its value or from validation data. Our main result proves exponential convergence of the population policy-gradient flow for every parameter regularizer that is convex along generalized geodesics and sufficiently strong relative to the price. This extends the mean-field analysis from relative entropy to weight decay and to finite networks. Relative entropy adds parameter noise and a pull toward a prior, whereas weight decay provides only the pull. Action regularization bounds changes in failure risk by the relative entropy to a reference policy. The bounds are evaluated on an exact maintenance benchmark, a fuel-tank controller, a solvable flow and a benchmark-suite task.

comments
40 pages, 8 figures, 1 table; Online Resource 1 (36 pages) as an ancillary file. Revised version; replaces v3 (text revised, the paper made independent of the Online Resource). Code: https://github.com/pma-papers/bpg-replication
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2411.19193 ↗

We define the not-abelian Open-Gromov-Witten partition function.

fields
Symplectic Geometry
pdf ↗ page arXiv:2412.06450 ↗

This paper studies the $N$-particle systems as well as the HJB/master equations for a class of generalized mean field control (MFC) problems and the corresponding potential mean field games of control (MFGC). A local in time classical solution for the HJB equation is generated via a probabilistic approach based on the mean field maximum principle. Given an extension of the so called displacement convexity condition, we obtain the uniform estimates on the HJB equation for the $N$-particle system. Such estimates imply the displacement convexity/semi-concavity and thus the prior estimates on the solution to the HJB equation for generalized MFC problems. The global well-posedness of HJB/master equation for generalized MFC/potential MFGC is then proved thanks to the local well-posedness and the prior estimates. In view of the nature of the displacement convexity condition, such well-posedness is also true for the degenerated case. Our analysis on the $N$-particle system also induces an Lipschitz approximator to the optimal feedback function in generalized MFC/potential MFGC where an algebraic convergence rate is obtained. Furthermore, an alternative approximate Nash equilibrium is proposed based on the $N$-particle system, where the approximation error is quantified thanks to the aforementioned uniform estimates.

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

We formulate and prove the archimedean period relations for Rankin-Selberg convolutions of $\text{GL}(n)\times \text{GL}(n)$ and $\text{GL}(n)\times \text{GL}(n-1)$, for all generic cohomological representations. As a consequence, we prove the non-vanishing of the archimedean modular symbols. This extends the earlier results in [LLS24] for essentially tempered representations of $\text{GL}(n)\times\text{GL}(n-1)$.

comments
Minor mistakes in the published version are corrected
journal
Adv. Math. 478 (2025), 110393
fields
Representation Theory
pdf ↗ page arXiv:2412.18805 ↗

In this paper, we define and study a nested family of reproducing kernel Hilbert spaces of vector fields that is indexed by a range of scales, from which we construct a reproducing kernel Hilbert space of scale-dependent vector fields. We provide a characterization of the reproducing kernel of that space, with numerical approximations ensuring quick evaluations when this kernel does not have a closed form. We then introduce a multiscale version of the large deformation diffeomorphic metric mapping (LDDMM) problem and prove the existence of solutions. Finally, we provide numerical experiments performing landmark matching using multiscale LDDMM.

fields
Numerical Analysis
pdf ↗ page arXiv:2501.04031 ↗

Friedl and Löh (2021, Confl. Math.) prove that testing whether or not there is an epimorphism from a finitely presented group to the direct product of an abelian and a finite group, or to a virtually cyclic group, is decidable. Here we prove that these problems are $\mathsf{NP}$-complete. In addition, we show that testing epimorphism is $\mathsf{NP}$-complete when the target is is the semi-direct product of a finitely generated free-abelian group and a finite group which factors through $\{\pm\text{Id}\}$, thus extending the class of virtually abelian target groups for which decidability of epimorphism is known.

comments
27 pages. Sections 7-9 of previous version of this paper split into a separate article arxiv:TBA
fields
Group Theory
pdf ↗ page arXiv:2501.05283 ↗

In this paper we propose a framework to analyze iterative first-order optimization algorithms for time-varying convex optimization. We assume that the temporal variability is caused by a time-varying parameter entering the objective, which can be measured at the time of decision but whose future values are unknown. We consider the case of strongly convex objective functions with Lipschitz continuous gradients under a convex constraint set. We model the algorithms as discrete-time linear parameter varying (LPV) systems in feedback with monotone operators such as the time-varying gradient. We leverage the approach of analyzing algorithms as uncertain control interconnections with integral quadratic constraints (IQCs) and generalize that framework to the time-varying case. We propose novel IQCs that are capable of capturing the behavior of time-varying nonlinearities and leverage techniques from the LPV literature to establish novel bounds on the tracking error. Quantitative bounds can be computed by solving a semi-definite program and can be interpreted as an input-to-state stability result with respect to a disturbance signal which increases with the temporal variability of the problem. As a departure from results in this research area, our bounds introduce a dependence on different additional measures of temporal variations, such as the function value and gradient rate of change. We exemplify our main results with numerical experiments that showcase how our analysis framework is able to capture convergence rates of different first-order algorithms for time-varying optimization through the choice of IQC and rate bounds.

fields
Optimization and Control
pdf ↗ page arXiv:2501.07461 ↗

In this article, we investigate the existence of a deep neural network (DNN) capable of approximating solutions to partial integro-differential equations while circumventing the curse of dimensionality. Using the Feynman-Kac theorem, we express the solution in terms of stochastic differential equations (SDEs). Based on several properties of classical estimators, we establish the existence of a DNN that satisfies the necessary assumptions. The results are theoretical and don't have any numerical experiments yet.

fields
Numerical Analysis
pdf ↗ page arXiv:2501.10880 ↗

We introduce partial Markov categories as a synthetic framework for synthetic probabilistic inference, blending the work of Cho and Jacobs, Fritz, and Golubtsov on Markov categories with the work of Cockett and Lack on cartesian restriction categories. We describe observations, Bayes' theorem, normalisation, and both Pearl's and Jeffrey's updates in purely categorical terms.

comments
Extended version of "Evidential Decision Theory via Partial Markov Categories", arXiv:2301.12989
fields
Category Theory
pdf ↗ page arXiv:2502.03477 ↗

This series of papers is a contribution to the program of classifying $p$-blocks of finite groups up to source algebra equivalence, starting with the case of cyclic blocks. To any $p$-block $\mathbf{B}$ of a finite group with cyclic defect group $D$, Linckelmann associated an invariant $W( \mathbf{B} )$, which is an indecomposable endo-permutation module over $D$, and which, together with the Brauer tree of $\mathbf{B}$, essentially determines its source algebra equivalence class. In Parts II-IV of our series of papers, we classify, for odd $p$, those endo-permutation modules of cyclic $p$-groups arising from $p$-blocks of quasisimple groups. In the present Part II, we reduce the desired classification for the quasisimple classical groups of Lie type $B$, $C$, and $D$ to the corresponding objective for the general linear and unitary groups; the classification is completed for the latter groups.

comments
35 pages, part II of a series of 4 articles, 2 minor corrections
fields
Representation Theory, Group Theory
pdf ↗ page arXiv:2502.09176 ↗

We provide a new foundational approach to the generalization of terms up to equational theories. We interpret generalization problems in a universal-algebraic setting making a key use of projective and exact algebras in the variety associated to the considered equational theory. We prove that the generality poset of a problem and its type (i.e., the cardinality of a complete set of least general solutions) can be studied in this algebraic setting. Moreover, we identify a class of varieties where the study of the generality poset can be fully reduced to the study of the congruence lattice of the 1-generated free algebra. We apply our results to varieties of algebras and to (algebraizable) logics. In particular we obtain several examples of unitary type: abelian groups; commutative monoids and commutative semigroups; all varieties whose 1-generated free algebra is trivial, e.g., lattices, semilattices, varieties without constants whose operations are idempotent; Boolean algebras, Kleene algebras, and Gödel algebras, which are the equivalent algebraic semantics of, respectively, classical, 3-valued Kleene, and Gödel-Dummett logic. Finally, we prove that the variety of MV-algebras, the equivalent algebraic semantics of Lukasiewicz logic, has nullary type.

fields
Logic
pdf ↗ page arXiv:2502.18259 ↗

In this paper we explore generalisations to a random digraph model designed for modelling cell-cell interactions (RaCInG). In its baseline model -- tested both theoretically and in biological practice -- a fixed number of arcs are assigned uniformly at random to vertices that have suitable types to accept them. Generalisations to this model are explored in two directions: constructing an undirected graph version of the model, and incorporating spatial information. Both directions are driven by biological demands: better interpretability and adaptation to technological advances. We show not only that these generalisations are theoretically possible within the framework of RaCInG, but that they can be made rigorous, proving that RaCInG creates a flexible random graph framework to model cell-cell interactions.

comments
36 pages, 5 figures
journal
Journal of Complex Networks, Volume 14, Issue 6, December 2026, cnag039
fields
Probability
pdf ↗ page arXiv:2502.21083 ↗

In this paper, we utilize the theory of non-Kähler loci by S. Boucksom to construct an integral $2$-cohomology class whose restriction to a general fiber is big, and then construct a relatively big line bundle via the exponential sequence. This leads to a local Moishezonness criterion for fibrations whose total spaces are compact complex manifolds in the Fujiki class $\mathscr{C}$, generalizing the bimeromorphic version of F. Campana's local projectivity theorem. We further combine a similar idea with the singular Demailly–Păun theorem by T. Collins–V. Tosatti to obtain a local projectivity criterion for fibrations from compact Kähler manifolds, yielding a new proof and a generalization of F. Campana's local projectivity theorem.

comments
This version mainly adds Subsection 4.2, establishing the Fujiki relation for hyperfujiki manifolds and proving that any fibration from a hyperfujiki manifold onto a lower-dimensional normal compact Kahler space is Lagrangian
journal
Differential Geometry and its Applications 105 (2026), 102452
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2503.07548 ↗

For a Lie groupoid $G$, the differential forms on its nerve comprise a double complex. A natural question is if this statement extends to forms with values in a representation $V$ of $G$. In this paper, we research two types of covariant derivatives which commute with the simplicial differential, yielding two types of curved double complexes of forms with coefficients in $V$. The naive approach is to consider a linear connection $\nabla$ on $V$, in which case $d^\nabla$ commutes with the simplicial differential if and only if $\nabla$ satisfies a certain (restrictive) invariance condition. The heart of this paper focuses on another, more compelling approach: using a multiplicative Ehresmann connection for a bundle of ideals. In this case, we obtain a geometrically richer curved double complex, where the cochain map is given by the horizontal exterior covariant derivative $D$, which generalizes the well-known operator from the theory of principal bundles. Moreover, both differential operators $d^\nabla$ and $D$ are researched in the infinitesimal setting of Lie algebroids, as well as their relationship with the van Est map. We conclude by using the operator $D$ to study the curvature of an (infinitesimal) multiplicative Ehresmann connection.

comments
66 pages
fields
Differential Geometry
pdf ↗ page arXiv:2503.08873 ↗

We introduce a novel exclusion process with a simple local kinetic constraint that leads to a remarkable transition between a homogeneous phase with short-range correlations and a clustered phase with long-range correlations and spontaneous breaking of translation invariance. The metastable dynamics of particle clusters lead to a coarsening cascade and glassy dynamics, as well as an intriguing faster-is-slower effect where an increasing asymmetry in the flow direction leads to a decrease of the stationary current.

fields
Mathematical Physics
pdf ↗ page arXiv:2503.12632 ↗

We consider the action of a finite group $G$ by locality preserving automorphisms (quantum cellular automata) on quantum spin chains. We refer to such group actions as ``symmetries''. The natural notion of equivalence for such symmetries is \emph{stable equivalence}, which allows for stacking with factorized group actions. Stacking also endows the set of equivalence classes with a group structure. We prove that the anomaly of such symmetries provides an isomorphism between the group of stable equivalence classes of symmetries with the cohomology group $H^3(G,U(1))$, consistent with previous conjectures. This amounts to a complete classification of locality preserving symmetries on spin chains.

comments
23 pages, 4 figures, We corrected an inconsequential error in the proof of lemma 5.6. by compressing Lemmas 5.6, 5.7 and 5.8 into Lemma 5.6
journal
Communications in Mathematical Physics, volume 407, issue 1 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2503.15088 ↗

We generalize Reiner–Saliola–Welker's well-known but mysterious family of *$k$-random-to-random shuffles* from Markov chains on symmetric groups to Markov chains on Type-$A$ Iwahori–Hecke algebras. We prove that these operators pairwise commute, and that their eigenvalues are polynomials in $q$ with non-negative integer coefficients; we express these eigenvalues in a closed form as certain symmetric function evaluations (which is new even for $q=1$). We show that these operators are simultaneously diagonalizable for almost all $q$, and combinatorially express the dimension of the subalgebra they generate. Our work generalizes and extends work of Reiner–Saliola–Welker and Lafrenière for the symmetric group, and simplifies all known proofs in this case.

comments
40 pages main text + 17 pages of appendices. v4 adds many new results, including better formulas for the eigenvalues (as evaluations of supersymmetric functions) and the dimension of the subalgebra generated by the operators, and a diagonalizability claim for all "2n-safe" q. The proofs of the eigenvalues have been rewritten as well. Comments are welcome!
fields
Combinatorics, Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2503.17580 ↗

We present e cient algorithms for computing isogenies between hyperelliptic curves, leveraging higher genus curves to enhance cryptographic protocols in the post-quantum context. Our algorithms reduce the computational complexity of isogeny computations from O(g4) to O(g3) operations for genus 2 curves, achieving significant ciency gains over traditional elliptic curve methods. Detailed pseudocode and comprehensive complexity analyses demonstrate these improvements both theoretically and empirically. Additionally, we provide a thorough security analysis, including proofs of resistance to quantum attacks such as Shor's and Grover's algorithms. Our findings establish hyperelliptic isogeny-based cryptography as a promising candidate for secure and e cient post-quantum cryptographic systems.

comments
arXiv admin note: This submission has been withdrawn because it does not meet arXiv's research content quality standards
fields
Number Theory
pdf ↗ page arXiv:2504.04559 ↗

Flow Matching has recently gained attention in generative modeling as a simple and flexible alternative to diffusion models. While existing statistical guarantees adapt tools from the analysis of diffusion models, we take a different perspective by connecting Flow Matching to kernel density estimation. We first verify that the kernel density estimator matches the optimal rate of convergence in Wasserstein distance up to logarithmic factors, improving existing bounds for the Gaussian kernel. Based on this result, we prove that for sufficiently large networks, Flow Matching achieves the optimal rate up to logarithmic factors. If the target distribution lies on a lower-dimensional manifold, we show that the kernel density estimator profits from the smaller intrinsic dimension on a small tube around the manifold. The faster rate also applies to Flow Matching, providing a theoretical foundation for its empirical success in high-dimensional settings.

fields
Statistics Theory
pdf ↗ page arXiv:2504.13336 ↗

We establish a generalized version of the duality between groups and the categories of their representations on sets. Given an abstract symmetric monoidal category $K$ called Galois prekosmos, we define pre-Galois objects in $K$ and study the categories of their representations internal to $K$. The motivating example of $K$ is the cartesian monoidal category $\textit{Set}$ of sets, and pre-Galois objects in $\textit{Set}$ are groups. We present an axiomatic definition of pre-Galois $K$-categories, which is a complete abstract characterization of the categories of representations of pre-Galois objects in $K$. The category of covering spaces over a well-connected topological space is a prototype of a pre-Galois $\textit{Set}$-category. We establish a perfect correspondence between pre-Galois objects in $K$ and pre-Galois $K$-categories pointed with pre-fiber functors. We also establish a generalized version of the duality between flat affine group schemes and the categories of their linear representations. Given an abstract symmetric monoidal category $K$ called Grothendieck prekosmos, we define what are pre-Grothendieck objects in $K$ and study the categories of their representations internal to $K$. The motivating example of $K$ is the symmetric monoidal category $\textit{Vec}_k$ of vector spaces over a field $k$, and pre-Grothendieck objects in $\textit{Vec}_k$ are affine group $k$-schemes. We present an axiomatic definition of pre-Grothendieck $K$-categories, which is a complete abstract characterization of the categories of representations of pre-Grothendieck objects in $K$. The indization of a neutral Tannakian category over a field $k$ is a prototype of a pre-Grothendieck $\textit{Vec}_k$-category. We establish a perfect correspondence between pre-Grothendieck objects in $K$ and pre-Grothendieck $K$-categories pointed with pre-fiber functors.

comments
This is the author's Ph.D. thesis (POSTECH, 2025). The arXiv manuscript has the same mathematical content as the original thesis, with only two minor wording corrections. The work was further developed in the joint paper with Jae-Suk Park, arXiv:2610.25143 (2026). v2: Comments updated; manuscript unchanged from v1
fields
Algebraic Geometry
pdf ↗ page arXiv:2504.20949 ↗

In this paper, we introduce a practical GPU-enhanced matrix-free first-order method for solving large-scale conic programming problems, which we refer to as PDCS, standing for the Primal-Dual Conic Programming Solver. Problems that it solves include linear programs, second-order cone programs, convex quadratic programs, and exponential cone programs. The method avoids matrix factorizations and uses sparse matrix-vector multiplication as its core operation, which is memory-efficient and well suited for GPU acceleration. It builds on a variant of the primal-dual hybrid gradient method (PDHG) called reflected restarted Halpern PDHG with averaging, which we prove converges on general conic programs, and further incorporates several practical enhancements. Its GPU implementation, cuPDCS, uses customized computational schemes that assign cones of different types and sizes to different levels of the GPU architecture. Numerical experiments demonstrate that cuPDCS is generally more efficient than state-of-the-art commercial solvers and other first-order methods on large-scale conic program applications, including Fisher market equilibrium problems, Lasso regression, and multi-period portfolio optimization. cuPDCS also exhibits better scalability, efficiency, and robustness compared to other first-order methods on the conic program benchmark dataset CBLIB. These advantages are more pronounced in large-scale settings.

comments
40 pages, 7 figures
fields
Optimization and Control
pdf ↗ page arXiv:2505.00311 ↗

Viewing the Cayley-Dickson process as a graded construction provides a rigorous definition of associativity consisting of three classes, which divides the non-associative parts into four types. These simplify the Moufang loop identities and Malcev's identity and categorise non-associative loops. Analysing the non-associativity structure of sedenions and higher level Cayley-Dickson algebras uncovers octonion and three quasi-octonion, power-associative subalgebras. Power-associativity is proved to grow by multiples of seven that introduce zero divisors in factors of 84 for all Cayley-Dickson algebras. It is convenient to replace the terminology hypercomplex numbers with ultracomplex numbers to capture the quasi-algebras and since sedenions and higher level Cayley-Dickson algebras contain quasi-algebras these are ultracomplex. The non-associative types reduce the 84 zero divisors in sedenions via three cycles and four modes down to seven primary zero divisor pairs providing new techniques to analyse the seven quasi-octonions loops in sedenions. The graded notation allows the eight octonion and seven quasi-octonion subalgebras of sedenions to be uniquely derived, up to representation. The zero divisors for split sedenion algebras are analysed and mappings between three of these are provided showing 180 zero divisors and the other split algebra is analogous to sedenions with 84 zero divisors. These split algebras are shown to involve quasi-octonion algebras with mixed signature.

comments
Version 2 has a minor correction to Theorem 8 which leads to a correction to Theorem 10, the zero divisors formula. Version 3 replaces Theorem 13 with analysis of both split sedenion algebras. Theorems are more complete using calibrations and XOR operations. Version 4 correctly derives Theorem 8
fields
Rings and Algebras
pdf ↗ page arXiv:2505.11747 ↗

We establish the tightest possible Robertson-type preparation uncertainty relation, which explicitly depends on the eigenvalues of the quantum state. The conventional constant $ \tfrac{1}{4} $ is replaced by the state-dependent coefficient \[ \frac{(λ_{\max} + λ_{\min})^2}{4(λ_{\max} - λ_{\min})^2}, \] where $ λ_{\max} $ and $λ_{\min}$ denote the largest and smallest eigenvalues of the density operator $ ρ$, respectively. We prove that this coefficient is optimal among all Robertson-type generalizations and does not admit further improvement. We also obtain a complete characterization of all nontrivial equality cases. Our relation becomes more pronounced as the quantum state becomes more mixed, capturing a trade-off in quantum uncertainty that the conventional Robertson's relation fails to detect. In addition, our result also provides a strict generalization of the Schrödinger's uncertainty relation, showing that the uncertainty trade-off is governed by the sum of the covariance term and a state-dependent improvement over the Robertson bound. As applications, we also refine error-disturbance trade-offs by incorporating spectral information of both the system and the measuring apparatus, thereby generalizing the Arthurs-Goodman and Ozawa inequalities.

comments
13 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2505.19861 ↗

We give explicit cubic equations for the wild character varieties corresponding to the rank 3 representations of Painlevé equations, and compare them to the ones of their classical rank 2 representations.

comments
32 pages, 1 figure, 2 tables. v2: minor changes, references added, introduction expanded, v3: final version, to appear in Annales de l'Institut Fourier
fields
Algebraic Geometry
pdf ↗ page arXiv:2505.21186 ↗

We construct examples of Noetherian three-dimensional local geometrically normal domains of prime characteristic which are $F$-injective but not $F$-full. Along the way, we find examples of two-dimensional local geometrically normal domains which are $F$-injective but not $F$-anti-nilpotent. A crucial theme of our constructions is the behavior of $F$-injectivity along a purely inseparable finite base change.

comments
v1: 11 pages, comments welcome. v2: minor changes; v3: final accepted version with minor changes
journal
Épijournal de Géométrie Algébrique, Volume 10 (2026), Article no. 21
fields
Commutative Algebra
pdf ↗ page arXiv:2506.00646 ↗

We investigate how a two-dimensional spatial embedding changes the entanglement observed across geometrically local bipartitions of a one-dimensional quantum spin chain. A $q$-deformed colored Motzkin chain is placed along a spiral-inspired Hamiltonian path that visits $N(L)=Θ(L^2)$ sites of a square-lattice region while retaining a path interaction graph. Straight ambient-space cuts then correspond to unions of $Θ(L)$ disconnected intervals in the chain ordering. We derive the scaling of a height-variation proxy for the leading color-pairing contribution and predict ambient-space entropy scaling proportional to $L^2$, $L$, and $O(1)$ for $q>1$, $q=1$, and $q<1$, respectively. We evaluate this proxy numerically using the matrix-product-state representation and verify its predicted finite-size scaling. The embedded and original Hamiltonians have exactly identical spectra and spectral gaps at fixed chain length. We also describe a sparse tensor-network representation and propose a two-chain junction extension. These results isolate the roles of interaction connectivity, spatial embedding, and subsystem geometry in entanglement scaling.

comments
17 pages, 9 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2506.02103 ↗

This article revisits the spherical-Dirichlet distribution (SDD) introduced by Guardiola (2020) and clarifies the correction to its density presented in an earlier version of this preprint. The principal issue concerns Equation (3) of the original publication, which expresses the density in local Euclidean coordinates rather than with respect to spherical surface-area measure. We derive the corrected intrinsic density and revisit its moments, covariance matrix, mode, and limiting properties. We show that the two density representations describe the same probability distribution, preserving the moment formulas and likelihood-based parameter estimation. However, the mode and uniformity conditions depend on the reference measure and require corresponding clarification. Reported simulation and text mining estimates are revisited and updated. The resulting presentation reconciles the original construction with its intrinsic spherical properties.

comments
9 pages, 1 figure with four panels. Revised to clarify coordinate and spherical surface-area densities, mode and uniformity conditions, and parameter estimation; numerical summaries updated. Corrects and extends Guardiola, J. Stat. Distrib. App. 7, 6 (2020), https://doi.org/10.1186/s40488-020-00106-9
fields
Statistics Theory
pdf ↗ page arXiv:2506.04441 ↗

Given $\mathscr{B}\subseteq\mathbb{N}$, let $\mathcal{M}_\mathscr{B}$ be its set of multiples; $\mathscr{B}$ is called Besicovitch if $\mathcal{M}_\mathscr{B}$ has natural density. With $\mathscr{B}$ one associates its tautification $\mathscr{B}'$, the unique taut set with the same Mirsky measure, and the minimal set $\mathscr{B}^*$, which determines the unique minimal subsystem of the $\mathscr{B}$-free subshift. It is known that if $\mathscr{B}'$ is Besicovitch, then so is $\mathscr{B}$. We show that this is the only restriction: all six combinations of the Besicovitch property for $\mathscr{B},\mathscr{B}',\mathscr{B}^*$ compatible with it occur. To this end we prove that every taut set is the tautification of a Besicovitch set, and that every minimal set is the minimal set associated with a Besicovitch taut set. We also show that $\mathcal{M}_{\mathscr{B}'}\setminus\mathcal{M}_\mathscr{B}$ may have positive upper Banach density even if $\mathscr{B}$ and $\mathscr{B}'$ are both Besicovitch in which case this set has zero natural density.

comments
32 pages
fields
Dynamical Systems, Number Theory
pdf ↗ page arXiv:2506.10218 ↗

In this paper, our main goal is to study the evolution problem associated with the Laplacian operator with Dirichlet boundary conditions on a regular tree. To this end, we place special emphasis on the associated first eigenvalue problem, which provides the fundamental tool for describing the long-time dynamics. First, we prove existence and uniqueness of solutions when the initial condition is compatible with the boundary condition. Next, we address the asymptotic behavior of the solutions and show that they decay to zero exponentially fast. This decay rate is determined by the associated first eigenvalue, which we also analyze in detail.

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

Coordination games with explicit spatial or relational structure are of interest to economists, ecologists, sociologists, and others studying emergent global properties in collective behavior. When assemblies of individuals seek to coordinate action with one another through myopic best response or other replicator dynamics, the resulting dynamical system can exhibit many rich behaviors. Here we seek to understand these coordination dynamics in the non-atomic setting by use of a nonlinear, nonlocal diffusion equation framework. For this class of nonlocal equations, we prove existence and uniqueness for the initial value problem in the free boundary case and, with certain conditions on the underlying game theory, we go further and prove a maximum principle, weak regularity results, and a characterization of asymptotic behavior. Additionally, with the help of several numerical results, we present several modeling results, characterizing stationary solutions both rigorously and through numerical experiments.

fields
Dynamical Systems
pdf ↗ page arXiv:2506.13929 ↗

Let $q\equiv3\pmod4$ be a fixed odd prime power. We study the first moment of central values of primitive quartic Dirichlet $L$-functions over $\F_q[T]$, with fixed genus $g$ and with $χ^2$ primitive. We obtain a main term $C_q q^{2g/3}$ and a secondary term $(α_r g+β_r)q^{g/2}$, with error $O_{q,\eps}(q^{(16/33+\eps)g})$, where $r\equiv g/3+1\pmod4$. The constants are explicit, with $C_q>0$ and $α_r<0$ for every $r$. We use a double Dirichlet series and the functional equation of the quartic Gauss sum generating series to compute the residues and obtain the continuation needed to separate both terms.

fields
Number Theory
pdf ↗ page arXiv:2506.14656 ↗

We introduce the notion of rational structure on a quiver and associated representations to establish a coherent framework for studying quiver representations in separable field extensions. This notion is linked to a refinement of the notion of $K$-species, which we term étale $K$-species. We establish a categorical anti-equivalence between $K$-rational quivers and étale $K$-species, which extends to an equivalence of their respective representation categories. For $K$-rational quivers there is a canonical notion of base change, which suggests a corresponding notion of base change for (étale) $K$-species which we elaborate. As a primary application, we generalize Gelfand's celebrated equivalence between certain blocks of Harish-Chandra modules for $\mathrm{SL}_2(\mathbb{R})$ and representations of the Gelfand quiver to a rational setting. To this end, we define a $\mathbb{Q}$-rational structure on the Gelfand quiver and its representations. A key technical tool, which we call unipotent stabilization, is developed to construct the functor from rational Harish-Chandra modules to nilpotent rational quiver representations. We prove that this functor is an equivalence. A similar result is established for the cyclic quiver. Both results hold over every field $E$ of characteristic $0$, for suitable $E$-rational structures on the two quivers; for $E=\mathbb{C}$ they recover Gelfand's equivalence. In this rational framework the defining relation of the Gelfand quiver acquires a descent-theoretic meaning: its Galois orbit is stable, it descends to a single relation on the associated $\mathbb{Q}$-species, and a $\mathbb{Q}$-rational representation satisfies it if and only if the composite of the two arrows through the vertex $-$ is a $\mathbb{Q}$-rational endomorphism of the space at the central vertex. This allows us to recast our results in the language of $\mathbb{Q}$-species.

code
github.com/drjanosch42/rational_quivers ∎ Lean project (lean/lakefile.toml, lean/lean-toolchain) builds, no sorry at 449bbc3, checked 2026-10-30 build details
comments
64 pages; Lean 4 formalization: https://github.com/drjanosch42/rational_quivers, doi:10.5281/zenodo.23735854
fields
Representation Theory
pdf ↗ page arXiv:2506.23251 ↗

We study the sublevel sets of the Willmore energy on the space of smoothly immersed $ 2 $-spheres in Euclidean $ 3 $-space. We show that the subset of immersions with energy at most $ 12π$ consists of four regular homotopy classes. Moreover, we show that in certain regular homotopy classes, all singularities of the Willmore flow are avoidable, that is, the initial surface admits a regular homotopy to a round sphere whose Willmore energy does not exceed that of the initial surface. This yields a classification of initial surfaces with energy at most $ 12π$ that lead to unavoidable singularities. As a further consequence, we obtain an extension of the Li-Yau inequality at $ 12π$ for a large class of immersed spheres without triple points. To prove these results, we glue together different instances of the Willmore flow and employ an invariant for triple-point-free immersed spheres.

journal
Mäder-Baumdicker, E. and Seidel, J. (2026) 'The Willmore Energy Landscape of Spheres and Avoidable Singularities of the Willmore Flow', Forum of Mathematics, Sigma, 14, p. e134
fields
Differential Geometry
pdf ↗ page arXiv:2506.23359 ↗

This paper investigates the problem of computing a two-dimensional curvature-constrained shortest path for an unmanned aerial vehicle (UAV) to intercept a moving target, with both the UAV (pursuer) and the target traveling at constant speeds. We formulate an optimal control problem that integrates two critical objectives: avoiding static obstacles and successfully intercepting the target. The formulation integrates curvature constraints, geometric obstacle-avoidance conditions, and time-consistent interception constraints within a constrained optimal control framework. A geometric framework is developed, along with necessary conditions for path optimality under the imposed constraints. The problem is initially examined in the presence of a single obstacle and later extended to scenarios involving a finite number of obstacles. Numerical experiments are carried out to evaluate the performance and efficiency of the proposed model using illustrative examples. Finally, we present a realistic case study using actual geographic data, including obstacle placement, target trajectory, and heading angles, to demonstrate the practical applicability and effectiveness of the proposed method in real-world scenarios.

comments
36 Pages, 18 Figures
fields
Optimization and Control
pdf ↗ page arXiv:2507.01447 ↗

We establish that local Hamiltonian operators admitted by systems of partial differential equations (PDEs) induce Poisson bivectors on suitable finite-dimensional subsystems describing invariant solutions. This correspondence is governed by the mechanism of invariant reduction, which applies uniformly to point, contact, and higher symmetries. We show that the induced Poisson bivectors relate constants of invariant motion to symmetries of such subsystems. Applying the same reduction mechanism to invariant conservation laws, we further deduce that the corresponding Poisson brackets on the reduced systems agree, up to a global sign, with those of the original systems. The results are illustrated by two examples in which the induced Poisson brackets and constants of invariant motion yield integrability of the reduced systems. The construction is independent of the choice of an $\ell$-normal inclusion of a PDE system into jet spaces, with the corresponding odd cotangent covering being $\ell$-normal.

comments
J. Geom. Phys. version
fields
Differential Geometry
pdf ↗ page arXiv:2507.08213 ↗

We study the stationary double-divergence equation on the infinite cylinder $\mathbb R\times\mathbb T^{d-1}$, whose coefficients coincide with two possibly different periodic media outside a bounded interface layer. Under the centering conditions for the two periodic media, we construct a positive invariant density that converges exponentially in $C^1$ at each end to a positive multiple of the corresponding periodic invariant density. Every bounded distributional solution is a scalar multiple of this density. The two asymptotic amplitudes are determined by the full interface problem, up to a common normalization. Motivated by the invariant-measure analysis of Hairer and Manson [Ann. Probab. 39(2011) 648-682], our proof uses only PDE methods: a transformation based on the periodic invariant densities, adjoint Neumann problems on finite cylinders, and energy estimates.

comments
Substantially revised version. The assumption $b_1=0$ has been removed, and the homogenization applications have been omitted. The title has been changed to reflect the focus on existence, uniqueness, and exponential asymptotics for stationary double-divergence equations on cylinders with an interface
fields
Analysis of PDEs
pdf ↗ page arXiv:2507.15536 ↗

Sequential optimality conditions play an important role in constrained optimization since they provide necessary conditions without requiring constraint qualifications (CQs). This paper introduces a second-order extension of the Approximate Karush-Kuhn-Tucker (AKKT) conditions, referred to as AKKT2, for nonlinear semidefinite optimization problems (NSDP). In particular, we provide a formal definition of AKKT2, as well as its stronger variant, called Complementary AKKT2 (CAKKT2), and prove that these conditions are necessary for local minima without any assumption. Moreover, under Robinson's CQ and the weak constant rank property, we show that AKKT2 implies the so-called weak second-order necessary condition. Finally, we propose a penalty method and show that, under an assumption related to the Lojasiewicz inequality, its accumulation points satisfy the AKKT2 and CAKKT2 conditions.

fields
Optimization and Control
pdf ↗ page arXiv:2507.21495 ↗

We prove several results on the model theory of Artin groups, focusing on Artin groups which are "far from right-angled Artin groups". The first result is that if $C$ is a class of Artin groups whose irreducible components are acylindrically hyperbolic and torsion-free, then the model theory of Artin groups of type $C$ reduces to the model theory of their irreducible components. The second result is that the problem of superstability of a given non-abelian Artin group $A$ reduces to certain dihedral parabolic subgroups of $A$ being $n$-pure in $A$, for certain large enough primes $n \in \mathbb{N}$. The third result is that two spherical Artin groups are elementarily equivalent if and only if they are isomorphic. Finally, we prove that the affine Artin groups of type $\tilde{A}_n$, for $n \geq 4$, can be distinguished from the other simply laced affine Artin groups using existential sentences; this uses known computations of second integral homology together with a direct calculation for simply laced Artin groups under the $K(π,1)$ assumption. These computations provide obstructions to the retractions forced by existential equivalence.

comments
To appear in Internat. J. Algebra Comput
fields
Logic
pdf ↗ page arXiv:2507.21575 ↗

In this article, we investigate null controllability of the Kuramoto-Sivashinsky (KS) equation on a cylindrical domain $Ω=Ω_x\times Ω_y$ in $\mathbb R^N$, where $Ω_x=(0,a),$ $a>0$ and $Ω_y$ is a smooth domain in $\mathbb R^{N-1}$. We first study the controllability of this system by a control acting on $\{0\}\times ω$, $ω\subset Ω_y$, through the boundary term associated with the Laplacian component. The null controllability of the linearized system is proved using a combination of two techniques: the method of moments and Lebeau-Robbiano strategy. We provide a necessary and sufficient condition for the null controllability of this system along with an explicit control cost estimate. Furthermore, we show that there exists minimal time $T_0(x_0)>0$ such that the system is null controllable for all time $T > T_0(x_0)$ by means of an interior control exerted on $γ= \{x_0\} \times ω\subset Ω$, where $x_0/a\in (0,1)\setminus \mathbb{Q}$ and it is not controllable if $T<T_0(x_0).$ If we assume $x_0/a$ is an algebraic real number of order $d > 1$, then we prove the controllability for any time $T>0.$ Finally, for the case of $N=2 \text{ or } 3$, we show the local null controllability of the main nonlinear system by employing the source term method followed by the Banach fixed point theorem.

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

In this paper, we introduce hierarchical matrices with Tucker blocks (HMTB) for data-sparse approximation of matrices arising from nonoscillatory and mildly oscillatory kernels. Building on the hierarchical matrix framework, HMTB matrices replace conventional low-rank blocks with Tucker representations. Using high-dimensional interpolation and tensor compression and contractions, we develop algorithms for constructing HMTB matrices and performing matrix-vector multiplication. For an $N \times N$ matrix, these algorithms have linear and quasi-linear complexities in $N$, respectively. Numerical comparisons with an interpolation-based $\mathcal{H}$-matrix implementation demonstrate storage savings and, in several cases, reduced construction times, while maintaining competitive forward-evaluation costs. The framework is also applicable to quasi-uniform grids.

comments
32 pages, 10 figures; revised version with updated title
fields
Numerical Analysis
pdf ↗ page arXiv:2508.05958 ↗

This article is the $2^{nd}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Definition of Type-2 isomorphism of circulant graphs $C_n(R)$ w.r.t. $m$ modified in \cite{v2-2-arX} was further modified to definition \ref{d6} in \cite{v2-1} by the author by considering $m > 1$ divides $\gcd(n, r)$, $m^3$ divides $n$ and $r\in R$ and studied Type-2 isomorphic circulant graphs w.r.t. $m$ = 2. In this paper, using the modified definition \ref{d6}, we obtain all 8 and 32 number of pairs of Type-2 isomorphic circulant graphs of orders 16 and 24, respectively and all 27 number of triples of Type-2 isomorphic circulant graphs of order 27.

comments
This article is slightly modified one of its previous version
fields
Combinatorics
pdf ↗ page arXiv:2508.09384 ↗

Clean markings on surfaces were a key component in Masur and Minsky's hierarchy machinery, which proved to be a powerful tool in the study of mapping class groups. We construct a marking graph for irreducible finite-type Artin groups which is quasi-isometric to the group modulo its center, i.e., an element of $A_Γ/Z(A_Γ)$ is determined up to finite error by its action on one of our markings. To construct this graph, we construct suitable collections of transverse parabolic subgroups which extend the maximal simplices of the complex of irreducible parabolic subgroups to analogues of clean markings, and we define natural analogues of elementary moves.

comments
58 pages. v2: minor corrections and improvements
fields
Group Theory, Geometric Topology
pdf ↗ page arXiv:2508.10394 ↗

Using rational Ehrhart theory and Fourier analysis, we give an elementary proof that the volume of a closed manifold equipped with an integral-integral affine structure equals the number of its integral points.

journal
SIGMA 22 (2026), 102, 9 pages
fields
Differential Geometry, Symplectic Geometry
pdf ↗ page arXiv:2508.17551 ↗

Quasi-Trefftz methods are a family of Discontinuous Galerkin methods relying on equation-dependent function spaces. This work is the first study of the notion of local Taylor-based polynomial quasi-Trefftz spaces for a system of Partial Differential Equations (PDEs). These discrete spaces are meant to discretize a quasi-Trefftz weak formulation, and are introduced here for electro-magnetic wave propagation in inhomogeneous media, governed by a second order formulation of Maxwell's equation with variable coefficients. Thanks to an adequate Helmholtz decomposition for spaces of homogeneous polynomial vector fields, the outcome is the proposed quasi-Trefftz spaces with same best approximation properties as the corresponding standard polynomial spaces but with an optimal dimension, as well as a procedure to construct a quasi-Trefftz basis.

fields
Numerical Analysis
pdf ↗ page arXiv:2509.00193 ↗

The Blasius-Deligne conjecture for automorphic $L$-functions is about the period relations and the algebraicity of critical $L$-values. In this paper, we prove the Blasius-Deligne conjecture for standard $L$-functions attached to regular algebraic cuspidal automorphic representations of $GL_{2n}$ of symplectic type, under the expected Galois invariance condition for these representations. The main results extend the classical work of G. Shimura and Y. Manin from $GL_2$ to $GL_{2n}$, and complete the approach that was initially taken by H. Grobner and A. Raghuram and by F. Januszewski, where a few technical assumptions were taken.

comments
Substantial revision
fields
Number Theory, Representation Theory
pdf ↗ page arXiv:2509.00434 ↗

An important task in the statistical analysis of inhomogeneous point processes is to investigate the influence of a set of covariates on the point-generating mechanism. In this article, we consider the nonparametric Bayesian approach to this problem, assuming that $n$ independent and identically distributed realizations of the point pattern and the covariate random field are available. In many applications, different covariates are often vastly diverse in physical nature, resulting in anisotropic intensity functions whose variations along distinct directions occur at different smoothness levels. To model this scenario, we employ hierarchical prior distributions based on multi-bandwidth Gaussian processes. We prove that the resulting posterior distributions concentrate around the ground truth at optimal rate as $n\to\infty$, and achieve automatic adaptation to the anisotropic smoothness. Posterior inference is concretely implemented via a Metropolis-within-Gibbs Markov chain Monte Carlo algorithm that incorporates a dimension-robust sampling scheme to handle the functional component of the proposed nonparametric Bayesian model. Our theoretical results are supported by extensive numerical simulation studies. Further, we present an application to the analysis of a Canadian wildfire dataset.

comments
29 pages, 7 figures, 2 tables and 33 pages additional material
fields
Statistics Theory
pdf ↗ page arXiv:2509.02299 ↗

This article presents a general description of dynamical systems using the language of enriched functors and enriched natural transformations. This framework is essential to establish the equivalence of three descriptions of dynamics -- a semigroup action on the domain; a parameterized family of endomorphisms; and a transformation of time-space into the collection of endomorphisms. A collection of categorical axioms are presented that provides a complete categorical language to develop dynamical systems theory. None of the assumptions are rooted in specific contexts such as topology and measure spaces. The equivalence of the three descriptions is further used to construct other related notions,such as transfer operators, orbits and shift-spaces. All of these objects are defined by their structural role and universal properties, instead of their usual pointwise definitions.

fields
Category Theory
pdf ↗ page arXiv:2509.05900 ↗

Tilings of the plane resemble the simplicial and other complexes from algebraic topology, but have not been studied from this perspective. We construct finite categories corresponding to polygons with labeled directed edges, and introduce the problem of modeling tilings of the Euclidean or hyperbolic plane as presheaves over such a category. Combinatorially, this amounts to choosing an ``alignment'' for a tiling: a direction for every edge and consistent labels for the edges of each polygonal tile. We show that for a fixed tiling, given a single alignment we can characterize every other alignment of the same tiling by comparison of the edge directions. We then construct a ``reflective'' alignment for any tiling with an even number of polygons at each vertex, and from this generate a large family of alignments with elegant symmetry properties.

comments
38 pages + 4 page appendix. v2: Minor edits and corrections, accepted for publication at Involve
fields
Category Theory, Combinatorics, Geometric Topology, Metric Geometry
pdf ↗ page arXiv:2509.06363 ↗

In 2006, Collins and Trenk obtained a general sharp upper bound for the distinguishing chromatic number of a connected graph. Inspired by Catlin's combinatorial techniques from 1978, we establish improved upper bounds for classes of connected graphs that have only small complete bigraphs as induced subgraphs. In this framework, we also consider the list-distinguishing chromatic number of such graphs. We apply Menger's theorem to demonstrate applications of our main result for graphs whose constructions are based on Paley graphs and Cayley graphs on Dihedral groups.

comments
Presented in ICGTA 2025 (International Conference on Graph Theory and Its Applications 2025), Comments are welcome, Revised version, 10 pages, 3 figures
fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2509.11992 ↗

It is well-known that a $d$-dimensional polynomial Bézier curve of degree $n$ can be subdivided into two segments using the famous de Casteljau algorithm in $O(dn^2)$ time. We show that it is possible to do this in $O(dn\log{n})$ time using the fast Fourier transform and its inverse. The direct application of the method is numerically unstable for larger values of $n$. Therefore, we also introduce a modified version based on parameter scaling, which retains the same asymptotic computational complexity. This scaling approach can improve numerical accuracy in some cases (for $n\lesssim 50$), as demonstrated by our experiments. Moreover, the new method has a nice property: if a Bézier curve is extended by an additional control point, the subdivision can be updated in $O(d)$ time. The method can be adapted to subdivide rational Bézier curves and rectangular Bézier surfaces, as well as to compute the derivatives of Bézier curves. Although motivated by applications in CAGD, the proposed methods may also be useful in other areas involving polynomial reparameterization.

fields
Numerical Analysis
pdf ↗ page arXiv:2509.15691 ↗

We consider a multispecies Brinkman tissue-growth system proposed by Debiec, Mandal, and Schmidtchen [J. Differential Equations 2025]. This system adopts a power pressure law determined by the total spatial density and models the effect of phenotype-dependent growth rates on the density dynamics of cells with different phenotypes. We examine the simultaneous vanishing-viscosity, stiff-pressure, and continuous-phenotype limit of this system. For families of bounded weak solutions with suitable initial conditions, every sequence converges, up to a subsequence, to a continuous-phenotype incompressible Darcy system, which presents a novel biological model. This result not only addresses connections between Brinkman tissue-growth systems with discrete phenotypes and those with continuous phenotypes, but also demonstrates the robustness of such connections under both the incompressible and inviscid limits.

comments
added a proof of vanishing defect measure, reorganized the manuscript
fields
Analysis of PDEs
pdf ↗ page arXiv:2509.16416 ↗

Pipeline-parallel distributed optimization is essential for large-scale machine learning but is challenged by significant communication overhead from transmitting high-dimensional activations and gradients between workers. Existing approaches often depend on impractical unbiased gradient assumptions or incur sample-size memory overhead. This paper introduces Clapping, a Communication compression algorithm with LAzy samPling for Pipeline-parallel learnING. Clapping adopts a lazy sampling strategy that reuses data samples across steps, breaking sample-wise memory barrier and supporting convergence in few-epoch or online regimes. Clapping comprises two variants including Clapping-FC and Clapping-FU, both of which achieve convergence without unbiased assumption for compressed gradient, effectively addressing compression error propagation in multi-worker settings. Numerical experiments validate the performance of Clapping across different tasks.

comments
71 pages
fields
Optimization and Control
pdf ↗ page arXiv:2509.19029 ↗

Genetic mutations can lead to disease by disrupting molecular interactions, altering protein stability, inducing misfolding, and promoting protein aggregation. Although existing predictive models have achieved promising performance, they often lack mechanistic interpretability and fail to fully incorporate the underlying physical and chemical principles governing mutation-induced effects. Moreover, current approaches typically address disease association, protein stability changes, and solubility alterations as separate prediction tasks rather than integrating them within a unified framework. In this study, we introduce a multiscale commutative algebra modeling framework for predicting disease-mutation association. Leveraging persistent Stanley-Reisner theory, we extract algebraic invariants to build two predictive models: Commutative Algebra Neural Network (CANet) and Commutative Algebra Gradient Boosting Tree (CATree). The proposed framework is applied to three biologically connected tasks: disease-associated mutation identification, mutation-induced protein stability change prediction, and mutation-induced protein solubility change classification. Across six benchmark tasks, CANet and CATree consistently achieve leading predictive performance, with up to 7.5% relative improvement over existing methods. These results demonstrate that commutative algebra provides a unified, interpretable, and generalizable modeling strategy for mutation-disease association prediction.

fields
Commutative Algebra
pdf ↗ page arXiv:2509.26566 ↗

The rational blowdown operation in 4-manifold topology replaces a neighborhood of a configuration of spheres by a rational homology ball. Such configurations typically arise from resolutions of surface singularities that admit rational homology disk smoothings. Conjecturally, all such singularities must be weighted homogeneous and belong to certain specific families: Stipsicz-Szabó–Wahl constructed QHD smoothings for these families and used Donaldson's theorem to obtain very restrictive necessary conditions on the resolution graphs for singularities with this property. In particular, these results, as well as subsequent work of Bhupal-Stipsicz, show that for certain resolution graphs, the canonical contact structure on the link of the singularity cannot admit a QHD symplectic filling. By contrast, we exhibit Stein rational homology disk fillings for the contact links of an infinite family of rational singularities that are not weighted homogeneous, producing a new symplectic rational blowdown. Inspiration for our construction comes from de Jong-van Straten's description of Milnor fibers of sandwiched singularities; we use the symplectic analog of de Jong-van Straten theory developed by the second and third authors. The unexpected Stein fillings are built using spinal open books and nearly Lefschetz fibrations.

comments
29 pages, 35 figures, final version accepted to Journal of Topology
fields
Geometric Topology, Algebraic Geometry, Symplectic Geometry
pdf ↗ page arXiv:2510.00115 ↗

A differential category is an additive symmetric monoidal category with an algebra modality, axiomatizing smooth functions, and a deriving transformation, axiomatizing the differentiation of these smooth functions. An algebra modality may or may not have both the nullary and the binary Seely isomorphisms. Lemay proved that if an algebra modality has both Seely isomorphisms, then it has at most one deriving transformation. It was then an open problem whether every algebra modality has at most one deriving transformation. We answer this question in the negative by constructing algebra modalities with infinite sets of deriving transformations. We also clarify the relations between the nullary Seely isomorphism, the binary Seely isomorphism, and uniqueness of deriving transformations (that is, the property for an algebra modality to have at most one deriving transformation). First, we refine Lemay's theorem by removing the assumption of the nullary Seely isomorphism. Then, we show by means of various examples that the six combinations of absence or presence of nullary Seely isomorphism, binary Seely isomorphism, and uniqueness of deriving transformations, which are not already ruled out by the refined uniqueness theorem, can be realized.

comments
39 pages, 1 figure. Minor improvements to language and exposition
fields
Category Theory
pdf ↗ page arXiv:2510.03953 ↗

Survival analysis provides statistical methods to model the time until an event occurs. Reporting delays arise when event times are not observed at their occurrence but are only revealed upon reporting. This issue is particularly critical for timely risk evaluation when the observation window is short due to administrative censoring. In this study, we incorporate right-censored reporting delays by jointly modeling parametric hazards for the event and reporting processes. We then construct a consistent estimator for the model parameters and develop a Monte Carlo expectation-maximization algorithm to compute it. To address the challenges posed by administrative censoring, we leverage these findings and propose a transfer-learning procedure. Experimental results demonstrate that our method improves the accuracy of timely risk evaluation under administrative censoring.

comments
32 pages, 3 figures, 2 tables
fields
Statistics Theory
pdf ↗ page arXiv:2510.04421 ↗

In this paper, we categorize all isomorphism classes of quasi-elliptic surfaces over a field $k$ of characteristic 2 or 3. For every quasi-elliptic surface $X$, we classify all possible sequences of blow-downs from $X$ to the projective plane $\mathbb{P}^2_k$. We then use these categorizations to identify all unexpected plane cubic curves in characteristic 2 and present a proof of the lack of unexpected cubics in characteristic 3. Before the work in this paper -- based partly on the author's thesis -- the complete classification of unexpected plane cubic curves in characteristic 2 was unknown, as well as the question of the existence of unexpected plane cubic curves in characteristic 3.

comments
34 pages, 50 figures
fields
Algebraic Geometry
pdf ↗ page arXiv:2510.06365 ↗

We present a multidimensional generalization of Zeckendorf's Theorem (any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers) to a large family of linear recurrences. This extends work of Anderson and Bicknell-Johnson in the multi-dimensional case when the underlying recurrence is the same as the Fibonacci one. Our extension applies to linear recurrence relations defined by vectors $\vec{\mathbf{c}} = (c_1, c_2, \ldots, c_k)$ such that $c_1\geq c_2\geq\cdots \geq c_k$ and where $c_k = 1$. Under these conditions, we prove that every integer vector in $\mathbb{Z}^{k-1}$ admits a unique $\vec{\mathbf{c}}$-satisfying representation ($\vec{\mathbf{c}}$-SR) as a linear combination of vectors, $(\vec{\mathbf{X}}_n)_{n\in \mathbb{Z}}$ defined for every $n\in \mathbb{Z}$ initially by zero and standard unit vectors and then the recursion $$\vec{\mathbf{X}}_{n} := c_1\vec{\mathbf{X}}_{n -1} + c_2\vec{\mathbf{X}}_{n - 2} + \cdots + c_k\vec{\mathbf{X}}_{n-k}.$$ To establish this, we introduce carrying and borrowing operations that use the defining recursion to transform any $\vec{\mathbf{c}}$ representation into a $\vec{\mathbf{c}}$-SR while preserving the underlying vector. Then, by establishing bijections with properties of scalar Positive Linear Recurrence Sequences (PLRS), we prove that these multidimensional decompositions inherit various properties, such as the number of summands exhibits Gaussian behavior and summand minimality of $\vec{\mathbf{c}}$-SRs over all $\vec{\mathbf{c}}$-representations.

comments
23 pages, 4 figures
fields
Number Theory
pdf ↗ page arXiv:2510.07237 ↗

Micro-randomized trials (MRTs) are increasingly used to evaluate mobile health interventions with binary proximal outcomes. Standard inverse probability weighting (IPW) estimators are unbiased but unstable in small samples or under extreme randomization. Estimated mean excursion effect (EMEE) improves efficiency but lacks double robustness. We propose a doubly robust EMEE (DR-EMEE) with stabilized and truncated weights, combining per-decision IPW and outcome regression. We prove double robustness, asymptotic efficiency, and provide finite-sample variance corrections, with extensions to machine learning nuisance estimators. In simulations, DR-EMEE reduces root mean squared error, improves coverage, and achieves up to twofold efficiency gains over IPW and five to ten percent over EMEE. Applications to HeartSteps, PAMAP2, and mHealth datasets confirm stable and efficient inference across both randomized and observational settings.

comments
arXiv admin note: This submission has been withdrawn because it does not meet arXiv's research content quality standards
fields
Statistics Theory
pdf ↗ page arXiv:2510.08359 ↗

The universal approximation property uniformly with respect to weakly compact families of measures is established for several classes of neural networks. To that end, we prove that these neural networks are dense in Orlicz spaces, thereby extending classical universal approximation theorems even beyond the traditional $L^p$-setting. The covered classes of neural networks include widely used architectures like feedforward neural networks with non-polynomial activation functions, deep narrow networks with ReLU activation functions and functional input neural networks.

fields
Functional Analysis, Probability
pdf ↗ page arXiv:2510.09177 ↗

Let $\exp[x_0,x_1,\dots,x_n]$ denote the divided difference of the exponential function. (i) We prove that exponential divided differences, as functions of two nodes of arbitrary positive multiplicities with all other nodes fixed, are strictly sign-regular of all orders, with log-submodularity as the order-two case. We also establish strict supermodularity. (ii) We establish the four-point inequality $ \exp[a,a,b,c]\,\exp[d,d,b,c]+\exp[b,b,a,d]\,\exp[c,c,a,d]-\exp[a,b,c,d]^2 > 0 $ for all $ a,b,c,d \in \mathbb{R} $. Furthermore, we obtain a sharp quantitative generalization to arbitrarily many pairs of nodes, with additional common nodes allowed. (iii) We obtain sharp two-sided bounds for $\exp[x_0,\dots,x_n]$ at fixed mean and variance; as a consequence, we derive an asymptotic expansion for $n!\exp[x_0,\ldots,x_n]$ as $n\to\infty$ for node sequences of bounded variance. (iv) We present closed-form identities for divided differences of the exponential function, including a convolution identity and summation formulas for repeated arguments.

comments
21 pages,
fields
Classical Analysis and ODEs, Numerical Analysis
pdf ↗ page arXiv:2510.10724 ↗

To a quiver with involution, we study the Coulomb branch of the 3d $\mathcal{N} = 4$ involution-fixed part of the quiver gauge theory. We show that there is an algebra homomorphism from the corresponding shifted twisted Yangian to the quantized Coulomb branch algebra. This gives a new instance of 3D mirror symmetries.

comments
v1,32 pages;v2, Final accepted version
journal
Communications in Mathematical Physics 407 (2026), Paper No. 244
fields
Representation Theory, Algebraic Geometry
pdf ↗ page arXiv:2510.12118 ↗

We study conditions under which quasi-conformal homeomorphisms are quasi-isometries. We show that if two nilpotent geodesic Lie groups are quasi-conformally homeomorphic, then they are quasi-isometrically equivalent. We also give more general results beyond the nilpotent case. In particular, we show that quasi-conformal homeomorphisms between geodesic Lie groups are quasi-isometries whenever the spaces have strict parabolic or hyperbolic conformal type. As a consequence, quasi-conformal homeomorphisms between geodesic Lie groups with infinite fundamental group are quasi-isometries. The statements for Lie groups are deduced from a more general study on metric measure spaces with uniformly locally bounded geometry.

comments
57 pages
fields
Metric Geometry, Group Theory
pdf ↗ page arXiv:2510.12161 ↗

In [I. Arzhantsev and M. Zaidenberg, Borel subgroups of the automorphism groups of affine toric surfaces, arXiv:2507.09679 (2025)] we described the Borel subgroups and maximal solvable subgroups of the automorphism groups of affine toric surfaces. In the present paper, we introduce the notion of an integrable Borel subalgebra in the Lie algebra of the automorphism group of an affine variety. We show that they are precisely the tangent algebras of the Borel subgroups. We classify the integrable Borel subalgebras in the Lie algebras of the automorphism groups of toric affine surfaces, notably of the affine plane and its cyclic quotients.

comments
27 pages; a new Proposition 4.11 added; minor changes
fields
Algebraic Geometry
pdf ↗ page arXiv:2510.17223 ↗

This paper constructs the cohomology theory for grading-restricted vertex superalgebras, generalizing Yi-Zhi Huang's cohomology theory of grading-restricted vertex algebras. To simplify the discussion, motivate the construction, and make it easier for the reader to understand the technical points, we also include the construction of the cohomology theory of supercommutative associative algebras, a generalization of the Harrison cohomology theory of a commutative algebra that has not been explicitly written down. The paper will serve as the foundation for many subsequent studies, especially the deformation theory of vertex superalgebras.

journal
SIGMA 22 (2026), 103, 36 pages
fields
Quantum Algebra
pdf ↗ page arXiv:2510.17293 ↗

We study a consumption-investment problem in a multi-asset market where the returns follow a generic rank-based model. Our main results are an HJB equation with Neumann boundary conditions for the value function, together with a corresponding verification theorem. The control problem is nonstandard due to the discontinuous nature of the coefficients in rank-based models, requiring a bespoke approach of independent mathematical interest. The special case of first-order models, prescribing constant drift and diffusion coefficients for the ranked returns, admits explicit solutions when the investor (a) is unconstrained, (b) abides by open market constraints or (c) is fully invested in the market. The explicit optimal strategies in all cases are related to the celebrated solution to Merton's problem, despite case (b) being intractable in the classic Merton setting.

comments
13 pages; Forthcoming in SIAM Journal on Financial Mathematics
fields
Probability
pdf ↗ page arXiv:2510.20763 ↗

The Koras-Russell threefolds are a certain family of smooth, affine contractible threefolds exhibiting "exotic" behavior in the algebro-geometric context. Our goal in this note is to extend its $\mathbb{A}^1$-contractibility from a field to a general base scheme. As a consequence, we also give a general strategy to extend the $\mathbb{A}^1$-contractibility of Koras-Russell prototypes in higher dimensions over a general base scheme. As a major consequence, we establish the existence of "exotic" motivic spheres in all dimensions at least 4 over infinite perfect fields.

comments
28 pages, 1 image. Typos fixed and some proofs updated. Comments welcome!
fields
Algebraic Geometry, Algebraic Topology
pdf ↗ page arXiv:2510.21594 ↗

The numerical solution of time-dependent PDEs posed over the combined space-time domain, instead of treating time sequentially, leads to space-time methods. Treating time as another spatial dimension allows parallelization across time and simultaneous adaptivity in spatial and temporal discretizations. However, space-time formulations suffer from the curse of dimensionality due to the (d+1)-dimensional domain. Time-series forecasting methods, such as dynamic mode decomposition (DMD), also suffer the same scaling for storing and processing measurement data. In this work, we investigate whether quantum-inspired tensor network methods can mitigate this curse for both solving PDEs and data-driven modeling. We formulate a space-time matrix product state (MPS) encoding to represent either the space-time solution or time-series data. Using this representation, we develop a unified framework that combines an MPS space-time PDE solver with an MPS-DMD algorithm. We benchmark our MPS space-time solver for linear and nonlinear PDEs in both (1+1) and (2+1) dimensions, including non-diffusive regimes such as shockwave formation and Allen-Cahn phase separation. We observe that the MPS ansatz efficiently captures the spatio-temporal correlations of the solutions, with a 99% reduction in parameters with respect to the grid size. We demonstrate the MPS-DMD algorithm in two cases. First, the MPS space-time solver generates the MPS encoding of the time-series data. We then apply MPS-DMD directly to predict the dynamics without solving PDEs. Second, for the general case where data is available as dense arrays, MPS-DMD needs an intermediate compression step. We implement a streaming-like compression algorithm and observe a 97% reduction in memory, with MPS-DMD predictions matching those of exact DMD.

comments
28 pages, 14 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2510.21767 ↗

We study in-context learning problems where a Transformer is pretrained on tasks drawn from a mixture distribution $π=\sum_{α\in\mathcal{A}} λ_α π_α$, called the pretraining prior, in which each mixture component $π_α$ is a distribution on tasks of a specific difficulty level indexed by $α$. Our goal is to understand the performance of the pretrained Transformer when evaluated on a different test distribution $μ$, consisting of tasks of fixed difficulty $β\in\mathcal{A}$, and with potential distribution shift relative to $π_β$, subject to the chi-squared divergence $χ^2(μ,π_β)$ being at most $κ$. In particular, we consider nonparametric regression problems with random smoothness, and multi-index models with both random smoothness and random effective dimension. We prove that a large Transformer pretrained on sufficient data achieves the optimal rate of convergence corresponding to the difficulty level $β$, uniformly over test distributions $μ$ in the chi-squared divergence ball. Thus, the pretrained Transformer is able to achieve faster rates of convergence on easier tasks and is robust to distribution shift at test time. Finally, we prove that even if an estimator had access to the test distribution $μ$, the convergence rate of its expected risk over $μ$ could not be faster than that of our pretrained Transformers, thereby providing a more appropriate optimality guarantee than minimax lower bounds.

comments
47 pages, 4 figures
fields
Statistics Theory
pdf ↗ page arXiv:2510.23254 ↗

In this paper, we present a Monte-Carlo Compressive Optimization algorithm, a new method for black-box combinatorial optimization, which only assumes that the objective is compressible. The method relies on random queries to the objective function in order to estimate generalized moments. Next, a greedy algorithm from compressive sensing is repurposed to find the global optimum when not overfitting to the samples. We provide numerical results giving evidence that our method is competitive by comparing it with digital annealing. Moreover, we give theoretical justification for the success of the algorithm and analyze its properties. The practicality of our algorithm is enhanced by the ability to tune the heuristic parameters to the available computational resources. An end-to-end open-source implementation is available to use our method.

comments
21 pages, 7 figures, 1 table
fields
Optimization and Control
pdf ↗ page arXiv:2510.24755 ↗

The simple continued fractions for the Golden & Silver means are well-known. It is astonishing that, as far as we know, no one has published half-iterates (let alone quarter-iterates) for the corresponding algorithms. We also examine the cosine and logistic maps (with parameter $2 < λ< 3$).

comments
15 pages; corrigendum & addendum
fields
Number Theory
pdf ↗ page arXiv:2510.25606 ↗

In this paper, we consider a domestic standalone microgrid equipped with local renewable energy generation such as photovoltaic panels, consumption units, and battery storage to balance supply and demand and investigate the stochastic optimal control problem for its cost-optimal management. As a special feature, the manager does not have access to the power grid but has a local generator, making it possible to produce energy using fuel when needed. Such systems are very important for rural electrification, particularly in developing countries. However, these systems are very complex to control due to uncertainties in the weather and environmental conditions, which affect the energy generation and the energy demand. In addition, we assume that the battery and the fuel tank have limited capacities and that the fuel tank can only be filled once at the beginning of the planning period. This leads us to the so-called finite fuel problem. In addition, we allow the energy demand to not always be satisfied, and we impose penalties on unsatisfied demand, the so-called discomfort cost. The main goal is to minimize the expected aggregated cost of generating power using the generator and operating the system. This leads to a mathematical optimization problem. The problem is formulated as a discrete-time stochastic control problem and solved numerically using methods from the theory of Markov decision processes.

comments
revised version, 58 pages
fields
Optimization and Control
pdf ↗ page arXiv:2511.00167 ↗

Using a mélange of techniques at the rich intersection of deformation/rigidity theory, finite index subfactor theory, and geometric group theory, we prove the existence of a continuum of property (T) factors that are pairwise non-stably isomorphic and whose Jones index sets consist of all positive integers. These factors are realized as group von Neumann algebras $\mathcal{L}(G)$ associated with property (T) generalized wreath-like product groups $G \in \mathscr{WR}(A, B \curvearrowright I)$ introduced in [CIOS23b], where $A$ is abelian, $B$ is a non-parabolic subgroup of a relatively hyperbolic group with residually finite peripheral structure, and $B \curvearrowright I$ is a faithful action with infinite orbits. Integer index subfactors of $\mathcal{L}(G)$ are constructed from extensions of $G$. This result advances an open question of P. de la Harpe [dlH95].

comments
22 pages
fields
Operator Algebras, Group Theory
pdf ↗ page arXiv:2511.04822 ↗

We construct a Brownian motion on complex partial flag manifolds with blocks of equal size as a matrix-valued diffusion from a Brownian motion on the unitary group. This construction leads to an explicit expression for the characteristic function of the joint distribution of the stochastic areas on these manifolds. The limit law of these stochastic areas is shown to be a multivariate Cauchy distribution with independent and identically distributed entries. By relating the area functionals on flag manifolds to the winding functional on the complex Stiefel manifold, we establish new results about simultaneous Brownian windings on the complex Stiefel manifold. To establish these results, this work introduces a new family of diffusions, which generalise both the Jacobi processes on the simplex and the Hermitian Jacobi processes.

comments
28 pages, v2: Minor edits, v3: Updated some sign conventions, corrected a minor normalisation discrepancy in expressions for the horizontal Brownian motion and the contact process + additional minor edits
fields
Probability, Differential Geometry
pdf ↗ page arXiv:2511.06047 ↗

For any $q\in\mathbb R$, let $A:=\big(\begin{smallmatrix}1 & 1\\0 & 1\end{smallmatrix}\big), B_q:=\big(\begin{smallmatrix}1 & 0\\q & 1\end{smallmatrix}\big)$ and let $G_q:=\langle A,B_q\rangle\leqslant\operatorname{SL}(2,\mathbb{R})$. Kim and Koberda conjecture that for every $q\in\mathbb{Q}\cap(-4,4)$, the group $G_q$ is not freely generated by these two matrices. We generalize work of Smilga and construct families of $q$ satisfying the conjecture that accumulate at infinitely many different points in $(-4,4)$. We give different constructions of such families, the first coming from applying tools in Diophantine geometry to certain polynomials arising in Smilga's work, the second from sums of geometric series and the last from ratios of Pell and half-companion Pell numbers accumulating at $1+\sqrt{2}$.

comments
12 pages, comments welcome
fields
Group Theory
pdf ↗ page arXiv:2511.10422 ↗

In this work, we consider wave propagation in materials characterized by nonlinear properties or damage. To accelerate the simulations of the resulting high-dimensional problems, we apply model order reduction methods. Depending on the knowledge of the underlying equations and the availability of their discrete operators, intrusive methods (here projection-based approaches based on proper orthogonal decomposition (POD)) or non-instrusive methods (here data-driven approaches including dynamic mode decomposition (DMD) and operator inference (OpInf)) can be used. We recall the theoretical foundations of the methods and apply them to the problem of wave propagation. In three different numerical examples, we evaluate the performance of the reduction techniques.

fields
Numerical Analysis
pdf ↗ page arXiv:2511.20815 ↗

We show that the Kähler-Einstein metrics on the four families of symmetric toric Fano manifolds due to Batyrev and Selivanova cannot be induced by immersions into projective spaces equipped with the Fubini-Study metric. We also show a similar conclusion for the non-symmetric examples discovered by Nill and Paffenholz. As an application we obtain that a centrally symmetric toric Fano manifold admits a Kähler-Einstein metric induced by a projective immersion if and only if it is a product of projective lines. These results confirm for each of these examples a broader conjecture characterizing the Kähler–Einstein metrics that can be induced by projective immersions.

comments
Final version, 29 pages, 3 figures. To appear in the Journal of Geometric Analysis
fields
Differential Geometry, Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2512.03617 ↗

In this short note, we prove a decay estimate for non-linear solutions of the 3D cubic defocusing non-linear Schrödinger equation.

comments
16 pages. [v3] Final version. Published in J. Evol. Equ
fields
Analysis of PDEs
pdf ↗ page arXiv:2512.03631 ↗

In this paper we investigate the (Kohn-Sham) density-to-potential map in the case of spinless fermions in one spatial dimension, whose existence has been rigorously established by the first author in [Lett. Math. Phys. 116, (2026), no. 27. https://doi.org/10.1007/s11005-026-02051-1]. Here, we focus on the regularity of this map as a function of the density and the coupling constant in front of the interaction term. More precisely, we first prove a quantitative version of the Hohenberg-Kohn theorem, thereby showing that this map is Lipschitz continuous with respect to the natural Sobolev norms in the space of densities and potentials. In particular, this implies that the inverse (Kohn-Sham) problem is not only well-posed but also Lipschitz stable. Using this result, we then show that the density-to-potential map is in fact real analytic with respect to both the density and the interaction strength. As a consequence, we obtain a holomorphic extension of the universal constrained-search functional to a suitable subset of complex-valued densities. This partially extends the DFT framework to non-self-adjoint Schrödinger operators. As further applications of these results, we also establish the existence of an exchange-only part of the exchange-correlation potential, and justify the Görling-Levy perturbation expansion for the correlation energy.

comments
Improved presentation, simplified some arguments, fixed lots of typos, and updated/corrected the bibliography
fields
Mathematical Physics
pdf ↗ page arXiv:2512.04726 ↗

This paper extends the octonion calibration in Clifford algebra to two related sedenion calibrations. Associative calibrations map quaternion rings in Clifford algebra to those in Cayley-Dickson algebras, with octonions consisting of seven rings and sedenions having 35 rings. A new non-associative calibration is found that is related to the sedenion associative calibration but is invertible, providing a classification of the ideals of Clifford algebra and hence of 8 x 8 matrices.This leads to new subalgebras of Clifford algebras and a thorough analysis of the possible automorphisms of sedenions is applied using the Spin and Pin groups. While the calibrations and automorphisms of octonions have minimal divergence, it is found sedenions extend Lie exceptional algebra, G2, to a Lie algebra of rank 49. This work clarifies and extends Schafer's and Brown's sedenion automorphisms. Brown introduced automorphisms that change the sedenion representation, unlike G2, but Clifford algebra analysis finds there are 92 such pure representations. The non-associative calibrations generate an infinite series of new Clifford subalgebras that match the finite geometry PG(N,2) series, discovered by Gino Fano, and connect the projections of simplices with those from hyper-cubes. The visual representation of sedenions as the PG(3,2) tetrahedron, representing the 15 Fano planes of sedenions, allows the sedenion power-associative loops to be visually distinguished from the octonion loops. The visual representation of sedenions may be important for particle physics and Clifford algebra provides analysis tools for the PG(N,2) series that uncovers the hidden structure of Cayley-Dickson algebras within an associative algebra.

comments
Sedenion automorphisms group resolved again
fields
Rings and Algebras
pdf ↗ page arXiv:2512.07210 ↗

Given an arrangement of $\{1,\dots,n^2\}$ in an $n\times n$ grid, we lift each cell to $\mathbb{R}^3$ by centring its grid coordinates $(x,y)$ at the origin and taking its centred entry $z = s_{ij} - (n^2+1)/2$ as a vertical height. The convex hull of these $n^2$ points is the gem of the arrangement, whose lower and upper boundaries are the regular subdivisions of the grid induced by $\pm z$. While random arrangements and generic linear magic squares have gems whose vertex counts grow with $n$, our main theorem shows that the classical Siamese (de la Loubère) magic square of every odd order $n\ge5$ has $f$-vector $(12,26,16)$, isometry group $\{\pm\mathrm{id}\}$, and only the twelve vertices forced by the boundary of the grid. The proof shears the lift onto five horizontal terraces and reduces the hull calculation to a finite table of polynomials in $m=(n-1)/2$; the same method gives $f$-vector $(12,24,14)$ for the base-$n$ digit-exchanged square. Along any family of linear squares with fixed steps the $f$-vector is eventually periodic in $n$, whereas over all linear magic squares of prime order $n$ the maximum vertex count grows as $Θ(\ln n)$. Whenever the heights have vanishing first moments, a short principal-axes argument shows that the point set has a non-trivial isometry if and only if the arrangement is self-complementary up to dihedral symmetry. An exact census of the $880$ magic squares of order four yields $616$ congruence classes and $352$ combinatorial types of gems, and shows that while vertex and facet counts are nearly insensitive to the magic line-sum conditions, the volume and solid centroid shift systematically.

comments
31 pages, 8 figures, 7 tables; ancillary verification scripts and census data in anc/
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2512.09170 ↗

We present a method for computing the tropicalization of a lattice over the valuation ring of a non-Archimedean field. Our construction relies on the entropy polynomial, a tropical polynomial whose coefficients are determined by the valuations of minors of a matrix representing the lattice. We show that the tropicalization of the lattice is the support of a polyhedral complex defined through this polynomial. Moreover, we prove that this tropicalization is a finitely generated tropical semimodule over the nonnegative tropical scalars and provide explicit generators in terms of the entropy vector of the lattice. Finally, we extend our construction to valuated bimatroids, establishing analogous results beyond the realizable setting.

comments
18 pages, 4 Figures. Comments are welcome!
fields
Combinatorics
pdf ↗ page arXiv:2512.12127 ↗

We show that if $G$ is a real semi-simple Lie group, and $Γ$ is a discrete subgroup of $G$ containing a subgroup $Σ$ acting ergodically (in a strong sense) on the Furstenberg boundary of $G$, then $Γ$ is not isomorphic to a free product of $Σ$ with $\mathbb{Z}$. Moreover, if $Σ$ has algebraic entries, then $Γ$ has algebraic entries as well. As a consequence, we show that if all irreducible discrete subgroups of ${\rm SL}_2(\mathbb{R}) \times {\rm SL}_2(\mathbb{R})$ act ergodically on $\mathbb{S}^1\times \mathbb{S}^1 $, such groups cannot be free groups (or even Gromov hyperbolic). In the appendix, we discuss a connection between the existence of discrete irreducible groups and diophantine properties of Lie groups.

comments
Theorem 1.1 is added, and some minor revisions and corrections are made
fields
Group Theory, Differential Geometry, Dynamical Systems
pdf ↗ page arXiv:2512.12141 ↗

This paper investigates global controllability properties of the Cahn-Hilliard equation with a standard polynomial double-well potential, posed on the $d$-dimensional flat torus $\mathbb T^d$. We first establish small-time global approximate controllability by means of controls acting on finitely many Fourier modes. The argument uses the nonlinearity constructively, through asymptotic and saturation properties, to generate new Fourier directions. We then prove null controllability of the linearized system using a spatially localized control supported on an arbitrary measurable subset of positive Lebesgue measure. The proof relies on quantitative propagation of smallness estimates and the dissipative fourth-order dynamics. For dimensions $d\in\{1,2,3\}$, we further derive local null controllability of the nonlinear equation via a fixed-point argument. Combining the global approximate and local null controllability results, we obtain global null controllability for arbitrary initial data and every $T>0$. The global control is constructed by concatenating an initial waiting stage, a finite-dimensional Fourier control, and a spatially localized control. To the best of our knowledge, these are the first results establishing small-time global approximate controllability and global null controllability for the Cahn–Hilliard equation.

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

This paper characterizes the well-posedness of Karush-Kuhn-Tucker system for perturbed composite optimization. Using the parabolic regularity, we introduce a novel second-order variational function, shown to be the pivotal object governing second-order behavior. This foundational result yields the strong second-order sufficient condition introduced here for the general class of composite optimization problems to naturally extend the classical second-order sufficient condition in nonlinear programming. Then we obtain several equivalent characterizations of the second-order qualification condition (SOQC) and highlight its relationship with the constraint nondegeneracy condition under the $\mathcal{C}^{2}$-cone reducibility assumption. These insights lead us to multiple equivalent conditions for the major Lipschitz-like/Aubin property of KKT systems, including SOQC combined with the new second-order subdifferential condition and SOQC combined with tilt stability of local minimizers. Under the $\mathcal{C}^{2}$-cone reducibility, we settle the long-standing question by proving the equivalence between the Aubin property of KKT systems around local minimizers and the classical notion of strong regularity. Finally, we demonstrate that the Lipschitz-like property is equivalent to the nonsingularity of the generalized Jacobian associated with the KKT system under a certain verifiable assumption. These results provide a unified and rigorous framework for analyzing stability and sensitivity of solutions to composite optimization problems, as well as for the design and justification of numerical algorithms.

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

Piecewise quasipolynomial growth of Presburger counting functions combines with tame persistent homology module theory to conclude piecewise quasipolynomial behavior of constructible families of finely graded modules over constructible commutative semigroup rings. Functorial preservation of constructibility for families under local cohomology, $\operatorname{Tor}$, and $\operatorname{Ext}$ yield piecewise quasipolynomial, quasilinear, or quasiconstant growth statements for length of local cohomology, $a$-invariants, regularity, depth; length of $\operatorname{Tor}$ and Betti numbers; length of $\operatorname{Ext}$ and Bass numbers; associated primes via $v$-invariants; and extended degrees, including the usual degree, Hilbert-Samuel multiplicity, arithmetic degree, and homological degree.

fields
Commutative Algebra, Combinatorics, Logic
pdf ↗ page arXiv:2512.18536 ↗

We study the Caffarelli-Kohn-Nirenberg type inequalities in the case of $p=1$ and generalize them adopting weight functions $w(|x|)$ on $R^n$ with $w(t)$ in ${W}(R_+)$. Here ${W}(R_+)$ is a general class of weight functions on $R_+$ including non-doubling weights like $e^{1/t}$ and $e^{-1/t}$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2512.21492 ↗

We introduce a general probabilistic framework for discrete-time, infinite-horizon discounted Mean Field Type Games (MFTGs) with both global common noise and team-specific common noises. In our model, agents are allowed to use randomized actions, both at the individual level and at the team level. We formalize the concept of Mean Field Markov Games (MFMGs) and establish a connection between closed-loop policies in MFTGs and Markov policies in MFMGs through different layers of randomization. By leveraging recent results on infinite-horizon discounted games with infinite compact state-action spaces, we prove the existence of a stationary Nash-equilibrium profile of closed-loop policies for the original MFTG when the state spaces and the action spaces are compact Polish spaces. We also present an example satisfying our assumptions.

fields
Optimization and Control
pdf ↗ page arXiv:2512.24313 ↗

We define and study burst-covering codes. We provide some general bounds connecting the parameters of a code with its burst-covering radius. We then provide stronger bounds on the burst-covering radius of cyclic codes, by employing linear-feedback shift-register (LFSR) sequences. For the case of BCH codes we prove a bound on pattern frequencies in LFSR sequences, and using this tool, we bound the burst-covering radius of binary primitive BCH codes and Melas codes. We then present an efficient burst-covering algorithm for cyclic codes. Finally, we present a bound on the critical exponent of cyclic codes based on the burst-covering radius.

comments
17 pages
fields
Information Theory
pdf ↗ page arXiv:2601.00435 ↗

In this paper we investigate the maximum size of finite semigroups of rational $n \times n$ matrices, with the goal of shedding more light on their structure. Such semigroups provide a rich generalisation of transition monoids of unambiguous (and, in particular, deterministic) finite automata. While in general such semigroups can be arbitrarily large in terms of $n$, a classical result of Schützenberger from 1962 implies an upper bound of $2^{O(n^2 \log n)}$ for irreducible semigroups. A semigroup of rational matrices is called irreducible if the only subspaces of $\mathbb{Q}^n$ that are invariant for all matrices in the semigroup are $\mathbb{Q}^n$ and the subspace consisting only of the zero vector. Irreducible matrix semigroups can be viewed as the building blocks of general matrix semigroups, and as such play an important role in mathematics and computer science. From the point of view of automata theory, they can be seen as a generalisation of strongly connected weighted automata. Using a very different technique from that of Schützenberger, we improve the upper bound on the cardinality to $3^{n^2}$. This is the main result of the paper. The bound is in some sense tight, as we show that there exists, for every $n$, a finite irreducible semigroup with $3^{\lfloor n^2/4 \rfloor}$ rational matrices. Our main result also leads to an improvement of a bound, due to Almeida and Steinberg, on the mortality threshold of finite semigroups of rational matrices. The mortality threshold is a number $\ell$ such that if the zero matrix is in the semigroup, then the zero matrix can be written as a product of at most $\ell$ matrices from any subset that generates the semigroup.

comments
full version of a STACS'26 paper, invited for a special issue of LMCS, revision based on referee reports
fields
Group Theory, Rings and Algebras
pdf ↗ page arXiv:2601.01236 ↗

In 2002, the author studied together the recurrences $u_{n+2}=u_{n+1}+u_n/n$ and $v_{n+2}=v_{n+1}/n+v_n$, in which the factor $1/n$ is placed in a symmetric way. The first one leads to $e$ and the second one to $π$, and each of them is classical when taken separately. When $n$ is replaced by $n+m$ in the denominators, with an integer $m\ge0$, the solutions grow like $f(m)\,n$ and $g(m)\sqrt n$, and the connection constants $f(m)$ and $g(m)$, suitably normalized, are explicit linear forms in $1$ and $e$ and in $1$ and $π$. We let $m$ become a complex variable $z$. Then $f$ and $g$ become meromorphic functions of $z$, the connection functions, which satisfy linear functional equations of order two in $z$, as the Gamma function satisfies $Γ(z+1)=zΓ(z)$. They add a third object to the classical pair formed by a P-recursive sequence and its D-finite generating function. We characterize them by their functional equations and their growth, as Wielandt's theorem does for the Gamma function, we show that they are differentially transcendental, and we explain the linear forms at the integers by the solutions excluded by the growth condition. In general, when the coefficients of a linear recurrence in $n$ depend on the parameter only through $n+z$, a translation argument gives a functional equation for the connection constant under the normalization and convergence assumptions of our translation theorem. Conversely, a solution of a linear functional equation with polynomial coefficients which has uniform polynomial growth in a right half-plane is the limit of an explicit P-recursive family of interpolation polynomials, and this applies to all the connection functions given by our existence theorem for coefficients of degree one in $n+z$.

comments
25 pages, 1 figure. Version 2 is a revised version of version 1, with a new title and new results (Theorems 1.6 to 1.9)
fields
Number Theory
pdf ↗ page arXiv:2601.04242 ↗

Ultrametrics are an important class of distances used in applications such as phylogenetics, clustering and classification theory. Ultrametrics are essentially distances that can be represented by an edge-weighted rooted tree so that all of the distances in the tree from the root to any leaf of the tree are equal. In this paper, we introduce a generalization of ultrametrics called arboreal ultrametrics which have applications in phylogenetics and also arise in the theory of distance-hereditary graphs. These are partial distances, that is distances that are not necessarily defined for every pair of elements in the groundset, that can be represented by an ultrametric arboreal network, that is, an edge-weighted rooted network whose underlying graph is a tree. As with ultrametrics all of the distances in the ultrametric arboreal network from any root to any leaf below it are are equal but, in contrast, the network may have more than one root. In our two main results we characterize when a partial distance is an arboreal ultrametric as well as proving that, somewhat surprisingly, given any unrooted edge-weighted phylogenetic tree there is a necessarily unique way to insert roots into this tree so as to obtain an arboreal ultrametric.

comments
25 pages, 5 figures
fields
Combinatorics
pdf ↗ page arXiv:2601.04836 ↗

The study of global-in-time dynamics of vacuum is crucial for understanding viscous flows. In particular, physical vacuum, which ensures a finite, nontrivial pressure-induced acceleration in the normal direction on the moving boundary, naturally arises in the motion of gaseous stars and shallow water. The corresponding large-data problems for spherically symmetric flows remain open, due to the combined difficulties of coordinate singularity at the origin and degeneracy on the moving boundary. In this paper, we analyze the free boundary problem for the barotropic compressible Navier-Stokes equations with density-dependent viscosity coefficients (as in the shallow water equations) in two and three spatial dimensions. For a general class of spherically symmetric initial densities: $ρ_0^β\in H^3$ with $β\in (\frac{1}{3},γ-1]$ ($γ$: adiabatic exponent), vanishing on the moving boundary in the form of a distance function, we establish the global existence of the unique classical solution with large data. Moreover, our solution is classical up to the moving boundary, and the physical vacuum is allowed for the data under consideration here when $β=γ-1$. The key ingredient of our analysis is to obtain the uniform control over the first-order spatial derivatives of the flow map $η(t,r)$ in spherically symmetric Lagrangian coordinates, which is achieved by some novel density-weighted estimates and flow-map-weighted estimates for the solutions.

comments
141 pages, 2 figures
fields
Analysis of PDEs, Mathematical Physics, Functional Analysis
pdf ↗ page arXiv:2601.06620 ↗

We investigate the quantum structure of spacetime at fundamental scales via a novel, Lorentz-invariant noncommutative coordinate framework. Building on insights from noncommutative geometry, spectral theory, and algebraic quantum field theory, we systematically construct a quantum spacetime algebra whose geometric and causal properties are derived from first principles. Using the Weyl algebra formalism and the Gelfand-Naimark-Segal (GNS) construction, we rigorously define operator-valued coordinates that respect Lorentz symmetry and encode quantum gravitational effects through nontrivial commutation relations. We show how the emergent quantum spacetime exhibits minimal length effects, which deliver both classical Minkowski distances and quantum corrections proportional to the Planck length squared. Furthermore, we establish that noncommutativity respects a fuzzy form of causality, where the quantum causal structure gives back the light cone in the classical limit, vanishing for spacelike separations and encoding a time orientation for timelike intervals.

comments
31 pages, close to published version
journal
J. Geom. Phys. 231 (2027) 106030
fields
Mathematical Physics
pdf ↗ page arXiv:2601.07350 ↗

We study the problem of finding the minimum $\mathbb{L}\_2$-norm element in a transportation polytope. It corresponds to minimizing the index of coincidence or maximizing R{é}nyi entropy over joint probability distributions with prescribed marginals. The solution is straightforward under a feasibility condition on the marginals. We make three contributions. First, we decompose the basic solution into a mixture of three interpretable couplings and derive a closed-form sampling procedure, revealing its role as the $\mathbb{L}\_2$-projection of the uniform distribution onto the transportation polytope. Second, we show that the feasibility condition becomes exponentially rare as the number of modalities grows, which highlights the practical necessity of a more general construction. Third, we provide a KKT-based iterative construction of the optimal coupling for arbitrary marginals with explicit Lagrange multipliers.

fields
Information Theory, Statistics Theory
pdf ↗ page arXiv:2601.09347 ↗

For $d\geq 4$, Kalai (1987) characterized all simplicial $(d-1)$-spheres with $g_2=0$, and for $k\geq 2$ and $d\geq 2k$, Murai and Nevo (2013) characterized all simplicial $(d-1)$-spheres with $g_k=0$. In addition, for $d\geq 4$, Nevo and Novinsky (2011) characterized all simplicial $(d-1)$-spheres with $g_2=1$. Motivated by these results, we characterize, for any $k\geq 2$ and $d\geq 2k+1$, all simplicial $(d-1)$-spheres with no missing faces of dimension larger than $d-k$ that satisfy $g_k=1$. When $d=2k$, we obtain a characterization of simplicial $(d-1)$-spheres with $g_k=1$ and no missing faces of dimension greater than $k$, under the additional assumption that there exists at least one missing face of dimension $k$. Finally, for $k=3$, we are able to remove this assumption and characterize all simplicial $5$-spheres with no missing faces of dimension larger than $3$ that satisfy $g_3=1$.

comments
21 pages, to appear in Algebraic Combinatorics
fields
Combinatorics
pdf ↗ page arXiv:2601.10072 ↗

We study dual-penalty smoothing for convex functions with a finite-dimensional supremum representation. The regularization yields a differentiable surrogate with controlled approximation error, a single-valued dual maximizer, and explicit gradient formulas. We then study an accelerated inertial dynamic with vanishing damping driven by a time-dependent regularized function whose parameter decreases to zero. The global well-posedness of this system is not an immediate consequence of standard ODE theory, since the gradient of the regularized objective is in general only locally Lipschitz and its local Lipschitz modulus may deteriorate as the smoothing parameter vanishes. We therefore establish existence and uniqueness of global trajectories through a local well-posedness analysis and a continuation argument. Then, assuming that the original problem has a minimizer and under mild integrability conditions on the regularization schedule, we establish an accelerated $\mathcal{O}(t^{-2})$ decay estimate for the regularized and original objective values and, in the regime $α>3$, a sharper $o(t^{-2})$ decay together with weak convergence of trajectories to a minimizer of the original nonsmooth problem via an Opial-type argument. Applications to multiobjective optimization (through Chebyshev/max scalarization) and to distributionally robust optimization (via entropic regularization over ambiguity sets) illustrate the scope of the framework.

fields
Optimization and Control
pdf ↗ page arXiv:2601.15208 ↗

We study multigrade deep learning (MGDL) as a principled framework for structured error refinement in deep neural networks. While the approximation power of neural networks is now relatively well understood, training very deep architectures remains challenging due to highly nonconvex and often ill-conditioned optimization landscapes. In contrast, for relatively shallow networks, most notably certain one-hidden-layer ReLU models, training admits convex reformulations with global guarantees under appropriate settings, motivating learning paradigms that improve stability while scaling to depth. MGDL builds on this insight by training deep networks grade by grade: previously learned grades are frozen, and each newly added grade-wise subnetwork is composed on top of the previously learned grades and trained to fit the residual left by the current approximation, yielding a structured and interpretable hierarchical refinement process. We develop an operator-theoretic foundation for MGDL and prove that, for any continuous target function defined on a hypercube, there exists a fixed-width multigrade ReLU scheme whose residuals are pointwise nonincreasing in magnitude and converge uniformly to zero, with strict $L^p$-norm decay at every nontrivial grade for $p\in [1,\infty)$. To the best of our knowledge, this work provides the first rigorous constructive approximation guarantee showing that a grade-wise residual refinement scheme can achieve vanishing error in a fixed-width multigrade ReLU architecture.

fields
Numerical Analysis
pdf ↗ page arXiv:2601.16884 ↗

We develop a convergence analysis for generative diffusion models that simultaneously accounts for the three principal error sources in stochastic sampling: initialization, score matching, and discretization of the reverse-time stochastic differential equation (SDE). Our central tool is the notion of a iterative-wise general strong scheme, a broad class of discretization methods for the reverse dynamics defined via explicit, index-wise tolerances on their Itô–Taylor coefficients. This notion refines Kloeden and Platen's general strong schemes into an iterate-wise formulation whose per-step conditions imply the classical remainder bound. We prove a 2-Wasserstein convergence theorem that applies to this entire class, reducing the analysis of any concrete sampler to a finite checklist, and covers general forward processes with time-dependent, spatially linear drift and spatially independent diffusion coefficient. We focus on dissipative reverse-time SDEs, which allows us to relax the $T$-dependence of the discretization and score-matching errors from exponential to polynomial. We instantiate our theorem for Euler–Maruyama, the exponential integrator, and, as our main application, derivative-free stochastic Runge–Kutta schemes of strong order $1.5$. To our knowledge, these are the first full convergence guarantees for solvers whose strong order strictly exceeds that of Euler–Maruyama. We further derive the resulting iteration complexity and a parameter-selection rule for the terminal time, score accuracy, and step size. Numerical experiments on Gaussian toy models and CIFAR-10 are consistent with the predicted convergence orders, and on ImageNet, out-of-the-box higher-order SDE solvers can yield substantial speed-ups, requiring at least four times fewer score evaluations than Euler–Maruyama. Code available at: https://github.com/emanuelpfarr/SSGDM.

fields
Numerical Analysis
pdf ↗ page arXiv:2601.18425 ↗

The system of the Boussinesq equations is one of the most important models for geophysical fluids. This paper focuses on the initial-boundary problem of the 3D incompressible anisotropic Boussinesq system with horizontal dissipation. The goal here is to assess the stability property and large-time behavior of perturbations near the hydrostatic balance. By utilizing the structure of the system, the energy methods and the means of bootstrapping argument, we prove the global stability property in the Sobolev space $H^3(\mathbb{R}^3_+)$. After taking a Fourier transform in $x_h = (x_1, x_2)$ and Fourier cosine and sine transforms in $x_3$ for the system, we obtain the decay rates for the global solution itself as well as its derivatives.

fields
Analysis of PDEs
pdf ↗ page arXiv:2601.18481 ↗

Continuum Glauber dynamics is a spatial birth-death process whose stationary distribution is a Gibbs distribution. We establish a spectral gap for Continuum Glauber dynamics applied to Gibbs point processes with repulsive pair potentials, a well-known special case of which is the hard sphere model. For arbitrary-range repulsive pair potentials, we show that a continuous version of Spectral Independence suffices to establish a spectral gap. This extends the regime of activity for which Continuum Glauber dynamics is known to mix, yielding a simple efficient sampling algorithm for arbitrary-range pair potentials that matches the known efficient sampling regime for finite-range pair potentials currently based on specialized algorithms. As a consequence, we also improve the threshold up to which packings of fixed size/density can be efficiently sampled from a bounded domain, the first improvement since Kannan, Mahoney and Montenegro (2003). To prove these results, we develop continuous analogs of Spectral Independence and negative fields localization. We show that a stronger variant of zero-freeness implies Spectral Independence, which in turn allows us to run the localization scheme to boost the spectral gap of Continuum Glauber dynamics from smaller activity to larger activity. While this follows the high-level blueprint of Chen and Eldan (2022) for the discrete setting, we have to address several novel difficulties due to the continuous setting. Notably, we avoid discretization in the algorithm and the analysis and work directly in the continuous setting.

comments
85 pages, 1 figure. Fixed typos, streamlined proofs and added references. Extended main result from R^d to complete separable metric spaces. Accepted to SODA 2027
fields
Probability
pdf ↗ page arXiv:2601.18748 ↗

The purpose of this note is to show that a connection with closed skew-symmetric torsion and reducible holonomy admits a locally defined Riemannian submersion together with a projected geometry on the base. We reframe known submersion results for non-Kähler Bismut-Hermite-Einstein manifolds and sHKT structures in this context. For homogeneous SKT structures on semi-simple Lie groups, we obtain the holonomy decomposition leading to holomorphic submersions over generalized flag manifolds.

journal
SIGMA 22 (2026), 104, 16 pages
fields
Differential Geometry
pdf ↗ page arXiv:2602.01458 ↗

Universal channel decoders based on transformers-such as the Foundation Error Correction Code Transformer (FECCT)-achieve competitive decoding performance across diverse code families with a single shared backbone, optionally followed by code-specific finetuning. However, the high computational complexity and large parameter footprint of FECCT present substantial obstacles to practical deployment. To address these challenges, we investigate structured pruning for FECCT and propose Spectral-Aligned Pruning (SAP), a structure-aware framework that enables cross-code reuse of structured pruning masks by leveraging the spectrum of the corresponding bipartite graph. SAP is grounded in classical graph analysis of codes: the two algebraically largest adjacency eigenvalues provide compact spectral proxies for degree scale, expansion ratio, and minimum-distance lower bounds. These quantities are directly relevant to decoding performance: degree scale reflects how densely codeword bits and parity checks are connected; expansion ratio influences how information propagates across the bipartite graph; and minimum distance characterizes codeword separation. Based on this connection, SAP uses these two leading eigenvalues as a lightweight code signature for pruning-mask retrieval. Empirically, this two-dimensional signature yields stable library selection equivalent to higher-dimensional spectral signatures in our evaluation. After pruning, SAP uses parameter-efficient low-rank adaptation (LoRA) to recover decoding performance while storing only a small number of additional adapter parameters per code. Experiments across diverse codes show that SAP achieves decoding performance comparable to dedicated per-code pruning, while enabling substantial reductions in computational cost and model memory footprint through kernel-level structured pruning. Code is available at https://github.com/iil-postech/sap.

fields
Information Theory
pdf ↗ page arXiv:2602.01602 ↗

We study the pointwise regularity of energy densities associated with harmonic functions on the $N$-dimensional Sierpinski gasket $(N\ge 2)$ with respect to the Kusuoka measure. For any nonconstant harmonic function, we prove that every Borel representative of the density is discontinuous at every point of a set of full Kusuoka measure. In sharp contrast, on each one-dimensional edge of the gasket -- itself a set of zero Kusuoka measure -- the density admits a canonical pointwise version, which is $γ_N$-Hölder continuous on that edge with the explicit and optimal exponent $γ_N=\log_2 \{(\sqrt{4N+5}+1)/(\sqrt{4N+5}-1)\}$.

comments
31 pages, 2 figures. Minor revision
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2602.06642 ↗

We study the manifold $Q_{Γ, λ}$ of isospectral real skew-symmetric matrices with a prescribed sparsity pattern determined by a graph $Γ$. The compact torus $T^n$ acts naturally on $Q_{Γ,λ}$ by conjugation, and this action can be studied using GKM theory. We prove two results about this manifold and its GKM graph. The first theorem describes how the GKM graph of $Q_{Γ, λ}$ is obtained from the GKM graph of the corresponding manifold $M_{Γ, λ}$ of isospectral Hermitian matrices. The second theorem shows that equivariant formality of $Q_{Γ,λ}$ implies equivariant formality of $M_{Γ,λ}$, whereas the converse fails.

comments
16 pages, 1 figure
fields
Algebraic Topology, Combinatorics
pdf ↗ page arXiv:2602.08366 ↗

Distributed zeroth-order optimization is increasingly applied in heterogeneous scenarios where agents possess distinct data distributions and objectives. This heterogeneity poses fundamental challenges for convergence analysis, as existing convergence analyses rely on relatively strong assumptions to ensure theoretical guarantees. Specifically, at least one of the following three assumptions is usually required: (i) data homogeneity across agents, (ii) $\mathcal{O}(pn)$ function evaluations per iteration with $p$ denoting the dimension and $n$ the number of agents, or (iii) the Polyak–Łojasiewicz (P–L) or strong convexity condition with a known corresponding constant. To overcome these limitations, we propose a Heterogeneous Distributed Zeroth-Order Compressed (HEDZOC) algorithm, which is based on a two-point zeroth-order gradient estimator and a general class of compressors. Without assuming data homogeneity, we develop the analysis covering three settings: general nonconvex functions, functions satisfying the P–L condition without knowing the P–L constant, and those with a known constant. To the best of our knowledge, the proposed HEDZOC algorithm is the first distributed zeroth-order method that establishes convergence without relying on the above three assumptions. Moreover, it achieves linear speedup convergence rate, which is comparable to state-of-the-art results attainable under data homogeneity and exact communication assumptions. Finally, experiments on heterogeneous adversarial example generation validate the theoretical results.

fields
Optimization and Control
pdf ↗ page arXiv:2602.08659 ↗

Branch-price-and-cut is the state-of-the-art exact method for solving many types of vehicle routing problems, and it is particularly effective for vehicle routing problems with time windows. A well-known challenge in branch-price-and-cut is that the generation of columns is guided by information from the linear relaxation of the master problem, with no guarantee that they will be useful from an integer perspective. As a consequence, high-quality primal solutions are often found only after significant cutting and branching, or the use of primal heuristics. In this work, based on the ideas of pricing-for-integrality, we propose a primal heuristic for branch-and-price and evaluate it on the electric vehicle routing problem with time windows extended with charging time slots. The heuristic first uses a destroy-and-repair phase to enrich the column pool and then applies a restricted master heuristic to obtain a primal solution. In the destroy-and-repair phase, route generation is guided by scaled dual values and heuristic feedback based on previously generated routes, with the aim of producing routes likely to contribute to high-quality integer solutions. Computational tests on the electric vehicle routing problem with time windows extended with charging time slots show that the proposed heuristic reduces the average optimality gap in the root node by around 60% compared to a restricted master heuristic and by around 25% - 30% compared to the implemented benchmark diving heuristic.

comments
34 pages, 3 figures
fields
Optimization and Control
pdf ↗ page arXiv:2602.08673 ↗

In this note we point out a mistake in theorem 4.4 of [Sam06], which states that a semidirect product $F_3\rtimes_φ\mathbb{Z}$ whose defining automorphism $φ$ is triangular polynomially-growing and fixes a free factor of rank $2$ is a CAT(0) group. We give and prove the corrected statement: such a group is CAT(0), if and only if $φ$ is the identity or if the element of $F_2$ twisting the non-fixed generator is not in the commutator subgroup of $F_2$. This gives new examples of free-by-cyclic groups that cannot act properly by semisimple isometries on a CAT(0) space, that are similar to Gersten's examples [Ger94]. Some of them, interestingly, are still hierarchically hyperbolic. We also construct CAT(0) structures for new examples of $F_3$-by-$\mathbb{Z}$s by thickening the strips in Bridson's tree of spaces construction [BH99].

comments
11 pages, 3 figures
fields
Group Theory
pdf ↗ page arXiv:2602.08759 ↗

Vanilla gradient methods are often highly sensitive to the choice of stepsize, which typically requires manual tuning. Adaptive methods alleviate this issue, with AdaGrad being a prominent example. In this work, we first show that, in composite convex optimization, AdaGrad may fail to exploit the Hölder-smoothness of the differentiable term, as its stepsizes may decrease too rapidly, leading to convergence rates arbitrarily close to the nonsmooth $\mathcal O(n^{-1/2})$ rate. Motivated by this limitation, we study AdaGrad-Diff, a block-wise extension of the UniSgd method considered by \cite{rodomanov2024universality}, which accumulates successive gradient differences rather than gradients themselves. In the deterministic Lipschitz-smooth setting, we prove summability of squared gradient differences without assuming bounded iterates, yielding weak convergence to a minimizer in Hilbert spaces. Moreover, we show that, under $ν$-Hölder-smoothness, stepsizes decay no faster than $n^{-(1-ν)/2}$, thereby avoiding AdaGrad's failure mechanism and recovering the standard $\mathcal O(n^{-(1+ν)/2})$ rate. The same approach recovers known stochastic convergence rates under a unified condition covering bounded variance and interpolation. Numerical experiments demonstrate that the proposed method is more robust than AdaGrad in several practically relevant settings.

comments
35 pages
fields
Optimization and Control
pdf ↗ page arXiv:2602.13112 ↗

The classical Gel'fand's inverse problem asks whether a Riemannian manifold is uniquely determined by the knowledge of the heat kernel on any open subset of the manifold. We study this inverse problem in the non-smooth setting in the framework of ${\rm RCD}(K,N)$ spaces, namely, metric-measure spaces with synthetic Riemannian Ricci curvature bounded below by $K$ and dimension bounded above by $N$. We establish the unique solvability of Gel'fand's inverse problem for the class of compact ${\rm RCD}(K,N)$ spaces whose regular set admits Lipschitz Riemannian structure. As an application, we obtain the continuity of Gel'fand's inverse problem in the class of closed Riemannian manifolds with bounded Ricci curvature, diameter and volume bounded from below. We note that the results are new even for Einstein orbifolds and (weighted) Lipschitz Riemannian manifolds with non-smooth boundary.

comments
main result improved, appendix added
fields
Differential Geometry, Analysis of PDEs, Metric Geometry
pdf ↗ page arXiv:2602.14527 ↗

Let $\mathcal C= \{k_1<k_2 < \cdots\}$ be Cantor set of integers, that is a set of integers with restricted digits modulo a base $b$, and suppose $0$ is one of the restricted digits. We show that $$ \liminf_{M-N\to\infty}\mathbb E _{n\in [N]- [M]} m(A\cap T^{-k_n} A \cap \cdots \cap T^{-\ell k_n} A )>0. $$ The averages above are uniform in the index $n$, and so the set of indices $n$ for which $m(A\cap T^{-k_n} A \cap \cdots \cap T^{-\ell k_n} A )>0$ is syndetic. By the Furstenberg correspondence principle, it follows that for every set of integers $A$ of positive upper Banach density there is a syndetic set $B$ of indices such that, for each $n \in B$, the set of $a$ with $a, a+k_n, \ldots, a+ \ell k_n \in A$ again has positive upper Banach density. A Cantor set contains an IP-set, so the existence of such progressions, and the positivity of the density above for a single index, already follow from the IP Szemerédi theorem of Furstenberg and Katznelson, and from the work of Kra and Shalom. The point of this paper is instead the frequency with which the step sizes $k_n$ may be found, measured in the natural enumeration of the Cantor set itself.

code
github.com/lacey-gatech/CantorSzemeredi ∎ Lean project (lakefile.toml, lean-toolchain) builds with 2 sorry warnings at d29e8f9, checked 2026-10-30 build details
comments
30 pages. A partial formalization is at https://github.com/lacey-gatech/CantorSzemeredi The formalization does not include a Furstenberg Dichotomy result, nor a proof of the ergodic decomposition
fields
Number Theory, Classical Analysis and ODEs, Dynamical Systems
pdf ↗ page arXiv:2602.15299 ↗

How rich is the collection of groups with a given prominent property? In this work we approach this question for property~$R_\infty$, which says that every automorphism $\varphi$ of a given group has infinitely many orbits under the $\varphi$-twisted conjugation action $(g,x) \mapsto gx\varphi(g)^{-1}$. Generalising the soluble groups of Herbert Abels to a large family over many integral domains, we prove that most such groups have property~$R_\infty$ drawing from a classical result of Levchuk and a swift observation by Jabara. Within the broad programme of cataloguing finitely generated groups up to quasi-isometry, our groups can then be separated by finiteness properties and cohomological dimension whilst having~$R_\infty$. Abandoning finite presentability, we establish that property~$R_\infty$ is very abundant in a strong sense: there are uncountably many finitely generated groups (which can all be chosen to be amenable or non-amenable) that have~$R_\infty$ and are pairwise not quasi-isometric. The proofs vary in flavour. On the amenable side we use carefully constructed quotients of Abels' groups and a general strategy for quasi-isometric diversity established by Minasyan, Osin, and Witzel. For the non-amenable constructions we rely on modifications of Leary's type $\mathtt{FP}$ groups, further cohomological arguments, and recent powerful criteria for~$R_\infty$ due to Iveson, Martino, Sgobbi, Wong, and Fournier-Facio.

comments
42 pages
fields
Group Theory, Algebraic Topology
pdf ↗ page arXiv:2602.17411 ↗

We discuss some properties of the distance functions on Riemannian manifolds and we relate their behavior to the geometry of the manifolds. This leads to alternative proofs of some "classical" theorems connecting curvature and topology.

fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2602.17629 ↗

Our goal is to provide precise effective operators for monolayer graphene at Fermi energy. We consider the microscopic potential created by a lattice, and add a macroscopic potential with the same periodicity but varying at a scale $\varepsilon^{-1} \in \mathbb{N}$, creating a superlattice. Our approach combines a variational approximation with perturbation theory and a multiscale method. At the effective level the usual massless Dirac operator is enriched by other operators. We provide simulations for graphene to show the increased accuracy, and a theoretical result proving the improved validity time scale in the dynamical case.

fields
Mathematical Physics
pdf ↗ page arXiv:2602.19185 ↗

Complex Gaussian fields $(g_x)$ on $\mathbb{Z}_q^d$ are constructed from a class of reversible long range random walks $(X_t)_{t\in \mathbb{N}}$ on $\mathbb{Z}_q^d$ in \citeauthor{GM2025a} (\citeyear{GM2025a}). The construction is from taking $\mathbb{E}\big [g_x\bar{g}_y\big ]= (1-α)G(x,y;α)$, where $G(x,y;α)$ is the Green function of a random walk with killing in each transition at rate $1-α$. Another real Gaussian field $(h^\circ_x=\Re g_x + \Im g_x)$ is constructed such that also Cov$(h^\circ_x,h^\circ_y) = (1-α)G(x,y;α)$. If the random walk is not reversible, then a different approach is needed because $G(x,y;α)$ is not exchangeable in $x,y$. It is shown that there exists two real Gaussian fields $(h^+_x)$, $(h^-_y)$ such that Cov$(h^+_x,h^-_y) = (1-α)G(x,y;α)$. A decomposition of the Gaussian field $(g_x)$ into a sum of independent Gaussian random variables is made. By letting $q\to \infty$ the Gaussian field becomes defined from an infinite-dimensional random walk on a torus. The random walk model is also extended to $d=\infty$ by considering a de Finetti random walk where entries in the increments of the random walk are exchangeable. A limit Gaussian field on $\mathbb{R}^d$ arises from a central limit theorem approach. The transform of this Gaussian field, which is again a Gaussian field, is calculated. It has a simpler covariance matrix than the original field. The Hamiltonian connected to the Gaussian field is calculated. A limit theorem for the partition function arising from the Hamiltonian is found.

fields
Probability
pdf ↗ page arXiv:2602.19469 ↗

We study online Wasserstein distributionally robust optimization (DRO), where the ambiguity set is a Wasserstein ball centered at the empirical distribution and evolves with each observation. We formulate each round as a zero-sum game and develop an online distributional best-response algorithm that requires only one projected subgradient step per iteration. Combining regret analysis with measure concentration, we establish explicit, instance-dependent, and high-probability convergence rates to the optimal offline DRO value.

fields
Optimization and Control
pdf ↗ page arXiv:2602.20403 ↗

For several physically relevant SPDEs, it is known that global weak solutions coexist with local strong ones. Typically, weak-strong uniqueness results are known, and ensure that the global and strong solutions coincide as long as the latter exist. Times at which a weak solution does not coincide with a strong one are called singular times. Determining their fractal dimension is fundamental to capturing the regularity of weak solutions. We introduce a probabilistic notion of singular times for a wide class of semilinear SPDEs. We show that sets of singular times have fractal dimension (i.e., Hausdorff and/or Minkowski) at most $ 1-\ell\, \mathsf{Exc}$, where $\ell$ and $\mathsf{Exc}$ are the time integrability and the excess of spatial regularity compared to the critical regularity of the energy bound associated with weak solutions, respectively. Moreover, their corresponding $(1-\ell\,\mathsf{Exc} )$-dimensional measure is zero. We formulate and apply our theory to annealed strong Leray-Hopf solutions of 3D Navier-Stokes equations (NSEs) with physically relevant noises, including rough Kraichnan and Lie transport. In particular, we extend the fundamental $1/2$-dimensional bound of Leray and Scheffer on singular times for 3D NSEs to the stochastic setting, and we prove new conditional results under supercritical Serrin's conditions, irrespective of the roughness of the noise. Our framework is new even in the deterministic case, and provides the first partial regularity results for weak solutions to SPDEs with multiplicative noise.

comments
54 pages, 3 figures. Typos corrected
fields
Probability, Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2602.21981 ↗

In this paper, we introduce a new family of mass-type invariants for time-symmetric initial data in space-times satisfying the Dominant Energy Condition. For positive cosmological constant, these invariants, unlike the total Hawking mass, turn out to be genuinely effective in providing new characterizations of the de Sitter solution. From a theoretical standpoint, this opens a new perspective on how one might refine the rigidity statement originally proposed by Min-Oo in his well known conjecture, later refuted by the counterexamples of Brendle, Marques, and Neves. Via a formal limiting procedure, we also define another invariant, the 1-harmonic Mass, for which we independently prove a positive mass theorem and a Penrose-type inequality, thereby extending tools for probing space-time geometries in the presence of a positive cosmological constant.

comments
Minor modifications w.r.t. the previous version: a more detailed proof of the small-sphere-limit Theorem 3.8 has been inserted and a proof of the existence of the weak IMCF with outer obstacle starting from a pole has been added in the new Appendix C
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2603.01543 ↗

We establish formulas for the Poincaré polynomial of the type B analogue of the Deligne–Knudsen–Mumford moduli space of rational curves with n marked points, providing type B counterparts to results by Keel, Manin, Getzler, and Yuzvinsky. We establish functional and differential equations satisfied by the bivariate exponential generating function of these polynomials. We show how this generating function relates to the classical one in type A. We deduce the gamma-positivity of these polynomials via a quadratic recursion and discuss a type B analogue of a formula found by Aluffi, Marcolli and Nascimento in type A.

comments
17 pages. v2 minor edits
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2603.01956 ↗

Underdamped Langevin dynamics (ULD) is a widely-used sampler for Gibbs distributions $π\propto e^{-V}$, and is often empirically effective in high dimensions. However, existing non-asymptotic convergence guarantees for discretized ULD typically scale polynomially with the ambient dimension $d$, leading to vacuous bounds when $d$ is large. The main known dimension-free result concerns the randomized midpoint discretization in Wasserstein-2 distance (Liu et al.,2023), while dimension-independent guarantees for ULD discretizations in KL divergence have remained open. We close this gap by proving the first dimension-free KL divergence bounds for discretized ULD. Our analysis refines the KL local error framework (Altschuler et al., 2025) to a dimension-free setting and yields bounds that depend on $\mathrm{tr}(\mathbf{H})$, where $\mathbf{H}$ upper bounds the Hessian of $V$, rather than on $d$. As a consequence, we obtain improved iteration complexity for underdamped Langevin Monte Carlo relative to overdamped Langevin methods in regimes where $\mathrm{tr}(\mathbf{H})\ll d$.

comments
40 pages, 1 table, ICML2026
fields
Optimization and Control
pdf ↗ page arXiv:2603.02429 ↗

We study the worst-case approximation of multivariate periodic functions from the weighted Korobov space $H_{d,α,\boldsymbolγ}$ with smoothness $α>1/2$ and weights $\boldsymbolγ$ in the Lebesgue norm $L_p([0,1]^d)$ for $1\le p\le\infty$. We analyze a \emph{median lattice algorithm} that reconstructs a truncated Fourier series by approximating the coefficients on a hyperbolic-cross-type index set using $R$ rank-1 lattice sampling rules with independent randomly chosen generating vectors, and then aggregating the resulting coefficient estimators via the componentwise median. For an odd number of repetitions $R$ and an odd prime lattice size $N$, where $R$ depends logarithmically on $N$, we prove high-probability error bounds in both $L_\infty$ and $L_2$. Interpolation then yields the result for all $ p \in [1,\infty]$. In particular, with high probability, the worst-case $L_p$-error satisfies, for any $β>0$, an upper bound of the following form \[ \ C_{d,α,β,\boldsymbolγ,τ,p}\,R^{\frac{1}{2}+(\frac12 - \frac1p)_+} N^{- α+ (\frac12 - \frac1p)_+ + β}, \] where $(x)_+ = \max\{x, 0\}$, and the constant $C_{d,α,β,\boldsymbolγ,τ,p}$ is independent of $N$ and $R$. For $p=\infty$, $C_{d,α,β,\boldsymbolγ,τ,\infty}$ is dimension-independent under the summability condition $\sum_{j=1}^\infty γ_j^{1/(2α)}<\infty$. These results extend recent analyses of median-based lattice approximation in $L_2$ and complement related multiple-shift lattice approaches, showing that median aggregation yields nearly optimal $L_p$-approximation rates (up to logarithmic factors and an arbitrarily small loss) in weighted Korobov spaces.

fields
Numerical Analysis
pdf ↗ page arXiv:2603.05271 ↗

Let $f:\mathbb{P}^1\to\mathbb{P}^1$ be a quadratic rational map defined over the rational field $\mathbb{Q}$ with nonabelian automorphism group. We prove that no such map has a $\mathbb{Q}$-rational periodic point with exact period $N\ge 4$. We also give an explicit parametrization of such maps that have $\mathbb{Q}$-rational periodic points of exact period $1$, $2$, and $3$. In addition, we show that the number of $\mathbb{Q}$-rational preperiodic points of such a map $f$ cannot exceed $6$. As a result, we completely classify all portraits of $\mathbb{Q}$-rational preperiodic points for quadratic rational maps defined over $\mathbb{Q}$ with nonabelian automorphism group, showing that there are exactly $7$ such portraits, one of which is the empty portrait.

comments
20 pages, 1 table. v4: two missing portraits added (a single 2-cycle and the empty portrait), so there are exactly 7 portraits; 3-cycles through infinity added to Theorem 3.5; smaller corrections throughout
fields
Number Theory, Dynamical Systems
pdf ↗ page arXiv:2603.06203 ↗

We establish an extreme value theorem for the geodesic flow $g_t$ on the hyperbolic surface $Θ\backslash\mathbb{H}^2$ associated with the theta group $Θ$. To capture excursions into both cusps of this surface, we introduce a generalized continued fraction algorithm obtained by splicing the even and odd–odd continued fraction maps into a single dynamical system. We prove that the natural extension of this map is isomorphic to the first return map of the geodesic flow on a suitable cross-section. Using spectral properties of the associated transfer operator, we derive a Galambos-type extreme value law for the digits of the spliced continued fraction. This symbolic result is then translated into a geometric extreme value theorem describing maximal cusp excursions of geodesics on $Θ\backslash\mathbb{H}^2$.

comments
38 pages, 7 figures
fields
Dynamical Systems, Number Theory
pdf ↗ page arXiv:2603.07649 ↗

We consider continuous-time heterogeneous agent models with recursive utility (Epstein-Zin utility) cast as mean field games, in which agents prefer late resolution of uncertainty. The model leads to a system coupling a pair of Hamilton-Jacobi-Bellman equations with state constraints and Fokker-Planck-Kolmogorov equations. We investigate the existence of solutions to the mean field game system and discuss some important qualitative features of the model.

fields
Optimization and Control
pdf ↗ page arXiv:2603.07782 ↗

In this paper, our main goal is to introduce the class of Demi Weak Dunford-Pettis operators. We also investigate its relationship with the classes of weak Dunford-Pettis and demi Dunford-Pettis operators, as well as conditions under which this class coincide with the classes of demi Dunford-Pettis and demicompact operators. In the final section, we study some properties of this new class in the setting of Banach lattices.

fields
Functional Analysis
pdf ↗ page arXiv:2603.08922 ↗

We consider the singular elliptic problem of the form \[ -Δu + V(x)u = \mathcal{B}(x)|u|^{2^*-2}u + \frac{\mathcal{A}(x)}{|u|^{2^*}u}, \qquad u\in H^1(M), \] where the coefficients are allowed to have low regularity. Under natural spectral assumptions on $-Δ+V$, geometric assumptions on the manifold $M$ ensuring the Sobolev embedding $H^1(M)\hookrightarrow L^{2^*}(M)$, and a suitable global integrability/smallness condition involving $\mathcal{A}$, $\mathcal{B}$, and a function $ψ\in H^1(M)$, we prove the existence of a nonnegative finite-energy supersolution. If, in addition, the Ricci curvature is nonnegative and $\mathcal{B}\ge 0$, we obtain a positive finite-energy solution. The proof relies on a family of $\varepsilon$-regularized problems, mountain pass arguments, and a limiting procedure in which Harnack's inequality plays a crucial role in handling the singular term on noncompact manifolds. We also prove a nonexistence result showing that the global integrability condition on $\mathcal{A}$ is, in a precise sense, necessary for the existence of nonnegative supersolutions.

journal
NoDEA Nonlinear Differential Equations Appl. 33 (2026), Article No. 142
fields
Analysis of PDEs, Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2603.09889 ↗

We consider symmetry protected topological states of 2d quantum spin systems, with a finite symmetry group $G$. It has been conjectured that such states are classified by the cohomology group $H^3(G,U(1))$, but the completeness of this classfication is an open problem. We restrict ourselves to symmetry protected topological states that can be prepared from a product state by a symmetric entangler. For this class of states, we prove that the classification by $H^3(G,U(1))$ is complete.

comments
43 pages, 5 figures. Included new Section 5; fixed small typos and inconsistencies
fields
Mathematical Physics
pdf ↗ page arXiv:2603.09959 ↗

Integrating infinitesimal generators of local dynamics into finite-time evolution is generally harder than extracting a local Hamiltonian from a quantum gate. For integrable one-dimensional quantum many-body systems, a recent bootstrap constructs one-parameter $R$-operators directly from Hamiltonians satisfying the Reshetikhin condition. However, this condition excludes important models such as the Hubbard model, whose two-parameter $R$-operator was obtained by Shastry from a decorated Yang–Baxter equation obeyed by its free-fermion sector. Here, I extend the bootstrap to $R$-operators constrained by both the ordinary and decorated Yang–Baxter equations. Their joint expansion produces additional Hamiltonian-level necessary conditions and recursively determines candidate higher-order terms, subject to two-site locality at each order. I also derive compatibility and factorization conditions under which a Shastry-type superposition solves the $RLL$ relation after deformation by an onsite involution. The construction recovers the known two-parameter $R$-operators of the Hubbard and XYh models, whose full Yang–Baxter equations follow from established tetrahedral Zamolodchikov algebra relations. For a superconducting Hubbard deformation, the scalar equations are generically incompatible, placing it outside this framework. These results provide diagnostics and a systematic route to fermionic $R$-operators beyond the Reshetikhin condition. General sufficiency, convergence of the formal bootstrap, and sufficiency of the deformation conditions remain open.

comments
22 pages, 3 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2603.11172 ↗

A formula for the minimum weight of Schubert codes was conjectured by Ghorpade and Lachaud in 2000. This was established by Xiang in 2008. In 2018, Ghorpade and Singh provided a new proof of this conjecture. Moreover, they also conjectured that the minimum weight codewords of the Schubert codes $C_\a (\ell, m)$ are given by the so-called \emph{Schubert decomposable codewords}. We prove the validity of the conjecture for all Schubert varieties $Ω_{\a}(\ell, V_m)$ for all but finitely many values of $q$.

fields
Combinatorics
pdf ↗ page arXiv:2603.14247 ↗

Sobolev-type embeddings on metric measure spaces encode a subtle interaction between the analytic regularity of functions and the geometry of the underlying domain space. In this paper we develop an embedding theory for variable Hajłasz-type smoothness spaces on metric measure spaces whose ``dimension'' is allowed to vary pointwise through a bounded exponent $Q(\cdot)$ that governs a lower Ahlfors growth condition on the measure. We introduce variable exponent Hajłasz-Sobolev spaces $M^{s(\cdot),p(\cdot)}$, Hajłasz-Triebel-Lizorkin spaces $M^{s(\cdot)}_{p(\cdot),q(\cdot)}$, and Hajłasz-Besov spaces $N^{s(\cdot)}_{p(\cdot),q(\cdot)}$, and establish Sobolev, Morrey, and Moser-Trudinger type embeddings into variable exponent Lebesgue and Hölder spaces. These embeddings are proved both locally (on balls) under a lower Ahlfors $Q(\cdot)$-regularity condition on the measure and regularity assumptions on the exponents (notably log-Hölder continuity), and globally under additional geometric hypotheses such as geometric doubling and mild uniform bounds on the measure of unit balls. We also identify geometric conditions that are not only sufficient but, in appropriate forms, necessary for the validity of these embeddings, showing in particular that such inequalities force a lower growth bound on the measure of order $r^{Q(x)}$.

fields
Functional Analysis
pdf ↗ page arXiv:2603.19111 ↗

In this paper, we introduce the notion of a $w$-Hilbert domain and investigate its basic properties. More precisely, we explore its relationship with Hilbert domains, strong Mori domains, and UMT domains by providing various examples using $D+M$ constructions. Furthermore, we characterize the polynomial rings and some of their extensions that are $w$-Hilbert domains.

comments
11 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2603.19692 ↗

Stochastic control barrier functions (SCBFs) provide a safety-critical control framework for systems subject to stochastic disturbances by bounding the probability of remaining within a safe set. However, finding a valid SCBF that explicitly reflects the long-horizon behavior of the true safety probability remains a challenge. This paper addresses this issue by adopting a spectral perspective, utilizing the linear operator that governs the evolution of the closed-loop system's safety probability. We find that the dominant eigenpair of this Koopman-like operator encodes fundamental safety information of the stochastic system. The dominant eigenfunction is a natural and valid SCBF, with values that characterize relative asymptotic safety across initial states, while the dominant eigenvalue indicates the global asymptotic rate at which the safety probability decays. A practical algorithm for computation is proposed, termed power-policy iteration, which jointly estimates the dominant eigenpair while updating the backup policy with the aim of improving long-term safety. The method is validated using simulation experiments on safety-critical dynamics models.

comments
16 pages, 8 figures. This work has been submitted to the IEEE for possible publication
fields
Optimization and Control
pdf ↗ page arXiv:2603.19813 ↗

By exploiting the observed tightness of dual rotated second-order cone (RSOC) constraints, this paper transforms the dual of a conic ACOPF relaxation into an equivalent, non-conic problem where dual constraints are implicitly enforced through eliminated dual RSOC variables. To accomplish this, we apply the RSOC-based Jabr relaxation of ACOPF, pose its dual, and then show that all dual RSOC constraints must be tight (i.e., active) at optimality. We then construct a reduced dual maximization problem with only non-negativity constraints, avoiding the explicit RSOC inequality constraints. Numerical experiments confirm that the tight formulation recovers the same dual objective values as a mature conic solver (e.g., MOSEK via PowerModels) on various PGLib benchmark test systems (ranging from 3- to 1354-buses). The proposed formulation has useful performance benefits, compared with its conic counterpart, and it allows us to define a bounding function which provides a guaranteed lower bound on system cost. While this paper focuses on demonstrating the correctness and validity of the proposed structural simplification, it lays the groundwork for future GPU-accelerated first-order optimization methods which can exploit the unconstrained nature of the proposed formulation.

fields
Optimization and Control
pdf ↗ page arXiv:2603.20411 ↗

Progress on the conjecture of Banica and Bichon that the classical permutation group is a maximal quantum subgroup of the quantum permutation group remains limited to a handful of small-parameter results. By Tannaka–Krein duality, any counterexample to this Maximality Conjecture must arise from a category strictly intermediate between the category $\mathcal{NC}$ of non-crossing partitions and the category $\mathcal{P}$ of all partitions. Any such exotic category must therefore contain a linear combination of crossing-partition vectors. The categories generated by $\mathcal{NC}$ together with some such vectors are studied, with a number of generation results. It is shown that no exotic category can contain a linear combination of three crossing-partition vectors, and, using an argument of ChatGPT to account for a five-dimensional gap, there is no exotic category distinguished from $\mathcal{NC}$ or $\mathcal{P}$ at moments of order six.

comments
v2: Substantially revised and expanded. Maximality at moment level six established for all $N$ with assistance from ChatGPT. Includes a new computational appendix and publicly available Maple code
fields
Quantum Algebra, Operator Algebras
pdf ↗ page arXiv:2603.21759 ↗

In this paper, we study semiparametric inference for linear multivariate Hawkes processes, a class of point processes widely used to describe self and mutually exciting phenomena. We establish a convolution theorem giving the best limiting distribution for a regular estimator of smooth functional. Then, in the Bayesian setting, we prove a semiparametric Bernstein-von Mises (BvM) theorem for nonparametric random series priors. We apply this result to histogram and wavelet based priors. Taken together, the convolution and BvM theorems show that, from a frequentist point of view, semiparametric Bayesian procedures have asymptotically the optimal behavior. Deriving the BvM property for random series priors led us to prove L2 posterior contraction, complementing for these priors the results of Donnet, Rivoirard and Rousseau (2020).

comments
Minor revision
fields
Statistics Theory
pdf ↗ page arXiv:2603.23655 ↗

Enforcing prescribed global integral constraints in mesh-free neural PDE solvers is challenging in high-dimensional domains. Existing projection methods for spatial integrals are often tied to fixed grids or uniform quadrature, which can conflict with randomly sampled physics-informed neural networks (PINNs) and scale poorly with dimension. High-order differential operators also increase reverse-mode automatic differentiation memory costs. We propose Stochastic Dimension Implicit Functional Projection (SDIFP), a quadrature-level framework for enforcing prescribed first and second spatial moments. SDIFP replaces tensor-product nodal projection by a global affine correction of the neural-network output, with two scalar coefficients determined from a weighted quadrature rule. Under positive target variance and nonzero empirical raw variance, this correction is the nearest-point projection, in the weighted quadrature norm, onto the empirical two-moment constraint set. Thus, the prescribed moments are exact for the selected quadrature rule, while continuum errors are quadrature errors of the corrected field. For decomposable high-dimensional linear operators, SDIFP combines affine moment correction with stochastic operator-subset sampling. With independent residual and derivative sampling and conditionally unbiased coefficient-gradient estimation, the resulting estimator is unbiased for the specified quadrature-based residual objective; the shared-subset fast mode is biased in general. SDIFP avoids tensor-product quadrature for moment enforcement, separates forward quadrature evaluation from the reverse-mode graph, and retains pointwise inference efficiency once the affine coefficients are fixed or precomputed.

fields
Numerical Analysis
pdf ↗ page arXiv:2603.29237 ↗

We propose a least-squares penalization as a means to extend the discontinuous Petrov-Galerkin (DPG) method with optimal test functions to a class of semilinear elliptic problems. The nonlinear contributions are replaced with independent unknowns so that standard DPG techniques apply to the resulting linear problem with non-trivial kernel. The nonlinear relations are added as least-squares constraints. Assuming solvability of the semilinear problem and an Aubin–Nitsche-type approximation property for the primal variable, we prove a Céa estimate for the approximation error in canonical norms. We also give conditions ensuring unique solvability and, under additional regularity and stability assumptions, derive the required nonlinear Aubin-Nitsche estimate. Numerical results with uniform and adaptively refined meshes illustrate the performance of the scheme, also in comparison with the Gauss-Newton approach.

comments
Updated and extended numerical results, addition of a proof of the Aubin-Nitsche assumption
fields
Numerical Analysis
pdf ↗ page arXiv:2603.29863 ↗

We study a finite horizon optimal control problem for the continuity equation under a weighted integral state constraint on the mass outside a fixed set. The model is cast in a Hilbert framework for densities. On a suitable invariant compact subset, we prove that the value function is Lipschitz continuous and satisfies, by dynamic programming, the associated infinite dimensional constrained Hamilton Jacobi Bellman equation in viscosity sense (subsolution in the interior, supersolution up to the boundary). We finally prove a comparison principle and uniqueness in the Lipschitz class.

comments
28 pages, 0 figures
fields
Optimization and Control
pdf ↗ page arXiv:2604.01768 ↗

We show that over the weak base theory $\mathrm{RCA}_0^*$, cohesive Ramsey's theorem for pairs $\mathrm{CRT}^2_2$ implies exponential closure of the definable cut $\mathrm{I}^0_1$, which is the intersection of all $Σ^0_1$-definable cuts. Consequences include non-elementary proof speedup of $\mathrm{RCA}_0^* + \mathrm{CRT}^2_2$ over $\mathrm{RCA}_0^*$ for $Π_1$ sentences and the unprovability of $\mathrm{CRT}^2_2$ in $\mathrm{RCA}_0^* + \mathrm{CAC}$. On the other hand, we show that $\mathrm{RCA}_0^* + \mathrm{SRT}^2_2$, where $\mathrm{SRT}^2_2$ is stable Ramsey's theorem for pairs, is polynomially simulated by $\mathrm{RCA}_0^*$ with respect to proofs of $\forall Π^0_3$ sentences. Nevertheless, $\mathrm{SRT}^2_2$ also implies a nontrivial property of $\mathrm{I}^0_1$, specifically closure under functions of quasipolynomial growth rate.

comments
23 pages. Remark 3.5 corrected, new Remark 4.9 added
fields
Logic
pdf ↗ page arXiv:2604.01808 ↗

We establish a lower bound for the surface area of a closed, convex hypersurface in Euclidean space in terms of its displacement under continuous maps. As a result, a hypothesized lower bound for the volume of a Riemannian $n$-sphere, proved by Berger in dimension $n=2$ and disproved by Croke in dimensions $n \geq 3$, is valid for convex hypersurfaces in all dimensions. We also establish a sharp lower bound for the mean width of a convex hypersurface.

comments
24 pages; 3 figures; added one figure, multiple references, and other background material; made other minor edits
fields
Differential Geometry, Metric Geometry
pdf ↗ page arXiv:2604.02667 ↗

We propose a family of high-order local discontinuous Galerkin (LDG) methods, built on a parametric representation and coupled with a semi-implicit backward Euler time discretization, for isotropic and anisotropic curve-shortening flows. The spatial LDG formulation introduces auxiliary variables and carefully designed numerical fluxes which inherit the underlying variational structure. We prove unconditional energy dissipation for the semidiscrete scheme and establish energy dissipation and well-posedness for the fully discrete scheme under certain assumptions. For $P^k$ approximations, the LDG method achieves high-order spatial convergence; extensive numerical experiments confirm optimal $(k+1)$-order accuracy when the surface energy is isotropic or weakly anisotropic. Compared to classical parametric finite element methods (PFEM), the proposed LDG schemes do not need to rely on good mesh distributions or auxiliary symmetrized surface energy matrices for strongly anisotropic surface energy cases, and remain numerically stable on severely degraded meshes that typically cause PFEMs failure. This intrinsic stability enables effective capture of complex geometric evolution and sharp corner singularities produced by strong anisotropy. The approach thus provides a flexible and reliable framework for the numerical simulation of a broader class of geometric flows.

comments
29 Pages, 14 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2604.03106 ↗

We study exit times from time-dependent domains under joint perturbations of the trajectory and the domain. Representing a moving domain as the negativity set of a continuous barrier on space-time, we reduce the exit problem to a one-dimensional first-passage problem for the scalarized path, namely the barrier evaluated along the trajectory. Our first main result is a deterministic continuity theorem: the exit-time functional is continuous, under Skorokhod J1 convergence of the path and locally uniform convergence of the barrier, at every configuration satisfying an explicit nontangency condition (NT). This condition is sharp: it characterizes the continuity set of the functional. As a consequence, exit times converge in distribution whenever paths and barriers converge jointly in distribution and the limiting pair satisfies (NT) almost surely; no independence or other structural restriction between trajectory and domain is required. Our second main result is a functional limit theorem: the profile of exit times indexed by the barrier level, regularized to be right-continuous on a compact level interval, converges in distribution in the Skorokhod M1 topology under the same joint convergence, provided the limiting pair satisfies (NT) almost surely at the two end levels; an example shows that J1 convergence can fail. Verification routes for (NT) are provided, including a non-characteristic criterion for Ito diffusions. The framework is illustrated by two Donsker-type examples; in the second one, the domain is random, is approximated jointly with the trajectory, and is coupled to the state.

comments
This new version (version 2) supersedes version 1, which was titled "Exit times from time-dependent random domains: continuity, weak convergence, and exit-time profiles Draft - currently under review at Stochastic Processes and their Applications". It corrects errors in version 1 and extends and strengthens its results. The manuscript is currently under review at SPA (round 2)
fields
Probability
pdf ↗ page arXiv:2604.03129 ↗

We study the persistent homology of the offset filtration generated by the range of a planar Brownian motion with constant nonzero drift (Wiener sausages of increasing radius). We prove what are, to our knowledge, the first law of large numbers and central limit theorem for its smoothed Betti-curve functionals. For every bounded Borel weight $ψ$ supported in a compact radius window $[r_0,r_1]\subset(0,\infty)$, the functional $Φ_ψ(T)=\int_{r_0}^{r_1}β_1(T,r)ψ(r)\,dr$, where $β_1(T,r)$ counts the holes of the radius-$r$ sausage at time $T$, satisfies $Φ_ψ(T)/T\toρ_ψ$ almost surely and in every $L^p$, for a deterministic constant $ρ_ψ$. This yields a finite positive Betti-curve intensity measure on the radius axis, which we identify as absolutely continuous through a fixed-radius law of large numbers along regeneration times, valid at almost every radius. We also prove Gaussian fluctuations at scale $\sqrt{T}$, for one weight and jointly for finitely many, with a Green-Kubo variance over the regeneration cycles. The proof combines a renewal structure along the drift direction, obtained by the method of Sznitman and Zerner without invoking the strong Markov property at the cut times, with a Mayer-Vietoris control of the non-additivity of topology under concatenation and a deterministic bound on the integrated hole count of a planar offset proved in a companion paper. A sampling theorem bounds the bottleneck distance between the diagram of the continuous filtration and that of a time-sampled point cloud by the pathwise modulus of continuity, placing these objects in a data-analytic framework.

comments
This new version (version 2) corrects errors in the first version (the title of which was: "Persistence of the Wiener Sausage: Sampling Stability and a Law of Large Numbers for Drifted Planar Brownian Motion DRAFT -CURRENTLY UNDER REVIEW")
fields
Probability
pdf ↗ page arXiv:2604.03130 ↗

We give a proof of the Morrison-Kawamata cone conjecture for Enriques surfaces independent of their characteristic. It is based on the analysis of certain generically finite morphisms of degree two.

comments
To appear in the Proceedings of the American Mathematical Society
fields
Algebraic Geometry
pdf ↗ page arXiv:2604.05827 ↗

Regime transitions in vertical gas-liquid flow are read from mechanistic models or assigned by eye, and for churn flow neither route has produced a settled criterion. We ask how much an unsupervised topological description of flow video can establish about them. The description is the Euler characteristic surface, a count of the connected gas and liquid regions in each frame across morphological scales. Kernels derived from it are combined by unsupervised multiple kernel learning, and the trials are divided into contiguous groups along gas velocity. For 37 air-water trials in 2-in. tubing at one liquid rate, with three viewing stations averaged, four groups are separated at 4.33, 7.51 and 11.70 m/s. Each division falls at or within one trial of a change in the visual evaluation of the same videos; cuts placed at random would match as closely in 12% of cases. The divisions move between viewing stations and under resampling, a kernel built on gas velocity divides any sampled range into roughly equal parts and cannot locate a transition, and the data do not support a revised transition criterion. On independent images from an annulus, churn shows about three times the across-scale variance of slug. Within the band the published criteria assign to churn, the two upper cuts fall at graded changes in the rankings, consistent with a progression within churn; if confirmed by further data, they would subdivide the churn region.

fields
Algebraic Topology
pdf ↗ page arXiv:2604.06167 ↗

We introduce a variational formulation of the homogeneous Boltzmann equation, with hard-sphere cross section, which selects the unique energy conserving solution. We prove that this solution arises from the microscopic dynamics, namely Kac's walk, and we establish the propagation in time of entropic chaoticity, under the minimal assumption that the initial distribution is entropically chaotic.

fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2604.06919 ↗

Let $S$ be a smooth complex minimal surface of general type with $p_g:=h^0(K_S)\ge 4$ whose canonical map is generically finite of odd degree $d>1$ onto a surface $Σ$. We assume that the general canonical curve of $S$ is smooth and that $Σ$ is ruled by lines, and we prove: - $p_g\le d+2$ - $Σ$ is a cone over the rational normal curve of degree $p_g-2$ in ${\mathbb P}^{p_g-1}$ - $p_g=d+2$ can occur only for $d=3,9,11$. As a byproduct, we refine previous results by Beauville and Xiao by proving that if one drops the assumption that $Σ$ is ruled by lines then $d\le 5$ if $p_g\ge 112$. The case $d=3$ being completely classified by the first two named authors, we focus on $d=5$, showing that $p_g\le 5$ and that for $p_g=5$ the surface $S$ has a pencil $|C|$ with $C^2=1$ and $K_SC=5$. These results suggest that the answer to the question whether the surfaces with canonical map of odd degree $d>1$ have bounded invariants could be positive, in sharp contrast with the case of even degree.

comments
28 pages, comments are welcome. v2: final version to appear on Trans. Amer. Math. Soc
fields
Algebraic Geometry
pdf ↗ page arXiv:2604.09216 ↗

We study the universal closest refinement problem on measurable bipartite relations over standard Borel spaces. Given prescribed side measures, the feasible class consists of finite refinement plans concentrated on the relation and carrying one fixed marginal. The main question is whether this highly nonunique class nevertheless contains a mathematically distinguished class of refinements. We show that the correct one-sided extremal criterion is level-optimal maximin, a levelwise maximin principle formulated through truncation and overflow profiles. We then prove that this structure is exactly the one selected by convex refinement: every minimizer of a strictly convex refinement criterion is level-optimal maximin, while every level-optimal maximin refinement minimizes the full class of relevant proper lower semicontinuous convex divergence functionals. Proportional response then identifies the opposite-side partner and yields a universally closest refinement pair. Our main theorem shows that every such pair is universally closest among all feasible pairs for every divergence satisfying the data-processing inequality under measurable post-processing, and conversely that every universally closest pair has this structure. We also prove a converse paired characterization for strictly convex closest pairs. Finally, we give an equilibrium-theoretic characterization of level-optimal maximin pairs through a naturally associated continuum economy with measure-valued commodities. The measure-theoretic theory requires new tools beyond the finite case, including disintegration, measurable selection, measurable max-flow/min-cut duality, augmentation arguments, and a symmetric density decomposition separating absolutely continuous and singular components.

fields
Functional Analysis
pdf ↗ page arXiv:2604.10274 ↗

Let $\{θ_n,λ_n:n\geq0\}$ be mutually independent random variables, each uniformly distributed on $[0,1]$, and write $Θ=(θ_n)_{n\geq0}$ and $Λ=(λ_n)_{n\geq0}$. The random vector-valued Weierstrass function is given by $$f_{Θ,Λ}(x)= \left( \sum_{n=0}^{\infty} a^n\cos\bigl(2π(b^n x+θ_n)\bigr),\ \sum_{n=0}^{\infty} a^n\sin\bigl(2π(b^n x+λ_n)\bigr) \right), \; x\in[0,1],$$ where $0<a<1<b,\ ab> 1$. The Hausdorff dimension of the graph of this function is proved to be $$\dim_H G(f_{Θ,Λ}) = \min\left\{-\frac{\log b}{\log a}, \, 3 +2\frac{\log a}{\log b}\right\} \quad \text{a.s}.$$

comments
15 pages, 1 figure
fields
Classical Analysis and ODEs, Probability
pdf ↗ page arXiv:2604.13913 ↗

In this paper, we investigate the local boundedness of weak solutions to parabolic double phase equations of type $$u_t-\mathrm{div}(|Du|^{p-2}Du+a(x,t)|Du|^{q-2}Du)=0\quad\text{in }Ω_T:=Ω\times(0,T),$$ where $0\leq a(\cdot)\in L^\infty(Ω_T)$ and $\frac{2n}{n+2}<p<q<p\left(\frac{n+2}{n}\right)$, so that both the degenerate range $p\geq 2$ and the singular range $p<2$ are covered. To this end, we derive the Caccioppoli inequality and recall a parabolic embedding theorem, which are then utilized in an iteration method.

fields
Analysis of PDEs
pdf ↗ page arXiv:2604.14544 ↗

We present new representations of Gauss–Legendre polynomials and their derivatives in the shifted power basis and in bases related to symmetric orthogonal Jacobi polynomials. Using these representations and certain recurrence relations, we propose $O(n^2+dn)$ methods for evaluating a Gauss–Legendre curve of degree $n$ in $\mathbb E^d$. We also propose algorithms for multipoint evaluation with computational complexity $O(Mdn+dn^2)$, where $M$ is the number of evaluation points. Numerical tests show that the approach using the shifted power basis is very fast, but it works well only for small $n$ (approximately up to 20), whereas the method employing Jacobi polynomials gives good numerical results even for large $n$ (around 100).

fields
Numerical Analysis
pdf ↗ page arXiv:2604.17331 ↗

Shared rides, which match compatible riders in one vehicle, have the potential to increase vehicle utilization and reduce congestion and emissions. However, this service has seen limited success outside dense urban areas due to insufficient matching opportunities. The dominant model in the literature, which we refer to as the pre-trip model, matches riders before dispatch using non-bipartite matching, and dispatches unmatched riders solo. In practice, augmenting this pre-trip matching mechanism with an on-trip matching phase, where riders initially dispatched solo can still match with later arrivals, can expand matching opportunities. Yet the addition of the on-trip phase complicates the dynamic matching problem, as riders' matching opportunities evolve as they travel: both the set of compatible riders and the value of matches can diminish as a rider progresses towards her destination. To address this challenge, we formulate a Markov decision process that tracks riders' evolving states and weighs immediate matches against future matching opportunities. Within this framework, we incorporate pricing decisions to maximize long-run average profit, where we develop a fluid relaxation for static pricing and use value function approximation for dynamic (state-dependent) pricing. Experiments using Chicago ridesharing data show that pre-trip matching performs well with concentrated demand, whereas on-trip matching is particularly beneficial in the sparse outskirts where operating shared rides is especially challenging. Across both static and dynamic pricing settings, adding on-trip matching increases platform profit and match rates while lowering average quoted prices, showing the value of capturing matching opportunities along the route when demand is too dispersed for effective pre-trip matching.

fields
Optimization and Control
pdf ↗ page arXiv:2604.17552 ↗

We compare three secrecy-coding schemes for the degraded wiretap binary symmetric channel (BSC) in the finite-blocklength regime: (i) polar wiretap coset codes, (ii) PAC codes used as wiretap coset codes, and (iii) the invertible-extractor (IE) framework of Bellare–Tessaro. Our comparison is empirical and uses a common semantic-secrecy metric (distinguishing advantage). For polar coset codes, we compute Eve's polarized bit-channel capacities (via the Tal–Vardy construction) to obtain explicit finite-length upper bounds on mutual-information leakage, yielding strong secrecy bounds. For PAC coset codes, we prove that Eve's synthesized bit-channels are equivalent to those of polar codes (up to a permutation), so the same leakage bounds apply; we then convert these strong-secrecy bounds into semantic-secrecy guarantees for symmetric wiretap channels. For the IE scheme, we use the closed-form semantic-secrecy bounds already established. Finally, we report finite-length results that jointly characterize (a) semantic-secrecy guarantees against Eve and (b) frame-error-rate performance at Bob. Our simulations indicate that Polar and PAC codes exhibit comparable reliability performance under the considered finite-length settings, while PAC codes retain the same secrecy bounds as Polar codes. More broadly, our results highlight that non-universal designs of wiretap codes provide tighter secrecy guarantees than universal design based on invertible extractors.

fields
Information Theory
pdf ↗ page arXiv:2604.19909 ↗

We study the notion of debiasability for cost functions arising in optimal transport. We call a symmetric cost function $c:\mathscr{X}\times\mathscr{X}\to R\cup\{+\infty\}$ debiasable if it satisfies $c(x,y)\ge \tfrac{1}{2}c(x,x)+\tfrac{1}{2}c(y,y)$ for all $x,y\in\mathscr{X}$. Building on an equivalent characterization by an inf-representation $c(x,y)=\inf_{z\in\mathscr Z}ψ(x,z)+ψ(y,z)$ for some set $\mathscr Z$ and some function $ψ:\mathscr X\times\mathscr Z\to R\cup\{+\infty\}$, interpreted as a generalization of the midpoint identity for squared geodesic distances, we investigate the debiasability of costs defined on spaces of probability measures. Our primary focus is the entropic regularization of optimal transport across the different regimes of the regularization parameter $\varepsilon\in[0,+\infty]$, encompassing classical optimal transport ($\varepsilon=0$), entropic optimal transport ($\varepsilon>0$), and the Maximum Mean Discrepancy ($\varepsilon=+\infty$). For $\varepsilon\in(0,+\infty)$ we obtain debiasability under negative definiteness of the ground cost, through an explicit Gaussian factorization, and, more generally, under positive semidefiniteness of the kernel $e^{-c/\varepsilon}$ alone, conditions also proved necessary. All our results extend naturally to unbalanced optimal transport settings. Extending our factorizations to include a time parameter $t\in(0,1)$, we construct an entropic interpolation curve given by an intermediate measure $η_t\in\mathscr P(\mathscr Z)$ based on a barycentric formulation, which coincides with the marginals of the Schrödinger bridge between $μ$ and $ν$. As a byproduct, we derive a new proof for the entropic Benamou-Brenier formula under very mild assumptions.

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

Let $[C]$ be a point in the moduli space of curves $\mathcal{M}_g$, with $g>1$, lying outside a countable union of closed nowhere–dense subsets of an analytic parameter space for $\mathcal M_g$. Let $G \,\subset\, J(C)$ be a connected compact subgroup of real dimension $1$ of the Jacobian of $C$, and let $L$ be an even theta characteristic on $C$. We prove that $\{ζ\, \in\, G\ \big\vert\,\ H^0(C,\, L \otimes ζ)\,\not=\, 0 \}\, =\, \emptyset$ if and only if $L \otimes ζ_G$ is an even theta characteristic on $C$, where $ζ_G$ is the unique non-trivial point of $G$ of order two.

comments
Accepted for publication in Bulletin of the London Mathematical Society
fields
Algebraic Geometry
pdf ↗ page arXiv:2604.21661 ↗

Belief propagation has recently emerged as a powerful framework for evaluating tensor networks in higher dimensions, combining computational efficiency with provable analytical guarantees. In this work, we develop the first end-to-end theory of tensor network belief propagation for a class of projected entangled pair states satisfying \emph{strong injectivity}. We show that when the injectivity parameter exceeds a constant threshold, BP fixed points can be found efficiently, and a cluster-corrected BP algorithm computes physical quantities to $1/\mathrm{poly}(N)$ error in $\mathrm{poly}(N)$ time for an $N$ qubit system. We further identify a striking phenomenon we term \emph{algorithmic locality}: local perturbations of the tensor network affect the BP fixed point with an influence decaying rapidly with distance. Moreover, through the cluster expansion, this locality extends to observables, implying that local expectation values can be approximated from local data with controlled accuracy. We exhibit three regimes admitting strong injectivity: random Gaussian PEPS with large physical dimension, high-temperature Gibbs states of commuting two-body Hamiltonians, and fixed-depth quantum circuits subject to sufficiently strong depolarizing noise. Our bounds are worst-case sufficient conditions and do not identify sharp algorithmic transitions.

comments
8 pages main text + SM; comments welcome, v2 updated with physical examples
fields
Mathematical Physics
pdf ↗ page arXiv:2604.21919 ↗

We complete Maksimova's classification of Craig and deductive interpolation in normal extensions of S4. In particular, we prove Craig interpolation for the six extensions of S4 for which the status of the property was still open. The proof strategy builds upon the ideas of Smoryński, but employs a novel approach using Fine's frame formulas for splitting clusters in transitive models.

comments
15 pages, 2 figures, 1 table
fields
Logic
pdf ↗ page arXiv:2604.22020 ↗

We study the Lyapunov stability of stationary viscosity solutions of contact-type Hamilton–Jacobi equations on a compact manifold. We consider Hamiltonians of the form $H(x,p,u)=G(x,p)+W(x,u)$, where $G$ is continuous, convex and coercive in $p$. We establish sufficient conditions for asymptotic stability and instability in terms of viscosity subsolutions and one-sided derivatives of a perturbed critical value. These criteria do not require the construction of a smooth contact Hamiltonian flow. Under the stability condition, solutions starting sufficiently close to a stationary solution converge to it at an exponential rate. To prove instability, we use the superposition principle for closed measures to construct calibrated curves. We also establish conditions ensuring uniqueness of stationary solutions and global asymptotic stability. Our results also cover examples with nonmonotone dependence on the unknown function, including an equation with an eikonal term $|p|$. Finally, we obtain an $O(\sqrt{\varepsilon})$ convergence rate for a class of stationary Hamilton–Jacobi equations with nonlinear dependence on the unknown function and multiscale spatial dependence.

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

We develop a $\mathbf{P}^1$-unstable non-$\mathbf{A}^1$-invariant theory of motivic spaces and spectra, and construct the Gysin map therein for regular immersions. This in particular gives the Gysin map in the Annala–Hoyois–Iwasa $\mathbf{P}^1$-motivic spectra, and thus gives a uniform construction for the Gysin maps of various cohomology theories.

comments
46 pages; corrected many typos; rewrote section 2 with more convenient definitions; added section 4 for applications
fields
Algebraic Geometry, Algebraic Topology, K-Theory and Homology
pdf ↗ page arXiv:2604.24888 ↗

In this paper, we develop a groupoid approach to the equivariant coarse Baum–Connes conjecture. For a bounded geometry metric space $X$ equipped with a proper, free, and isometric action of a countable discrete group $Γ$, we introduce the equivariant coarse groupoid $G(X, Γ)$. We prove that the groupoid Baum–Connes conjecture for $G(X, Γ)$ with coefficients in $\ell^{\infty}(X,\K)^\Ga$ is equivalent to the equivariant coarse Baum–Connes conjecture for $(X, Γ)$ using a localization algebra description of groupoid equivariant $KK$-theory on the Rips complex models. As applications of this framework, we prove that if the space $X$ admits a coarse embedding into Hilbert space (which is not required to be $Γ$-equivariant), then the equivariant coarse Novikov conjecture holds for $(X, Γ)$, i.e., the assembly map $μ_{X,\Ga}$ is an injection. We also obtain a new proof of the equivariant coarse Baum–Connes conjecture if $X$ admits an equivariant coarse embedding into Hilbert space.

comments
40 pages
fields
K-Theory and Homology, Metric Geometry, Operator Algebras
pdf ↗ page arXiv:2604.25595 ↗

We propose a new entropy-compatible neural network method for scalar hyperbolic conservation laws and establish, to our knowledge, the first explicit $L^1$ convergence rates in this setting for piecewise smooth entropy solutions, including those with discontinuities. The method is based on a computable approximation of the Kružkov entropy residual that sits between the strong and weak forms of the entropy inequality. For a single regular shock in one dimension and finitely many smooth shock hypersurfaces with transversal interactions in several dimensions, we construct explicit neural networks with provably small loss by combining shock-adapted continuous piecewise linear functions with known approximation properties of $\tanh$ neural networks. The one-dimensional analysis also covers rarefactions, compound waves, regular shock interactions, and nondegenerate shock formation from smooth initial data. Together with entropy-based stability estimates, this gives rigorous $L^1$ error bounds for minimizers of the proposed loss. In particular, when the network size grows in proportion to the number of degrees of freedom of a space–time mesh of size $h$, the analysis recovers the classical Kuznetsov rate $O(h^{1/2})$ in shock-dominated cases. Numerical experiments in one and two space dimensions illustrate the performance of the method.

comments
51 pages; revised presentation and proofs, with clarified assumptions and implementation details
fields
Numerical Analysis
pdf ↗ page arXiv:2604.27458 ↗

A number field $K$ is called \emph{monogenic} if its ring of integers $\mathbb{Z}_K$ can be expressed as a simple ring extension $\mathbb{Z}[α]$ for some $α\in \mathbb{Z}_K$. A monic irreducible polynomial $f(x)\in\mathbb{Z}[x]$ is said to be monogenic if one of its roots generates both the number field and its ring of integers. In this article, we establish the necessary and sufficient conditions for $[\mathbb{Z}_{K_i}:\mathbb{Z}[α_i]]=1$, where $K_i=\mathbb{Q}(α_i)$ and $α_i$ is a root of the composed polynomial $f_i(x^k+b)$ for $i=1,2$. Here, $f_1(x)=x^n+c\sum_{j=1}^{n}(ax)^{n-j}\in\mathbb{Z}[x]$ and $f_2(x)=x^n+c\sum_{j=1}^{n}a^{j-1}x^{n-j}\in\mathbb{Z}[x]$ are irreducible polynomials of degree $n\ge 3$. In addition, we derive asymptotic estimates for the number of monogenic polynomials in these families under natural assumptions. As an application of our main results, we construct a class of polynomials with non-square-free discriminants. We also analyze the behavior of solutions to certain related differential equations.

comments
Minor revision clarifying the valuation-theoretic formulation of the results
fields
Number Theory
pdf ↗ page arXiv:2605.00949 ↗

Gromov–Wasserstein optimal transport (GWOT) aligns metric measure spaces by matching their within-domain relational structures, but large-scale GWOT remains challenging because its objective is nonconvex and projection onto the transport polytope is often solved only approximately in practice. This leads to a gap between practical projected-gradient implementations and convergence theory, which typically assumes exact projections. For squared-loss GWOT, we propose an inexact projected-gradient framework with a verifiable feasibility-residual-based inexact condition for the projection subproblem. This condition is directly computable and avoids unknown quantities such as the exact projection point. Under this implementable condition, we prove subsequential convergence to stationary points and, with a mild tolerance-decay condition, convergence of the whole sequence. The resulting method retains the simplicity and sparsity of projected-gradient schemes while providing rigorous convergence guarantees, turning projected-gradient methods into a principled and scalable approach for GWOT with provable reliability.

comments
21 Pages, 6 figures
fields
Optimization and Control
pdf ↗ page arXiv:2605.04175 ↗

This study investigates real-time assignment decisions for extraboard transit operators, who are responsible for covering open work due to unexpected events such as driver absenteeism. Efficient usage of extraboard operators is critical as open work negatively affects service reliability. The problem is formulated as a Markov decision process, designed to capture its stochastic and sequential nature. Due to the problem's very large state space, an approximate policy is proposed in the form of an integer program, which maps a system state to assignment decisions such that the sum of immediate and expected future rewards is maximized. As part of off-line training, future value functions for individual operators are computed using a backward dynamic program. Then, the overestimation in the aggregate value obtained by summing individual values is corrected to account for the interaction among operators. Case studies are conducted based on the operations at a real-world transit agency. Key performance metrics including uncovered open work and extraboard utilization rates are examined for varying absenteeism rates and extraboard roster sizes. The approximate policy is shown to outperform benchmark decision rules mirroring real-world assignment strategies. Further numerical experiments are conducted to analyze different operational policies: (1) inclusion of overtime drivers in the reserve operator roster; (2) reward weights for work tasks that consider passenger wait time saved. Observations from these computational analyses provide actionable insights into extraboard sizing, overtime usage, and real-time dispatch practices at transit agencies.

fields
Optimization and Control
pdf ↗ page arXiv:2605.04511 ↗

The $n$-species particle-exchange process (PEP($n$)) is an exclusion process in which particles of $n$ different species exchange positions on neighbouring sites with rates chosen such that the invariant measure on the discrete torus is a product measure. We address the large-scale hydrodynamic behaviour of this process which yields a system of $n$ coupled inviscid Burgers equations. This system of conservation laws is shown to admit Riemann invariants for arbitrary $n$ from which explicit solutions of the Riemann problem in terms of shock waves and rarefaction fans are obtained. We also introduce the open PEP($n$), in which particles are exchanged with boundary reservoirs. For a distinguished manifold of boundary rates, we prove that the invariant measure is the same product measure as in the periodic system. The hydrodynamic description in terms of Riemann invariants is used to derive the stationary phase diagram explicitly in terms of microscopic boundary rates. In the generic case, the steady state exhibits $2n+1$ phases, with boundary-induced phase transitions analogous to those of the single-species asymmetric simple exclusion process.

fields
Mathematical Physics
pdf ↗ page arXiv:2605.07615 ↗

The analysis of a total least squares problem can be reduced to that of an associated core problem, which typically has lower dimension and improved solubility properties. Nevertheless, even a core problem may remain reducible, admitting further decomposition into irreducible component sub- problems with simpler structure and better analytical properties. We seek the finest decomposition under unitary transformations over C; for real data this decomposition can be strictly finer than the finest one under real orthogonal transformations. We split the data matrix into row blocks associated with the singular subspaces of the system matrix and consider the graph whose ver- tices are the blocks and whose edges correspond to nonzero cross-products. After preliminary splittings that make every nonzero cross-product a scalar multiple of a unitary matrix, we show that the components can be obtained directly from these blocks if and only if the covariance matrices along all cycles of the graph are scalar matrices. Otherwise, there is a chordless cycle whose covariance matrix is not a scalar matrix, and splitting the blocks on this cy- cle along the eigenspaces of the covariance matrix removes the obstruction without changing the decomposition. Based on these results, we propose a recursive strategy that finds all irreducible components over the complex field. The strategy is exact and theoretical rather than an efficient numerical algo- rithm; a small floating-point computation illustrates it. The results depend only on the core problem and therefore apply to general linear approximation problems AX B.

fields
Rings and Algebras, Numerical Analysis
pdf ↗ page arXiv:2605.08091 ↗

We consider the classical Maki–Thompson rumour model with $n$ initially ignorant individuals and one initial spreader. The final number of ignorants, divided by $n$, is known to satisfy the law of large numbers, the central limit theorem and the large deviation principle. We establish a moderate deviation principle for fluctuations of this proportion of order $b_n/\sqrt n$, where $b_n\to\infty$ and $b_n^2=o(\log n)$. The proof rests on the exact final-size distribution, sharp asymptotics for the associated automata numbers, and a uniform point probability expansion at the moderate deviation scale. Numerical comparisons of both tails illustrate the intermediate scale and the effect of early extinction on upper tail probabilities.

comments
18 pages
fields
Probability
pdf ↗ page arXiv:2605.08629 ↗

Thompson's groups, which are denoted by $F, T$ and $V$, were introduced by R. Thompson. It is known that they are related to various fields in mathematics. In this paper, we discuss Thompson's groups $F, T$ and $V$ in Teichmüller modular groups of Teichmüller spaces of generalized Cantor sets with certain conditions by using a quasiconformal geometric method. Moreover, we show that groups corresponding to $F$ and $T$ act properly discontinuously on such Teichmüller spaces. We also show the same results for the asymptotic Teichmüller space. E. de Faria, F. P. Gardiner and W. J. Harvey show similar results on Thompson's group $F$ and asymptotic Teichmüller spaces. So, our results are improvement of them. We also discuss the actions of Thompson's groups on other spaces which we call \lq\lq pre-Tiechmüller spaces" of generalized Cantor sets. Especially, we show that the action of a group which is isomorphic to Thompson's group $V$ on the pre-Teichüller space is not properly discontinuous while groups isomorphic to $F$ and $T$ act properly discontinuously. Finally, we construct infinitely many distinct Teichmüller spaces of generalized Cantor sets where our results can apply.

fields
Complex Variables
pdf ↗ page arXiv:2605.10143 ↗

We study quasiisometric embeddings between finite-dimensional CAT(0) cube complexes. More specifically, we introduce geometric branching conditions under which flats in the domain, not necessarily of top rank, are mapped within finite Hausdorff distance of flats. As a consequence, one obtains embeddings between natural graphs associated with the Tits boundaries of those cube complexes. These results form a key step in understanding quasiisometric embeddings between right-angled Artin groups. In an appendix, we also explain how the same methods recover previously established rigidity results for quasiisometric embeddings of symmetric spaces and Euclidean buildings of the same spherical type.

comments
71 pages. v2: Minor changes
fields
Group Theory, Metric Geometry
pdf ↗ page arXiv:2605.10248 ↗

Bifunctional enzymes, which catalyze both the forward and reverse steps of a substrate modification reaction, arise naturally in bacterial two-component signaling systems and metabolic regulation. Beyond their well-known role in conferring absolute concentration robustness (ACR) on substrate species, bifunctional enzymes profoundly shape the dynamical landscape of the networks in which they appear. We study a class of dual-site futile cycles in which the reverse modification steps are carried out by bifunctional enzyme-substrate compounds, and provide a complete mathematical analysis of all four such networks, characterizing the existence, number, and stability of steady states, as well as the bifurcation structure as total substrate is varied. All four networks admit boundary steady states, in contrast to the non-bifunctional case. The networks differ in the number and stability of boundary steady states, in the maximum number of positive steady states (ranging from two to four), and in whether bistability is present. In two networks, a transcritical bifurcation connects the boundary and positive steady state branches; in one case this is a backward bifurcation, producing hysteresis. Perhaps the most striking phenomenon occurs in one of the four networks, which simultaneously exhibits bistability and ACR in the final modification state, where the system can settle into either of two stable steady states with different intermediate concentrations yet identical final product concentration.

fields
Dynamical Systems
pdf ↗ page arXiv:2605.11389 ↗

This article is the first part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Circulant graphs $C_n(R)$ and $C_n(S)$ are said to be \emph{Adam's isomorphic} if there exist some $a\in \mathbb{Z}_n^*$ such that $S = a R$ under arithmetic reflexive modulo $n$ \cite{ad67}. In 1970, Elspas and Turner \cite{eltu} raised a question on the isomorphism of $C_{16}(1,3,7)$ and $C_{16}(2,3,5)$. The author \cite{v96} further modify the definition to $m$ and $m^3$ are divisors of $\gcd(n, r)$ and $n$, respectively, and $r\in R$. Using the modified definition \ref{d16}, we present our study on Type-2 isomorphism of circulant graphs $C_n(R)$ w.r.t. $m$ = 2. We reprove that $(i)$ $C_{16}(1,2,7)$ and $C_{16}(2,3,5)$ are Type-2 isomorphic w.r.t. $m$ = 2; $(ii)$ For $n \geq 2$, $k \geq 3$, $1 \leq 2s-1 \leq 2n-1$, $n \neq 2s-1$, $R$ = $\{2, 2s-1, 4n-(2s-1)\}$ and $S$ = $\{2, 2n-(2s-1), 2n+2s-1\}$, $C_{8n}(R)$ and $C_{8n}(S)$ are Type-2 isomorphic w.r.t. $m$ = 2, $n,s\in\mathbb{N}$; and $(iii)$ For $n \geq 2$, $1 \leq 2s-1 < 2s'-1 \leq [\frac{n}{2}]$, $0 \leq t \leq [\frac{n}{2}]$, $R$ = $\{2,2s-1, 2s'-1\}$ and $n,s,s'\in \mathbb{N}$, if $θ_{n,2,t}(C_n(R))$ and $C_n(R)$ are isomorphic circulant graphs of Type-2 w.r.t. $m$ = 2 for some $t$, then $n \equiv 0~(mod ~ 8)$, $2s-1+2s'-1$ = $\frac{n}{2}$, $2s-1 \neq \frac{n}{8}$, $t$ = $\frac{n}{8}$ or $\frac{3n}{8}$, $1 \leq 2s-1 \leq \frac{n}{4}$ and $n \geq 16$ where $θ_{n,m,t}$ is a transformation used to define Type-2 isomorphism of a circulant graph. At the end, we present a VB program POLY215.EXE which shows how Type-2 isomorphism w.r.t. $m$ = 2 of $C_{8n}(R)$ takes place for $R = \{2, 2s-1, 4n-(2s-1)\}$, $n \geq 2$ and $n,s\in {\mathbb N}$.

comments
Slightly modified one of the previous version
fields
Combinatorics
pdf ↗ page arXiv:2605.11441 ↗

This article is the $3^{rd}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10} and is a continuation of Part 2. Here, we obtain all 384 pairs of Type-2 isomorphic circulant graphs of order 32.

comments
Slightly modified one of its previous version
fields
Combinatorics
pdf ↗ page arXiv:2605.11466 ↗

We prove a range of rigidity results for quasiisometric embeddings between right-angled Artin groups. Among other things, we: (1) classify all self–quasiisometric-embeddings of RAAGs defined on cycles; (2) show that no $n$--dimensional RAAG is a universal receiver for quasiisometric embeddings of $n$--dimensional RAAGs. (3) prove that if the direct product $F_2^n\times A_{C_5}^m$ can be quasiisometrically embedded in a RAAG $A_Γ$ of the same dimension, then the defining graph of $F_2^n\times A_{C_5}^m$ must appear as an induced subgraph of $Γ$; We also establish a strong rigidity theorem for quasiisometrically embedded images of 2–flats in RAAGs defined by triangle-free graphs that are not stars, generalising a theorem of Bestvina–Kleiner–Sageev.

comments
48 pages. v2: improved exposition, added Theorems H and K. Some results split off into the paper "Quasiisometric embeddings of right-angled Artin groups into products"
fields
Group Theory, Metric Geometry
pdf ↗ page arXiv:2605.12300 ↗

This article is the $5^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10} and is a continuation of Part 4. Here, we study Type-2 isomorphic circulant graphs of $C_{48}(r_1,r_2,r_3)$, $C_{81}(r_1,r_2,r_3)$ and $C_{96}(r_1,r_2,r_3,r_4)$. We find that for $n$ = 48,96, total number of pairs of isomorphic circulant graphs of Type-2 w.r.t. $m$ = 2 of the forms $C_{n}(r_1,r_2,r_3)$ and $C_{n}(s_1,s_2,s_3)$ are 18 and 72, respectively, and total number of triples of isomorphic circulant graphs of Type-2 w.r.t. $m$ = 3 of the form $C_{81}(x_1,x_2,x_3)$, $C_{81}(y_1,y_2,y_3)$ and $C_{81}(z_1,z_2,z_3)$ are 27.

comments
Slightly modified one of its previous version
fields
Combinatorics
pdf ↗ page arXiv:2605.12390 ↗

We introduce \emph{expander evolution algebras} (EEAs), a class of nonassociative algebras defined over an arbitrary field $\K$ in which the underlying undirected loopless graph of the algebra -- in the sense of Kowalski -- is an expander graph in the classical sense of Cheeger. Starting from the formal graph definition of Kowalski and the algebraic framework of Tian, we establish a dictionary between combinatorial expansion and algebraic structure: the Cheeger constant of the associated graph governs connectivity, the subalgebra lattice, the growth of the evolution sequence, and -- over $\R$ and $\C$ -- the spectral gap of the evolution operator. Over a general field $\K$ we prove that EEAs are always connected and simple (as evolution algebras), carry no proper large evolution subalgebras, and that every generator of a \emph{symmetric} EEA is algebraically persistent. Over $\C$ we obtain the sharp Alon–Boppana lower bound for the second eigenvalue of the evolution operator, leading to the definition of \emph{Ramanujan evolution algebras} as optimal expanders. We also construct families of EEAs from Cayley graphs of finite groups. We close with open problems.

comments
14 pages. v3: substantially revised and corrected; new results on the necessity of the positivity hypothesis (Prop. 4.7) and on the idempotent e_1+...+e_n (Prop. 5.8)
fields
Rings and Algebras, Combinatorics
pdf ↗ page arXiv:2605.12672 ↗

This article is the $4^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10} and is a continuation of Part 3. Here, we obtain all 960 triples of Type-2 isomorphic circulant graphs of order 54 and each triple of isomorphic circulant graphs is of Type-2 isomorphic w.r.t. $m$ = 3.

comments
Slightly modified one of its previous version
fields
Combinatorics
pdf ↗ page arXiv:2605.12859 ↗

This article is the $6^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. In this part, we define $V_{n,m}(C_n(R))$ and Type-2 set $T2_{n,m}(C_n(R))$ of $C_n(R)$ and present their properties. We prove that $(V_{n,m}(C_n(R)), \circ)$ is an Abelian group and $(T2_{n,m}(C_n(R)), \circ)$ is a subgroup of $(V_{n,m}(C_n(R)), \circ)$ where $T2_{n,m}(C_n(R))$ = $\{C_n(R)\}$ $\cup$ $\{C_n(S):$ $C_n(S)$ is Typ-2 isomorphic to $C_n(R)$ w.r.t. $m \}$ and $(T2_{n,m}(C_n(R)), \circ)$ is the Type-2 group of $C_n(R)$ w.r.t. $m$. We also present many examples of Type-1 and Type-2 groups where $T1_{n}(C_n(R))$ = $\{C_n(xR): x\in\varphi_{n}\}$ is the Type-1 set of $C_n(R)$ and $(T1_{n}(C_n(R)), \circ')$ is its Type-1 group.

comments
Slightly modified one of its previous version
fields
Combinatorics
pdf ↗ page arXiv:2605.12868 ↗

We give a complete characterisation of when the right-angled Artin group on one cycle graph can be quasiisometrically embedded in the right-angled Artin group on another cycle graph. In particular, we find infinitely many instances of quasiisometric embeddings where there is no subgroup relation. This contrasts with the fact that such groups are quasiisometrically rigid. More generally, we construct quasiisometric embeddings between graph products of finite or cyclic groups whose underlying graphs are cycles. As a special case, we obtain exotic quasiisometric embeddings of the hyperbolic plane in all right-angled Artin groups whose defining graph contains an induced cycle of length greater than four.

comments
42 pages. v2: Minor changes
fields
Group Theory, Metric Geometry
pdf ↗ page arXiv:2605.13314 ↗

Elspas and Turner \cite{eltu} raised a question on the isomorphism of $C_{16}(1,3,7)$ and $C_{16}(2,3,5)$ and Vilfred \cite{v96} gave its answer by defining Type-2 isomorphism of $C_n(R)$ w.r.t. $m$ $\ni$ $m$ = $\gcd(n, r) > 1$ and also modified to $m$ and $m^3$ divides $\gcd(n, r)$ and $n$, respectively, $r\in R$ and $r,n\in\mathbb{N}$ and studied such graphs \cite{v13,v20, v2-1}. Using a $C^{++}$ computer program, the authors obtained families of Type-2 isomorphic $C_{n}(R)$ w.r.t. $m$ = 2,3,5,7 for $n\in\mathbb{N}$ as well as $C_{np^3}(R)$ w.r.t. $m$ = $p$ where $p$ is a prime and $n\in\mathbb{N}$. In this paper, we present the $C^{++}$ program and also a VB program POLY415.EXE which is used to show how Type-1 and Type-2 isomorphisms of a circulant graph take place as well as for checking and finding Type-1 and Type-2 circulant graphs of a given order. This article is the $9^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}.

comments
Slightly modified one of its previous version
fields
Combinatorics
pdf ↗ page arXiv:2605.14140 ↗

In this study, we obtain two families of circulant graphs, (i) family of circulant graphs $C_{432}(R)$, each has isomorphic circulant graphs of Type-2 w.r.t. $m$ = 2 as well as $m$ = 3; and (ii) family of circulant graphs $C_{6750}(S)$, each has isomorphic circulant graphs of Type-2 w.r.t. $m$ = 3 as well as $m$ = 5. This article is the $7^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}.

comments
351 pages. Previous submission of Part 7 and Part 8 are interchanged, modified and developed to this stage
fields
Combinatorics
pdf ↗ page arXiv:2605.14402 ↗

Conservation laws of a class of time-dependent damped nonlinear multidimensional wave equations are derived by Noether's theorem. For arbitrary nonzero damping coefficient and nonlinear interaction term, its infinitesimal variational symmetries span a Euclidean algebra $\euclid(n)$ of space translations and rotations. They produce conservation of linear and angular momentums. For some specific forms of these two terms symmetry algebra is enlarged to a subalgebra of the conformal algebra $\conf(1,n)$ and in this case more interesting conservation laws are found.

comments
10 pages, corrections made
fields
Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2605.15148 ↗

Can a shared-weight recurrent Transformer—one that repeatedly applies the same Transformer to update evolving latent states—develop distinct internal roles without being partitioned into separate modules? We study this in Asymmetric Input Recurrence (AIR), a minimal two-state reasoning architecture in which the same Transformer model is reused for both updates (per literature, L and H) and the only built-in difference in the update rule is that the encoded input is injected during L-updates but not H-updates. Across Sudoku-Extreme and Maze, decoded rollouts reveal a consistent split: $z_H$ behaves like a fully committed proposal state, whereas $z_L$ retains local uncertainty and shifting intermediate structure. Freeze interventions provide evidence of dynamical dependence between the two states, with responses that vary across tasks, intervention directions, and seeds. Ablations show that to induce specialization, the shared model needs to be able to tell the two update types apart, either from input injection asymmetry or from a separate level token. Mechanistically, attention analysis shows that L-updates are consistently more local than H-updates in both Sudoku and Maze. Together, these results show that, in a two-state recurrent setting, a clear state-identity signal can induce stable, related functional roles inside a shared-parameter recurrent Transformer. Code is available at https://github.com/juchengshen/air.

comments
Accepted at NeurIPS 2026. 29 pages, 18 figures, 13 tables
fields
Optimization and Control
pdf ↗ page arXiv:2605.17811 ↗

Optimal path parameterization (OPP) is a fundamental problem for planning trajectories along a prescribed geometric path under kinodynamic constraints and task-dependent objectives. Among existing OPP works, it remains challenging to simultaneously achieve feasibility guarantees, general-objective optimality certificates, and online-compatible computation in a unified framework, especially for third-order OPP (OPP3) with non-convex constraints. This paper proposes reachability-augmented dual dynamic programming (RDDP), a state-grid-free and objective-aware dynamic programming (DP) framework for OPP. The key idea is to replace the relatively complete recourse assumption used in classical dual DP (DDP) with OPP-specific backward reachable sets, and then generate both value-function cuts and trial trajectories only inside these reachable sets. For convex and non-convex OPP, we prove global optimality and Karush-Kuhn-Tucker convergence of RDDP under OPP-specific conditions, respectively. Efficient instantiations are developed for second-order OPP (OPP2) and OPP3. Experiments show that RDDP achieves objective values comparable to convex-optimization baselines with speedups of approximately 15.3 and 4.9 times over the fastest of 4 tested solvers for OPP2 and OPP3, respectively. RDDP also achieves faster convergence than grid-based DP. Compared with reachability-analysis methods, RDDP retains the reachability mechanism while replacing local maximum-control propagation with value-function-guided control selection, thereby enabling objectives beyond traversal time. In summary, RDDP addresses a key capability gap in OPP by unifying certifiable general-objective optimization, reachability-based feasibility preservation, and online-compatible low-dimensional DP computation in a single framework.

fields
Optimization and Control
pdf ↗ page arXiv:2605.19089 ↗

In this paper, we establish Berry-Esseen-type bounds for federated linear stochastic approximation (LSA). Our results provide the first federated Gaussian approximations for LSA that explicitly capture communication-computation trade-offs and heterogeneity-aware error terms, quantifying the effects of local step size, number of local updates, and heterogeneity on convergence rates. We present results for both (i) constant step size regime and (ii) decreasing step size with an increasing number of local iterations, recovering the recent rates of Bonnerjee et al. [2025] as a special case. As a primary application of our results, we develop an online multiplier bootstrap procedure for inference on the last iterate, which avoids explicit estimation of the asymptotic covariance matrix, and obtain non-asymptotic validity guarantees for this procedure.

comments
The bootstrap validity theorem in the previous version was incorrect: it omitted a heterogeneity term of the same order as the leading fluctuation term. To address this issue, we now use the same bootstrap variables across clients, at the cost of losing the $N^{-1}$ factor in the leading term
fields
Optimization and Control
pdf ↗ page arXiv:2605.19629 ↗

We study the repulsive Hubbard model at half filling in the canonical ensemble and compare its thermodynamics with the spin-$\frac12$ antiferromagnetic Heisenberg model at superexchange coupling $J_0(U)=4t^2/U$. For fixed hopping $t\ne0$, bounded staggered fields $|h|\le h_0$, and inverse temperatures $βJ_0(U)\ge\ell_0>0$, we establish a volume-uniform pressure comparison with error $O(U^{-3}+|h|U^{-2})$. On the Heisenberg field scale $h=J_0(U)x$, the error improves to $O(U^{-3})$ for bounded $x$. Using the quantum Lee–Yang theorem of Suzuki and Fisher, we obtain a volume-uniform $O(U^{-1})$ comparison of staggered magnetizations on compact positive intervals of the scaled field $x$. By combining a recent fermionic Lee–Yang theorem with analytic interpolation, we improve this estimate to $O(U^{-2}\log U)$ in the thermodynamic limit. The latter analysis also establishes analyticity of the limiting Hubbard pressure at nonzero real fields. The improved comparison extends to vanishing positive fields satisfying $U^{-3}\ll h(U)\ll U^{-1}$, with error $O((1+\log(U^3h(U)))/(U^3h(U)))$. Consequently, sufficiently low-temperature Heisenberg Néel order yields a quantitative positive lower bound on the Hubbard staggered magnetization in this regime. Furthermore, we prove $O(U^{-2})$ bounds on the double-occupancy and charge-defect densities and the normalized charge-density-wave second moment. At zero staggered field, this decay rate is optimal for both densities, even in the thermodynamic limit. Our approach uses finite-order Schrieffer–Wolff transformations and does not establish spontaneous Néel order at fixed finite $U$.

comments
Substantially revised version with corrected proofs and improved bounds on pressure, magnetization, and charge-defect density
fields
Mathematical Physics
pdf ↗ page arXiv:2605.30663 ↗

A mixed-precision GPU-oriented optimization framework is developed for computing the minimum enclosing ball of a collection of balls. The approach is built on an equivalent second-order cone programming reformulation and a relative-type inexact proximal augmented Lagrangian method (ripALM), which provides a high-accuracy optimization backbone while solving the inner subproblems only to a progress-dependent relative accuracy. The proximal augmented Lagrangian inherits a constraint-wise separable structure: its objective, gradient, generalized Hessian, and multiplier updates can be efficiently evaluated on GPUs as parallel maps over the input balls followed by reductions. To further improve efficiency, a mixed-precision reduction strategy is introduced. A low-precision ripALM run identifies balls near the approximate boundary, a high-precision ripALM run refines the reduced problem, and a full a posteriori feasibility check detects and reintroduces any violated discarded balls. Thus, low precision is used only for screening and warm starting, while the final feasibility is enforced against the original problem. Experiments on synthetic and real-data instances show that the proposed methods can compute accurate solutions, with GPU execution providing substantial speedups and mixed-precision reduction further reducing running times on most tested instances.

comments
17 pages
fields
Optimization and Control
pdf ↗ page arXiv:2605.31425 ↗

We show that the top cohomology of any affine Springer fiber, as a Weyl group representation, contains a large part of the total cohomology of certain Springer fibers. The main ingredient of the proof is the construction of a ``perverse filtration'' on the pure part of the cohomology of affine Springer fibers.

comments
23 pages
fields
Representation Theory, Algebraic Geometry
pdf ↗ page arXiv:2606.01507 ↗

This paper investigates the long time well-posedness of the Benjamin-Ono (BO) equation with quasi-periodic initial data in analytic space. We demonstrate that the Lax operator of the BO equation exhibits a trivial spectrum, and elucidate the fundamental mathematical obstacles to establishing global well-posedness. Furthermore, by employing Tao's gauge transformation in conjunction with the Birkhoff Normal Form method, we extend the lifespan of the solutions to $O(ε^{-3})$.

comments
Withdrawn by the author due to unresolved gaps in the proofs of the main theorems. The results should not be regarded as established by this preprint
fields
Analysis of PDEs
pdf ↗ page arXiv:2606.01778 ↗

We study unital completely positive (UCP) maps on the finite Toeplitz operator system $\mathcal T_d$ of $d \times d$ Toeplitz matrices. We give an explicit characterization of pure UCP maps on $\mathcal T_d$ taking values in $M_n$ in terms of positive $n\times n$ matrix-valued trigonometric polynomials of degree at most $d-1$. This characterization yields a checkable criterion for deciding whether a given UCP map is pure. As an application, we prove that every pure UCP map on $\mathcal T_d$ has a unique completely positive extension to the generated $C^*$-algebra.

comments
Title updated following the removal of Gromov-Hausdorff convergence from the manuscript; accepted for publication in IMRN
fields
Operator Algebras, Functional Analysis, Quantum Algebra
pdf ↗ page arXiv:2606.02561 ↗

In this work, we study the symmetric hit problem in four variables by analyzing the relative cohit space, defined as the kernel of the inclusion-induced map from symmetric to ordinary cohits. We establish that this relative space is isomorphic to a kernel in the first group cohomology of the permutation group and, equivalently, to an $\operatorname{Ext}^1$ kernel for the general linear group, equipped with a canonical action of the normalizer quotient. We use explicit Lucas–Cartan identities to construct unconditional fixed Steenrod preimages for nontrivial stabilizers, resolving infinite families of monomials strictly above the minimal-spike weight. Using the ordinary and symmetric Kameko isomorphisms, we reduce the determination of complete bases in two generic degree families to exact calculations in degrees one, three, six, ten, and sixteen. The relative space first becomes nonzero in degree fifteen, where it is one-dimensional, and it is an indecomposable two-dimensional normalizer module in degree eighteen. In the family $5\cdot2^t-4$, the symmetric cohit dimension stabilizes at six and the relative dimension at one for $t\geq2$; in the family $7\cdot2^t-4$, they are four and zero for $t\geq1$. We give complete bases by explicit exponent formulas and prove Janfada's monomial implication [7, Conjecture 1] in every degree of both families. We extend the known optimal bound for ordinary Kameko isomorphisms to every permutation-invariant cohit space, prove its optimality there, and transport the entire symmetric hit basis by a direct-sum formula.

comments
38 pages. Comments are welcome!
fields
Algebraic Topology, Combinatorics, Representation Theory
pdf ↗ page arXiv:2606.02626 ↗

Building on the recently discovered origami-amplituhedron correspondence, we prove that the BCFW (Britto-Cachazo-Feng-Witten) cells triangulate the $m=4$ amplituhedron in full generality at all loop orders, both in momentum and momentum-twistor space. Along the way, we develop two natural "$L$-punctured" extensions of the positive Grassmannian and relate them via T-duality.

comments
107 pages, 22 figures. Second paper in the series, extending the results of arXiv:2410.09574 from tree level to loop level. v2: Minor updates
fields
Mathematical Physics, Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2606.03439 ↗

Determining spectral gaps in the thermodynamic limit is a central challenge in quantum many-body physics. When a fixed boundary condition is imposed, this problem is undecidable: no algorithm, even with unlimited resources, can decide for every Hamiltonian whether it is gapped. Yet the thermodynamic limit is meant to capture the intrinsic properties of very large systems, which should not depend on how their boundaries are chosen. We therefore consider the bulk spectral gap, which concerns only the intrinsic excitations of the infinite system, and ask what can and cannot be computed about it. First, we give a general algorithm producing a hierarchy of certified upper bounds on the bulk gap, arbitrarily tight at the cost of more computation. Second, we prove that the spectral gap problem remains undecidable in the bulk, already for translationally invariant nearest-neighbour chains of fixed local dimension. Hence no general algorithm produces convergent lower bounds, and no convergent upper-bounding algorithm, ours included, admits a computable convergence rate. The bulk spectral gap is thus certifiable from above but uncomputable from below; more precisely, the bulk-gaplessness promise problem is RE-complete, exactly as hard as the halting problem. The same construction shows that no general algorithm can decide whether a given product state is a ground state, and that convergent bounds on ground-state expectation values admit no computable convergence rate in general. Finally, we obtain the first nontrivial certified upper bounds on the bulk gap of the spin-1/2 kagome Heisenberg antiferromagnet.

comments
48 pages, 5 figures, incl. SI (38 pages). Comments welcome! v5: improved kagome bounds; clearer presentation. v4: uncomputability of KMS ground states and their expectation values; instability under onsite perturbations. v3: uncomputability from below, RE-completeness, new title (previously: The bulk spectral gap is semi-decidable: a convergent family of certified upper bounds)
fields
Mathematical Physics
pdf ↗ page arXiv:2606.03836 ↗

In this paper, we develop a novel class of high-order uniformly accurate exponential integrators for charged-particle dynamics under strong magnetic field. The small parameter $0<\varepsilon\ll 1$ induces rapid temporal oscillations, rendering traditional numerical methods prohibitively expensive due to severe step-size restrictions. To address this issue, a linearization technology that introduces auxiliary polynomial variables is employed to recast the original charged-particle dynamics as a higher-dimensional system. Classical exponential integrators are subsequently applied to this augmented formulation, which inherently carries richer structural information, thereby yielding a family of uniformly accurate exponential integrators that can reach arbitrarily high order without requiring any order conditions. For strong magnetic fields under the maximal-ordering scaling, we rigorously establish through algebraic techniques that the schemes with auxiliary polynomial variables of degree $k\geq2$ achieve an improved position error bound of $\mathcal{O}(\min\{\varepsilon^{k+1}h,\varepsilon h^{k+1}\})$ and a uniform velocity error bound of $\mathcal{O}(\min\{\varepsilon^{k}h,h^{k+1}\})$, where $h$ denotes the time-step size. Under the additional condition that the magnetic field gradient vanishes at the origin, these bounds sharpen to $\mathcal{O}(\min\{\varepsilon^{k+2},\varepsilon h^{k+1}\})$ and $\mathcal{O}(\min\{\varepsilon^{k+1},h^{k+1}\})$ for the position and velocity, respectively, for $k\geq1$. The same sharper bounds hold for constant strong magnetic fields. Numerical experiments confirm the advantages of the proposed methods.

fields
Numerical Analysis
pdf ↗ page arXiv:2606.04478 ↗

Reduced-precision arithmetic offers significant opportunities to improve performance, memory usage, and energy efficiency in numerical applications, provided that numerical accuracy is preserved. This work investigates automated precision tuning through customized floating-point formats with user-defined exponent and significand sizes, enabling the emulation of emerging low-precision formats and the exploration of non-standard precision configurations within a unified mixed-precision framework. The proposed methodology, implemented in the PROMISE precision autotuning tool, combines numerical validation with a systematic search to generate program variants that satisfy user-defined accuracy requirements. To address the computational cost of this exploration, a containerized benchmarking framework supports parallel execution across multiple algorithms and parameter configurations. The approach is evaluated on a suite of numerical programs, including linear solvers and applications from the Rodinia benchmark. Results show that a substantial proportion of variables can be safely reduced to lower precision while preserving accuracy, indicating that standard double precision is often over-provisioned. These findings highlight the potential of automated precision tuning to derive efficient mixed-precision configurations tailored to application-specific accuracy requirements.

fields
Numerical Analysis
pdf ↗ page arXiv:2606.08339 ↗

Railway crew scheduling consists of assigning a set of tasks to crew members in the form of feasible duties so as to minimise costs, and is one of the key planning problems faced by railway operators. While column generation is the dominant solution method, literature on exact branch-and-price approaches is scarce. Moreover, few publicly available benchmark instances exist. We conduct a systematic computational study of branch and price for railway crew scheduling, evaluating the contribution of branching rules, primal heuristics, and reduced cost fixing. To this end, we introduce a novel library of 100 benchmark instances, ranging in size from 90 to 3,016 tasks, each provided in a single-depot and a multi-depot variant. The instances are generated by mimicking the railway planning process, validated against data from Netherlands Railways, and publicly available with best known solutions and a solution checker. We report average optimality gaps below 1% across all instance sizes, driven primarily by the strong performance of primal heuristics, whereas branching and reduced cost fixing contribute little to closing the gap. Branch and price also outperforms a multi-commodity flow formulation, which fails to find a feasible solution on many of the smallest instances. Our findings provide support for the popularity of column generation-based primal heuristics, and show that improving the dual bound remains the main challenge for exact methods in railway crew scheduling.

fields
Optimization and Control
pdf ↗ page arXiv:2606.10081 ↗

In 2025 Cornet, Dravec, and Torres determined the domination number $γ(J(n,3))$ of the Johnson graph for every even $n \ge 6$, expressing it as a closed form $φ_n$ in terms of Fort-Hedlund covering numbers, and conjectured the same value for odd $n$. We prove this conjecture: $γ(J(n,3)) = φ_n$ for every odd $n \ge 7$. A dominating set of $J(n,3)$ is the same as a lotto design $\mathrm{LD}(n,3,3,2)$, and the lotto numbers $L(n,3,3,2)$, and hence $γ(J(n,3))$, were already determined for every $n$ by Bate (1978) and by Brouwer (1981). The contribution of this paper is therefore a new proof of the odd case, carried out within the bijective framework of Cornet, Dravec, and Torres.

comments
18 pages. v2: acknowledges that the result follows from earlier work of Bate (1978) and Brouwer (1981) on lotto designs; corrects several statements about prior work
fields
Combinatorics
pdf ↗ page arXiv:2606.10326 ↗

We introduce a new tool, Express, for converting a non-causal attention approximation into a causal approximation with matching approximation guarantees. When combined with the state-of-the-art Thinformer approximation, Express improves upon the best known causal attention guarantees, delivering $\log^{3/2}(n)/s$ approximation error with only $O(s)$ memory and $O(s^2 \log^2(n))$ compression overhead for a sequence of length $n$. We pair these developments with an efficient I/O-aware Triton implementation, demonstrate substantial speedups over FlashAttention 2, and use Express to overcome four resource bottlenecks in the language modeling pipeline: long-context prefill, KV cache compression, long-form memory-constrained decoding, and long-form compute-constrained decoding.

fields
Statistics Theory
pdf ↗ page arXiv:2606.10944 ↗

We define and investigate two families of dual polynomials associated with the Gauss–Legendre polynomials, which have recently found interesting applications in computer graphics. Using the presented results, one can derive representations of the Gauss–Legendre polynomials, construct the dual bases for Lagrange bases and solve certain approximation problems arising, for example, in CAGD.

fields
Numerical Analysis
pdf ↗ page arXiv:2606.11355 ↗

We study a class of continuous stochastic flows driven by a space-time white noise and characterize their dual flows by explicit stochastic differential equations. A key ingredient of the proof is the convergence of solutions under coefficient approximations. As an application, we derive the dual flows in two illustrative examples, the squared Bessel flow and the Jacobi flow. We also introduce a new model of polynomially self-repelling (PSR) flow and show that it enjoys a self-duality property.

comments
50 pages
fields
Probability
pdf ↗ page arXiv:2606.12143 ↗

A central problem in statistical physics is to extend the Boltzmann distribution to nonequilibrium steady states (NESS). We prove that NESS on large dense disordered networks have Boltzmann-like occupation despite extensive entropy production. One consequence is that such NESS can conceal their nonequilibrium nature from measurements of static response to energy perturbations. We further prove that the active-matter heuristic of "low rattling" is asymptotically exact for these NESS. Intuitively, they spend a greater fraction of their time in states they leave more slowly. We show that rattling effectively extends the Boltzmann distribution to such NESS, as well as the broader class of "equiaccessible" steady states, which play a role in our analysis akin to that of equilibrium in linear response.

comments
10 pages, 3 figures, accepted for publication in Physical Review E
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2606.14542 ↗

We analyze diffusion processes ${(μ_t)}_{t\geq 0}$ on the $2$-Wasserstein space $\mathscr P_2$ over $\mathbb R^d$, which can be classified as Ornstein–Uhlenbeck processes by means of their Fukushima decomposition. Characteristically for this class, $ | μ_t|_2^2-|μ_0|_2^2-2ct+2\int_0 ^t|μ_s|_2^2\,d s,\, t\geq 0,$ is a martingale, where $c\in(0,\infty)$ is a constant and $|μ_t|_2:=(\int_{\mathbb R^d}x^{\text{T}} xμ_t(d x ))^{1/2}$ denotes the second moment. Making a particular choice from this class, we obtain a process ${(μ_t)}_{t\geq 0}$ such that all moments exist and ${μ_t(θ)}-{μ_0(θ)}-\int_0 ^tμ_s\big(Δθ-\langle \text{id}_{\mathbb R^d},\nabla θ\rangle\big)d s$, $t\geq 0$, is a martingale for each multivariate polynomial $θ:\mathbb R^d\to\mathbb R$.

fields
Probability
pdf ↗ page arXiv:2606.14917 ↗

In 1929, O. Zariski found a pair of complex plane algebraic curves of the same degree and with the same collection of singularities, but embedded into the plane in a topologically different way. Accordingly, such curves belong to different components of the equisingular family. This phenomenon has been intensively studied till now. In this note, we propose a different insight on this subject: Two curves $C',C''\subset\PP^2$ form an {\it anti-Zariski pair}, if $(\PP^2,C')$ and $(\PP^2,C'')$ are homeomorhic, but $C'$ and $C''$ belong to different components of the equisingular family. We exhibit examples of anti-Zariski pairs and discuss related issues.

comments
Following comments of Enrique Artal Bartolo and Stepan Orevkov, we added new references and updated information on various types of equivalence of plane complex curves
fields
Algebraic Geometry
pdf ↗ page arXiv:2606.20268 ↗

This article is the $8^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. In this study, we define {\em isomorphic set}, {\em isomorphism series}, {\em isomorphism digraph} or {\em isomorphism diagram} $\mathcal{D}$ and {\em isomorphism graph} $\mathcal{G}$ of circulant graphs and obtain these corresponding to $C_{16}(R)$, $C_{27}(S)$ and $C_{54}(1,3,17,19)$ and present the isomorphism digraph and the isomorphism graph of $C_{432}(T)$ which has isomorphic circulant graphs of Type-2 w.r.t. $m$ = 2,3 and of $C_{6750}(U)$ which has isomorphic circulant graphs of Type-2 w.r.t. $m$ = 3,5 where $T$ = $\{16, 27, 48, 54, 128, 160, 189\}$ and $U$ = $\{135, 243, 250, 750, 1107, 1593, 2000, 2457, 2500, 2943\}$. We also define {\em diameter of isomorphic set} of $C_n(R)$ and {\em isomorphic distance} between any two circulant graphs. We find that the order of isomorphic sets of $C_{432}(T)$ and $C_{6750}(U)$ are 36 and 450 and their diameters are 3 and 3, respectively.

comments
This article contains 79 pages. Previous version of Part 7 and Part 8 are interchanged, modified and developed to this stage
fields
Combinatorics
pdf ↗ page arXiv:2606.20984 ↗

Landau solutions, when oriented along the vertical axis, represent a one parameter family of exact, self-similar, axisymmetric, swirl-free solutions to the 3D stationary Navier-Stokes equations forced by an upward facing point-source of momentum at the origin. They have an isolated singularity at the origin. Other singular steady state solutions can be derived from a similar framework. Some of these variants have been proposed as models for physical scenarios. For example, a solution first found by Squire has been proposed as a model of a fluid entrained to a radially discharging surface layer of oil. Another, Serrin's swirling vortex, exhibits qualitative features shared with some tornadoes, like a two-cell structure consisting of a central downdraft and peripheral updraft as well as swirl. The first objective of this paper is to provide a detailed analysis of these and other examples, especially when boundaries are present. In this direction we find several new, physically motivated classes of solutions and identify new connections between the physics literature and the mathematics literature. Many of these examples are formulated on the half-space, but much of the mathematical literature on singular steady-state solutions is for $\mathbb{R}^3$. The second objective of this paper is to establish asymptotic stability for many of these solutions by formulating the problem in domains with boundaries. Our most general result in this direction uses a new approach to asymptotic stability that is based on eventual regularity. In a different direction, we prove that a class of singular steady-state solutions motivated by Serrin's swirling vortex are stable under certain axisymmetric perturbations. This requires a novel observation because these ``Type III'' solutions are too singular to be directly amenable to existing approaches.

comments
54 pages, 6 figures, fixed an error in the treatment of Type II.5 asymptotic stability
fields
Analysis of PDEs
pdf ↗ page arXiv:2606.22291 ↗

Quantum tomography and quantum retrodiction are traditionally viewed as separate inference tasks. We show that the two are manifestations of the same underlying principle. We prove that the Petz recovery map of a measurement channel is a gradient of the log-likelihood used in maximum-likelihood tomography, and we derive its extension to arbitrary quantum channels. Consequently, for measurement channels, repeated applications of the Petz map monotonically increase the likelihood, naturally yielding a method for quantum tomography.

comments
6+9 pages, 4 figures. Revised version: updated Figs. 2 and 3; added Fig. 4 and supplementary sections on numerical evidence for Conjecture 3 and a thermodynamic reconstruction example; moved the gradient derivation to End Matter
fields
Mathematical Physics, Statistics Theory
pdf ↗ page arXiv:2606.23777 ↗

Instantaneous Quantum Polynomial-time (IQP) circuits are promising candidates for near-term quantum computing due to the conjectured classical hardness of their sampling task and their shallow, highly parallelizable structure. Despite extensive studies of their complexity-theoretic properties, the role of circuit connectivity in their trainability as variational ansatze remains poorly understood. In this work, we present an investigation of IQP circuits for Hamiltonian optimization that traces a mechanistic chain linking circuit connectivity, entanglement generation, and gradient scaling: increasing connectivity drives the circuit output toward Haar-like statistics and volume-law entanglement, and this increase in entanglement is consistently associated with an exponential decay of the gradient variance and degraded optimization performance, while sparser architectures retain stable gradients at the cost of global expressibility and entanglement capacity. This connectivity-entanglement-gradient mechanism produces a nontrivial connectivity-trainability trade-off, demonstrating that effective IQP-based Hamiltonian optimization requires a balance between global expressibility and trainability rather than maximal expressivity alone. In particular, on our benchmarks, a circuit generating no entanglement already matches the optimization performance of more highly connected circuits, and a circular topology retains entanglement capacity while preserving trainability, making it a broadly effective choice among the architectures considered.

comments
14 pages, 6 figures
journal
Physica Scripta (2026) Physica Scripta Physica Scripta
fields
Numerical Analysis
pdf ↗ page arXiv:2606.24264 ↗

Let ${\mathbf A}$ be the affine coordinate ring of $E\setminus\{\infty\}$, where $E$ is an elliptic curve over $\mathbb F_q$ and $\infty$ is rational. We solve the rank-two case of the open problem of explicitly classifying sign-normalized Drinfeld ${\mathbf A}$-modules in generic characteristic with a fixed determinant motive; the classification for rank greater than two remains open. Outside an explicit exceptional locus, the rank-two Drinfeld modules are parametrized by the open modular curve $Y^{q+1}=π(X)$ with $Y\neq0$. The polynomial $π$ is squarefree, and the smooth projective completion of this curve has genus $q^2$. The roots of $π$ split into two types. Above roots of the first type, all coefficient functions extend regularly, and their extensions yield exactly the exceptional modules. Roots of the second type correspond to cusps of the modular curve; above these roots, the coefficient family has poles.

comments
32 pages
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2606.26851 ↗

We present a systematic procedure for constructing brane brick models corresponding to abelian orbifolds of toric Calabi-Yau 4-folds, extending the orbifold construction beyond the well-studied case of abelian orbifolds of C^4. Given a parent brane brick model corresponding to a toric Calabi-Yau 4-fold M, we show that the action of an abelian orbifold group Gamma on the generators of M induces an action on the chiral and Fermi fields as well as the J- and E-terms of the associated 2d (0,2) supersymmetric gauge theory. The requirement that the orbifolded brane brick model remains consistent with the closed paths associated with the J- and E-terms, together with the chiral cycles formed by their products, precisely reproduces the Calabi-Yau condition on the orbifold action. This procedure yields an explicit formula for the J- and E-terms of the orbifolded brane brick model in terms of those of the parent theory. We apply our construction to the brane brick models corresponding to Q^{1,1,1} and D_3, and present the resulting families of 2d (0,2) quiver gauge theories. We also present explicit expressions for generating functions that count distinct abelian orbifolds of Q^{1,1,1} and D_3.

comments
141 pages, 38 figures, 44 tables; v2: published version
journal
JHEP 2609:193,2026
fields
Mathematical Physics, Algebraic Geometry
pdf ↗ page arXiv:2606.28110 ↗

{We study nonautonomous systems whose equilibrium sets are nonisolated and move with time. Their motion is measured on each ball by a localized Attouch–Wets distance, which yields an equilibrium speed that may depend on the radius. The distance from a trajectory to the current equilibrium set is estimated in two ways: through a composite Lyapunov function compared with a power of this distance, and, without any Lyapunov function, through a decay condition on the frozen vector fields. In the first setting, we prove practical stability, and Lyapunov stability when the dissipation has no residual, a case that forces the equilibrium sets to be nested. In the second, we obtain, in the region where the decay condition holds, an explicit tracking estimate driven by the equilibrium speed and the inputs, and we prove asymptotic tracking whenever their averages over unit time intervals vanish, a condition that cannot be weakened among conditions on the speed alone. We also derive input-to-state stability bounds and explicit convergence rates. When the equilibrium speeds are integrable, the equilibrium sets converge in the Attouch–Wets sense to a limiting set at an explicit rate. If, moreover, the velocity is bounded by a multiple of the distance to the current equilibrium set, every trajectory remaining in the region considered has finite length and converges to a point of the limiting set; for a fixed equilibrium set, this yields semistability. The results are illustrated on a scalar example and on resource-allocation models with time-varying demand and with rotating weights.

comments
Revised and corrected version. Some statements and arguments have been corrected and strengthened; the main scope and conclusions of the paper remain unchanged
fields
Dynamical Systems, Classical Analysis and ODEs, Optimization and Control
pdf ↗ page arXiv:2606.28422 ↗

We design and analyse a family of hypocoercivity-preserving fully discrete Galerkin methods for the kinetic Fokker–Planck (kFP) equations, a class of evolution partial differential equations (PDE) with \emph{degenerate} diffusion. The key idea in the method design is to mimic the framework of enhanced quadratic forms of Villani \cite{villani} to obtain a coercive bilinear form in a sufficiently strong exponentially weighted norm admitting a spectral gap/Poincaré inequality, despite the degeneracy. The problem is posed as a fourth-order evolution PDE on the whole space $\mathbb{R}^{d}\times\mathbb{R}^d$. The spatial discretization employs continuous piecewise polynomial approximation spaces on simplicial and/or box-type meshes comprising finite and infinite elements. Nonconformity is treated by constructing appropriate numerical fluxes in the spirit of $C^0$-interior penalty ($C^0$-IP) methods for fourth-order elliptic problems. The proof of coercivity requires new trace inverse inequalities for exponentially weighted norms on $d$-dimensional simplicial and box-type domains, and prismatic domains with infinite length. We prove these inequalities for a variety of exponential weights. Once coercivity is established, exponential convergence to equilibrium follows from an exponentially weighted Poincaré inequality. A fully discrete extension is obtained by coupling the spatial discretization with an $hp$-version discontinuous Galerkin time-stepping scheme. Exponential convergence to equilibrium is also proven for the fully discrete scheme. The proposed methods preserve total mass and exhibit \emph{provably} exponential convergence to equilibrium, a manifestation of `numerical hypocoercivity,' making them well suited for long-time kFP simulations. Numerical experiments validate the theoretical results and investigate the convergence behaviour of the proposed method.

fields
Numerical Analysis
pdf ↗ page arXiv:2606.29621 ↗

We relate the hyperbolicity of a calibrated manifold $(X, φ)$ to the analytic properties of the space of Smith immersions $\mathrm{SmIm}(B^k, X)$ from the Poincare $k$-ball into $X$. In particular, we establish the following calibrated analogue of a theorem of Royden: if $X$ is $φ$-saturated, then $R_φ$- and $K_φ$-hyperbolicity coincide, and either implies the equicontinuity of $\mathrm{SmIm}(B^k, X)$ with respect to the $φ$-distance. This yields a Montel theorem for compact $φ$-saturated calibrated manifolds as an immediate corollary. Our primary technical tool is a new Schwarz lemma for Smith immersions from $B^k$ into $X$, which is of independent interest. In a similar spirit, we also prove a calibrated analogue of Kiernan's theorem to the effect that the $K_φ$-hyperbolicity of $X$ is almost equivalent to $\mathrm{SmIm}(B^k, X)$ being a normal family. Finally, we prove that bounded domains in flat euclidean space are $R_φ$-hyperbolic for any calibration $φ$, and we investigate the hyperbolicity of products and discrete quotients.

comments
31 pages. Version 3: Corrected the statement of the Schwarz lemma, replaced one hypothesis in some theorems with the weaker $φ$-saturation condition, and defined the Kobayashi $φ$-pseudo-distance in full generality
fields
Differential Geometry
pdf ↗ page arXiv:2606.31393 ↗

A Minkowski normed space is the Euclidean space equipped with a (possibly asymmetric) uniformly convex and smooth norm, forming a particular class of Finsler manifolds. We construct a stochastic process with one-dimensional time marginal densities given by the fundamental solution to the nonlinear Finsler heat equation in Minkowski normed spaces. This process is constructed as a solution to a singular McKean–Vlasov stochastic differential equation and constitutes a nonlinear Markov process in the sense of McKean. We show that solutions to this stochastic differential equation are pathwise unique, and, thus, probabilistically strong solutions, though the equation has singular coefficients beyond the subcritical regime. Since our construction is a natural extension of the construction of standard Brownian motion from the standard heat kernel, we call this process \emph{Brownian motion in Minkowski normed spaces.} Furthermore, we obtain a universality property, namely that whichever Minkowski norm is chosen, the radial part of this process is the standard Bessel process. To the best of our knowledge, this is the first construction of stochastic processes associated with nonlinear heat equation in Finslerian spaces.

comments
30 pages
fields
Probability, Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2607.00800 ↗

We study self-reference and solution independence in Boolean $K$-SAT as a finite analogue of Gödel incompleteness. Independence is defined through factorial moments of the solution count. Constant-width random formulas fail this criterion due to correlations among overlapping assignments. At a covering threshold, logarithmic-width random CNFs have a Poisson solution count, with positive probabilities of unsatisfiability and unique satisfiability. Replacing a redundant clause by one falsified by the unique solution yields an unsatisfiable companion preserving the unsigned incidence graph. For every permitted local view of a good uniquely satisfiable formula, an unsatisfiable companion preserves that view. Irreducibility defeats deterministic and bounded-error evaluators using $N^c$ clause queries, for fixed $0<c<1$. It establishes a local information obstruction, not an unrestricted time lower bound. For fixed $δ>0$, transcripts of $N^{1-δ}$ queries leave $N-o(N)$ bits of witness entropy. On typical support graphs, expansion yields linear Resolution width, linear PC/PCR and SOS degree, and exponential proof size. Bounds hold for semantic Cutting Planes under a partition condition and for Positivstellensatz with bounded product width, uniformly over unsatisfiable support-preserving signings. Structural evidence and the limits of acceleration strategies motivate the self-referential $K$-SAT exhaustive-search hypothesis (SRK-ESH): no uniform deterministic algorithm deciding the promise family achieves a fixed proportional saving in the exponent. This dual-evidence criterion combines intrinsic hardness mechanisms with algorithmic evidence. We interpret this hypothesis as a quantitative projection of the Gödel-style local–global gap. The information obstruction constrains quantum local observation and statistical learning from bounded local information.

comments
44 pages; Section 7.2 added
fields
Information Theory
pdf ↗ page arXiv:2607.01671 ↗

Let $Ω\subset\mathbb{C}^{n}$ be a bounded domain, and let $ρ:Ω\to[-1,0)$ be a smooth strictly plurisubharmonic exhaustion function. We consider the logarithmic potential $g=-\log(-ρ)$ and the associated complete Kähler metric $ω=dd^{c} g$. We prove that if $ρ$ satisfies the finite weighted Monge-Ampère mass condition with weight $(-ρ)^{\varepsilon}$ for every $\varepsilon>0$, then the spectrum and the essential spectrum of the Laplace-Beltrami operator of $(Ω,ω)$ both coincide with $[n^{2},\infty)$. In particular, the bottom of the spectrum satisfies $λ_{0}(Δ_ω,Ω)=n^{2}$, and $n^{2}$ is not an $L^{2}$-eigenvalue. For each $α> \frac{n}{2}$, we set $f=(-ρ)^α$ and prove that $f$ belongs to $W^{1,2}(Ω,ω)$ if and only if the Monge-Ampère mass of $ρ$ weighted by $(-ρ)^{2α-n}$ is finite. The integral identities underlying this equivalence, applied to the complex powers $(-ρ)^{α+it}$, give, after normalization, a singular Weyl sequence at every $n^{2}+4t^{2}$, $t\in\mathbb{R}$, as $α\downarrow\frac{n}{2}$. Combining our theorem with Cegrell's finite-mass exhaustion theorem, we obtain a complete Kähler metric with spectrum and essential spectrum equal to $[n^{2},\infty)$ on every bounded hyperconvex domain.

comments
15 pages, no figures. Results extended to determine the full spectrum and essential spectrum
fields
Complex Variables, Differential Geometry
pdf ↗ page arXiv:2607.03036 ↗

Intertwined complete projective experiments share outcomes, motivating the search for a common spectral labeling across contexts. Strong coloring tests whether complete contexts admit one context-independent nondegenerate spectrum; when that labeling exists, chromatic separability tests which event distinctions it preserves. We distinguish these questions from ordinary Kochen–Specker statelessness, geometric realizability, event-order representation, and Born-probability models. A state extends to a strong d-coloring exactly when deletion of its support leaves a (d-1)-colorable graph. Faithful real 17- and 21-ray restrictions of completed Yu–Oh have separating ordinary states but forced color identities; one quantum preparation requires exactly 1/9 nonextendable weight despite admitting an ordinary-state model. Independent Hermitian projection arguments correct earlier inferences from a chromatic gap to statelessness or nonrealizability. Hesse's complex 37-ray example separates real and complex geometry and has exact state-family minima 6/7/18 for three representation requirements. A rational two-plane construction gives a linear real 65-ray example with 393,216 states and explicit event-order and probability failures. General and specified ancestry results distinguish geometric KS extensions from abstract chromatic-to-stateless constructions. Detailed enumerations, regenerated state certificates, and extended proofs are supplementary.

comments
20 pages (including 60 pages supplement), 6 figures, 6 tables, largely extended, explicit examples added
fields
Combinatorics
pdf ↗ page arXiv:2607.04289 ↗

Recently, Chudnovsky, Cook, Davies, Oum, and Tan obtained the first finite bound on the chromatic number of t-perfect graphs, showing that they are 199053-colorable. We improve this bound to 130 by refining their proof. The original proof establishes that every graph with large odd girth and large chromatic number contains a certain structure called an r-arithmetic rope, and that its existence in a certain leveling of a graph with large odd girth would imply an odd wheel as a t-minor, a known obstruction to t-perfectness. While their technique requires a lower bound on the chromatic number that is exponential in r, we show that the existence of an r-arithmetic rope can already be guaranteed under a linear bound. Using a slightly weakened notion of arithmetic ropes allows us to reduce the bound even further.

comments
16 pages. v2: improved bound from 186 to 130, corrected a minor mistake, and improved figures
fields
Combinatorics
pdf ↗ page arXiv:2607.05961 ↗

We construct smooth, uniformly convex planar domains that admit minimal, strictly stable solutions of a semilinear Dirichlet problem whose superlevel sets are nonetheless nonconvex. The class of admissible nonlinearities includes, in particular, two prototypical cases: the Gelfand-type nonlinearity $e^u$ and the family of shifted power-type nonlinearities $(a+u)^p$, where $a>0$ and $p>1$. By applying the elementary scaling properties of the Dirichlet problem, we also show that the same lack of convexity of superlevel sets holds for the corresponding parameter-dependent equations. These results provide a negative answer to a question posed by Brezis, who inquired whether the stability of a solution necessarily entails quasiconcavity for these prototypical stable configurations.

comments
35 Pages. Dedicated to Xavier Cabré on the occasion of his 60th birthday. An AI disclaimer is added
fields
Analysis of PDEs
pdf ↗ page arXiv:2607.06031 ↗

We study an equation-free screen for finite-window Mittag-Leffler compatibility, in which multihorizon relaxation profiles are constructed out of sample by k-nearest-neighbor prediction from ensembles of scalar trajectories and compared with candidate temporal laws. The screen assesses compatibility, not the generating mechanism. In a matched, noise-free calibration, it reproduces the generating Mittag-Leffler behavior to numerical precision, while relaxation-rate heterogeneity shifts the fitted Mittag-Leffler order toward lower values. For noise-free classical distributed-rate ensembles, a Mittag-Leffler preference over a single exponential disappears when a biexponential alternative is included. Under observational noise, this recovery is incomplete: with three candidate families, the Mittag-Leffler law is still selected in 60% of runs for a classical ensemble, against 72% for a fractional reference. In the tested noise-free settings, simpler profile constructions reproduce the screening decisions, whereas kNN predicts individual trajectories far more accurately than a constant predictor. The screening interpretation of a single-record example, initially investigated as a chaotic test case, is withdrawn as evidence about the continuous system after numerical verification revealed a nonrobust simulated regime. Mittag-Leffler compatibility is therefore a comparative, condition-dependent screening outcome, not identification of fractional origin.

comments
Substantially revised version; 20 pages, 5 figures, 8 tables
fields
Dynamical Systems
pdf ↗ page arXiv:2607.08588 ↗

Two transverse segments have local Hausdorff and upper box dimension one at their crossing, although they carry two independent tangent directions. We define the Point-Cross Dimension by assigning each tangent line the largest local upper box dimension captured by intersection with a regular \(C^1\) curve in that direction, then taking the supremum of their sums over finite independent families of tangent lines. Every Bouligand direction admits such a recurrent curve. The resulting profile is invariant under closure and covariant under local \(C^1\)-diffeomorphisms. Each directional weight is attained, and the profile is upper semicontinuous. An integral representation by ranks of weight superlevel sets gives submodularity and, together with projection bounds, exact Cartesian-product additivity. Germs with the same projective tangent support, local upper box dimension, and rank of segment directions can have different Point-Cross Dimensions. Further computations give exact directional profiles for chirps and the Point-Cross Dimension of a self-affine carpet. Finally, approximation of a ray with error \(O(t^d)\), for \(d>1\), forces directional weight at least \(1-1/d\), and this bound is sharp.

comments
This version has been substantially revised. The probe class is now regular C1 rather than Lipschitz. New results include a Holder-scale sharpness threshold, exact Cartesian-product additivity, and the exact Point-Cross value of a Bedford-McMullen carpet
fields
Metric Geometry, Classical Analysis and ODEs, Functional Analysis, General Topology
pdf ↗ page arXiv:2607.08612 ↗

Synchronization is ubiquitous across natural and synthetic systems, yet most prior studies focus on the inertia-free Kuramoto model and do so at the macroscopic level. In this study, we instead investigate the inertial Kuramoto model and analyze the kinetics of individual synchronized clusters that emerge in the underdamped dynamics, driven by the interactions among multiple synchronized clusters with different frequencies. Specifically, we explore two forms of intrinsic frequency distribution -- unimodal Gaussian and multimodal uniform -- and show that they give rise to qualitatively different synchronized clusters: a hierarchical organization for the Gaussian distribution and a homogeneous organization for the uniform distribution. This contrast leads to qualitatively different behaviors of the order parameter: for the Gaussian distribution, it increases smoothly with increasing coupling strength, while for the uniform distribution, it grows through a series of discrete jumps that trace out the size of the Devil's staircase (DS). By resolving the kinetics at the cluster level, we further find that the route to synchronization also depends on the distribution type: with a Gaussian distribution, a single dominant cluster forms and gradually entrains the remaining oscillators, whereas with a uniform distribution, synchronization proceeds via successive cluster mergers initiated from peripheral seeds associated with the high-frequency periphery. Taken together, these findings provide a new perspective on collective synchronization dynamics in inertial complex systems.

comments
31 pages, 26 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2607.09171 ↗

We give counterexamples to two optimization problems in dimensions eight and nine. 1. The Cartesian-product problem posed by Cassels for critical determinants and later formulated by Zong for lattice packings and for packings allowing translations but not rotations: whether the corresponding product inequalities are always equalities. The counterexample also disproves the natural product formula for unrestricted congruent packings. 2. A question raised by Sarnak and formulated as a conjecture in Chiu: whether, among unit-volume flat tori, height is minimized by a lattice maximizing the length of its shortest nonzero vector.

comments
12 pages
fields
Metric Geometry, Spectral Theory
pdf ↗ page arXiv:2607.11695 ↗

We characterize stability and its robustness for a class of boundary controlled, boundary observed hyperbolic partial differential equations. In particular, we show that asymptotic and exponential stability coincide for this class. Furthermore, we introduce the real and complex stability radii for which we give explicit formulas. In addition, we consider the dual system and its application to controllability and observability. Our main results are illustrated with two examples.

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

We determine the exact region $Ω_{β,φ,τ}= \{(β(C),φ(C),τ(C))\mid C\in\mathcal{C}\}$ of possible joint values of Blomqvist's beta, Spearman's footrule and Kendall's tau over the class $\mathcal{C}$ of all bivariate copulas. The region consists precisely of all triples $(β,φ,τ)$ satisfying $-1\le β\le 1$, $\frac{3}{16}(1+β)^2-\frac12\le φ\le 1-\frac38(1-β)^2$ and $\frac43 φ-\frac13\le τ\le \frac23 φ+\frac13$. In other words, the known exact $(β,φ)$- and $(φ,τ)$-regions already characterize the joint region, so that, once the value of Spearman's footrule is fixed, Blomqvist's beta imposes no additional restriction on the possible values of Kendall's tau. The proof is constructive: two $2$-parameter families of shuffles of $M$ realize all the points in $Ω_{β,φ,τ}$ with $φ= \frac{3}{16}(1+β)^2-\frac12$, and ordinal sums spread realizations of these two families over the whole region $Ω_{β,φ,τ}$.

comments
15 pages, 6 figures. v2: joint version with L. Ferbar Tratar, D. Kokol Bukovšek, B. Mojškerc and N. Stopar; title and abstract revised
fields
Statistics Theory
pdf ↗ page arXiv:2607.12841 ↗

We study the intrinsic right $q$-radial derivative at integral superdimension $M=m-2n$, using an independent formal parameter $Q$ before the specialisation $Q=q^M$. The exterior-blade action carries the parity factor $(-1)^{|I|}$, and the corresponding Fischer theory uses right multiplication. We establish finite-support compatibility, faithful coordinate realisations in a sufficient finite-block range, and localised Green and determinant-localised Fischer decompositions. For one vector, we determine the kernel and cokernel explicitly, including the additional singular monomial and missing image exactly when $M\in-2\mathbb N_0$. In degree zero the right Fischer operator is diagonal on auxiliary exterior blades, with eigenvalue $[M-p]_q+p$ at nonempty support rank $p$. For positive integral $M$, resonances in $0<q<1$ occur exactly at ranks $p>M$: each rank has one simple resonance, these values increase strictly with $p$, and the corresponding kernels and singular right-monogenic elements are explicit. The two-vector Fischer determinant is nonzero for positive $M$ and $0<q<1$.

fields
Complex Variables
pdf ↗ page arXiv:2607.14449 ↗

Stabilizer codes are often constructed within the Calderbank–Shor–Steane (CSS) framework, where two mutually orthogonal binary classical codes define $X$ and $Z$-type stabilizer generators. While this structure is algebraically convenient, additional non-CSS constraints may help suppress low-weight logical operators and improve decoding performance in the finite-length regime. We thus introduce quantum XYZ stabilizer codes, whose parity-check matrix (PCM) is built from three pairwise orthogonal binary PCMs associated with $X$-, $Y$-, and $Z$-type stabilizer generators. A nontrivial point is that an XYZ code instance is not automatically genuinely non-CSS: the same stabilizer group may admit a CSS generating set. We characterize this collapse, obtaining algebraic and rank conditions for deciding when the $Y$-type checks are redundant and when they define genuinely non-CSS stabilizer constraints. We also derive upper and lower bounds on the quantum minimum distance, including bounds for mixed Pauli logical operators. The novel framework includes a known non-CSS topological code, namely the XYZ$^2$ hexagonal code, and yields also sparse finite-length quantum low-density parity-check (qLDPC) constructions from intersecting-subset and quasi-dyadic code families. Simulations under depolarizing code-capacity noise and quaternary belief propagation decoding show that the proposed XYZ qLDPC instances can outperform representative CSS qLDPC instances with similar finite-length parameters.

fields
Information Theory
pdf ↗ page arXiv:2607.14988 ↗

Binary Iterative Hard Thresholding (BIHT) is a simple, yet effective, greedy method for recovering a sparse vector from one-bit sign measurements. In its original form, BIHT performs a ``gradient-descent'' step, followed by hard thresholding. A convergence analysis of this algorithm was left open in the introductory work of Jacques, Laska, Boufounos, and Baraniuk [IEEE Trans. Inform. Theory (2013)] and has remained unresolved for over a decade, with subsequent sharp analyses studying a normalized variant instead, that additionally projects every iterate onto the unit sphere. This paper resolves that gap and characterizes when per-iterate normalization is algorithmically necessary. In the noiseless setting, we prove a universal, sample-optimal convergence theorem for the original BIHT algorithm. Specifically, with $\widetilde O(s/ε)$ measurements, a deterministic, computable finite-time iterate has directional error at most $ε$, simultaneously for every $s$-sparse unit vector. This matches the optimal sample dependence achieved by normalized BIHT in prior work. Under sign corruptions, we prove a sharp separation. If at most a $τ$ fraction of signs are flipped adversarially, then BIHT, without per-iterate normalization, still reaches the robust error floor at an early iterate with a matching $\widetilde O(s/ε)$ sample complexity rate as its normalized variant. This recovery, however, is not stable. We prove a scalar lower bound showing that any nontrivial corruption pattern, even one that involves only one flipped sign together with one clean sign, forces the iterates to oscillate indefinitely. Consequently, no general last-iterate convergence theorem can hold for BIHT under sign corruptions, while its normalized surrogate provably escapes this instance.

comments
SODA 2027, to appear
fields
Information Theory, Statistics Theory
pdf ↗ page arXiv:2607.15530 ↗

We consider a four-field formulation of Biot's quasi-static model of consolidation with the (effective) elastic stress, the solid displacement, the fluid flux and the fluid pressure as unknown physical quantities of interest. The weak form of this system composed of the momentum and mass balance equations complemented by the stress-strain relation and Darcy's law yields a two-fold perturbed saddle-point problem. Its well-posedness is proven for a natural choice of inifinite-dimensional Hilbert spaces, where the displacement-flux pair is sought in a novel Hilbert space. Next, based on recent works on $H(\rm div \, \rm div)$-conforming finite elements, we propose a family of mixed-mixed finite element methods that preserve the angular momentum as well as the fluid mass balance pointwise, i.e., in a strong sense. We prove the well-posedness of the arising discrete problem and establish optimal a priori error estimates for the related family of fully conservative mixed-mixed finite element methods.

fields
Numerical Analysis
pdf ↗ page arXiv:2607.16418 ↗

We prove a conjecture of Lurie characterizing $(n+1)$-dualizability in higher Morita categories of $\mathbb{E}_n$-algebras in terms of dualizability over certain factorization homologies. A key ingredient is a higher Morita category based on the recently developed framework of pointless factorization algebras of Karlsson and the first author. We also verify an invertibility conjecture of Brochier–Jordan–Safranov–Snyder as an immediate corollary of our main result. Moreover, we prove a relative version of the dualizability conjecture, yielding a new criterion for relative/twisted field theories. We give some examples, including Dirichlet and Neumann relative theories.

comments
85 pages, comments welcome! Additions and changes in version 3: Broken links fixed
fields
Category Theory, Algebraic Topology, Quantum Algebra
pdf ↗ page arXiv:2607.16953 ↗

For every integer $d \geq 2$, we show that there exists an irreducible, reduced curve which embeds in $\mathbb{P}^d$ but in no projective normal toric variety of dimension less than $d$. In particular, there exist reduced irreducible curves that embed in $\mathbb{P}^d$ but do not embed in any weighted projective space of dimension less than $d$.

comments
11 pagges, v2: Minor revisions, to appear in Bull. of London Math. Soc
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2607.18475 ↗

Consider the Sachdev-Ye-Kitaev model with $N$ Majorana fermions and interaction order $q$. For even $4\leq q\ll \sqrt{N}$, we present a microscopic framework that determines the free energy limit at every fixed inverse temperature $β>0$. In particular, this gives the first rigorous derivation of the Schwinger-Dyson thermodynamics of the model. For all even $q\in \{4,6,...,N-4\}$, we further determine the asymptotic location of the largest eigenvalue, which answers a question posed by Feng-Tian-Wei \cite{FengTianWei1}. Consequently, we obtained the free energy limit along every sequence $β\equiv β_N\to\infty$.

comments
Generalized the results and streamlined the proof. 41 pages and 1 figure
fields
Mathematical Physics, Operator Algebras, Probability
pdf ↗ page arXiv:2607.18998 ↗

We explicit calculate the archimedean modular symbol for Rankin-Selberg convolutions of $\mathrm{GL}_n(\mathbb{C})\times\mathrm{GL}_n(\mathbb{C})$ and $\mathrm{GL}_n(\mathbb{C})\times\mathrm{GL}_{n+1}(\mathbb{C})$, for all generic cohomological representations.

comments
We made some corrections to the previous version
fields
Representation Theory
pdf ↗ page arXiv:2607.19133 ↗

Deep neural networks on manifold-valued representations have attracted growing interest, but many basic components remain tied to specific manifolds, rely on Euclidean approximations, or require costly and numerically fragile geometric operations. This thesis develops a unified framework for Riemannian deep learning from three complementary perspectives: reusable neural modules, manifold-specific network architectures, and the design of underlying geometries. It generalizes batch normalization from Euclidean spaces and individual manifolds to broad classes of Lie groups and gyrogroups, and extends multinomial logistic regression from Euclidean space to SPD manifolds and then to general Riemannian manifolds. It further develops neural networks for several important geometric representations, including an unconstrained model of hyperbolic space, Busemann-based hyperbolic learning, and full-rank correlation matrices. Finally, it introduces adaptive and computationally efficient Riemannian metrics on SPD manifolds, including learnable Log-Euclidean geometries and fast, stable Cholesky-based geometries. The proposed methods are supported by theoretical analysis and validated through numerical experiments and applications in vision, signal processing, graph learning, and genomics.

comments
PhD thesis manuscript, University of Trento; defense pending
fields
Differential Geometry
pdf ↗ page arXiv:2607.19305 ↗

In this paper we apply the newly developed theory of extended graphons to a certain class of non-exchangeable, non-conservative problems. We establish the mean-field limit by proving the convergence of the associated generalized weighted empirical measures.

comments
50 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2607.20014 ↗

We study the one-dimensional linear-potential system as an affine extension of the conformal triangle formed by the free particle, harmonic oscillator (HO) and inverted harmonic oscillator (IHO). Unlike these homogeneous quadratic Hamiltonians in the $sl(2,\mathbb R)$ sector, the linear-potential Hamiltonian involves the Heisenberg ideal of the Schrödinger algebra. Its direct relation to the free particle is a regular accelerated-frame transformation, developed here at the levels of the classical action, canonical transformation, wave-function intertwiner and propagator; its HO and IHO realizations instead arise through singular displaced-oscillator limits. The Airy energy eigenstates follow from a cubic-phase transform of free-particle momentum eigenstates, from condensation of highly excited harmonic-oscillator levels, and from the limit of a subdominant parabolic-cylinder scattering branch of the inverted oscillator. We also develop a planar extension in homogeneous crossed electric and magnetic fields, where uniform acceleration generates the electric interaction, while uniform rotation produces the Landau coupling and the centrifugal inverted-oscillator term; the guiding-center dynamics yields the Hall drift.

comments
15 pages, 1 figure. Minor corrections incorporated to agree with the published version in JHEP
journal
JHEP 10 (2026) 264
fields
Mathematical Physics
pdf ↗ page arXiv:2607.20711 ↗

A Legendre pair of length 333 would yield a Hadamard matrix of order 668, the smallest order presently unresolved by the Hadamard conjecture. We study the structured case in which both sequences are fixed by a common subgroup $H\leq(\mathbb Z/333\mathbb Z)^\times$ acting by coordinate multiplication. We prove that such a pair can exist only when $|H|\leq 6$. After a mod-3 compression reduces the problem to an order-108 kernel, there are exactly 30 subgroups. We exclude 21 of them, including all 19 subgroups of order at least 9. The final order-9 subgroup is eliminated analytically: its orbit structure restricts the 9-compressed entries to $\{\pm1,\pm17,\pm19,\pm35,\pm37\}$; the Legendre equations force a $+17,-17$ pair in one compressed sequence, and a single-shift autocorrelation bound then contradicts the required compressed correlation. The remaining exclusions use full-image compression, a row-sum congruence, exact meet-in-the-middle enumeration, and proof-carrying pseudo-Boolean encodings. The solver-assisted cases are accompanied by independently checked DRAT proofs or direct arithmetic certificates. The result constrains fixed common-multiplier symmetry only; the unrestricted existence problems remain open.

comments
12 pages, 3 tables; accepted for publication in Journal of Combinatorial Designs. Acceptance information added; manuscript unchanged
fields
Combinatorics
pdf ↗ page arXiv:2607.20765 ↗

In the paper we introduce vector-valued dynamic extended graphons in order to obtain the mean-filed limit for certain class of problems with adaptive weights. We impose fairly general assumptions on the matrix of initial connections, which allows us to cover the case of sparse graphs.

comments
49 pages
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2607.21110 ↗

In this paper, we study a prototype hyperbolic system arising from the coupling of Generalized-Lagrangian-Multiplier (GLM) curl-cleaning with linear acoustics. We first show that, in the absence of dissipation, the equations can be rigorously derived from an underlying variational principle and that the resulting system is symmetric-hyperbolic. Further analysis shows that it not only conserves the total energy but also admits a set of invariants consisting of quadratic combinations of differential operators applied to the state variables. The addition of a stiff relaxation source term allows the system to be extended to dissipative dynamics, describing, for example, Cattaneo-type heat transfer processes that are asymptotically compatible with the Fourier law in the stiff relaxation limit; in this case, the total energy and invariants are dissipated accordingly. A new semi-implicit compatible numerical scheme on staggered grids is developed to solve this system while exactly preserving its key properties at the discrete level. In particular, we prove that the scheme is asymptotic-preserving in the Fourier limit, with a convergence rate depending on the initial data. We also show that the scheme conserves exactly the total energy as well as all the invariants in the absence of relaxation, and dissipates them consistently in its presence. These findings are demonstrated on a set of representative test cases.

fields
Numerical Analysis
pdf ↗ page arXiv:2607.22151 ↗

Given rearrangement-invariant (r.i.) spaces $X$ and $Y$, we show that the segment multiplier, the truncated Hilbert transform, and the discrete Hilbert transform (on the associated discretized space) are bounded from $X$ to $Y$ simultaneously. Moreover, when $X = Y$ this boundedness is characterized by a condition on a pair of Boyd-type indices. We also exhibit an r.i. space on which the segment multiplier is bounded while the (non-truncated) Hilbert transform fails to be bounded.

comments
22 pages
fields
Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2607.22277 ↗

We define a coupling product and a draw coproduct on permutations and show that they define a graded, connected, cocommutative, free Hopf algebra $\mathbb{KS}$. In characteristic zero, this implies that $\mathbb{KS}$ is isomorphic to a certain cocommutative Hopf algebra associated with the dual of the coradical filtration of the Malvenuto–Reutenauer Hopf algebra on permutations. The coupling product and draw coproduct are permutation analogues of the product and coproduct on the monomial basis of symmetric functions; therefore, we can say that our presentation is a monomial basis for $\mathbb{KS}$.

comments
16 pages (To appear in Canadian Math Bull) clarified some details and proofs. No major changes
fields
Combinatorics, Rings and Algebras
pdf ↗ page arXiv:2607.23345 ↗

We prove that every $(P_2\cup P_3)$-free graph $G$, with $k=ω(G)$, satisfies \[ χ(G)=O\!\left(k^3\frac{\ln\ln k}{\ln k}\right). \] Thus the class admits an $o(k^3)$ binding function. We also prove the explicit bound \[ χ(G)\le \frac{k^3}{8}+\frac{5k^2}{4}-4k+8 \qquad(k\ge8), \] with a sharper formula for odd $k$. A further refinement gives an explicit cubic bound with leading coefficient $104/837<1/8$.

comments
16 pages. Proofs simplified and exposition revised. Main results unchanged. The earlier row estimates and the quadratic bound under a rank-gap condition are not reproduced here; see v3 for those results
fields
Combinatorics
pdf ↗ page arXiv:2607.23441 ↗

Motivated by the Onsager statistical mechanics description of turbulent Euler flows with point singularities, we refine the blow up analysis for sequences of solutions of a class of perturbed singular Liouville equations which share the phenomenon of ``blow up and concentration without quantization". The problem is delicate because we are dealing with the exact threshold value above which one meets the well known ``concentration without quantization" phenomenon, as recently pushed forward in [C.S. Lin, G. Tarantello, {\em C. R. Math. Acad. Sci. Paris} (2016)] and in [Y. Lee, C.S. Lin, G. Tarantello, W. Yang, {\em Comm. PDE.} (2017)]. We overcome these difficulties by developing different strategies for ``fast" and ``slow" blow up, combining refined Pohozaev identities, elliptic estimates and ``Sup+CInf" inequalities in the same spirit of [C.C. Chen, C.S. Lin, {\em Comm. An. Geom.} (1998)]. In the process, we also derive a new sharp Harnack type inequality by using a moving-plane method, following the ideas in [D. Bartolucci, C.C. Chen, C.S. Lin, G. Tarantello, {\em Comm. P.D.E.} (2002)].

comments
42 pages. Compared with the previous version, we have reorganized the paper, ruled out the possibility $λ_\infty=16π$ in CASE (I) of Theorem 3.1 and made minor simplifications and clarifications to some of the proofs to improve their readability. Moreover, we have added a section on the use of artificial intelligence. Comments are welcome!
fields
Analysis of PDEs
pdf ↗ page arXiv:2607.24346 ↗

For a permutation of a finite set, we define a landscape by summing a discounted weight over the times each point returns to itself. The landscape value is determined by the point's least period. We relate the trace of the associated resolvent to fixed-point and exact-period counts, and show that the associated determinant is the reciprocal of the Artin-Mazur dynamical zeta function. We apply this framework to the discrete cat map modulo $N$. For every prime $p\ne5$, all nonzero points have period equal to the order of the cat-map matrix modulo $p$, yielding explicit formulas for the landscape trace and determinant. We prove a period-lifting formula at odd primes $p\ne5$, derive exact fixed-point and period counts modulo $5^a$, and combine prime-power results for composite moduli using the Chinese remainder theorem.

comments
15 pages, 6 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2607.24857 ↗

We show that several categories of hyperstructures, including the mosaics of Nakamura and Reyes and the hypergroups of Marty, are realizable as categories of objects with extra structure within the category of complete atomic Boolean algebras (CABAs) and atom-preserving morphisms.

fields
Category Theory, Rings and Algebras
pdf ↗ page arXiv:2607.25165 ↗

Let $Y$ be a cubic 7-fold. When $Y$ is smooth, its Kuznetsov component is a Calabi-Yau category of dimension 3, and we construct an embedding of the Kuznetsov component into the derived category of Clifford modules over $\mathbb{P}^4$. When $Y$ is a general cubic 7-fold singular along a line, we construct an explicit weakly crepant categorical resolution of its Kuznetsov component by the derived category of a smooth Calabi-Yau 3-fold, recovering a result of Favero-Kelly. In this construction, we express the resolution functor explicitly as a composition of geometric functors and mutations, and identify its kernel with a category equivalent to a pull-back of the derived category of a stacky curve.

comments
23 pages, 5 figures. Comments are welcome. v2: Correction of some computations and statements; added a discussion of overlap with previous work
fields
Algebraic Geometry
pdf ↗ page arXiv:2607.28784 ↗

We develop a unified framework for analyzing the complexity of quantum property testing through functionals of the form $\mathcal{L}_φ(ρ) = \operatorname{tr}(φ(dρ))/d$, where $ρ$ is an unknown $d$-dimensional quantum state and $φ$ is a given function. A master theorem is established that derives sample complexity lower bounds for estimating $\mathcal{L}_φ(ρ)$ from properties of $φ$, combining Haar-random moment encoding with moment matching and best polynomial approximation. Corresponding query complexity lower bounds follow from quantum sample-to-query lifting. The framework yields (nearly) tight bounds for a broad class of problems, including entropy estimation (von Neumann, Rényi, and Tsallis), closeness estimation (trace distance and Uhlmann fidelity), spectrum estimation, rank testing (operator rank, Schmidt rank, and matrix product states). In particular, combined with known upper bounds, we show that the sample complexity of von Neumann entropy estimation is \[ Θ\!\left(\frac{d^2}{\varepsilon\log^2(d)\max\{1, \varepsilon\log^2(d)\}} + \frac{\log^2(d)}{\varepsilon^2}\right), \] and the sample complexity of spectrum estimation is \[ Θ\!\left(\frac{d^2}{\varepsilon^2\log^2(d)\max\{1, \varepsilon^2\log^2(d)\}}\right). \] In summary, our results resolve several open problems and establish the optimality of 37 quantum algorithms since 2015, up to constant or polylogarithmic factors.

comments
48 pages, 2 tables. More optimality mentioned; Hellinger distance added back. v3: Schmidt rank & MPS testing added; Hellinger distance removed. v2: Renyi/Tsallis entropy, rank testing, Hellinger distance added. v1: fidelity, trace distance, von Neumann entropy
fields
Information Theory
pdf ↗ page arXiv:2608.02600 ↗

Let $\mathbb{Z}^-=\{-1,-2,\dotsc\}$ and $\mathbb{N}=\{1,2,\dotsc\}$. In 2023, Qi and Lim gave two claims for summing the infinite series $\sum_{k=1}^{\infty}\binom{2k}{k}\frac{1}{α+k}\bigl(\frac{\pm1}{4}\bigr)^k$ for $α\in\mathbb{C}\setminus\mathbb{Z}^-$. In this paper, we confirm these claims by expressing the infinite series $\sum_{k=1}^{\infty}\binom{2k}{k}\frac{1}{α+k}\bigl(\frac{z}{4}\bigr)^k$ and the finite series $\sum_{k=1}^{n}\binom{2k}{k}\frac{1}{α+k}\bigl(\frac{z}{4}\bigr)^k$ in terms of the Gauss hypergeometric function ${}_2F_1\bigl[\tfrac12,α;1+α;z\bigr]$ and a generalized hypergeometric function ${}_3F_2$, for $|z|\le1$ and $n\in\mathbb{N}$. Using the Euler integral representation, we derive closed forms, in terms of finite sums of sines and cosines of $\arcsin\sqrt{z}\,$, for ${}_2F_1\bigl[\tfrac12,\tfrac12+n;\tfrac32+n;z\bigr]$, ${}_2F_1\bigl[\tfrac12,1+n;2+n;z\bigr]$, two related ${}_3F_2$ functions, and the incomplete beta functions $B_z\bigl(\frac12+n,\frac12\bigr)$ and $B_z\bigl(1+n,\frac12\bigr)$. By the Pfaff transformation, we obtain closed forms of several further Gauss hypergeometric functions with parameters shifted by $n$. We also give a closed form of $\bigl[(1-z)\frac{\operatorname{d}}{\operatorname{d}z}(1-z)\bigr]^n\frac{\arcsin\sqrt{z}\,}{\sqrt{z(1-z)}\,}$ and a combinatorial identity.

comments
20 pages
fields
General Mathematics
pdf ↗ page arXiv:2608.05193 ↗

We establish new bounds on colorful Helly and Tverberg numbers in abstract convexity spaces with Radon number $r$. We show that the colorful Helly number is at most $(r-1)2^r$, improving Holmsen–Lee's bound $r^{r^{O(\log r)}}$ and matching the known lower bound $2^{r-1}-1$ up to a factor $O(r)$. Furthermore, we prove that the Tverberg number is $r_k=O(r^{\lceil \log_2 r\rceil }k)$, reducing Pálvölgyi's coefficient $r^{r^{r^{O(\log r)}}}$ to a quasipolynomial function of $r$. For $S_4$-separable spaces, we prove $r_k=O(r^2k)$. In the other direction, we construct a sequence of $S_4$-separable spaces with Tverberg number $r_k=Ω(r^2k)$. This shows that the weak Eckhoff conjecture, asserting that $r_k=O(rk)$ in any abstract convexity space, fails already in separable spaces. The same construction refutes the analogue of Reay's conjecture in separable spaces.

comments
30 pages, 3 figures. New over v2: Tight upper bound for Tverberg numbers in S_4 spaces
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2608.06437 ↗

Leveraging the neural architectures which we introduced in arXiv:2109.13512v4, we show a global universal approximation theorem in the topology of $L^p(μ)$, where $1\le p<\infty$ and $μ$ is a Radon probability measure on a suitable infinite dimensional topological space $\mathfrak X$. Namely, any function $f:\mathfrak X\to \mathbb R$ in $L^p(μ)$ can be approximated to any degree of accuracy by suitable infinite dimensional architectures. These architectures can be in turn approximated by almost classical neural networks which are specified by a finite number of parameters only. The vectorial case (where $f=f(x)\in E$ and $E$ is a Banach space) is also considered and analogous results are obtained.

fields
Functional Analysis
pdf ↗ page arXiv:2608.08230 ↗

Let $X$ be a smooth, projective, connected variety over a field $k$ containing a root of unity of order $p$. If $X$ has a Chern number prime to $p$, we show that every finite $p$-group acting on $X$ acts through a subgroup of $\operatorname{GL}_n(k)$, where $n=\dim X$. This allows one to transfer properties of representations of finite $p$-groups to their actions on $X$. We deduce a fixed-point theorem which, unlike earlier results of this kind, is sensitive to the arithmetic of the base field, and whose dimensional bound is sharp for each individual group (apart from one low-dimensional case when $p=2$). We also obtain restrictions on finite $p$-groups of birational automorphisms of rationally connected varieties; for instance the Cremona group $\operatorname{Cr}_n(\mathbb{Q})$ contains no element of order $p^2$ when $p \ge n+2$. More generally, we prove variants of these results in the presence of a Chern number not divisible by a given power of $p$. The method is based on the following observation about the essential $p$-dimension $\operatorname{ed}_p(G)$ of an affine algebraic group $G$: over a field of characteristic zero, the number $\operatorname{ed}_p(G) + \dim G$ is the least dimension of a smooth projective variety $Y$ with a generically free $G$-action such that the degree map $\operatorname{CH}_G(Y) \to \mathbb{F}_p$ from the equivariant Chow group is nonzero. The Chern numbers modulo $p$ of $Y$ lie in the image of this map; combined with Karpenko and Merkurjev's computation of the essential $p$-dimension of finite $p$-groups, this yields our results.

fields
Algebraic Geometry
pdf ↗ page arXiv:2608.08877 ↗

We investigate core quandles and idempotents in quandle rings of core quandles. We answer several questions on the rank of core quandles and nontrivial idempotents in quandle rings. We also present solutions to two questions raised in a recent paper about non-trivial idempotents in quandle rings $\mathbb{Z}[R_5]$ and $\mathbb{Z}[C_5]$, where $\mathbb{Z}$, $R_5$ and $C_5$ are the ring of integers, the dihedral quandle of order 5, and the commutative quandle of order 5, respectively. We then study units in extended quandle rings of a trivial quandle and the Joyce quandle, and nilpotent elements in extended quandles rings of a trivial quandle, where the ground ring is an integral domain. As a consequence, we show that the quandle ring and the extended quandle ring of a trivial quandle are not nil clean rings. We also explore prime rings and semi-prime rings among quandle rings. We introduce zero-divisor graphs of quandle rings and find an intriguing mirror symmetry among the in-degree and out-degree of the vertices. Moreover, we find a bivariate polynomial in the ring $(\mathbb{Z}_{2n+1}[Q])[X,Y]$ that determines the commutative quandle of order $2n+1$, where $2n+1$ is prime.

comments
34 pages, some computational errors in Section 4 are corrected
fields
Rings and Algebras
pdf ↗ page arXiv:2608.09149 ↗

Given a finite group G, we develop a generalization of the fundamental classification of Rokhlin G-actions on C*-algebras to the setting of anomalous G-actions with the Rokhlin property. For Rokhlin G-kernels on C*-algebras covered by the classification program, this implies that the induced G-action on some known invariants determines the conjugacy class. Extending a result of Izumi, we show that G-kernels with the Rokhlin property on Kirchberg algebras are classified by their anomaly and the induced module structure on the K-theory groups. We explore K-theoretic obstructions for the existence of Rokhlin G-kernels on general separable C*-algebras and use these to characterise which G-module structures arise as K-groups of Kirchberg algebras admitting a Rokhlin G-kernel with a given lifting obstruction.

comments
43 pages, minor changes in the introduction to improve the exposition
fields
Operator Algebras
pdf ↗ page arXiv:2608.09517 ↗

Let $(M,g)$ be a smooth orientable $2d$ Riemannian manifold of genus $\mathfrak{g}$ with Riemannian metric $g$ and connected boundary $Γ$. Let $Λ$ be the Dirichlet-to-Neumann map on $Γ$ and let ${\rm det}_ζ(Λ)$ be its (modified, i. e. with zero mode excluded) $ζ$-regularized determinant. It is well-known that the quantity ${\rm det}_ζ(Λ)/|Γ|$ (where $|Γ|$ is the length of $Γ$) is a conformal invariant. It was shown by Edward and Wu (\cite{EV}) that this invariant equals one for $\mathfrak{g}=0$; in the case $\mathfrak{g}>0$ Guillarmou and Guillopé \cite{Guillarmou} found two explicit expressions for this invariant through the Rouelle and (respectively) the Selberg zeta-functions of the two surfaces of negative constant curvature from the conformal class of $(M,g)$: one is of infinite volume and complete whereas another has geodesic boundary. We present an elementary counterpart of the formulae of Guillarmou and Guillopé using the periods of holomorphic differentials on the double $2M$ of $M$ only. Our approach is based on the properties of the Hilbert transform of $M$ \cite{B,HilbKor} and the Kontsevich-Vishik-Friedlander-Guillemin regularization of the determinants of pseudodifferenial operators \cite{KV,Ww,F}. In particular, a connection between the length spectra of (uniformized) $M$, $2M$ and the periods of holomorphic differentials on $2M$ is established.

comments
Lemma 1 is substantially simplified
fields
Mathematical Physics, Differential Geometry, Spectral Theory
pdf ↗ page arXiv:2608.09737 ↗

Given a sequence $\mathfrak{a}:=(a_1,\ldots,a_n)$ of reals, a subsequence $\mathfrak{b}=(a_{i_1},\ldots,a_{i_k})$ is said to be "caged" if the largest and smallest among the members of $\mathfrak{b}$ are $a_{i_1}$ and $a_{i_k}$, though not necessarily in that order. In this paper, we consider the problem of maximal caged sequences in permutations $π\in S_n$. We also consider the same problem for a random permutation, both when the permutation is chosen uniformly at random and also when it is picked uniformly at random from among the permutations of rectangular shape, via the RSK correspondence. We also give a $O(n\log n)$ time algorithm to obtain these maximal caged sequences. In addition, we propose a randomized linear time algorithm that gives the length of the maximal caged sequence up to the factor of $(1-o(1))$.

fields
Combinatorics
pdf ↗ page arXiv:2608.09770 ↗

The barren plateau (BP) phenomenon poses a fundamental challenge to the trainability of variational quantum eigensolvers (VQEs) by causing exponentially vanishing gradients as the system size increases. While extensive studies have investigated the geometric origins of BP, its impact on the optimization dynamics and complexity of practical algorithms under finite-shot measurements has received comparatively less attention. In this paper, we develop a theoretical framework that characterizes how the BP affects the optimization dynamics of the Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm and quantifies the resulting iteration complexity and measurement budget. We derive non-asymptotic bias and variance bounds for the SPSA gradient estimator, introduce a signal-to-noise ratio (SNR) defined as the ratio of the gradient energy to the mean squared error of the estimator, and establish convergence guarantees for SPSA under finite-shot measurements. Our results show that, under the proposed parameter schedules, the number of iterations sufficient to guarantee a fixed relative first-order stationarity level scales polynomially with the inverse of the intrinsic gradient energy. Consequently, when this energy decays exponentially under BP, the resulting guaranteed iteration complexity and total measurement budget both grow exponentially with the number of qubits.

fields
Optimization and Control
pdf ↗ page arXiv:2608.09810 ↗

Can excitation structure classify topological quantum codes up to finite-depth local circuits? For translation-invariant topological Calderbank–Shor–Steane (CSS) codes in arbitrary dimensions, we introduce excitation superselection profiles $\mathscr E_σ$ ($σ=X,Z$). Their cohomology layers $E_σ^\ell:=H^\ell(\mathscr E_σ)$ encode excitation types, fusion rules, and translation action, while $\mathscr E_σ$ retains cross-degree gluing. Pointlike, looplike, and higher-dimensional excitations correspond to degrees $\ell=1,2,\ldots$, respectively. Our matrix-level Schanuel-lemma method proves single-degree superselection rigidity: if $\mathscr E_σ$ is supported in a single degree $\ell$, then $E_σ^\ell$ and $\ell$ fix the stable translation-invariant Clifford class under a finite-resolution hypothesis automatic for prime qudits. If $E_σ^\ell$ is also finite, prime-qudit codes decouple into toric-code stacks by Clifford circuits after coarse graining, with the exact minimal threshold set by the translation kernel. We develop a unified topological theory of Koszul-complex models (encompassing toric codes, bivariate-bicycle codes, and Haah's cubic code): for regular models, we compute $E_σ^\ell$, prove $\mathscr E_σ$ is single-degree, express finite-torus logical modules as $\mathrm{Tor}$ groups, and obtain coarse-grained toric-stack normal forms at full length. Two constructions extend this framework to realize any admissible single-degree profile and build multi-degree extensions. The latter yields eight 3D qubit toric-code extensions with identical layers in both Pauli sectors and trivial translation action, yet distinct size-dependent ground-state degeneracies. The seven nonsplit models require blocking to decouple. Thus, cross-degree gluing carries translation-symmetry-enriched topological information invisible to individual layers.

comments
37 pages, 4 figures, 2 tables. v2: updated title, added one figure and references
fields
Mathematical Physics
pdf ↗ page arXiv:2608.09913 ↗

We provide a fairly simple list of conditions on a group $G$ acting acylindrically on a $δ$-hyperbolic metric space sufficient for the group to admit an action on a set that is $k$-sharp, transitive on $k$-sets and has the property that for any $k$-set $A$ the setwise stabilizer of $A$ acts on $A$ as prescribed by some fixed subgroup of the group of permutations of $k$ elements. In particular, this yields a large class of non-split sharply $2$ and $3$-transitive actions containing many finitely presented groups, and allows us to characterize sharp $2$-transitivity within the class of hyperbolic groups that do not contain a copy of $C_{2}\times C_{2}$.

fields
Group Theory
pdf ↗ page arXiv:2608.10114 ↗

Consider the two-dimensional semiclassical Schrödinger operator $P_\hbar=-\frac{\hbar^2}{2}Δ+V$ on $\mathbb R^2$, where $V$ has a nondegenerate well at the origin, its harmonic frequencies are rationally independent, and $V$ is $\mathbb Z_2$-symmetric. We prove that, generically, the first three layers of the quantum Birkhoff normal form (QBNF) determine the full Taylor series of $V$ at the origin, up to the unavoidable spatial inversion $V(x)\mapsto V(-x)$. The generic condition depends only on the jet of $V$ through order ten. Consequently, for real analytic potentials with a unique isolated global well at the origin, the low-lying semiclassical spectrum generically determines $V$ up to spatial inversion.

comments
33 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2608.11111 ↗

In information theory, the data processing inequality is a fundamental property that describes the loss of information through noisy channels. A more refined description is given by the strong data processing inequality (SDPI) for a fixed channel and a full-rank reference state. In classical information theory, the strong data processing inequality tensorizes for a large family of $f$-divergences. However, its quantum counterpart remains largely unexplored. Tensorization of SDPI has previously been shown only for some special cases, and whether it holds more generally for quantum divergences still remains open. In this work, we report two negative results: the tensorization property fails for certain quantum chi-square divergences, and it also does not hold for the quantum relative entropy.

fields
Mathematical Physics
pdf ↗ page arXiv:2608.13204 ↗

We are interested in the following conjecture of Wilson from 1981: every locally nilpotent countably categorical group is nilpotent. Following our previous work on the Lie algebra analogue of the conjecture, we use Lie methods to deduce the first nontrivial cases of the Wilson conjecture for n-Engel groups: countably categorical 3-Engel groups and 4-Engel 5-groups are nilpotent, from which we also conclude that countably categorical 4-Engel groups of odd exponent are nilpotent. This is implemented via an exceptional case of the Lazard correspondence, checked using computer algebra systems. We also study the transfer of nilpotency results between the three categories: groups, Lie algebras, associative algebras. Among other things, we prove that the Wilson conjecture implies the analogous nilpotency statement for associative algebras (modulo the commutative case).

fields
Group Theory
pdf ↗ page arXiv:2608.15664 ↗

We study nondegenerate equilateral triangles whose vertices are centroids of the $4^n$ order-$n$ floretion tiles. Scaled integer triangular coordinates give exact equilateral completions and, by an obstruction modulo $3$, show that all three vertices have the same tile orientation. In particular, the complete triangle family and its synchronized local cyclic subfamily have respective sizes $|E_n|=\frac{4^n(4^n-1)}{12},\quad |L_n|=\frac{7^n-4^n}{3},$ so the local proportion tends to zero. Our principal new result answers the radial-homogeneity question left open in the preceding revision: for every order, the number of triangles containing a given tile is given by an exact affine formula in its squared scaled centroid radius. Although the two tile orientations have different formulas, their attainable squared radii belong to disjoint residue classes modulo $3$, yielding a single radial-incidence law on the full centroid set. We also determine local and nonlocal vertex incidences and obtain circular-shell and squared-radius moment identities. The unsigned vertex product defines an algebraic product point. By a rigidity theorem of Ma and Zhang, the multiplication-generated triangles are precisely the nontrivial global cyclic orbits; combining this with our geometric shell classification, we show that the product point is the origin exactly when the Euclidean triangle center is the origin. Further results enumerate central-vertex, no-$e$, and main-axis families, derive Fibonacci and finite-state recurrences for product-centered and reflection-restricted classes, and characterize pairwise anticommutation.

comments
72 pages, 5 figures, 8 tables. Sequel to arXiv:2605.20265. Version 5 adds an exact radial-incidence theorem, circular-shell and squared-radius moment identities, and further incidence enumerations; incorporates the Ma--Zhang multiplication rigidity theorem with attribution; and expands related proofs and OEIS references
fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2608.15925 ↗

We prove interior $C^{1,α}$ regularity for globally bounded weak solutions to the fractional $p$-Laplace equation $(-Δ_p)^s u=0$ under the assumptions $n\ge2$, $1<p<2$, $0<s<1$, and $sp>p-1$, where $α=α(n,p,s)>0$. This resolves the open problem of gradient Hölder continuity for globally bounded solutions in the singular range $sp>p-1$. The proof is based on affine approximation and estimates independent of the normalized affine slope. When these slopes tend to infinity, we prove convergence to a solution of a linear nonlocal equation of order $sp-p+2$, together with convergence of the normalized energies to the corresponding quadratic energy. The regularity of the limiting equation yields an improved affine approximation. For bounded slopes, we prove that every globally Lipschitz weak solution of $(-Δ_p)^s u=0$ in $\mathbb R^n$ is affine and use this result in a compactness argument. The two estimates are combined in an iteration that preserves the required energy and tail bounds and gives Hölder continuity of the gradient.

fields
Analysis of PDEs
pdf ↗ page arXiv:2608.16243 ↗

Radial clipping does two things at once: it cuts off the part of a vector outside a ball and leaves a bounded vector inside the ball. The part cut off defines the residual. For a random vector, we study the magnitude of the bias in the mean and the energy, defined as the centered second moment of the clipped vector. Controlling these effects is important in stochastic optimization with heavy tails, where the choice of the clipping threshold affects convergence bounds for algorithms. In the deterministic problem, for a fixed threshold $τ>0$, $1\le p\le2$, and nonnegative coefficients $α,β$, we find the smallest constant that simultaneously bounds the residual and energy in terms of $\lVert x\rVert^p$. This same constant remains sharp in the stochastic counterpart for random vectors in a Hilbert space. We also find the exact supremum of the corresponding linear combination of normalized bias and energy for arbitrary $α,β\in\mathbb R$. We then give a geometric picture in the energy-bias plane. Varying the weights, we describe the smallest closed convex region containing all normalized pairs and the attainable set itself, identifying unattainable boundary values. Every attainable pair at a fixed threshold can be realized by a real-valued random variable taking at most two values. We also consider all thresholds simultaneously. For any integrable random vector in a Hilbert space, we construct a single $\mathbb R^3$-valued random vector preserving its norm distribution, bias magnitude, and energy simultaneously at every threshold $τ>0$. Finally, we apply the joint bound to risk-adjusted reinsurance costs for a prescribed retention threshold and to the logarithmic shortfall of a clipped portfolio strategy relative to any constant-fraction strategy. AI was used in preparing this paper (see Section 8).

comments
61 pages, 14 figures (7 in each language). Complete English version followed by Russian version. Revised and expanded; includes simultaneous three-dimensional realization for all thresholds and two applications
fields
Probability
pdf ↗ page arXiv:2608.18999 ↗

Most modern optimizers form their momentum as an exponential moving average (EMA) of past gradients, forgetting every direction at one fixed rate. However, the inputs a deep network sees during training can be highly anisotropic, with a few directions queried frequently while most are seen rarely. Preconditioning methods address this anisotropy by wrapping extra processing around this buffer and leave the momentum update itself unchanged. We propose Activation-Keyed Momentum (AK-Momentum), which builds direction-awareness into the momentum update rule. The gradient of a linear layer splits into an input activation that acts as a $\textit{key}$ and an output-side error that acts as a $\textit{value}$. Keying on that activation, AK-Momentum updates the momentum buffer by the canonical delta rule, so each direction is forgotten at a rate set by how often it appears. We prove that it is a valid momentum, that it applies the input-side curvature correction without matrix inversion, and that it clears stale directions faster than EMA under both a fixed and a drifting optimum. It is a drop-in replacement for the momentum buffer of any optimizer, its coefficient transfers across widths under $μ$P, and its extra compute stays between $22.2\%$ and $25.0\%$ of a gated-MLP block's linear cost with no persistent memory. In FineWeb-Edu pretraining, AdamW with AK-Momentum (AK-AdamW) reaches AdamW's validation loss in up to $46.64 \pm 4.52\%$ fewer steps at 67M and $22.14 \pm 0.81\%$ at 370M over three seeds, and the gain persists at 1B on a Chinchilla-optimal budget. A Muon baseline tuned under the same protocol sits above AK-AdamW at both language-model scales, and the gain holds for SGD, ResNet-18, and ViT-Tiny on CIFAR-10. Training-time diagnostics confirm the predicted mechanism, better gradient tracking and healthier input directions. Code is available at https://github.com/euijinh/AK-Momentum.

comments
This version (v3) is the camera-ready version accepted at NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2608.19491 ↗

We introduce Lagrange functions associated with height and distance-squared functions on implicit plane curves. We show that degeneracies of these functions characterize geometric properties of the curves, such as inflections and vertices, and give geometric interpretations of the corresponding Lagrange multipliers in terms of contact with lines and circles.

fields
Differential Geometry
pdf ↗ page arXiv:2608.19517 ↗

In this survey article, we give an introduction to the relatively young subject of $2$-representation theory, which studies categorifications of important players in classical representation theory. In particular, we provide a streamlined exposition of the main results leading to the classification of simple $2$-representations for Soergel bimodules associated to finite Weyl groups in characteristic $0$, obtained in [M. Mackaay, V. Mazorchuk, V. Miemietz, D. Tubbenhauer and X. Zhang, Simple transitive $2$-representations of Soergel bimodules for finite Coxeter types. Proc. London Math. Soc. 126 (2023)].

comments
survey article for Proceedings from ICRA 2024
fields
Representation Theory, Category Theory
pdf ↗ page arXiv:2608.19830 ↗

In this note, we prove a priori interior curvature bounds for convex solutions to an elliptic Weingarten curvature quotient equation. The proof avoids integral estimates, doubling inequalities and compactness arguments. It relies on a concavity inequality for the equation operator and a novel choice of the auxiliary function to carry out an elementary maximum-principle argument. As an application, we obtain interior curvature bounds for convex solutions of a prescribed special Lagrangian curvature equation in dimensions three and four.

comments
v3: title changed; the introduction revised; multiple typos were fixed throughout the manuscript; to appear
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2608.20188 ↗

We construct a real meromorphic function $F$ on $\mathbb C$ such that $F^{-1}(\{0,1,\infty\})\subset\mathbb R$, while $F$ is not of bounded type in either half-plane. More strongly, for every $a\in\widehat{\mathbb C}\setminus\{0,1,\infty\}$, the $a$-point divisor in either half-plane fails the Blaschke condition. Thus the construction gives a negative answer to the half-plane bounded-type question arising from Nevanlinna's 1925 work. Postcomposition gives the analogous counterexample for any prescribed triple of distinct values in the Riemann sphere. The core construction and proof were generated during an autonomous run of GPT-5.6 Sol Ultra.

comments
This paper will not be submitted to a journal. The main theorem (Theorem 1.2) has been formalized in Lean 4 and registered with Palomar: https://palomar-registry.org/entry?id=PALOMAR-2026-10-29-000014&version=1
fields
Complex Variables
pdf ↗ page arXiv:2608.26062 ↗

We prove the multivariable Strong Monodromy Conjecture for the local topological zeta function of arbitrary tuples of nonzero nonunit plane curve germs. The entries may be nonreduced and may have common irreducible factors. We also prove that the non-equivariant local motivic and topological zeta functions have the same polar locus and generic pole orders, using a multivariable extension of the Nicaise–Xu definition of motivic pole order. Our arguments combine twisted Poincaré residues with resolution formulas and specialization to one variable. In arbitrary dimension, we prove that a nonzero iterated residue class on a stratum of a log resolution implies the vanishing of the Bernstein–Sato ideal at the corresponding parameter. In particular, every topological polar hyperplane whose order equals the ambient dimension is contained in this zero locus. For algebraic germs, the topological pole order is at most the motivic pole order, and the two attain maximal order simultaneously.

comments
v3: 56 pages; v4: references updated
fields
Algebraic Geometry
pdf ↗ page arXiv:2608.26087 ↗

Let $f,g:\mathbb{N}\to\mathbb{T}$ be completely multiplicative functions with dense images in the complex unit circle $\mathbb{T}$. We prove that, for every non-empty open set $U \subset \mathbb{T}^2$, the set of integers $n$ such that $(f(n),g(n+1)) \in U$ has positive upper logarithmic density, unless the pair $(f,g)$ is of a special form. This result strengthens earlier theorems of Klurman and Mangerel, as well as of Charamaras, Mountakis, and Tsinas, and yields simpler proofs.

comments
The hypothesis in the statement of Theorem 1.1 has been modified. We thank I. Kousek for pointing out a counterexample that led to this correction
fields
Number Theory
pdf ↗ page arXiv:2608.26814 ↗

We develop $L^1$ bounds for the difference between a test function of a random sum and a standard normal random variable, where the summands are assumed to be independent but not necessarily identically distributed. The bounds are obtained through a new version of the approximate zero bias transformation specifically developed for random sums. Although the identical distribution assumption is relaxed, the bounds are of order $1/\sqrt{n}$, matching the order of existing bounds in the literature under the same distributional assumption on the number of summands. The main results are then applied to three real-world settings: random sums obtained from simple random sampling with outliers, total insurance claims, and generative AI response times.

comments
25 pages
fields
Probability
pdf ↗ page arXiv:2608.27143 ↗

Let $K$ be a number field and $A,B,C\in\mathcal{O}_K\setminus\{0\}$. Put $S_K=\{\mathfrak{P}:\mathfrak{P}\mid2\}$ and $S_K'=\{\mathfrak{q}:\mathfrak{q}\mid2ABC\}$. We establish two criteria for the non-existence of non-trivial solutions of $Ax^p+By^p=Cz^p$ over $K$ for sufficiently large prime exponents $p$. Both criteria use a valuation bound on the $S_K'$-unit equation at a fixed $\mathfrak{P}\in S_K$. The first excludes all non-trivial solutions in $K^3$ when $v_{\mathfrak{P}}(A)=v_{\mathfrak{P}}(B)=m$ and $v_{\mathfrak{P}}(C)=m+k$, with $k>4v_{\mathfrak{P}}(2)$. The second, under an explicit nonvanishing condition on the coefficient valuations, excludes solutions $(a,b,c)\in(K^\times)^3$ whose $\mathfrak{P}$-valuations are not all equal. In particular, it excludes non-trivial primitive integral solutions with $\mathfrak{P}\mid abc$. Neither criterion restricts the residue degree of $\mathfrak{P}$. Both criteria hold unconditionally over every totally real field; over general number fields, we assume residual modularity and Eichler–Shimura-type conjectures. The first criterion covers a new coefficient range. In particular, under the corresponding $S_K$-unit bound, $x^p+y^p=2^rz^p$ has no non-trivial solutions in $K^3$ for each fixed $r\geq5$ and sufficiently large prime $p$. This bound holds for a set of real quadratic fields of relative density $1$. For a family of imaginary quadratic fields of relative density $5/6$, we explicitly determine the $S_K$-unit solutions and verify the valuation bound for both criteria when $A,B,C\in\{\pm2^r:r\in\mathbb{Z}_{\geq0}\}$, including the same $r\geq5$ conclusion.

comments
19 pages. Substantially revised: stronger non-existence criteria in $K^3$, unconditional results over totally real fields, and quadratic applications of relative densities 1 (real) and 5/6 (imaginary, conditional). Proofs revised and exposition clarified
fields
Number Theory
pdf ↗ page arXiv:2608.28117 ↗

Low-rank methods can reduce the memory and computational requirements of deep neural network training in approaches such as GaLore. Randomized range finders offer an attractive alternative to singular value decompositions, particularly when the required rank is determined adaptively from a prescribed approximation tolerance. We introduce a blocked adaptive randomized range finder based on a Householder QR decomposition and an optimized hybrid CPU–GPU implementation. Numerical experiments show that it preserves orthogonality and approximation accuracy in regimes where block Gram–Schmidt without reorthogonalization becomes unstable. The blocked formulation exposes matrix–matrix operations and enables overlap of CPU panel factorization with GPU updates. On an NVIDIA GH200, the overlapped implementation reduces the runtime for the largest tested matrix from 9.91 s on the CPU to 0.407 s. The method provides a stable and efficient building block for low-rank approximation on heterogeneous systems with applications in computational science and engineering.

fields
Numerical Analysis
pdf ↗ page arXiv:2608.28941 ↗

The Fushchych–Shtelen (FS) construction of approximate symmetries, based on a triangular system for the coefficients of a solution expansion, is extended to arbitrary order. A coefficient-map formulation establishes, under explicit hypotheses, a correspondence with the Baikov–Gazizov–Ibragimov (BGI) method. The two approaches are compared for a perturbed cubic wave equation. Nonlinearities admitting an FS point symmetry with prescribed projection onto the unperturbed dilation are classified through second order, up to equivalences. They comprise a power family and logarithmic families at exceptional exponents. Nonlinearities admitting second-order BGI point symmetries that continue this dilation are also classified. Among perturbations nontrivial at first order, these form a proper subfamily of one FS family; another family is admitted by both methods when the perturbation first enters at second order. Joint reduction by the Lorentz algebra and the inherited FS dilation yields explicit invariant solutions for all FS normal forms and recovers the first-order solutions of Fushchych and Shtelen. For the common family with a nontrivial first-order perturbation, the logarithmic corrections arise from expanding a power law with a perturbation-dependent exponent. Periodic traveling waves illustrate the long-scale validity of the FS expansion. The first correction is obtained by quadrature, second-order secular terms are identified, and phase renormalization yields bounded approximations. For integer-power members of the power family, the amplitude dependence of the corrected wavenumber agrees with the symmetry scaling weights.

comments
Accepted to Ukrainian Mathematical Journal, W. Fushchych memorial issue
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2608.31098 ↗

We define the totally positive part of the coordinate algebra associated to a Cartan datum of simply laced type. We show its relation to the canonical basis of the corresponding plus part of the enveloping algebra.

comments
5 pages
fields
Representation Theory
pdf ↗ page arXiv:2609.01321 ↗

We study an infinite family of strongly coupled four-dimensional $\mathcal N=2$ superconformal field theories (SCFTs) distinguished by a trivial Higgs branch, known as the $(A_2,D_{3m+1})$ Argyre-Douglas theories. We propose that their associated vertex operator algebras (VOAs) are the doublet algebras $\mathcal A(4m+2)$, an infinite family of non-rational vertex operator superalgebras with a remarkably simple strong generating set of only three fields. We provide several highly nontrivial checks of this proposal. In particular, we reproduce the four-dimensional conformal anomalies $a$ and $c$ from the VOA and analytically prove the exact equality between the Schur index of the SCFT and the supercharacter of the VOA. A key ingredient is a diagonal-gauging realization of the $(A_2,D_{3m+1})$ theories in terms of two simpler building blocks, which makes the Schur-index computation tractable. Remarkably, we find that the resulting Schur index of the $(A_2,D_{3m+1})$ theory coincides with that of $\mathcal N=4$ $SU(2)$ Super-Yang-Mills theory, up to an overall prefactor and an appropriate identification of fugacities. We also discuss a generalization to the two-parameter family $(A_{2s},D_{(2s+1)m+1})$, whose members likewise have trivial Higgs branches and admit diagonal-gauging realizations. A particularly interesting subfamily is $(A_{2s},D_{2s+2})$, for which the four-dimensional conformal anomalies coincide, $a=c$. As a byproduct, we also show that the doublet VOA $\mathcal A(4m+2)$ is not classically free for positive integer $m $. Our results reveal a systematic connection between Higgsless SCFTs, diagonal gauging, and strongly finite but non-rational vertex operator algebras.

fields
Mathematical Physics
pdf ↗ page arXiv:2609.02437 ↗

We (the author and the AI systems that did the heavy lifting) show that the quantum query complexity of minimizing a convex function over a convex subset of $\mathbb{R}^n$ with evaluation and membership queries is $\tildeΩ(n)$, nearly matching the best known upper bound. In particular, we show this even for quadratic minimization, which is equivalent to inverting an $n \times n$ real matrix using matrix-vector queries. We also show linear or nearly linear lower bounds on the quantum query complexity of computing the trace, the sign of the determinant, and the magnitude of the determinant of a real matrix in the matrix-vector query model. We use a novel quantum lower bound technique, the determinantal witness method, based on identifying a witness whose Fourier transform vanishes on low-rank matrices and that correlates well with the function being computed.

comments
29 pages. v2: additional discussion of technical approach in introduction, minor corrections
fields
Optimization and Control
pdf ↗ page arXiv:2609.05679 ↗

We define a class of infinite dimensional linear port-Hamiltonian delay systems, give a characterization for such systems, and provide an easily verifiable sufficient condition to belong to this class, thereby extending the study by Breiten, Hinsen and Unger in [IEEE Trans. Autom. Control vol. 69, no. 12 (2024), pp. 8924-8930, doi: 10.1109/TAC.2024.3464332]. The results rely on the operator semigroup theoretic treatment of linear delay PDEs.

fields
Functional Analysis, Analysis of PDEs
pdf ↗ page arXiv:2609.05726 ↗

This work provides a learning approach to solving finite-horizon Markov decision processes (MDPs) when the underlying model of a given finite MDP is unknown to the decision maker. We transform the adaptive multistage sampling (AMS) algorithm into a sampling-free algorithm, called "adaptive multistage rollout (AMR)," for estimating the optimal value at an initial state when only the state set and the action set are known. AMR emulates the backward induction as in AMS but in a reinforcement learning (RL) setting. At each iteration, AMR generates a non-stationary policy to be used for exploration and rolls out the policy in order to obtain a single trajectory of experiences and traces it backwards in a non-recursive way while doing relevant updates only at visited states and for actions taken at the visited states. We show that AMR is asymptotically optimal such that the sequence of the expected absolute errors approaches zero and its convergence rate depends on the number of visits to each reachable state at each stage from the initial state, essentially transforming the result of AMS into the RL setting.

comments
The manuscript contains some erroneous statements/results
fields
Optimization and Control
pdf ↗ page arXiv:2609.05856 ↗

Let $P_d$ be the convex hull of the permutations of $\{1,\ldots,d\}$ that avoid the patterns $132$ and $213$, and let $H_d(t)$ be its Ehrhart $h^*$-polynomial. We prove that all zeros of $H_d(t)$ are real and negative for $3\le d\le1000$ and for every $d\ge2^{62}$; for $d\le2$ the polynomial is constant. Expanding $H_d(t)$ in refined Eulerian polynomials does not suffice, since a coordinate is already negative at $d=7$. Let $A_{d,i}(t)$ enumerate all permutations of $\{1,\ldots,d\}$ with first entry $i$ by number of descents. For $c\ge0$, we prove that every nonnegative linear combination of $A_{d,1},\ldots,A_{d,d}$ and the adjacent differences $A_{d,r+1}-cA_{d,r}$, $2\le r\le d-2$, is real-rooted for all $d\ge4$ simultaneously if and only if $c\le2-\sqrt3$. This reduces real-rootedness to the positivity of explicit weighted tails of the coordinates. An exact certificate checks these inequalities for $d\le1000$, and coefficient estimates based on Darroch's theorem on the mode of a sum of Bernoulli variables prove them for $d\ge2^{62}$; the range $1001\le d<2^{62}$ remains open. Along the way we identify $P_d$, up to lattice equivalence, with twice a chain-poset permutahedron and with the Newton polytope of a discriminant, which transfers the known cube structure and volume of these models to $P_d$. We also show that the coefficient of $t^{d-1}$ in $H_d(t)$ counts strong tournament score sequences for $d\ge3$, confirming a conjecture of Rehberg in this range.

comments
37 pages, 3 figures, 2 tables. Revised title, exposition, notation, and references; clarified relation to earlier work; eventual real-rootedness threshold improved from $2^{72}$ to $2^{62}$. Exact data for $d \le 1000$: https://github.com/tashimir/ehrhart-132-213-polytopes
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2609.06096 ↗

This paper introduces LQ8, an open-source weak-signal digital mode for amateur radio that completes structured two-way contacts in 4 transmissions (60 s), achieving a 1.50x speedup over canonical 6-transmission exchanges (90 s) and 1.25x over 5-transmission RR73 exchanges (75 s) while preserving complete bidirectional exchange of Maidenhead grid locators, signal reports, and mutual acknowledgments. By replacing fixed-width message-type headers with variable-length prefix codes matched to physical-layer bit budgets, LQ8 packs the answering station's grid locator and measured signal report into a single 77-bit reply. In multi-station pileup operations, LQ8 confirms up to two answering stations simultaneously within a single-carrier 50.0 Hz transmission with a 0.0 dB RF power-splitting penalty, achieving a peak rate of 240 QSOs/h in continuous pileup (4x over single-carrier FT8; 480 QSOs/h dual-carrier) while retaining -21.0 dB SNR sensitivity. The protocol family also defines three extended profiles (LQ16, LQ4, and LQ2) tailored for extreme sensitivity, VHF/UHF contesting, and fast-burst channels.

comments
8 pages, 1 figure, 7 tables. Reference library and portal at https://lq8.org
fields
Information Theory
pdf ↗ page arXiv:2609.06427 ↗

We show that for every prime power $q$ and $ρ\in(0,1-\frac1q)$ there exists $\varepsilon_0(q, ρ) > 0$ such that for all positive $\varepsilon < \varepsilon_0(q, ρ)$, a random linear code over $\mathbb{F}_q$ of rate $1-h_q(ρ)-\varepsilon$ has list size $\lfloor h_q(ρ)/\varepsilon\rfloor$ or $\lfloor h_q(ρ)/\varepsilon\rfloor+1$ with probability $1-o(1)$. Before this work, the list size was known only up to a constant factor for $q\ge3$, and for $q=2$ it was known to be either $\lfloor h_2(ρ)/\varepsilon\rfloor-1$, $\lfloor h_2(ρ)/\varepsilon\rfloor$ or $\lfloor h_2(ρ)/\varepsilon\rfloor+1$. We also show that the same two-point concentration holds for the list size of random LDPC codes. This follows from a general theorem establishing that random LDPC codes and random linear codes have the same threshold rate for distance, list decoding, list recovery from errors and any other \emph{convex} property, which answers a question of Mosheiff, Resch, Ron-Zewi, Silas and Wootters.

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

In this work we present the following general principle: every positive homogeneous functional on an abstract convex cone satisfying a suitable Brunn-Minkowski inequality gives rise to an information functional -defined as the quotient of the functional by its relative surface area- that satisfies a linear Brunn-Minkowski inequality. We also establish the dual counterpart of this principle for functionals satisfying an analogous convexity property, yielding reverse linear Brunn-Minkowski inequalities for the associated information functionals. Furthermore, we show that homogeneity is necessary within this principle by providing a counterexample to the expected result for the information functional associated to the standard Gaussian measure. As applications, we recover, via an alternative first-order argument, a classical result by Giannopoulos, Hartzoulaki and Paouris (2002) for the ratio of two consecutive quermassintegrals, together with a characterization of the equality case. The same argument extends to the setting of mixed discriminants of symmetric positive definite matrices. Finally, our approach yields new extensions of the Brunn-Minkowski inequality of Dembo, Cover and Thomas, for the classical information functional, both to the $L_p$ setting ($p \geq 1$), where the relative surface area is expressed in terms of Lutwak's first $L_p$ quermassintegral, and to the measure-theoretic framework, for measures with homogeneous densities satisfying some concavity. Moreover, we prove that our principle applies also in the context of the Blaschke addition, both in the volume and in the (mixed) affine surface area cases, obtaining new inequalities as an application of it.

comments
Some additional applications of the general principle were included. Improved presentation and organization of the manuscript. Corrected minor typos/misprints
fields
Metric Geometry
pdf ↗ page arXiv:2609.07463 ↗

We prove that the maximal derived length of a solvable subgroup of the plane Cremona group over $\mathbb C$ is equal to $5$. The main difficulty is the case of subgroups containing loxodromic elements. To treat this case, we prove that the maximal derived length of a finite solvable subgroup is $4$ and establish a centraliser theorem: the centraliser of a finite solvable subgroup of derived length $4$ contains no loxodromic element. The proof of the centraliser theorem relies on Blanc's classification of maximal algebraic subgroups and then uses equivariant Sarkisov theory, orbit estimates, superrigidity, and fixed curves of genus at least two.

comments
33 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2609.08876 ↗

Let $Γ=(V,E)$ be a graph and let $a,b$ be nonnegative integers. A nonempty proper subset $C\subset V$ is an \emph{$(a,b)$-regular set} if each vertex of $C$ has exactly $a$ neighbors in $C$ and each vertex outside $C$ has exactly $b$ neighbors in $C$. Perfect codes and total perfect codes are the $(0,1)$- and $(1,1)$-regular sets. For every connected circulant quartic graph $\operatorname{Cay}(\mathbb{Z}_n,\{x^{\pm k},x^{\pm\ell}\})$ and every pair $(a,b)$ we decide, in terms of $n$, $k$ and $\ell$, whether an $(a,b)$-regular set exists. Existence is proved by exhibiting unions of residue classes; non-existence comes from a Fourier-analytic obstruction combined with the fact that certain sums of roots of unity cannot vanish.

fields
Combinatorics
pdf ↗ page arXiv:2609.09414 ↗

Decentralized networks can learn collision-free periodic transmission schedules, but acquisition can consume much of a finite operating horizon. We characterize acquisition in a reservation protocol for a fixed population of $n$ nodes and a period of $Γ_n\ge n$ slots. Initially, each node attempts independently in each slot with probability proportional to $1/n$. A success reserves a slot that the node reuses every $Γ_n$ slots, retaining it after collisions. Nodes use only their own acknowledgments and small local memory. An exact finite-population Markov reduction, independent of the arrangement of reserved slots, characterizes the time until every node has a distinct reservation. As $n\to\infty$, mean acquisition takes $O(n^2)$ slots when $Γ_n=n$ and $O(n\log n)$ slots when $Γ_n\sim(1+θ)n$, for fixed $θ>0$. With a fixed number $Γ_n-n$ of spare slots, the standard deviation of acquisition time has the same asymptotic order as its mean. If that number diverges while $Γ_n/n$ remains bounded, the ratio of standard deviation to mean tends to zero. A diverging sublinear number of spare slots yields $o(n^2)$ mean acquisition while long-run utilization, the fraction $n/Γ_n$ of slots with successful transmissions, tends to one. Simulations validate these laws and compare acquisition and delivered packets per slot with existing access protocols.

comments
Submitted to Wireless Networks
fields
Information Theory
pdf ↗ page arXiv:2609.09934 ↗

For any two links in the $3$-sphere, we provide a visual construction of a stable map $f$ from the $3$-sphere to the Euclidean plane such that $f$ has no cusp points, the set of definite (resp. indefinite) fold points of $f$ is isotopic to the first (resp. second) given link, and $f$ does not have a certain type of singular fibers. Moreover, we obtain a similar result for any $3$-manifold by setting the target space to the $2$-sphere.

comments
19 pages, 21 figures
fields
Geometric Topology
pdf ↗ page arXiv:2609.09937 ↗

We construct counterexamples to a four-decade-old conjecture attributed to Stanley concerning the unimodality of $h^*$-polynomials of IDP polytopes. As additional applications of our main constructions, we also disprove a conjecture by Brenti on the log-concavity of $h^*$-polynomials of Gorenstein IDP polytopes, and a conjecture by Ferroni and Higashitani concerning the log-concavity of the Ehrhart series of IDP polytopes. We also answer their question about the existence of very ample polytopes with non-log-concave interior Ehrhart series. Our class of examples arises by taking Cayley sums of rectangular prisms, and hence they possess regular unimodular flag triangulations by a result of Haase, Paffenholz, Piechnik and Santos. Remarkably, for the unimodality conjecture we can even find smooth counterexamples.

comments
15 pages. Minor improvements
fields
Combinatorics, Commutative Algebra
pdf ↗ page arXiv:2609.10513 ↗

This paper proves that the sectional curvature of the Fisher–Rao manifold of beta distributions, restricted to the diagonal, is strictly decreasing. The proof is based on a general convexity lemma for ratios involving positive decreasing functions and is applied to a quotient of polygamma functions.

comments
9 pages, typos corrected
fields
General Mathematics
pdf ↗ page arXiv:2609.10628 ↗

Direct evaluation of the defining product of the Cayley-Dickson algebra $A_n$ of rank $N:=2^n$ over a unital commutative ring $R$ in which $2$ is invertible requires a quadratic number of arithmetic operations. This paper gives a uniform bilinear algorithm for multiplication in this algebra costing $O(N \log N)$ arithmetic operations in $R$ and $O(N)$ auxiliary storage when the doubling parameters of $A_n$ are units whose square roots lie in a fixed commutative coefficient algebra $S$ finitely generated as an $R$-module and admitting an $R$-linear map $π\colon S \to R$ with $π(1) = 1$. In particular, over $\mathbb{R}$ and every finite field $\mathbb{F}_{q}$ of odd characteristic, a quadratic field extension contains a square root of every possible doubling parameter, so the algorithm applies to every Cayley-Dickson tower over these fields, and the tensor rank of multiplication in $A_n$ over them is at most $(9n-21)2^n+28$ when $n\ge2$. When the top doubling parameter is a non-square, as in the standard real tower, the bound is $(9n-15)2^{n-1}+10$. To the author's knowledge, the algorithm presented in this paper is the first uniform subquadratic algorithm for multiplication in $A_n$. When $R=\mathbb{R}$ with every doubling parameter equal to $-1$, the real quasilinear schedule uses fewer total arithmetic operations than both direct multiplication and a uniform algorithm of Cariow-Cariowa for $n\ge4$. An implementation for the standard real tower is available in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface. In single-core benchmarks against direct multiplication and the uniform Cariow-Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was over $17$ times faster than direct multiplication at $N=1024$.

comments
28 pages, 2 tables. v2: title changed from 'Quasilinear multiplication in the real Cayley--Dickson tower'; results generalized from $\mathbb R$ to unital commutative rings with $2$ invertible, with finite-field and tensor-rank corollaries; benchmarks updated. Code: https://git.tanuki-cd.com/algebraity/fastCD
fields
Rings and Algebras, Numerical Analysis
pdf ↗ page arXiv:2609.11588 ↗

Linear programming plays a fundamental role in computer science, with applications in optimization, formal verification, SMT solving, and numerous other domains. When exactness guarantees are required, numerical inaccuracies arising from floating-point arithmetic can compromise soundness, whereas exact rational arithmetic often incurs significant computational overhead. In this paper, we investigate the numerical stability of the simplex algorithm and establish conditions under which a precision-boosting floating-point implementation provably produces the same pivot decisions and final basis as an exact rational implementation, from which the final result is reconstructed and certified exactly. Our analysis shows that correctness depends on both arithmetic precision and a careful handling of numerical tolerances. Based on these results, we develop a tolerance-aware, precision-boosting simplex algorithm with formal correctness guarantees. Finally, we introduce a delta-complete termination criterion that allows the algorithm to terminate once certified upper and lower bounds on the optimal objective differ by at most a user-specified threshold delta, providing a certified, user-controlled optimality gap.

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

This paper introduces and studies the Multi-Objective Enterprise Doubly-Green Supply Chain Network Design (MOE-DGSCND) problem, an extension of Multi-Objective Supply Chain Network Design. The problem studied here is a three-objective combinatorial optimization problem that simultaneously minimizes total cost f1, carbon dioxide emissions f2 and customer dissatisfaction f3 over binary decisions regarding which distribution centers to open and how to assign customer zones to open facilities. The problem generalizes the capacitated facility location problem (CFLP) and is known to be NP-hard (Garey and Johnson, 1979). This paper formally specifies the decision variables, objective functions and constraints and investigates three solution approaches using a single numerical instance: (A) an exact weighted-sum integer linear programming (ILP) formulation solved with Python combinatorially and via PuLP, (B) three Fully Polynomial-Time Approximation Schemes (FPTAS) providing (1 + $ε$)-approximate solutions for $ε$ := 0.15 and (C) two baseline heuristics for comparison. On an instance with eight customers and five candidate distribution centers, the exact solver certifies the optimal (sampled) supported solutions across eight weight combinations, while the FPTAS-based approaches complete within milliseconds, compared to centiseconds for the exact ILP on this tiny non-stochastic instance.

comments
24 pages, 10 tables, 3 figures, 14 references
journal
Cond. acc./R&R AJOR 16(4), 2026
fields
Optimization and Control
pdf ↗ page arXiv:2609.11971 ↗

Richard Stanley asked whether every tree $T$ is determined up to isomorphism by its chromatic symmetric function $X_T$. We approach this open problem by regarding $X_T$ as a polynomial in the power-sum symmetric functions $p_1, p_2, \dots$ and studying the invariant $Φ_T = \left.\frac{\partial {X_T}}{\partial p_1}\right\rvert_{p_1 = 0}$. We prove that $Φ_T$ distinguishes, among proper trees, every proper tree in which any non-leaf vertex with two or more non-leaf neighbors has a number of leaf neighbors occurring at no other non-leaf vertex. We give an equivalent formulation of Stanley's question in terms of $Φ_T$. Finally, we show that counts of spanning forests with at most $t$ edges cannot distinguish all $k$-vertex trees when $t<\left\lfloor k/2\right\rfloor$, for every $k\ge4$.

comments
15 pages, 2 figures
fields
Combinatorics
pdf ↗ page arXiv:2609.13464 ↗

This article investigates the duality of abelian topological groups by delving into the interplay between the algebraic and topological properties of a group $G$ and those of its dual group. In particular, extending the notion of a $g$-barrelled group, we introduce and study the classes of $κ$-barrelled and $ω$-barrelled groups. Our first main result establishes that every $ω$-barrelled group is $\aleph_0$-barrelled (i.e., if every weakly convergent sequence in the dual group is equicontinuous, then every metrizable weakly compact subset of the dual group is also equicontinuous). From this, we deduce that the free topological abelian group $A(K)$ over a metrizable compact space $K$ is determined by the subgroup generated by any of its dense subsets. Furthermore, we prove that if $G$ is a $σ$-compact, $ω$-barrelled group, then its dual group $\widehat{G}_κ$ equipped with the compact-open topology is sequentially complete (complete if $G$ is hemicompact). We also solve an open question posed by Trigos-Arrieta by constructing an explicit example of an $ω$-barrelled metrizable group that fails to be $g$-barrelled. Finally, we investigate the dualization of groups lacking infinite compact subsets, proving that for a totally bounded abelian group $G$, every compact subset of $G$ is finite if and only if its dual group $\widehat{G}$, endowed with the finite-open topology, is unordered Baire-like.

fields
Functional Analysis, General Topology, Group Theory
pdf ↗ page arXiv:2609.14074 ↗

In this paper, we study the computational complexity of finding fixed points for set-valued contractions. We first formulate a computational problem for Nadler's fixed-point theorem: Projected-Nadler, and prove that it is $\mathsf{CLS}$-complete by showing its equivalence to Continuous-LocalOpt. We then establish a stronger converse for Nadler's fixed point theorem that can be applied as a tool to analyze the convergence rate of set-valued basic iteration procedure. Finally, we reduce large-margin triplet stationarity problem to Projected-Nadler. Together with its $\mathsf{CLS}$-hardness introduced in [arXiv:2509.16898], this yields $\mathsf{CLS}$-completeness of large-margin triplet stationarity.

comments
58 pages, 4 figures
fields
General Topology
pdf ↗ page arXiv:2609.14101 ↗

In this paper we provide a positive version of Miljutin's theorem. Namely, we show that for any uncountable compact metric spaces $K$ and $L$ there exists a positive isomorphism $T:C(K)\longrightarrow C(L)$. Moreover, the inverse of $T$ is a regular operator, and $T$ may be chosen so that $\|T\|_\mathrm{r} \cdot \|T^{-1}\|_\mathrm{r} \leq 9+6\sqrt3$. The method also gives positive versions of classical nonmetrizable results for Miljutin and Dugundji compacta. In particular, if $G$ and $H$ are infinite compact groups of the same weight, then $C(G)$ and $C(H)$ are positively and regularly isomorphic with the same uniform quantitative estimate.

comments
15 pages
fields
Functional Analysis
pdf ↗ page arXiv:2609.14148 ↗

The paper focuses on the following problem: given a generalized Bratteli diagram $B$, determine conditions under which the tail equivalence relation $\mathcal R$ does not admit a tail invariant probability measure on the path space $X_B$. We give several sufficient conditions, formulated in terms of the incidence matrices, that guarantee the nonexistence of such a measure. We also discuss a new spectral method for finding tail invariant measures for a class of stationary generalized Bratteli diagrams. This method allowed us to answer affirmatively an open problem formulated in arXiv:2212.13803.

comments
24 pages
fields
Dynamical Systems, Probability
pdf ↗ page arXiv:2609.14275 ↗

For an integer $n > 1$, let $P^+(n)$ be the largest prime factor of $n$, and let $P_y^+(n)$ denote the largest prime factor of $n$ not exceeding $y$. One of Erdős and Turán's conjectures asserts that the asymptotic density of integers $n$ satisfying $P^+(n)<P^+(n+1)$ is $1/2$. Furthermore, Wang conjectures that for $x\rightarrow\infty$, one has $\#\{p\leq x:P^+(p-1)<P^+(p+1)\}\sim π(x)/2$. In this paper, we show the following results. For any $3\leq y\ll x^{o(1)}$, for $x\rightarrow\infty$, we have \begin{align*} &\#\{n\leq x:P^+_y(n)<P^+_y(n+1)\}\sim \frac{1}{2}x, \\&\#\{p\leq x:P^+_y(p-1)<P^+_y(p+1)\}\sim \frac{1}{2}π(x), \end{align*} where the first result extends a previous range $3\leq y\ll \exp(\log x/(100\log\log x))$ due to Rivat (2001). For any $0<α<17/32$, let $y=x^α$. Then there exists $h(α)>0$ such that \begin{align*} \#\{p\leq x:P_y^+(p-1)<P_y^+(p+1)\}\geq(h(α)+o(1))π(x). \end{align*} In particular, the function $h$ satisfies $\lim_{α\rightarrow 0^+}h(α)=1/2$. Similar result also holds for $\#\{n\leq x:P_y^+(n)<P_y^+(n+1)\}$, which improves a previous result $\lim_{α\rightarrow 0^+} h(α)=1/4$ due to Wang (2019).

comments
22 pages
fields
Number Theory
pdf ↗ page arXiv:2609.15166 ↗

Let $Γ,Δ$ be finite simplicial graphs, and assume that $Γ$ has no induced squares. We prove that the right-angled Artin group $A(Δ)$ measurably embeds into $A(Γ)$ if and only if $A(Δ)$ embeds as a subgroup in a graph product of free abelian groups over $Γ$. This in turn has a graph-theoretical characterisation which can be checked algorithmically. If additionally $A(Γ)$ and $A(Δ)$ have cohomological dimension equal to two and $A(Γ)$ is not isomorphic to $\mathbb{Z}\times F_n$, we get that $A(Δ)$ measurably embeds into $A(Γ)$ if and only if it embeds as a subgroup in $A(Γ)$. Our proof relies on the following algebraic statement. Let $K_1,\dots,K_n$ be a family of pairwise disjoint cliques in the square-free graph $Γ$, and let $g_1,\dots,g_n$ be elements of $A(Γ)$ with respective parabolic supports $A(K_1),\dots,A(K_n)$. Then the subgroup of $A(Γ)$ generated by $g_1,\dots,g_n$ is a right-angled Artin group, where the only relations impose that $g_i$ and $g_j$ commute if $K_i\cup K_j$ is contained in a clique of $Γ$. The same holds true more generally for pairwise disjoint cliques $K_1,\dots,K_n$ in the extension graph $Γ^{\mathrm{ext}}$, up to possibly replacing the elements $g_i$ by powers.

comments
Added Theorem 1.2
fields
Group Theory
pdf ↗ page arXiv:2609.15733 ↗

We prove the generalized Cartan-Hadamard conjecture, also known as the Aubin conjecture, in the small volume regime under a lower Ricci curvature bound, for any dimension $n\geq 2$. More precisely, we show that if $(M^n,g)$ is a Cartan-Hadamard manifold satisfying $\mathrm{Sec}_g\leq\bar k\leq 0$ and $\mathrm{Ric}_g\geq (n-1)\underline k$, then its isoperimetric profile is at least that of the model space of curvature $\bar k$ for small enough volumes. We also reduce the proof of the generalized Cartan-Hadamard conjecture to establishing rigidity in the equality case.

comments
We weakened Assumption 1 and added explanations for a few inequalities and steps
fields
Differential Geometry
pdf ↗ page arXiv:2609.17093 ↗

Large language model (LLM) distillation can propagate teacher bias under covariate shift when target reward feedback is unavailable. We propose Iterative Calibration and Learning (IterCaL), which alternates source-reward teacher calibration through token-level branching with student learning on target prompts. We prove polynomial convergence in expected average KL to the oracle student, the reference-regularized target-reward maximizer within a potentially misspecified student class; a quantified source-to-target calibration discrepancy gives an explicit additive true-return term. Our separation shows that regularized direct teacher matching retains positive oracle-KL error at its population optimum for every shared reference penalty, even when the teacher is stronger than every student. On the same instance, IterCaL converges to the oracle using source rewards alone.

fields
Statistics Theory
pdf ↗ page arXiv:2609.17474 ↗

Hybrid domain decomposition methods provide a flexible framework for coupling full order models (FOMs) and reduced order models (ROMs), but typically assume the model assigned to each subdomain is fixed throughout a simulation. This is limiting for transient problems in which localized features propagate through the domain and the regions requiring high-fidelity resolution change over time. We introduce a reinforcement learning (RL)-based approach for online adaptation of FOM-ROM models coupled via the overlapping Schwarz alternating method (O-SAM), an iterative domain decomposition method that solves subdomain-local problems while exchanging solution information through transmission boundary conditions on overlapping interfaces. Deep Q-networks (DQNs) are trained offline to select among subdomain-local FOMs and pre-trained Operator Inference (OpInf) ROMs using a reward balancing accuracy, cost, and model-switching frequency. Once trained, the policies are deployed predictively on problem instances not seen during training, without requiring a reference FOM solution. We demonstrate the approach on two examples: a 1D advection-diffusion problem with a moving front, and a 3D linear elastic wave propagation problem implemented in the Norma.jl solid mechanics code. For the advection-diffusion benchmark, the learned policy dynamically allocates high-fidelity resolution as the front propagates and outperforms static FOM/ROM assignments; letting the agent also adapt the domain decomposition provides no further benefit. For the elastic wave benchmark, learned policies for two and three subdomain decompositions track the propagating wave by assigning FOMs to subdomains containing the wave and ROMs elsewhere, as expected. Our results demonstrate the potential of RL to enable predictive online adaptation of model fidelity within Schwarz-based hybrid simulations.

fields
Mathematical Physics
pdf ↗ page arXiv:2609.17837 ↗

We present a solution of the limiting five-expert prediction problem with geometric stopping, based on stochastic calculus and partial differential equations. If $δ$ is the stopping probability, the minimax expected regret from tied initial scores is $45π^2/(512\sqrt{2δ})+o(δ^{-1/2})$ as $δ\downarrow0$. The adversarial rank control selecting the best and third-best experts maximizes the limiting Hamiltonian at every state. Following the four-expert construction of Bayraktar, Ekren, and Zhang (2020), we represent the value correction as a discounted boundary-local-time expectation for a degenerate obliquely reflected Brownian motion. The hyperbolic systems governing its boundary traces are derived and solved explicitly. To verify the nonlinear Hamilton–Jacobi–Bellman equation, we combine heat-equation minimum principles in equality directions, ODE minimum principles applied to convex combinations of multiple controls, and comparisons across controls. These arguments reduce the 48 regional control inequalities to a few lower-dimensional boundary problems, with the remaining signs established by explicit monotonicity arguments and by factorization of multivariate integral kernels that are positive polynomials in some of their variables. We prove global $C^2$ regularity across both regional interfaces and changes in rank ordering. We also show that the alternating COMB control only attains the limiting Hamiltonian maximum exactly when the two highest scores coincide and the third- and fourth-highest scores coincide.

comments
78 pages, 3 tables. Improved readability. Optional symbolic-check supplement: https://github.com/ebayr/five-expert-verification
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2609.17986 ↗

We prove the existence of $C^{r_{*},α}$-regular sub-stable invariant manifolds and conjugacies for analytic maps near a fixed point in the presence of resonances, assuming an invertible semisimple linearization. The regularity order $r$ and the admissible Hölder exponents $α$ depend on the resonant indices and the relative rates of contraction. Our approach uses functional expansions based on logarithmic polynomials, which allow the invariance equation to be solved explicitly and algorithmically to arbitrary order. The existence results are obtained via a fixed-point argument in a suitable Banach space. We further present several analytic examples that illustrate the theorem and demonstrate the loss of regularity caused by resonances.

fields
Dynamical Systems
pdf ↗ page arXiv:2609.18236 ↗

Recently, C. Li posted a preprint that resolves the fractional version of Talagrand's discrete convexity problem. In this note, we use the method of C. Li to answer another problem of Talagrand.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2609.18458 ↗

In this article, we prove the sharp Strichartz estimates for the Schrödinger equation on the one-dimensional torus. More precisely, via obtaining a sharp weak $L^{6}$ estimate with no derivative loss, we obtain sharp $L^{6}$ Strichartz estimate, and sharp no loss $L^{p}$ Strichartz estimate for any $2<p<6$. The latter answers a question by Bourgain \cite{Bourgain93}.

comments
26 pages, comments are welcome
fields
Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2609.18670 ↗

We investigate an algebraic approach to the Syndrome Decoding Problem, based on a reformulation of the Hamming weight constraint and its integration with the Information Set Decoding paradigm. We begin with a systematic analysis of the Hamming variety, deriving its defining equations in terms of elementary symmetric functions. Since these equations may have high degree, we exploit convolution identities for elementary symmetric functions, together with factorizations based on Lucas' identity, to derive an equivalent formulation with auxiliary variables and equations of bounded degree. Building on this modeling, we generalize the ISD paradigm through an ISD-like decoding strategy, implemented by the GBDecode algorithm, in which only a subset of an information set is fixed. This approach reduces the size of the combinatorial search space at the cost of solving the associated multivariate nonlinear systems. To handle this algebraic component, we employ the MultiSolve algorithm, which replaces a single Grobner basis computation with a collection of computations on simpler systems, obtained by exhaustively assigning a varying number of indeterminates over the finite field. This provides a tunable balance between combinatorial search and algebraic solving. We evaluate the resulting approach experimentally on instances of the Syndrome Decoding Problem for random binary linear codes, using parameters corresponding to the NIST Security Category 1 parameter set of the Classic McEliece cryptosystem. The experiments assess the feasibility of this combinatorial-algebraic approach and provide insights into the practical behavior of Grobner basis techniques within an ISD-like decoding framework.

comments
30 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2609.18866 ↗

We study two aspects of the abelian sandpile model on comb lattices. First, we prove that the infinite-volume limit of the stationary measures is supported on the saturated configuration. We then investigate the shape of avalanches induced by adding a particle at the origin in finite boxes of size $(2n+1)\times(2n+1)$ around the origin. In the stationary distribution on these finite boxes, we show that avalanches reach the boundary along the vertical teeth with probability tending to $1$, while the horizontal spread is of order $\sqrt{n}$. Finally, we establish that the single-source limit shape for abelian sandpiles on the comb lattice agrees with the corresponding limit shapes for the divisible sandpile, internal diffusion-limited aggregation (IDLA), and rotor-router aggregation models. This establishes limit shape universality on the comb lattice.

comments
26 pages, 5 figures
fields
Probability
pdf ↗ page arXiv:2609.21359 ↗

We study genus two curves whose Jacobians have complex multiplication by a biquadratic CM field. In this setting the Jacobian decomposes as a product of two elliptic curves with complex multiplication by orders in the same imaginary quadratic field. We derive upper bounds for the primes of stable bad reduction of such curves in terms of the discriminants of the CM orders. To do so, we give an explicit description of principally polarized abelian surfaces with CM by a biquadratic field via small CM cycles on an orthogonal Shimura variety of signature (3,2). We use it to prove an arithmetic intersection formula between such CM cycles with Humbert surfaces in terms of coefficients of incoherent Eisenstein series and representation numbers of ternary positive definite quadratic forms. Finally, employing the arithmetic properties of higher Green functions, we show that primes of stable bad reduction always exist.

comments
43 pages, minor correction in Theorem 7.1(2)
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2609.22544 ↗

This paper concerns the variational inequality arising from a specific singular control problem: portfolio selection under proportional transaction costs. This variational inequality is a gradient-constrained partial differential equation (PDE). Generally, the literature only guarantees the W^{2, \infty} regularity of the solution to such a PDE, and counterexamples exist for higher regularity. In this paper, by exploiting the concavity of the value function, we connect this gradient-constrained problem to an obstacle problem, and finally show that the solution is C^{2,α} except at the corner points where multiple gradient constraints bind. Especially, if there are two assets, then a global C^{2,α} solution can be guaranteed.

fields
Optimization and Control
pdf ↗ page arXiv:2609.23028 ↗

For two even integers $r_1\leq r_2$, a graph $G$ of even order is \emph{2-DCC edge $[r_1,r_2]$-bipancyclic} if for every ordered pair $(e,f)$ of independent edges and every even integer $\ell\in[r_1,r_2]$, there exist two vertex-disjoint cycles $C_1$ and $C_2$ with $V(C_1)\cup V(C_2)=V(G)$, $|C_1|=\ell$, $|C_2|=|V(G)|-\ell$, $e\in E(C_1)$, and $f\in E(C_2)$. We study this property for Cartesian products $G=H_1\square\cdots\square H_d$ with $d\geq2$, where each factor is $K_2$ or an even-order bipartite edge-Hamiltonian graph. We prove that $G$ is 2-DCC edge $[4,|V(G)|/2]$-bipancyclic whenever $d\geq4$, and also for $d\in\{2,3\}$ under explicit Hamiltonian-cycle conditions on $H_i$. Here $1\leq i\leq d$. As applications, we give sharp characterizations for undirected toroidal meshes, star-cube networks, and hyperstar networks.

fields
Combinatorics
pdf ↗ page arXiv:2609.23031 ↗

We prove the face-number conjecture of Hibi and Li: for every finite poset, the order polytope has no more faces of any given dimension than the chain polytope. More generally, the face numbers increase weakly along the admissible family of chain–order polytopes when one order coordinate is replaced by a chain coordinate. We also prove that, unless the order and chain polytopes are unimodularly equivalent, all face-number inequalities in dimensions $2,\ldots,|P|-1$ are strict.

comments
17 pages, added proof of strict inequality conjecture
fields
Combinatorics
pdf ↗ page arXiv:2609.23629 ↗

We show that Arc Kayles is PSPACE-complete. This solves a question raised by Schaefer in 1976.

comments
11 pages, 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2609.23777 ↗

The result of Greenbaum, Pták, and Strakoš that for a given set of eigenvalues, any convergence curve is possible [SIMAX 1996] and the subsequent parameterization of such matrix-right-hand side pairs $(A,\mathbf{b})$ of Arioli, Pták, and Strakoš [BIT 1998] demonstrated that the behavior of the GMRES could not be completely characterized by the eigenvalues of $A$ alone. In this paper, we consider how to use this theory to understand the admissible and attainable \gmres behavior for matrices with constrained structure, focussing on non-Hermitian (non-symmetric) tridiagonal Toeplitz matrices. We show that Toeptliz structure necessarily constrains the how the theory from these papers can manifest but that a continuum of admissible behaviors is still attainable.

comments
29 pages main text, 8 pages appendix text
fields
Numerical Analysis
pdf ↗ page arXiv:2609.24751 ↗

We study the smooth stabilization number of a locally flat embedded surface in a smooth $4$-manifold, defined as the minimum number of connected sums with $S^2\times S^2$ needed to make the surface topologically isotopic to a smooth embedding. We prove that a nonsmoothable locally flat surface in a closed, simply connected smooth $4$-manifold becomes smoothable after a single stabilization if its homology class is primitive and noncharacteristic and its complement has abelian fundamental group. This yields infinitely many examples of nonsmoothable surfaces with smooth stabilization number one. We also exhibit examples for which a single stabilization produces infinitely many pairwise smoothly nonisotopic representatives in the same topological isotopy class. In contrast, we construct a locally flat genus-eight surface representing $6h$ in $\mathbb{CP}^2$ whose smooth stabilization number is exactly two. More generally, we show that smooth stabilization numbers of locally flat embedded surfaces in $\mathbb{CP}^2$ are unbounded.

fields
Geometric Topology
pdf ↗ page arXiv:2609.24834 ↗

We establish an exact composition principle for spherical immersions coupled through coefficient profiles and norm-preserving bilinear maps. Under explicit mixed orthogonality, the spherical mean curvature vector splits into orthogonal input and profile contributions. The composition is minimal if and only if every input is minimal and the profile is $W$-minimal for the induced monomial weight. Tensor iteration allows weighted profiles to serve as inputs in further compositions. At fixed weights, Hsiang–Lawson reduction and Kapouleas–McGrath doubling yield closed embedded $W$-minimal profiles. When the effective exponents tend to infinity in positive limiting proportions, Gaussian transfer produces interior coefficient profiles from closed embedded self-shrinkers that are nondegenerate modulo rotations. The number of distinct corresponding profiles is bounded below by the Lusternik–Schnirelmann category of the rotation orbit.

comments
improved version with updated title and references
fields
Differential Geometry
pdf ↗ page arXiv:2609.24886 ↗

We present a gluing construction for a class of 6th order geometric non-linear PDE's on a Kähler manifold or orbifold, arising in the study of Bismut Hermitian Einstein complex $3$-folds, the supersymmetric supergravity models in physics, and in Dervan's Z-critical Kähler metrics. As applications, we obtain a desingularization theorem for orbifolds with crepant singularities admitting a solution of the PDE, as well as a blowing-up of points theorem for smooth complex $3$-folds admitting such solutions. These results yield new examples of regular Bismut Hermitian Einstein structures on the smooth manifolds $3(S^2\times S^4)\sharp 4(S^3\times S^3)$, $5(S^2\times S^4)\sharp 6(S^3\times S^3)$ and $S^1\times 9(S^2\times S^3)$, as well as infinite topological types of smooth compact $7$-dimensional manifolds $Y_7$, providing new solutions to the supersymmetric ${\rm AdS}_3 \times Y_7$ type IIB and ${\rm AdS}_2 \times T^2 \times Y^7$ type $D=11$ supergravity models.

comments
Typos corrected, added citations
fields
Differential Geometry
pdf ↗ page arXiv:2609.25250 ↗

We establish a functional central limit theorem for locally stationary time series in a separable Banach space $B$. The result requires no type-2 or cotype assumptions and thus covers spaces central to functional data analysis, such as $C([0,1])$ and $L^p([0,1])$. Under moment conditions, summable physical dependence coefficients and a bracketing entropy condition controlling the infinite-dimensional tails, the centered partial sum process converges weakly in $D([0,1],B)$ to a centered Gaussian process, whose covariance is the integrated local long-run covariance, an element of the projective tensor product. We also obtain a stochastic integral representation with respect to a cylindrical Brownian motion. As the limit depends on the unknown long-run covariance, we prove consistency of a block multiplier bootstrap for the partial sum process. This yields CUSUM tests for a constant mean of the full process, based on arbitrary continuous seminorms and valid under a time-varying long-run covariance. For linear projections, we derive a self-normalized test with a pivotal limit. In simulations, the supremum norm test detects localized changes that its $L^2$ counterpart largely misses, and applications to EEG and temperature data illustrate the methodology. Examples in $C([0,1])$ and $W^{1,p}_0([0,1])$ show how the entropy condition can be verified.

comments
Keywords: Locally stationary time series; Banach-valued time series; functional central limit theorem; functional data analysis; block multiplier bootstrap; change point detection
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2609.25791 ↗

We prove that irreducible spherical type Artin groups are profinitely rigid within the class of all spherical type Artin groups. As part of the proof, building on ideas of Kolay for the $n$-strand braid group, we compute the smallest non-abelian quotient of every spherical type Artin group. In particular, given an irreducible spherical type Artin group, its smallest non-abelian quotient is always that of the corresponding Coxeter group, except for dihedral Artin groups of weight divisible by $4$, which all have $\mathfrak S_3$ as a non-abelian quotient. Parts of the proof also rely on the computation of the cohomological dimension of the profinite completion of certain Artin groups.

comments
38 pages, 1 figure. Comments welcome!
fields
Group Theory, Geometric Topology
pdf ↗ page arXiv:2609.25940 ↗

Let $P$ be an irreducible reversible Markov kernel on an $m$-state space $Ω$, and denote its right spectral gap by $\Gap(P) =1-λ_2(P)$. For a stationary trajectory, let $K_t$ be the occupation-count vector of the length-$n$ window beginning at time $t$. The stationary pair $(K_0,K_1)$ defines a reversible projected count kernel $\widetilde P_n$. For each fixed $m\ge2$, define \[ c_m^\star= \inf_{\substack{|Ω|=m,\ P\ \mathrm{irreducible\ and\ reversible} n\ge2}} \frac{n\Gap(\widetilde P_n)}{\Gap(P)}. \] We prove \[ \frac1{1080m}\le c_m^\star\le q_{m-2}, \qquad q_0=\frac14,\quad q_{r+1}=q_r(1-q_r). \] We also show $q_{m-2}=(m+\log m+O(1))^{-1}$, which implies that $c_m^\star=Θ(m^{-1})$. Thus, the reciprocal optimal comparison coefficient $C_m^{\mathrm{opt}}=(c_m^\star)^{-1}$ is of the order $m$. In the two-state case, we determine the exact values $c_2^\star=1/4$ and $C_2^{\mathrm{opt}}=4$. %the exact constants for $m\ge3$ remain open. The lower bound also holds for $n=1$ and is uniform in $P$, including sparse and periodic kernels. The proof combines short-window decorrelation with an averaged anchor-excursion decomposition, a Green-kernel hitting estimate, and a stopped Carleson–Hardy inequality. A nested rare-state construction produces finite $m$-state witnesses whose normalized Rayleigh quotients approach $q_{m-2}$ through an ordered sequence of limits. For every fixed finite irreducible reversible aperiodic kernel on at least two states, $\Gap(\widetilde P_n)=Θ_P(n^{-1})$.

comments
59 pages
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2609.27836 ↗

We establish an exact trace theorem for vector-valued time-Morrey spaces and complementary continuity theorems for time-BMO evolution classes. For a Banach couple $X_1\hookrightarrow X_0$, $1<p<\infty$ and $0<λ<1$, we prove that the trace of the class $u\in\mathcal M^{p,λ}(X_1)$, $u_t\in\mathcal M^{p,λ}(X_0)$ is exactly $(X_0,X_1)_{θ,\infty}$, where $θ=1-(1-λ)/p$. A constructive extension realizes every admissible trace, and counterexamples establish optimality of both the smoothness exponent and the weak fine index. Time-BMO control yields continuous finite-index interpolation traces and, under a mixed boundedness hypothesis, a logarithmic time modulus whose base-space logarithm is necessary. For the quadratic viscous Hamilton–Jacobi equation on the torus, we characterize the bounded initial data generating Morrey-regular solutions by the exact Besov condition $u_0\in B_{2,\infty}^{2θ}$. The proof uses Hopf–Cole linearization and a direct composition argument, and requires no smallness assumption. Lacunary nonlinear solutions realize the sharp trace threshold. A forced Hamilton–Jacobi example exhibits genuinely logarithmic time regularity, and a forward–backward mean-field-game system illustrates initial and terminal trace compatibility. \par\smallskip\noindent\textbf{Keywords:} Morrey spaces; trace spaces; real interpolation; Hamilton–Jacobi equations; bounded mean oscillation.

fields
Analysis of PDEs
pdf ↗ page arXiv:2609.29148 ↗

We study the geometry of the three simplest known formulas for roots of a general sextic polynomial. In contrast with work of Green on the quintic, we show that no "simultaneous uniformization" of the normal forms associated to the solutions exists. This demonstrates an intrinsic qualitative complexity of sextic equations that is not present in quintic equations. Additionally, we give a formula for the roots of a general sextic in terms of Hilbert modular cusp forms and the uniformizing differential equation of the associated Hilbert modular surface.

comments
18 pages. Minor corrections, results unchanged
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2609.30422 ↗

This paper addresses long-range sensing in bistatic low-Earth-orbit integrated sensing and communication (LEO-ISAC). Conventional OFDM sensing fails in LEO-ISAC because millisecond-scale propagation delays destroy the transmitter–receiver symbol alignment and, with multiple targets, make the receive window longer than the transmitted block. We propose a window-grid (WG) processing framework that exploits the known beam-intersection swath to resolve both problems purely at the receiver, leaving the 3GPP symbol structure unmodified: the swath delay span is folded into cyclic-prefix-sized slices, each handled by one WG. With 103.2 MHz bandwidth at bistatic ranges beyond 640 km, simulations demonstrate meter-level ranging of two targets, and 1000 Monte-Carlo trials over random target–satellite geometries show that, with an ephemeris-based satellite-selection rule, every target is detected with a 90th-percentile range error of 2.4 m.

comments
Submitted for publication
fields
Information Theory
pdf ↗ page arXiv:2609.30653 ↗

The balance constant is a poset parameter measuring how well random linear extensions can be split according to their relative order on two elements. We give an $\varepsilon$-improvement for the balance constant over the bound by Brightwell, Felsner and Trotter (1995), for some small $\varepsilon>0$. This is the first general result towards the $\frac{1}{3}$--$\frac{2}{3}$ conjecture in over 30 years.

comments
32 pages, v2 simplifies the proof of Lemmas 4.2 and 6.4
fields
Combinatorics
pdf ↗ page arXiv:2609.30888 ↗

Let $k\ge3$ and $1\le \ell\le k-1$. We study balanced $k$-partitions of a graph for which the union of any $\ell$ parts induces few edges. We show that every graph $G$ with $n$ vertices and $m$ edges admits a balanced partition $V_1,\ldots,V_k$ such that \begin{equation*} \max_{\substack{A\in\binom{[k]}{\ell}}}e_G\left(\bigcup_{i\in A}V_i\right)\le\frac{\ell^2}{k^2}m+\frac{\ell^2(k-\ell)}{k^2}(n-1)+\frac{\ell(k-\ell)}{k(k-1)}\sqrt{\left(\binom{k}{\ell}-1\right)m}. \end{equation*} In the case $\ell=2$, our result confirms a conjecture of Bollobás and Scott in a stronger form.

fields
Combinatorics
pdf ↗ page arXiv:2609.30927 ↗

In this paper, we develop a mixed quantization technique for graph vector bundles that combines semiclassical analysis and quantum cat maps. We apply it to study the Kesten–McKay law and quantum ergodicity.

comments
34 PAGES, comments are welcome!
fields
Spectral Theory, Mathematical Physics
pdf ↗ page arXiv:2609.32113 ↗

In this article, we describe a method to obtain lower bounds for the $2k$-th moment of values of $L$-functions localised at the central point for all real $k > 0$. In particular, for the families of quadratic twists of self-dual irreducible unitary cuspidal automorphic representations of $\operatorname{GL}_D(\mathbb{A}_{\mathbb{Q}})$ with $D\in\{2,3,4\}$, our results are new in the range $0<k<\tfrac12$ when $D\in\{2,3\}$, and new for all $k>0$ when $D=4$.

fields
Number Theory
pdf ↗ page arXiv:2609.32673 ↗

We give a short, self-contained proof of Bernstein's theorem: every entire minimal graph in $R^3$ is a plane. The only global tool is the Omori-Yau maximum principle, which holds on entire minimal graphs with their induced metric. We apply it exactly once to a single explicit function $F$ built from the surface's angle function and principal curvatures. A pointwise differential inequality for $F$, combined with the Omori-Yau principle, forces it to attain its minimum value everywhere, which yields the planarity of the surface and hence Bernstein's theorem. As a by-product of our approach, we show that the same method, with a different function and with some extra work, also proves in a simple and self-contained way the generalization of Bernstein's theorem given by Osserman that a complete minimal surface in $R^3$ whose normals omit a neighbourhood of some direction must be a plane.

comments
11 pages. New version including new Remark 3.4 (about Simons' formula) and new Remark 5.1 (about the choice of the functions f and F)
fields
Differential Geometry
pdf ↗ page arXiv:2609.33643 ↗

We improve our earlier omega bounds for the error term in the Piltz divisor problem over number fields. Our proof uses a weighted extension of a counting theorem of Balasubramanian and Ramachandra and an extension of Lamzouri's kernel to apply the long resonance method. We also discuss applications of our results to lattice points in norm-form regions, invariant sublattices, abelian covers of curves, spectral counting, and representation growth of Heisenberg groups.

comments
20 pages. Added omega bounds for the two exceptional congruence classes and added some special applications
fields
Number Theory
pdf ↗ page arXiv:2609.33820 ↗

We study online allocation with increasing returns, where an uncertain number of customers arrive sequentially and can be irrevocably assigned to any product with remaining capacity. Each assignment earns a base reward plus a bonus that is nondecreasing in the number of previous assignments to the same product. Prior work has focused primarily on fixed or diminishing returns. Under increasing returns, the central challenge is that concentrating assignments can unlock large future rewards, while a different product may be preferable if arrivals stop early. We show that classical approaches, including greedy and natural LP-based rounding algorithms, can perform arbitrarily poorly, even with homogeneous bonuses. We evaluate performance through competitive ratios relative to the hindsight offline optimum. For homogeneous bonuses, we establish a tight competitive ratio of $1/2$. For arbitrary heterogeneous bonuses, however, no online algorithm can guarantee a competitive ratio greater than $1/m$, where $m$ is the number of products. By imposing discrete concavity on the bonus functions, we limit the concentration of rewards in later assignments and restore constant guarantees. Under this structure, we develop a re-solving framework that repeatedly selects a planning horizon, constructs a feasible allocation plan from the current state, and executes its assignments in a specific order. For arbitrary arrival distributions, we design distribution-oblivious deterministic and randomized algorithms with competitive ratios of $0.2537$ and $0.3864$, respectively. For known increasing-failure-rate (IFR) arrival distributions, we exploit distributional information to obtain a deterministic $1/2$-competitive algorithm.

fields
Optimization and Control
pdf ↗ page arXiv:2609.34121 ↗

We prove that for every choice of four positive masses and every cyclic ordering of the bodies there is exactly one strictly convex planar central configuration with that ordering, up to similarity. This proves a conjecture of Albouy, Fu and Sun, also called the Simó-Yoccoz conjecture, and answers Problem 10 in the list of Albouy, Cabral and Santos. Uniqueness follows by a covering argument from the nondegeneracy of these configurations. We prove nondegeneracy by hand: Dziobek's relations reduce it to an eigenvalue bound for a $2\times2$ matrix that depends only on the shape of the configuration. As consequences, every degenerate planar four-body central configuration is concave, and the known symmetry theorems for kites, isosceles trapezoids and rhombi follow in a few lines.

comments
31 pages. Version 2 proves uniqueness without computer assistance. The Hessian bound of version 1 is sharpened to the optimal Q > (2/3)K in a companion paper (doi:10.5281/zenodo.23727138), with computer-assisted proofs and formal proofs in Lean
fields
Dynamical Systems, Mathematical Physics
pdf ↗ page arXiv:2609.35632 ↗

Let $R = S/(f)$ be a complete local hypersurface ring and let $A = S[\![u,v]\!]/(f+uv)$. Pfister and Popescu showed that the stable categories of maximal Cohen-Macaulay modules over $R$ and over $A$ are equivalent, with no assumption on the characteristic. We give a short proof. If $(Φ,Ψ)$ is a matrix factorization of $h$ and $\partial$ is a derivation, then $(\partialΨ,\partialΦ)$ is a null-homotopy for multiplication by $\partial h$. Since $u$ and $v$ are partial derivatives of $f+uv$, they act as zero on the stable category of $A$, so the Koszul complex on $u$ and $v$ splits in the singularity category, and this gives density. For the double branched cover $S[\![z]\!]/(f+z^2)$ the same argument yields $2z$: it recovers Knörrer's lemma up to free summands on the double branched cover when $2$ is a unit, and we show by an example that this lemma, and periodicity for the iterated double branched cover $S[\![z,w]\!]/(f+z^2+w^2)$, fail in characteristic two. We also compute the second syzygy over $A$ of a maximal Cohen-Macaulay $R$-module by an explicit resolution, and show that the change of basis used there cannot be given by a universal matrix formula.

comments
9 pages. v3: major revision. Theorem 2.4 is due to Pfister-Popescu (Math. Z. 1996), which earlier versions overlooked; the paper now presents a new proof via Jacobian null-homotopies, and an explanation of the characteristic-2 obstruction. New title. v2: minor edits
fields
Commutative Algebra, Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2609.37839 ↗

Coded distributed computing (CDC) mitigates the Shuffle communication bottleneck through coded multicast, but existing schemes with predetermined worker populations do not directly adapt to worker arrivals and disconnections. To address these dynamics, we propose a dynamic CDC scheme that preserves surviving workers' caches and Reduce assignments while exploiting the storage brought by arriving clusters. The model accommodates general MapReduce tasks under a placement that is partly fixed and partly new. The scheme uses Cartesian products of cluster-wise placement delivery arrays (PDAs) for file placement. A delivery-aware greedy algorithm reassigns abandoned Reduce functions, and a Communication Array allows workers with no Reduce function to serve as coded transmitters. For arbitrary feasible disconnections, the scheme's exact communication load is derived. A converse bound under one-shot communication shows that, in the absence of disconnections, the scheme lies within a factor of 2 of the lower bound under these assumptions when new clusters arrive, and within a factor of 4 otherwise.

fields
Information Theory
pdf ↗ page arXiv:2609.39373 ↗

We consider extensions of the classical curvature-elasticity free energy for a fluid lipid membrane, explicitly treating the liquid crystal structure of the membrane, which results from the lipid molecules that are, on average, oriented normal to the surface. Locally varying liquid crystal order leads to local variations in bending rigidities and surface viscosity and thus influences the shape evolution. This provides a multiscale coupling between the local membrane mechanics on the level of the lipids and the mesoscopic length and time scales of biological functions. Numerical simulations in the one-constant approximation demonstrate the impact of local membrane mechanics on the emerging equilibrium shapes. These shapes not only depend on the specified conserved surface area and enclosed volume, as for the classical curvature-elasticity free energy, but also the elastic parameter and are characterized by a reduced liquid crystal order at highly curved regions. The modified shapes and their varying liquid crystal order, as function of curvature, provide experimentally testable properties. Exploring the dynamic evolution demonstrate a tight coupling of tangential flow, shape evolution and liquid crystalline order. We further point to model extensions towards lipid phase separation and asymmetric lipid bilayers and biological implications.

fields
Mathematical Physics
pdf ↗ page arXiv:2609.40113 ↗

Universal coding of integers (UCI) provides prefix codes for positive integers such that, for every nonincreasing source distribution $P$, the average codeword length under $P$ stays within $K$ times $\max\{1,H(P)\}$. For a given UCI $\mathcal{C}$, the smallest such constant $K$ is called the minimum expansion factor of $\mathcal{C}$, denoted $C_{\mathcal{C}}^{*}$. Let $C^{*}\triangleq \inf \{C_{\mathcal{C}}^{*}\}$ over all UCIs. A UCI attaining $C^{*}$, or a family of UCIs attaining $C^{*}$ in the limit, is called optimal. It is currently known that $2\le C^{*}\le 2.0386$. In this paper, we construct a family of one-point plus uniform-tail distributions and prove that, for every UCI, a distribution in this family attains the worst-case ratio; thus, the family is least favorable for the UCI problem. We further establish an inequality, called the \emph{UCI inequality}, which plays the same role for UCI as the Kraft inequality does for prefix codes: for any real number $B\ge 1$, it decides whether $B$ lies below or above $C^*$. The UCI inequality gives an equivalent definition of $C^*$. By numerical computation, we determine $C^* = 2.00012475703610197861701176297579886254\cdots$, the first $38$ decimal digits being certified. Once $C^*$ is known, we can theoretically construct the optimal UCI.

fields
Information Theory
pdf ↗ page arXiv:2610.01563 ↗

We show that not every symplectic Lefschetz fibration over the $2$--sphere admits a smooth section, settling a long-standing open problem. To prove this, we develop a method for studying sections via lifts of monodromy factorizations with point-pushing maps and the induced handle decomposition of the total space, and apply it to an infinite family of Lefschetz fibrations. In contrast, we show that every Lefschetz fibration over $S^2$ admits positive multisections. Some of these examples admit no multisections with spherical components. We also construct signature-zero Lefschetz fibrations of every odd genus $g\geq 7$, which in turn give symplectic Lefschetz fibrations of any prescribed signature in each of these genera.

comments
46 pages, 21 figures in color. v2: added an explicit calculation of a pseudosection for the genus-7 example and an appendix constructing four disjoint sections of Xiao's genus-2 Lefschetz fibration of type (6,7). Minor editorial changes throughout
fields
Geometric Topology, Symplectic Geometry
pdf ↗ page arXiv:2610.01776 ↗

Sampling from the posterior is the central task of computational Bayesian inverse problems. The standard workhorse in Bayesian inference—Markov chain Monte Carlo (MCMC)---is sequential, yields correlated samples, and must be rerun for each new observation. Conditional flow matching offers an amortized alternative: a transport map, trained once on joint samples of parameter and data, that yields independent approximate posterior samples for any observation at negligible online cost, without new likelihood evaluations. We give a careful, MCMC-literate assessment of flow matching for PDE-based inverse problems with function-valued parameters. Exploiting the flow's tractable density, we derive computable accuracy estimates for the learned posterior in total variation distance and Kullback–Leibler divergence and, moreover, propose a hybrid sampler that is made asymptotically exact by Metropolization. We validate the accuracy estimates and demonstrate amortization in several numerical examples, including electrical impedance tomography and a likelihood-free Lotka–Volterra model. Flow matching reproduces posterior means and credible bands closely at a fraction of the forward solves required by MCMC, but its accuracy degrades for concentrated posteriors and for observations that are atypical under the prior.

comments
38 pages, 18 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.02377 ↗

We classify the linear solution spaces of the chordal Belavin–Polyakov–Zamolodchikov (BPZ) equations, which arise in Dubédat's commutation relations for multiple Schramm–Loewner evolutions (SLE). Without imposing growth conditions, we determine the subspaces selected by successive conformal Ward identities and their exact dimensions. For every $κ>0$ and BPZ spectral parameter $λ\in\mathbb{R}$, we determine the spectrum and Jordan structure of the translation operator. When $λ=0$ and $κ\in(0,8)$, we further determine all admissible scaling exponents and the dimensions of the corresponding translation-invariant solution spaces. A triangular change of derivative coordinates yields a first-order system of rational Knizhnik–Zamolodchikov type, allowing us to represent the Ward operators explicitly and reduce the classification to finite-dimensional linear algebra. For $2N$ boundary points and $κ\in(0,8)$, translation-invariant BPZ solutions with $λ=0$ and the homogeneity required by Möbius covariance automatically satisfy the third Ward identity and the usual power-law bound. This recovers, under weaker assumptions, the Catalan dimension formula previously established by Flores and Kleban. At $κ=8$, the third Ward identity imposes an additional constraint when $N\ge2$, but the full Möbius-covariant solution space still has Catalan dimension, establishing completeness of the partition functions constructed from uniform spanning trees. Finally, at $κ=4$ and $λ>0$, we construct an explicit basis of positive BPZ solutions and identify its elements as partition functions for level lines of a Gaussian free field with suitable harmonic means.

comments
49 pages, 3 figures. v2: Added a Section 2 overview, Coulomb gas constructions (Section 3.1-3.2), multi-time martingale details in Appendix A, an alternative proof for Proposition 2.12 (Remark B.9). Main theorems unchanged
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2610.04362 ↗

We present GPU-accelerated Bregman Douglas–Rachford splitting algorithm (BDRS) for discrete optimal transport problem in three input formats: an explicit cost matrix, a point cloud with a ground cost between them, and a separable cost on a regular grid. For each input format, we propose hardware-aware designs of mathematically equivalent representations for the BDRS iterations to enhance numerical stability and empirical runtime. We benchmark the three proposed implementations against eight GPU baseline solvers from the literature on the same device. We demonstrate that our implementations of BDRS achieve state-of-the-art performance on their respective input formats. To the best of our knowledge, this is the first cross-solver study of GPU DOT solvers with a unified measure of optimality.

comments
44 pages, 7 figures, 3 tables. Submitted to Mathematical Programming Computation
fields
Optimization and Control
pdf ↗ page arXiv:2610.04715 ↗

We prove a uniform scalar curvature bound, depending only on the dimension, for Kähler–Ricci shrinkers. We also prove that every noncompact Kähler–Ricci shrinker has a unique tangent cone at infinity, naturally homeomorphic to the base of its polarized Fano fibration. For shrinkers with maximal volume growth, this cone is isometric to the metric completion of the regular part equipped with the intrinsic distance induced by the limiting Kähler metric.

comments
v2: Added metric-completion results for Kähler-Ricci shrinkers with maximal volume growth and finite-time singularities of volume-noncollapsed Kähler-Ricci flows
fields
Differential Geometry
pdf ↗ page arXiv:2610.05643 ↗

A normalized analytic function $f$ defined on the unit disk $\mathbb{D}$ is called $α$-spirallike if $f(\mathbb{D})$ is an $α$-spirallike domain, that is, for every $z\in f(\mathbb{D})$, the $α$-spiral $ze^{-e^{iα}t}$, $t\ge0$, is contained in $f(\mathbb{D})$, or equivalently, if $\operatorname{Re}\!\left(e^{iα} {zf'(z)}/{f(z)}\right)>0$ for all $z\in \mathbb{D}$. The 0-spirallike functions are the usual starlike functions. The function $f$ is parabolic starlike, if $\operatorname{Re}\!\left(\frac{zf'(z)}{f(z)}\right)>\left|\frac{zf'(z)}{f(z)}-1\right|$, and lemniscate starlike if $|(zf'(z)/f(z))^2-1|<1$ respectively. In this paper, we determine the radii of parabolic starlikeness and lemniscate starlikeness of $α$-spirallike functions. Our approach combines geometric characterizations of the underlying regions with the resultant method for eliminating auxiliary variables, leading to explicit equations for the sharp radii. Some known radius results are recovered as special cases.

comments
25 pages, 3 Figures
fields
Complex Variables
pdf ↗ page arXiv:2610.06175 ↗

We obtain improved Fourier restriction and Kakeya maximal estimates in $\mathbb R^4$. More precisely, by proving the two-ends incidence estimates $\mathbf{TE}\left(\frac{269}{89},\frac{179}{89},\frac{493}{534}\right)$ and $\mathbf{TE}(3.06\ldots,3.06\ldots,0.94\ldots)$, we extend the restriction range to $p>2+ \frac{356}{447}$ and the Kakeya maximal estimate up to dimension $3.06056$. The implications to the known lower-bounds for the Hausdorff dimension of Kakeya sets in $\mathbb{R}^4$ and the Bochner–Riesz conjecture are also studied.

comments
34 pages. v2: The result stated in Lemma 1 was wrongly deduced from the literature. The author thanks Xiangyu Wang for pointing out this issue. This version presents its correct statement and deduces its proof with addition of auxiliar results. Further inconsistencies were also solved. The new argument leads to weaker results but they are nonetheless considered as improvements
fields
Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2610.06181 ↗

We show that a convex surface in Euclidean 3-space is a sphere if the area cut off from it by a slab of some fixed width depends only on the direction of the slab. This result generalizes theorems of Blaschke and Stamm, which assumed the slab-area property for every width. It holds also for any smooth closed embedded surface, and we obtain analogous results in higher dimensions. The proof is based on an averaging identity, which relates slab areas to the Newtonian potential of the surface, the electrostatic characterization of spheres by Mendez and Reichel, and analytic microlocal properties of the Radon transform, which are used to show that the slab-area property forces real analyticity, via theorems of Kashiwara and Boman.

comments
17 pages; The main result extended to higher dimensions
fields
Differential Geometry
pdf ↗ page arXiv:2610.06261 ↗

We develop a discrete adiabatic framework for Gibbs-state preparation in classical and quantum optimisation algorithms. For finite time-inhomogeneous reversible Markov chains, we derive a tracking theorem that bounds the distance between the evolving distribution and the instantaneous stationary state. The bound combines contraction of accumulated error with the new error generated as the stationary distribution changes. For Gibbs paths, it yields explicit step-complexity bounds and an effective tracking metric determined by the spectral gap and equilibrium energy fluctuations. The associated constant-speed schedule minimizes the metric-energy functional and, in the small-gap regime, takes the form $\dotβ\proptoδ(β)/V(β)$, where $V(β)=\sqrt{\operatorname{Var}_{π_β}(E)}$. We then apply the discrete quantum adiabatic theorem to temperature-dependent Szegedy quantum walks, whose eigenphase gap satisfies $Δ_w=Θ(\sqrt{δ_+})$, with $δ_+$ the underlying Markov kernel's right spectral gap. Under uniform bounds on the discrete operator variation and suitable spectral and path-integral assumptions, gap-adapted schedules give a sufficient fixed-accuracy cost of $O(δ_{+,\min}^{-1/2})$. This gives a quadratic improvement in gap dependence relative to the classical inverse-gap relaxation scale under the stated assumptions. Numerical tests on a solvable two-state model and Sherrington-Kirkpatrick instances compare tracking and final preparation errors and investigate the transfer of schedules from smaller to larger systems.

comments
55 pages, 12 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.06268 ↗

We develop a highest weight framework and construct explicit finite dimensional irreducible modules for the type AIII (quasi split) quantum symmetric pair subalgebras $U_q'(\mathfrak{gl}_n^θ)$. In Part 1, we provide a uniform construction of Cartan subalgebras and Verma modules for both subfamilies. Our construction recovers Letzter's Cartan subalgebra in one subfamily and gives a new Cartan subalgebra in the other. We construct a weak triangular decomposition of $U_q'(\mathfrak{gl}_n^θ)$ via the Letzter map. Then we define Verma modules as induced modules and prove that finite dimensional simple $U_q'(\mathfrak{gl}_n^θ)$-modules are quotients of our Verma modules. In Part 2, we define a diagrammatic category $Web^B$ that controls polynomial representations of $U_q'(\mathfrak{gl}_n^θ)$. We prove a multiplicity-free decomposition of the quantum exterior powers $\bigwedge^k\mathbb{V}$ as a $U_q'(\mathfrak{gl}_n^θ)$-module, using a explicit eigenspace decomposition of certain dot morphisms in $Web^B$. As applications, we deduce the multiplicity-freeness of the involved anti-spherical Hecke module. For $\bigwedge^k\mathbb{V}$, we explicitly determine the highest weight vectors and their weights, thereby determining the isomorphism classes of their irreducible summands. Finally, we determine the kernel of the $Web^B$-action on certain finite dimensional representation category of $U_q'(\mathfrak{gl}_n^θ)$.

comments
comments welcome
fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2610.08057 ↗

We construct Yang-Mills theories with projected curvature kinetic terms, developing their analogy with MacDowell-Mansouri gravity and their connection to nonlinear sigma models. We begin with models exhibiting explicit symmetry breaking and use them to motivate gauge-covariant Higgs extensions. For $SO(2n)$, an orthogonal complex structure defines a degenerate kinetic operator with image $\mathfrak{su}(n)$, while the adjoint Higgs vacuum has stabilizer $U(n)$. We compare the fixed-projector theory with gauge-covariant formulations involving either unrestricted adjoint Higgs fields or Higgs fields constrained exactly to the orbit $SO(2n)/U(n)$. We express the Stelle-West Higgs-gravity action through a single Clifford involution whose complementary projectors select the Lorentz curvature, isolate the radial Higgs derivative, and construct the induced spacetime metric. This formulation makes the common projector structure explicit and clarifies the distinct roles of curvature projection, the internal dual, and the coframe. In the orbit-constrained Yang-Mills theory with a positive Higgs kinetic coefficient the coset connection is auxiliary and the central connection drops out of the action. A nonlinear Dirac analysis establishes a regular weak-curvature branch with $2(n^2-1)$ physical degrees of freedom in four dimensions, locally equivalent to $SU(n)$ Yang-Mills theory. In the unrestricted theory, normal Higgs displacements can change the kinetic rank, so this degree-of-freedom count does not automatically extend beyond the constrained field space. We also characterize possible nontrivial algebraic branches and introduce projected Pontryagin theories and a full-rank equivariant completion.

comments
68 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2610.08566 ↗

Assume $V=L$. We prove two uniform theorems producing coanalytic sets of prescribed Hausdorff dimension in Euclidean space. The first concerns countable families of partial operations of finite arity on $\mathbb{R}^n$ whose evaluation is hyperarithmetic and which are tame in each vector variable separately. For such families a single lightface $Π^1_1$ relation yields strictly increasing, left-continuous chains of proper sets closed under the operations, one of each Hausdorff dimension in $[0,n]$, uniformly in the family and in $n$; no exchange property of the closure is needed. As an application, there are coanalytic proper subfields of $\mathbb{R}$ of every Hausdorff dimension in $[0,1]$. The second theorem constructs coanalytic bases of every possible Hausdorff dimension for effectively coded pregeometries. As an application, there are coanalytic Hamel bases of $\mathbb{R}^n$ and transcendence bases of $\mathbb{C}$ of every Hausdorff dimension in $[0,n]$ and $[0,2]$, respectively.

comments
26 pages, 0 figures
fields
Logic
pdf ↗ page arXiv:2610.09707 ↗

Let $f\in\mathbb Q[t]$ be an irreducible integer-valued polynomial of positive degree with positive leading coefficient. We show that there is a constant $c_f>0$ such that, for every sufficiently large real $X$, the interval $(X/2,X]$ contains a block of at least $c_f\log X\log\log X$ consecutive integers $n$ for which $f(n)$ is composite. The exponent of $\log\log X$ does not depend on the degree of $f$. This improves a result of Ford and Gabdullin, replacing a small fixed power of $\log\log X$ by $\log\log X$. The result includes the case $f(t)=t^2+1$.

fields
Number Theory
pdf ↗ page arXiv:2610.10762 ↗

The recent e-closure method can recover every procedure that controls FDR (and other expectation losses). But the recovered e-collection is ``self-referential'' and gives no insight on how to improve the procedure (if improvable), and some recent improvements have been somewhat opaque. We introduce an elementary new technique called anchoring that exploits looseness in existing FDR proofs to enlarge a baseline multiple-testing procedure's self-referential local e-value. The resulting e-closure thus transparently retains every baseline discovery (and usually adding more) and controlling the false discovery rate under the same conditions as the baseline. To show that this principle is broadly applicable, we use it to improve a large suite of multiple testing procedures: (i) Anchored-BH dominates the Benjamini-Hochberg (BH) procedure under PRDS while being incomparable to Goeman's recent closed-BH, (ii) Anchored-BY dominates the Benjamini-Yekutieli (BY) procedure under arbitrary dependence while being incomparable to closed-BY, (iii) For two-sided Gaussian p-values (under appropriate covariance conditions), Anchored-2BH dominates running BH twice at half the level on two one-sided p-values, (iv) Anchored-dBH dominates dependence-adjusted BH, (v) Anchored e-BH dominates e-BH and is incomparable to closed e-BH, (vi) Anchored SeqStep+ improves the original (including selective and adpative variants) while preserving ordered rejection structures. All of these are accomplished in sorting or quadratic time. The appendix shows how to dominate Shifted-BH (for two-sided arbitrarily correlated Gaussians) and NDBH (for negatively dependent p-values), IndBH (for graph-dependent p-values), conformal multiple testing and the support line procedure for boundary FDR control.

comments
61 pages, 8 figures
fields
Statistics Theory
pdf ↗ page arXiv:2610.11279 ↗

NOTE (October 2026): This paper has been superseded by the joint paper "Limit shapes for centrally excited walks", by Ahmed Bou-Rabee, Tuan-Minh Nguyen, Yuval Peres and Arvind Singh (arXiv:2610.10162), which brings together the results and ideas of three independent drafts. We consider a once-excited random walk on $\mathbb{Z}^d$, $d \ge 2$, where the walk on its first visit has a bias of constant strength $β>0$ toward the origin and moves like a simple symmetric random walk on subsequent visits to that site. We show that the walk is recurrent and prove an almost sure spherical shape theorem: the trace after $n$ steps is asymptotically a Euclidean ball centered at the origin, with radius proportional to $n^{1/(d+1)}$, and the local times have an asymptotically conical profile. This result confirms a conjecture of Kozma (2007) on the shape of the trace for this model.

comments
12 pages. Superseded by arXiv:2610.10162. Abstract and comments updated; article text unchanged
fields
Probability
pdf ↗ page arXiv:2610.12138 ↗

We study extension of additive measures when the range carries a prescribed separated Abelian net convergence. On a $σ$-complete, lattice-$σ$-continuous pseudo-D-lattice, we prove an uncontrolled modular extension theorem using finite-response reflection, closed countable summation and uniform closure. Completeness is imposed only on the limit-stable hull of the source values. No topology, lattice order or positive control is required in its range. Modular interval identities, an order-null separation argument and two uniform transfer arguments construct the extension before establishing its normality. A separate relative lifting theorem combines this modular construction with a nonmodular Sasaki argument. Its cone conditions are verified for positive lattice-group values, lattice-normed groups, products and limit-stable subgroups. These verifications give explicit positive, dominated lattice-normed and topological corollaries. Uniqueness holds among all sigma-additive extensions to the generated domain. Sion's inner and outer nets exist in the original convergence and recover the extension there. For Boolean domains we retain the stronger identification with the full regulated splitting class and the finite-variation and finite-semivariation results.

fields
Functional Analysis
pdf ↗ page arXiv:2610.12797 ↗

We establish the following novel heterovariant Gaussian Brunn-Minkowski inequality (involving general covariance matrices $Σ_1,Σ_2,Γ$) for origin-symmetric convex sets $K,L \subset \mathbb{R}^n$ and $p,λ\in (0,1)$: \[ γ_{Σ_1}(K)^{1-p} γ_{Σ_2}(L)^p \le \left( \left( \frac{1-p}{1-λ} \right)^{1-p} \left( \frac{p}λ \right)^p \right)^{n} γ_Γ((1-λ) K + λL) , \] whenever $Γ\leq Σ_1 \sharp_p Σ_2$, the $p$-geometric mean of $Σ_1,Σ_2$. This immediately implies both the dimensional Gaussian Brunn-Minkowski inequality of Eskenazis-Moschidis (by using $Σ_1 = Σ_2 = Γ$ and optimizing over $p$) and the strong Gaussian (B)-theorem of Cordero-Erausquin-Fradelizi-Maurey (by using $K=L$, $p=λ$ and diagonal covariances), fusing them into a single unified statement. In fact, the inequality applies to convex sets whose appropriate Gaussian barycenter is at the origin. Furthermore, it reveals a new *bilinear* version of the strong Gaussian (B)-theorem (involving *two* convex sets); in particular, for all $a,b > 0$ and $λ\in [0,1]$: \[ γ(a K)^{1-λ} γ(b L)^λ \leq γ\left ( a^{1-λ} b^λ\left ((1-λ) K + λL \right) \right ) . \] A more general heterovariant version of the (bilinear) (B)-theorem replaces dilation by general linear transformations. A different version yields a heterovariant form of the recently established Gaussian conjugate Rogers-Shephard inequality. By averaging these Gaussian inequalities with respect to the covariance matrices, we obtain dimensional Brunn-Minkowski and conjugate Rogers-Shephard inequalities for Gaussian mixtures. The proofs are based on the Gaussian Forward-Reverse Brascamp-Lieb inequality established in our previous work.

comments
26 pages. Added a more general heterovariant Gaussian BM inequality for arbitrary covariances Σ_1,Σ_2,Γ, identifying the sharp constant in that generality. Also added a remark that the bilinear (B) theorem logically implies the dimensional Gaussian BM inequality
fields
Functional Analysis, Probability
pdf ↗ page arXiv:2610.13596 ↗

Standing waves $e^{iωt}u(x)$ of nonlinear dispersive equations, such as the nonlinear Schrödinger and Klein–Gordon equations, have a profile $u$ that solves the semilinear elliptic equation $Δu+f(u)=0$. We prove the existence of radial bound states with a prescribed number of nodal surfaces for this equation on a large class of spherically symmetric manifolds and for a broad class of nonlinearities $f$. Under further assumptions on the metric, we prove uniqueness of such bound states for the model nonlinearity $f(u)=|u|^{p-1}u-u$. Both existence and uniqueness results apply to the hyperbolic spaces $\mathbb{H}^n_λ$ of any curvature $-λ^2$ and dimension $n\geq 3$, and to some manifolds with a singularity at the origin.

comments
88 pages, 2 figures, 3 appendices
fields
Analysis of PDEs, Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2610.13813 ↗

Let $Λ_n$ be the set of all eigenvalues of standardized Laplacian matrices of order $n$, equivalently, of stochastic $n\times n$ matrices with off-diagonal entries at most $\frac1n$. In 2005, a polygon $S_n\subseteqΛ_n$ was constructed, and it was conjectured that $Λ_n=S_n$; this holds for $n\le3$. We show that the conjecture fails for every $n\ge5$. The vertices of $S_n$ are eigenvalues of circulant Laplacians built from powers of the directed $n$-cycle. To first order, no perturbation of these circulants moves such an eigenvalue out of $S_n$; however, adding chords with nonconstant weights moves it along an edge of $S_n$ to first order and, with an explicit coefficient, beyond the supporting line of this edge to second order. Consequently, every edge of $S_n$ not incident to $0$ or $1$ contains interior points of $Λ_n$, except possibly, for even $n$, the two horizontal edges, whereas the four edges incident to $0$ or $1$ lie on $\partialΛ_n$. For $n=4$, whose only other edges are horizontal, the question was left open in the previous versions; it has since been settled, $Λ_4=S_4$, by a computer-assisted proof of L. Marshall, after an earlier claim by D.Z. Liu, who also proved that $Λ_n$ is not convex for $n\ge5$. We certify an explicit weighted counterexample for $n=5$, lying only $1.5\cdot10^{-3}$ outside $S_5$, and an unweighted one for $n=7$: the directed $6$-cycle with a duplicated vertex. Its eigenvalue outside $S_7$ is also an eigenvalue of the two-chord digraph that ends the above perturbation; for the analogous digraphs of order $n$, the excess is asymptotic to $\frac{π^2}{2n^4}$. We also observe that $S_n$ is a zonotope, describe $Λ_n$ in terms of eigenvectors, and prove that $S_m\subseteq S_n$ whenever $m\mid n$.

comments
22 pages, 1 figure. This Version 3 highlights (in blue) recent advancements by D.Z. Liu and L. Marshall
fields
Combinatorics, Rings and Algebras, Spectral Theory
pdf ↗ page arXiv:2610.14100 ↗

We give an ideal in a polynomial ring in three variables, generated by three elements and having height equal to three, but for which no permutation of its generators is a regular sequence. We prove that in a polynomial ring over an infinite field, an ideal of height n generated by n polynomials, always admits a set of n generators, for which any permutation is a regular sequence.

comments
5 pages, fixed some typos
fields
Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2610.15261 ↗

We study the initial boundary value problem for the compressible Navier–Stokes–Poisson equations without damping in the three-dimensional half-space and in smooth exterior domains. The velocity satisfies the no-slip boundary condition, and the electric potential satisfies the homogeneous Neumann boundary condition. For small perturbations of a constant state in $H^3$, with a small initial electric field in $L^2$, we establish global existence and uniqueness of strong solutions. The uniform estimates combine density dissipation, tangential and normal derivative estimates, and a modified energy expressed through the Helmholtz projection. In exterior domains, boundary normal coordinates and localized elliptic estimates control the geometric terms. We also obtain algebraic decay in the full energy norm. In the half-space, finite tangential negative Sobolev norms of order $-s$, with $\frac12\leq s<1$, yield the rate $(1+t)^{-s/2}$. In exterior domains, integrable initial density and velocity perturbations yield the same form of estimate for $0<s<\frac14$. The exterior decay proof uses whole-space negative-order estimates for localized variables and the time integrability of the dissipation.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.15588 ↗

We provide a simplified and more human-friendly version of the proof of the Deligne–Drinfeld conjecture recently given by OpenAI.

comments
(v2) The proof is simplified and shortened further relative to the previous version. A discussion about the Lie brackets and the generators is added (v3) A proof of the closure of grt(F_2) under the Ihara bracket is added. (v4) Added Section 4.4 on the OpenAI injectivity argument
fields
Quantum Algebra
pdf ↗ page arXiv:2610.15592 ↗

Ordinal optimization selects designs that are good enough rather than optimal when evaluation is expensive and the budget is small. The alignment probability measures the chance that the selected set contains at least a prescribed number of truly good designs. We formulate quantum ordinal optimization as a class of problems that maximize this probability under a fixed oracle budget. We study exact, coherent pairwise comparisons with one selected design as a first instance, with the budget counted in comparison queries. For every classical comparison budget smaller than the number of designs, we prove that a knockout among uniformly sampled designs attains the optimum. The sample is drawn without replacement and contains one more design than the number of comparisons. For a uniformly random order, the selected design's rank has a polynomial probability law. At the same comparison budget, the maximum quantum degree is at most twice the classical maximum, a factor attained whenever there are more than twice as many designs as comparisons, so a quantum algorithm can realize rank laws that no classical algorithm with the same budget can. We determine the quantum optimum with one comparison for every number of designs and every good-enough set. For selecting the best of n designs, the optimal success probability with one quantum comparison is approximately 3.30/n for large n, compared with 2/n for one classical comparison. When the best design is sought, one quantum comparison gives a higher alignment probability than two classical comparisons whenever there are more than nine designs.

comments
22 pages, 4 tables. Adds a fixed-fraction limit and updates the discussion of two-comparison results
fields
Optimization and Control
pdf ↗ page arXiv:2610.15791 ↗

Combining local boundary analysis, algebraic curves and the computational statements specified in the appendix, we prove that the planar Newtonian five-body problem has finitely many central configurations up to rotation, translation and scaling for every choice of positive masses. This gives the five-body statement of Smale's sixth problem. We use the singular-sequence classification of Albouy and Kaloshin and resolve the corresponding boundary equations through weighted blow-up charts, rank calculations and local compatibility conditions. For the two remaining diagrams, we prove that the product $Δ$ of all squared mutual distances vanishes. On a hypothetical solution curve containing a positive arc, a pole of a four-product therefore gives a zero of $Δ$. A pole of $Δ$ elsewhere on the completed curve, together with $Δ^4=\prod_{i<j}p_{ij}$, then contradicts the same local vanishing result. The computational statements for Diagrams~2, 3 and~6 involve exact algebra, interval arithmetic and ball arithmetic.

comments
89 pages. The initial version of this paper was submitted to arXiv on October 5, 2026 (submission ID: 8179056). Shortly thereafter, arXiv:2610.13100 and arXiv.2610.28168 appeared reporting identical results
fields
Dynamical Systems, Mathematical Physics
pdf ↗ page arXiv:2610.16107 ↗

A decoding method is proposed for polar codes under channels with strong phase noise. In contrast to traditional SC decoding, where recursions are performed on scalar soft information such as probabilities, the proposed decoding recurses over probability density functions defined on the phase-noise variable. To make the density-level recursion computationally tractable, we represent each log-density by its spectrum, and derive approximate formulas for the spectrum recursion, therefore, the proposed method is termed log-density spectrum recursion (LDSR). Numerical results are given under strong phase noise and AWGN, showing that a prominent superiority of error performance is achieved by LDSR in comparison with traditional SC and Kalman-based methods.

comments
11 pages, 4 figures
fields
Information Theory
pdf ↗ page arXiv:2610.16363 ↗

We propose a model-based trust region method for derivative-free optimization with simulation-based inequality constraints. We are motivated by settings of simulation optimization in which both function evaluations at infeasible points may be unreliable and constraint evaluations are expensive. Our method maintains feasible incumbents and computes steps from a subproblem suitable for a feasible-direction method in order to encourage generation of feasible trial points. To reduce the computational cost of modeling the constraints, we describe an active-set estimation scheme that permits modeling with only a subset of constraints in each subproblem, as opposed to maintaining models of all constraints. We show that every limit point of the incumbents generated by our method is a Fritz-John point, and is additionally a KKT point under the Mangasarian-Fromovitz constraint qualification. Under standard nondegeneracy conditions, the active-set estimate identifies, within finite time, all constraints active at the limit point of the incumbents. Experiments on CUTEst problems show that our method generates feasible trial points more often than a comparable SQP-based approach and is competitive with an appropriate comparator in budgeted settings.

fields
Optimization and Control
pdf ↗ page arXiv:2610.17101 ↗

Let lambda(n) denote the infimum of -min_x sum_{a in A} cos(ax) over all sets A of n positive integers. While the classical Sidon-difference construction yields lambda(n) <= (1 + o(1))sqrt(n)/2, we construct sets achieving a leading constant of 1/2: lambda(n) <= (1/2)sqrt(n) + O(n^(1/4)sqrt(log n)), establishing limsup_{n->infinity} lambda(n)/sqrt(n) <= 1/2. This construction combines a two-sided Sidon square identity, a Singer difference set, a Fejer-kernel majorant, a parity-biased deletion, and an exact-cardinality probabilistic selection. We also provide an L^4 criterion and a multiplicity bound constraining any construction with a smaller leading constant. In the opposite direction, we incorporate the L^1 norm into Bedert's boundary estimate with an explicit constant, yielding two lower bounds for f_A(x) = sum_{a in A} cos(ax): (1) -min f_A >= cn^(1/4) for every n-element set A subset of [1, Cn]; and (2) (-min f_A)^3 ||f_A||_1^2 >= cn for every n-element set A subset of N. The second bound recovers the 1/5 exponent of Bedert and Shankar and improves it whenever ||f_A||_1 is small relative to -min f_A. Numerical values of the construction are reported up to |A| = 25,440.

fields
Number Theory
pdf ↗ page arXiv:2610.17160 ↗

We prove that every nonnegative $L^1$ source in the Monge-Ampère equation \[ \det D^2u=f\quad\text{in }Ω, \] on a bounded uniformly convex $C^{1,1}$ domain $Ω\subset\mathbb R^n$, $n\geq2$, is uniquely determined by generalized boundary measurements of Alexandrov solutions. The measurement is the extremal boundary slope, which extends the classical outward normal derivative and may take the value $+\infty$. For each direction $ω\in\mathbb S^{n-1}$, it suffices to know these slopes for cylindrical Dirichlet data $\frac{t_k^ω}{2}|P_ωx|^2$ along any sequence $t_k^ω\to\infty$, where $P_ω$ projects onto $ω^\perp$. The boundary value and extremal slope determine the interior subgradient image up to a Lebesgue null set. An exact change of variables formula then converts equality of these images into integral identities for the source, and a large-amplitude limit recovers its Euclidean X-ray transform. This yields uniqueness without a positive lower bound on the source. For nonnegative $L^\infty$ sources, the extremal slopes are bounded and agree with the interior normal derivatives, giving a Dirichlet-to-interior-Neumann formulation. We also extend the inverse argument to the gradient-weighted equation \[ \vartheta(\nabla u)\det D^2u=f, \] where the known weight $\vartheta$ is locally integrable, Borel measurable, and bounded below by a positive constant. We prove existence of the corresponding Alexandrov solutions and show that the same cylindrical boundary-slope data uniquely determine every nonnegative $L^1$ source.

comments
70 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.17519 ↗

Does there exist an 8-variable balanced Boolean function with nonlinearity 118? This is a famous and long-standing open problem in Boolean functions. In this paper, we give a negative answer to this open problem, and prove that the maximum nonlinearity of balanced Boolean functions in 8 variables is 116, establishing the 8-variable instance of Dobbertin's conjectured recursion for the minimum Walsh peak of balanced functions. Equivalently, the covering radius of the Reed–Muller code RM(1,8) in 0-resilient Boolean functions is 116. We deduce the result by obtaining a quadratic form of polar rank 6, and reducing the problem to the existence of a 6-variable Boolean function with nonlinearity greater than 26 whose Hamming distance to a bent function is between 4 and 6.

fields
Information Theory
pdf ↗ page arXiv:2610.17897 ↗

We establish the Alexandrov-Fenchel inequality and its modified version for arbitrary, possibly nonsmooth, horospherically convex bodies in hyperbolic space $\mathbb{H}^{n+1}, n\geq 2$, and prove that equality in each inequality holds if and only if the h-convex body is a geodesic ball. A key ingredient is a rigidity theorem characterizing geodesic balls via proportionality between modified support measures of adjacent orders. Its proof combines the $C^{1,α}\cap W^{2,k+1}$ approximation of the outer parallel hypersurfaces by smooth strictly h-convex hypersurfaces with the estimates for the total variation norm of the signed measure associated with the proportionality relation along the shifted curvature flows independent of initial curvature bounds. For $0\leq k\leq n-1$, we construct weak flows preserving the $k$-th modified quermassintegral $\tilde{W}_k$ with arbitrary h-convex initial bodies as Hausdorff limits of the smooth flows. The rigidity theorem above characterizes the limit shape of the flow and gives a positive lower bound on the rate of decrease of $\tilde{W}_{k+1}$ for a short time whenever the initial h-convex body is not a geodesic ball, which characterizes the equality cases in the modified Alexandrov-Fenchel inequality. For the Alexandrov-Fenchel inequality, we establish the Hausdorff stability independent of curvature bounds described by the Alexandrov-Fenchel deficits for h-convex bodies, which characterizes the equality cases in the Alexandrov-Fenchel inequality.

comments
43 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.18761 ↗

Generators of continuous-time quantum Markovian evolution, known as Lindblad operators, play a key role in the theory of open quantum systems. The question of how to define and characterize random Lindblad operators has attracted considerable attention in recent years. Purely dissipative random Lindbladians have been extensively studied using toolboxes of free probability and non-Hermitian random matrix theories, which helped to uncover a characteristic lemon-like spectral support. In this work, we focus on random Lindbladians with a Hamiltonian component. We analyze three ensembles of increasing complexity, designed to illustrate the joint effects of dissipative and Hamiltonian dynamics. While the first two allow for an exact analytic treatment with standard probabilistic and scalar-valued free-probability methods, the most general case requires the more general framework of operator-valued free probability. We explain how the spectral support changes with the relative Hamiltonian strength and the rank of the dissipative component and characterize the effect of Hamiltonian-induced spectral squeezing.

comments
24 pages, 7 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.19261 ↗

In this paper, we consider the endpoint Sobolev regularity of Radon transforms associated with real-analytic functions in the plane. We establish all of the failure of endpoint regularity for real-analytic phases. On the one hand, the critical endpoint regularity $L^p(\mathbb{R}^2)\rightarrow L^p_s(\mathbb{R}^2)$, corresponding to extreme points of the reduced Newton polyhedron of phase function, is true if only and only if $p=2$. For generic extreme points, this failure of endpoint regularity generalizes a result of Christ \cite{christ}. On the other hand, we find that the endpoint Sobolev regularity also fails on a bounded segment of the reduced Newton polyhedron when the bisectrix $y=x$ intersects one of unbounded faces at a relative interior point. In particular, our results imply that the Radon transform is not bounded from $L^p$ into $L^p_{1/n}$ with $p=n/(n-1)$ or $p=n$, where the phase functions are real-valued homogeneous polynomials $S(x,y)=a_1x^{n-1}y+a_2x^{n-2}y^2+\cdots+a_{n-1}xy^{n-1}$ with $n\geq 3$ and $a_1a_{n-1}\neq0$. This answers a problem of Phong and Stein in 1994. Moreover, the main results of this paper also give examples which show failure of critical Sobolev regularity for degenerate Fourier integral operators satisfying finite type conditions formulated in \cite{Seeger93,seeger2}. Based on earlier results and our proof of several remaining cases, we conclude that all of other critical endpoint Sobolev estimates are true for Radon transforms associated with real-analytic phases in the plane. Therefore, all failures of endpoint regularity estimates are clearly determined.

comments
52 pages, 4 figures. Several errors in the proof of Sections 3.2 and 3.3 have been corrected, and made minor changes to Theorem 1.4. The main results are unchanged
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.19854 ↗

We prove that, for every real Lipschitz function $A$ and every integer $n\ge1$, $\|T_{A,n}\|_{L^2(\mathbb{R})\to L^2(\mathbb{R})}\le C\,\|A'\|_\infty^n$, where $T_{A,n}$ is the $n$-th Calderón commutator and $C$ is an absolute constant.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.20489 ↗

We study the two lowest Bloch bands of the infinite Chern band model of Tan and Devakul in the semiclassical limit. When the Berry curvature parameter is an odd multiple of $π$, we show that the first two bands are exponentially close and meet at exactly one Dirac point. The proof combines Agmon estimates and WKB approximations for a matrix Schrödinger operator whose lowest potential eigenvalue has two wells. Geometric properties of the Agmon distance allow us to compute the leading tunneling coefficients by the method of stationary phase. We provide numerical computations to illustrate the asymptotic formula and support the conjecture that the two bands remain separated for other values of the Berry curvature parameter.

comments
35 pages, 4 figures; added a justification of the Dirac point
fields
Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2610.21462 ↗

We study the connection between the $SU(N)_{K}$ Wess-Zumino-Witten (WZW) model and $SU(N)_{K'}$ WZW model, enforcing the $\mathbb{Z}_{N}$ symmetries. The fundamental underlying structures are the (half-)integer spin simple currents in the topological quantum field theories and anomaly matching conditions in conformal field theories. For the (half-)integer spin simple current condition, we obtain the generalized pairing condition $K= \pm R^{2}K' (\text{mod}.N)$ with $\text{gcd}(R,N)=1$. On the other hand, the anomaly matching condition results in the weaker condition $K= \pm RUK' (\text{mod}.N)$ with $\text{gcd}(R,N)=\text{gcd}(U,N)=1$. The preservation law of the $\mathbb{Z}_{N}$ defects and symmetries is compatible only with the pairing condition.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.21478 ↗

In this paper we construct a theory of Postnikov invariants for (complete) homotopy Lie algebras that is preserved by the integration functor of Robert-Nicoud and Vallette. This result is in the same vein as Berglund's theorem, which relates the homology groups underlying a nilpotent homotopy Lie algebra to the homotopy groups of the associated space. We then deduce an integration functor from filtered Chevalley-Eilenberg cohomology groups to group cohomology groups.

comments
41 pages
fields
Algebraic Topology
pdf ↗ page arXiv:2610.21953 ↗

We develop a perturbative theory for minimal submanifolds with only (strongly) isolated singularities, with respect to varying background Riemannian metrics. As an application, we obtain a general "sporadic persistence" criterion, thus naturally complementing the non-persistence theorem by the authors. In particular, such a criterion is satisfied by the spherical suspension in $\mathbb{S}^{3m+2}$ of the Veronese embedding of $\mathbb{K}\mathbb{P}^2$ for $\mathbb{K}=\mathbb{R},\mathbb{C},\mathbb{H},\mathbb{O}$ (the normed division algebras) in the round spheres of dimension $3m+1=4,7,13,25$ respectively, thereby providing families of continuously varying $(2m+1)$-dimensional stationary varifolds with isolated singularities that are observable on an open set of metrics. By our previous results, these phenomena cannot possibly occur in the codimension one scenario.

comments
v2: added one item to the bibliography
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2610.22229 ↗

This paper is motivated by the recent work of Adamczewski and Faverjon [5], who established the algebraic independence of values of Mahler functions satisfying linear functional equations. While their work is a landmark result, some proofs are long and complex. The primary aim of this paper is to simplify those proofs and provide new applications. In their proofs, a vanishing theorem for polynomials, rather than power series, is sufficient. We give a proof of the vanishing theorem without using Szemerédi's theorem or Corvaja-Zannier's theorem. In the case of a single transformation, we present a refined vanishing theorem, which allows us to simplify the proof of algebraic independence. We also provide an elementary proof of a vanishing theorem for $q_i$-Mahler functions with various $q_i$. As an application, we prove the algebraic independence of certain continued fractions, extending previous results by Hančl, Adamczewski, and Bundschuh and Väänänen in which only linear independence and transcendence had been established.

comments
50 pages; v2: minor corrections in Section 3
fields
Number Theory
pdf ↗ page arXiv:2610.23435 ↗

In canonical quantum gravity the physical states solve the constraints but are typically not normalizable in the kinematical Hilbert space. Group averaging constructs them from normalizable kinematical seeds. We describe the geometry of this seed-to-state map in the language of geometric quantum mechanics. When averaging is an orthogonal projection, the admissible kinematical rays form a holomorphic vector bundle over the physical ray space. The embedded exact solutions form its zero section, and its fibers are strictly larger than gauge orbits. Observables descend to the base exactly when the Hessian of the squared constraint vanishes along their flow. For distributional physical states, group averaging on an explicit Sobolev test space yields an affine bundle of representatives. Its sections are embeddings of the physical ray space whose images contain no exact solutions. The test-space inner product singles out one of them, and narrowing the seed profile gives Weyl sequences of approximate solutions. We apply this to solvable loop quantum cosmology. Group averaging reproduces the Klein–Gordon physical inner product on an explicit test space. Because the scalar-field momentum enters the constraint quadratically, the constraint spectrum has an edge near the shell. The canonical section is then mode-dependent and not Kähler isometric, and the canonical seeds of small universes are biased off the shell. The edge also separates the Page–Wootters state from the slice of the Klein–Gordon solution. An ideal clock shows none of these effects. The results separate the canonical structures, namely physical rays, physical geometry and Dirac observables, from those that depend on a choice of seeds, test space or clock.

comments
26 pages. Discussion expanded
fields
Mathematical Physics
pdf ↗ page arXiv:2610.24027 ↗

Which laws can the sum of two uniform random variables have when nothing is known about how they depend on each other? For three or more uniform summands, convex order gives the answer; for two it does not, and the question has been open. We show that the attainable laws are exactly those that satisfy a family of explicit joint bounds on sums of tail probabilities, one bound for each finite set of thresholds. For laws with a density at most one, convex order alone decides. For densities at most two, convex order implies the simplest of the joint bounds, and the constant two cannot be raised for single-threshold bounds. The number of thresholds a law needs is set by the spacing of its atoms, not by how many atoms it has.

comments
25 pages, 1 table; 8-page supplementary material as an ancillary file. Code: https://doi.org/10.5281/zenodo.23231387. Companion paper: arXiv:2610.30058. v2: cites the companion paper by its arXiv identifier and states the two companion results used; code, data and results unchanged
fields
Probability, Combinatorics, Optimization and Control
pdf ↗ page arXiv:2610.24197 ↗

We obtain sharp two-sided estimates for the relative capacity of fat and thin annuli in the fractional Sobolev spaces $W^s_{p,q}$, where $s\in(0,1)$, $p\in(0,\infty)$, $q\in(0,\infty]$, in terms of an explicit volume growth quantity. The underlying space is a general metric measure space equipped with a doubling and reverse doubling measure. In particular, whenever the capacity is finite, the estimates are independent of the parameter $q$, and in the Ahlfors regular case with $p=q$ they recover Costea's logarithmic law at $sp=Q$. For $p<q$, we also introduce a sharp condition on the measure that is necessary for the existence of admissible functions in the space $W^s_{p,q}$. For thin annuli $(B_r,B_{r+\varepsilon r})$ under an $η$-annular decay property, we uncover a purely nonlocal phenomenon: for $sp <η$, the capacity remains bounded as $\varepsilon\to 0$, because the limiting competitor $χ_{B_r}$ already has finite energy, while if $sp\geqη$ it blows up as $ \varepsilon\to0$.

fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2610.24752 ↗

Inspired by the recent approach to edge universality of Cronvall and Wennman, we prove several local universality results for scaling limits in the bulk in the almost Hermitian regime, as well as associated results relating to reproducing kernel spaces of the Fock type.

comments
Some previous issues in the proofs have been fixed
fields
Probability
pdf ↗ page arXiv:2610.25364 ↗

We establish strong convergence in $L^2([0,T]\times[0,1])$ of weak solutions to a class of nonlinear PDEs with Robin boundary conditions to weak solutions of the corresponding Neumann and Dirichlet problems as the boundary parameter $κ$ tends to $0$ and $\infty$, respectively. Our approach relies on a particle system whose hydrodynamic limits yield the Robin problem for each fixed $κ>0$. An energy estimate derived from the microscopic stochastic dynamics provides the key bounds for passing to the subsequent limits $κ\to0$ and $κ\to\infty$, thereby obtaining the Neumann and Dirichlet problems.

comments
43 pages, 1 figure
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2610.25543 ↗

We prove the hyperplane conjecture, proposed by Hosono, Lian, and Yau in arXiv:alg-geom/9511001, for Batyrev's mirror pairs of Calabi–Yau hypersurfaces and its orbifold generalization, without assuming that the lattice points in the defining reflexive polytope generate the ambient lattice. We then identify the pushforward of the extended hypersurface \(I\)-function with a generating series of normalized compact periods of the mirror, providing a period interpretation of the hypergeometric series governing ambient genus-zero orbifold Gromov–Witten theory. As an application of our method, we also identify the residue of the Gauss–Manin connection and the cup product morphism on the \(A\)-side.

comments
Major revision. Proofs are simplified. We rewrote the intro and merged part of the section on the interior complex into Section 7. Additional lemmas are given to clarify details in Sections 7 and 9. We added a new section to explain the relationship between our results and the S-extended I-function introduced by Coates, Corti, Iritani, and Tseng. References are updated. Comments are welcome!
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2610.26186 ↗

In [Liu26a], varying the length and moment parameters in the cubic-theta argument of [Ope26a] gave the zero-free half-plane $Re(s)>B_{\mathrm{new}}=0.874957019420098946\ldots$ for finite-order Hecke $L$-functions over $\mathbb Q(\sqrt{-3})$ and for Dirichlet $L$-functions, and its optimality in the specified exponent comparison system. In this paper, we extend the argument to finite-order Hecke $L$-functions over cyclotomic fields containing $μ_{12}$ and, by class-field descent, to every pair $(K,η)$ whose cyclic class field has metabelian normal closure over $\mathbb Q$, including every finite-order character over every abelian number field. Then, adapting the averaged numerator estimate developed by Xu and Sang [XS26] for Hecke $L$-functions over $\mathbb Q(\sqrt{-3})$ and combining it with a limiting contradiction argument, we obtain the boundary $B_\flat=0.874886647039964\ldots$, the root near $0.8749$ of $133488B^4-376596B^3+384534B^2-167541B+26231$; it is the exact infimum of the refined comparison system, unattained by finite chains starting above it. Since the analytic argument uses only $μ_{12}\subset F$, we run it over $F=K(ζ_{12})$ for an arbitrary number field $K$ and descend: every finite-order Hecke $L$-function over every number field is zero-free for $Re(s)>B_\flat$, giving a uniform Quasi-Riemann Hypothesis over number fields. The analytic argument uses the exceptional-theta constructions and local calculations of the preprint [Ope26b].

comments
Comments are welcome
fields
Number Theory, Representation Theory
pdf ↗ page arXiv:2610.26835 ↗

We study the realization of the reverse braided category of the module category of a rational vertex operator algebra V. Using holomorphic extensions and commutant constructions, we prove that this realization property is preserved under suitable cosets, tensor products, extensions, and finite-group orbifolds. As applications, we establish the property for unitary Virasoro minimal models, affine vertex operator algebras of types ABCDE at positive integral levels, the corresponding principal W-algebras of type ADE, and related parafermion vertex operator algebras.

comments
24 pages, correct some errors in Section 4
fields
Quantum Algebra
pdf ↗ page arXiv:2610.26907 ↗

We determine which mass-action reaction networks on two species, one fast and one slow, admit a canard point: a singular Hopf bifurcation at a fold of the critical manifold, followed by a canard explosion. In flux coordinates, existence reduces to three linear equations, one linear inequation and a sign condition on the product of two linear forms, and the criticality of the explosion is the sign of an explicit cubic form. For four reactions with a balance matrix of full rank, both become integer polynomial conditions on the stoichiometry. A vacancy duality, which exchanges the activator–inhibitor and substrate-depletion mechanisms, preserves canard points together with their criticality. The central structural result is a mode criterion: a network has a canard point if and only if its elementary flux modes contain a sign-meeting pair and a mode carrying a fold. Hence every canard network contains a minimal one carried by at most three modes, and so by at most twelve reactions, whatever the molecularity. For complexes of molecularity at most three we enumerate all 138\,754 minimal canard networks and label each exactly by the criticalities it admits. None has more than six reactions; 32 have canard points of codimension zero and no explosion; and most six-reaction networks admit both criticalities, separated by degenerate canard points. All labels rest on certificates checked in exact rational arithmetic. Resolving the cubic steps into bimolecular ones through fast dimers keeps the canard points and changes the criticality only by an explicit term.

comments
25 pages, 2 figures. Data and code https://doi.org/10.5281/zenodo.23698722
fields
Dynamical Systems
pdf ↗ page arXiv:2610.27188 ↗

The open-loop minimum-energy control (MEC) problem asks for control inputs that minimize the control energy while ensuring the terminal state reaches a desired value. In this paper, we study the open-loop MEC problem for stochastic linear time-invariant systems. We consider a variety of stochastic constraints that enforce the terminal error to be small, and show that Stochastic MEC (SMEC) problem can be formulated as a QCQP. We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices. When the system dynamics is unknown, we obtain a direct data-driven solution to the SMEC problem using maximum-likelihood estimation and conformal calibration approaches. Finally, we quantify the sub-optimality and constraint violation of our data-driven solutions via finite-sample high-probability upper bounds, and highlight their dependence on the number of experiments, system dimension, and noise-to-signal ratio. We present numerical simulations to validate the theoretical results.

fields
Optimization and Control
pdf ↗ page arXiv:2610.27599 ↗

In this work, we establish existence and regularity results for solutions to nonlinear nonlocal equations of the form $f(Δ)u = U(x,u)$ and $f(Δ_{g})u = U(x,u)$ in Euclidean and Riemannian settings, respectively. We prove existence results across three distinct geometric scenarios: bounded domains in $\mathbb{R}^n$, perturbed equations on compact Riemannian manifolds, and noncompact Cartan-Hadamard manifolds under suitable geometric curvature conditions.

comments
38 pages
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2610.28572 ↗

The article presents a new modifications of the Milstein and Euler methods for systems of Ito stochastic differential equations with drift and diffusion coefficients having differentiable and non-differentiable or singular power-law time-dependent components (the latter depending only on the time variable). By iteratively applying Ito's formula to the mentioned differentiable components of the drift and diffusion coefficients, a new modification of the Milstein method is derived in the paper. A key feature of this modification of the Milstein method is the presence of time-dependent weight functions in the iterated Ito stochastic integrals of the second and first multiplicity (the specified weight functions are identically equal to unity in the classical Milstein method). To approximate the specified iterated Ito stochastic integrals (with respect to the components of a multidimensional Wiener process) that involve time-dependent weight functions, the paper proposes using the method of generalized multiple Fourier series, introduced by the author in 2006. The article also provides a modification of the Euler method and the Taylor-Ito expansion for Ito SDEs with non-differentiable or singular drift and diffusion coefficients. The convergence rates of the proposed modifications of the Milstein and Euler methods are established.

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

We establish a nonlinear theory of the Coulomb Landau equation in smooth bounded domains with non-isothermal diffuse reflection. We construct a stationary state, prove its perturbative uniqueness and global nonlinear stability, and establish exponential convergence when the wall temperature approaches its stationary profile exponentially. We also establish stationary and global nonlinear well-posedness for prescribed inflow, together with asymptotic stability. The analysis combines a critical kinetic integrability gain with finite-exponent velocity-gradient estimates near grazing, allowing the nonlinear Coulomb estimates to close without $L_x^\infty$ control of velocity gradients.

comments
This arXiv preprint provides a detailed companion to the more concise journal-submission version of the same title. This version is not intended for separate journal publication. 413 pages. v2: minor revisions; results unchanged
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.30111 ↗

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
29 pages. v2: minor changes in the introduction
fields
Probability, Combinatorics
pdf ↗ page arXiv:2610.30382 ↗

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 ↗

An identifying code of a graph is a dominating set $C$ such that the sets $N[v]\cap C$ are pairwise distinct. The minimum density of an identifying code has been studied extensively for several infinite grids. It is known to be $1/4$ for the triangular grid and $7/20$ for the square grid, whereas for the hexagonal grid the problem is still open, between $5/12$ and $53/126$. These three grids are the regular members of the family of the eleven Archimedean grids. In this paper, we start a systematic study of identifying codes in this family. We determine the minimum density for five of the nine Archimedean grids for which it was not known: it is $2/3$ for the truncated hexagonal grid, $3/7$ for the truncated square grid, and $1/3$ for the trihexagonal (kagome) grid, the elongated triangular grid and the snub hexagonal grid. All lower bounds are proved by the discharging method. For the three remaining non-regular Archimedean grids, we also obtain some bounds: the minimum density lies between $3/7$ and $13/30$ for the truncated trihexagonal grid, between $1/3$ and $11/30$ for the rhombitrihexagonal grid, and between $2/7$ and $9/28$ for the snub square grid. As a by-product, we prove that every identifying code of a cubic graph with the slow growth property in which every vertex lies on exactly one triangle (resp. $4$-cycle) has density at least $2/3$ (resp. $3/7$).

fields
Combinatorics
pdf ↗ page arXiv:2610.32192 ↗

We study the following prescribed scalar curvature problem $$ -Δu=K(y)u^{2^*-1},\ \ u>0 \,\ \ \text{in}\ \ \mathbb{R}^N, $$ where $2^*=\frac{2N}{N-2}$. For $N\geq4$, we construct a positive $K(y)$ with maximum set $\{|y|=1\}$ and critical order of flatness $m=N-2$ at $|y|=1$, such that the equation admits only finitely many positive solutions in $D^{1,2}(\mathbb{R}^N)$. To this end, we prove the compactness of the solution set for this equation by blow-up analysis and then apply Sard's theorem to choose $K$ for which each solution is non-degenerate and hence isolated, so that the solution set is finite. Our results also give a definite answer to Wei–Yan's conjecture in [J. Wei and S. Yan, JFA, 2010].

comments
20 pages
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2610.32707 ↗

We construct complete smooth Kähler metrics on $\mathbb{C}^n$ , $n\ge2$, with nonnegative Ricci curvature, Euclidean volume growth, and nonunique tangent cones at infinity. More generally, we prescribe the entire tangent cone set within a class of smooth Hopf cones, using a compact connected family of positive transverse Ricci forms on $\mathbb{C}\mathbb{P}^{n-1}$. We identify all metric blow-downs and their Ricci currents, compute the exact asymptotic volume ratio, and classify isometries between the model cones. In particular, the Kähler condition does not ensure uniqueness at infinity under nonnegative Ricci curvature and Euclidean volume growth, even in complex dimension two.

comments
The authors want to thank professor Gabor Szekelyhidi for drawing their attention to the related work of Arka Karmakar (https://arxiv.org/abs/2608.18432) in August
fields
Differential Geometry
pdf ↗ page arXiv:2610.32734 ↗

We show that there is a logarithmic separation between LZ77 and LZ-End, and between LZ77 and grammar compression.

fields
Information Theory
pdf ↗ page arXiv:2610.32818 ↗

Higher order sharp Sobolev and local Sobolev type inequalities for log-concave functions are established. The new inequalities directly imply the isoperimetric inequalities by Bollobás and Thomason in 1995, by Liakopoulos in 2019, and the recently discovered local isoperimetric inequalities from [1]. In order to do so, we make use of three ingredients. First, sets of functional inequalities proven by Alonso-Gutiérrez, Bernués, Brazitikos and Carbery in 2021. Second, a multidimensional polynomial optimization result that originated in [1] and was initiated by Bollobás and Thomason. Third, a new integral formula for the projection of a log-concave function that links the geometric part with the more functional versions via some dependence on the Hessian matrix restricted to subspaces.

fields
Metric Geometry, Differential Geometry, Functional Analysis
pdf ↗ page arXiv:2610.32886 ↗

We investigate the fourth-order Jordan-Moore-Gibson-Thompson equation $$ u_{tttt}+αu_{ttt}+βu_{tt}-γΔu_{tt}-δΔu_{t}-\varrho Δu=(f(u))_{ttt}+(f(u))_{tt} $$ under homogeneous Dirichlet boundary conditions in a smooth bounded domain $Ω\subset \mathbb{R}^n$ with $n\leq 3$, where $α\in \mathbb{R}$ and $β,γ,δ,\varrho>0$. First, for any suitably regular initial data and assuming that $f\in C^4(\mathbb{R})$ with $f(0)=0$, we prove that the corresponding initial-boundary value problem admits a unique maximal strong solution $u$ on $(0, T_{max})$. Second, by combining three time-integrated formulations with a series of resolvent-regularized energy estimates, we show that gradient blow-up is ruled out in the sense that \begin{equation} \tag{*} T_{max}<\infty \quad\,\, \Rightarrow\quad\,\, \limsup_{t\nearrow T_{max}}\|u(\cdot,t)\|_{L^{\infty}(Ω)}=\infty. \end{equation} Finally, assuming in addition that $f$ is convex and grows superlinearly in the sense that $$ f''(ξ)\geq 0 \;\; \mbox{ for all}\;\;ξ\in\mathbb{R}, \qquad \frac{f(ξ)}ξ\rightarrow +\infty\;\;\mbox{ as}\;\; ξ\rightarrow +\infty , \qquad \int_{ξ_{0}}^{\infty}\frac{dξ}{f(ξ)}<\infty \;\; \mbox{ for some}\;\; ξ_{0}>0, $$ we employ the extensibility criterion (*) to prove that, for a suitable class of initial data, the solution blows up in finite time in the $L^\infty$-norm. To the best of our knowledge, this provides the first rigorous description of finite-time blow-up for a genuinely nonlinear equation of fourth order in time.

comments
44 pages. Versions 1, 2 and 3 are identical: re-uploaded solely to fix an unreadable abstract in the metadata
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33213 ↗

We propose a hybridizable discontinuous Galerkin (HDG) finite element method to approximate the solution of the time-dependent Keller-Segel model, a drift-diffusion system describing chemotactic cell movement. We develop and analyze the corresponding HDG scheme, and establish theoretical convergence results for the proposed discretization. Finally, we present numerical experiments that confirm the theoretical findings.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.33260 ↗

The aim of this paper is to establish the existence of extremal functions for the Trudinger-Moser inequality with logarithmic weights $(-\log |x|)^β$ in two dimensions throughout the full range $0\le β<1$. We also extend recent results on the existence of local maximizers for the Trudinger-Moser functional beyond the critical threshold. Our approach uses polygonal profiles to establish a lower bound uniform in the weight parameter. An explicit thirty-node profile gives the lower bound $\mathrm{TM}_{4π}>4.38421793217\,π$ for the classical critical supremum on the unit disk, improving on the value $4.3556\,π$ obtained in the computer experiments of Carleson and Chang. This lower bound has a purely analytic proof, which uses only elementary inequalities and exact rational arithmetic. Numerical experiments with polygonal profiles of up to $102400$ nodes suggest that this lower bound can be raised to $4.402732044\,π$, which improves the recent computational lower bound by Li and Sun.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33439 ↗

Let $\mathcal P$ be a finite nonempty set of primes, and let $S_{\mathcal P}$ be the multiplicative semigroup that they generate. We prove that there are an invertible weakly mixing measure-preserving transformation $T$ and a set $A$ of positive measure such that $A\cap T^{-r}A=\varnothing$ for every $r\in S_{\mathcal P}$. This gives a negative answer to Bergelson's 1996 question concerning recurrence along $\{2^m3^n:m,n\geq1\}$, and applies to every finitely generated multiplicative semigroup of positive integers. More generally, we give a sufficient condition for weakly mixing non-recurrence based on divisibility properties and separation by finitely many rotations of the circle. This criterion also applies to an infinitely generated multiplicative semigroup not contained in any $S_{\mathcal P}$ with $\mathcal P$ finite.

comments
17 pages. Added references and a note on earlier unpublished work by Bryna Kra. Minor expository revisions. Main results unchanged
fields
Dynamical Systems
pdf ↗ page arXiv:2610.33710 ↗

We study convergence rates of Nesterov's Accelerated Gradient Descent (NAG) method for convex optimization in both deterministic and stochastic settings. We focus on a more general smoothness condition raised from several machine learning problems empirically and theoretically. We show the accelerated convergence rate of order $\mathcal{O}\left(1/T^2\right)$ in terms of the function value gap, given access to exact gradients of objective functions, matching the optimal rate for standard smooth convex optimization in \citep{nesterov1983method}. Under the relaxed affine-variance noise assumption for stochastic optimization, we establish the high-probability convergence rate of order $\tilde{\mathcal{O}}\left(\sqrt{\log\left(1/δ\right)/T}\right)$ and this rate could improve to $\tilde{\mathcal{O}}\left(\log\left(1/δ\right)/T^2\right)$ when the noise parameters are sufficiently small. Here, $T$ denotes the total number of iterations and $δ$ is the probability margin. Up to logarithm factors, our probabilistic convergence rate reaches the same order of the expected rate obtained in \citep{ghadimi2016accelerated} where the assumptions of bounded variance noise and Lipschitz smoothness are required. We additionally establish the convergence rates of the studied algorithms in the non-convex setting.

comments
First posted on openreview.net in Dec. 2025: https://openreview.net/forum?id=AlYT0ZD51A
fields
Optimization and Control
pdf ↗ page arXiv:2610.33761 ↗

Optimal designs for regression with asymmetric errors build on the second-order least squares estimator (SLSE) of Wang and Leblanc (2008), whose gain over ordinary least squares (OLS) comes from the error skewness. With i.i.d. errors the optimally weighted SLSE solves the same estimating equation as the degree-two Polynomial Maximization Method (PMM), a family whose degree-$S$ location estimator has asymptotic variance $g_S\le1$ times that of the sample mean. We derive optimal designs for this family when the errors are independent with constant variance but have standardised cumulants of order three and higher that vary with the regressor (cumulant heteroscedasticity). For a known reduction field $g_S(x)$, the $g_S$-weighted information matrix $M_{g_S}$ obeys the Kiefer-Wolfowitz equivalence theorem. A constant field leaves the OLS-optimal design unchanged; a non-constant field can change it but need not. For symmetric errors with varying kurtosis, the PMM$_2$ and conditional-SLSE designs cannot depart from the OLS-optimal one, whereas a degree-three design can. A stratify-and-pool PMM$_S$ estimator attains $N\mathrm{Cov}(\hatθ)\toσ^2M_{g_S}^{-1}$ at every degree as all strata grow; its per-stratum reduction is below one only for symmetric errors with the symmetry imposed. For a quadratic model on $[0,1]$ with symmetric Beta errors of unit variance and dose-varying shape, the third-order design for the known field has $A$-efficiency $1.047$ relative to the OLS-optimal design, and $1.001$ under the $D$-criterion. A two-stage procedure that estimates the field from a one-third pilot builds designs of $A$-efficiency $1.014$-$1.020$ at $N=600$-$2400$; its realised mean-squared-error ratio against the OLS-optimal design ranges from $0.89$ (a loss) to $1.08$.

comments
41 pages, 4 figures, 8 tables. Companion to arXiv:2606.11421 (second-order least squares as the degree-two polynomial maximization method). v3: adds the cost of a small asymmetry and the limit of plug-in designs; corrects the two-stage limit; code supplement v1.0.2
fields
Statistics Theory
pdf ↗ page arXiv:2610.33921 ↗

We introduce quantitative $K$-homology for uniform Roe algebras of discrete proper metric spaces with bounded geometry, based on the controlled $KK$-theory of Willett and Yu. We construct a comparison map from Lipschitz $K$-theory and prove that, for chain geodesic spaces, it is an isomorphism in a quantitative sense; in particular, quantitative $K$-homology is isomorphic to the inverse limit of the Lipschitz $K$-theory groups as the Lipschitz constant tends to zero. We also establish a pairing between quantitative $K$-homology and quantitative $K$-theory.

comments
35 pages
fields
K-Theory and Homology, Operator Algebras
pdf ↗ page arXiv:2610.34050 ↗

A robot searching for the source of an odor must eventually answer a notably hard question: have I arrived? Near the source, concentration gradients homogenize, turbulence corrupts the signal, and a small robot often lacks the positional accuracy to map the plume. Here, we describe a lightweight remedy inspired by a World War II statistics conundrum: the German tank problem. To approximate German armament production, Allied analysts developed an estimator based on serial numbers from captured tanks. Analogously, we use the same procedure over sampled chemical sensor readings from a robot to create estimates for the peak concentration of an odor plume, and therefore the odor's source. Treating each sensor reading as an observation, our unbiased estimator needs only a running maximum and a sample counter. A confidence bound turns both numbers into a principled rule that the robot or UAV can use to determine whether it should keep searching for the odor source. We derive the estimator and its bound, demonstrate its sample efficiency, and examine its robustness even when its assumptions fail. Finally, we summarize the estimator's role as the termination criterion for olfactory navigation.

comments
8 pages
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2610.34583 ↗

Redundant context affects attention in two distinct ways: multiplicity adds normalization mass, while score variation within correlated groups can produce extreme individual scores. We separate these effects in a planted retrieval model with exponentially many Gaussian distractors organized into supplied clusters whose number and size both grow exponentially with dimension. The model is a two-level generalized random energy model, whose classical free energy yields exact retrieval thresholds. Gaussian interpolation further shows that increasing positive correlation at fixed token count lowers the distractor free energy, unlike adding duplicates. Our main result establishes a sharp limitation of count correction, which subtracts the log cluster size from pre-softmax scores: this correction removes multiplicity but retains within-cluster extremes. Even when the inverse temperature is chosen after observing all scores, count correction requires a signal at least $\sqrt{2α_1}$, where $α_1$ is the exponential growth rate of the number of clusters. By contrast, averaging scores before exponentiation suppresses token-level fluctuations and lowers the optimal signal threshold to $\sqrt{2ρα_1}$, where $ρ$ is the within-cluster correlation. This gap persists after adding exponentially many singleton distractors, so group size alone does not identify the target, and extends, under explicit cumulant regularity assumptions, to fixed finite hierarchies of independent-increment scores. Finite-sample, stability, and participation results complement the asymptotic analysis. A controlled retrieval experiment with frozen sentence embeddings illustrates both sides of the distinction: averaging helps when the relevant item is a singleton, but can discard useful evidence when a relevant group contains multiple matching items.

comments
42 pages, 2 figures, 3 tables
fields
Probability
pdf ↗ page arXiv:2610.34682 ↗

We show that if $κ^{<κ} = κ$, then there is a $κ$-strategically closed, $κ^+$-c.c. partial order that forces $\square_κ$. We discuss consequences for generic large cardinals.

fields
Logic
pdf ↗ page arXiv:2610.34900 ↗

In 1986, Brualdi and Solheid asked which connected graph of prescribed order and size has maximum adjacency spectral radius. We complete the classification for every feasible pair of parameters. We prove that no graph outside the dense and star threshold families is extremal, including at ties, and settle the range $n\le e+1$, where the star candidate is not defined. The final comparison \emph{between} the dense and star candidates is supplied by Damnjanović's Propositions~4.1–4.2, not reproved here. We combine an exact Bellman recursion with dense-core domination, fractional complete-split bounds, and a virtual-star inequality. Three remaining comparison families (J), (K1), and (K2) are established analytically and by exact polynomial and Sturm certificates. The exact certificates are implemented in Python/SymPy and SageMath.

comments
44 pages, includes computer-assisted proofs and supplementary Python/SageMath verification programs
fields
Combinatorics
pdf ↗ page arXiv:2610.34905 ↗

Let f $\in$ C[x, y] be a trinomial and let g $\in$ C[x, y] be a sparse polynomial with N monomials (N $\ge$ 1). We address the problem of bounding the local intersection multiplicity of the bivariate polynomial system f = g = 0 at an isolated root q $\in$ (C * )^ 2 only in terms of N . Our main result establishes that the local multiplicity of the system at any isolated solution q $\in$ (C * ) ^2 is at most (N -1)(N +2)/ 2 , independently of the degrees of f and g. Furthermore, we know that this bound is sharp for N = 3.

fields
Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2610.35037 ↗

Godin (\textit{J. Fluid Mech.}, vol. 767, 2015, pp. 52–64) showed that compressible fluids in a uniform gravity field support finite-amplitude incompressible wave motions, in which every parcel conserves pressure and density, and constructed exact Gerstner-type surface and edge waves, possibly carried by currents. Using the short-wavelength instability method for compressible flows, we show that these waves are linearly unstable above a critical steepness. The stability of each fluid level reduces to a Floquet problem depending on two parameters: the steepness $\mathfrak{e}=e^{ka_2}$ and $ν^2=(1-\mathfrak{e}^2)ν_0^2$, where $ν_0^2=\cos^2α\,N_0^2/Ω^2$, $N_0$ is the buoyancy frequency of the hydrostatic reference state, $α$ the inclination of the plane of motion and $Ω=(gk\cosα)^{1/2}$ the intrinsic orbital frequency. In an isentropic fluid, a level is unstable if $\mathfrak{e}>1/3$, recovering Leblanc's threshold for Gerstner waves (\textit{J. Fluid Mech.}, vol. 506, 2004, pp. 245–254) and extending it to compressible surface and edge waves; weak stable stratification lowers the threshold to $\frac13-\frac{32}{81}ν_0^2+O(ν_0^4)$. In an isothermal atmosphere, $ν_0^2=κ\cosα/(kH)$, where $H$ is the pressure scale height. For horizontal wavelengths near $5.5\,H/\cosα$, principal subharmonic resonance makes the critical steepness vanish. For the fast airglow wave observed by Hecht et al. (\textit{J. Geophys. Res.}, vol. 107, 2002, D20, 4444), which Godin interpreted with his solution, the lidar temperature places the layer in which this interpretation is consistent on this resonance, where the critical steepness is typically 0.1 instead of $1/3$. Instability is confined to a layer beneath the free surface of surface waves and to a wedge at the shoreline of edge waves.

comments
4 figures
fields
Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2610.35210 ↗

Coron's return method established local nonlinear controllability of a moving water tank in sufficiently large time. We study the quadratic response at uniform equilibrium, where the acceleration input in the linearized model cannot excite the Fourier modes of the fluid with even indices. At three one-way wave crossings ($T=3$), we construct a nonzero smooth acceleration, whose first two final-state coefficients vanish. A planar curve reduces this cancellation to a scalar identity. At this reference acceleration, two integrations give an explicit control correction that preserves the linear return and produces any given leading change in the quadratic final state. The correction maps periodic $H^r$ targets with zero mean to $H^r$ controls for every nonnegative integer $r$. A contraction argument also gives local exact solvability of the quadratic final-state equation. Finally, a time-dependent Sylvester equation provides an alternative representation of the coupling responsible for the second-order correction. The associated change of state coordinates involves one spatial derivative, while the control correction preserves regularity in appropriate Sobolev spaces. These results concern the first two variation equations only. Keywords: Controllability, control of partial differential equations, return method, Saint-Venant equations, Sylvester equations.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35319 ↗

We propose and analyze a fully discrete numerical scheme to approximate solutions to the inertial Landau-Lifshitz-Gilbert (iLLG) equation, a state-of-the-art model to describe the dynamics of the magnetization at subpicosecond time scales. The method employs first-order finite elements for the spatial discretization and the two-step backward differentiation formula (BDF2) for the time discretization, where the inertial term is treated by a convex combination of BDF2 and the backward Euler method. We prove well-posedness and unconditional stability of the scheme, and obtain explicit bounds for the error in the realization of the iLLG-inherent unit length constraint satisfied by the magnetization. Moreover, we derive the discrete energy law satisfied by the approximations, which resembles the inherent dissipative energy law of the model. Finally, with a constructive approach, we prove unconditional convergence of the approximations toward a weak solution of the problem. Numerical experiments assess the performance of the scheme and validate the theoretical findings.

comments
40 pages, 26 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.35382 ↗

Tropical forests are undergoing deep changes caused by human activities, which have repercussions on the habitats of wild animal, particularly mammals. As mammals serve as a main source of blood meals for forest mosquitoes, their decline may affect the mosquitoes, as do changes in their habitats and abiotic conditions, such as rainfall, temperature, etc. Finally, along with humans come new species of mosquitoes-more generalist and more anthropophilic-that adapt to these new conditions and, moreover, serve as vectors for re-emerging diseases against which local populations have no more immunity. In this work, we derive a deterministic model which includes the effects of anthropisation, two species of mosquito that interact with one another (one is a generalist, whilst the other is sedentary and lives in the forest), and blood feeding preferences between multiple blood sources. We consider two socio-ecological areas, corresponding to a domestic area (for instance, a village), and a wild area (for instance, a tropical forest). A comprehensive analysis of the system is carried out using classical theory and monotone systems theory. We analyse the efficiency of individual protective measures, such as mosquito nets and repellents, against the domestic mosquito species. We investigate the risk of invasion of the wild area by a generalist mosquito species. We show that habitat anthropisation and high interspecific competition facilitate the invasion. When the mathematical system converges towards a periodic cycle, we provide numerical estimates for the periodic invasion threshold. Using a global sensitivity analysis, we show that the model is sensitive to the level of anthropisation, the adaptability of the invasive species to the forest area, and its fitness. The more efficient way to control the invasion is, therefore, to limit, as much as possible, the forest anthropisation.

comments
43 pages, 16 figures, 6 tables
fields
Dynamical Systems
pdf ↗ page arXiv:2610.35435 ↗

Let $V_{g,n}$ be the Weil–Petersson volume of the moduli space of hyperbolic surfaces of genus $g$ with $n$ cusps. The fixed-$n$ large-genus expansion of Mirzakhani and Zograf has correction terms polynomial in $n$ of degree $2i$ at order $g^{-i}$, and ceases to be uniform when $n$ is of order $\sqrt g$. We prove an asymptotic expansion in powers of $1/g$ that holds uniformly in all $n\ge0$, with coefficients analytic in a density parameter that ranges over a compact interval, including the limits $n/g\to0$ and $n/g\to\infty$. Its leading term is explicit, contains no undetermined constant and has relative error $O(1/g)$; truncation at an order proportional to $\sqrt g$ gives relative error $O(\exp(-a\sqrt g))$ for some $a>0$. For fixed $n$ this confirms Zograf's conjecture that the constant in the Mirzakhani–Zograf asymptotics is $1/\sqrtπ$. We also determine, at every cusp density, the limits of the volume ratios $V_{g,n}/V_{g-1,n+2}$ and $V_{g,n+1}/(2gV_{g,n})$ and, in all degrees, the asymptotics of the ratios of adjacent coefficients of the one-boundary volume polynomial; this answers two questions of Mirzakhani. The proof deforms mixed $κ_1$--$ψ$ intersection numbers into pure $ψ$ intersection numbers along a family whose recursion has nonnegative coefficients, fixes the overall constant through Painlevé I without assuming resurgence, and recovers individual volumes by a local limit theorem in the number of cusps. As an application, the spectral gap of a Weil–Petersson random surface with $n\gg\sqrt g$ cusps tends to zero in probability; this removes the restriction $n/g\to0$ from a theorem of Shen and Wu.

comments
111 pages, no figures. v3: added the critical-scale primitive length spectrum; revised and expanded proofs, exposition and references. An earlier version (Zenodo v1) was published on 16 October 2026: https://zenodo.org/records/23414478
fields
Differential Geometry, Algebraic Geometry
pdf ↗ page arXiv:2610.35492 ↗

We prove that every critical spherical catenoid in a geodesic ball of hyperbolic three-space has Morse index four and nullity two. This resolves Medvedev's index conjecture throughout the parameter range of the catenoid family. The kernel consists precisely of the normal components of rotations that preserve the center of the ball and tilt the axis of the catenoid. As consequences, the radius of the supporting ball increases strictly along the family, and each critical spherical catenoid admits a smooth family of free boundary constant mean curvature deformations in its supporting ball. The proof combines a global boundary inequality obtained from a Wronskian, a positive Dirichlet eigenfunction supplied by the time component of the unit normal, and a Riccati comparison for the angular mode $k=2$. A ground-state identity then yields positivity of every angular mode $k\ge2$.

comments
14 pages. v2: added a corollary on equivariant nondegeneracy and free boundary CMC deformations (Corollary 11) and a self-contained proof that $r(a) \to 0$ as $a \to 1/2$ (Lemma 10); references added. Main theorem unchanged
fields
Differential Geometry, Analysis of PDEs, Spectral Theory
pdf ↗ page arXiv:2610.35651 ↗

In 2010, Haglund, Luoto, Mason and van Willigenburg proved that the product of a Schur function $s_λ$ and a Demazure atom $A_γ$ expands positively in terms of Demazure atoms, and interpreted the coefficients as the number of Littlewood-Richardson skew skyline tableaux of a given shape and a filling type. Extending this approach, they further established the positive expansion for the product of a Schur function $s_λ$ and a quasisymmetric Schur function $S_α$, or of a Schur function $s_λ$ and a Demazure character $κ_γ$. In particular, the latter provides a refinement of the classical Littlewood-Richardson rule. We present a natural $t$-analogue of these positive expansions by deriving the expansion for a product of a Hall-Littlewood polynomial $P_λ(t)$ and a $t$-Demazure atom $E_γ(t)$ in terms of $t$-Demazure atoms. The corresponding coefficients are $\mathbb{N}\,[t,1-t]$-positive; that is, they are polynomials with nonnegative integer coefficients in $t$ and $1-t$, and they are interpreted in terms of standard Young tableaux. We take the approach of connecting the multiplication coefficients with the LLT polynomials, which differs from the combinatorial insertion arguments of Haglund, Luoto, Mason and van Willigenburg.

comments
28 pages, 7 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.35708 ↗

Let $\mathcal{M}$ be a positroid. We prove that the positroid variety $Π_{\mathcal{M}}$ is toric with respect to some algebraic torus if and only if $\mathcal{M}$ is regular. In that case, $Π_{\mathcal{M}}$ is toric with respect to the standard diagonal torus. Thus, there are no unexpected toric positroid varieties.

comments
Added a note acknowledging independent prior work and the corresponding reference. No changes to the results or proofs
fields
Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2610.35914 ↗

Artificial intelligence (AI) is expected to disrupt research across academia, changing how knowledge is produced and how research is organized. Recent developments in mathematics provide an early example of strong AI research capabilities and the professional disruption accompanying them. Universities should respond by building the scientific, computational, and organizational capacity to develop AI and shape the research it enables. The relationship is reciprocal: AI can advance disciplinary research, while scientific questions, experimental evidence, and disciplinary expertise can guide AI development. This article proposes connecting shared computational resources with sustained technical teams, interdisciplinary research, experimental facilities, and knowledge infrastructure that makes findings traceable and reusable. It distinguishes three commitments with different resource requirements: operating existing models, developing AI for disciplinary research, and investigating the foundations of AI. Commercial services can support this agenda alongside institutional capabilities for independent investigation, evaluation, and preservation of the research record. Consortia and national facilities can broaden participation and support capabilities beyond individual campuses. Initial programs should assess scientific value, total costs, and contributions to AI development, with expansion guided by evidence. These changes require sustained funding, professional support, and recognition of the work that makes research reliable and cumulative. Building this capacity will enable universities to pursue new research directions, train future researchers, and exercise scientific leadership as AI transforms academic inquiry.

fields
General Mathematics
pdf ↗ page arXiv:2610.35919 ↗

Let \(G\) be a compact Lie group acting Hamiltonianly on a symplectic manifold \(M\) with moment map \(μ:M\to\g^*\). For a singular value \(a\) of \(μ\), the symplectic quotient \(μ^{-1}(a)/G\) is stratified and the classical Kirwan map is not defined. We introduce a \emph{formal neighborhood equivariant cohomology} \(\cH_G^*(a)\) using the slice-groupoid Cartan sheaf and the closed embedding \(μ^{-1}(a)/G\hookrightarrow N_a/G\) for a \(G\)-invariant neighborhood \(N_a\) of \(μ^{-1}(a)\). We define a formal Kirwan map \[κ_{\mathrm{formal}}:H_G^*(M)\longrightarrow \cH_G^*(a).\] We prove that it is surjective under a local equivariant homotopy retraction condition on the slice level sets \[ C_x=μ_x^{-1}(a|_{\g_x})\subset S_x, \] which is satisfied. We also prove an equivariant tubular neighborhood theorem for singular level sets: under real analytic/proper or \(G\)-invariant Whitney stratified assumptions, there exists a \(G\)-invariant open neighborhood \(U\) of \(μ^{-1}(a)\) and a \(G\)-equivariant strong deformation retraction \(U\toμ^{-1}(a)\). When such a neighborhood exists, the formal cohomology is canonically isomorphic to the Borel equivariant cohomology of the level set, and the formal Kirwan map is the classical restriction map. The formal framework therefore yields a Kirwan-type map at the singular value with the surjectivity property. As an application we recover the even-degree surjectivity theorem of Delarue–Ramacher–Schmitt for \(S^1\)-actions and clarify why odd-degree surjectivity fails in general.

comments
24 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.35936 ↗

We ask how much of a large random system must be observed before a global average can be inferred with controlled uncertainty. For the random transposition shuffle, a conjugate Bayesian estimator of the average displacement, computed from $m$ uniformly sampled cards, has relative uncertainty $1/\sqrt{2m}$, independent of the deck size $n$. The law of total variance exposes a second error, the floor $R_n$, which arises because the observed configuration is a single draw from equilibrium: no relative tolerance below $κ\sqrt{R_n}$ can be certified, even by a census. For the shuffle we derive $R_n=(2n^2+7)/\bigl(5(n-1)^2(n+1)\bigr)$ and show that the posterior remains calibrated. At the critical point of the two-dimensional Ising model the floor of the energy vanishes, whereas that of the magnetisation stays near $0.072$; its mean-field limit is $\sqrt{2}-1$. For correlated fields read by sensor networks, the usual $95\%$ interval covers the ensemble mean in $7\%$ of cases. Bounding the floor from one realisation, as in single-chain Monte Carlo diagnostics, requires an assumption on the decay of correlations.

fields
Probability
pdf ↗ page arXiv:2610.35973 ↗

Accelerated dynamics methods, such as parallel replica dynamics, require estimates of the decorrelation time, after which a process trapped in one of its metastable states is distributed according to the quasi-stationary distribution (QSD). In a method proposed by Binder, Lelièvre and Simpson, decorrelation times are defined by coupling a particle approximation of the non-linear conditioned probability flow of the process with MCMC-inspired diagnostics. We explore an alternative to MCMC diagnostics, based on coarse-graining of non-linear probability flows and simulation-based inference. We first develop a coarse-graining framework for killed Markov jump processes conditioned on survival, proving uniform-in-time, non-asymptotic estimates approximating the non-linear probability flow of the true process by the non-linear flow of a surrogate process, defined with a collective variable. The framework does not assume reversibility of the true process, and also gives bounds which scale explicitly in an adiabatic regime. Motivated by these results, we then construct a quasi-stationarity diagnostic using simulation-based inference: a recurrent neural network (RNN), trained on particle approximations of non-linear effective flows, estimates posterior probabilities of decorrelation. The learned diagnostic is then transferred to collective-variable traces of high-dimensional particle approximations. We investigate the behavior and robustness of this diagnostic on a set of numerical experiments, comparing it to the MCMC diagnostic of Binder et al.\ on both synthetic examples and a molecular system, in and out of its training prior distribution. When its prior assumptions hold, the RNN diagnostic outperforms the MCMC diagnostic in ROC analysis, is less conservative, fails less often, and has an interpretable decision threshold.

comments
91 pages, 18 figures, 3 tables
fields
Probability
pdf ↗ page arXiv:2610.36078 ↗

We study Monte Carlo power iteration algorithms in the context of reactor criticality simulations. Under mild conditions on the underlying physical system and the algorithmic structure, we derive explicit error bounds, which are to the best of our knowledge the first rigorous results for such methods which are ubiquitous in nuclear engineering. This is done by exploiting connections to Sequential Monte Carlo algorithms, and extending recent developments about stochastic neutron transport. We demonstrate the applicability of our results by considering a concrete version of the Monte Carlo power iteration algorithm as well as variance reduction schemes.

comments
29 pages
fields
Numerical Analysis, Probability
pdf ↗ page arXiv:2610.36266 ↗

We investigate an impulsive Hopfield-type neural network with a generalized piecewise constant argument, including the nonimpulsive case in which all jump terms vanish. The piecewise constant argument is given by $γ(t)=ζ_k$ on each interval $[t_k,t_{k+1})$, where $t_k\leqζ_k\leq t_{k+1}$, $k\in\mathbb{N}_0$. Depending on the position of $ζ_k$, the argument may be advanced, retarded, or of mixed type. By representing periodic solutions through a Green function and applying a fixed-point argument, we obtain explicit and verifiable sufficient conditions for the existence and uniqueness of an $ω$-periodic solution. We then use a Gronwall-type estimate, together with period averages, to prove that this solution is globally exponentially attractive. These conditions can be checked directly from the system parameters, without requiring explicit knowledge of the periodic solution. In the course of the analysis, we also revisit and correct some estimates presented by Pinto et al. \cite{Pinto_ejqtde}. The case $ζ_k=t_k$ reduces to their setting, whereas our results cover the more general choice of $ζ_k$ within each interval. We also present examples illustrating different types of piecewise constant arguments.

comments
29 pages, 6 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2610.36560 ↗

We study weak solutions of the incompressible and the compressible Navier–Stokes–Vlasov systems on a bounded domain, where a viscous fluid is coupled to a dispersed particle phase through a drag force; the fluid obeys the no-slip boundary condition and the particles are subject to specular reflection. For solutions with Besov regularity, we show that the Vlasov equation is renormalizable in the sense of DiPerna–Lions, and we give regularity thresholds for the validity of the global energy equality. If the distribution function $f$ belongs to $B_p^{α,\infty}$ in space and velocity with time integrability $p$, and the fluid velocity $\mathbf{u}$ belongs to $B_q^{β,\infty}$ jointly in space and time with integrability $q$, then the energy equality holds provided $α+β>1$ and $β$ exceeds an explicit bound depending on $p$, $q$ and the dimension, under a natural integrability assumption on the pressure; an analogous criterion holds for the compressible system when the density is bounded from above and below. The condition $αp>1$ imposed on $f$ is not merely technical: it is exactly the range in which the macroscopic momentum flux possesses a boundary trace, so that the specular reflection condition passes to the macroscopic energy balance. When the particle phase is absent, our thresholds coincide with the criteria $β>\frac12+\frac1q$ and $β>\frac3q$ obtained by Yu for the incompressible Navier–Stokes equations alone. The proofs combine a boundary cutoff argument with commutator estimates based on a scale-localized Besov modulus, together with a boundary-strip analysis.

comments
Submitted to Arch. Ration. Mech. Anal
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.36579 ↗

Let $K$ be a fixed number field. We prove a quantitative expansion theorem for mixed sumsets $A+B$, assuming only that $A$ is covered by relatively few cosets of a multiplicative group of small finite valuation rank. The constants are independent of the generators, their heights, and their prime ideal supports. As a consequence, if $A\subset K^\times$, $|A|=N\ge 3$, and each element has nonzero valuation at at most $k$ finite places, then every $B\subset K$ with $|B|=N$ satisfies $$ \max\{|A+B|,|AA|\} \ge N^2\exp\left[-C_K\left((k+1)\log(\log N+2)+\sqrt{(k+1)\log N}\right)\right]. $$ This is $N^{2-o(1)}$ for $k=o(\log N/\log\log N)$. We also obtain a trade-off between the additive and multiplicative deficits, estimates for iterated linear sumsets, and a transfer theorem for product constructions $A=PG$ in terms of the multiplicative deficit of $P$. The proof recovers local scales from an exact sum and bounds the remaining conditional entropy by the overlap of entropy measures on fixed trees.

comments
Section 1.4 contains inaccurate AI-generated explanations. The manuscript did not disclose AI assistance with language editing, translation, typesetting, some mathematical derivations, or reference searches. The core ideas and original formulas are the human authors' work. Some derivations need independent verification; we therefore request withdrawal
fields
Number Theory
pdf ↗ page arXiv:2610.36930 ↗

Let $\mathcal{B}_α$ denote the shift operator on the weighted Bergman space $A^2_α(\mathbb{D})$. We prove that, for every integer $k\geq1$, the Beurling-type theorem holds for $\mathcal{B}_α^k$ on $A^2_α(\mathbb{D})$ if and only if $-1<α\leq1$. We also show that, for every $α>-1$, there exists a finite Blaschke product $B$ such that $M_{B}$ admits a cyclic invariant subspace but fails the wandering subspace property.

comments
18 pages
fields
Functional Analysis, Complex Variables
pdf ↗ page arXiv:2610.37035 ↗

Canonical Ramsey theory studies structured colour patterns in colourings with arbitrarily many colours. Lefmann's canonical Rado theorem extends the canonical van der Waerden theorem of Erdős and Graham to partition-regular linear systems. Recently, Alvarado, Kohayakawa, Morris, Mota and Ortega proved a sparse canonical van der Waerden theorem for random set $[n]_p$. In this paper, we prove a sparse canonical Rado theorem. For every irredundant partition-regular matrix $A$ of positive rank with $k\ge3$ columns, and every prescribed partition witnessing the columns condition, if $p\ge Cn^{-1/m(A)}$, then with probability at least $1-e^{-cnp}$ every colouring of $[n]_p$ contains $$Ω\big(p^k n^{k-\rank(A)}\big)$$ canonical solutions of $A\mathbf x=0$ with distinct coordinates. A matching 0-statement holds when the prescribed partition has one or at least three blocks; the Schur equation shows that it can fail for two-block patterns. For every prescribed partition, we also establish a robust threshold at the same scale under deletion of a fixed positive proportion of the random set.

fields
Combinatorics
pdf ↗ page arXiv:2610.37053 ↗

We study stationary coexistence in stochastic Gause predator-prey systems with independent multiplicative environmental noise and trophic responses depending on both population densities. A weighted population balance cancels the trophic interaction and yields moments of order greater than one without imposing predator self-regulation. These estimates give a direct occupation-measure proof of a sufficient coexistence criterion based on prey establishment and predator invasion of the prey-only stationary environment. For responses whose rare-predator limit is strictly increasing and whose value at positive predator density never exceeds that limit, we also establish necessity of positive predator invasion whenever the prey-only stationary law exists. If the prey per-capita growth attains its global maximum at zero, interior stationarity itself forces prey establishment, giving a necessary-and-sufficient criterion beyond logistic growth. Logistic and bounded saturating growth laws provide explicit Gamma and beta-prime resident distributions. Applications include Holling, Ivlev, Beddington-DeAngelis, and Crowley-Martin responses. Responses with the same rare-predator limit share the coexistence threshold, although predator interference changes the interior distribution. Reproducible quadrature and simulations illustrate this distinction. The analysis builds on existing stochastic persistence theory and identifies precisely the additional comparison argument needed for necessity, including exclusion of interior invariant measures at zero predator invasion.

comments
17 pages, 3 figures; v2: corrected statement on the use of generative AI
fields
Probability, Dynamical Systems
pdf ↗ page arXiv:2610.37372 ↗

For each time $t$, the regression function $m_t(x)=E[Y_t\mid X_t=x]$ of an outcome on contemporaneous covariates can be regarded as a field on covariate space. When the covariates of units move as a diffusion and each unit's outcome has its own dynamics, we show that $m_t$ satisfies a second-order evolution equation whose diffusion term is $\frac12\mathrm{tr}(Σ\nabla^2 m_t)$, the Hessian of the regression function weighted by the covariance $Σ$ of covariate increments, whose transport term is the drift of the time-reversed covariate process, and whose source term is the conditional mean rate of change of the outcome; this yields a Feynman-Kac representation along reversed covariate paths. We relate this Hessian to quadratic regression (under Gaussian design the best quadratic approximation has Hessian $E[\nabla^2 m(X)]$) and to kernel smoothing bias. For bistable replicator dynamics on covariate space, travelling fronts are exactly logistic in $(x,t)$, so one logistic regression identifies the diffusion-reaction ratio and the invading strategy. We then ask whether spread in covariate space reflects fluctuating unit characteristics or imitation among similar units. Imitation acts through exactly the same operator as covariate fluctuation, so the two are observationally equivalent in the regression field; panel data separate them because they identify $Σ$ directly. The two cannot be separated on a travelling front, and we propose a split-sample instrumental-variables test that works on seeded, non-front profiles, with size and power evaluated in agent-based experiments.

comments
13 pages, 2 figures. Code for the symbolic checks and simulations is included as ancillary files
fields
Statistics Theory
pdf ↗ page arXiv:2610.37500 ↗

Get each issue by email →