Paperlane

no. 16 · from the archive← Mon 16 Nov archive Wed 18 Nov →

Tuesday, 17 November 2026

1388 papers in 32 fields

Analysis of PDEs89

We study Kirchhoff-Boussinesq-type equations on closed Riemannian manifolds $(M,g)$ of the form \[ \sum_{j=0}^m a_i(-Δ_g)^m u \pm \text{div}_g(\vert\nabla u\vert_g^{p-2}\nabla u) = f(u),\qquad \text{ on }\ M, \] where $m<\dim M/2$, $(a_0,a_1,\ldots a_m)\in C^\infty_+(M)\times [0,\infty)^{m-1}\times(0,\infty)$, $2<p\leq\frac{2\dim M}{\dim M- 2}$ and $f:\mathbb{R}\rightarrow\mathbb{R}$ is a continuous nonlinearity of superlinear type with subcritical or critical Sobolev growth. We briefly motivate the above equation in the case of $m=2$, as an extension of the stationary Kirchhoff-Boussinesq equation when modeling the dynamics of curved elastic plates. Under some symmetry assumptions, we prove the existence of multiple equivariant solutions when considering critical Sobolev nonlinearities and, for subcritical ones, we also prove the existence of ground-state solutions. As a byproduct, we prove a Gagliardo-Nirenberg interpolation inequality and give several equivalent norms on the higher order Sobolev space $H_g^m(M)$.

fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2608.26512 ↗

We establish global well-posedness and modified scattering for the three-dimensional Dirac-Klein-Gordon system with a massive spinor and a massless scalar field, for small, sufficiently regular and localized initial data. This answers a question posed by Dong, Li, and Yuan in \cite[Case IV]{DLY23}. We also identify a Majorana-type condition on the initial data that yields linear scattering, showing that both linear and modified scattering solutions coexist in this model. Conversely, we establish asymptotic completeness for small asymptotic profiles satisfying suitable regularity and decay assumptions. The forward argument combines the hyperboloidal foliation method with testing by wave packets, whereas the backward construction relies on a contraction argument in suitably chosen norms.

comments
70 pages, 5 figures
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2611.18854 ↗

We consider the problem $- Δ_n u = h(x) e^u$ in a bounded domain $Ω$ of $\mathbb R^n$, where $Δ_n$ stands for the $n$-Laplacian and $h$ is a continuous function satisfying $0 < a \leq h \leq b$. Several new a priori estimates are obtained for the sets of solutions whose boundary oscillation is uniformly bounded by some constant. Those results are exploited to provide a profile decomposition in $L^\infty$-sense for a sequence of blowing-up solutions. We also present an optimal Harnack type inequality, which states that on a compact set $K \subset Ω$ we have a universal estimate $\displaystyle \sup_K u + (n-1)\displaystyle \inf_Ω u \leq C$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.18941 ↗

We study the inhomogeneous Landau equation with very soft and Coulomb potentials, $γ\in[-3,-2]$, for data near vacuum. Unlike for $γ>-2$, the collisions along a free trajectory have a divergent time integral, so the dynamics is not a perturbation of free transport. It is instead organized along \emph{leaves}, the velocity distributions in the variable $z=x-tv$: on each leaf the solution follows a homogeneous Landau flow with a leaf-dependent collision rate, first far from equilibrium and then near a Maxwellian whose parameters approximately solve a compressible Euler system with the free-expansion prefactor $t^{-2}$. For data of size $ε$, analytic in velocity and Gaussian in space, we prove global existence of classical solutions, relaxation of every leaf (not uniform in $x/t$), and convergence of the leaf parameters at rate $t^{-1}$. The solution scatters in $L^1$ to the free transport of a thermalized profile that generally remains at a fixed relative distance from the data. The $L^1$ distance to the scattering state decays like $(1+ε\log t)^{-(p-3)/p}$ at $γ=-2$ and $(1+εt^{|γ|-2})^{-(p-3)/p}$ for $γ<-2$, where $\langle v\rangle^{-p}$ is the velocity decay of the data; these rates are sharp when the spatial profiles stay away from Maxwellians. Each leaf relaxes on its own clock: as a power of $t$ proportional to its collision rate at $γ=-2$, and as a stretched exponential of its clock for $γ<-2$. We also prove the near-Maxwellian and homogeneous results we need beyond the literature, including at $γ=-2$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.18962 ↗

We show that on a bounded uniform domain $Ω\subset\mathbb{R}^{n+1}$, $n\geq2$, with $n$-Ahlfors regular boundary, and given a second-order homogeneous linear strongly elliptic operator $L=-\mathrm{div} A\nabla$ with bounded measurable coefficients, for which both $(\operatorname{D}_{p'}^{L^*})$ and $(\operatorname{N}_p^L)$ are solvable in $Ω$, the following sharp and novel approximation result holds for the Neumann problem \[ \left\{\begin{aligned}-\mathrm{div} A\nabla u&=0,\qquad&\text{in }&Ω,\\ \partial_{ν_A} u&=g,\qquad&\text{on }&\partialΩ,\end{aligned}\right. \] with data $g\in L^p$, $p\in(1,\infty)$: There is a sequence of compactly supported Lipschitz functions $\{H_j\}_j$ with uniformly bounded norm in the space ${\bf C}_{2,p}$, such that if $w_j$ is the weak solution $w_j\in W^{1,2}(Ω)$ to the Poisson-Neumann problem \[ \left\{\begin{aligned}-\mathrm{div} A\nabla w_j&= H_j,\qquad&\text{in }&Ω,\\ \partial_{ν_A}w_j&=0,\qquad&\text{on }&\partialΩ,\end{aligned}\right. \] then $\nabla w_j\to \nabla u$ as $j\to\infty$ in the weak-$*$ topology of $({\bf N}_{2,p})^{n+1}$. We also show a variant of this approximation theorem for the rough Neumann problem with data in $W^{-1,p}$. These results are analogues of an approximation result recently discovered by the first two authors in the case of the Dirichlet problem with data in $L^p$. Moreover, we show that an analogous approximation theorem is not viable for the Dirichlet-Regularity problem, nor for the variational Dirichlet problem. All of the results are new even in the case of the Laplacian and on the unit ball.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.18967 ↗

We prove a Harnack inequality and Hölder continuity of solutions to non-linear nonlocal equations on homogeneous groups. In addition, we show basic properties of the involved Sobolev spaces, which are crucial for the analysis of such operators.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19003 ↗

For any two-dimensional flat torus $E_τ:=\mathbb{C}/(\mathbb Z+\mathbb Zτ)$ and any $t>0$, we prove that the heat kernel $p_τ(z,t)$ has either four or six critical points on $z\in E_τ$ (i.e., including four trivial critical points and at most one pair of nontrivial critical points). This is interestingly consistent with Lin-Wang's remarkable result (Ann. Math. 2010) for the Green function. The key idea is to show that any nontrivial critical point (if it exists) is a nondegenerate global minimum point. Furthermore, we classify the types of all critical points, as well as the splitting phenomena that occur when the number of critical points changes. Applications to Riemann theta functions are also given.

comments
47 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19067 ↗

Euler equations for a spatially periodic surface in a two-dimensional fluid of a finite depth are reduced to a system of evolution equations after a conformal transformation. Compared to the previously developed formal approach, we show that the system of evolution equations is complemented by two constraints which determine the new depth in conformal variables and the Bernoulli integration constant. A locally unique continuation of the traveling Stokes waves with respect to the wave speed is studied by using arguments based on the implicit function theorem. We show that the constraints on the traveling wave profile recover the correct small-amplitude expansion of Stokes waves in physical variables. We also prove for the co-periodic stability problem that the real unstable eigenvalues may bifurcate from the zero eigenvalue only at a critical point of the wave energy. Finally, we perform numerical approximations of the wave profiles for both small and large amplitudes and illustrate different bifurcations along the solution family.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19069 ↗

Let $c(Ω)$ be the Bernoulli constant of a bounded domain $Ω\subset\R^N$, that is, the infimum of the parameters $λ$ for which the interior Bernoulli free boundary problem $Δu=0$ in $Ω\setminus K$, $u=0$ on $\partialΩ$, $u=1$ and $|\nabla u|=λ$ on $\partial K$ admits a classical solution. Flucher and Rumpf asked whether $c(Ω)\ge c(Ω^*)$, where $Ω^*$ is the ball of the same volume. The variational analogue was settled by Daners and Kawohl, but the variational constant differs from $c$ already for the ball, and the original question remains open. We prove the following. (i) Through a conformal parametrisation of $Ω\setminus K$ by an annulus, every classical solution in a simply connected planar domain with connected, filled free set satisfies $λ\geμ/R$, where $πR^2=|Ω|$ and $μ\approx 2.485268$; hence $c(Ω)\ge 0.9142\,c(Ω^*)$ for every bounded planar convex domain of class $C^1$. (ii) In this class, the Flucher–Rumpf inequality is equivalent to an area inequality for analytic functions in an annulus, which also provides an explicit generator of exact solutions. (iii) A Rellich–Pohozaev identity yields, in every dimension $N\ge2$ and for every strictly star-shaped domain, $c(Ω)\ge\max\{\sqrt{θ(Ω)},κ_N\}\,c(Ω^*)$, where $θ(Ω)\in(0,1]$ is an explicit geometric quantity equal to $1$ only for balls and $κ_N$ is an explicit constant with $κ_3\approx0.650$ and $κ_N\to1$ as $N\to\infty$.

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

We consider the three-dimensional elastodynamics system with nonlocal gravitational coupling and nonlinear traction-free boundary conditions, modeling an isolated self-gravitating hyperelastic body, where the strain-energy function is assumed to be objective, isotropic, and homogeneous of degree $-1$. We prove nonlinear stability of a self-similarly expanding separable solution, recently constructed by the authors [JangLeslie2025], under radial perturbations satisfying the codimension-one constraint of zero total energy. Using a self-similar reformulation analogous to that developed for the mass-critical Euler–Poisson system in [HadzicJang2018CPAM], we recast the perturbed equation as a scalar nonlinear five-dimensional radial wave equation and the nonlinear traction-free boundary condition as a homogeneous Neumann condition. A key is to identify a quasilinear form of the leading-order spatial operator that is compatible with this boundary condition and yields coercive energy estimates. Our energy estimates capture the stabilizing effect of the background expansion and yield global existence and nonlinear codimension-one stability in self-similar variables.

comments
30 pages, 0 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19102 ↗

We study the nonlinear Kirchhoff equation on the waveguide manifolds $\mathbb{R}^d\times\mathbb{T}^n$: \begin{align*} -\left( a+b \int_{\mathbb{R}^d\times\mathbb{T}^n}|\nabla_{x,y}u(x,y)|^2\,dxdy\right) Δ_{x,y}u+ωu=|u|^αu, \end{align*} where $a,b>0$, $ω\in \mathbb{R}$, $α\in(0,2^*)$. We first establish existence of the normalized ground states when $α\in(0,2^*)$. To precisely characterize the $y$-dependence of ground states, we apply a scaling argument to handle the integral term $ \int_{\mathbb{R}^d \times \mathbb{T}^n} |\nabla_{x,y} u(x,y)|^2 dxdy$. To this end, we construct two distinct modified energy functionals, through which we establish the $y$-independence and $y$-dependence of the ground states in two specific regimes: $(i)$ $ d + n \leq 4$ and $α\in (0, \frac{8}{d+n})$; $(ii)$ $d = n = 1$ and $α\in (8, \infty)$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19150 ↗

In this paper, we mainly study the sum Hessian equation with general boundary values in the case $2\leq k\leq n$. Under the conditions that the boundary is uniformly $(k-1)$-convex, the right-hand side is monotone non-decreasing in $u$, convex in the gradient, and has a suitably small linear gradient growth, we prove the existence of a unique smooth admissible solution. The proof constructs the global subsolution and gradient barriers by using strictly $k$-convex function, and derives the boundary second-order estimates from the tangential linearizations and a duality inequality for the boundary curvature.

comments
15 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19174 ↗

The rigorous derivation of incompressible plasma equations from kinetic plasma models is a fundamental problem in kinetic theory. For the one-species Vlasov–Maxwell–Boltzmann system without angular cutoff, global well-posedness and the diffusive limit have remained largely open in the soft-potential regime. We resolve both problems for $0<s<1$ and $\max\{-3,-\frac32-2s\}<γ<-2s$. For sufficiently small initial perturbations, we construct unique global classical solutions with energy and time-decay estimates uniform in the Knudsen number $\varepsilon\in(0,1]$. The key analytical contribution is a family of coercivity and trilinear estimates for the non-cutoff collision operators with time-dependent quadratic exponential velocity weights. Exploiting conservation of energy in collisions, these estimates combine with weighted interpolation to control the high-order electromagnetic terms despite the slow decay of the electric field. For well-prepared initial data, we prove strong convergence to the incompressible Navier–Stokes–Fourier–Maxwell system as $\varepsilon\to0$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19239 ↗

The Waddington epigenetic landscape is a foundational concept in developmental biology, yet its quantitative formulations remain largely disconnected from the population dynamics that originally motivated the metaphor. Existing approaches typically describe either intracellular gene-regulatory dynamics or population-level cell kinetics, but rarely both within a unified framework. Here, we develop a unified PDE-integral framework that couples stochastic gene-regulatory dynamics with probability-conserving population renewal, yielding a dynamic Waddington landscape $U(\vec{x}, t) = -\log f(\vec{x}, t)$ defined directly from the evolving epigenetic probability density $f(\vec{x}, t)$. Rigorous mathematical analysis of this framework establishes its well-posedness and provides conditions for the existence and uniqueness of stationary solutions. Application to canonical gene regulatory circuits shows that proliferation is not merely a determinant of population size, but an active regulator of landscape topology. Population renewal reshapes attractor stability and transition barriers in a circuit-dependent manner, generating transient plasticity in some regulatory architectures while stabilizing progenitor states in others. Under highly proliferative conditions, these interactions further produce oscillatory ``breathing'' landscapes. Together, these results establish population renewal as an integral component of cell-fate regulation and extend the Waddington landscape from a static description of intracellular dynamics to a predictive multiscale framework linking gene regulation, cell-state dynamics, and tissue homeostasis.

comments
49 pages, 4 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19257 ↗

We prove the Brunn–Minkowski inequality for Riesz $p$-capacity on compact subsets of $\mathbb{R}^n$ when $n-1<p<n$, extending the known endpoint $p=n-1$. For sets of positive capacity, equality holds if and only if they are convex and positively homothetic. The inequality remains conjectural for $n-2<p<n-1$, when $n\ge2$. Known isodiametric counterexamples rule out a general extension to negative $p$, even for convex planar sets.

comments
27 pages, 1 figure. A mathematical audit prepared by ChatGPT-6.1 Sol is included as an ancillary file
fields
Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.19258 ↗

We establish local spatial Lipschitz and gradient Hölder estimates for general nonnegative weak solutions to Trudinger's equation $\partial_t u^{p-1}=Δ_pu$, $p>1$. The estimates are uniform across the zero set. The proofs combine Bernstein-type estimates for power transformations, smooth approximation, and comparison with exponential barriers near the zero set.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19266 ↗

We prove the uniqueness and nondegeneracy of positive bounded solutions for the Dirichlet problem $$-Δu=f(u)\,\ \ \text{in}\ \ Ω, \ \ u=0\,\ \ \text{on}\ \ \partialΩ,$$ where $f$ is a positive reaction and $Ω\subsetneq\mathbb{R}^d$ is a uniformly $C^{2,γ}$ domain with a star-shaped complement. Our uniqueness result gives a positive answer to Open Question 1 of [H. Berestycki and C. Graham, ARMA, 2026].

comments
15 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19314 ↗

Let $Ω$ be a bounded convex domain in $\mathbb{R}^n$ with $n\ge2$. We prove that the closure of the interior nodal set of any second Dirichlet eigenfunction of $Ω$ intersects $\partialΩ$. The proof combines the ground-state derivative and the quantitative log-concavity estimate of Andrews and Clutterbuck with a variational argument.

comments
10 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19340 ↗

Let $\mathcal{L}$ be a left-invariant Lévy operator, with characteristics $(a,b,μ)$, on a connected and simply connected Lie group $G$ that is either compact or nilpotent with $[G,[G,G]]$ relatively compact (equivalently, of step at most two). We prove that every bounded distributional solution of $\mathcal{L}u=0$ is right-invariant under the closed subgroup $P=\overline{\langle\exp\mathfrak h_0\cup\text{supp}μ\rangle}$, where $\mathfrak h_0=\text{Lie}\langle b,\operatorname{ran}(a)\rangle$, and is constant if and only if $P=G$. In the compact case we give three proofs, one through the Itô–Kawada equidistribution theorem, one by propagation of the maximum and one by an application of the Peter-Weyl theorem, while the nilpotent case rests on the Choquet–Deny theorem of Bénard and Frisch.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19392 ↗

We study the nonlinear smoothing properties of the Coupled KdV system posed on the torus. This system arises as a particular case of the four-parameter family of Boussinesq systems studied by Bona, Chen and Saut, corresponding to the choice $η^{2}=\frac{2}{3}$, $b=d=0$ and $a=c=\frac{1}{6}$. Although the similarities with the periodic KdV equation and the favorable resonance structure of the Majda-Biello system for the coupling parameter $α=-1$ might suggest that smoothing can be established by a relatively straightforward adaptation of existing techniques, the nonlinear interactions in the Coupled KdV system introduce additional difficulties. In particular, certain mixed interactions lead to degeneracies in the associated resonance functions, resulting in a loss of frequency decay that restricts the attainable smoothing gain. By combining normal-form reductions, duality arguments and Bourgain-space estimates, we establish a smoothing gain of any order $ a< \min \{1,\frac{2}{3}(2s+1)\} $ for $s>-\frac{1}{2}$. Our result demonstrates that the interplay between nonlinear interactions and resonance structures plays a decisive role in determining the smoothing properties of coupled dispersive systems.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19423 ↗

We study the minimization of anisotropic exponential interaction energies over probability measures on the sphere, motivated by mean-field models of self-attention in transformer architectures. For every symmetric positive definite interaction matrix, we relate the minimizer to a corresponding anisotropic Brownian motion and use the Feynman–Kac formula and elliptic regularity theory to show that it admits a smooth, strictly positive density on the sphere. We further show that it is the only stationary measure with full support for the dynamics considered. We use the stochastic viewpoint to derive an algorithm for sampling from the minimizer. In dimension two, we also propose a numerical scheme for approximating its density based on a Mathieu series expansion.

comments
23 pages, 3 figures
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2611.19518 ↗

In this paper, the first main goal is to investigate the Cauchy problem for the linear $σ$-evolution equation $$u_{tt}+a^2(t)(-Δ)^σu+b(t)u_t+m^2(t)u=0, $$ where propagation speed, damping term and mass are time-dependent functions. Under suitable assumptions on the interaction among these coefficients, we not only derive decay estimates for the solution and its derivatives in terms of the effective parabolic time scale $\mathcal{V}_{a,b}(s,t):=\int_s^t a^2(τ)/b(τ) dτ$, but also conclude the additional decay induced by the mass term and the upper decay indicators of the initial data. Especially, one can recognize that the time-derivative estimate for solutions exhibits a competition between $m^2(t)$ and $a^2(t)\left(1+\mathcal{V}_{a,b}(0,t)\right)^{-1}$. For the corresponding semi-linear problem with the nonlinear term $|u|^p$, we also establish global (in time) existence of small data solutions fulfilling decay estimates, coming from the mass factor $\exp\left(-\int_0^t m^2(τ)/b(τ)dτ\right)$, under the same assumptions on these coefficients.

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

For $1\le p\le2$, we obtain the sharp weak-type $(p,p)$ inequality for each classical Riesz transform on real-valued functions on $\mathbb R^n$, with the same optimal constant as for the Hilbert transform. The proof combines the Bellman function method of \cite{BHV} with Janakiraman's sharp strip potential \cite{Janakiraman}.

comments
15 pages
fields
Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.19539 ↗

We consider the free boundary problem for the irrotational compressible Euler equation in a physical vacuum setting. By using the irrotationality condition in the Eulerian formulation of Ifrim and Tataru, we previously showed that the problem can be rephrased in terms of the velocity potential function as an acoustic wave equation that turns out to be widely used in solar seismology. This paper is another step towards understanding what Strichartz estimates are achievable for the aforementioned equation. Our object of study is the corresponding linearized problem. In a previous work, we constructed a class of gallery modes in a model stationary case, which turned out to be counterexamples to Strichartz estimates, forcing a loss of derivatives. By a careful regularization of the domain defining function, we transplant these counterexamples to general Euler backgrounds, and obtain general counterexamples in the same range. On the other hand, we also prove that for the background corresponding to a concrete affine isotropic spherical solution for the irrotational compressible Euler equations, one has Strichartz estimates up to the aforementioned threshold, which shows that they are optimal for at least some explicit Euler backgrounds. To the best of our knowledge, these are the first results of this kind for explicit solutions of the irrotational compressible Euler equations in a physical vacuum.

comments
58 pages. The literature review and introduction build upon and update the ones in the author's earlier paper arXiv:2504.17932
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19555 ↗

In this paper, we study the null-controllability of the multi-dimensional Grushin equation with an inverse-square potential on cylinders. In the critically degenerate case, we compute the minimal time of null-controllability from vertical strips, obtaining an explicit formula depending on the distance of the strip to the singular set and on the strength of the singular potential. To do so, after a Fourier and spherical harmonic decomposition of our control system, we use the moments method for radial problems to construct controls on annuli. For this purpose, we prove a uniform spectral gap and uniform localization estimates for the eigenfunctions of the infinite family of radial operators that arise. We then reduce the control zone using spectral inequalities and the Lebeau-Robbiano method. In the weakly degenerate case, we prove null-controllability in arbitrarily small time from any open set. This is done using the transmutation method and quantitative observability estimates for radial waves, which yield a cost of null-controllability from annuli for the Fourier components of our system that is uniform with respect to the frequency. We conclude again with spectral inequalities and the Lebeau-Robbiano method.

comments
56 pages, 1 figure
fields
Analysis of PDEs, Optimization and Control, Spectral Theory
pdf ↗ page arXiv:2611.19661 ↗

We establish boundary regularity for energy-maximizing vortex patches of the 2-D incompressible Euler equations in a bounded Jordan domain. These results resolve Turkington's free-boundary regularity question throughout the full range of admissible parameters. For bounded convex domains, we further prove that the set of energy maximizers is finite at each prescribed patch area. When the domain is smooth, the number of maximizers is uniformly bounded over all admissible patch areas, and every maximizer is Lyapunov stable in $L^p$ for any $1<p<\infty$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19694 ↗

Denote the Epstein zeta function by \begin{equation}\label{eq:Epstein} E(L,s):=\sum_{v\in L\setminus\{0\}}|v|^{-2s}, \;\;\hbox{where}\;\;L\;\;\hbox{is a lattice}; \qquad s>\frac32. \end{equation} We consider the three-dimensional Lennard–Jones lattice energy, which has the form \[ \mathcal E(L)=\frac12E(L,6)-E(L,3). \] We completely classify the minimizers at every covolume $|L|$, and we prove that as the covolume increases, the minimizing phase changes from the FCC to the body-centered tetragonal and then to the simple-hexagonal lattice. Thereby, we give a positive answer to an open problem raised by Blanc–Lewin [EMS Survey Series 2015, Section~2.5,~(27), pp.~268–269] and Bétermin–Petrache [JMP 2017, Question~1.15], and we prove and clarify the conjecture of Bétermin–Šamaj–Travěnec [SAM 2023].

comments
100 pages; comments welcome
fields
Analysis of PDEs, Number Theory
pdf ↗ page arXiv:2611.19696 ↗

We study the behavior, as the fractional order $α\rightarrow0^+$, of the Caputo time derivative and of the solutions of $D_t^αu=Au$ in a Banach space. The solutions converge for every $t>0$ to the time-independent resolvent value $(1-A)^{-1}φ$. A single bounded fractional resolvent family already forces the sectoriality of $A$ and yields operator-norm convergence with rate $O(α)$ and a full expansion in powers of $α$. The engine is an expansion of the Mittag-Leffler function in its order, $E_α(z)=(1-z)^{-1}+\sum_{k=1}^{K}c_kα^k\mathrm{Li}_{-k}(z)+O(α^{K+1})$ on sectors away from $[1,\infty)$, the corresponding qualitative limit going back to Mittag-Leffler's summability of the geometric series. We also develop stochastic interpretations using inverse $α$-stable subordinators, and establish connections with probabilistic potential theory, the Feynman–Kac formula, and degenerate elliptic equations.

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

This paper is a continuation of our previous work on global regularity theory for the sphere-valued fractional harmonic maps which was initialized by several authors such as Millot-Pegon-Schikorra and Millot-Sire. By adapting the powerful quantitative stratification approach developed by Naber-Valtorta on harmonic mappings, we establish a corresponding stratification theory for fractional harmonic maps, from which an optimal first order global regularity theory and the rectifiable structure of singular sets follow.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19817 ↗

We study extremal functions for Poincaré-Sobolev inequalities in the unit ball in $\mathbb{R}^3$. At the critical exponent $q=6$, we prove that no minimizer is antisymmetric with respect to any hyperplane through the origin. We obtain a positive gap between the general and antisymmetric optimal constants. Continuity of these constants yields antisymmetry breaking for exponents sufficiently close to $6$. We introduce two critical indices to describe the onset of antisymmetry breaking and prove that global minimizers are antisymmetric at both indices.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19890 ↗

We study invariant measures for a Wick-renormalized mean-field stochastic damped wave equation on the two-dimensional torus and for the corresponding stochastic heat equation. With Wick ordering relative to the massive Gaussian free field with covariance $(1-Δ)^{-1}$, we prove uniqueness among invariant laws whose renormalized second moment belongs to $H^{-σ}(\mathbb T^2)$, where $0<σ<\tfrac12$. Stationarity reduces the mean-field equation to a linear equation with a deterministic distribution-valued potential. We show that self-consistency forces this deterministic potential to vanish. The damped wave equation therefore has invariant law $\mathcal N(0,(1-Δ)^{-1})\otimes\mathcal N(0,\varepsilon^{-2}I)$, with covariance understood distributionally, while the heat equation has the Gaussian free field as its invariant law. This resolves self-consistency for spatially varying distribution-valued potentials and establishes uniqueness in the specified class. As the inertia parameter tends to zero, the position marginal remains equal to the invariant law of the corresponding stochastic heat equation, whereas the velocity marginal assigns vanishing probability to every bounded subset of $H^{-1-σ}(\mathbb T^2)$, establishing Smoluchowski-Kramers type behavior.

comments
20 pages, 1 figure. Based in part on the author's master's thesis at the University of Bonn
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2611.19914 ↗

Whether electrical conductivity can be uniquely determined from magnetic measurements alone is a fundamental question in geomagnetic induction sounding. For a spherical conductor in the magnetoquasistatic model, we establish an equivalence between the complete Q-response and a restricted magnetic boundary operator, connecting geomagnetic induction to Calderon-type inverse boundary value theory. For axisymmetric conductivities, we derive exact representations of the zero-frequency zonal response derivatives as conductivity-weighted spatial moments. These formulas give an explicit interpretation of individual response derivatives, and completeness of the moment family yields conductivity uniqueness. For layered axisymmetric models with known shell interfaces and piecewise-constant radial dependence, we further establish uniqueness at a single nonzero frequency. Finite-dimensional subclasses also admit uniqueness and stability estimates from finitely many response coefficients at sufficiently low nonzero frequencies. These results identify complementary mechanisms for conductivity recovery from magnetic-only observations, while uniqueness for general three-dimensional scalar conductivities from ideal magnetic-only Q-response data remains unresolved.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19938 ↗

Let $Ω\subset \mathbb{R}^N$ ($N \ge 2$) be a bounded domain with smooth boundary $\partial Ω$. We construct positive very weak solutions for the problem $Δu + u^p = 0$ in $Ω$ for all $p \in [(N+1)/(N-1),(N+2)/(N-2))$ when $N \ge 3$ and for all $p \ge (N+1)/(N-1)$ when $N = 2$. These solutions vanish in a suitable trace sense on $\partial Ω$ but are singular at prescribed isolated points. This gives a completely affirmative answer to a conjecture of del Pino-Musso-Pacard.

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

We study subwavelength resonances of a finite chain of $N\ge2$ close-to-touching spherical resonators in three dimensions with a single radius defect of relative size $τ\in(0,1]$ and gap width $\varepsilon$. Taking the high-contrast limit before the narrow-gap limit, we prove that the positive generalized eigenvalues of the weighted chain coupling matrix with respect to the volume matrix determine the leading relative resonant frequencies. After eliminating the finite tails, we obtain an exact characteristic determinant and identify a unique critical ratio $τ_*\in(0,1)$ at which the largest eigenvalue crosses the upper edge of the homogeneous recurrence band $[0,4]$. For every $0<τ<τ_*$, exactly one eigenvalue lies above this band, and its eigenvector decays geometrically along the tails. As $τ\toτ_*^-$, its recurrence decay length diverges like $(τ_*-τ)^{-1/2}$. As $τ\to0$, exactly one eigenvalue diverges like $τ^{-2}$ and its eigenvector concentrates at the defect; if the defect is interior, one additional positive eigenvalue has order $τ$. For suitably normalized relative resonant modes, the sequential limit of the $\varepsilon$-scaled gradient supremum in each gap equals the absolute difference between adjacent reduced amplitudes. For the largest-eigenvalue mode, this yields defect-adjacent gradient concentration as the defect shrinks.

comments
20 pages, 2 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.19990 ↗

In this article, we study the quasilinear Schrödinger equation $-Δu - Δ\bigl(|u|^{2α}\bigr)\,|u|^{2α-2}u =λ\left(χ_{\{u<b\}} u^{-β}+\left(\int_Ω\frac{H(y,u)}{\left|x-y\right|^μ} dy\right)h(x,u)\right)$ in $Ω$, $u>0$ in $Ω$, $u=0$ on $\partialΩ$, where $Ω\subset \mathbb{R}^2$ is a smooth bounded domain, $b>0$, $0<μ<2$, $α>\frac12$, $0<β<3$, and $h$ has critical exponential growth with primitive $H$. We show that there is $λ^*_b\in(0,\infty)$ such that the problem has a positive solution if and only if $λ\in(0,λ^*_b]$. For $λ<λ^*_b$, this solution is $g(v_λ)$, where the change of variables $g$ makes the problem semilinear and $v_λ$ is a local minimizer of the transformed energy in $H^1_0(Ω)$. If $h$ satisfies a lower bound at the critical scale $\exp\bigl(2α\,g^{-1}(u)^2\bigr)$, we obtain a second positive solution for every $λ\in(0,λ^*_b)$. The level estimate for this solution must be done at this scale, and not at the scale $e^{u^{4α}}$ used for semilinear problems. This bound excludes $h=f\,e^{u^{4α}}$ with $f$ of polynomial growth. For $α>1$, we obtain a second solution for $h=u^{4α-1}e^{u^{4α}}$, provided that the maximum of the first solution exceeds a constant depending only on $α$. For $α\leq1$, this question remains open.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20005 ↗

Let $0\leq k\leq n-1,1<p<\infty$ and $u\in W^{1,p}\left(B;Λ^k\right)$, where $Λ^k$ is the vector space of all $k$-forms in $\mathbb{R}^n$ and $B$ is an open ball in $\mathbb{R}^n$. In this article, with one global higher integrability assumption on $du$, we study the global higher integrability of $dv$ where $v$ is the unique minimizer of the following functional: \begin{align*} \overline{w}\mapsto \int_{B} \left \lvert d\overline{w} \right \rvert^p \text{ where } \overline{w} \in u+W^{1,p}_{d^*,T}\left(B;Λ^{k}\right). \end{align*} As a machinery, with a similar higher integrability assumption on the $k+1$-differential form $\widetilde{F}$, we prove one local higher integrability of $d\widetilde{W}$ where $\widetilde{W}\in W^{1,p}\left(B_r\left(0\right);Λ^{k}\right)$ weakly solves: \begin{align*} d^*\left(\left \langle G \left(d\widetilde{W}+\widetilde{F}\right), d\widetilde{W}+\widetilde{F}\right \rangle^{\frac{p-2}{2}}G \left(d \widetilde{W}+\widetilde{F}\right)\right)=0 \text{ in } B_r\left(0\right), \end{align*} for $G:B_r\left(0\right)\rightarrow GL\left({n\choose k+1};\mathbb{R}\right)$ symmetric, bounded, and uniformly elliptic measurable map, which is sufficiently close to the identity map $I:Λ^{k+1}\rightarrow Λ^{k+1}$. For each of the above mentioned cases, we prove one strong $\left(q,q\right)$ type estimate. As the primary tools, we use the Hardy-Littlewood maximal inequality, Fefferman-Stein inequality, and one classical regularity result of K. Ulhenbeck.

comments
39 pages. This is a working draft. We will upload revised version soon. Comments are welcome!
fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2611.20008 ↗

We resolve the long-standing open problem of computing the Leray–Schauder degree of the regular $SU(3)$ Toda system on a closed oriented surface $M$. If $d_{m,k}$ denotes the degree in the block $(4πm,4π(m+1))\times(4πk,4π(k+1))$, then \[ \sum_{m,k\geq0}d_{m,k}x^my^k =(1-x)^{χ(M)-1}(1-y)^{χ(M)-1}(1-xy)^{χ(M)}, \] where $χ(M)$ is the Euler characteristic of $M$. Nonvanishing of $d_{m,k}$ thus gives an existence criterion in terms of the topology of $M$ and the parameter block. At each step of the degree computation, we show that the only possible local mass pairs are $(4π,0)$ and $(8π,4π)$. We use generic perturbations and local second-order information on the weights to exclude collisions of shadow centers and splitting at mixed blow-up points. The shadow degrees and the Morse index then give the degree jump at each critical value.

comments
126 pages
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2611.20013 ↗

We study the Dirichlet problem for the octonionic Monge-Ampere equation on smooth bounded domains in the octonionic plane $\mathbb{O}^2\cong\mathbb{R}^{16}$. For a smooth positive density that is nondecreasing in the unknown function, we prove existence and uniqueness of a smooth strictly plurisubharmonic solution whenever there is a smooth strictly plurisubharmonic subsolution with the prescribed boundary values. The result also holds on relatively compact domains with smooth boundary in flat translation quotients. On smooth bounded strictly octonionic pseudoconvex domains, we construct the unique Green function with zero boundary values and singularity $-|q-a|^{-6}+O(1)$ at an interior pole $a$. We prove $C^{1,1}$ regularity locally up to the boundary away from the pole, together with sharp bounds for the gradient and the full real Hessian. The proof combines boundary estimates based on translations and spin rotations with weighted estimates obtained by differentiating along rotations and dilations.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20014 ↗

This paper concerns entire minimizing four-junction solutions to a two-dimensional Allen-Cahn system with a four-well potential. In a suitable regime of unequal surface tensions, the construction yields a family of solutions with varying opening angles of phase sectors. The proof employs two-direction slicing arguments for tight energy bounds and localization of the diffuse interface, together with a new iteration scheme that controls change of approximating sharp interfaces at successively smaller scales.

comments
31 pages, 3 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20042 ↗

We establish stability of growing plasma echo cascades for the Vlasov–Poisson–Landau equation with Coulomb collisions near a global Maxwellian. The occurrence of plasma echoes, or even a growing cascade in a reduced model, does not by itself establish this stability. We prove that the amplification persists under changes in the linearized operator, including collisions and the exact evolving background coefficients, and under nonlinear perturbations. This yields optimality of the exponent $1/3$ obtained by Chaturvedi, Luk, and Nguyen in the Sobolev stability threshold. Specifically, we construct solutions with initial Sobolev perturbations of size $ν^{1/3}[\log(1/ν)]^p$ whose transport profiles exhibit norm inflation before the enhanced-dissipation time scale $ν^{-1/3}$. Since collisions preclude the backward Sobolev construction used in collisionless echo arguments, we prepare the initial data at physical time zero and control the entire forward evolution.

comments
162 pages. The roadmap of the proof can be found in Appendix C
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20080 ↗

In this paper, we employ the dual cone method to establish the existence of infinitely many sign-changing solutions to the $Q$-curvature problem involving $GJMS$-operators of arbitrary order $m$ on closed Riemannian manifolds of dimension $n > 2m$, under the assumptions that the operators are coercive and positivity-preserving and that the manifold admits appropriate symmetries. To demonstrate the applicability of our framework, we provide explicit examples on both closed Einstein manifolds and closed special Einstein products. Notably, one of the major contributions of this work is deriving explicit conditions that guarantee the coercivity of $GJMS$-operators on closed special Einstein products.

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

We present a complete formalization, using Lean 4, of the convergence of $p$-harmonious functions to the viscosity solution of the Dirichlet problem for the normalized $p$-Laplacian, $2 \le p < \infty$, as the step size goes to zero. By $p$-harmonious functions we mean solutions of the dynamic programming principle of tug-of-war with noise. Our proof follows the argument of Barles and Souganidis and is formalized in full, depending only on Mathlib and the standard axioms of Lean. In particular, we include the asymptotic expansion of the scheme, the viscosity properties of the half-relaxed limits, existence and uniqueness for the discrete problem, the comparison principle and uniqueness for the homogeneous equation, Aleksandrov's theorem, and Jensen's lemma.

code
github.com/BehroozMoosavi/tugofwar_formalization ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at 6884ed0, checked 2026-11-17 build details
comments
14 pages, 1 figure. Lean 4 source: https://github.com/BehroozMoosavi/tugofwar_formalization (tag v1.3). Blueprint and browsable formal statements: https://behroozmoosavi.github.io/tugofwar_formalization/
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20169 ↗

We derive the Boltzmann equation from the Newtonian dynamics of particles interacting through a short-range repulsive potential for arbitrarily long times, in the Boltzmann–Grad limit. This extends the recent hard-sphere result of Deng, Hani and Ma (arXiv:2408.07818) to short-range potentials. Compared with hard spheres, two new difficulties arise: (i) in the absence of a Burago–Ferleger–Kononenko-type bound (Ann. of Math. 147 (1998), 695–708, doi:10.2307/120962), a bounded number of particles may undergo an unbounded number of collisions within a short time; and (ii) since collisions last a positive time, three or more particles may interact simultaneously. To overcome (i), we treat such clusters of recollisions as single objects, called boxes, keeping track only of their entry and exit structure, so that internal collisions do not enter the combinatorial counting. The multi-particle collisions in (ii), together with the boxes, lead to more complicated molecules, which requires adapting the counting estimates and the cutting algorithm.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20208 ↗

We extend the concept of $p$-ellipticity for (single) elliptic operators, that we introduced in arxiv:1611.00653, to the case of systems of elliptic equations with complex coefficients. The $p$-ellipticity condition from this paper turns out to be equivalent, up to a factor depending on $p$, to a condition for systems introduced (and equally named) by Dindoš, Li and Pipher in arXiv:2007.13190. We prove several key properties of $p$-ellipticity akin to those that have been known to hold in the scalar case (arxiv:1611.00653). In some respects, however, the vector case fundamentally differs from the scalar one. As an application we establish the contractivity on $L^p$ of the operator semigroup generated by systems of elliptic equations with complex coefficients and subject to Dirichlet, Neumann or mixed boundary conditions.

comments
71 pages. This paper is currently submitted for publication. The version posted here is a revised version of the submitted one. We plan to post a substantial follow-up on this paper soon, containing several extensions and improvements
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20231 ↗

We solve the minimizer case of Brezis's Open Problem~2.3 for every fixed $p>2$. For $\varepsilon>0$, let $\mathbf{u}_{\varepsilon}\in W^{1,p}(B_1;\mathbb{R}^2)$ be a global minimizer of the $p$-Ginzburg–Landau energy \[ \int_{B_1} \left( \frac{|\nabla\mathbf{u}|^p}{p} +\frac{(1-|\mathbf{u}|^2)^2}{4\varepsilon^2} \right)\,dx \] with prescribed trace $\mathbf{u}_{\varepsilon}|_{\partial B_1}(x)=x$. We prove that, as $\varepsilon\downarrow0$, $\mathbf{u}_{\varepsilon}(x)\to x/|x|$ at every point $x\in B_1\setminus\{0\}$. The convergence is strong in $W^{1,p}_{\mathrm{loc}}(B_1\setminus\{0\};\mathbb{R}^2)$ and hence uniform on every compact subset of the punctured disk. On each such compact subset, the potential energy tends to zero and the total energy converges to the $p$-Dirichlet energy of the radial map. No symmetry or uniqueness of the minimizers is assumed. The proof combines whole-plane concentration, a strict exterior filling estimate, and quantitative convexity to locate the concentration point and identify the limiting map.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20250 ↗

We establish global existence and uniqueness of strong solutions containing vacuum to the two-dimensional barotropic compressible Navier-Stokes equations with bulk viscosity depending on the density, in smooth bounded simply connected domains, subject to the Navier-slip boundary conditions. Without any restriction on the size of initial data, we obtain time-uniform density and velocity bounds and exponentialconvergence to equilibrium in Sobolev spaces for the density and velocity. Moreover an initial vacuum point will persist and force the exponential growth of density gradients.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20264 ↗

In this paper, we study nonlocal Sobolev spaces $H^{ρ,p}(\mathbb{R}^n)$ with $p \in (1,\infty)$, defined via a general class of nonlocal gradients $D^ρ$ associated with a kernel function $ρ$. As our main contribution, we establish three new equivalent characterizations of these spaces. First, we describe $H^{ρ,p}(\mathbb{R}^n)$ in terms of Fourier multipliers involving the symbol of the nonlocal potential associated with $D^ρ$. Second, we give a thorough functional analytic treatment of the nonlocal $ρ$-Laplacian $Δ^ρ$, which allows us to represent general nonlocal Sobolev spaces through its square root $(-Δ^ρ)^{1/2}$. Third, we show that $H^{ρ,p}(\mathbb{R}^n)$ coincides with the image $g_ρ* L^p(\mathbb{R}^n)$ for a suitable convolution kernel $g_ρ\in L^1(\mathbb{R}^n)$, which confirms that these spaces are genuine potential spaces. These results generalize the well-known fact that, in the special case of the Riesz kernel, the resulting fractional Sobolev spaces coincide with the classical Bessel potential spaces. In this spirit, the present work can also be viewed as introducing a natural notion of generalized Bessel potential spaces.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20285 ↗

We study the initial value problem associated with the dispersive generalized Benjamin-Ono equation \begin{equation*} \partial_{t}u-\partial_{x}|D_{x}|^{a}u+u\,\partial_{x}u=0,\quad 1<a<2, \end{equation*} in weighted Sobolev spaces. First, we show that if the solution belongs to $L^{2}(|x|^{2α}dx)$ at two different times, then it gains regularity, namely $u\in C([-T,T]:H^{aα}(\mathbb{R}))$, for $α<5/2+a$ and suitable initial regularity. Second, we establish the persistence of the solution flow in $H^{s}(\mathbb{R})\cap L^{2}(|x|^{2α}dx)$ under the sharp regularity assumption $s\ge aα$, for $α\in[1/2,5/2+a)$, where the zero mean condition is required for $α\ge 3/2+a$. Finally, we prove the unique continuation principles associated with the optimal decay rates $|x|^{3/2+a}$ and $|x|^{5/2+a}$ under optimal regularity assumptions. Our approach relies on weighted energy estimates, commutator expansions for the fractional Laplacian and pseudo-differential calculus.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20341 ↗

We study positive solutions $u\in H^s(\mathbb R)$ of the fractional Schrödinger equation $(-Δ)^su+λu=f(u)$ in $\mathbb R$, where $0<s<1$, $λ>0$, and $f$ is a general nonlinearity such that $f(t)/t$ is increasing. We prove that, under a single concavity condition on an auxiliary function, positive solutions are unique up to translations. The result applies to all positive solutions rather than only to ground states, and it allows $f'$ to be unbounded below at zero. It covers pure powers, sums of powers, logarithmic and saturable nonlinearities, for suitable ranges of the parameters. We further prove that every positive solution is nondegenerate, with the kernel of the linearized operator spanned by $u'$, and that it has Morse index one. If moreover $f(\sqrt h)/\sqrt h$ is concave, then for $1/2\le s<1$ a positive solution with prescribed $L^2$ norm is unique together with its Lagrange multiplier. The proofs are purely variational, using neither a continuation argument in $s$ nor the nondegeneracy of the linearized operator. Our method rests on the convexity of the action along an interpolation between symmetric decreasing functions that preserves a suitable integral quantity, and this convexity allows us to identify every positive solution as a constrained minimizer. For $1/2\le s<1$ we use the height interpolation of Delgadino, Yan and Yao, while for $0<s<1/2$ we introduce a new two-level interpolation.

comments
53 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20376 ↗

König conjectured that the sharp stability constant in the Bianchi-Egnell inequality for the one-dimensional fractional Sobolev inequality equals the local stability constant and that the associated quotient has no minimizer outside the set of optimizers of the fractional Sobolev inequality. We prove both assertions for $s<1/2$ sufficiently close to $1/2$, with an explicitly computable threshold. The proof is based on a reinterpretation of the Frank-Lieb rigidity mechanism. Due to the lack of smooth variational structure of the Bianchi-Egnell quotient, we work with a refined limiting inequality of Beckner-Onofri-type on the circle with vanishing first-order moments, which we derive from Toeplitz determinants.

comments
25 pages
fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2611.20394 ↗

We construct a smooth, uniformly convex Hessian-dependent energy functional, which admits a singular $C^{1,1}$ minimizer on $\mathbb{R}^5$ that is a two-homogeneous normalization of Cartan's five-dimensional cubic. Our construction relies on constructing a quadratic null Lagrangian for the Hessian that is suitably non-degenerate on the image of the Hessian for the candidate minimizer. This complements a partial regularity result previously obtained by the authors in this setting, and demonstrates that one cannot hope for a fourth-order version of classical second-order elliptic regularity theory à la De Giorgi-Nash-Moser.

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

We study the large-time behavior of solutions to the system modeling the compressible flow of nematic liquid crystals with a polytropic equation of state $P(ρ)=ρ^γ$ $(γ>1)$ in Lagrangian coordinates. In contrast to the isothermal case $γ=1$ treated in [4,5], we establish a new representation formula for the specific volume (Lemma 2.2) and, using Jensen's inequality, derive time-uniform estimates that yield global upper and lower bounds for the specific volume. A key ingredient is the reconstruction of the $D$--$Z$ structure for $γ>1$, which gives an exponential decay of $Z(t)$ and thus overcomes the difficulty caused by the power-type pressure.

comments
6 pages, no figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20442 ↗

We establish quantitative surface approximations for Maxwell scattering by a fixed collection of smooth, separated metallic particles described by the hard-wall generalized nonlocal optical response (GNOR) model. As the ratio $η$ of the reference screening length to the particle size tends to zero, regularized first-order and second-order transmission conditions approximate the electric far-field operator with errors $O(η^2)$ and $O(η^3)$, respectively. The estimates retain retardation and are uniform on compact subplasma frequency intervals with fixed positive damping and for a bounded dimensionless diffusion-to-pressure ratio. The proof combines exact elimination of the longitudinal field, a uniform weak bound for its boundary density, and smoothing by exterior observations. The same error orders hold for fields observed at a fixed positive distance from the particles. We also justify thin-coating representations on bounded tangential wave-number ranges for a planar interface and on fixed finite spherical angular subspaces. For each fixed quasistatic spherical multipole with a simple local pole, the first- and second-order models approximate the pole and its residue with errors $O(η^2)$ and $O(η^3)$, respectively.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20466 ↗

Let $1\leq k\leq n$, and let $u^\varepsilon$ and $u$ be the $k$-admissible solutions of $σ_k(D^2u^\varepsilon)=f(x,x/\varepsilon)$ and $σ_k(D^2u)=\overline f(x)$ on a bounded convex domain $Ω$, with the same Dirichlet data. Here, $f$ is uniformly positive and periodic in its second variable, and $\overline f(x)=\int_{\mathbb T^n}f(x,y)dy$. For $m=0,1$ and $0<α\leq1$, we prove $\|u^\varepsilon-u\|_{L^\infty(Ω)}\leq C\varepsilon^{m+α}$ for all $0<\varepsilon\leq1$, provided that $u\in C^{m+2,α}(\overlineΩ)$ and $f\in C_x^{m,α}(\overlineΩ;C_y^{2,γ}(\mathbb T^n))$ for some $0<γ<1$. Periodic cell estimates give smooth dependence of the correctors on the background Hessian and the normalized density. The divergence-free property of the Newton tensor cancels the first macroscopic correction and yields the higher rate. Both exponents are optimal in general, already for $n=k=1$.

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

The elastic effect on the stability of boundary layers is studied for incompressible elastic fluids in the half-plane. It is known from [33] that if the deformation tensor matrix is nonsingular near the boundary, elasticity can prevent the formation of a boundary layer. In this paper, we prove stability properties when the deformation tensor degenerates. Our results are twofold: (1) when the first row of the deformation tensor has a non-degenerate projection onto a fixed direction, the initial-boundary value problem for the two-dimensional viscoelastic Prandtl boundary layer equations in the half-plane admits local well-posedness in Sobolev spaces, without any monotonicity condition on the velocity profile; (2) when the first row of the deformation tensor vanishes simultaneously at one point, the linearized Prandtl boundary layer system is ill-posed. The first result reveals the stabilizing effect of elasticity against the classical Prandtl instability. The second result shows that elastic effects cannot suppress the Prandtl-type instability associated with a non-degenerate critical point of the velocity profile.

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

This paper investigates a uniqueness problem for determining all fractional orders and their corresponding coefficients in multi-term time-fractional diffusion equations with Caputo derivatives in an abstract Hilbert space. The main result establishes that these parameters can be uniquely identified from a single scalar observation of the solution, of the form (u(t), phi), by comparing the solutions of two evolution equations governed by possibly different positive self-adjoint operators A and B. In contrast to existing results that rely on local space-time measurements and, in particular, may require the initial data to satisfy sign conditions and strong spatial regularity assumptions, our approach uses only the minimal assumption that a belongs to H, without imposing any sign or additional smoothness conditions on the initial value. The proof combines spectral representations of the solutions with a recursive asymptotic comparison method based on fundamental identities for the multinomial Mittag-Leffler function. This approach enables the successive identification of all fractional orders and their associated coefficients, even when the two equations involve different operators. Furthermore, the uniqueness argument extends to multi-term time-fractional wave equations with orders in the interval (1,2).

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

In this paper, we study the stability threshold of the two-dimensional incompressible MHD equations near Couette flow and a constant horizontal magnetic field \((β,0)\) on \(\mathbb T\times\mathbb R\). For \(N>10\), \(0<ν,μ\le1\) and \(|β|\ge(ν+μ)/(3\sqrt{νμ})\), we prove global stability for initial perturbations of size \(δ_N\min\{ν,μ\}^{1/3}\) in \(H^N\), where \(δ_N>0\) is independent of \(ν,μ,β\). We also obtain enhanced dissipation of the nonzero horizontal modes on the time scale \(\min\{ν,μ\}^{-1/3}\), together with inviscid damping of the vertical components. The proof combines time-dependent Fourier multipliers with an energy correction constructed using the Alfvén oscillations. By combining the nonlinear terms arising from this correction, we obtain the cancellation needed to close the energy estimates at the $1/3$ scale.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20571 ↗

The global existence of a unique strong solution to the two-dimensional barotropic compressible Navier–Stokes equations with general density-dependent bulk viscosity is established for large initial data allowing vacuum. Both the periodic problem and the Cauchy problem with far-field vacuum are considered under a common logarithmic derivative bound and growth condition on the viscosity primitive. A time-independent density upper bound and uniform low-order estimates are obtained in both domains. The admissible coefficients include every superlinear power law and near-linear laws with logarithmic gains. Exponential relaxation to the positive equilibrium is proved in the periodic setting. In the whole space, uniform relaxation toward vacuum and algebraic decay of the pressure, velocity gradient, material acceleration, and relative kinetic energy are established.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20577 ↗

We prove finite-time blowup of both the velocity and magnetic field in a one-dimensional magnetohydrodynamics (MHD) model starting from smooth odd initial data. The construction combines the dynamical rescaling approach with weighted stability estimates. Both the velocity and magnetic field remain in $L^2$ before the blowup time.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20596 ↗

We study positive solutions of the singularly perturbed Hamiltonian elliptic system \begin{equation*} \begin{cases} -\varepsilon^2Δu+u=|v|^{q-2}v &\text{in }A,\\ -\varepsilon^2Δv+v=|u|^{p-2}u &\text{in }A,\\ u,v>0\text{ in }A,\qquad u=v=0 &\text{on }\partial A, \end{cases} \end{equation*} where $A=\{x\in\mathbb R^{2m}:a<|x|<b\}$, $0<a<b$, $m\geq2$, and $2<p,q<2(m+1)/(m-1)$. We prove the existence of a family of solutions whose two components concentrate around the same $(m-1)$-dimensional sphere on the inner boundary as $\varepsilon\to0$. The two spheres of maxima are at distance $o(\varepsilon)$ from each other, and both components decay exponentially away from these spheres. The admissible range of $(p,q)$ includes critical and supercritical exponent pairs in dimension $2m$. The proof uses a reduction to a weighted system in dimension $m+1$. We establish foliated Schwarz symmetry of its ground states with a common axis via reduction by inversion and polarization. A uniform estimate on generalized Nehari fibers gives the upper energy bound. A half-space nonexistence result and the corresponding lower bound then determine the concentration location and the limiting profiles.

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

We establish a Liouville theorem for nonnegative bounded solutions of the indefinite polyharmonic equation $(-Δ)^m u=x_1u^p$ in $\mathbb R^n$, for all integers $m\ge2$, $n\ge1$, and all $p>1$. The main difficulty lies in extending the moving-plane method to a higher-order equation with a sign-changing coefficient. We first combine sublinear growth estimates with reflection arguments to establish the super-polyharmonic property in the right half-space, without prescribing boundary conditions on the separating hyperplane. We then use a doubling and rescaling argument to obtain relative first- and second-derivative estimates on strips, replacing the scalar Harnack estimates used in the second-order case. These estimates allow us to establish monotonicity in the $x_1$-direction within the right half-space $\{x_1>0\}$, and a cutoff argument then yields the desired nonexistence result.

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

This paper is devoted to studying the convergence rate in periodic homogenization of the viscous Hamilton–Jacobi equation (with supercritical viscosity index $σ>1$) \[ \partial_t u_\varepsilon+H(x/\varepsilon,\partial_xu_\varepsilon)=\varepsilon^σΔu_\varepsilon,\quad (x,t)\in\mathbb{R}^n\times\mathbb{R}_+,\ \] subject to a given initial datum. For Tonelli Hamiltonians $H$, the solution $u_\varepsilon$ is proved to converge to a certain $u:\mathbb{R}^n\times\mathbb{R}\rightarrow\mathbb{R}$ (solving the effective problem) in the optimal rate $O(\varepsilon^{\min\{σ-1,1\}})$. We also obtain a rate for the case of non-convex Hamiltonians and discussed its optimality therein.

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

In this paper, we study the Klein–Gordon–Schrödinger system in the nonrelativistic regime $\e\to 0$ on $\R^d$ with $d\ge4$, where $\e$ is a small parameter proportional to the inverse of the speed of light. For sufficiently regular initial data, we show that its solution is well approximated by oscillatory profiles governed by a decoupled linear Schrödinger-wave semi-limiting model with error $O(\e^2)$ uniformly for all $t \ge 0 $. This rigorously justifies the numerical study of Bao and Zhao \cite{BZ17}.

comments
29 pages, 0 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20646 ↗

We study isolated boundary singularities of positive solutions of the scalar-flat boundary Yamabe equation. We prove the critical upper bound for general smooth metrics in dimensions $3\le n\le17$ and for Euclidean domains with smooth boundary in dimensions $3\le n\le22$. For general metrics, this range extends to $n=18$ when the conformal metric is complete near the singularity. In every dimension, the critical upper bound implies removability or a matching lower bound and convergence to a unique flat Fowler solution with a positive power rate. Sharpness of these dimension ranges will be established in a subsequent paper.

comments
68 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20647 ↗

In this paper, we consider a three-dimensional nematic liquid crystal governed by the simplified Ericksen-Leslie system interacting with a moving rigid body. We prove the existence of global weak solutions, where we especially treat the case of contact with the container wall. The director field $\boldsymbol{d}$ satisfies $|\boldsymbol{d}| = 1$ as well as $d_3 \ge 0$, and its non-homogeneous Dirichlet boundary condition on the body interface, referred to as strong anchoring, is transported with the rigid motion. The moving-domain problem with the above director condition is obtained as a limit of a Ginzburg-Landau regularization. An extension of the director to the body domain yields global compactness, while a compactness argument as in the seminal work by Lin and Wang [39] yields strong convergence away from the interface. If the body is in contact with the wall, we impose a perfectly inelastic sticking law. Since the resulting domain after contact is not necessarily Lipschitz, we prove weak existence for the simplified Ericksen-Leslie model on arbitrary bounded open sets, which is of independent interest.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20677 ↗

We study the conformally critical Choquard equation on $\mathbb S^n$, \[ -Δ_{\mathbb S^n} v(ξ) + \frac{n(n-2)}{4} v(ξ) = \left(\int_{\mathbb S^n} \frac{|v(η)|^p}{|ξ-η|^μ} dV_η\right) |v(ξ)|^{p-2} v(ξ), \] where $n\ge 3$, $0<μ<n$, and $p=(2n-μ)/(n-2)$ denotes the conformally critical Choquard exponent. For the standard action of \(G=O(k)\times O(\ell)\) with \(k,\ell\ge 2\) and \(k+\ell=n+1\), we use the cohomological index and orbit interval partition to build attained minimax levels with sharp growth \(c_j\asymp j^{2p/(p-1)}\). All \(G\)-invariant solutions at \(c_j\) change sign for \(j\ge 2\). If \(p\ge 2\), positivity of the Riesz form on nodal truncations gives \(N_G(v)\le m_G(v)\), and \(N_G(v)\le j\) whenever \(E(v)=c_j\). Here \(N_G\) counts nodal domains, and \(m_G,ν_G\) are the invariant Morse index and nullity, respectively. In particular, \(c_2\) is the least energy of \(G\)-invariant sign-changing solutions, with such solutions having two nodal domains. Under the additional assumption that every critical point of the reduced functional \(Ψ\) at level \(c_j\) is isolated in the full critical set of \(Ψ\), the critical group theory gives \(m_G\leq j\leq m_G+ν_G\) for a selected critical solution. For \(p\ge 2\), only finitely many angular blocks contribute to the full index and nullity, and every nonconstant \(G\)-invariant solution has transverse negative directions. When \(k=\ell\) and \(μ>0\) is sufficiently small, we compute the radial index and nullity in the \((1,0),(0,1),(1,1)\) blocks of solutions from minimizing the reduced energy over \(G\)-invariant functions odd under factor interchange.

comments
58 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20709 ↗

We are concerned with the biharmonic Neumann problem \[ Δ^2u+u=0\quad\text{in }Ω,\qquad \partial_νu=0,\quad \partial_νΔu=-\varepsilon h e^{24π^2u} \quad\text{on }\partialΩ, \] where $Ω\subset\mathbb R^4$ is a smooth bounded domain, $ν$ is the outward unit normal, $h\in C^5(\partialΩ)$ is positive, and $\varepsilon>0$ is sufficiently small. For each fixed integer $m\ge1$, we construct $m$-bubble solutions $u_\varepsilon$ by Lyapunov–Schmidt reduction. As $\varepsilon\to0$, the solutions concentrate at $m$ distinct boundary points, each carrying unit mass for the measure $\varepsilon h e^{24π^2u_\varepsilon}\,dσ$. For solutions corresponding to nondegenerate critical points $ξ^*$ of the interaction function $\mathcal F_m$, we establish local uniqueness and nondegeneracy, and prove $\ind(u_\varepsilon)=m+\ind(-D^2\mathcal F_m(ξ^*))$. In particular, for a generic positive weight $h$, all critical points of $\mathcal F_m$ are nondegenerate, and the $m$-bubble solutions associated with global minima of $\mathcal F_m$ have Morse index $4m$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20727 ↗

We study equations driven by a sum of two fractional $p$-Laplacians with different orders and exponents. A central contribution of this paper is a Pohožaev identity for finite-energy weak solutions, established without additional regularity assumptions by means of a new approach based on scaling and convexity defects. This identity, which is of independent interest, yields nonexistence results for critical problems. Furthermore, we establish weighted Sobolev embeddings, construct an unbounded sequence of positive eigenvalues without relying on the Pohožaev identity, and prove multiplicity results for subcritical and doubly critical problems using scaling-based variational methods.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20796 ↗

We consider a non-stationary motion of an inextensible closed string. The motion of the string is governed by nonlinear and nonlocal hyperbolic equations. The nonlocality of the equations is caused by the unknown tension of the string and reflects the inextensibility of the string. We show that the initial value problem to the equations of motion is well-posed locally in time. In the proof, it is crucial to show a strict positivity of the tension when the string is in motion. To this end, we derive a sharp lower bound of the Green's function for a periodic boundary value problem. We also derive a blow-up criterion of smooth solutions, which states that any singularities on the velocity or on the tension of the string do not take place before a curvature singularity appears.

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

This paper investigates the singular limits of a bistable reaction-diffusion equation in a subelliptic setting, where the standard Euclidean diffusion is replaced by a subelliptic operator defined by a family of vector fields. We introduce a Riemannian approximation of these vector fields to regularize the problem, yielding a uniformly parabolic equation whose ellipticity degenerates as the singular parameter vanishes. We prove that the family of solutions converges globally in time to the stable equilibria away from a propagating interface. Our approach uses the definition of generalized geometric flow developed by Barles–Souganidis, uniquely defined through the level-set equation and viscosity solutions. The behavior of the interface depends on the traveling wave speed c: when c is not 0, the front propagates with constant normal velocity governed by a first-order subelliptic eikonal equation. When c = 0, the front evolves according to the horizontal mean curvature flow equation defined by the original vector fields. At present, this case comes with limitations: it requires a more restrictive condition on test functions at characteristic points to define generalized flows, where the horizontal gradient vanishes and standard arguments break down. This framework relies on our earlier work, where the equivalence between the generalized flow and the level-set approach was established when the vector fields generate a step-two Carnot group. We also assume that the comparison principle holds for the level-set equation in order for the level-set approach to be well-posed.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20842 ↗

In this article we study the well posedness of the MHS system in the exterior of a disk. We investigate the case of Grad and Rubin boundary conditions and obtain solutions by perturbing around the dipolar magnetic field. Unlike prior work in the case of bounded domains, we show that one needs to impose a "codimension four"-type condition on the boundary data in order to obtain solutions. Furthermore, due to the tangency points that appear in this situation, we need to develop a careful analysis of the solutions around these points.

comments
Six figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20860 ↗

We consider the nonlocal elliptic equation $L_Ku-λu=f$ in $\mathbb{R}^d$, where $L_K$ is a nondivergence form operator of order $σ\in(0,2)$ with kernel $K(x,y)$. We assume that $K(x,y)$ is Dini continuous in $x$ uniformly in $y$ and merely measurable in $y$. Under the usual upper bound assumption, we prove the boundedness of $L_K$ from $H_p^σ(\mathbb{R}^d)$ to $L_p(\mathbb{R}^d)$ for any $p\in(1,\infty)$. We also establish maximal $L_p$-regularity and unique solvability for all sufficiently large $λ$, provided that an additional nondegeneracy condition holds. We further extend these results to weighted spaces with arbitrary Muckenhoupt $A_p$ weights and obtain estimates that are robust as $σ\to2$. We also construct a kernel that is jointly uniformly continuous in $(x,y)$, for which both operator boundedness and the maximal regularity estimate fail. This is in sharp contrast to the classical $W_p^2$ theory for second-order elliptic equations in nondivergence form, which allows VMO coefficients.

comments
40 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20875 ↗

In this study, we extend the recursive length-scale recovery method for the simplified Bardina model to the three-dimensional modified Leray-alpha model. The main difficulty is that the unknown parameter also occurs in the nonlinear convection term, so estimating the error in the parameter update requires control of second spatial derivatives of the velocity error. We combine continuous data assimilation with a recursive update of the squared length scale, using observed low Fourier modes and computed high Fourier modes. Under uniform regularity bounds on the reference solution and suitable conditions on the observations and the recovery procedure, we prove geometric convergence of both the parameter and velocity errors at the update times. When the update-window lengths are uniformly bounded, this convergence is exponential in time at the update times.

comments
16 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20895 ↗

For the ordinary Fourier extension operator on $\mathbb S^2$, we determine the optimal $L^2(\mathbb S^2)\to L^q(\mathbb R^3)$ constant for every real $q>4$, and characterize the nonzero complex extremizers. The result extends the sharp quartic theorem of Foschi and the even-exponent results of Oliveira e Silva–Quilodrán to exponents for which the usual convolution identities are unavailable. The proof has two stages. A continuous inequality for the moments of $\sin r/r$, combined with a trace estimate along the symmetry orbit of a maximizer, reduces the problem to $4\leq q\leq6$. On this interval, the second variation imposes a scalar necessary condition. We contradict it by spectral estimates for spherical harmonics, moment comparisons, and, near $q=4$, a quantitative use of the quartic deficit. The resulting constant is attained exactly by scalar multiples of characters.

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

We study the integral representation of the relaxation of integral functionals of the form u-> \int f(x,u(x),u'(x)) dx, for Sobolev functions u\,: (a, b) $\rightarrow$ RN with fixed Dirichlet boundary conditions. Unlike classical works on the subject, we require a very mild growth condition on the Lagrangian f to make our statement as natural and general as possible. We state four different situations in which we manage to obtain an explicit expression for the relaxation on BV , which is usually the natural framework for such weak growth conditions. Our goal is also to express a few unifying assumptions on the Lagrangian to obtain the expected relaxation formula.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.20977 ↗

We study the homogenization of the steady Stokes equations with no-slip conditions in a domain perforated by $\varepsilon$-periodic obstacles, whose limit is Darcy's law for the homogenized pressure $p^\ast$. We prove the quantitative error estimate with rate $\sqrt\varepsilon$, natural in the presence of a boundary layer, only assuming that $f-\nabla p^\ast\in H^1$. Such estimates were previously available only under strong smoothness assumptions, such as $f\in C^{1,1/2}$. Our geometrical assumptions are also less stringent than in the previous analyses. The outer domain and the reference fluid cell need only be Lipschitz, the perforations may deviate from periodicity in a layer of width $O(\varepsilon)$ near the outer boundary, and the solid part may be connected (in three dimensions) and attached to the outer wall. In the absence of a boundary layer, the same argument yields the rate $O(\varepsilon)$ assuming only $f\in H^1$.

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

For every positive Robin parameter, we prove that a bounded simply connected planar domain with $C^{2,α}$ boundary is stationary for Robin torsional rigidity under an area constraint if and only if it is a disk. No convexity, curvature bound, or additional condition on the overdetermined constant is assumed. The difficulty is that the stationarity condition couples the boundary trace of the Robin torsion function, its tangential derivative, and the boundary curvature. We encode this condition through a normalized Airy stress function and construct a superharmonic auxiliary function by a quartic minimization calibrated on disks. The boundary structure of this auxiliary function allows us to identify a point where it attains its minimum on the boundary and has a nonnegative outward normal derivative. The strong maximum principle and Hopf's boundary point lemma then force the auxiliary function to be constant. Consequently, for any stationary domain in the class under consideration, the Robin torsion function has a constant boundary trace, and the stationarity condition forces the boundary curvature to be constant.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.21050 ↗

We study a two-component nonlinear Schrödinger system with two prescribed positive $L^2$ masses and a fixed competitive coupling $β<0$, for $N=1,2,3$ and $4\le p<2^*$. We first consider families whose peak heights diverge and whose components converge uniformly to zero away from disjoint finite peak sets. For such families, we prove that both Lagrange multipliers tend to $-\infty$ and that the mass of each component concentrates at its own peaks. We also construct positive multi-peak solutions near prescribed nondegenerate critical points of the respective potentials and compute the leading displacement of each peak. The target frequencies may grow at different rates, provided that $Λ_*\to\infty$ and $\log(2+Λ^*)=o(\sqrt{Λ_*})$, where $Λ_*$ and $Λ^*$ denote their minimum and maximum. In the $L^2$-noncritical case, the first frequency correction is minus the average potential at the prescribed points. In the $L^2$-critical case, the leading mass term is independent of the frequencies. For each component, we compute the mass correction of order \(λ_i^{-2}\) in terms of the sum of the Laplacians of its potential at the prescribed points. When both sums are nonzero, these corrections determine the leading-order asymptotics of the two frequencies and the side from which each self-interaction coefficient approaches its critical value.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.21061 ↗

In this paper, we investigate mapping properties on Lebesgue spaces of bilinear Fourier integral operators (FIOs) with complex phases. Indeed, we provide for bilinear Fourier integral operators with complex phases boundedness theorems for the corresponding Seeger-Sogge-Stein orders, including the endpoint estimates. Our results extend the same boundedness property in the case of real-valued phases proved by Rodriguez-López, Rule, and Staubach, and provide the bilinear version for the linear one proved earlier by Ruzhansky for phases of positive type. Also, our Seeger-Sogge-Stein theorem for bilinear operators with complex phases cannot be directly deduced from its real counterpart. A new approach used in this article consists of providing directly the boundedness theorems on Lebesgue spaces without the use of the multilinear Fefferman-Stein interpolation theorem. For this, a maximal function theorem due to Bourgain is applied. As a byproduct, we also consider transference boundedness theorems of FIOs with complex phases from $\mathbb{R}^n$ to the torus $\mathbb{T}^n\equiv \mathbb{R}^n/\mathbb{Z}^n$ and then, we provide new criteria for the boundedness of Fourier integral operators on the torus with complex phases (Fourier series operators in the sense of Ruzhansky and Turunen).

comments
50 Pages
fields
Analysis of PDEs, Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2611.21064 ↗

We prove the vanishing dissipation limit to a weak planar Euler shock for the full compressible Navier–Stokes equations in $\mathbb{R}^3$. The viscosity and heat conductivity are proportional to $\varepsilon$, with their ratio fixed. The conservative initial perturbation may depend on all three spatial variables and is assumed small only in the scaled $H^2 \cap \dot H^{-1}$ norm. No $L^1$ bound or zero-mass condition is required. For these data, we obtain a unique global strong solution and an energy estimate uniform in time and in $\varepsilon$. On every cylinder with a measurable transverse section of finite positive area, the $L^2$ error has an explicit leading term, yielding the sharp rate $O(\sqrt{\varepsilon})$. The remainder has order $\varepsilon^{3/2}$ times the scaled initial norm; both estimates are uniform for $t \geq 0$. If this norm tends to zero, convergence away from the shock front is uniform in time, including at $t=0$. The entropy production measures converge locally weakly to the measure carried by the Euler shock. Low frequencies are controlled by an entropy-weighted elliptic estimate. At second order, integration by parts in the pressure and viscous heating terms leaves at most two derivatives on the density, while third derivatives of velocity and temperature enter only through the time-integrated dissipation.

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

We study the Cauchy problem for one-dimensional pressureless gas dynamics with a continuous positive transport coefficient $α(t)$ and a continuous nonnegative linear damping coefficient $σ(t)$, for every nonnegative locally finite Radon measure $ρ_0$ as initial density and every $u_0\in L^\infty(dρ_0)$ as initial velocity. A central contribution of this paper is a new and direct proof of uniqueness under the original assumptions of Huang and Wang. It is carried out on the generalized potentials, and the energy condition enters only through the vanishing of the velocity dispersion at the initial time. The proof applies on every finite time strip and requires neither finite mass nor finite moments. We then show that time-dependent transport and damping act on entropy solutions only through an effective time, so that the nonautonomous system is the homogeneous one observed on a time interval $[0,A_\infty)$. Together with uniqueness on strips, this yields a global entropy solution, unique in density and momentum at every time, for all such coefficients. We also show that the energy condition cannot be dropped, and that its defect equals the mass of an atom times the variance of the velocities into which it splits. As consequences, we obtain an explicit representation of the solution by a generalized potential, the Riemann solutions with delta shocks, and the vanishing-damping limit.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.21180 ↗

We investigate measure estimates for the nodal sets of nonzero real eigenfunctions $u$ of the biharmonic operator, satisfying $Δ^2u=λu$ in $Ω$ with clamped boundary conditions $u=\partial_νu=0$ on $\partialΩ$. We establish the optimal upper bound of order $λ^{1/4}$ for the $(n-1)$-dimensional Hausdorff measure of their nodal sets on general bounded connected $C^\infty$ domains. Our approach combines an enhanced annular Carleman estimate with propagation of mass along a finite chain of balls, these yield a doubling index bounded uniformly up to the boundary.Interior analyticity then gives the nodal measure away from the boundary. To estimate the measure near the boundary, we develop a subdivision argument using the boundary values of $Δu$ and $\partial_νΔu$. Estimates from these data reduce large doubling indices and control the nodal measure in the region associated with a selected child cube whenever both the doubling index of the parent cube and $rλ^{1/4}$ are bounded, where $r$ is the side length of the parent cube.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.21193 ↗

We consider the one-dimensional wave equation with dry (Coulomb) friction, u\_{tt} -u\_{xx} + Sgn(u\_t )= 0, with Dirichlet boundary conditions. Whether every finite-energy solution stops in finite time has been open since 1978. We show that stopping in finite time is impossible whenever the initial slope or the initial velocity is unbounded: the space W 1,$\infty$ x L $\infty$ for (u, u t ) is invariant under the flow in both time directions, while stopped states are Lipschitz. In particular the answer is negative for general finite-energy data, and the open question is reduced to Lipschitz data.

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

We establish global compactness for logarithmically coupled p-Laplacian systems on RN, where p=N>4 and bounded positive potentials converge to positive constants at infinity. The finite-energy domain need not be closed under subtraction, obstructing direct profile subtraction. We develop a scalar localisation method using slowly expanding cutoffs and residual commutator estimates uniform in the regularisation parameter. As the regularisation vanishes, residual Palais-Smale sequences split into a solution of the original system and finitely many separating autonomous profiles, with a strongly vanishing remainder and splitting of the logarithmic densities. A converse construction characterises all levels of compactness failure. Applications include convergence of ground-state levels, a compactness-escape alternative for minimising sequences, and a directional response formula for the ground-state energy.

comments
54 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.21269 ↗

We study radial solutions of the double phase equation $-Δ_p u - \operatorname{div}(|x|^{-b}\,|\nabla u|^{q-2}\nabla u) = f(|x|,u)$ in $\mathbb{R}^N$, whose operator admits a scaling that acts on both phases simultaneously. Our first main result is a sharp description of the continuous and compact embeddings of the radial energy space into weighted Lebesgue spaces $L^s(\mathbb{R}^N;|x|^{-c})$ with an explicit characterization of their admissible regions in the $(s,c)$-plane. The two critical edges reflect the two phases: on the edge attached to the $p$-phase compactness is lost by spreading to infinity, while on the edge attached to the weighted $q$-phase it is lost by concentration at the origin. Our second main result concerns equations with one critical term on each edge. We show that bounded Palais-Smale sequences either converge or lose at least the energy $β^\ast = \min\{β_1,β_2\}$, where $β_1$ and $β_2$ are the explicit single-phase thresholds, and that this level is optimal when the critical terms are unweighted. Thus, the two mechanisms cannot combine to lower the compactness threshold. Combining these results with a Pohožaev identity, variational methods for scaled functionals and the Fadell-Rabinowitz cohomological index, we prove nonexistence results, obtain an unbounded sequence of eigenvalues on the scaling line and infinitely many solutions for pure power equations, and show that large superscaled and small subscaled perturbations of the doubly critical equation yield multiple solutions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.21325 ↗

We establish three-term asymptotics for the one-particle Lieb-Thirring constant in dimension two as $γ\to 0$ and identify, up to rescaling and symmetries, the profile of the asymptotically worst potential. The proof uses the well-known relation between the one-particle constant and an integral moment of optimizers of the Gagliardo-Nirenberg inequality. Through the optimizers' characterization as positive, vanishing solutions of the nonlinear elliptic equation $-ΔQ + Q = Q^{s}$ in $\mathbb{R}^2$, the essence of the proof lies in the asymptotic analysis of solutions $Q$ as $s\to\infty$.

fields
Analysis of PDEs, Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2611.21347 ↗

This article establishes the existence of finite time multi-bubble Type II blowup solutions for the focusing energy supercritical nonlinear Schrödinger equation. Given integers $K\geq 2$ and $L\geq 2$, a positive integer exponent $p$, and a dimension $d>d_\ast(p,K,L)$, we construct solutions concentrating at any prescribed $K$ distinct points $\{x_j\}_{j=1}^K\subset\mathbb R^d$, with the asymptotic form \begin{equation*} ψ(t,x)=λ^{\frac1p}(t)\sum_{j=1}^K Q\big(λ(t)(x-x_j)\big)+ζ^\ast(x)+o_{\dot H^σ}(1),\qquad t\to0, \end{equation*} where $λ(t)=t^{-\frac12-ν}$, $ν=-\frac12-\frac{L}{λ_+}$, $s_c=\frac d2-\frac1p$, and $s_c<σ<s_c+\frac{4ν}{1+2ν}$. Here $Q$ is the positive radial stationary profile, $λ_+$ is the slow characteristic exponent in its asymptotic expansion at infinity and $ζ^\ast$ is the limiting radiation determined by the outer profile. The proof combines a matched asymptotic construction of a finite order approximate solution with high order energy estimates and a compactness argument. The key ingredients are the elimination of the self-similar oscillatory branch through a quantized choice of blowup rate and the quantitative control of the combined algebraic tails of the translated ground state potentials.

comments
59 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.21462 ↗

We construct smooth magnetohydrostatic counterexamples to Grad's conjecture in toroidal domains of arbitrary knot type. The magnetic field is nonvanishing, and nested pressure tori fill the domain outside a nondegenerate magnetic axis. The equilibria have trivial Euclidean symmetry group and occur in smooth families of inequivalent configurations. On each regular pressure torus the magnetic flow is smoothly conjugate to a linear flow with any prescribed positive constant slope. A variation of this argument gives equilibria of arbitrary knot type with twist (that is, nonconstant rotational transform) and any finite regularity. A key ingredient of the proof is a deformation method that creates knot topology from axial symmetry by separating the sheets of a covering immersion into a braid, which may be useful in other deformation problems.

fields
Analysis of PDEs, Geometric Topology
pdf ↗ page arXiv:2611.21574 ↗

We consider first-order linear hyperbolic systems with time-dependent pseudo-differential principal symbols and characteristic roots of variable multiplicity. Building on the time-independent work of Kamotski and the first author, we introduce a finite-type condition along the lifted bicharacteristic flow that accounts for the contact of time-dependent characteristic roots. Under this condition, we construct a representation of solutions using time-dependent Fourier integral operators and a Picard series whose terms become increasingly smooth. This leads to an asymptotic expansion in smoothness and local \(L^p\) regularity estimates with the expected loss of derivatives. We also apply these results to higher-order scalar weakly hyperbolic equations with involutive characteristics and time-dependent principal symbols. Finally, we consider upper triangular systems with possibly non-diagonalisable principal parts and derive a representation formula involving integrated Fourier integral operators. This extends the earlier results of Garetto, Jäh and the first author to time-dependent principal parts.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.21585 ↗

Combinatorics80

A core of a graph is a nonempty vertex set in which every member has at least as many neighbours inside the set as outside. We study the minimum size $c_{m,n}$ of a finite core in the graph on $\Z^m$ joining points at sup-norm distance at most $n$. The local majority condition imposes a global geometric constraint: the convex hull of every core has an explicit lattice zonotope $H_n^{(m)}$ as a Minkowski summand. In the plane, this zonotope has width asymptotic to $6ζ(3)n^3/π^2$. We prove that all its lattice points form a core and construct a shell with $O(n^4)$ points. Together with a packing argument, this gives $c_{2,n}=Θ(n^4)$ and coordinate widths $Θ(n^3)$ for every minimum core. We determine $c_{2,1}=12$ and $c_{2,2}=96$ by analytic arguments and prove uniqueness up to translation in both cases. Explicit forced-set and deficit certificates determine further minima within the prescribed zonotope hull. We distinguish these restricted results from global optimality and state the remaining geometric conjectures. We also give a direct reduction from \textsc{Clique} showing that the core problem is NP-complete on general finite graphs, which settles a conjecture of Hassanpour in the terms in which it was posed.

fields
Combinatorics
pdf ↗ page arXiv:2611.18633 ↗

Every closed Riemann surface of genus two is hyperelliptic, so it is determined by six branch points on the sphere, which become cone points of angle pi in the quotient orbifold metric. The Delaunay decomposition of these cone points, dual to the Voronoi diagram of the Weierstrass points, gives a trivalent graph with eight vertices, twelve edges and six faces. We classify these graphs. When the dual triangulation is simple there are exactly two types, dual to the octahedron and to a stacked triangulation, with orientation-preserving automorphism groups of orders 24 and 2, and we determine the Whitehead-move (diagonal-flip) orbit connecting them. Allowing bigons, the orbit closes at exactly twenty types. Iterated edge contraction from the two simple types gives a seven-level hierarchy of 2, 6, 22, 32, 22, 5 and 1 types, ending at two vertices joined by six parallel edges; closing under both contraction and expansion gives all 280 maps on the sphere with six vertices and no vertex of degree one. The rank of the linear cone-angle system of each type equals the real dimension 6 of the Teichmüller space. We realize both simple types by explicit hyperbolic cone spheres, in closed form for the octahedral type, build the corresponding genus-two surfaces by cutting and doubling, and show that the boundary x_e = 0 of the angle system is exactly the concyclicity of four branch points. The classification, the automorphism groups and the flip orbit are formally verified in Lean 4, and every enumeration is reproduced by an independent program, which also determines which types are realized by Delaunay decompositions.

comments
29 pages, 10 figures. A Lean 4 formalization of the finite combinatorics and a verification script for all enumerations are available from the author
fields
Combinatorics, Geometric Topology
pdf ↗ page arXiv:2611.18684 ↗

We study the Axelrod model of cultural dissemination, viewed as a finite-state Markov chain on an arbitrary finite graph, and classify its absorbing states. An absorbing configuration splits the edges into interior edges, whose endpoints share their whole culture, and boundary edges, whose endpoints share nothing. A partition of the vertices into connected blocks is the domain partition of some absorbing configuration exactly when its quotient graph is properly $q$-colourable. The configurations with a given domain partition correspond to homomorphisms from the quotient into the $F$-fold categorical power of $K_q$, so their total number is a sum of chromatic polynomials over connected partitions; this gives closed forms for trees and cycles and the value $2^{n+F-1}$ for $q=2$ on connected graphs. In absorbing configurations no triangle carries exactly one boundary edge, the open-wedge mass of the interior graph is at most that of the host graph, and Newman's assortativity coefficients for domains, cultures and single features are ordered. The feature counts are martingales and their sums of squares submartingales, which yields an absorption-time bound of order $n^2$ that is attained on paths. Exhaustive enumeration and simulations illustrate the results.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.18719 ↗

We study two questions of Morris, Runte and Skelton (Australas. J. Combin. 83 (2022)) on the game of Cops and Robbers. First, we show that the flower snark $J_n$ has cop number $3$ for every $n\geq 5$, and that $J_3$ has cop number $2$. The upper bound comes from a three-cop strategy, which we call the rolling wall. It works on every connected graph whose vertices can be arranged in a cycle of columns, each dominated by a single vertex. Because only one cop moves on each turn, the same strategy also shows that the lazy cop number of $J_n$ is $3$ for $n\geq 5$. Second, we prove the conjecture of Morris, Runte and Skelton that the only generalized Petersen graphs with cop number $2$ are $\mathrm{GP}(n,1)$ and the four graphs $\mathrm{GP}(6,2)$, $\mathrm{GP}(8,2)$, $\mathrm{GP}(9,3)$ and $\mathrm{GP}(12,3)$. The new ingredient is an explicit robber strategy showing that two cops do not suffice on $\mathrm{GP}(3k,k)$ and $\mathrm{GP}(4k,k)$ for $k\geq 4$. The theorem on flower snarks and all of the new lower bounds have been formally verified in the Lean 4 proof assistant.

comments
9 pages, 1 figure, 1 table
fields
Combinatorics
pdf ↗ page arXiv:2611.18787 ↗

APN functions yield the best resistance to differential attacks when used as a building block of a block cipher. APN functions induced by monomials over finite fields have received particular interest both for their simplicity and their unique properties. A key property of APN functions is their linearity, which has been determined for all known APN monomials outside of the Dobbertin APN monomials. In this paper, we close this gap and determine the complete Walsh spectrum and in particular the linearity of the Dobbertin APN monomial, answering a problem that has been open for more than 20 years. Using known connections, our result also yields the asymptotically largest Sidon sets in elementary abelian $2$-groups constructed so far as well as binary linear codes of minimum distance $5$ that are almost optimal.

comments
27 pages
fields
Combinatorics, Information Theory
pdf ↗ page arXiv:2611.18907 ↗

Stanley's question of whether the chromatic symmetric function distinguishes trees has been unanswered for over thirty years. It has now been checked for trees with at most 29 vertices, and for several classes of trees. There is the perception that answering the question might be easier for the class of ``proper'' trees, i.e. trees where every vertex is either a leaf or adjacent to a leaf. In this paper, we show that an affirmative answer for a subclass of proper trees, which we call ``$k$-weighted'', is equivalent to an affirmative answer for all trees. In addition, we show that in the class of $k$-weighted trees, the coefficients carry redundant information. In fact we give a closed formula for obtaining the redundant coefficients from other coefficients.

comments
20 pages, 2 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.18940 ↗

Stretched Kostka polynomials are defined by $f_{λ,μ}(N) := K_{Nλ,Nμ}$, where $K_{λ,μ}$ denotes the corresponding Kostka number. In 2004, King-Tollu-Toumazet conjectured that, for every integer $k$, there are only finitely many polynomials $f_{λ,μ}(N)$ such that $f_{λ,μ}(1)=k$. For $k=3$, KTT also conjectured that there are exactly two such polynomials. We prove both conjectures via Ehrhart theory, by counting lattice points in families of rational polytopes with a fixed set of normals.

comments
14 pages, 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2611.18973 ↗

We provide a rank function axiomatization for flag matroids and show that it is cryptomorphic to the definition of flag matroids as a sequence of matroid quotients. Afterwards, we present some applications of flag matroid rank functions by providing solutions to selected problems. In particular, we discuss connections between flag matroids and submodular valuations in computational economics by showing that rank functions of flag matroids of length $k$ are precisely the same as $\{0, 1, \dots, k\}$-order-neutral submodular valuations. We then prove that $v:2^E\to \mathbb{R}$ is an order-neutral submodular valuation if and only if $v$ can be written as $v(X) = b|X| + \sum_{i=1}^l c_ir_{N_i}(X), \quad b \in \mathbb{R}, c_i > 0$, where $N_{i+1}$ is a quotient of $N_i$. Doing so allows us to prove that every order-neutral submodular valuation is a gross-substitute valuation and that not every order-neutral submodular valuation is a Rado valuation. Furthermore, we prove that if $|E|\geq 3$, then a set $A$ is a Sidon set if and only if all $A$-submodular valuations are order-neutral, if and only if all $A$-submodular valuations are gross-substitute valuations.

fields
Combinatorics
pdf ↗ page arXiv:2611.18989 ↗

Let $(W,S)$ be an irreducible affine Coxeter system. We study Bruhat intervals in $W$ via the well-known characterization of Bruhat order in terms of galleries. We start by using folded galleries to formulate an analogous order on the coweight lattice, which we call Iwahori order. This allows us to reduce the description of certain Bruhat intervals to that of the corresponding Iwahori intervals. We next give closed-form descriptions of all Iwahori intervals, using the quantum Bruhat graph (QBG). More precisely, we show that lower Iwahori intervals saturate pseudo-Weyl polytopes (that is, certain intersections of negative cones), and upper Iwahori intervals saturate certain unions of positive cones, with the cone points given by explicit formulae involving paths in the QBG. We then describe arbitrary Bruhat intervals by partitioning them into their core, a large region which is (in most cases) completely determined by an Iwahori interval, and their crust, the complementary boundary region. We conclude by proving that, under a super-regularity assumption, the crust is covered by certain locally-defined tesselating shapes. All statements and proofs are rank- and type-free.

comments
86 pages, 11 figures, all in color
fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2611.19137 ↗

We study the distribution of the length of the longest path in a uniformly random acyclic orientation of a complete multipartite graph. We derive an explicit analytic expression for the probability generating function of the longest path length, and, for an arbitrary fixed number of parts of equal size, we apply analytic combinatorics in several variables to obtain asymptotics (as the part size tends toward infinity) for its mean longest path length.

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

A (finite or infinite) connected graph is called \textit{cactus-like} if every pair of distinct maximal cliques has at most one vertex in common and its clique graph is a tree. Equivalently, a cactus-like graph is a block graph whose clique graph is a tree. We prove that a finite connected graph $G$ with at least two vertices is cactus-like if and only if its quadratic embedding constant satisfies $\mathrm{QEC}(G)<-1/2$. Moreover, we establish upper and lower bounds for $\mathrm{QEC}(G)$ in terms of the clique degree of a block graph $G$. For the proofs, we develop a method for constructing a conditionally negative definite kernel on a block graph by concatenating local kernels along geodesics in the block graph. Concrete examples include free products of complete graphs and trees.

fields
Combinatorics
pdf ↗ page arXiv:2611.19224 ↗

For every claw-free $C_4$-free planar graph, we prove the sharp weighted bound $α_w(G)\ge (10/31)\sum_v w(v)$, equivalently $χ_f(G)\le31/10$. The proof uses a line-graph representation and the matching polytope; the exceptional small roots are excluded analytically by planar duality and degree-four neighborhood analysis in triangulations. We also prove that, in every $2$-connected $C_4$-free graph of minimum degree at least four, an independent selection of claw centers leaves a compatible subgraph of noncenters with fractional chromatic number at most three; planarity is not required. We apply these results to the conjecture $α(G)\ge5|V(G)|/16$. A minimum-order counterexample without degree-three vertices has at least forty-nine vertices. When all degree-three components of a minimum counterexample are triangle trees, we derive exact boundary states and a joint matching formula. We identify the remaining deficiency estimate and the additional component types that must be addressed to extend this approach. The general conjecture remains open.

fields
Combinatorics
pdf ↗ page arXiv:2611.19256 ↗

The Hadwiger-Debrunner number $\operatorname{HD}_d(p,q)$ is defined as the maximum piercing number over all finite families of compact convex sets in $\mathbb R^d$ in which among every $p$ sets, some $q$ have non-empty intersection. We develop three complementary constructions that improve lower bounds for Hadwiger-Debrunner numbers. For any fixed $q>d\ge 2$, a randomly sparsified family of hyperplanes, analyzed using hypergraph containers, yields $\operatorname{HD}_d(p,q)\ge p^{(d+q-2)/(q-1)+o(1)}$ as $p\rightarrow\infty$. To deduce further bounds, we establish a transfer argument from upper bounds on the sizes of sufficiently general-positioned subsets of high-dimensional integer grids to lower bounds for Hadwiger-Debrunner numbers. Two methodologies are adopted to derive the former: one connects rainbow Turán theory and general-positioned grid sets, and the other uses full spark linear reduction of tuples with bounded-size preimages. As a combinatorial ingredient, we describe the rainbow Turán behavior under suspension operations, which may be of independent interest.

comments
22 pages
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2611.19281 ↗

The set-coloring Ramsey number $R(n;r,s,t)$ is the least $N$ such that every assignment of an $s$-element subset of $[r]=\{1,\ldots,r\}$ to each edge of $K_N$ contains a $K_n$ whose edge labels have at least $t$ common colors. Motivated by the work of Erdős and Szemerédi on $R(n;r,r-1,1)$, we write $R(n;r,r-1,t)=\exp\bigl(nf_{r,n}(t)\bigr)$ and study $f(t):=f_{r,n}(t)$ as $t$ ranges from $1$ to $r-1$. For fixed integers $r\ge2$ and $1\le t<r$, we prove that, as $n\to\infty$, \( \frac12\log\frac{r}{r-t}+o(1) \le f(t) \le \frac{r}{r-t}\log\frac{r}{r-t} +C+O_{r,t}\!\left(\frac{\log n}{n}\right), \) where $C>0$ is an absolute constant. Comparisons between different numbers of colors show that the rates $\liminf_{n\to\infty}f_{r,n}(t)$ and $\limsup_{n\to\infty}f_{r,n}(t)$, defined for fixed $r$ and $t$, each have a limit as $r\to\infty$ and $\frac{t}{r}\toα\in(0,1)$ from above. The resulting two functions of $α$ are finite, positive, nondecreasing, and right-continuous. Writing $Δ_t=f(t+1)-f(t)$, we further prove that, as $r\to\infty$, uniformly for $n\ge r^2$, at least $\frac{(1-o(1))\log r}{\log\log r}$ indices $1\le t<\frac{r}{2}$ satisfy $Δ_t\ge\frac{1-o(1)}{2r}$. For $r,n\ge3$ and $2\le h\le r-1$, the final $h-1$ increments account for at least $1-\frac{1}{\left\lceil h/2\right\rceil}$ of the total increase $f(r-1)-f(1)$. For each fixed $r\ge4$, the last increment has a positive lower limit as $n\to\infty$. Moreover, for $r,n\ge3$, it exceeds the sum of all preceding increments whenever $r$ is even or $n=3$.

comments
27 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.19312 ↗

A connected graph $G$ with $n\ge 2$ vertices and $\varepsilon$ edges is called a \emph{$k$-cyclic graph} if $k=\varepsilon-n+1$. The Laplacian matrix is defined as $L(G)=D(G)-A(G)$, where $D(G)$ is the diagonal matrix of vertex degrees and $A(G)$ is the adjacency matrix of $G$. Let $m_{G}(1)$ be the multiplicity of the Laplacian eigenvalue $1$ of $G$. In this paper, we show that for fixed integers $n\ge \big\lceil\frac{3+\sqrt{8k+1}} {2}\big\rceil$ and $k\geq0$, if $G$ is a $k$-cyclic graph of order $n$, then \begin{equation*} \displaystyle m_{G}(1)\leq n-\big\lceil\frac{3+\sqrt{8k+1}} {2}\big\rceil \end{equation*} and moreover, we completely characterize all extremal graphs attained the upper bound.

fields
Combinatorics
pdf ↗ page arXiv:2611.19326 ↗

If $\mathcal{F}$ is a set of graphs and $F$ is a copy of a graph in $\mathcal{F}$, then we call $F$ an $\mathcal{F}$-graph. Let $G$ be a connected $n$-vertex graph. For a subset $D$ of the vertex set $V(G)$, let $N^2[D]$ denote the second closed neighbourhood of $D$. Let $ι_2(G, \mathcal{F})$ denote the size of a smallest subset $D$ of $V(G)$ such that $N^2[D]$ intersects the $\mathcal{F}$-graphs contained by $G$ (equivalently, $G - N^2[G]$ contains no $\mathcal{F}$-graph). For $k \geq 0$, let $\mathcal{E}_k$ denote the set of connected graphs that have at least $k$ edges (and at least one vertex if $k = 0$). By a well-known result of Meir and Moon, $ι_2(G, \mathcal{E}_0) \leq n/3$ if $n \geq 3$. We show that $ι_2(G, \mathcal{E}_1) \leq n/4$ if $n \neq 2$, $n \neq 3$ and $G$ is not a $7$-cycle. Hua and Liu recently showed that if $G$ is not a $4$-vertex path or a $4$-cycle or a $9$-cycle, then there exists a subset $D$ of $V(G)$ such that $|D| \leq n/5$ and each component of $G-N^2[D]$ has a universal vertex. We strengthen this result by showing that $ι_2(G, \mathcal{E}_2) \leq n/5$ if $n \neq 3$, $n \neq 4$ and $G$ is not an $8$-cycle or one of five $9$-vertex graphs. It follows that $ι_2(G, \mathcal{E}_3) \leq n/5$ if $G$ is not a $3$-cycle or a $4$-vertex graph or a $9$-cycle. This also implies the result of Hua and Liu, and that if $\mathcal{C}$ is the set of cycles, then $ι_2(G, \mathcal{C}) \leq n/5$ unless $G$ is a $3$-cycle or a $4$-vertex graph containing a cycle. All these bounds are sharp.

comments
15 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.19361 ↗

This article studies a triangular variant of bumpless pipe dreams for involutions in the symmetric group. We prove that a natural weight generating function for these objects recovers all involution Schubert polynomials. For vexillary involutions, we derive a $K$-theoretic extension of this result that gives a new formula for orthogonal Grothendieck polynomials. In the course of showing this formula, we compute a diagonal term order Gröbner basis for the defining ideals of symmetric matrix Schubert varieties associated to vexillary involutions. As applications, we prove a conjectured product formula for principal specializations of involution Schubert polynomials. We go on to derive a shifted analogue of the Fomin–Kirillov formula counting bounded plane partitions. This analogue proves the straight-shape case of a conjecture of Ferroni, Morales, and Panova on the Ehrhart positivity for the order polytopes of shifted partitions. We also conjecture a bumpless pipe dream formula for involution Grothendieck polynomials and discuss connections with diagonally symmetric alternating sign matrices and asymptotics of principal specializations.

comments
53 pages, 1 figure, 1 table
fields
Combinatorics, Commutative Algebra
pdf ↗ page arXiv:2611.19371 ↗

Consider a bicolored point set $P$ in general position in the plane consisting of $n$ blue and $n$ red points. We show that if $P$ can be partitioned into bicolored pairs $(a_i,b_i)$ such that, for every $i$, $a_i$ and $b_i$ have different colors and the sets $P\setminus \{a_i\}$ and $P \setminus \{b_i\}$ have the same order type, then there exists a noncrossing alternating Hamiltonian path on $P$. We also investigate the case when $P$ lies on the circle, and every interval along the circle contains at most $c$ more points of one color than of the other. For $c=2$, we show that there exists a noncrossing alternating Hamiltonian path on $P$. For $c=3$, we show that there exist configurations of points for which the longest noncrossing alternating path on $P$ has size at most $(2-1/25)n + O(1)$.

comments
10 pages, 5 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.19433 ↗

Given graphs $G$ and $H$, the Ramsey number $r(G,H)$ is the smallest integer $N$ such that any red-blue edge coloring of $K_N$ contains a red copy of $G$ or a blue copy of $H$. If $H$ is connected, Burr's lower bound gives $r(G,H)\geq (χ(G)-1)(|V(H)|-1)+s(G)$, where $s(G)$ is the minimum size of a color class over all proper $χ(G)$-colorings of $G$. The graph $H$ is called $G$-good if equality holds in this bound. Liu and Li [J. Graph Theory, 2025] characterized the graphs $G$ with $s(G)=1$ for which $K_p+nH$ is $G$-good for $p\geq 2$ and sufficiently large $n$, and posed the corresponding problem for $p=1$. We solve this problem by showing that for a graph $G$ with $χ(G)=k+1\geq 2$ and $s(G)=1$, a graph $H$ of order $h$ and sufficiently large $n$, $K_1+nH$ is $G$-good if and only if $G\subseteq mK_2+K_{k-1}(m)$ when $nh$ is odd, or $G\subseteq (mK_2\cup K_{1,2})+K_{k-1}(m)$ when $nh$ is even, for some positive integer $m$.

comments
7 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.19434 ↗

The second order extended Zarankiewicz number $z_{2M}(m,n)$ of Qi and Yu allows a secondary half of a $2$-edge to be shared, while the $1$-edge graph stays $C_4$-free and extremal and $1$-edges and main halves stay exclusive. Whether $z_{2M}(21,4)=55$ is open. Since deleting a $2$-edge removes exactly one displayed square, $z_{2M}(21,4)=55$ if and only if there is no irreducible admissible configuration with exactly $56$ displayed squares, and by the cell count of Qi and Yu and the heredity of irreducibility such a configuration without empty cells is an extremal $55$-square configuration of $z_2(21,4)$ plus one $2$-edge at its hole. For the extremal configuration of Chen and Chen we show, by certificates verified in exact rational arithmetic, that all $56$ such extensions have SOS rank at most $55$: $32$ by product relations and $24$ by contraction certificates of Xu–Yan type. We also show, with computer-assisted certificates and an exhaustive isomorphism search, that the extremal configurations of $z_2(21,4)$ fall into at least six isomorphism classes; Chen and Chen leave the structural classification of extremal augmented graphs open. Finally we prove a six-to-four reduction. For irreducible configurations whose $1$-edge graph is $C_4$-free with $m+\binom n2$ edges it bounds the multiplicity of a shared half by $n(n-1)$ ($12$ at $21\times4$), and it applies directly to an explicit number of the extensions of any extremal configuration of $z_2(21,4)$, eight for that of Chen and Chen, bringing each to at most $54$ squares, in agreement with the certificates. The cell count, the heredity lemma, the rows lemma, the six-to-four identity and a $2\times2$ example are checked in Isabelle/HOL; the remaining arguments are written proofs.

fields
Combinatorics
pdf ↗ page arXiv:2611.19437 ↗

It was recently shown that the question of whether the determinant-like map \(\det^{S^2}\) is unique up to multiplication by a scalar is equivalent to a combinatorial conjecture regarding cycle-free \(d\)-partitions of the complete graph \(K_{2d}\), known as the twin-star hypothesis. This hypothesis asserts that every cycle-free \(d\)-partition of \(K_{2d}\) is weakly equivalent to one that contains a component isomorphic to the twin-star graph \(TS_d\). This hypothesis was previously established for \(d\le4\). In the present paper, we prove it for \(d=5\). Consequently, the associated determinant-like map \(\det^{S^2}\) is unique up to a scalar in dimension \(5\).

fields
Combinatorics
pdf ↗ page arXiv:2611.19473 ↗

The Harborth constant $\mathsf g(G)$ of a finite abelian group $G$ of exponent $n$ is the least integer $k$ such that every subset of $G$ of size at least $k$ contains $n$ elements whose sum is zero. Let $C_n$ be a cyclic group of order $n$. Gao and Thangadurai \cite{gt} in 2004 conjectured that $\mathsf g(C_n\oplus C_n)=2n+(-1)^n$ for all integers $n\ge3$. We prove this conjecture for all sufficiently large integers $n$.

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

We construct sets of $1104$ points in $\mathbb{F}_3^9$ and $5744$ points in $\mathbb{F}_3^{11}$, each containing no three distinct collinear points. A reflection lift sends the Calderbank–Fishburn $236$-cap to a cap with three parallel layers of sizes $512,80,512$; both outer layers are linearly equivalent to the FunSearch $512$-cap. A coordinate substitution in Hill's $112$-cap uses replacement sets of sizes $80,32,32$ for the three values of one scalar coordinate. Assigning the $80$-point set to a noncentral $45$-point section gives $5744$, gaining $240$ points over the $5504$ construction obtained from a central $40$-point section.

comments
8 pages, 1 figure. Coordinates and verification code: https://github.com/holdenmatt/capset-constructions
fields
Combinatorics
pdf ↗ page arXiv:2611.19543 ↗

We prove the record bound $C_{3b}\le 209357544569848128/114631769327023765=1.8263483657186\ldots$ for the Katz-Tao sum-difference exponent, valid in every abelian group without $2$-torsion. Using only Shannon inequalities, conditional copies and Katz-Tao's original directions, whose classical single-grid argument gives $11/6$, we break $11/6$, obtaining $2762/1509$ and $152/83$. For every abelian group we prove the universal bound $C_{\mathrm{all}}=10304335425987192362/5641833174538280329=1.8264161855212\ldots$, which is below the previous record for the real Katz-Tao constant. In the AlphaEvolve study (arXiv:2511.02864v3), the search for extremal distributions improved this constant's lower bound in the eighth decimal place and left its upper bound at $11/6$. Our upper bounds are proofs discovered by CASPAC, the computational mathematics engine of the CASP research system, and certified by independent exact checkers. The proofs use stacked entropy certificates; we supply the complete rational identities, proofs of every auxiliary inequality, and exact verification over the stated group classes.

comments
14 pages, 2 figures. Complete proof certificates and exact verification code included as ancillary files
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.19594 ↗

Given any finite set of points in $\mathbb{R}^2$, Neumann-Lara and Urrutia \cite{NLUr88} proved in 1988 that there is always a pair such that every circle through the two points encloses a positive fraction of all points. While Edelsbrunner et al.\ \cite{EHSS89} showed that the fraction is at least $\sfrac{1}{2} - \sfrac{1}{\sqrt{12}} = 0.211\ldots$, Urrutia \cite{Urr02} conjectured that the constant $\sfrac{1}{4} = 0.25$ in the upper bound proved by Hayward, Rappaport and Wenger \cite{HRW89} is best possible. We disprove this conjecture by lowering the constant to $\sfrac{3}{14} = 0.214\ldots$. The new bound also disproves a related conjecture by Ramos and Viaña \cite{RaVi09} on finite sets in convex position in $\mathbb{R}^3$. Finally, we generalize the latter extremal question to finite sets in possibly non-convex position, for which we prove the first linear lower bound, with constant $\sfrac{(2-\sqrt{2})}{6} = 0.097\ldots$.

fields
Combinatorics
pdf ↗ page arXiv:2611.19600 ↗

For $n \geq m$, the linked double star $S_c(n, m)$ is the graph formed by taking two disjoint stars $K_{1, n}$ and $K_{1, m}$ and linking their centers with a path on $c$ vertices. In this paper, we investigate the Ramsey numbers of even-linked double stars, that is, where $c = 2p$ for some $p \in \mathbb{N}$. Determining the Ramsey numbers of the $p = 1$ case (classical double stars) is a longstanding open question; the $p = 2$ case was resolved by Burr and Erdős in 1976, and Liu and Chen made progress for general even-linked double stars in 2026. We extend Burr and Erdős' formula for $p = 2$, proving that the Ramsey number of $S_{2p}(n, m)$ is given by \[r(S_{2p}(n, m)) = \max(2n + 2p - 1, n + 2m + 3p - 1),\]when $m \geq p -2 \geq 0$. Our upper bound argument hinges upon the existence (or nonexistence) of an object that we call a polarized pair. We also establish a matching lower bound that applies for all $n, m, p \geq 2$, and as such, we conjecture that this formula applies for all even-linked double stars where $p \geq 2$.

comments
36 pages, 9 figures; comments welcome
fields
Combinatorics
pdf ↗ page arXiv:2611.19632 ↗

We investigate extremal and near-extremal 2-colorings of three-dimensional grids without monochromatic axis-parallel boxes. Our approach focuses on the parameter $ρ(a,b)$, defined to be the minimum number of monochromatic rectangles in a 2-coloring of an $a\times b$ grid. We determine $ρ(a,b)$ for several small grids and use these values to obtain upper bounds on the number of layers that can be stacked to form an $a\times b\times c$ grid without creating a monochromatic box. Explicit constructions and computational certificates show that these bounds are attained for several cases, including grids of dimensions $5\times5\times100$, $5\times6\times75$, and $6\times6\times75$. For the grid of dimension $5\times7\times c$, we construct a box-free coloring with $c=50$, while our counting bound gives $c\leq 52$. This gap suggests that the counting bound may not always be sharp. We also investigate the largest $n\times n\times n$ cube admitting a box-free 2-coloring. We found box-free colorings of the $n$-cube for $n\leq 10$, and colorings of the $11\times11\times11$ cube with only eight monochromatic boxes. On the other hand, we show that every 2-coloring of the $21\times21\times21$ cube contains at least 21 monochromatic boxes. Thus the largest box-free cube has side length between 10 and 20, inclusive. We conclude with conjectures and open problems.

fields
Combinatorics
pdf ↗ page arXiv:2611.19635 ↗

Suppose that a graph $G$ contains exactly $k$ different subdivisions of a $K_5$ or $K_{3,3}$. We prove that in this case the crossing number of $G$ is at most $\binom{3k+7}{2}$ (and, when $k\le 2$, it is at most $k$).

fields
Combinatorics
pdf ↗ page arXiv:2611.19641 ↗

Determining the chromatic number of associahedra is a long-standing open problem. Tan [arXiv:2611.05323] recently proved that associahedra are 12-colourable, which is the first constant upper bound. This paper adapts Tan's argument to show that associahedra are 8-colourable.

fields
Combinatorics
pdf ↗ page arXiv:2611.19659 ↗

We prove the conjecture of Canfield, Corteel, and Savage that for every positive integer $n$, the Durfee polynomial $D_n(x)=\sum_{d=1}^{\lfloor\sqrt n\rfloor}p(n,d)x^d$ counting partitions of $n$ by the side length of their Durfee square has only real zeros. More precisely, $D_n$ has a simple zero at the origin and exactly $\lfloor\sqrt n\rfloor-1$ simple negative zeros. Consequently, for every $n\ge1$, the sequence $p(n,1),\ldots,p(n,\lfloor\sqrt n\rfloor)$ is strictly log-concave and unimodal. As a further consequence, the Durfee square side length of a uniformly chosen partition of $n$ has the same distribution as $1$ plus a sum of independent Bernoulli random variables.

comments
28 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.19665 ↗

We enumerate ordered pairs $(f,g)$ of endofunctions on a finite labeled set $X$ satisfying a composition identity of type $(2,3)$, with two factors on one side and three on the other. For all sixteen forms up to exchanging $f$ and $g$, we derive formulas involving finite sums and generating functions. The arguments use images and fibers, homomorphisms between functional digraphs, and isomorphism types of iterates. A common construction decomposes weighted allocations of fibers into trees and cycles, yielding determinant expressions for several generating functions. Colored functional digraphs provide further formulas. As a by-product, for arbitrary prescribed endofunctions $A,B$ on $X$, we derive an inclusion–exclusion formula over subsets of $X$ for the number of endofunctions $g$ on $X$ satisfying $B=gAg$.

fields
Combinatorics, Rings and Algebras
pdf ↗ page arXiv:2611.19668 ↗

Bau and Johnson introduced semi-interval graphs and asked whether one of the two extremal sets can always be replaced by a single vertex. A negative answer to this question is given by a tree which has no such representation. It is also shown that a finite connected graph with at least two vertices is a semi-interval graph if and only if it is bipartite. Para-interval graphs, for which one extremal set consists of a single vertex, are characterized by necessary and sufficient conditions on their distance matrices. A characterization of para-interval trees is obtained, and a relation between para-interval graphs and shortest-path interval graphs is established by identifying the vertices of an extremal set. Finally, leveled graphs and the corresponding Hasse diagrams of finite partially ordered sets are considered.

fields
Combinatorics
pdf ↗ page arXiv:2611.19711 ↗

Given an $H$-free graph $G$, a non-edge $e$ of $G$ is called $H$-saturating if $G+e$ contains a copy of $H$. The function $f_H(n,m)$ denotes the minimum number of $H$-saturating non-edges over all $n$-vertex $H$-free graphs with exactly $m$ edges. In this paper, we give a complete classification of the asymptotic behavior of $f_H(n,\operatorname{ex}(n,R)+1)$ for any fixed graph $H$ satisfying $χ(H)>χ$ and $χ(H-e)>χ$ for every $e\in E(H)$, where $χ\ge 2$ and $R$ is an arbitrary fixed edge-critical graph with $χ(R)=χ+1$. We show that this quantity is of quadratic order, asymptotic to $\frac{2n}χ$, or zero, according to the existence and structure of $χ$-critical two-edge sets of $H$. In particular, we resolve the conjecture proposed by He et al. ({\it J. Combin. Theory Ser. B} 159 (2023), 42-60).

fields
Combinatorics
pdf ↗ page arXiv:2611.19750 ↗

A recent exact certificate shows that C^6 admits no seven mutually unbiased bases, hence at most five (OpenAI, 2026). That argument has two parts. The first proves the Fourier-vanishing conjecture of Matolcsi, Ruzsa and Weiner for every complex Hadamard matrix of order six other than Tao's cubic matrix, and excludes the cubic matrix separately. The second feeds this vanishing into a positivity certificate on mixed moments of a hypothetical complete family. We show that the first part is not needed. We keep the same six families of test functions and the same linear identities, but we never set a moment to zero because of Fourier vanishing. New positive definite integer matrices still give the contradiction. The only inputs are orthonormality, unbiasedness, the second-moment (2-design) identity of a complete family, and the trivial bound |moment| <= 1. A standard-library program checks the certificate in exact integer and rational arithmetic in under a minute and a half. We also record computational observations that are not part of the proof: a systematic S_6-symmetric family of test functions appears to close the argument with relations of total order at most 7 instead of 11, and at order 9 two orbit types of test charges appear to suffice. In the prime-power dimensions 4,5,7,8, where complete families exist, the same pipeline finds no certificate, as it must.

fields
Combinatorics
pdf ↗ page arXiv:2611.19809 ↗

Let $p_n$ be the least number of lines meeting the interior of every cell of an $n\times n$ board. We prove that $\liminf_{n\to\infty}p_n/n\ge0.7520517>\frac34$. The previous bound was $0.7$. The proof is computer-assisted. It identifies a non-negative polynomial on the unit square and bounds its integral along every line.

fields
Combinatorics
pdf ↗ page arXiv:2611.19816 ↗

The Hadwiger-Ramsey number $R_h(k;\ell)$ is defined as the smallest integer $n$ such that for any edge coloring of a complete graph on $n$ vertices in $\ell$ colors at least one of the color classes induces a graph with a $K_k$ minor. We show that $R_h(k;3) = \left(β^{-1} + o(1)\right)k \sqrt{\ln k}$, where $β^{-1} = 2/\sqrt{-\ln(10-4\sqrt6)} = 1.58149\ldots$. This resolves the first open case of a problem by Axenovich and Steiner, who determined the asymptotic behavior of $R_h(k;2)$ and asked about the asymptotics of $R_h(k;\ell)$ for $\ell \geq 3$.

fields
Combinatorics
pdf ↗ page arXiv:2611.19834 ↗

For a nonempty family $\mathcal F$ of graphs, a graph is $\mathcal F$-semi-saturated if adding any missing edge creates a copy of some member of $\mathcal F$ containing the added edge, and is $\mathcal F$-saturated if it is also $\mathcal F$-free. The minimum numbers of edges in such graphs of order $n$ are denoted by $\operatorname{ssat}(n,\mathcal F)$ and $\operatorname{sat}(n,\mathcal F)$, respectively. We study these parameters for families of graphs obtained by taking the join of a fixed complete graph with each member of a given graph family. Assume that every member of $\mathcal F$ has at least $8$ vertices, minimum degree at least two, and no triangle containing two vertices of degree two. We give explicit sufficient conditions under which $\operatorname{sat}(n,K_t\vee\mathcal F) =\binom{t}{2}+t(n-t)+\operatorname{sat}(n-t,\mathcal F),$ and characterize all extremal graphs. For the family $\mathcal C_{\ge r}=\{C_\ell:\ell\ge r\}$ of subdivisions of $C_r$, this identity holds for fixed $t\ge1$ and $r\ge4t^2+8t+29$ and all sufficiently large $n$. For $K_t\vee C_k$ with $k\ge2t^2+3t+4$, we establish the corresponding identity for saturation when $n\ge2(k+t-2)^3$ and for semi-saturation when $n\ge56k^3+t-1$.

fields
Combinatorics
pdf ↗ page arXiv:2611.19835 ↗

We establish higher connectivity of polyhedral complexes admitting a unique positive balanced top cycle. Our main result shows that, after quotienting by common lineality, every skeleton satisfies the corresponding higher connectivity property. The proof bounds the number of connected components surviving facet deletions by the dimension of the top-cycle space using homological and linear-algebraic arguments. As applications, we prove higher connectivity for all skeleta of arbitrary pointed polyhedral structures on tropical linear spaces of valuated matroids and Bergman fans including nonrealizable cases. These results answer questions raised by Maclagan and Yu.

comments
13 pages, 2 figures
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2611.19866 ↗

We prove a conjecture of Gerke, Gutin, Yeo, and Zhou: for every finite triangle-free subcubic graph other than the claw and every nonnegative edge weighting, there is a bisection whose weight is at least $11/15$ of the total edge weight. This bound is best possible, as shown by the Petersen graph. The proof uses matching-based local distributions, weighted induction, and convex separation to establish the edgewise cut guarantees while maintaining global balance.

fields
Combinatorics
pdf ↗ page arXiv:2611.19881 ↗

Label the $mn$ vertices of the grid graph $P_m \times P_n$ bijectively by $1, \dots, mn$ and read the labels in increasing order; this produces a Hamiltonian path whose length in the Manhattan metric is denoted $M(P_m \times P_n)$. McNeil conjectured, on the basis of computer evidence, that $M(P_n \times P_n) = n^3 - 3$ for even $n$ and $n^3 - n - 1$ for odd $n$. Fried recently determined $M(P_m \times P_n)$ up to an additive error of one. We determine it exactly, which settles McNeil's conjecture. The proof rests on the cut-counting bound for multisets. Fried states that bound for multiplicities at least two; we give a form valid for every multiplicity, with a correction term that is invisible in the planar case but not in higher dimensions.

comments
11 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.19908 ↗

In this article, we study the gaps, the maximal gaps, and the pseudo-Frobenius elements of generalized numerical semigroups of minimum embedding dimension. For these semigroups, we give an explicit description of the set of gaps, explicit formulas for the genus and the number of maximal gaps, and an explicit description of the set of pseudo-Frobenius elements in terms of the blocks of consecutive gaps of an associated numerical semigroup. In particular, we obtain an explicit formula for the type. As a consequence, we show that the type is unbounded even in minimum embedding dimension. Further, we prove that every generalized numerical semigroup with minimum embedding dimension has at least as many non-gaps below its gaps as gaps, and therefore satisfies the generalized Wilf's conjecture. We also prove the conjecture for generalized numerical semigroups in $\mathbb{N}^2$ graded by two-generated numerical semigroups, and asymptotically in higher dimension. For an arbitrary generalized numerical semigroup we bound the number of non-gaps below the gaps in terms of the genus and the type. Finally, we introduce nearly-symmetric generalized numerical semigroups and classify them in minimum embedding dimension. Although the type is unbounded in minimum embedding dimension generalized numerical semigroups, nearly-symmetric ones have type at most two.

fields
Combinatorics, Commutative Algebra
pdf ↗ page arXiv:2611.20086 ↗

In 1982, Win conjectured that, for every even integer $n$ and every integer $k$ $1\le k\le n-2$, any graph $G$ of order $n$ satisfying $d_G(x)+d_G(y)\ge n+k-2$ for every pair of nonadjacent vertices $x,y$ contains $k$ pairwise edge-disjoint perfect matchings. In this paper, we prove a stronger result for all sufficiently large even $n$. More precisely, we show that under the same degree-sum condition, $G$ contains $\lfloor k/2\rfloor$ pairwise edge-disjoint Hamilton cycles, together with an additional perfect matching when $k$ is odd, all pairwise edge-disjoint. Consequently, we confirm Win's conjecture for all sufficiently large even $n$, with a threshold independent of $k$.

comments
8 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.20093 ↗

We exhibit a complex Hadamard matrix of nonzero defect which is isolated among complex Hadamard matrices, up to Hadamard equivalence. This counterexample is realized by a Butson-type Hadamard matrix of size $13$, with entries roots of order $6$ of unity. In the language of commuting squares, this shows that the span condition, previously introduced by the second author as a sufficient condition for isolation, is not a necessary condition for isolation.

fields
Combinatorics, Operator Algebras, Quantum Algebra
pdf ↗ page arXiv:2611.20136 ↗

Partizan Arc Kayles, or PArcK, is a partizan combinatorial game on edge colored graphs, and is a generalization of the game Domineering. Previously, PArcK was shown to be PSPACE-complete on bipartite graphs. In this paper we show that PArcK is PSPACE-complete even when restricted to planar graphs of degree at most three by a reduction from Generalized Hex.

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

We prove a general theorem on the existence of small maximal independent sets in set systems satisfying natural local density conditions. For an antichain whose degrees are uniform and whose small sets lie in few blocks and whose links overlap little, we show that there is a maximal independent set whose size is asymptotically given by an explicit expression in the degrees, as the degrees grow. The proof comes with a polynomial-time algorithm that finds such a set. This improves on known results for independent sets in uniform hypergraphs; in particular, in a linear uniform hypergraph of large bounded degree, we find an independent set of explicit asymptotic size. Among the applications, we obtain complete arcs in finite projective spaces that come within logarithmic factors of the counting lower bound, improving the known results on Segre's complete arc problem. We also show that, for a wide class of multivariable polynomials, there is a maximal set in a finite field avoiding solutions of the polynomial whose size lies within logarithmic factors of the elementary lower bound.

comments
160 pages, comments welcome, for the actual abstract see the paper, this is an abbreviation due to Arxiv size restriction of abstract
fields
Combinatorics
pdf ↗ page arXiv:2611.20167 ↗

We study the Davenport constant of finite abelian groups through signed identities among zero-sum subsequences. An integral incidence identity of degree $t$ for a sequence assigns integer weights to its nonempty zero-sum subsequences so that the weights add up to one, while those of the subsequences containing any given nonempty set of at most $t$ terms add up to zero. Over a finite abelian $p$-group $H$, the zero-sum subsequences of a sequence of any length have an indicator polynomial of degree at most $D(H)-1$, and this gives a transfer principle: if, for each $t\ge0$, every sequence of $L(t)$ terms over $Q$ admits such an identity of degree $t$, then $D(Q\oplus H)\le L(D(H)-1)$ for every finite abelian $p$-group $H$. For $m\in\{2,3,4\}$ we construct integral identities at length $L(t)=m(t+3)-2$ over $C_m^3$, and prove that these thresholds are sharp over fields of characteristic zero or characteristic not dividing $m$. For a prime $p\nmid m$ and $0\le a\le b\le c$, we prove that \[ D(C_{mp^a}\oplus C_{mp^b}\oplus C_{mp^c}) =m(p^a+p^b+p^c)-2. \] In particular $D(C_{15}^3)=43$ and $D(C_{20}^3)=58$, which are the two smallest cases of the conjecture $D(C_n^3)=3n-2$ left open in the literature. The proofs of the base cases for $m \in \{3,4\}$ are computer-assisted. All of the results in this paper have been formalised in Lean 4.

comments
the mathematical arguments are on the first 13 pages; comments are welcomed
fields
Combinatorics
pdf ↗ page arXiv:2611.20197 ↗

Independent Set Reconfiguration asks whether one of two given independent sets of equal size can be transformed into the other by moving one token at a time while keeping the occupied vertices independent. In token sliding, a token moves along an edge. In token jumping, it may move to any unoccupied vertex. For both rules, the problem is solvable in polynomial time on trees and is PSPACE-complete on graphs of treewidth at most $c$ for some fixed constant $c$. For each rule, the smallest treewidth bound that suffices for hardness has long been open. We narrow this gap by proving that both versions are NP-hard on graphs of treewidth four.

fields
Combinatorics
pdf ↗ page arXiv:2611.20205 ↗

Every standard Sturmian word $c_\mathbf{d}$ is determined by a directive sequence $\mathbf{d}=(d_i)_{i\ge 1}$ of positive integers, and its palindromic prefixes are obtained by iterated palindromic closure. We describe the lengths of these prefixes by the numbers $j\,\ell_{i-1}+\ell_{i-2}-2$, where $\ell_n$ is the length of the $n$-th standard word and $1\le j\le d_i$, and we show that each nonzero length is attained by exactly one pair $(i,j)\neq(1,1)$. For a purely periodic directive sequence of period $k$ we then prove that the number $π_\mathbf{d}(N)$ of nonempty palindromic prefixes of length at most $N$ satisfies \[ π_\mathbf{d}(N)\sim\frac{d_1+\cdots+d_k}{\logλ_\mathbf{d}}\,\log N, \] where $λ_\mathbf{d}$ is the largest eigenvalue of the matrix $M(d_1)\cdots M(d_k)$. For the Fibonacci word this gives $π_\mathbf{d}(N)\sim\log N/\log\varphi$, where $\varphi=(1+\sqrt5)/2$.

fields
Combinatorics
pdf ↗ page arXiv:2611.20221 ↗

In 1970 Monsky showed that a square cannot be dissected into an odd number of equal-area triangles. His proof used an ingenious colouring of the plane based on a 2-adic valuation on $\mathbb{R}$ together with Sperner's lemma. Subsequent work established similar results for regular polygons, centrally symmetric polygons, and polyominoes. In 2000, Stein proposed a common generalisation of the centrally symmetric and polyomino cases to balanced polygons. In 2014, Rudenko introduced a new perspective on the problem and proved Stein's conjecture for dissections with rational vertex coordinates. Building on and streamlining his approach, we resolve the conjecture in full.

comments
9 pages, 1 figure
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.20240 ↗

A set $A$ of points is called Ramsey if, for each $r$, every $r$-coloring of a sufficiently high-dimensional Euclidean space contains a monochromatic congruent copy of $A$. We show that for each Ramsey set $A$, every $r$-coloring of a sufficiently high-dimensional Euclidean space, regardless of the number of colors used, contains a monochromatic or a rainbow congruent copy of $A$. This answers a question raised in virtually every paper on the topic.

comments
8+2 pages, early announcement mainly due to ChatGPT-6 Astra, will be replaced shortly
fields
Combinatorics
pdf ↗ page arXiv:2611.20270 ↗

Let $G=(V,E)$ be a finite simple undirected graph, let $T\subseteq V$, and let $F\subseteq E$. We call $F$ semi-cutting for $T$ if $d_{G}(u,w)<d_{G\setminus F}(u,w)$ for every two distinct terminals $u,w\in T$. We prove the sharp bound $|F|\ge |T|-1$. The argument is structural: semi-cutting sets are first identified with edge transversals of all shortest terminal-terminal paths, and the bound then follows from a contraction step, a terminal-deletion lemma, and a lexicographic induction on $(|T|,|V|)$.

comments
7 pages, 4 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.20287 ↗

A ReLU pattern variety records the polynomial relations among the coefficients of the affine maps associated with a prescribed set of activation patterns of a ReLU network. We study how the combinatorics of the canonical set of activation patterns of an unbiased ReLU network is reflected in the geometry of its pattern variety. In particular, we introduce the notion of pattern stability and characterize pattern stability and combinatorial stability for shallow networks. When the associated wall graph is connected and contains an edge of every neuron label, we resolve a problem of Alexandr and Montúfar by determining the defining ideal of the associated pattern variety explicitly. We establish a hierarchy of progressively weaker equivalence relations relating labeled combinatorial equivalence, equality and permutation equivalence of canonical pattern sets, and equivalences of the associated varieties. Finally, we relate functional dimension to the differential of the pattern map and show that it is bounded above by the dimension of the canonical pattern variety at every depth. For nondegenerate shallow networks, we give an exact formula for the functional dimension; for every shallow architecture, it equals the dimension of the canonical pattern variety on an open dense set of full Lebesgue measure.

fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2611.20346 ↗

For a prime $p>3$, let $F(p)$ be the largest cardinality of a subset of $\mathbb F_p^2$ containing no equilateral triangle with nonzero squared side length. Alex Iosevich asked for the exact value of $F(p)$. By constructing such subsets of $\mathbb F_p^2$ from cap sets in $\mathbb F_3^n$, we obtain the uniform lower bounds \[ F(p)\gg \begin{cases} p^{2γ}, & p\equiv 11\pmod{12},\\ p^{1+γ}, & p\equiv 1\pmod{12}. \end{cases} \] Here $γ=\log_3(2.2202)$, so the two exponents are $1.452008666\ldots$ and $1.726004333\ldots$, respectively. We also apply a quantitative corners theorem to show that $F(p)=o(p^2)$ as $p\to\infty$ through either congruence class.

comments
14 pages
fields
Combinatorics, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.20408 ↗

A correspondence cover assigns a set of possible colors to each vertex of a graph. For each edge, a matching between the two endpoint color sets specifies the forbidden color pairs. A correspondence coloring selects one color at each vertex so that no forbidden pair is selected. A full correspondence packing is a collection of such colorings that uses every color at each vertex exactly once. We prove a conjecture of Cambie, Cames van Batenburg, Davies, and Kang [Random Structures & Algorithms 64 (2024), 62–93]. For every sufficiently large $D$, there is a positive integer $k(D)=(1+o(1))D/\log D$ such that every correspondence cover of any finite bipartite graph has a full correspondence packing if each color has at most $D$ forbidden partners and each vertex has $k(D)$ colors. More precisely, we prove this conclusion with \[ k(D)=\left\lceil\frac{D}{\log D-2\log\log D-6}\right\rceil \] for every integer $D\ge\lceil e^{20}\rceil$.

fields
Combinatorics
pdf ↗ page arXiv:2611.20504 ↗

Let $G$ and $H$ be graphs on $n$ vertices with $e(G)=p\binom{n}{2}$ and $e(H)=q\binom{n}{2}$, where $p,q\in(0,1)$ are fixed. Bollobás and Scott studied intersections of two graphs under random relabelling and asked for the minimum $L^2$ norm of the deviation of their intersection size from its expected value. We answer this question by proving that, for graphs of order $n$ with fixed edge densities $p,q\in(0,1)$, the minimum is \begin{equation*} \left(\sqrt{\frac{p(1-p)q(1-q)}{2}\cdot\frac{1-\sqrt R}{1+\sqrt R}}\right)n+o(n), \end{equation*} where $R=\max\{p,1-p,q,1-q\}$. The coefficient of the linear term is best possible. Bollobás and Scott defined the positive and negative discrepancies of two hypergraphs as the largest deviations of their intersection size above and below its expected value under relabelling, respectively. They asked for the minimum product of the positive and negative discrepancies of two $(n/2)$-uniform hypergraphs on $n$ vertices with $\frac{1}{2}\binom{n}{n/2}$ edges. We answer this question by proving that the minimum product of these discrepancies is $0$ if $4\mid\binom{n}{n/2}$ and $1/4$ otherwise.

fields
Combinatorics
pdf ↗ page arXiv:2611.20539 ↗

Let $L=\{0,1,2,3,4,8\}$, associated with the large Witt design $S(5,8,24)$, and let $m(n,24,L)$ be the maximum size of a family of $24$-element subsets of an $n$-element set whose distinct members have intersection sizes in $L$. We prove that there are positive constants $c,C,n_0$ such that, for every $n\geq n_0$, \[ cn^{316/63}\leq m(n,24,L)\leq Cn^{169/29}. \] We also obtain similar results for the systems associated with $S(4,7,23)$, $S(3,6,22)$, and $S(3,4,14)$. The upper bounds follow from a non-Shannon information inequality and disprove conjectures of Kupavskii and Terekhov. The lower bounds follow from an algebraic construction for arbitrary Steiner systems.

comments
14 pages
fields
Combinatorics, Information Theory
pdf ↗ page arXiv:2611.20554 ↗

Nonclassical multiphoton interference is an important resource for optical quantum information processing, and its output statistics depend on the distinguishability of the input photons. In this paper, using time delay as a tunable parameter, we theoretically analyze the interference behavior of independent pure-state single photons with identical Gaussian spectral envelopes under near-synchronous conditions. Using the immanant representation of the single-photon internal-state overlap matrix to express the weights of the exchange-symmetry components, we determine the leading asymptotic behavior and approximation error of each weight, and characterize the weight suppression laws when different groups of photons become synchronized on different scales. Given the local identity classes of the delay functions and the vanishing orders of pairwise delay differences, the vanishing orders of the weights of the exchange-symmetry components can be computed in polynomial time by integer minimum-cost flow. On this basis, we provide a network-independent total-variation error bound for the complete output photon-number distribution, establish a quantitative relationship among the photon spectral width, synchronization precision, and interference statistics deviation, and provide a quantitative basis for the analysis and approximation of near-synchronous multiphoton interference.

fields
Combinatorics
pdf ↗ page arXiv:2611.20667 ↗

The \emph{separation number} $\sn(G)$ of a graph $G$ is the smallest integer $a$ such that every subgraph $H$ of $G$ admits a separation $(A,B)$ of {\em order} $|A\cap B|\le a$ whose two sides $A\setminus B$ and $B\setminus A$ each contain at most $2|V(H)|/3$ vertices. Dvořák and Norin proved that $\tw(G)\le 15\sn(G)$ for every nonempty graph $G$. We improve the constant to its optimal value: every nonempty graph satisfies $\tw(G)\le 4\sn(G)-2$. This is best possible: for every $k\ge 2$, there is a graph $G_k$ with $\tw(G_k)=4k+2$ and $\sn(G_k)=k+1$.

fields
Combinatorics
pdf ↗ page arXiv:2611.20777 ↗

Sullivan recently constructed continuum many countable homogeneous $n$-hypertournaments for every $n\ge3$ by forbidding configurations he calls pair-cancelling. We show that, for every family $\mathcal F$ of pair-cancelling $n$-hypertournaments, the class of all linearly ordered finite $\mathcal F$-free $n$-hypertournaments is Ramsey and has the ordering property. In particular, freely ordered $\mathbf{H}_4$-free $3$-hypertournaments are Ramsey, answering a question of Cherlin, Hubička, Nešetřil, and the author from 2021. For every odd $n\ge3$, we give a simple Ramsey expansion with the expansion property for even $n$-hypertournaments by naming an $(n-1)$-hypertournament and a free linear order. We also show that, for $n\ge6$, no unbounded hereditary strong amalgamation class of finite $n$-hypertournaments has EPPA. Moreover, we prove the failure of EPPA for all Sullivan's classes with $n\ge4$, and for the even $5$-hypertournaments. We conjecture that even hypertournaments and classes omitting a family of pair-cancelling hypertournaments, together with the homogeneous cyclic order in arity three, are the only countably infinite homogeneous $n$-hypertournaments for $n\ge3$. We give some supporting evidence.

fields
Combinatorics, Logic
pdf ↗ page arXiv:2611.20784 ↗

Shukla conjectured that the collapsibility number of the Vietoris-Rips complex $\mathrm{VR}(I_n;r)$ of the $n$-dimensional hypercube graph at scale $r$ equals $2^r$ for all $n\ge r+1$. We prove the conjecture for $n=r+2$ and every $r$, which gives the first known cases with $r\ge 4$ beyond the cross-polytope case $n=r+1$. Writing $\mathrm{VR}(I_n;r)$ as the independence complex of the graph $H_{n,r}$ that joins two points when their Hamming distance exceeds $r$, we construct a cover of $H_{r+2,r}$ by $2^r$ co-chordal subgraphs. The key general tool is the inequality that, for every graph $G$, the $θ$-number of Bıyıkoğlu and Civan of the independence complex of $G$, and hence the collapsibility number of that complex, is at most the co-chordal cover number of $G$; this strengthens Woodroofe's regularity bound. We also show, using a theorem of Alon, Jin, and Sudakov, that the induced matching number of $H_{n,r}$ equals $2^r$ for every $n>r$, and that $\mathrm{VR}(I_n;r)$ is vertex decomposable if and only if $r=1$ or $n=r+1$. As consequences, we determine the top degree of nonvanishing homology and the coconnectivity of $\mathrm{VR}(I_{r+2};r)$, and we prove split injectivity in top-degree integral homology. Finally, assuming a recent skew Hamming set-pair theorem of Gao and Zhao, we prove that the collapsibility number of $\mathrm{VR}(I_n;r)$ is at most $2^{r+1}-4$ for all $n>r\ge 2$.

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

A numerical semigroup is a subset of the non-negative integers that contains $0$, is closed under addition and has finite complement. A threshold graph is built by adding vertices one at a time, each new vertex being isolated or dominating, and the record of these choices is its \emph{creation sequence}. Reading the creation sequence as a lattice path gives an integer partition and, through the Keith–Nath correspondence, a numerical set in which the dominating vertices are the elements and the isolated vertices are the gaps. We show that threshold graphs with an isolated vertex correspond bijectively to numerical sets, and we study numerical semigroups through their creation sequences. We prove that in the creation sequence of a numerical semigroup of multiplicity $m$ every block of ones and every non-initial block of zeros has length less than $m$, we give criteria for partitions with a unique smallest part and with two distinct part sizes, and we classify all partitions with at most four parts. We show that every partition $λ$ with $g$ parts corresponding to a numerical semigroup satisfies $\ell(λ)\geλ_1$ and, more strongly, fits inside the staircase $(g,g-1,\dots,1)$; equivalently, its creation sequence begins with a Dyck path. Its size equals the genus plus the Weierstrass weight of the semigroup, and asymptotically at most half of all partitions correspond to numerical semigroups. Finally, we obtain exact formulas for the numbers of partitions of $n$ corresponding to numerical semigroups of genus $g$, multiplicity $m$ and Frobenius number $f$, valid in the sharp ranges $g\ge n/2$, $m>n/3$ and $f\ge n-\frac{n-1}{4}$. These formulas solve the open problems posed by Burson, Nam and Sisneros-Thiry \cite{BNS}, recover all of their counting theorems, and correct several of their statements.

fields
Combinatorics
pdf ↗ page arXiv:2611.20832 ↗

Perfect matchings are fundamental to understanding structural connectivity in cubic graphs, with "lonely edges" (edges in exactly one perfect matching) forming a critical underexplored class. Goedgebeur et al. (J. Graph Theory, 112 (2026) 276-289) established an upper bound of 6 on the number of lonely edges in 3-connected non-double covered cubic graphs and completely characterized the classes $\mathcal{U}_k$ for $3 \le k \le 6$. Narayana et al. subsequently gave a recursive characterization of the subclass in which the two lonely edges lie in the same perfect matching. This paper completes the classification by presenting a full structural characterization of $\mathcal{U}_2$, the family of 3-connected cubic graphs with exactly two lonely edges. We identify the minimally non-contractible "primitive kernels" of $\mathcal{U}_2$ and develop constructive operations to generate any graph in $\mathcal{U}_2$ from these kernels.

fields
Combinatorics
pdf ↗ page arXiv:2611.20843 ↗

We introduce Eckmann-Hilton operators on bands, which allow for a suite of matroidal constructions, in particular, matroid unions and matroid stable intersections. This enables the construction of general linear monoids over bands. Geometrically, we show that matroid stable intersection extends the transverse intersection of linear spaces over fields and the stable intersection of tropical linear spaces, lending new insight into intersection theory on bands.

comments
13 pages. Extended abstract submitted to FPSAC 2027
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2611.20923 ↗

A circular-arc graph takes a set of nonempty closed arcs on a circle as its vertex set, and two vertices are adjacent when their corresponding arcs intersect on the circle. We show the chromatic number of any circular-arc graph equals its list chromatic number. Our methodology is an application of Schauz's coefficient formula within the Alon-Tarsi and Combinatorial Nullstellensatz framework.

comments
5 pages, 0 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.20947 ↗

We prove that, if $X$ is a four-element independent set in a vertically $5$-connected representable matroid $M$, then either there is a circuit of $M$ that contains at least three elements of $X$, or there is a representation $A$ of $M$ such that each column of $A$ has at most two non-zero elements and each of the columns indexed by $X$ has exactly one non-zero element. We also prove a version of this result without the connectivity assumptions.

comments
By people, for people
fields
Combinatorics
pdf ↗ page arXiv:2611.20960 ↗

We use prime ideal factorization and residue class fields of cyclotomic integer rings to prove that every abelian direct product difference set is classical. This implies that every projective plane of order $n$ with an abelian collineation group of order $n(n-1)$ is Desarguesian, proving a conjecture of Jungnickel and de Resmini. As a consequence, we obtain the classification of circular Costas maps and of Costas polynomials conjectured by Muratovic-Ribic, Pott, Thomson and Wang and by Torres and Rubio.

fields
Combinatorics
pdf ↗ page arXiv:2611.20974 ↗

Given a real-valued submodular function on a finite ground set, the minimum $k$-partition problem asks for a partition into $k$ nonempty parts minimizing the sum of their function values. We give a polynomial-time algorithm for $k=5$. The idea follows directly from the previous $k=4$ result, where there is precisely one obstruction for generalizing it to $k=5$. We show the special case can be handled by reasoning about a restricted family of $3$-partitions.

comments
11 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.21187 ↗

With computer-assisted proofs that $\mathbb{C}^6$ admits at most three mutually unbiased bases (MUBs) now available, $\mathbb{C}^{10}$ is the smallest dimension in which it is unknown whether a complete set of $d+1=11$ MUBs exists; only three MUBs are known. We prove that every triple of mutually unbiased product bases of $\mathbb{C}^2\otimes\mathbb{C}^5$ is strongly unextendible: no vector is unbiased to all three bases. Consequently no set of four MUBs in dimension ten, and in particular no complete set, contains three product bases. This settles the case $d=2\times5$ anticipated by McNulty, Pammer and Weigert; it was known only for the Heisenberg-Weyl triple. The proof covers all ten equivalence classes with explicit Nullstellensatz certificates modulo one prime on $91$ charts of $\mathbb{P}^9\times\mathbb{P}^9$ for each class ($910$ in all), transferred to characteristic zero by a projective reduction lemma, together with an independent rank certificate for eight of the ten classes. We also prove that the pair formed by the standard and the Fourier basis of $\mathbb{C}^{10}$ is contained in no set of four MUBs. Exactly $3040$ rays are unbiased to both bases (this confirms the count found numerically by Führ and Rzeszotnik), each of them is unbiased to at most eight of the others, and every triple formed by the pair and a third MUB is strongly unextendible. For this we certify $34,940$ cyclic $10$-roots in Krawczyk uniqueness boxes, decide unimodularity exactly through an involution, and prove completeness by a four-dimensional interval branch-and-bound obtained from the Chinese-remainder splitting $\mathbb{Z}_{10}=\mathbb{Z}_2\times\mathbb{Z}_5$.

fields
Combinatorics
pdf ↗ page arXiv:2611.21188 ↗

We investigate symmetric chemical reaction networks and their steady states. From classical equivariant dynamical systems and network theory it is known that the mass- action ODE of any symmetric chemical reaction network is equivariant. For symmetries that permute the species, we prove that any equivariant mass-action ODE is realized by a symmetric chemical reaction network and construct a sparsest such realization. We apply the half-degree principle to show that a symmetric CRN that has a steady state also has one with few distinct coordinates.

fields
Combinatorics, Algebraic Geometry, Group Theory
pdf ↗ page arXiv:2611.21191 ↗

A vertex is uni-dominated by a set $S \subseteq V(G)$ if exactly one vertex of $S$ lies in its closed neighborhood, and the uni-domination number $\mathrm{ud}^*(G)$ is the largest number of vertices a single set can uni-dominate. The graphs admitting an efficient dominating set are those with $\mathrm{ud}^*(G) = n$. Hedetniemi and Rall asked for the largest constant $c$ with $\mathrm{ud}^*(T) \geq c \cdot n$ for every tree $T$ of order $n$. We answer their question: the constant is $4/5$, and a set attaining it can be computed in linear time. This set is moreover a dominating set. Recall that an efficient dominating set satisfies two requirements at once: it dominates every vertex, and it dominates no vertex twice. Our set satisfies the first one, which leads us to study $\mathrm{ud}^*$ under each of the two requirements separately, giving the Full-Cover variant $\mathrm{ud}^*_0$ and the Non-Overlapping variant $\mathrm{ud}^*_+$. The two behave very differently: on arbitrarily large graphs $\mathrm{ud}^*_0$ may remain bounded by a constant, whereas $\mathrm{ud}^*_+$ always grows with the order. We present bounds for both, and show that the associated decision problems are polynomial for constant thresholds and NP-complete for the thresholds $\lceil \sqrt[c]{n} \rceil$ and $4\sqrt{n}$, respectively, the latter even on split graphs. Finally, we show that neither of the two parameters bounds the other.

comments
23 pages, 5 figures. Appears in the Proceedings of the 52nd International Conference on Current Trends in Theory and Practice of Computer Science (Sofsem 2027)
fields
Combinatorics
pdf ↗ page arXiv:2611.21210 ↗

We give a polynomial-time algorithm for finding a maximum weight independent set in a graph embedded in a surface of bounded genus and with a bounded number of vertex-disjoint odd faces. In particular, we obtain an algorithm for graphs with an even-faced embedding in a torus and for planar graphs with a bounded number of odd faces, answering a question of Thomassé (2018) and a question of Choi, Gorsky, Kim, McFarland, and Wiederrecht (2025) respectively. We reduce the original problem to finding a minimum cost non-negative integer circulation with homology constraints in the dual of a certain double cover of the original graph.

comments
25 pages, 5 figures
fields
Combinatorics, Optimization and Control
pdf ↗ page arXiv:2611.21256 ↗

The staircase simplices $\{x\in[0,1]^d:x_{σ(1)}\le\cdots\le x_{σ(d)}\}$, $σ\in S_d\,$, are the $d!$ unimodular cells of the staircase triangulation of the unit cube. The disjunctive hull (Cayley polytope) of a selection $P_0, \ldots, P_n$ of them has the integer decomposition property (IDP) if, for all integers $λ_i\ge0$, every lattice point of $\sum_iλ_i P_i$ is a sum of vertices, $λ_i$ of them from $P_i$. For two simplices, IDP always holds. For three, every nontrivial finite abelian group $G$ arises, in the optimal dimension $Θ(\log|G|)$, as the residue group of a simplex facet whose $|G|-1$ nonzero box points are Hilbert basis elements of the whole cone; $k$ times such a point is a sum of vertices exactly when its order in $G$ divides $k$. Isolating this arithmetic is costly: if a simplex face has a single Hilbert basis element $h$ that is not a vertex, then $kh$ is a sum of vertices exactly when some $q$ divides $k$, and $d\ge3q-2$, attained for every $q\ge3$; we also find the least dimension for each $G$ with the fewest such elements. Without isolation, every nonzero submonoid of $\mathbb{Z}_{\ge0}$ omitting $1$ is $\{k\ge0:kh$ is a sum of vertices$\}$ for a Hilbert basis element $h$ of degree three. For every $0/1$ polytope with $N$ vertices in $\mathbb{R}^r$, three staircase simplices in dimension $O(N(r+1))$ have a face that has IDP exactly when the polytope does. Deciding whether a lattice point $h$ is a sum of vertices is strongly NP-complete, even given vertex expressions of $2h$ and $3h$, and recognizing IDP of a designated facet is coNP-complete; for the whole hull, IDP can first fail in degree linear in $d$, and it holds whenever $d\le5$. For a family of triples defined by words over three letters, we determine the entire Hilbert basis and characterize IDP by two forbidden subsequences.

fields
Combinatorics, Optimization and Control
pdf ↗ page arXiv:2611.21345 ↗

For a graph \(G\) with adjacency and degree matrices \(A(G)\) and \(D(G)\), set \(A_α(G)=αD(G)+(1-α)A(G)\) for \(0\leqα<1\). Using Chebyshev polynomials and a theorem of Conway and Jones, we classify the \(A_α\)-Wronskian vertices of every path \(P_n\), \(n\geq2\) (equivalently, the standard basis vectors cyclic for \(A_α(P_n)\)). The central vertex of an odd-order path is never Wronskian; for every other vertex, we determine an explicit finite set of algebraic exceptional parameters. These sets contain no rational parameters other than \(0\) and \(1/2\), for which the adjacency and signless Laplacian cases are characterized by gcd criteria. For even-order paths rooted at either central vertex, we explicitly evaluate the root resultant and the walk-determinant polynomial in the rooted-product factorization. The resulting controllability criterion combines \(A_α\)-controllability of the base graph with at most three explicit spectral exclusions. For each parameter, one of two fixed complementary base graphs yields controllable products for every even-order path and both central roots. For \(1/2\leqα<1\), algebraic conjugates further simplify the spectral test for general rooted products.

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

A graph $G$ is $k$-quasiplanar if it can be drawn in the plane without $k$ pairwise crossing edges. It was a longstanding conjecture that $n$-vertex $k$-quasiplanar graphs have $O_k(n)$ edges. This was recently resolved by Sadhu and, independently, by Pach, Tardos, and Zeng, based on a theorem in topology proven by Beeker and Lazarovich. These papers showed that $k$-quasiplanar graphs have at most $k^{O(k)}n$ edges. In this note, we greatly improve the dependence on $k$ and show that every $k$-quasiplanar $n$-vertex graph has at most $O(k^2n)$ edges. The proof is based on a geometric charging scheme and Erdős-Szekeres type combinatorial arguments.

comments
11 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.21416 ↗

We enumerate the parameter matrices of all perfect 3-colorings of the generalized Petersen graphs GP(n,2), n >= 5. We show that there are only five matrices that can be the parameter matrix of such a coloring. Two of them occur if and only if 5 | n, two occur if and only if 3 | n, and the remaining one occurs if and only if 10 | n.

fields
Combinatorics
pdf ↗ page arXiv:2611.21435 ↗

We count nilpotent matrices in the incidence algebra of a finite poset over a finite field that belong to a prescribed conjugacy class for the adjoint action of the general linear group. We prove that these counts depend only on the comparability graph of the poset. We introduce shuffle-prefix posets, a class containing all finite interval orders, and give explicit formulas for their nilpotent Jordan counts. These counts are polynomials with integer coefficients in the field size, valid over every finite field. Finally, Fourier duality relates conjugacy-class counts in a coordinate subspace to those in the subspace supported on the complementary matrix positions, whenever one subspace consists entirely of nilpotent matrices.

comments
11 pages, 2 figures, 1 table. Extended abstract
fields
Combinatorics, Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2611.21451 ↗

We show that the Harary–Hill bound on the crossing number of complete graphs as well as the Zarankiewwicz bound on the crossing number of complete bipartite graphs, both recently established by OpenAI, also hold for the independent odd crossing number. This implies that the same bounds hold for several other crossing number variants such as the (independent) algebraic crossing number and the (independent) pair crossing number.

fields
Combinatorics
pdf ↗ page arXiv:2611.21516 ↗

Let $G_n$ be a random weighted complete graph on $n$ vertices, where edges have i.i.d. $\text{Unif}(0,1)$ weights. Let $T_n$ be the Minimum Spanning Tree (MST) of $G_n$. The expected weight of $T_n$ is known to converge to $ζ(3) = \sum_{k=1}^{\infty} \frac{1}{k^3}$ (Frieze 1985). We investigate the sum of weights of edges incident to the leaves of $T_n$, denoting this quantity by $L_n$. We give tight upper and lower bounds on $\mathbb{E}[L_n]$ and determine its limit as $n$ diverges, leveraging typical behavior of sparse Erdős–Rényi random graphs. We also establish concentration of $L_n$ around $\mathbb{E}[L_n]$ and almost sure convergence to this value. These results directly yield substantial improvements to state-of-the-art bounds for two important variants of the MST problem: (1) an improved upper bound on the weight of the optimal random instance Steiner tree, as studied by Bollobás, Gamarnik, Riordan, and Sudakov (2004); and (2) an improvement over the upper bound for the Probabilistic Minimum Spanning Tree, introduced by Bertsimas (1988).

fields
Combinatorics
pdf ↗ page arXiv:2611.21540 ↗

The Cartesian product of Cayley graphs is again a Cayley graph. For connected graphs, the converse question reduces to Cartesian powers of Cartesian-prime graphs, and consequently to the study of regular subgroups of wreath products in the product action. We prove that, for a transitive permutation group $G$ of degree $2p$ or $4p$, where $p$ is prime, $G\wr S_2$ contains a regular subgroup if and only if $G$ does, and construct counterexamples of degree $8p$ for every prime $p\equiv3\pmod4$. By modifying this construction, we obtain an infinite family of connected non-Cayley graphs whose Cartesian squares are Cayley graphs, giving a negative answer to the converse question. The smallest graph in our family has $120$ vertices and valency $27$. In contrast, we prove that a connected vertex-transitive graph of order $pq$, where $p$ and $q$ are primes, has a Cayley Cartesian power if and only if the graph itself is Cayley.

comments
20 pages
fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2611.21555 ↗

There is peak state transfer between vertices $u$ and $v$ in a graph $G$ if there exists a time $t$ for which $|(\mathrm{e}^{\mathrm i t M})_{u,v}|$ saturates the triangle inequality imposed by its spectral decomposition and $M$ is either the adjacency or Laplacian matrix. We show that peak state transfer at distance $d$ requires $\frac{d^3}{24}(1 + o(1))$ edges in the adjacency case, $Ω(d^2)$ edges in the Laplacian case, and that the leading coefficient in the former is tight. We find a family of graphs with Laplacian peak state transfer at distance $d$ and $Θ(d^5)$ edges, showing that peak state transfer is achievable in a polynomial graph size. In contrast, Laplacian perfect state transfer costs at least $Ω(2^{d/2})$ edges when the distance partition of vertices around one vertex is almost equitable. Finally, we show that Laplacian peak state transfer in trees requires $Ω(d!)$ edges, and we characterize all trees of diameter $\leq 4$ admitting Laplacian peak state transfer, thus answering a pair of questions posed by Coutinho, Guo, and Schmeits.

comments
23 pages, 0 figures
fields
Combinatorics, Mathematical Physics
pdf ↗ page arXiv:2611.21567 ↗

Optimization and Control78

A dual-mode extremum-seeking controller is developed for unknown nonlinear systems with affine control inputs driven by persistent Brownian process noise. The controller uses a single measured cost, without state estimation or differentiation of the measurement. Bounded cosine feedback generates, through Lie-bracket averaging, a proportional–integral (PI) action: the proportional action stabilizes a feasible minimum of the cost on the time scale of the plant, and the integral action adapts a bias toward the unknown input that regulates the plant at that minimum. The averaged closed loop is a PI-regulated diffusion that retains the process noise, and its stability condition does not require knowledge of the control direction. Under a regional Lyapunov condition on the averaged dynamics, an exact periodic response of the noise-free closed loop is constructed and serves as the center of a Lyapunov function with bounds uniform in the excitation frequency. Exit-probability estimates show that, for small noise and large excitation frequency, trajectories reach a prescribed neighborhood of the optimum and remain there for times exponential in the inverse noise variance, with exponentially small failure probability. Under an additional stochastic contraction condition, the closed loop is approximated uniformly in time, in mean square before common exit, by its averaged diffusion driven by the same Brownian motion, with an error that decreases with the excitation frequency. The regional regulation conditions are verified for a planar hydrodynamic trap with an unknown stagnation-point offset and actuator sign. Simulations illustrate intensity-only confinement of a Brownian particle, integral compensation of the holding input, and axial-strip exit statistics.

fields
Optimization and Control
pdf ↗ page arXiv:2611.18923 ↗

The efficient sets associated with different decision-makers may have an empty intersection, even when their objectives are linear and the common feasible region is a compact polytope. In this paper, we consider a compromise criterion that minimizes the largest weighted distance from a feasible decision to the respective efficient sets of the decision-makers. First, we establish the existence of an optimal compromise and show that the formulation recovers the common efficient set whenever it is nonempty. We then derive a lower bound based on the separation of efficient sets and obtain an exact formulation in terms of finitely many linear programs by exploiting their polyhedral structure. Next, we examine the effect of approximating the efficient sets and establish a stability bound expressed in terms of the Hausdorff distance. Finally, we illustrate the applicability of the proposed approach through a numerical study of harvest allocation between two interconnected fishing zones.

fields
Optimization and Control
pdf ↗ page arXiv:2611.18932 ↗

Grid-scale batteries couple decisions across time. This makes unit commitment (UC) with thousands of buses, batteries, generators, and alternating current constraints intractable. We introduce a time-space decomposition (TSD) heuristic to solve the problem. We first calculate target net battery charge or discharge rates on a zonal level, relaxing spatial constraints. We then incorporate this target into the Relax-and-Round UC (RRUC) solver from our previous work. RRUC enforces the spatial transmission constraints and transfers power between zones, if that reduces costs. We show that our TSD produces an error of about 0.1% on a simpler economic dispatch problem with batteries. This is larger than the error produced by RRUC in the tests in our previous work. So, we conjecture that the combined error of our two approximations is not much larger than 0.1%. We show that TSD with RRUC can solve systems with 10,000 buses in about 6 minutes, with sub-quadratic scaling, making it suitable for real time operations on an ISO-sized system.

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

This paper studies the shared-feedback design problem for finite-horizon averaged-cost control under model uncertainty represented by a joint law over the model parameter and initial state. One feedback map is shared across all realizations and uses only time and the current state as online inputs. We develop two methods: the nonlinear adjoint method combines forward closed-loop solves, backward adjoints, and joint-law policy gradients, while the linear moment method gives exact cost and gradient formulas for a homogeneous linear-quadratic design model by propagating conditional second moments. Numerical studies compare averaged and nominal designs for time-dependent neural feedback and static linear feedback in nonlinear Van der Pol and Stuart-Landau systems; the static gains are designed from oscillator linearizations and evaluated on the original nonlinear systems. Averaged design has lower cost in most comparisons.

comments
26 pages, 6 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.19019 ↗

In this paper, we propose a distance-certified safety control framework for unknown and dynamic environments. The proposed strategy relies on a spatio-temporal composition of Gaussian Process (GP) barriers from environment point clouds. A point-cloud-dependent covariance kernel is constructed to smoothly combine individual GP representations, yielding a continuously differentiable posterior mean and a diagonal observation Gram matrix that avoids dense covariance inversions. We then derive a closed-form calibration of the GP length scale accounting for spatial approximation errors and finite point-cloud coverage, guaranteeing a prescribed minimum distance from the true obstacle boundary. To handle moving obstacles and updated observations, the scan-based barriers are certified over finite validity horizons and smoothly combined into a time-varying Control Barrier Function (CBF). Under problem feasibility conditions, the associated CBF-based safety control guarantees forward invariance of the certified safe set, thereby ensuring the prescribed distance from the obstacles. Unicycle simulations with static and moving obstacles illustrate the effectiveness of the proposed approach.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19025 ↗

Motivated by static models of group default in microlending, we study a dynamic problem in which the members of a lending group are exposed to external shocks, such as droughts or floods, and the manager of a common emergency fund decides at each shock how much capital to inject into the members who were hit. Shocks arrive at random times, the set of members that a shock hits may depend on which members the previous shock hit, and the losses may spill over to members who were not hit directly. Between shocks, the members' wealth follows a linear stochastic differential equation in which members support each other, and the fund grows with interest and member contributions up to a cap. The cost balances the members' shortfall below a poverty line, a welfare measure that contains a standard poverty measure as a special case, against the administrative cost of the injections and the benefit of keeping money in the fund. We formulate the problem as a Markov decision process embedded at the shock times and prove that the embedded process is Markov with a weakly continuous transition kernel. When the discount rate exceeds a growth rate determined by the wealth dynamics, we show that the expected total cost is finite under every policy, that the finite-horizon optimal values converge to the infinite-horizon one at an explicit rate, and that there exists a stationary optimal injection policy, which can be chosen independent of calendar time.

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

Real-time train platforming under disruptions requires rapid revision of routing, platforming, and timing decisions. Dense traffic and shared infrastructure create tightly coupled conflicts, making real-time optimization computationally demanding. This paper proposes a learning-enhanced Reduce-Repair-Refine-Optimize framework that reduces and selectively relaxes the routing search space to balance computational efficiency, feasibility, and solution quality. The reduction stage constructs a restricted MILP by fixing selected routing decisions using route-specific predictive models and thresholds, thereby accounting for heterogeneity across routes. Two adaptive mechanisms subsequently modify the reduced search space: repair selectively releases route fixings to restore feasibility, while refinement releases additional fixings to recover routing alternatives and improve solution quality without reverting to the unrestricted problem. Computational experiments on real-life disrupted station-area instances show that the framework matches or improves upon a recent rTPP heuristic in more than 80% of instances within 60~s. Under the common 180~s budget, the framework obtains strictly better terminal incumbents than the unrestricted MILP in 56.7% of all instances and 77.4% of hard instances. Moreover, it obtains better terminal incumbents than an otherwise identical variant without refinement in 71.9% of hard instances. The results demonstrate that learning-based search-space reduction is most effective when the reduced search space remains adaptable during optimization, enabling high-quality feasible solutions within the real-time computation budget.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19041 ↗

The inverse protein folding problem, designing a discrete amino acid sequence that spontaneously folds into a predefined macroscopic structure, remains a phenomenally demanding combinatorial challenge central to synthetic drug discovery. While algorithms like SA offer a baseline approach for navigating dense biomolecular energy landscapes, applying SA heuristics to large sequences is inherently frustrated by exponentially large search spaces and deep local energy minima. This study proposes a scalable sequence design architecture, Topological Spatial Chunking Simulated Annealing, based on a localized, exact-solving heuristic embedded within a global simulated-annealing wrapper. To fundamentally circumvent exponential scaling walls, we deploy a dynamic solver that segments the global molecular target into shallow, k-variable algorithmic windows. Crucially, rather than partitioning natively by sequential 1D chronology, we introduce topological spatial chunking, which dynamically groups discrete variables based on Euclidean spatial proximity to preserve critical non-local thermodynamic correlations. The spatially localized sub-problems are solved deterministically via exact enumeration, while the global traversal is securely regulated by an exterior simulated annealing governor augmented by dynamic reheating and continuous elitism caching. We comprehensively benchmarked this classical architecture on the standard HP biophysical lattice against targeted 20-merA, 25-mer, 50-mer, and 64-mer geometries. Most notably, when evaluating the computationally exhaustive 50-mer and 64-mer topologies, the framework successfully bypassed widely accepted heuristic boundaries. By leveraging deterministic exact solving to vault classical energy traps, the system algorithmically resolved a novel, ultra-dense sequence-packing configuration for the 50-mer, defining a new theoretical global optimum.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19158 ↗

We consider stochastic token steering through a deep stack of transformer layers as a mean-field control problem for an interacting particle system on the unit sphere, where interactions arise from the attention mechanism. In the mean-field limit, the token population evolves via a controlled integro-partial differential equation where the feedback control acts as a corrective vector field guiding the population toward an aggregate configuration of tokens in the representation space. We deduce the minimum effort control to accomplish this task over a fixed time horizon interpreted as normalized layer depth. We show that the resulting controlled dynamics for the token population can be understood as a mean-field Schrödinger bridge adapted to the sphere geometry. Building on this, we propose a novel generalization of the dynamic Sinkhorn recursion to compute the consistent token evolution. Numerical experiments confirm that the proposed approach achieves exact steering of the token population.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19163 ↗

We introduce a novel decision-diagram-based framework for generating intersection cuts to strengthen polyhedral relaxations of bounded mixed-integer nonlinear programs (MINLPs) with general nonlinear constraints. Building on decision diagrams (DDs) that provide outer approximations of MINLP feasible regions, we propose the concept of DD-free sets, which are convex regions whose interiors do not intersect the sets represented by the DDs. By exploiting the underlying graphical structure, we develop efficient methods for constructing these regions without requiring restrictive assumptions on the functional form of nonlinear constraints or access to distance oracles. We investigate the maximality properties of DD-free sets and devise algorithms for obtaining maximal forbidden regions within several structured classes. The resulting intersection cuts exploit geometric information retained in DD representations, enabling further strengthening of relaxations beyond what can be achieved through conventional DD-based convexification. We also introduce interval DDs to facilitate the representation of general nonlinear constraints and establish convergence results for intersections of constraint-specific DDs, providing a theoretical foundation for their integration into global optimization frameworks. Computational experiments on challenging open instances from MINLPLib, encompassing a broad range of nonlinear and nonconvex structures, demonstrate that the proposed approach can substantially improve dual bounds and achieve greater optimality-gap closure than state-of-the-art global optimization solvers. These findings highlight the potential of exploiting graphical representations of infeasible regions to develop stronger cutting planes for general MINLPs.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19197 ↗

We first establish several properties of integer positive semidefinite matrices, extending known results for binary and ternary positive semidefinite matrices. We then show how to reformulate an integer quadratic program (IQP) as an equivalent integer semidefinite program (ISDP). We distinguish three cases, namely IQPs with two, three, or more than three distinct integer values, and provide several ISDPs for each case. Each reformulation yields either a binary ISDP, a ternary ISDP, or a rescaled version of one of these. The results show that ternary SDP formulations for problems with three distinct integer values provide SDP relaxations with fewer constraints and, in the case of equally spaced integers, also smaller matrix variables than binary-based SDP relaxations. For quadratic problems whose variables can take more than three distinct integer values, one can choose among three formulations based on the size of their matrix variables, the number of constraints, and the strength of the resulting SDP relaxations. We also show how to reformulate a mixed-integer QP as a mixed-integer SDP.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19255 ↗

We consider a discrete-time linear system in which each actuator is assigned to one time slot. A graph $H$ records which pairs of actuators cannot share a slot. We seek to remove conflicts by exchanging actuators between slots, while preserving all tail reachability spaces. These spaces describe the terminal corrections available from each time slot onward. We give a sufficient condition based on the number of exchanges that preserve the required bases. The condition guarantees repair from every compatible starting schedule. Two bounds for checking it use failed basis tests and dependent column selections. Each accepted exchange reduces the conflict count, so the procedure uses at most as many exchanges as there are initial conflicts. An explicit family with unequal rank increments admits repair when $3N>4Δ(H)+4$, where $Δ(H)$ is the largest number of forbidden partners of any actuator. We also give a family of two-slot examples with only one forbidden partner per actuator and two initial conflicts. The basis constraints force every strict improvement to move arbitrarily many actuators, although one exchange suffices without those constraints. A second example has a connected conflict graph and one initial conflict.

comments
14 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.19291 ↗

Co-design is the problem of jointly optimizing the design of a system and the policy that operates it. Neither can be chosen independently: a system design is only as good as the policy trained for it, and the optimal policy changes with the design. When that policy is learned by reinforcement learning (RL), evaluating a candidate design requires a full policy training run, and the design is usually optimized by black-box search such as Bayesian optimization (BO) or evolution strategies (ES). These methods scale poorly with the design dimension and ignore the differentiable structure of modern simulators and, in particular, the sensitivity of the optimal policy with respect to the design. We instead derive a gradient-based co-design method, where the design gradient decomposes into a direct effect of changing the design at a fixed policy and an indirect effect through the design-dependent optimal policy. The indirect effect requires the sensitivity of the converged policy to the design, which we obtain by applying the implicit function theorem to the stationarity condition of the policy gradient. Based on this sensitivity, we develop a proof-of-concept co-design algorithm with stochastic value gradient (SVG)-style policy optimization, prove that it converges to an approximately stationary design, and demonstrate on a differentiable networked-system benchmark with high-dimensional design spaces that it consistently outperforms BO and ES.

comments
31 pages, 5 figures, 3 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.19329 ↗

Often the output of a learned mapping must satisfy prescribed constraints. In the control of autonomous systems, for example, the chosen action must keep the system within a collision-free region. We consider the case in which a proposed output is corrected by projection onto a safety ellipsoid. Computing this projection amounts to solving a quadratically constrained quadratic program (QCQP). We construct a neural-network safety layer by unrolling a feasibility-preserving polynomial penalty iteration. The unrolled structure allows the loss gradient to propagate from the feasible output through the safety layer to the network parameters during training. We show how to choose the layer parameters so that every iterate is feasible and give a computable bound on its distance to the exact projection at any prescribed depth. We illustrate the method by training a LiDAR-based policy to control an unmanned aerial vehicle. A privileged model predictive control expert uses the map and the measured vehicle state to generate the training data. In the simulated narrow mazes, the filtered policy avoided wall contact at every tested stage of training, including at initialization, when every unfiltered flight hit a wall. A representative build of the learned policy and its safety layer for an Arm Cortex-M4F microcontroller occupies about 36 KiB of flash, with a RAM budget below 5 KiB.

comments
13 pages, 6 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.19366 ↗

Under in-plane Hill$\unicode{x2013}$Clohessy$\unicode{x2013}$Wiltshire dynamics with independently bounded radial and along-track thrust, we prove that every target reachable within one orbit has a fixed-time minimum-fuel control with at most ten switches. We first show that regular optima have at most four radial and six along-track switches, coupled through a shared costate. Of the 35 candidate count pairs, 11 require minimum durations, one cannot be optimal, and 23 are attainable at arbitrarily short durations. We then convert singular-arc optima into bang/off optima with at most five switches by preserving terminal moments. We demonstrate terminal accuracy and whole-arc Pontryagin consistency through 55,296 numerical transfers.

comments
17 pages, 5 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.19406 ↗

We extend the optimal control formulation of sample path large deviation theory, which has proven effective for numerical computation of instantons and sharp probability estimates in stochastic differential equations with Gaussian noise, to systems with light-tailed Lévy noise. In the scaling limit of small jumps and high intensity, such systems satisfy a large deviation principle of Freidlin-Wentzell type, with a running cost given by the Legendre transform of the noise cumulant generating function. We propose to numerically minimize this cost over noise realizations subject to the system dynamics, which yields the instanton without having to solve Hamilton's equations, and naturally handles degenerate and multiplicative noise. When the cumulant generating function has a bounded domain, the cost grows only linearly for large noise, and instantons can contain jumps. We analyze when jumps are not only admissible but optimal, depending on the subleading behavior of the cost and on the drift, and show how jumps can be resolved numerically through a time reparameterization that freezes physical time. For continuous instantons, we derive Riccati and Fredholm determinant expressions for the leading-order prefactor, and we discuss the modifications needed when the instanton jumps. We illustrate and validate our methods against Monte Carlo simulations in several examples: a two-dimensional nonlinear model, an active run-and-tumble particle with non-Gaussian tumbling noise, and the Ghil-Sellers energy balance climate model with Lévy-perturbed solar forcing.

comments
24 pages, 10 figures
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2611.19481 ↗

Treating traffic counts as data calls for the joint distribution of link flows. Stochastic user equilibrium (SUE) gives a single flow vector, and independent route choice at fixed probabilities ignores congestion feedback between travelers. Conditional stochastic user equilibrium (CSUE), in which each traveler of a finite population chooses a route by logit conditional on the routes of all others, contains this feedback but has been hard to compute with at scale. Under separable link costs and a common route-choice precision, the CSUE conditionals are those of a unique Gibbs distribution whose energy is a left-endpoint discrete congestion potential, and for continuous nondecreasing costs the law concentrates on deterministic logit SUE in the large-population limit. When the routes of each origin are the paths of an acyclic bush, retaining origin- or OD-level labels gives an unnormalized layered link-flow law with an explicit product-form multiplicity. On this representation we build a block Metropolis-Hastings sampler whose proposal is an integer version of Dial's loading under frozen costs. It leaves the CSUE law on the bush route sets invariant without enumerating paths or storing individual routes, and at stationarity the mean rejection rate of a block lies between one and two times the total variation distance between its proposal and exact conditional. In experiments, the sampler reproduces reference laws from exact enumeration and traveler-level Gibbs sampling, whereas independent route choice at frozen costs reproduces mean flows but overstates link-flow standard deviations by up to 48% and distorts correlations. On Sioux Falls, the block sampler attains 76.1 times the minimum effective sample size per CPU second of traveler-level Gibbs sampling, and on Chicago Sketch, with over one million travelers, its sampled covariance is used to assess traffic-count locations.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19565 ↗

We study nonsmooth convex and strongly convex optimization problems using only noisy pairwise comparisons: each query specifies two points and returns a single binary response indicating which point has the smaller function value, subject to noise. We distinguish two observation models: Stochastic Order Oracles, which compare two evaluations of the same random loss, and Preference Oracles, whose conditional response mean is a transfer function of the objective difference. For Stochastic Order Oracles, we prove that no comparison-based algorithm can guarantee vanishing expected suboptimality in general, even when sample losses are convex and Lipschitz and the mean objective is strongly convex. Under a normalized probit calibration, we recover convergence and establish matching upper and lower rates for convex and strongly convex objectives. For Preference Oracles with a linear response model, the binary response $O \in \{\pm1\}$ satisfies $\E[O\mid y,z]=λ(f(y)-f(z))$, with $λ>0$. In dimension $d$, we obtain an upper bound of $\widetilde (d^{3/2}/(λ\sqrt N))$ and establish, to our knowledge, the first minimax lower bound of $Ω(d/(λ\sqrt N))$, matching the optimal budget $N$ exponent, for both convex and strongly convex nonsmooth objectives. Beyond exact linearity, we analyze a simple projected comparison method for nonlinear transfer functions and establish convergence rates that depend on how accurately these functions can be approximated by a linear model near zero. Our analysis requires neither oddness nor twice differentiability of the transfer function.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19611 ↗

We analyze a finite-horizon time-to-collision map generated by an optimal-velocity prediction with bounded measurable leader acceleration and a feedback law that uses this map. The prediction describes nominal motion without the additional collision-avoidance feedback. Its first-contact geometry can produce discontinuities of the capped collision time at grazing, so smooth-feedback theory does not apply globally. For a prescribed leader–follower pair, we prove existence of Filippov solutions and exclusion of contact with negative relative velocity for every solution; a zero-speed touch is not excluded. Under explicit nondegeneracy hypotheses, trajectories cross the grazing set and uniqueness persists through the crossing. On the domain of transversal first contacts, the collision-time map is locally Lipschitz, continuously differentiable in the state, and differentiable in time outside a common null set. We quantify its sensitivity to the transversality margin and to jumps of the forcing. Characteristic and coarea arguments give boundary-plus-interior residual estimates for Hamilton–Jacobi approximations. An endpoint/age change of variables yields a stability coefficient controlled by flight time and terminal normal velocity, without inverse-transversality blowup. The estimates imply convergence conditional on vanishing continuum loss and pointwise identification under the stated trace and regularity assumptions. Numerical experiments on thirteen prescribed forcing profiles investigate boundary-error transport, sampling effects, and regularity predictions; a separate first-contact experiment numerically demonstrates post-threshold sensitivity sign changes. The guarantees concern the exact feedback and value-function approximation. Learned-feedback safety and convergence of a training algorithm remain open.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19679 ↗

We present COSMIC (Constrained Optimization via Sliding Mode for Inequality Constraints), a continuous-time solver for inequality-constrained optimization. COSMIC couples primal gradient-flow dynamics with multiplier dynamics derived from sliding mode control laws on a manifold defined by the smoothed Fischer-Burmeister function. We prove that COSMIC's trajectories reach this manifold in finite time from any primal initial point, after which the dynamics reduces to the gradient flow of a logarithmic barrier function. This yields a control-theoretic interpretation of barrier methods while allowing infeasible initialization. For strongly convex problems, we further establish exponential convergence to the minimizer. To address the numerical stiffness that arises in discretization, we develop a modified discrete-time algorithm. We validate COSMIC across various machine learning applications, demonstrating its ability to solve optimization problems accurately while scaling effectively to high-dimensional settings.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19683 ↗

We develop a methodology for set-based state estimation from noisy input-output trajectories, without a predefined model structure for the unknown state dynamics or access to training state measurements. We derive a bound on the state set diameter that depends on the sensor map and leverage it as a surrogate to formulate a tractable linear program balancing state set tightness against output trajectory coverage. Combining this certificate with deterministic or probabilistically certified measurement noise sets and leveraging the results from scenario optimization with relaxation, we provide joint a posteriori probabilistic guarantees for state inclusion and state set diameter. Numerical simulations corroborate our developed theoretical guarantees.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19716 ↗

This paper studies sparse ridge regression in the low-rank, high-dimensional setting that often arises when data collection is expensive. By exploiting the low-rank structure, we develop approximation algorithms within a relax-and-sparsify framework: solve a convex relaxation and then sparsify its solution to satisfy the original sparsity constraint. Specifically, we establish a tight rank-dependent sparsity bound for the convex relaxation by decomposing its support into two parts. This decomposition in turn motivates two approximation strategies, parameter reduction and binary redistribution, each exploiting a different part. Experiments on synthetic and real datasets show that the binary redistribution algorithms outperform the benchmarks in most instances.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19738 ↗

Diffusion-based solvers have become a prominent approach to neural combinatorial optimization. At inference time, they assign each decision variable a prediction score. A greedy decoder ranks candidates by these scores and checks hard constraints to ensure feasibility. Top-ranked candidates should be both promising and jointly feasible, making prediction-constraint alignment critical. When this alignment is weak, greedy decoding skips constraint-violating candidates and falls back to lower-ranked alternatives, degrading solution quality. Existing test-time methods improve search, sampling, or decoding, but do not directly strengthen this alignment before decoding. We observe that trained denoisers already carry constraint-aligned structural signals. Building on this observation, we propose Perturbed Instance-Structure Guidance (PISG), a training-free method that amplifies these signals at test time. At each denoising step, PISG constructs a structure-degraded prediction and extrapolates the unperturbed prediction away from it. The resulting guided prediction improves candidate rankings before constrained decoding. Signal analysis shows that this guidance concentrates on constraint-critical variables rather than uniformly rescaling scores. Under greedy decoding and without downstream refinement, PISG improves all 16 TSP solver-scale pairs across DIFUSCO, T2T, FastT2T, and StruDiCO, and all four MIS-ER solvers, with MIS-ER solved-cost gains up to +4.8%. The gains persist on most large-scale settings after 2-opt, and a preliminary study extends PISG to a Transformer-based solver. These results identify prediction-constraint alignment as an effective test-time enhancement direction for diffusion-based combinatorial optimization. Code is available at https://github.com/Ming-321/PISG.

comments
Accepted at NeurIPS 2026 (poster). 32 pages. Code: https://github.com/Ming-321/PISG
fields
Optimization and Control
pdf ↗ page arXiv:2611.19768 ↗

In this paper, we consider nonsmooth convex optimization under a H{ö}lder growth condition, with quadratic growth and weak sharp minima as two important special cases. Existing subgradient methods often employ predetermined decaying stepsize schedules, whereas the classical Polyak stepsize selects its stepsize adaptively but requires knowledge of the optimal value. We introduce a new distance-certified subgradient method (\DCSG) that follows a one-step optimization principle analogous to that underlying the Polyak stepsize, without requiring the optimal value. Specifically, \DCSG{} maintains a valid upper certificate for the current squared distance to the solution set. The method selects each stepsize by minimizing the worst-case upper bound on the next squared distance over all distances consistent with this certificate. We show that the resulting minimax problem admits a closed-form solution, yielding an explicit adaptive stepsize update. Under uniformly bounded subgradients, \DCSG{} improves upon the convergence rate of the classical subgradient method and matches the state-of-the-art rates for Lipschitz convex optimization under H{ö}lder growth. In particular, it achieves linear convergence under sharp growth. Numerical experiments illustrate the performance of \DCSG.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19788 ↗

We consider regularized nonconvex optimization over a closed convex set $\mathcal{X} \subseteq \mathbb{R}^d$, which involves a convex nonsmooth regularizer $r$ in the objective and $n$ smooth equality constraints. To find a near-KKT point of the problem, we propose a prox-linear first-order method, named as SEPi-Prox, based on a smoothed exact-penalty formulation. At each outer iteration of SEPi-Prox, a strongly convex prox-linear subproblem is formed and solved inexactly to a sufficient accuracy. Under a local non-singularity condition that is weaker than some other commonly used regularity conditions or constraint qualifications, SEPi-Prox finds an $ε$-KKT point within $O(ε^{-2})$ first-order oracle calls, matching the lower bound for unconstrained smooth nonconvex optimization. We employ Nesterov's accelerated proximal-gradient method (APG) and a dual cutting-plane method (DCP) for the prox-linear subproblems. Let $\mathcal{C}_{\mathrm{FO}}$ and $\mathcal{C}_r$ denote the numbers of arithmetic operations of evaluating one first-order oracle and one proximal mapping of $r$ over $\mathcal{X}$, respectively. Then SEPi-Prox requires $\widetilde{O}(\mathcal{C}_{\mathrm{FO}}ε^{-2} + (dn + \mathcal{C}_r)ε^{-5/2})$ and $\widetilde{O}((\mathcal{C}_{\mathrm{FO}} + dn^2 + n\mathcal{C}_r + n^{3.373})ε^{-2})$ total arithmetic operations to produce an $ε$-KKT point, respectively by using APG and DCP as the subsolver. The latter result is preferable when $n$ is small and nearly matches the optimal dependence on $ε$. Numerical experiments on instances of the multi-class Neyman-Pearson classification demonstrate the efficiency of SEPi-Prox with both subsolvers.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19887 ↗

We study sequential decisions in AI workflows and other automated execution systems where failures of uncertain origin require recovery under limited shared expert capacity. Recovery choices affect future diagnostic demand, while expert availability changes which recovery actions are worthwhile. We coordinate diagnostic requests, expert dispatch, and checkpoint-based recovery to maximize expected net operating value. A finite-horizon model tracks uncertain error locations, remaining time, and shared expert capacity. Structural analysis shows how competition for diagnosis changes unaided recovery. When a full rebuild from checkpoint 0 is the best unaided fallback after failure, a larger expert pool can justify retaining more work despite a lower chance of immediate success. Capacity can also raise net operating value before fixed staffing costs while reducing diagnostic hours when advice is requested only after a failed trial. Our Diagnosis-Resource-Recovery Control (DRRC) policy coordinates these decisions through local recovery lookahead and estimates of service requirements and remaining time; its learning-augmented variant uses task-specific quality and duration estimates. In controlled simulations, larger pools draw more requests before repair, and selective diagnosis raises net value chiefly by reducing recovery costs. In a digital twin based on 177 software defects, DRRC with reference-assisted diagnosis increases mean timely completion by 3.27 percentage points and mean net value by 1.85% relative to automated recovery, although the net-value advantage remains uncertain across repositories. Expert capacity changes when workflows seek advice and how much work they preserve. Expansion may raise or lower diagnostic hours, so capacity and recovery design should be assessed jointly by their contribution to net operating value.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19963 ↗

In this paper we study the linearization of nonautonomous differential inclusions, whose right-hand side is integrably Lipschitz in the state variable and measurable in time. We establish measurability results for time-dependent graphs and identify the Clarke tangent cone to the set of their measurable selections in $L^\infty\times L^1$. Combining this characterization with a subtransversality argument, we obtain a lower estimate for the Clarke tangent cone to the set of all admissible trajectories starting from a fixed set. As an application, we give sufficient conditions for local controllability around a closed terminal set.

fields
Optimization and Control
pdf ↗ page arXiv:2611.19997 ↗

We study the terminal controllability of the three-dimensional acoustic wave equation driven by finitely many fixed point sources, with zero initial data and time-dependent amplitudes supported in a finite interval. Although finitely many fixed sources cannot control the whole energy space, we establish the following results: (i) For source amplitudes in the first-order Sobolev space in time, the terminal state has finite energy if and only if all amplitudes vanish at both endpoints of the control interval. (ii) We derive an exact frequency-domain identity for the terminal energy involving a Gram matrix whose diagonal entries are one and whose off-diagonal entries are given by the sinc function, depending on frequency and source separation. (iii) For every positive control time, the terminal control operator is bounded below and is an isomorphism onto its closed reachable range, which has infinite codimension even among states satisfying the finite-propagation support condition. (iv) We establish a necessary and sufficient radiation-field criterion for reachability, provide stable reconstruction of the unique controls, and characterize the best approximation of non-reachable targets. The optimal coercivity constant equals one before the shortest source travel time. At long times, it decays as the inverse square of the control time for two sources and as the inverse fourth power for three equally spaced collinear sources. We also obtain upper bounds for general configurations and illustrate the theoretical results through reproducible Galerkin computations.

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

Federated learning trains a shared model from distributed client data. The deployment risk is typically specified through two approximations: each unknown local distribution is replaced by its empirical distribution, and the unknown deployment mixture across clients is replaced by empirical or prescribed training weights. Existing robust methods usually address one approximation at a time through local distributional ambiguity sets or worst-case client mixtures. However, joint treatment of both approximations remains underexplored. To address this gap, we construct a global ambiguity set formed by admissible mixtures of client-wise Wasserstein ambiguity sets, yielding a distributionally robust optimization formulation. The construction allows client-dependent ambiguity radii, preserves client-wise separability of the objective function, and yields a high-probability out-of-sample guarantee for the resulting robust problem. We then introduce a penalty-based approximation of this formulation and develop a communication-efficient algorithm called BiDRO-FedAvg, for which we establish a convergence guarantee. We validate the proposed framework through a market-demand prediction simulation.

fields
Optimization and Control
pdf ↗ page arXiv:2611.20060 ↗

We establish an observability criterion for translation-covariant families of operators on $L^2(\mathbb R^d)$. Under continuity of the observed cell energies, a common summable localization bound, and reconstruction up to a locally collectively compact error, observability is equivalent to the absence of nonzero uniformly local invisible states on every configuration in the full translation hull. For one-dimensional transport systems satisfying the Kalman rank condition, this yields localized observability in the intrinsic Kalman–Jordan energy space for arbitrary real Jordan structure and nonzero speeds. For unions of observed intervals with a uniform positive lower length bound, the sharp condition is that the slowest characteristic travels farther than the gap supremum. Observability fails at equality even when this supremum is not attained. Duality gives exact controllability in the dual energy space. We also obtain sharp criteria for translating observation regions and scalar transport with an integrable convolution kernel. The reconstruction hypothesis is also necessary for observability. An anisotropic heat-flux example shows that it applies beyond coercive multiplication-plus-compact Gramian decompositions.

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

In this paper, we develop Nesterov accelerated augmented Lagrangian methods for composite convex optimization with nonlinear inequality constraints. The methods are derived through a compatible discretization of inertial primal-dual dynamics, yielding a unified framework that couples difference extrapolation of the constraint mapping with a projected multiplier. Under convexity and weighted summability of the primal stationarity errors, we prove boundedness of the primal-dual iterates and simultaneous $\mathcal O(k^{-2})$ last-iterate rates for the objective residual and constraint violation. Under strict parameter conditions, the primal-dual sequence converges to a Karush-Kuhn-Tucker pair, and both residuals improve to $o(k^{-2})$. These results require no strong convexity of the objective or constraints. Numerical experiments examine the performance of the proposed methods.

comments
34 pages. This paper is an expanded version of the discrete-time part (Section 3) of arXiv:2609.01415v2
fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2611.20134 ↗

The ambiguity function (AF) of a radar waveform describes its ability to resolve targets in range and Doppler. Designing a waveform that attains a prescribed AF magnitude is a phase retrieval problem with four trivial ambiguities, and a time- or band-limited pulse is determined up to these ambiguities by at most three times as many AF samples as it has time samples or frequencies. Existing solvers for the narrowband AF, however, are non-convex: they cannot guarantee that they reach the global minimizer, which is unique only up to the trivial ambiguities, so the recovered pulse depends on the starting point. This letter addresses this gap by lifting the problem to positive semidefinite matrices supported on the pulse band, where each AF sample becomes the magnitude of a linear functional. In the lifted space, recovery is formulated as a convex program, and a dual certificate provides a sufficient condition for exactness. The proposed algorithm, wavex, combines an initialization by relaxed reflections, convex semidefinite surrogate steps, and a local polish. Numerical experiments show that wavex accurately recovers band-limited pulses from complete AFs and from AFs with most of their samples removed, provided the remaining samples determine the pulse, and that its accuracy degrades gracefully as the noise increases. wavex is built on the open-source library invexapi, and the code that reproduces every result is available at https://github.com/samuelpinilla/waveX.

fields
Optimization and Control, Mathematical Physics
pdf ↗ page arXiv:2611.20179 ↗

A policy trained to make per-unit decisions, such as how much of a product to order, tells us the best action but not the cost of deviating from it. That cost, the advantage function, is what downstream systems need when they have to depart from the per-unit optimum: to estimate the impact of ordering more or fewer units, to respond to a one-off vendor discount, or to satisfy a shared capacity constraint. The advantage function is what makes such trade-offs computable, yet pure policy-learning algorithms often produce the policy alone, without a critic that would yield it. We propose a method to train an advantage function surrogate through price perturbations motivated by a Fenchel-Young loss. We describe a two-stage recipe (fit the policy, then the cost model) and illustrate it on a multi-period inventory management problem.

fields
Optimization and Control
pdf ↗ page arXiv:2611.20199 ↗

Power-system operators continually ask what would happen if a component failed now. Single-phase-to-ground faults cleared by single-pole tripping and automatic reclosure usually have no lasting consequences. In rare cases, however, the transient excited during the open-phase interval drives distant lines or transformers into overload that persists after the faulted line is restored. We develop a counterfactual screening framework for these secondary overloads, combining a linear stochastic swing surrogate with cross-entropy importance sampling. The surrogate represents the open-phase corridor through an effective coupling factor and localized multiplicative noise, with both parameters learned from electromagnetic-transient (EMT) simulations rather than prescribed. Closed-form propagation of the mean and covariance permits deterministic calibration without Monte Carlo sampling. On the reduced WECC 240-bus system, a globally calibrated model substantially improves finite-time agreement with the EMT electromechanical state. The global models are calibrated at reclosure and tested on disjoint faulted lines under a longer open-phase interval. Line- and operating-state-specific models use additional reclosure data from the assessment lines and provide smaller further gains at the cost of more separate fits. The fitted coupling is lower than the phase-counting baseline, consistent with the direction anticipated by sequence-network analysis. Cross-entropy importance sampling directs computational effort toward contingencies associated with persistent overload and yields rare-event probability estimates together with a map linking initiating faults to the elements they endanger. By separating offline EMT calibration from repeated surrogate evaluation, the method supports probabilistic contingency screening and identifies where detailed high-fidelity assessment is most valuable.

comments
25 pages, 12 figures, 5 Tables, 1 Algorithm
fields
Optimization and Control
pdf ↗ page arXiv:2611.20212 ↗

DeePC is posed on a window of past inputs and outputs, so its feasible set is a set of histories and is not available in closed form. We write the DeePC solution as an implicit ReLU network whose weights are built from Hankel matrices and whose activation patterns are the critical regions of the underlying quadratic program. This gives, directly from the Hankel matrices, the feasible set of DeePC as a polyhedral projection, its explicit piecewise-affine control law, and an exact linear model of the history window. We compute three invariant sets of histories: the maximal positively invariant set of the unsaturated linear branch, the region of recursive feasibility of DeePC without terminal ingredients, and the maximal control invariant set of admissible histories. We show these sets are nested and provide numerical examples.

fields
Optimization and Control
pdf ↗ page arXiv:2611.20220 ↗

Contraction analysis has found broad applications in synchronization, tracking, observer design, and nonlinear feedback control. However, establishing contraction conditions for polynomial dynamical systems remains challenging due to their state-dependent Jacobians. In this article, we develop a tensor-based framework for contraction analysis of polynomial dynamical systems by exploiting the structure of orthogonally decomposable (odeco) coefficient tensors. By transforming the dynamics into modal coordinates, we derive necessary and sufficient semicontraction conditions and characterize state-dependent semimetrics. We establish fundamental limitations on exponential contraction and prove polynomial decay of differential displacements on forward-invariant regions. To accommodate more general polynomial dynamical systems, we extend the framework to include linear dynamics and non-odeco tensor perturbations, deriving computationally tractable contraction certificates with explicit robustness guarantees. We further develop convex feedback synthesis conditions based on linear matrix inequalities for general input matrices. We demonstrate the effectiveness and computational scalability of the proposed framework through numerical experiments on both synthetic systems and nonlinear elastic relaxation models.

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

We consider monotone variational inequalities in which the Jacobian norm of the operator $F:\mathbb{R}^d\to\mathbb{R}^d$ is bounded by an affine function of the norm of the operator itself: $\|DF(z)\|\le L_0+L_1\|F(z)\|$. The main case is the problem on the whole space, that is, finding a zero of $F$. We assume that a solution exists and that an upper bound $R$ on the distance from the starting point to the solution is known. Neither strong monotonicity nor cocoercivity is assumed. Global Lipschitz continuity is not assumed either: for $L_1>0$, the Jacobian norm may grow together with the norm of the operator. We obtain upper and lower bounds on the number of oracle calls sufficient to find a point $\hat z$ with $\|F(\hat z)\|\le\varepsilon$. For $L_0R/\varepsilon\ge1$, both bounds are, up to logarithmic factors in $L_1R$, of order $1+L_0R/\varepsilon+(L_1R)^{6/5}$. The upper bound is attained by a deterministic extragradient-type method, and the lower bound holds for arbitrary randomized methods. The same bounds are obtained for the Minty gap on the ball of radius $R$, where $L_0R/\varepsilon$ is replaced by $L_0R^2/η$. In addition, we show that for a variational inequality on a bounded set the numbers $L_0,L_1$ and the diameter of the set are not sufficient: a uniform complexity bound requires additional information, for example, an upper bound on the norm of the operator at the solution.

comments
38 pages, 2 algorithms, 1 table. Third paper in the Descending Everest series; Part I: arXiv:2610.21461, Part II: arXiv:2611.04171. A Russian version of the paper is available at https://github.com/chitoraphelion/descending-everest-with-first-order-oracles
fields
Optimization and Control
pdf ↗ page arXiv:2611.20296 ↗

Arc-flow formulations can provide strong relaxations for mixed-integer program formulations of vehicle routing problems, but the associated networks may be prohibitively large. We study the setting in which multiple arc flow relaxations may be applied, and introduce a dual-guided aggregation and refinement framework that constructs substantially smaller arc-flow formulations while recovering the LP bound of the original networks. Dual information is used both to identify states that can be aggregated without weakening the bound and to guide node disaggregation. We show that the resulting procedure converges finitely to the arc-flow bound of the full arc-flow formulation. The framework retains the original decision variables, allowing cutting planes to be added directly in the original variable space. Moreover, it produces an explicit MILP formulation without relying on column generation or pricing to determine the arc-flow relaxation bound. We apply our approach to the vehicle routing problem with time windows for which we define two arc flow relaxations, as well as two families of cutting planes over the original variable space. Computational experiments show that strong bounds can be obtained using substantially aggregated networks. The resulting root bounds are competitive with those obtained by the branch-and-price solver RouteOpt, while retaining a formulation that can be solved directly by a general-purpose MILP solver.

comments
47 pages. Submitted to Transportation Science
fields
Optimization and Control
pdf ↗ page arXiv:2611.20310 ↗

We study a soft-constrained formulation of the Schrödinger bridge problem, in which the terminal distribution constraint is relaxed into a penalty on the discrepancy between the terminal law of the controlled process and a target distribution. This leads to an unconstrained McKean–Vlasov stochastic control problem, where the interaction enters only through the terminal cost. We characterize the optimizer via a McKean–Vlasov forward-backward stochastic differential equation and establish well-posedness under very mild assumptions. We also analyze two approximation regimes relevant to data-driven computation: approximation of the target law by empirical samples, and finite-particle approximation of the McKean–Vlasov control problem. For both, we derive convergence results and error estimates. Finally, building on the well-posedness and approximation results, we investigate two neural numerical methods: one based on the forward-backward system and the other on direct control optimization. Both methods are tested on state-of-the-art generative tasks. Our results provide both an algorithmic foundation and its theoretical guarentee for soft-constrained Schrödinger bridge problems in sample-based generative modeling.

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

In this paper, we consider a convex optimization problem, where the upper bound on the subgradient norm depends on the objective function. We establish a lower bound on the number of iterations required by any first-order method to find an approximate solution to the problem. Furthermore, we present two near-optimal algorithms that can match the lower bound up to logarithmic factors. The first algorithm is a projected GD with a carefully designed stepsize schedule which incorporates warm-up and decay phases. The second algorithm is scalar-stepsize clipped AdamW which extends the near-optimal guarantees to the stochastic setting, where only a noisy unbiased estimator of the subgradient is available.

fields
Optimization and Control
pdf ↗ page arXiv:2611.20318 ↗

This paper examines two ways nonlinear measurements complicate the statistical predictions during covariance steering. The covariance steering problem optimizes a control policy across a distribution of possible trajectories rather than a single specific trajectory. This approach has attracted growing interest as a way to account for uncertainty in aerospace applications such as trajectory optimization, stationkeeping, and landing. In many of these applications, covariance steering can account for measurement uncertainty through output feedback. Because standard formulations assume linear dynamics and measurements, applications with nonlinear measurements typically use an extended Kalman filter to estimate the state. This paper shows that techniques used to improve filter convergence, such as measurement underweighting, can reduce the accuracy of conventional covariance steering predictions by violating a key assumption. This is addressed with a new convex formulation that relaxes the assumption. This paper also demonstrates that adjusting the control policy during execution can improve agreement between predicted and actual state statistics. A numerical example of angles-only spacecraft rendezvous illustrates the benefits of the proposed method, and discussions are made regarding the implications of this generalized covariance steering formulation.

fields
Optimization and Control
pdf ↗ page arXiv:2611.20337 ↗

This paper is concerned with the derivation of a model governing the equilibrium configuration of two linearly elastic bodies that may come into contact with each other. The contact zone, or coincidence set, is an \emph{a priori} unknown of the model, and the equilibrium configuration is governed by variational inequalities. We introduce a new modelling paradigm in which the contact interface between the two linearly elastic bodies under consideration is now regarded as the \emph{primary variable} of an optimal control problem whose states are the unique solutions of two \emph{independent} unilateral contact problems for which this very contact interface represents the obstacle itself. As a result, the free boundary emerges as the solution of a low-dimensional optimisation problem rather than as the active set of coupled variational inequalities. We establish the existence and uniqueness of optimal controls minimising the reduced cost functional arising from the modelling paradigm introduced beforehand, and we show that the family of marginal energy functionals associated with such model $Γ$-converges to the energy functional associated with the original variational inequalities as the positive \emph{cost parameter} $β$ in the reduced cost functional tends to zero. This $Γ$-convergence argument also yields a characterisation of the coincidence set of the limit problem in terms of the optimal interfaces. We further show that, after a suitable regularisation, the reduced cost functional is Gâteaux differentiable, and that its Gâteaux derivative can be explicitly computed \emph{without solving any adjoint system}. Finally, we corroborate the $Γ$-convergence result obtained beforehand with numerical experiments on a simplified and exactly solvable configuration.

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

This paper studies a two-person zero-sum stochastic game, which must terminate when either player quits the game or a state of the game first enters a prescribed target set. The performance criterion is the probability that the total reward reaches a given threshold. First, under a mild condition, we prove the existence of the value and a Nash equilibrium of the game by developing a comparison theorem. Second, for solving the game with infinite states, we develop a finite-state approximation method based on truncation, and derive explicit error bounds between the values of the truncated and original games. Third, using the error bounds, we design an effective algorithm, by which we can not only obtain any approximation of the value and Nash equilibria of the original game, but also provide convergence analysis of the approximation. Finally, a queueing example is used to illustrate the advantage of our condition and the effectiveness of our algorithm.

comments
23 pages, 2 figures
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2611.20428 ↗

Continuous-time AdamW provides a framework for understanding whether an optimizer widely used to train large-scale neural networks settles to an equilibrium or sustains persistent motion. We study this long-time behavior while retaining bias correction and fixed positive weight decay. Under suitable assumptions, we establish that the dynamics are well defined for all time and remain bounded when the decay is sufficiently small. Our main result connects their limiting behavior to the geometry of the objective: trajectories approach a locally invariant manifold whose dimension equals the Hessian nullity along the associated critical component. When critical points are isolated and have at most one such direction, the trajectory converges to a single equilibrium. With two degenerate directions, however, bounded persistent motion can occur even for a smooth, strictly convex objective with a unique minimum. We also quantify how close the long-time trajectory remains to the critical set as weight decay decreases, without assuming convergence to a point. These results identify objective geometry as a key to understanding when continuous-time AdamW converges and when persistent motion is possible.

comments
55 pages, 9 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.20437 ↗

Koopman bilinear representations for control-affine systems have attracted considerable attention. In this paper, we investigate, from a Lie-algebraic perspective, conditions under which a control-affine system admits a finite-dimensional Koopman bilinear embedding. Specifically, we focus on the Lie algebra generated by the drift and control vector fields. First, we show that the finite-dimensionality of the generated Lie algebra is a necessary condition for the existence of a Koopman bilinear embedding. Next, when the generated Lie algebra contains a nonzero nilpotent ideal, we derive a sufficient condition for the existence of such an embedding. Finally, through an example of a quadratic polynomial system, we demonstrate that the finite-dimensionality of the generated Lie algebra imposes strong restrictions on the vector fields, suggesting that exact finite-dimensional Koopman bilinear embeddings may be nongeneric.

comments
8 pages, 0 figure
fields
Optimization and Control
pdf ↗ page arXiv:2611.20438 ↗

We study certificates of polynomial nonnegativity based on hyperbolic polynomials and their parameterized Bézoutians and establish three results. First, in the unrestricted hyperzout model of Ng and Saunderson, every nonnegative real form of degree $2r$ in $m$ variables admits a hyperzout representation using an auxiliary hyperbolic form of degree $2r$ in $m+1$ variables with parameters $k=1$ and $μ=r+1$. Second, every homogeneous hyperbolic cubic in five real variables is SOS-hyperbolic in Saunderson's fixed-direction sense: for each hyperbolicity direction $e$, $B_{p,e,v}$ is a matrix SOS for every $v\in\Lam(p,e)$. Third, a general localization proposition turns an interior-SOS central Wronskian and a non-matrix-SOS central Bézoutian into a two-direction weak–strong separation. An icosahedral seed gives a rational example of degree $46$ in $43$ variables for which every $W_{u,v}$ on the cone is an SOS, but some $B_{p,u,v}$ is not a matrix SOS. The obstruction persists at nearby interior directions, giving a rational hyperbolicity direction at which the polynomial is weakly SOS-hyperbolic but not SOS-hyperbolic in Saunderson's fixed-direction sense. The construction is supported by exact rational Gram and trace certificates.

comments
30 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.20456 ↗

Physics simulation is an increasingly important computational primitive for AI, and local–global/ADMM splitting exposes its parallel structure but lacks matching finite-time convergence guarantees. We close this gap with two ADMM variants, Interior-Point ADMM (IP-ADMM), for block-structured nonconvex composite programs with smooth nonlinear inequality and affine constraints. A one-sided finite-activation wall keeps each constraint split state strictly feasible while the original-space infeasibility vanishes, giving closed-form constraint updates, one proximal call per objective block, and one equality-constrained quadratic consensus solve per iteration. \rev{To our knowledge, this makes IP-ADMM the first single-loop method that updates nonconvex inequality constraints locally and in parallel with finite-time convergence guarantees.} Ordinary IP-ADMM attains a CQ-free best-iterate weak-KKT rate of $O(K^{-1/3})$ or a banded Fritz–John rate of $O(K^{-1/4})$, which converts to KKT at $O(K^{-1/4})$ under a uniform constraint qualification; these are nearby-point certificates that reduce to conventional KKT for smooth blocks. A checkpoint variant, IP-ADMM-Ckpt, improves the asymptotic KKT exponent to $O(K^{-1/3})$. We also show how the bounds scale with the objective- and constraint-block counts and the coupling norm.

fields
Optimization and Control
pdf ↗ page arXiv:2611.20483 ↗

This paper addresses the design of optimal dynamic quantizers for discrete-time linear periodically time-varying (LPTV) plants with discrete-valued inputs. Optimal dynamic quantizers, which minimize the worst-case output error caused by quantization, are well established for linear time-invariant (LTI) plants, whereas the corresponding design for plants with periodically time-varying dynamics has not been addressed. For square LPTV plants having relative degree one at every time phase, this paper derives an optimal periodic dynamic quantizer in closed form. The quantizer is constructed by applying the LTI theory to the cycled plant obtained by cyclic reformulation and reading off its periodic coefficient matrices block by block; its optimality is then verified directly, showing that it attains a performance lower bound determined by the largest instantaneous input-to-output gain over the time phases. The worst-case output error of general periodic dynamic quantizers is also characterized. The optimal quantizer is shown to be stable if and only if all invariant zeros of the cycled plant lie in the open unit disk, which is the condition that governs stable causal inversion of LPTV plants. A numerical example with comparisons to conventional quantizers illustrates the results.

comments
Submitted to Automatica
fields
Optimization and Control
pdf ↗ page arXiv:2611.20515 ↗

We study degenerate preconditioned proximal point algorithms (PPPA) for finding zeros of nonmonotone set-valued operators in Hilbert spaces under solution-relative $(U,V)$-semimonotonicity, with possibly indefinite $U$ and $V$. With a closed-range preconditioner $P$, the reduced PPPA dynamics admit a forward representation through the complementary resolvent of a parallel composition, without requiring monotonicity or admissibility. Relative semimonotonicity of the range-restricted operator transfers to the reduced forward map, allowing our forward theory for possibly set-valued mappings to yield Fejér estimates and residual rates. Under suitable conditions, including demiclosedness of the reduced map at zero, the projected PPPA iterates and shadows converge weakly to a common projected zero. Without demiclosedness, a counterexample shows that the projected sequences may converge to a point outside the projected zero set, even when the original operator is continuous. Bounded recovery condition yields weak convergence of the full (non-projected) shadows. The monotonicity modulus $U$ yields additional results: under suitable conditions, $U\succeqτP$ with $τ>0$ gives strong and linear convergence of the projected PPPA sequences, while $U\succeq-σP$ with $0\leσ<1/2$ still permits local linear rates under metric subregularity. These strong convergence and linear rate guarantees extend to the full shadows when a Lipschitz recovery estimate holds, such as when $U$ is strongly monotone on $\ker P$. For Chambolle–Pock and Douglas–Rachford splitting, we establish Lipschitz recovery even when $U=0$ by exploiting the primal–dual structure. Under suitable parameter conditions, full-shadow convergence guarantees, including $R$-linear rates, extend to the original PPPA iterates.

comments
26 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.20523 ↗

Since the introduction of the Kalman filter, nonlinear state estimation has become an important topic in areas such as aerospace engineering, sensor design, and target tracking. Within the optimal filtering framework described by the Duncan-Mortensen-Zakai (DMZ) equation, Yau-Yau filtering (YYF) employs an offline-online decomposition: the Fokker-Planck-Kolmogorov (FKE) equations, initialized by a prescribed set of basis functions, are solved offline, and the prior density is projected onto these basis functions during the online stage. However, this approach still faces two computational challenges: solving multiple FKEs offline can be computationally expensive, and the online projection becomes costly when filtering is performed repeatedly or in high-dimensional settings. To address these limitations, we develop a neural operator filter (NOF) that directly learns the mapping from the prior density to the posterior density, thereby eliminating both the expensive offline FKE solves and the online projection. The underlying operator is approximated using a Fourier neural operator (FNO). Numerical experiments on several challenging filtering systems verify both the effectiveness and accuracy of our method, and we further provide a rigorous theoretical analysis of its stability and approximation error.

fields
Optimization and Control
pdf ↗ page arXiv:2611.20598 ↗

Explicitly controlling structural topology remains a major challenge in topology optimization. While many implicit methods regulate topology only indirectly, available explicit strategies often focus on two-dimensional hole control or extend to 3D without a unified treatment of tunnels and cavities. This study proposes a differentiable, persistent homology-based framework for explicit topology control in 2D and 3D isogeometric topology optimization. A NURBS-represented density field induces a single sublevel filtration whose persistence diagrams quantify the connected components, holes in 2D, and tunnels and cavities in 3D directly. To enforce prescribed bounds on topological feature counts, weighted topological objectives are applied in a staged manner that coordinates the different homology dimensions. Each redundant feature is removed either by cutting or by filling according to the region of its corresponding persistence pair, avoiding the excessive structural changes associated with filling alone. The topological inverse mapping yields analytical sensitivities with respect to the density control coefficients, so that the resulting objective is readily incorporated into gradient-based optimization and solved by the method of moving asymptotes. Numerical experiments on 2D and 3D benchmarks demonstrate explicit and reliable topology control while maintaining competitive mechanical performance and stable convergence.

fields
Optimization and Control
pdf ↗ page arXiv:2611.20664 ↗

The static state-feedback gain that renders a linear system passive at an external port and minimizes a linear quadratic regulator (LQR) cost cannot be computed by convex optimization, since the passivity certificate and the LQR cost are coupled bilinearly through the common gain. A previous indirect approach restricts the gain to a convex inner approximation of the passivity region, which is conservative and whose construction scales exponentially with the number of gain entries. This paper proposes a direct approach. The set of strictly passivating gains is the image of a convex lifted set of inverse storage matrices and transformed gains. We describe this set by a strict linear matrix inequality and an affine equality for every feedthrough matrix with positive semidefinite symmetric part, including feedthrough matrices with a singular symmetric part, and minimize the LQR cost over it by a gradient flow whose metric is the Hessian of a logarithmic barrier. For multi-input systems, this Hessian is singular along gain changes that preserve the storage function, and we complete the metric along these directions by the metric of the gain space. We prove that the flow exists for all times, that every gain along the flow is strictly passivating with an explicit storage function, and that the cost decreases monotonically while the gains remain in a compact set of stabilizing gains. Numerical examples show that the flow attains a lower cost than the indirect approach, that the completion is required for multi-input systems, and that the flow can converge to a local minimizer on nonconvex passivity regions.

fields
Optimization and Control
pdf ↗ page arXiv:2611.20757 ↗

The blind perspective-$n$-point (PnP) problem is to estimate the pose of a calibrated camera from 2D and 3D point sets with unknown correspondences. We show that, for complete, noiseless observations, fourteen permutation-invariant image moments up to order four identify a fixed camera pose for almost every 3D point set containing at least twenty points. Our learning-free method, MomentPnP, matches these moments between the observed 2D points and the projected 3D points to initialize a camera pose without correspondences and refines the pose and correspondence weights using expectation–maximization. Across the test sets of three benchmarks, our method reduces median rotation error by $5$--$170\times$ relative to the best learned baseline, both with and without outliers. We recover accurate poses even with as many outliers as inliers. On dense ETH3D scans, pose accuracy improves as the point sets grow, even as individual correspondences become harder to resolve.

comments
65 pages, including references and appendices; under review
fields
Optimization and Control
pdf ↗ page arXiv:2611.20797 ↗

This paper addresses supply-demand coordination, in which a supplier sets prices to balance the demands of multiple buyers against limited resources. Existing studies typically solve the supply-demand coordination problem with a distributed algorithm called primal-dual gradient dynamics (PDGD), assuming that each buyer discloses the value of its own utility or marginal utility function. In contrast, we assume that each buyer discloses only binary information, namely whether it wants more or less of the current amount, and propose Sign PDGD. Sign PDGD is a PDGD algorithm in which the buyers' update depends only on the sign information. We analyze the convergence of Sign PDGD by interpreting it as a sliding mode control (SMC). For a quadratic cost and linear constraints, we show that under a gain condition, the primal and dual variables converge to the optimal solution. Numerical simulations on a toy resource-sharing problem confirm the two-phase behavior of SMC and show that the primal and dual variables approach the optimal solution.

fields
Optimization and Control
pdf ↗ page arXiv:2611.20798 ↗

Standard regression methods do not always guarantee that the estimated model reflects prior knowledge about how predictors relate to the response, which motivates constrained regression. When the effects to be estimated are smooth nonlinear functions, a natural family of constraints is that of shape constraints, such as sign, monotonicity, or curvature, which encode qualitative properties that these functions are often expected to satisfy. While shape-constrained estimation of smooth functions is well established in classical regression with scalar covariates and response, its extension to functional regression, where the coefficients are themselves functions, remains largely unexplored. In this paper, we propose the functional shape-constrained conic P-spline estimator (FunSCOPE), a unified framework for shape-constrained functional linear regression that covers scalar-on-function, function-on-scalar, and function-on-function models, and in which any combination of the shapes above can be imposed on the functional regression coefficient. Building on a P-spline approach, the desired shapes are expressed as conditions on the scalar regression coefficients, which leads to an estimation problem formulated as a conic optimization problem. For univariate coefficients, as in scalar-on-function, function-on-scalar, and a particular case of the function-on-function regression, the concurrent case, these conditions are both necessary and sufficient, in contrast to existing approaches, which provide only sufficient conditions; for bivariate coefficients, as in general function-on-function models, they are neither necessary nor sufficient. Numerical experiments show that FunSCOPE outperforms competing methods in terms of estimation error and computational time.

fields
Optimization and Control, Statistics Theory
pdf ↗ page arXiv:2611.20825 ↗

The dynamics of the reactant in an isothermal axial dispersion tubular reactor is considered. Our goal consists in designing the inlet reactant concentration, under the form of a state feedback law, in order to modify the state behavior according to relevant process requirements, while keeping the positivity and stability properties of the uncontrolled dynamics. The designed control is also constrained to be positive to respect physical requirements. First, we state and analytically solve a parameterized optimal feedback design problem. Next, we address a positive observer-based feedback stabilization problem. The results are illustrated by means of numerical simulations.

fields
Optimization and Control
pdf ↗ page arXiv:2611.20876 ↗

Human-centric artificial intelligence and data science (HCAD) systems increasingly involve human-in-the-loop (HITL) interventions to overcome the limitations of fully automated machine learning algorithms, such as automation bias and the inability to incorporate tacit domain knowledge, and continuously improve predictive performance. Data transformations, feature selection, feature weighting, and model selection usually require laborious human involvement across iterations of artificial intelligence and data science (AI&DS) pipelines, making development a challenging and time-consuming process. The Cognitive Pairwise Comparison (CPC) framework is proposed as a human-centric methodology to elicit preferences and priorities in a structured format. To establish essential facets of human-centricity, this research advances the CPC methodology so that user preference elicitation can be systematically quantified in these challenging AI&DS tasks. To demonstrate the usability and validity of these facets, this study presents several applications within movie recommender systems using the MovieLens dataset. It exemplifies how the extended CPC framework can facilitate interactions between human judgments and data across supervised learning, dimensionality reduction, and unsupervised learning algorithms.

comments
33 pages, 19 tables, 8 figures; interactive web demos available at https://kkfyuen.github.io/cpcHCADDemos ; source code and datasets at https://github.com/kkfyuen/cpcHCADDemos ; archived at https://doi.org/10.5281/zenodo.23434993 ; earlier preprint version available at SSRN 4048692 (http://dx.doi.org/10.2139/ssrn.4048692 or https://ssrn.com/abstract=4048692)
fields
Optimization and Control
pdf ↗ page arXiv:2611.20926 ↗

This paper studies convergence rates of moment–SOS hierarchies with correlative sparsity. Following the method proposed in~\cite{tran}, we bound the Hausdorff distance between the set of sparse truncated moment sequences and sparse truncated pseudo-moment sequences. The central step is a quantitative gluing lemma on a clique tree: local moment errors and separator discrepancies in total variation control the error of a joint approximating measure. Over hypercube, polynomial kernels give the convergence rates $O((\log_2r)^3/r^2)$ for the correlative sparse quadratic module and $O(r^{-2})$ for the correlative sparse preordering, where the certificate degree is $2r$. On compact basic semialgebraic sets, slack variable lifting and global atom projection yield $O((\log_2r)^{3\Lo/2}/r^{\Lo})$ and $O(r^{-\Lo})$ with a Łojasiewicz exponent $0<\Lo \le1$. These bounds hold for fixed-degree Hausdorff distances and polynomial objective gaps. We also extend to result to the correlative sparse quadratic-module rate for scalar objectives with clique-local polynomial matrix constraints.

fields
Optimization and Control
pdf ↗ page arXiv:2611.20933 ↗

We develop a branch-and-cut method for finding maximum distance-independent sets in graphs. Our approach solves a sequence of fixed-size clique problems, combining graph reductions with combinatorial and spectral bounds. We give a compact formulation, derive strengthened inequalities, establish conditions for using spectral information, and evaluate them in a comprehensive computational study.

fields
Optimization and Control
pdf ↗ page arXiv:2611.20957 ↗

Operating transmission networks under uncertain outages requires coordinating discrete network topology actions with continuous adjustments to generation and storage, while respecting operational constraints and real-time computational limits. We present a rollout-based controller that combines discrete and continuous decisions under the uncertain contingency policy of the L2RPN AI4RealNet 2026 challenge. Power-flow approximations and convex optimization identify the most promising actions, followed by short-horizon simulations to predict their effect on congestion, renewable curtailment, and redispatching costs. A further policy exploits the benchmark's specific attack protocol: keeping selected lines disconnected prevents some adversarial outages from being initiated. On the benchmark's $118$-bus network, the controller completed $189$ of $208$ final-test scenarios (score $64.39$) and achieved the second-best ratio of score to computation time among the five top-ranked entries, behind one that scored lower. Our results show that combining structured optimization with simulation-based action selection is effective even without a learned decision rule, and fast enough for real-time control. Code and reproduction material: https://github.com/DavidKrame/RAD_agent__AI4RealNet_competition.

fields
Optimization and Control
pdf ↗ page arXiv:2611.20985 ↗

Towards data-driven stability certificates of dynamical systems, we are witnessing renewed interest in studying and exploiting the structure of Lyapunov functions. Especially Lyapunov functions that are locally quadratic (i.e., Morse) gained popularity ever since it was understood that they can be written as the norm squared of a diffeomorphism. This topological representation alludes to parametrizations using invertible neural networks. In this note we discuss when and how such functions can be learned. In particular, using neural ODEs (NODEs), we characterize Sobolev approximation of these diffeomorphisms on compact sets and show how this naturally relates to stability. We also connect our results to PLNets and supply numerical experiments for illustration.

comments
13 pages, 3 figures, comments are very welcome! Currently under review
fields
Optimization and Control
pdf ↗ page arXiv:2611.21030 ↗

This paper investigates joint state and noise covariance estimation for nonlinear systems subject to dual reliability impairments: random packet dropouts and additive measurement corruption. This scenario poses challenging nonconjugate inference, as clean and corrupted measurements share an unknown baseline covariance $\boldsymbol{R}_k$ with fixed known corruption covariance $\boldsymbol{E}_k$. Packet reception is observable, whereas the authenticity of received measurements remains latent and must be inferred. To resolve this intractable estimation problem, we cast joint posterior inference as a variational optimization problem and develop a conjugate variational inference adaptive Kalman filter with dual reliability (CVIAKF-DR). The proposed method retains analytical updates for the prediction covariance and two reliability probabilities, while adopting CVI to estimate the state and baseline measurement covariance. The covariance update combines the analytical contribution from clean measurements with Monte Carlo gradient estimates for corrupted measurements. Numerical results on a re-entry tracking benchmark demonstrate the superior accuracy of the proposed method in both state and noise covariance estimation. Remarkably, even built upon the linear Kalman filtering (KF) framework that is originally designed for linear systems, our method achieves more accurate estimation performance than dedicated nonlinear filtering algorithms based on the cubature Kalman filter (CKF).

comments
9 pages, 4 figures, 2 tables, conference
fields
Optimization and Control
pdf ↗ page arXiv:2611.21045 ↗

Control barrier function (CBF) safety filters commonly rely on quadratic programs (QPs) to modify nominal control inputs while satisfying safety constraints. For safety-critical applications, however, the solution must be computed reliably under actuator limitations and with predictable computational effort. General-purpose QP solvers typically rely on numerical convergence criteria, which do not directly provide finite bounds on algorithmic steps or distinguish solver failure from mathematical infeasibility. This paper considers CBF-QPs with a single affine safety constraint, componentwise input bounds, and diagonal quadratic weights. Exploiting the established scalar dual structure of continuous quadratic knapsack problems, we obtain a necessary and sufficient pointwise feasibility condition and an exact breakpoint-based solution procedure. The algorithm requires at most 2n positive breakpoint events for n inputs, reducing to at most n events when the nominal input is admissible. In the latter case, an exact saturation–redistribution algorithm computes the optimal solution in at most n passes. We further describe how the structured solution can be combined with verified floating-point constraint evaluation to distinguish certified feasible commands, certified infeasibility, and unresolved numerical cases. The resulting framework provides an exact and computationally predictable solution procedure for a practically relevant class of input-constrained CBF safety filters.

comments
8 pages, 3 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.21075 ↗

We study stochastic control problems for uniformly elliptic controlled diffusions on bounded domains whose coefficients are merely measurable in the state variable and whose drift is dominated by an $L_d$-function. The associated Hamilton-Jacobi-Bellman (HJB) Dirichlet problems may have more than one $L_p$-viscosity solution, so that the equation alone does not determine the value function. We show that the control problem selects the minimal solution: for all $p$ in a range $(d_0,d)$ determined by the spatial dimension, the ellipticity constant and the drift bound, the value function is the minimal $L_p$-viscosity supersolution of the HJB Dirichlet problem. In particular, every continuous $L_p$-viscosity supersolution bounds the optimal cost from above, which yields a one-sided verification theorem without regularity assumptions. We further prove the existence of optimal relaxed control rules for running costs dominated by an $L_p$-function, and the lower semicontinuity of the value function under perturbations of the coefficients. An example shows that upper semicontinuity may fail even when the coefficients are Lipschitz continuous in the control variable and the approximating coefficients are smooth, so that regularization may overestimate the optimal cost. The proof approximates arbitrary supersolutions from below by Sobolev supersolutions of HJB equations whose coefficients are modified only on sets of vanishing measure, and passes to the limit by means of Krylov estimates and martingale problem techniques.

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

An optimal state observer design problem for a diffusion system with point observation is studied. As the considered system is positive, the analysis takes into account this additional condition. The solution of the optimization problem is derived by means of a discretization approach, which consists in considering the analogous problem adapted for a spatially discretized version of the pure diffusion system.

comments
Extended abstract presented at the 27th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2026), Waterloo, ON, Canada, Aug. 2026
fields
Optimization and Control
pdf ↗ page arXiv:2611.21097 ↗

This paper studies the theoretical policy iteration convergence for two-state mean-field control (MFC) problems with Wright–Fisher common noise under entropy regularization. The population dynamics lead to a degenerate Hamilton–Jacobi–Bellman equation of Kimura type. After an arcsine transformation, the degeneracy becomes a singular Bessel drift whose coefficients and weights depend on the feedback stochastic policy. This policy dependence prevents a direct application of estimates for a fixed operator. We establish weighted Sobolev estimates and Hölder embeddings uniformly over the admissible policy class. Combining these estimates with logarithmic entropy bounds and boundary estimates that remain valid when the policy changes, we prove the well-posedness, monotone improvement and convergence of policy iteration to the optimal solution. We also establish the convergence to the original MFC problem when the entropy parameter $λ$ tends to zero. Both the regularization error and the performance loss of the regularized optimal policy are bounded by $O(λ(1+|\lnλ|))$ in a weighted Hölder norm. An epidemic containment example of MFC is presented to illustrate the policy iteration convergence and the vanishing entropy convergence.

fields
Optimization and Control
pdf ↗ page arXiv:2611.21122 ↗

In this note we study the existence theory of classical solutions to a second order stationary discounted Mean Field Games (MFG) system with focusing logarithmic local coupling in one space dimension. We then show the convergence of classical solutions to the discounted stationary MFG system in the large discount/cheap control limit in the spirit of the work of Bardi–Cardaliaguet.

fields
Optimization and Control
pdf ↗ page arXiv:2611.21195 ↗

In this paper, we propose a method to recover simultaneously the shape and wavenumber of an object from noisy radar or sonar measurements. The physical problem is modeled in a bounded domain with the Helmholtz equation and appropriate transmission conditions. The approach relies on a Kohn-Vogelius formulation of the inverse problem and uses Nesterov's accelerated gradient descent combined with shape optimization techniques. To address the robustness of the method with respect to measurement noise, we are looking to minimize a convex combination of the expected value and variance, which we achieve by using a Karhunen-Lo{è}ve expansion. The effectiveness of the approach is demonstrated through twodimensional numerical experiments.

journal
Inverse Problems, 2026, 42, pp.045007
fields
Optimization and Control
pdf ↗ page arXiv:2611.21225 ↗

This paper establishes two model-free reinforcement learning methods for infinite-horizon N-player linear-quadratic nonzero-sum stochastic differential games whose drift, Brownian diffusion, and Poisson jump amplitudes depend on all players' controls. Control dependence in the diffusion and jump terms couples the players' simultaneous feedback updates. A verifiable certificate ensures that the partially model-free policy iteration map is contractive on an invariant closed ball centered at an admissible initial feedback profile. All feedback iterates are mean-square stabilizing, and the algorithm achieves local geometric convergence of feedback gains and value matrices to those associated with a closed-loop Nash equilibrium. The term certified refers to a verifiable convergence certificate that guarantees mean-square stability of all policy iterates and local geometric convergence to a closed-loop Nash equilibrium. To implement the policy updates from data, the off-policy Q-learning algorithm reuses the same behavior-policy data across iterations without requiring the system coefficients or jump intensity. Under quantitative persistence of excitation and a common initialization, exact population regression reproduces the policy-iteration sequence. The same local convergence guarantee therefore applies to off-policy Q-learning at the population level. Simulation results demonstrate the effectiveness of the two proposed algorithms.

comments
31 pages, 3 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.21272 ↗

Concurrent learning (CL) guarantees precise identification of unknown parameters—if data with finite excitation (FE) happens to be collected online. To improve the reliability of CL, this work establishes a mechanism allowing FE-occurrence to be verified a priori: We propose replaying a given training segment in the reference until data with finite excitation is collected online. Provided the training segment fulfills a certain off-line excitation test, FE then occurs in unknown, but finite time. Moreover, we provide an upper bound on the time-to-FE. Even though this bound involves a dependency on the unknown initial Lyapunov-function value, its structure shows that FE occurs in arbitrarily early replay cycles when increasing the control gain; which may motivate employing a high-gain strategy. The theoretical findings are verified on an academic simulation example.

fields
Optimization and Control
pdf ↗ page arXiv:2611.21314 ↗

The Douglas–Rachford algorithm is a classical method for finding a zero of the sum of two maximally monotone operators. In its standard form, both operators are reflected in the same manner and are activated with the same step-size. In this article we break this symmetry by replacing the reflected resolvents by relaxed resolvents, letting the two operators be activated with different step-sizes. We show that this additional freedom is available precisely when the operators are cocoercive, the admissible range of the parameter being determined by their cocoercivity constants and reducing to the classical algorithm when these constants vanish. Within this range we quantify the averagedness of the resulting operator, which yields the weak convergence of the method together with relaxation steps beyond those allowed in the classical case, and, when one of the operators is in addition strongly monotone, a strict contraction. We compute in closed form the parameters minimizing the contraction factor and we exhibit instances attaining it, so that the resulting linear rates are tight. The optimal rates are strictly smaller than the best rates available for the classical Douglas–Rachford algorithm in the monotone inclusion and convex optimization settings, which are studied separately. All theoretical rates are corroborated by the numerical worst cases obtained via performance estimation.

fields
Optimization and Control
pdf ↗ page arXiv:2611.21377 ↗

Modeling large multi-agent systems poses challenges for trajectory inference and parameter identification, as network size and coupling increase computational demands and partial observations require reconstructing unobserved states. We propose MAS-PINN, a neural-network architecture with a tailored training algorithm for a physics-informed learning framework that leverages the network topology and the agents' similarity to reduce computational and memory costs of simulating and identifying multi-agent systems. Its architecture represents agent trajectories through shared temporal features and agent-specific coefficients. Training alternates between learning features, fitting coupled trajectories, and estimating physical parameters. A matrix-free update exploits local interactions to fit trajectories without forming large global matrices. Experiments on Lorenz rings, Lotka–Volterra networks, and Rössler oscillators show improved trajectory and parameter accuracy over baselines, including inference in large systems and identification under partial observations or unknown topology, alongside substantial computational savings in coefficient fitting.

fields
Optimization and Control
pdf ↗ page arXiv:2611.21404 ↗

We study Bregman primal–dual proximal methods for conic linear programs (LPs). For problems involving non-polyhedral cones, Bregman distances lead to generalized projections that are often simpler than Euclidean projections. In this paper, we reformulate conic LPs as equivalent exact-penalty problems over truncated cones, and use self-dual embeddings to construct such formulations systematically. This approach yields Bregman proximal methods with simpler subproblems and convergence guarantees over bounded domains. We also study line searches for the Bregman primal–dual hybrid gradient and extragradient methods applied to self-dual problems. For logarithmically homogeneous kernels, the Bregman distances from the starting points are unbounded on the truncated cone, and the classical ergodic bounds do not apply. For these kernels, we derive convergence rates for the exact-penalty objective at the averaged iterates of both methods. Numerical experiments with nonnegative trigonometric polynomial optimization and sparse semidefinite optimization indicate the potential of this framework as a general-purpose approach for incorporating efficient Bregman projections in conic linear optimization.

fields
Optimization and Control
pdf ↗ page arXiv:2611.21427 ↗

Weight-space programming removes the thinking loops of a small reasoning model by a rank-one edit W' = W + u v^T of an MLP output matrix, where u is a loop direction and v is the solution of a sparse Linear Program (LP) over the neuron activations. We investigate whether the LP is needed. We replace it by a sort: we take the 8 neurons whose activation has the smallest coefficient of variation, and give them equal shares of the push that the LP solution realizes. On Qwen3.5-0.8B the sorted edit scores 67.0% on 1000 problems (MATH-500 and GSM8K) against 67.4% for the LP edit and 9.5% for the unedited model; the paired difference is -0.4 points, with 95% confidence interval [-2.9, +2.1], inside a non-inferiority margin of 5 points declared before the runs. On three further sampling seeds the difference is -0.6 points, interval [-2.0, +0.8], and -0.8 points, interval [-2.3, +0.6], when the dose is set without the LP. The sort does not solve the LP, but the neurons it shares with the LP solution carry most of its mean push. The outcome is that, on this model, the edit acts as a nearly constant bias along u.

comments
4 pages, 3 tables. Data, code and protocols: https://doi.org/10.5281/zenodo.24286137
fields
Optimization and Control
pdf ↗ page arXiv:2611.21432 ↗

This paper develops a decentralized event-triggered topology-switching protocol that allows agents to disconnect from the communication network while preserving state safety and excluding Zeno behavior. We establish a robust barrier function condition that guarantees safety as long as the estimation error remains within a prescribed threshold. Each agent uses locally computable certificates to determine when to connect and disconnect from the network. The certificate construction improves scalability by reducing the complexity of topology-dependent computations from $O(2^N)$ to $O(N)$, where $N$ is the number of agents. We formally prove that the protocol ensures the estimation error does not exceed the prescribed threshold and is non-Zeno. An alternating method computes an error-weighting matrix and a quadratic barrier function that guarantee safety under the proposed protocol. Finally, we evaluate the protocol on four interconnected microgrids. Compared with maintaining network connectivity at all times, the protocol reduces the time agents remain connected while keeping phase and frequency within their safe operating region.

fields
Optimization and Control
pdf ↗ page arXiv:2611.21513 ↗

Convex relaxations of energy storage models drop the complementarity constraints that forbid simultaneous charging and discharging. In the set-point tracking problem, the relaxation can then charge and discharge simultaneously at no cost, as the tracking error depends only on the net power of the storage. We show that the convex hull of the single-period epigraph of the tracking error, under complementarity, is the epigraph of a parabolic cylinder. The resulting second-order cone inequality adds to the tracking error a penalty on the product of the charging and discharging powers and is the tightest convex member of the pencil of quadrics through the two branches of the epigraph. With power limits and the mode variable, the hull is given by the perspective reformulation of the two modes, which dominates the cylinder. In 20000 instances, the cylinder reduces the hours with simultaneous charging and discharging by more than 99% and yields an optimal schedule in 98.8% of them.

comments
3 pages
fields
Optimization and Control
pdf ↗ page arXiv:2611.21526 ↗

Long-term planning of energy system transitions is complex due to interdependent investment decisions and uncertain market and policy conditions. Stochastic optimization models account for this uncertainty by identifying a single optimal hedging strategy. However, the flexibility in technology choice and investment timing, i.e., the transition flexibility, usually remains unexplored. Modeling to generate alternatives (MGA) explores near-optimal solution spaces but has not been coupled with stochastic optimization to quantify the transition flexibility. We explore the low-regret pathway space, i.e., all transition pathways that stay within a chosen regret tolerance in every scenario. We introduce a termination criterion for MGA that bounds the exploration error in high-dimensional solution spaces and measure how far each pathway decision, once taken, narrows the capacity ranges of the others. We apply the method to an industrial energy system in Germany. The pathway that minimizes the worst-case regret keeps it at 2.2%, compared with up to 30.9% for perfect-foresight pathways. The transition flexibility increases most at low regret tolerances. At 3.5%, the capacity ranges are on average about 60% as wide as at the highest regret tolerance of 10%. A large share of these capacity ranges is surplus capacity, i.e., capacity installed in addition to, not instead of, other capacity. Surplus capacity is largely not operated but, once installed, narrows the other capacity ranges more strongly than operated capacity. Exploring the low-regret pathway space, rather than reporting a single optimal pathway, therefore is the more informative basis for planning energy system transitions under uncertainty.

comments
45 pages, 13 figures, 2 tables, plus 40 pages of Supplementary Information
fields
Optimization and Control
pdf ↗ page arXiv:2611.21531 ↗

In general, linear-span first-order methods add at every iteration a combination of all observed gradients to the previous iterate. However, many methods of interest can be implemented in a way that requires storing only a few auxiliary vectors, instead of all past gradients. We call such methods limited-memory first-order methods. A given fixed-coefficient first-order method can be described by a lower triangular coefficient matrix, which expresses each step as a combination of previous gradients. We show that the minimum number of running sums required to implement a method is equal to the minimum rank of a completion of the strict lower triangular part of its coefficient matrix, and propose a reconstruction algorithm. Moreover, taking the $H$-dual of a method, which reflects the coefficient matrix across its anti-diagonal, preserves its memory and translates into a permutation and time-reversal on the coefficients of the running sum recurrences. We apply our results to two optimized first-order methods for smooth strongly convex functions. First, our reconstruction applied to a method numerically designed by Shu and Wang reveals a recurrence with one auxiliary vector, which is related to the Triple Momentum Method (TMM) of Van Scoy, Freeman and Lynch with a particular initialization. We prove that the reconstructed method, called TMM-GD, is minimax optimal at every horizon for the final distance to the minimizer relative to the initial gradient norm. Second, the Information-Theoretic Exact Method (ITEM) of Taylor and Drori, optimal for the final distance relative to the initial one, is known to be memory one. We give an explicit recurrence with one auxiliary vector for its $H$-dual, called ITEM-GG, and prove that ITEM-GG is the unique minimax optimal nonadaptive linear-span method for the final gradient norm relative to the initial one.

fields
Optimization and Control
pdf ↗ page arXiv:2611.21611 ↗

Mathematical Physics65

Fixed measurements for multiparameter pure-state metrology must remain informative without knowing the input state. We quantify this requirement by the Fisher floor, the smallest fraction of the quantum Fisher information that a measurement retains over all pure states and tangent directions. We determine the Fisher guarantees, namely lower bounds on Fisher floors, implied by projective design order alone in every dimension $d\ge 2$. These guarantees are sharp at order $t=2$ and every odd order $t\ge 3$, and finite weighted designs attain them; at even orders, our bounds are nearly tight. As the order increases, the guarantees approach one half, the single-copy quantum limit. Sampling and spectral completion of any 3-design yield, with probability $1-O(1/d)$, a measurement with linearly many outcomes and a dimension-independent Fisher floor. Such a measurement separates all pure states in Hellinger distance, so pure-state maximum-likelihood estimation from $N$ copies attains mean infidelity $O(d/N)$ uniformly over pure states, optimal up to a universal constant factor.

comments
17+37 pages, 8 figures, 3 tables; comments and suggestions are very welcome! See also "Near-Optimal Multiparameter Pure-State Metrology with a Constant Number of Bases"
fields
Mathematical Physics
pdf ↗ page arXiv:2611.17288 ↗

In this paper Bäcklund transformations of the fifth Painlevé equation are discussed. The Bäcklund transformations are applied to rational solutions of the fifth Painlevé equation, which are expressed in terms of the generalised Laguerre polynomials and generalised Umemura polynomials. Using appropriate Bäcklund transformations, we derive non-unique solutions of the fifth Painlevé equation in terms of modified Bessel functions. Further it is shown that there are also rational solutions in terms of generalised Umemura polynomials for the same values of the parameters, which are not special cases of the modified Bessel function solutions. The relationship between solutions of the fifth Painlevé equation and solutions of the third Painlevé equation is also discussed.

comments
27 pages, 1 figure
fields
Mathematical Physics, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.18335 ↗

We investigate the interplay of observables and symmetries in the framework of causal fermion systems (CFS). We show that position observables transform covariantly under unitary symmetries and for static CFS we derive their Heisenberg-type evolution. To give these results a geometric interpretation, we establish conditions under which spacetime isometries induce symmetries of CFS constructed from solutions of the Dirac equation. The crucial link is provided by the Dirac equation itself, which relates the infinitesimal generators of the geometric and CFS symmetries. In static spacetimes, this allows us to identify the generator of the induced unitary symmetry with the spatial Dirac Hamiltonian.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.18821 ↗

The Bagci-Hoggan exponential-type orbitals, the generalization of Coulomb-Sturmians to noninteger quantum numbers, were recently identified as d-dimensional Coulomb-Sturmians. In the present study, this identification is treated in detail. The radial differential equation for these orbitals is derived directly from their closed form. It represents the general Coulomb-Sturmian differential equation for quantum numbers with real values. The solution is verified through a power series representation and a first-order matrix form based on the Green's function of the radial Laplacian. New transformation relationships between these orbitals and Slater-type orbitals with noninteger principal quantum numbers are established. The radial differential equation is expressed in terms of the radial momentum operator. The expectation values of the position and radial momentum operators are obtained in closed form. The radial and Heisenberg uncertainty products, the Shannon entropy and the Fisher information are derived in general form.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.18823 ↗

We prove optimal Frobenius Lieb-Robinson bounds for power-law systems with power-law exponent $α$ in any dimension $d$, in particular showing that the algebraic to linear light cone transition occurs at $α=d+1$. The proof uses a spectral clipping method and concentration result to allow for running a multiscale operator-norm argument which produces the optimal Frobenius norm exponent. Additionally, we prove there is a Frobenius light cone transition from polylogarithmic to algebraic at the summability threshold $α=d$, and a transition from decaying in volume to non-decaying in volume at $α=d/2$.

comments
23 pages, 3 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.18829 ↗

We study the asymptotic stability of axisymmetric gravitational perturbations of the near-horizon geometries of (near-)extremal Kerr black holes and consider the family of backgrounds in which the AdS$_{2}$ factor of NHEK is deformed by a Schwarzian mode. Requiring the Killing parameter to be local in the background makes the Gelfand–Dikii polynomials natural solutions of the Killing equation, and that locality requirement brings stationary solutions of the Korteweg-de Vries equation. The hierarchy selects a family of backgrounds, which remain $\mathfrak{sl}(2,\mathbb{R})\times \mathfrak{u}(1)$ throughout them: the first level gives NHEK and near-NHEK, the second, solitons that depart from one of these geometries and return to it. We linearize Einstein's equations around this family, where the axisymmetric sector reduces to a wave equation on the nearly-AdS$_{2}$ base, and analyze this equation by energy and virial methods. For NHEK we obtain a conserved energy, an integrated local energy estimate and asymptotic stability in a weighted norm; for a nonconstant Schwarzian the energy becomes a Lyapunov functional whose monotonicity is dictated by the sign of its derivative, yielding uniform bounds for integrable ones, and mild local decay along the KdV soliton. We also find a monotone horizon-localized norm, which is not of Aretakis type, showing that stability properties are directly sensitive to the near-horizon structure encoded in the Schwarzian background. We compute the associated Regge–Teitelboim charges at a late-time corner of the throat using a radial ADM foliation of the spacetime.

comments
50 pages, 2 figures
fields
Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2611.18922 ↗

Whether a trained quantum generative model has learned its target is usually decided by a diagnostic validated on a labeled benchmark, and such a diagnostic can pass that validation by recovering how the benchmark was built. We analyze Fisher-trace and kernel-based certification of the real-amplitude quantum circuit Born machine in noiseless statevector simulation. For real-amplitude circuits built from half-angle rotations, the classical Fisher information equals the quantum Fisher information almost everywhere, so its trace equals the parameter count and carries no information about fit quality. The Fisher eigenvalue rank counts the live nodes of the amplitude tree: it coincides with the label on a sparse benchmark and is uninformative on a full-support one. The pooled Wasserstein and maximum-mean-discrepancy scores move with optimizer convergence and with the scoring convention. For two bitstring defect families on which both metrics have closed forms, we compute the tolerance-mismatch window in which the discrepancy rejects generators that the transport threshold admits; it opens only at certification-grade tolerances and closes as the qubit number grows. On the Hamming cost we prove a sharp tolerance ratio above which the discrepancy vote is redundant, and we obtain the exact worst-parity minimax value over all unit-diagonal positive-semidefinite kernels, which is exponentially small in the qubit number. In a numerical campaign at the tolerances a near-term experiment can resolve, the discrepancy vote changed no verdict at a thousand shots or more. The false-pass guarantee does not extend to device noise.

comments
35 pages, 7 figures, 14 tables
fields
Mathematical Physics
pdf ↗ page arXiv:2611.18955 ↗

Atomistic-continuum simulations of complex wrinkling deformations in large-area multilayer two-dimensional (2D) materials are computationally expensive. To accelerate these simulations, this work presents a machine-learning (ML) framework that first constructs a low-dimensional representation of the deformation field, then learns the deformation in this reduced space. Dimensionality reduction of deformed 2D membranes is challenging because of the extremely high dimensionality of discretized deformation fields, the need to preserve surface continuity and prescribed geometric constraints, the stochastic nature of wrinkling patterns, and the limited availability of training data. We address these challenges using two-dimensional functional principal component analysis (FPCA). The proposed FPCA representation reduces deformation fields containing millions of degrees of freedom to latent spaces with only tens of dimensions while preserving the continuity of the deformed surface. In addition, prescribed homogeneous boundary constraints are satisfied exactly through an appropriate choice of basis functions in the FPCA representation. A neural network is then trained to predict the principal components from the system and loading parameters. The resulting ML-predicted deformation fields are used as high-quality initial configurations for the atomistic-continuum solver, which subsequently performs energy minimization to obtain equilibrium solutions. The framework is demonstrated for multilayer graphene subjected to uniaxial compression, biaxial compression, and combined biaxial compression and simple shear. For the most computationally intensive large-strain cases, the proposed approach achieves speedups of at least 6.8 times while converging to final energies comparable to, and in some cases lower than, those obtained using conventional atomistic-continuum initialization.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.18961 ↗

We study Einstein's nonsymmetric metric-affine Lagrangian density with a generally nonsymmetric metric and an affine connection treated as independent variational variables. The resulting connection equation belongs to the classical Einstein–Hlavatý–Tonnelat framework, while the unrestricted metric Euler–Lagrange equation is analyzed without a divergence constraint on the antisymmetric metric density. Its symmetric part takes the form of Einstein-type gravitational equations with geometrically induced source terms and reduces to the vacuum Einstein equations in the torsion-free limit. The antisymmetric part becomes a geometric constitutive relation based on the irreducible decomposition of torsion. Its contracted four-divergence yields a general vector-field equation with geometric source and response terms. Under a trace–axial reduction, $Q=0$ gives a source-free Maxwell-type equation, whereas constant nonzero $Q$ gives a Proca-type equation. Independently, a trace of the generalized Bianchi identities yields the homogeneous Maxwell-type pair associated with the torsion trace, while the connection equation implies a Lorenz-type condition. Thus gravitational, constitutive, Maxwell–Proca-type, and Lorenz-type structures arise as compatible consequences of one metric-affine variational system. The antisymmetric dynamical level is generated by the contracted four-divergence of its constitutive level. No independent electromagnetic or matter field is introduced.

comments
19 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.19001 ↗

We use the projected spin-1 Duffin–Kemmer–Petiau (DKP) equation in $2+1$ dimensions to clarify the physical content of the irreducible $3\times3$ representations. The projected antisymmetric tensor is algebraically dual to the projected vector, and the two twin representations select conjugate self-dual covariant-curl sectors, which reduce to opposite massive helicities in the flat-space limit. We then apply this structure to the static wormhole problem previously studied with a single irreducible representation. The first-order radial DKP system contains an exceptional normalizable bound-state branch at $ω^2=M^2$ that is absent from the master-variable reduction, whereas the generic master and circular sectors are related by a Darboux transformation. The latter preserves the transmission and reflection probabilities, while the quasinormal modes are organized into two pole families in the complex radial-momentum plane, leading to the physical pairing $(ω,-ω^*)$ rather than a global $\pmω$ prescription.

comments
14 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.19058 ↗

We extend the dictionary between stochastic quantization and holographic Wilsonian renormalization to Yang-Mills theory in four-dimensional anti-de Sitter space at tree level. The radial component of the bulk gauge field is Zwanziger's gauge-fixing function; radial gauge is Parisi-Wu quantization, whose random walk of gauge modes is the longitudinal bulk propagator. We obtain the triple- and quadruple-trace couplings of gluons at finite cutoff in closed form. On transverse data, their dependence on the bulk gauge resides in a single zero mode, which drops out of the flat-space limit.

comments
5 pages, 1 table, companion paper: arXiv:2611.16074
fields
Mathematical Physics
pdf ↗ page arXiv:2611.19083 ↗

We consider the problem of a conditional extremum of an action within a class of fields constrained by differential equations. For this setup, we establish the interconnection between the gauge symmetry algebra of the equations constraining the admissible fields and that of the action restricted to this class of fields. Based on this relation between the two gauge algebras, we derive an extension of Noether's second theorem and its converse. The general method is illustrated by the example of linearized gravity with the Einstein-Hilbert action and the class of admissible metrics restricted by the Cotton equation.

comments
12 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.19097 ↗

In this work we first revisit the Hooke-Newton duality and its generalisation to arbitrary power laws in classical and quantum mechanics. We then consider Wigner-Yang quantum mechanics on the real line, which is a deformation of standard Heisenberg-Schrödinger quantum mechanics closely related to Dunkl's differential-difference operator formalism. We consider the corresponding eigenvalue problem for the harmonic potential and a Coulomb-like potential. We observe that the Hooke-Newton duality is also applicable to these deformed quantum systems allowing us to solve the eigenvalue problem of one by mapping it onto the other system. This approach is then generalised to arbitrary power-law potentials in Wigner-Yang quantum mechanics. Whereas in standard quantum mechanics the classical re-scaling of angular momenta has to be applied to Langer-modified quantum angular momenta, Wigner-Yang quantum mechanics requires a rescaling of deformation parameters similar to the Langer-type modification but involving the reflection operator. The energy coupling-constant exchange, however, remains the same in all three cases, classical mechanics, quantum mechanics and Wigner-Yang quantum mechanics.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.19246 ↗

Quantum channels (in discrete time) and Gorini–Kossakowski–Sudarshan–Lindblad (GKSL) master equations (in continuous time) are the central tools of open quantum systems, but they rest on memoryless approximations (Born, Markov, secular) that fail in many physically relevant settings, most notably non-Markovian dynamics. There, tracking the state alone is insufficient: interventions at intermediate times disturb the environment, so multi-time correlations carry physical information that the state evolution cannot capture. The framework of higher-order quantum operations addresses this by treating controllable operations as \textit{inputs} to a process that maps operations to operations, so that the primitive object is a quantum \textit{dynamics} rather than a quantum \textit{state}. Here, we derive the most general continuous-time, CP-divisible evolution of such an object, the \textit{quantum comb master equation} (QCME), which governs the quantum ``dynamics of dynamics''. Its GKSL-like generator includes encoder–decoder correlation terms coupling distinct temporal interventions. A generalized Born–Markov coarse-graining derivation identifies microscopic conditions for this structure. The QCME yields time-local evolution equations for two-time correlators beyond reduced-state dynamics and extends to more times. We show correlations between Schr"odinger- and Heisenberg-picture evolutions inaccessible to independent GKSL equations, describe quantum-channel evolution motivated by process tomography, and obtain time-local equations for linear response functions and OTOCs under environmental influences.

comments
46 pages, 26 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.19265 ↗

We study the helium anion in the nonrelativistic Coulomb model with an infinitely massive nucleus and spin-$\frac12$ electrons. We prove the absence of binding, with $E^{\mathrm{F}}(3,2)=E^{\mathrm{F}}(2,2)$ and no three-electron ground state. A decomposition relative to the helium ground state and completion of the square reduce the problem to a one-dimensional variational inequality.

comments
22 pages
fields
Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2611.19370 ↗

We show that certain geometric constructions, including the Fefferman-Graham ambient metric, Brinkmann spaces, and ultrastatic vacuum spacetimes, admit natural conformal compactifications and can be unified within a single framework arising naturally from conformal geometry. The framework is based on a two-scale system comprising two weight-one conformal scalars satisfying almost-Einstein equations and certain regularity conditions. As a particular instance of this unifying framework, we obtain a new ambient construction for Spi and Ti, the extended spatial and temporal infinities of Ricci-flat spacetimes. A remarkable feature of this construction is that Spi/Ti and the null infinity of the corresponding spacetimes are naturally realised as a boundary face and the corner of the two-scale ambient space, respectively. We also demonstrate how the two-scale system can serve as a background ambient geometry for studying the asymptotic behaviour of (gauge) fields at spatial, temporal, and null infinity.

comments
40 pages, 1 figure
fields
Mathematical Physics
pdf ↗ page arXiv:2611.19377 ↗

We construct Baxter $Q$-operators for a family of quantum cluster integrable systems, that we call the flavored Toda chains, associated with quivers $\mathcal{Q}_N[F]$, where $F\subseteq\{2,\dots,N\}$ specifies data of $\vert F \vert$ additional nodes compared to $\mathcal{Q}_N[\varnothing]$ for the ordinary $N$-particle open $q$-deformed Toda chain. A distinguished sequence of quantum cluster mutations yields an ordered product of Faddeev's quantum dilogarithms. We prove that these operators form a commuting family and that their shifted quotients are transfer matrices whose coefficients are commuting Hamiltonians. We identify these transfer matrices with matrix elements of products of explicit local Lax matrices of rank two. Local cluster transformations move flavor insertions along the chain while preserving their ordered flavor parameters and the transfer matrix together with the canonical transformation. We also derive integral kernels for the $Q$-operators and evaluate an associated Fourier transform as a factorized scalar $Q$-function. Finally, we relate the quivers to the BPS quivers of five-dimensional $\mathcal{N}=1$ gauge theories in the decoupling limit and identify the normalized scalar $Q$-function with the perturbative contribution of a canonical codimension-two defect wrapping a squashed three-sphere.

comments
29 pages, 7 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.19436 ↗

We present a mechanism for obtaining Hilbert-space fragmentation from arbitrary quantum lattice Hamiltonians acting on finite-dimensional local spaces. We first express the Hamiltonian in an algebraic form using supersymmetry (SUSY) and parasupersymmetry (paraSUSY) generators. Enlarging their representations defines a lifting procedure, which we study in two forms, site-wise and bond-wise lifting. Site-wise lifting introduces immobile zero modes that generate exponentially many invariant sectors while retaining the original dynamics in the fully active sector. We determine the sector structure and establish strong fragmentation for uniform lifts at fixed intermediate zero-mode density. For nearest-neighbor chains, correlation functions reveal restricted propagation and, in the mixed-field example, persistent local memory. Bond-wise lifting produces mobile conserved strings, pair-flip dynamics and fluctuating dimers, and extends to fragmented unitary circuits. Different representations and embeddings realize different fragmentation mechanisms. Some of the fragmented models obtained by this method include lifted permutation and Ising spin chains, a lifted toric code, the \(XXC\) families of spin chains, and fragmented extensions derived from the integrable \(H_{1,11}\) and \(H_{1,3}\) seed densities. The last two models are derived from Hietarinta's classification of constant $4\times 4$ Yang-Baxter solutions.

comments
35 pages + Appendices, 9 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.19470 ↗

We investigate vacuum black-hole solutions in metric-affine Myrzakulov $F(R,T)$ gravity (MG-I), where $R$ is the affine Ricci scalar and $T$ is a quadratic torsion invariant, not the trace of the matter energy-momentum tensor. For the polynomial model $F(R,T)=αR+βT+γT^3$, with $α\neq0$, we first vary the metric and all components of the independent affine connection, and only then specialize to metric-compatible geometry with totally antisymmetric torsion. Nonzero axial torsion admits an exceptional branch $α+β+3γT_*^2=0$, on which the metric satisfies the Einstein equations with effective cosmological parameter $Λ_*=γT_*^3/α$. We establish a local existence result and construct torsionful Schwarzschild-(anti-)de Sitter representatives that are smooth through a selected future Killing horizon. Within the spherically symmetric axial ansatz, we characterize Ricci-symmetric affine connections by the condition $(fV-U)'=0$ and compare a constant-$W=fV-U$ family with a constant-$U$ family. Although these connections share the same metric and torsion scalar, their affine curvature invariants generally differ. Independent coordinate-level curvature contractions and component tests of the unrestricted metric and connection variations corroborate the identities used in the construction; these checks complement the analytic variational derivation. Finally, we identify null directions of the restricted axial quadratic form and distinguish this degeneracy from a complete metric-affine stability analysis. Our conclusions are local and do not establish global extendibility, physical inequivalence of all torsion profiles, or dynamical stability.

comments
49 Pages, no figure
fields
Mathematical Physics
pdf ↗ page arXiv:2611.19500 ↗

The four-dimensional Chern-Simons theory coupled with surface defects is known to realize two-dimensional integrable quantum field theories (QFTs). We discuss the renormalization group (RG) flow of such two-dimensional integrable QFTs from first-principles Feynman diagram computations intrinsically in the four-dimensional framework. We first derive the one-loop RG flow of two-dimensional QFTs realized by the four-dimensional Chern-Simons theory on $Σ\times C$ coupled with the order surface defects supported on $Σ$. Here, the affine Kac-Moody symmetry of the defects underlies the one-loop RG flow. We then derive the one-loop RG flow of the principal chiral model (PCM) without Wess-Zumino term, which is realized using disorder surface defects, within the Batalin-Vilkovisky formalism. We obtain the nontrivial one-loop RG flow of the PCM, reproducing its known asymptotically-free beta function, using two complementary methods: by explicitly evaluating one-loop Feynman amplitudes, and by computing an analogue of analytic torsion for four-dimensional Chern-Simons theory.

comments
70 pages, 3 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.19517 ↗

We prove Nakamura's conjecture on the relation between the 2D Toda model and solutions of the Ernst equation, using the Pfaffian solutions obtained in our previous work arXiv:2610.27420.

comments
19 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.19558 ↗

We propose quantum sine imaginary-time evolution (QSITE), a quantum algorithm for preparing ground states of a Hamiltonian. QSITE approximates imaginary-time evolution through an exact sine filter. We give two circuit implementations of this operator: a sequential one that applies it as a concatenation of linear combinations of unitaries (LCU), reusing two ancilla qubits across steps via mid-circuit measurement, and a coherent one based on the quantum singular value transformation (QSVT). A telescoping identity shows the two prepare the same state and succeed with identical probability, differing only in how that probability can be boosted. QSITE belongs to the family of ancilla-based probabilistic imaginary-time filters and we state rigorous convergence guarantees: we prove that the QSITE operator converges uniformly to the exact ITE operator, that the prepared state converges to the ideal ITE state, and that the filter probability increases monotonically with each concatenation step. Although the construction applies to an arbitrary Hamiltonian, we specialize it to optimization Hamiltonians, and this specialization is what exposes its structure more easily. Since MaxCut eigenvalues are integers, the probability of failure is periodic in the evolution time, yielding safe zones, the first located analytically and the second numerically. For MaxCut we further show that, when the tolerated energy error is a fixed fraction of the ground-state energy, the probability of failure can be bounded below 1/2 with concatenation steps growing linearly with the number of qubits in the first safe zone. We present numerical results for random Erdös-Rényi instances with up to 24 qubits and benchmark QSITE against QAOA.

comments
41 pages, 19 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.19605 ↗

We establish a formal correspondance between the Appell-type hypergeometric polynomials $\widetilde{e}_n$, rectently introduced in [1], and the exact solutions od the radial Schrödinger equation for a family of Mie-type potentials. Using the Nikiforov-Uvarov (NU) method, we show that the radial equation reduces to an hypergeometric differential equation with a parameter $N$, which plays the role of an effective principal quantum number. A careful analysis of th asymptotic behavior of the solutions reveals a dual structure: the confluent hypergeometric function of the second kind $U$ yields square-integrable bound states, for which the condition $N\in \mathbb{N}$ provides a quantization condition of Diophantine type, and a discrete energy spectrum. In contrast, the generalized Laguerre function $L$, of a certain type, yields non-normalizable scattering states. In the particular case of vanishing angular momentum $(l=0)$, these scattering stetes truncte into the Appell-type polynomial $\widetilde{e}_n$, which thus characterize the s-wave scattering of the Mie-type potential. This work therefore provides a unified algebraic framework for both bound and scattering states, and clarifies the physical scope of the Appell-type polynomials.

comments
20 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.19622 ↗

We provide the asymptotics for high energy regime of the spectral action associated with the extensive quantity describing the average number of particles of a gas of free particles in thermal equilibrium. We analyse the case of massless particles (the massive non relativistic case being easier and well known) living in a finite volume manifold of arbitrary dimension, and subjected to periodic boundary conditions (i.e. the d-dimensional torus), obeying Bose, Fermi and Boltzmann statistics. We also treat in full generality the case of relativistic massive particles, which is more difficult and presents the appearance of a logarithmic term when the dimension of the underlying manifold is odd. The situation relative to massless and relativistic massive particles living on the 3-sphere is also studied, showing that, even in this case the asymptotics relative to the massive relativistic particles presents an analogous logarithmic term.

comments
32 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.19648 ↗

We apply a geometric formulation of Newtonian dynamics to inviscid compressible geophysical flow, with gravity and the effects of rotating or moving coordinates incorporated in the metric tensor. This construction relies on the introduction of an auxiliary fifth coordinate, which allows mass and momentum transport, internal energy, and pressure work to be combined into a single mass–momentum tensor. The covariant divergence of this tensor leads to the continuity equation for mass density, the three momentum equations, and the thermodynamic equation, with the system closed by an equation of state. A time-independent metric also yields conservation of total energy. We recover familiar forms of the equations and illustrate the construction in rotating spherical and terrain-following coordinates. The thin-shell and spherical-geopotential approximations, with constant effective gravity, simplify the metric while retaining vertical gravity and the traditional Coriolis terms. Emphasis is placed on the connection between the geometric structure of the formulation and the equations commonly used in atmospheric dynamics.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.19685 ↗

We prove Thouless's bandwidth conjecture for the critical rational Harper operator: the denominator times the total bandwidth tends to $32G/π$, uniformly in the reduced numerator, where $G$ is Catalan's constant. We identify a universal limit of the normalized even coarea density. Positive real part and evenness give an integrable endpoint bound, so the local law determines the bandwidth. An exact finite-matrix formula reduces the local law to one normalized period for each fixed odd numerator. Explicit boundary polynomials, point blowups, and intersections determine a compact genus-one family. Nodal-annulus calculations fix its period equation and hence the universal density. An exact rational Fourier identity and uniform closed-path bounds extend the result to all reduced numerators and both denominator parities. The singular matrix limit, including its subtraction and normalization, is proved separately in detail.

comments
71 pages
fields
Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2611.19723 ↗

We consider the $ι$quiver algebras of split type associated with the quiver BPS algebras of affine type A. They are supposed to give twisted affine Yangians and (elliptic) $ι$quantum toroidal algebras that could possibly arise from D-branes on $\mathbb{C}\times\mathbb{C}^2/\mathbb{Z}_n$ with orientifolds. We mention some properties of these algebras, such as the minimalistic presentations in the rational cases and the coideal structures. We also investigate how one might identify these algebras from the quiver theories with orientifold actions. Moreover, we discuss some representations with combinatorial bases of these algebras. In particular, the algebras with $n=1,2$ in certain limits of the parameters have representations labelled by (coloured) strict/symmetric partitions, which in the case of $n=1$ recovers the known BPS counting of certain theories.

comments
66 pages
fields
Mathematical Physics, Representation Theory
pdf ↗ page arXiv:2611.19856 ↗

At strong on-site repulsion, the lowest band of $n$ lattice fermions is the spectrum of the hopping projected onto configurations without double occupancy, $H_\infty=P_0H_tP_0$. We study its moments, for few fermions in the square-lattice Hubbard model and, where the arguments allow, on any finite graph. (1) For spin-independent Hermitian hopping (no on-site terms) on any $N\geq2$-site graph, $μ_2=\frac{n(N-n)}{N(N-1)}\sum_{i\neq j}|t_{ij}|^2$, for any spin composition. (2) On any finite graph, $μ_4$ is exactly linear in the same-spin pair count, as four hops permute particles by at most a transposition or 3-cycle; for uniform hopping on a simple graph with $N\geq4$ the slope is $α(N,n)=-8C_4(N-n)(8N-11n-2)/[N(N-1)(N-2)(N-3)]$, fixed by the number $C_4$ of 4-cycles. (3) At large finite $U$, the second-order Schrieffer-Wolff correction is Hilbert-Schmidt orthogonal to $H_\infty$ on every triangle-free graph, so the band variance has no $1/U$ term; its $U^{-2}$ coefficient, an exact trace checked by exact diagonalization, is negative at the low fillings computed. (4) Under a Peierls flux, the exchange slope $α(N,2,Φ)=-\frac{64}{N-1}\cosΦ_\square$ ($L\times L$ tori, $L=3$ or $L\geq5$) carries the ordinary charge-$e$ harmonic, while the doublon (bound-pair) hopping acquires a doubled phase, $t_de^{2iA_{ij}}$: the second-order single-doublon Hamiltonian is exactly $π$-periodic ($h/2e$) under a boundary twist, and the exact two-electron U-band follows numerically, up to $O((2λ)^L/U^{L-1})$. Result (1), the permutation bound, the orthogonality in (3) and the doubled phase are machine-checked in Lean 4. Repulsive binding and the pair charge $2e$ are known; new are the exact moment structure and the derivation of the doubled phase. We make no claim about many-pair phase stiffness, off-diagonal long-range order or superconductivity.

code
github.com/zhineos/hubbard-spectral-moments ∎ Lean project (lean/lakefile.toml, lean/lean-toolchain) builds, no sorry at 66d5104, checked 2026-11-17 build details
comments
42 pages, 11 figures, 7 tables; Supplemental Material (notes S1-S12, 142 pages) as ancillary file. Code, Lean 4 formalization and run records: https://github.com/zhineos/hubbard-spectral-moments, doi:10.5281/zenodo.24244237
fields
Mathematical Physics
pdf ↗ page arXiv:2611.19929 ↗

We propose a matrix generalization of the star–triangle relations and identify solutions underlying the $\mathfrak{sl}_n$ chiral Potts models.

comments
16 pages
fields
Mathematical Physics, Quantum Algebra, Rings and Algebras
pdf ↗ page arXiv:2611.20056 ↗

We develop a simple algebraic method for calculating correlation functions in integrable spin chains. We introduce current minors, antisymmetrized products of local conserved charge densities and their currents, and prove that their expectation values are determinants of density and current mean values. Decomposing local operators into current minors, we derive factorized formulas for correlation functions in terms of current mean values, valid in any nondegenerate eigenstate. Applying the method to the spin-$1/2$ XXZ chain and, more generally, to every representation of the Temperley–Lieb algebra, we prove previously conjectured factorized formulas for short-distance correlation functions.

comments
5 pages + 3 pages of Supplemental Material
fields
Mathematical Physics
pdf ↗ page arXiv:2611.20181 ↗

We present a framework for constructing a single medium that supports infinitely many complete spectral gaps for periodic divergence-form operators, which arise from the transverse electric (TE) polarization of Maxwell's equations. The construction proceeds by inductively inserting a seed medium with a prescribed spectral gap into a thin layer of the unit cell. As a result, we obtain densely many counterexamples to the Bethe-Sommerfeld Conjecture (BSC) for divergence-form operators. Moreover, we prove that the thin-layer construction controls the gap topology: by carefully selecting the seed medium, one can realize a single operator with any prescribed configuration of gap Chern numbers. This is the first of two papers that contains all the fundamental ingredients for the thin-layer induction. In the second paper, we will apply this framework to disprove the BSC for the full three-dimensional Maxwell operator.

fields
Mathematical Physics, Analysis of PDEs, Spectral Theory
pdf ↗ page arXiv:2611.20188 ↗

For a circularly polarized plane wave scattered by a Schwarzschild black hole, the time-averaged energy flow on the side of the horizon facing the wave contains small, sealed recirculation cells. In the main family, pairs of zero circles are born on the axis and slide into the horizon in periodic frequency windows; at higher frequencies further cells appear off the axis. We map the cells for $κ=ωr_s/c\le10$ and show that each is the interference of a background integral with the leading photon-sphere Regge surface wave. A cell can die only at a zero of the circularly polarized field on the horizon, and all sixteen measured deaths are such zeros. A parabolic-cylinder analysis at the top of the potential barrier reduces this to a phase condition with a constant $π/4$ and no fitted parameter; recorded before the measurement, it predicted eight deaths in $6\leκ\le10$ to within 0.012 in $κ$. Electromagnetic duality makes the core of each main-family cell a circle of linear polarization; inside such a cell, flow lines lie on nested tori and close into torus knots of one chirality.

comments
22 pages, 5 figures, 16 tables; the Letter is followed by the Supplemental Material in the same file
fields
Mathematical Physics
pdf ↗ page arXiv:2611.20200 ↗

The question of whether ionizing a system of well-separated atoms requires energy has remained open for decades, even though the answer is, from a physical point of view, obviously positive. The analog question for a system of molecules is even more challenging, partly because the molecular geometry is not known a priori and may change when electrons are added or removed. In this work, we investigate and analytically solve the first problem in the special case of a mixture of hydrogen and helium atoms. As a consequence, the van der Waals law for a system of hydrogen and helium atoms, which was proven in [6] assuming our result, now follows as a corollary without assumptions. Moreover, we prove a new lower bound for the `size' of a stable molecule with several nuclei, which improves upon the lower bounds from [1] with even less assumptions. Using among others this lower bound, we prove that it costs energy to ionize a system consisting of an $H_2$ molecule and a perfectly conducting half-infinite plate, provided that they are well-separated. The long-range asymptotics of their interaction energy was analyzed in [3] assuming our result.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.20206 ↗

We investigate how coupling the local environments of noninteracting qubits into a network changes their late-time entanglement dynamics. Each qubit interacts with a lossy bosonic memory mode, with coherent hopping between memory modes determined by an underlying graph. The initial state contains at most two excitations. We show that the graph spectrum selects the collective modes that survive longest, thereby controlling both the decay and spatial distribution of pair concurrence. At resonance, nonbipartite graphs generically approach a fixed pattern of relative concurrence determined by the Perron eigenvector, whereas bipartite graphs support interference between two equally damped modes. This interference can produce arbitrarily late entanglement revivals when it overcomes the exponential decay of the surviving modes. We derive explicit thresholds separating revival and eventual monotonic decay, and show that loss from two-excitation states can drive the system across these thresholds without changing the graph or the initial one-excitation state. Underlying these results is a general bound on the sector decay rates, $γ_2\ge2γ_1$, valid at arbitrary uniform detuning. We also identify an exceptional equal-rate regime in which coherence between the vacuum and two-excitation sectors contributes to the leading concurrence. Together, these results establish how the topology of a structured dissipative environment and the redistribution of excitations through loss determine the long-time behavior of entanglement.

comments
18 pages, 5 Figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.20309 ↗

We study an exactly solvable non-Hermitian $N$-site Kitaev chain with unequal pair-creation and pair-annihilation amplitudes and vanishing intersite hopping. We show that the chain supports an exceptional point (EP) at which all the many-body energies collapse to zero and the largest Jordan block grows quadratically with $N$. By constructing an explicit positive metric for the associated $N$-dimensional one-body problem which admits an extension to the full many-body Hamiltonian, we demonstrate that this EP collapse can be approached through a continuous quasi-Hermitian path in the parameter space. Further, in a different regime with onsite energies alternating between two unequal positive values, we show that pairing amplitudes of opposite signs can lead to crossings between ground states of opposite fermion parity within a quasi-Hermitian regime. Their accumulation in the thermodynamic limit produces a Lifshitz transition, characterized by particle-/hole-pocket formation, quadratic critical dispersion, and a nonanalytic ground-state energy density. We show that this transition remains separated from the EP boundary and ceases to exist for balanced real pairing.

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

I show that a finite-difference time-domain (FDTD) solver with field variables restricted to the ternary alphabet $\{-1,0,+1\}$ can reproduce nonlinear optical physics quantitatively on both CPUs and field-programmable gate arrays (FPGAs). Building on the general ternary-valued FDTD algorithm, in which each Yee cell stores an integer state that accumulates the discrete curl of neighbouring symbols without being drained, I extend the scheme to inhomogeneous and Kerr media and to Mur absorbing boundaries, without performing any multiplication operations. Dielectric contrast is implemented as a multiplexer, since the difference between ternary symbols takes only a few values, the instantaneous Kerr nonlinearity as a coefficient look-up table and the Mur boundary coefficients as canonical signed-digit shift–add chains. The scheme reproduces the third-harmonic conversion efficiency of a floating-point reference to within $1.4\%$. A symmetry of the governing physics, expressed through the even harmonics forbidden by centrosymmetric $χ^{(3)}$, provides a reference-free self-check for both ternary and floating-point models. The complete solver fits on a small, low-cost FPGA and contains no multiplier anywhere in its datapath, placing nonlinear optical modelling within reach of embedded and autonomous platforms rather than of high-performance computers.

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

We examine the three extended Calogero–Bogoyavlenskii–Schiff (CBS) models introduced by Wazwaz, Alhejaili, and El-Tantawy [Eur.\ Phys.\ J.\ Plus \textbf{141}, 1218 (2026)]. Explicit invertible point transformations map the first model, and generically the second, to the classical CBS equation. The third model is generically equivalent to CBS with an additional spectator coordinate absent from the differential operator. We identify the exceptional parameter regimes and explain the reported exponential dispersion relations through these transformations. These equivalences show that the proposed models do not, in the generic parameter regimes, introduce new point-inequivalent CBS equations or genuine four-variable differential coupling.

comments
We examine the three extended Calogero--Bogoyavlenskii--Schiff (CBS) models introduced by Wazwaz, Alhejaili, and El-Tantawy [Eur.\ Phys.\ J.\ Plus \textbf{141}, 1218 (2026)]
fields
Mathematical Physics
pdf ↗ page arXiv:2611.20495 ↗

In Eliashberg theory of phonon-mediated superconductivity with vanishing Coulomb pseudopotential, the critical temperature $T_c$ marks the linear instability of the normal state. Kiessling, Altshuler and Yuzbashyan (KAY) characterized it through the top eigenvalue of a compact operator on Matsubara-frequency sequences. They proved that $T_c$ is unique at strong coupling and conjectured $T_c<C(λ\langleω^2\rangle)^{1/2}$ for every coupling $λ$, with $\langleω^2\rangle$ the second moment of the normalized phonon spectrum and $C\approx0.1827$ sharp, a bound Leavens stated in 1977 on partly numerical grounds. A preprint by Kondratev, not yet peer reviewed, gives a proof of this bound and of all-coupling uniqueness. We give an independent proof, for every spectrum with finite second moment, based on a comparison principle that is also Kondratev's central step and was proved to first order by Bergmann and Rainer: strengthening the pairing interaction at every Matsubara transfer, strictly at the smallest one, strictly raises the top eigenvalue. At fixed $λ$ and $\langleω^2\rangle$ a single Einstein mode maximizes $T_c$. Convexity of the top eigenvalue in the spectrum gives sharp bounds on $T_c$ by the moments $\intω^nα^2F dω$, $0\le n\le1$, including Leavens's zeroth-moment bound $T_c\le c_0\intα^2F dω$, $c_0\approx0.231$ numerically, optimal at moderate coupling. All bounds persist under a Coulomb pseudopotential with symmetric cutoff. A prefix decomposition of non-increasing vectors proves a third KAY conjecture, not treated in the preprint. The finite-dimensional core, including that conjecture, is formalized in Lean 4, and two computer-assisted proofs independent of the comparison principle confirm the Einstein bound.

comments
23 pages, 2 figures. Lean 4 formalization of the finite-dimensional core, two computer-assisted certificates and all scripts are in the ancillary files
fields
Mathematical Physics
pdf ↗ page arXiv:2611.20496 ↗

We derive Lieb-Robinson type bounds with optimal propagation velocity for shift-coin and split-step quantum walks in rational electric fields. The velocity decays exponentially fast in the period of the field, showing long intervals of suppressed spreading. The proof rests on bounds for the imaginary part of the analytically continued dispersion relation of the electric walk. We show that the infimal Lieb-Robinson velocity coincides with the asymptotic velocity for these walks, while a nonhomogeneous example demonstrates that the two types of velocity need not agree in general. We also obtain an exponential tail estimate on the probability of a walk to lie outside the effective light cone.

comments
27 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.20516 ↗

We develop a field-theoretic implementation of Padmanabhan's principle of invariance under the duality $\mathcal S \rightarrow {L_0^2}/{\mathcal S}$, where ${\mathcal S}$ is the proper length (the action integral along a particle's trajectory) and $L_0$ is a quantum of length. Starting from the particle propagator and its Schwinger proper-time representation, we derive the wave operator associated with the duality transformation in terms of a scalar field, rather than a point particle. The resulting theory is governed by a nonlocal operator involving modified Bessel functions. We analyse the infrared and ultraviolet regimes, demonstrate the recovery of standard Klein-Gordon theory at low energies, and show the appearance of exponential ultraviolet suppression. Our analysis provides a natural extension, to quantum field theory, of Padmanabhan's duality for point particles.

comments
9 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.20731 ↗

We construct local $Z_N$ clock Hamiltonians from Baxter-Fendley chains coupled according to an arbitrary finite oriented simple transverse graph. Bounded edge lengths and vertex degrees give finite-range multispin interactions, with $2d$-site bulk terms on a $d$-dimensional rectangular lattice. For open longitudinal boundaries, an explicit nonlocal unitary transformation decouples the chains and gives a free parafermion spectrum. On rectangular lattices this holds for any combination of open and periodic transverse boundaries. For periodic longitudinal boundaries, neighbouring chain charges fix the closing-bond twists. In each joint charge sector, the energies are sums of the corresponding twisted periodic-chain energies. As an example, we construct a three-dimensional array of chains perpendicular to a Penrose rhombus tiling.

comments
9 pages, 3 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.20874 ↗

We study the large-time asymptotic expansion, the Borel-Laplace transforms and the Stokes phenomenon of the single-orbit term in the Selberg trace formula. By a single-orbit term we mean the contribution from a primitive closed geodesic orbit and its iterations on a compact hyperbolic surface, and its formal large-time expansion is divergent. We prove that the divergent formal series is uniformly $1$-Gevrey asymptotic to the convergent single-orbit term and recover the single-orbit term by a Laplace integral along the positive real axis. Other directions for the Laplace integration are also explored by analyzing the singularities of the Borel transform of this $1$-Gevrey formal series. It turns out that the series obtained by Borel transform is meromorphic on the two-sheeted Riemann surface of $\sqrtξ$, with simple poles corresponding to the resonance spectra of the hyperbolic cylinder. The Laplace transform can be performed along almost every direction on the two-sheeted Riemann surface. Finally, the Stokes structure as the limit of the difference between Laplace integrals along different directions can be computed by a convergent sum of the exponential of resonance spectrum. These results demonstrate the phenomenon that the resurgent structure of a single-orbit term in the Selberg trace formula is reflected by its associated cylinder resonance spectra.

comments
15 pages,1 figures
fields
Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2611.20892 ↗

When constituents copy one another, as in reaction networks, collective behaviour and opinion dynamics, the noise of copying vanishes at consensus and can make a system bistable. More generally this noise vanishes on whole manifolds, along which slower variables keep moving and set the switching rates, yet no general method derives these switching dynamics. Here we reduce slow–fast stochastic differential equations whose fast noise acts in a single direction to a switching diffusion or piecewise-deterministic Markov process (PDMP), using the absorption probabilities of the fast noise in place of an invariant measure, and derive a first-order correction for the finite duration of switches. For the two-species Togashi–Kaneko model the reduction recovers our earlier PDMP, and the correction captures how the stationary composition depends on the timescale separation. In a model of foraging ants with a depleting food source, the hazard of leaving a source rises through every stay, which makes the colony unlikely to leave a source soon after arriving there.

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

The East model is a paradigmatic kinetically constrained spin model in one dimension that exhibits glassy dynamics. This review surveys the progress on the theoretical description of the dynamics of the East model, focusing on the spin time correlation function and the relaxation time. We summarize rigorous results on the super-Arrhenius scaling of the relaxation time in the low-temperature limit. We then present a unified derivation of the Zwanzig-Mori projection-operator formalism for both the fluctuation and domain bases. Within this formalism, an infinite hierarchy of coupled equations for the time correlation function and memory kernels emerges—a structure reminiscent of generalized mode-coupling theory developed for supercooled liquids. We review the analytical approximations obtained by truncating or closing the hierarchy at first or second orders and compare them against Monte Carlo simulations. Although these approaches perform reasonably at moderate temperatures, they universally fail in the low-temperature regime: mode-coupling closure schemes in the fluctuation basis introduce spurious ergodicity-breaking transitions, while truncations in the domain basis discard slower modes and fail to capture the asymptotic divergence of the relaxation time. The loss of analytical tractability beyond second order remains the central obstacle, underscoring the fundamental difficulty of describing hierarchical relaxation even in this ``simplest'' model of glassy dynamics.

comments
13 pages, 4 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.20946 ↗

Scrambling, the process by which initially localized quantum information spreads across an interacting many-body system, is a hallmark of quantum chaos and plays a central role in understanding black hole dynamics. In thermal systems, the chaos bound of Maldacena, Shenker and Stanford limits the exponential growth rate of out-of-time-order correlations to $2π/β$, assuming that time-ordered correlation functions factorize after a dissipation time. Establishing the corresponding rigorous logarithmic lower bounds on scrambling times at arbitrary fixed temperature has remained an open problem, most notably in disordered systems, where the Gibbs state depends on the same random couplings that drive the dynamics. Here we prove such bounds at every fixed temperature for the Sachdev-Ye-Kitaev (SYK) model and for random $k$-local spin systems, without assuming real-time factorization. Our approach uses the operator-size distribution of the square root of the Gibbs state to quantify how local probes modify its structure. This static information bounds the thermal correlator uniformly in time along the edges of its analytic strip in complex time, and analyticity then limits how rapidly scrambling can develop. For both families of models, we prove that with probability tending to one the scrambling time is at least $(1-ε)[β/(2π)]\log N$ for any $0<ε<1$, with the coefficient $β/(2π)$ suggested by the chaos bound. The bound holds for each fixed pair of distinct Majorana modes in the SYK model and for the target average of any fixed single-site source in the spin model. These results place the thermal fast-scrambling timescale on a rigorous footing and show how static properties of the Gibbs state can constrain real-time information spreading.

comments
36 pages, 3 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.20958 ↗

We investigate the bound-state spectrum and confinement thresholds of a two-dimensional electron governed by the Schrödinger–Pauli equation in an inverse-$3/2$ radial magnetic-field profile. The radial problem reduces to the biconfluent Heun equation, but instead of restricting the solution to the quasi-exact polynomial sector, we impose the bound-state condition globally through a spectral Wronskian between the endpoint-selected Frobenius solution and the subdominant asymptotic solution. The resulting spectrum contains continuous nonpolynomial bound-state branches on which the known quasi-exact solutions appear as isolated exact points. In this global description, the polynomial index $N$ remains a termination index within the quasi-exact sector but does not uniquely label the spectral branches. An independent exact analysis of the continuum edge yields spin- and angular-momentum-dependent critical couplings that can lie below the quasi-exact restriction $U_0a>4$, where $U_0$ is the Coulomb-strength parameter and $a$ is the magnetic-profile length scale. These results establish quasi-exact solvability as a set of special analytic points embedded in a broader biconfluent-Heun spectrum with spin- and angular-momentum-dependent confinement thresholds.

comments
10 pages, 4 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.20963 ↗

For the Kowalevski top, we introduce another variable in addition to time variable, and formulate as the two-dimensional model. In this paper, since the results for the genus two full Jacobi inversion problem for the two variables Kowalevski top are already known, we utilize these results in reverse, introducing Kolossoff variables, to derive a more transparent formulation of the genus two full Jacobi inversion problem. Since there are two implicit equations of motion using Kowalevski variables, we derived two explicit equations of motion using Kolossoff variables, which is different from the Kolossoff method to derive only one explicit equation and to use Hamiltonian-Jacobi theory.

comments
9 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.21012 ↗

We obtain an explicit stationary distribution of the matrix Riccati variable—the boundary admittance—for an $N$-channel Schrödinger operator with Gaussian white-noise disorder, in all three Dyson symmetry classes $β=1,2,4$. Uniform absorption regularizes the Riccati dynamics, and the distribution's normalization factorizes into outgoing Kontsevich matrix Airy integrals. This gives a common route to the density of states and the sum of Lyapunov exponents, extending Halperin's scalar solution to coupled channels. Exact finite-$N$ formulas connect two spectral regimes: the Lifshitz tail, including its symmetry-dependent prefactor, and the collective large-$N$ edge. We reduce the $β=4$ and even-$N$ $β=1$ problems to unitary orthogonal polynomials and an auxiliary recursion. Their critical double-scaling limit yields edge profiles on the $N^{-4/5}$ energy scale, governed by a complex Painlevé-I tritronquée solution and a linear auxiliary equation. We conjecture that these profiles describe a universal edge regime of random band matrices.

comments
74 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.21067 ↗

The Dirac equation is the simplest wave equation invariant under the Poincaré group, and was indeed determined by Dirac precisely by requiring this invariance. Moreover it is invariant under dilations of the wave function, as follows by its linear character. It is known that the Dirac equation possesses, besides these, other symmetries, which in this sense are the special part of the Dirac equation's full symmetry. In previous work we have shown that the Dirac equation can be cast in hyperhamiltonian terms. Here we show that the symmetries can also be described in hyperhamiltonian terms.

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

We revisit the group classification of the $(1{+}1)$-dimensional evolution equations $u_t=F(u_n)$ and $u_t+uu_x=F(u_n)$ of arbitrary order $n\geq2$, where $u_n=\partial_x^n u$, and describe the usual point equivalence groups of the two classes. We recover the known contact equivalences between the three second-order equations with seven-dimensional maximal Lie invariance algebras and extend the hodograph construction to points where $u_x=0$. For $n>2$, the dimensions of the contact symmetry algebras distinguish the two classes. We give reciprocal transformations linking the two classes at order three and formulate a nonlocal classification problem. We also classify the extensions of the Lie invariance algebra of the Burgers equation in a wider class of Galilei-invariant equations.

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

We investigate the dependence of the linear stability of elliptic relative equilibria on the mass parameter and eccentricity. Using a periodic matrix Riccati decomposition, we derive explicit analytic curves separating hyperbolic–hyperbolic and complex–saddle spectra. The construction applies to the Lagrangian, Euler–Robe, and $(2+2)$-body families. A Hermitian Riccati factorization also yields an eccentricity-independent sufficient condition for positivity of the associated operators under every unit-circle boundary condition, and hence for hyperbolicity of the monodromy matrix. Finally, we construct an explicit lower bound for the second antiperiodic degeneracy curve by a finite trigonometric test function. This bound agrees with the value and tangent of the degeneracy curve at the circular limit. Together, these results provide analytic descriptions and estimates for distinct spectral boundaries in the stability diagrams.

comments
23 pages, 4 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.21172 ↗

We study correlation functions in the model of coalescing and annihilating random walks on the one-dimensional periodic lattice $\mathbb{Z}_N$. We prove that, for a special class of initial conditions, the $n$-point correlation function can be represented as a linear combination of two Pfaffians of $2n\times 2n$ matrices constructed from $2\times2$ matrix kernels, which in turn can be expressed in terms of two scalar kernels. This is an analogue of the single-Pfaffian form exhibited by correlation functions of the same model on $\mathbb{Z}$, where it serves as a signature of a Pfaffian point process. We derive equations for the kernels and construct their solutions. We also show that a particular example of an initial condition leading to bi-Pfaffian correlation functions is the inhomogeneous Bernoulli point process, which includes a fixed initial configuration as a particular limiting case.

comments
15 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.21186 ↗

In weak lensing, shear and convergence are well studied and have provided a wealth of information about the distribution of matter in the universe. More recently, flexion -- the next term in the multipole expansion of the lensing potential, responsible for the characteristic banana-shaped distortion of lensed images -- has been shown to provide additional constraints on the mass distribution of lensing systems, particularly for galaxy clusters. Here we investigate whether weak-lensing information beyond flexion is similarly useful for lens-mass reconstruction. Using the roulette-amplitude formalism, we construct synthetic datasets for a single SIE lens and for SIE and SIS cluster lenses, with and without simulated Gaussian noise, and perform a least-squares reconstruction of the lens parameters using amplitudes truncated at third (flexion), fourth, and fifth order. As a proof of concept, we find that higher-order amplitudes do provide additional, useful information: the benefit is modest for a single lens, where flexion already constrains most parameters, but becomes substantial for cluster lenses, where the rotation and ellipticity are otherwise poorly recovered. The improvement is most pronounced in the presence of noise, where third-order reconstruction can become unreliable while higher-order amplitudes restore much of the lost accuracy. These results suggest that, as weak-lensing surveys grow in depth and precision, data beyond flexion could meaningfully improve mass reconstruction for the most complex and noisiest lensing systems, motivating further work using observational rather than synthetic data.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.21226 ↗

We construct oscillator realisations of Yangian Lax operators in type $A$, with particular interest in non-factorisable operators associated with prime snake modules. Our construction applies to finite-dimensional skew representations of $Y(\mathfrak{gl}_n)$. We prove that these representations are generated by the tensor vacuum in suitably ordered tensor products of oscillator representations. Their Lax operators are obtained by restricting the corresponding products of linear oscillator Lax operators to these submodules. We determine the vacuum eigenvalues and Drinfeld polynomials, and give a determinant formula for the dimensions directly in terms of the highest loop weights. A $21$-dimensional example illustrates the construction, including an explicit basis and a transfer-matrix identity.

comments
37 pages, 11 figures
fields
Mathematical Physics, Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2611.21333 ↗

In the later seventeenth century, Kepler's ellipse was not yet accepted. Ward claimed that Boulliau's conic hypothesis amounted to a Ptolemaic equant at the ellipse's empty focus, and built his own model on it. Around 1675–1680, Giovanni Domenico Cassini proposed another curve, the ``oval'', a genus-1 quartic with no closed-form Kepler equation; yet its eccentric anomaly shares exactly the leading coefficient of Kepler's, and its empty focus is, for the Sun, 38 times closer to a true equant than the ellipse's. Dynamically, Binet's formula shows that the force producing the oval under the area law departs from the inverse square by an index $\mathcal{D}(e)\sim3/(4e^2)$, depending on the oval's parameter $e$: no single exponent serves the whole family. This absence of universality, not of an area law, distinguishes it from the ellipse, and arguably explains why Cassini, the Académie and Leibniz kept the question open after the \emph{Principia} (1687).

comments
24 pages, 6 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.21336 ↗

We construct a double copy for Carroll gravity as the ``square'' of Carroll Yang-Mills theory at the linearised level. Starting from the convolutional double copy prescription in Lorentzian spacetime, we take the Carrollian limit $c \rightarrow 0$ to establish a double copy dictionary compatible both with symmetries and the corresponding equations of motion. Since this limit yields two distinct sectors, namely the electric and magnetic Carroll theories, we systematically investigate double copy constructions involving all possible combinations of these parent theories. To accommodate the time-independent on-shell configurations of the magnetic Carroll fields, we introduce a suitable regularisation procedure for the convolutional double copy. In addition, the covariance of the double copy under Carroll boosts requires an appropriate dressing of the fields, leading to the inclusion of a Goldstone-type object in the construction. We first develop the formalism using toy models involving scalar fields and then apply it to the double copy between linearised Carroll Yang-Mills theory and Carroll gravity.

comments
40 pages, 8 tables, 1 figure
fields
Mathematical Physics
pdf ↗ page arXiv:2611.21388 ↗

Geometry enters quantum theory in two places. The space of quantum states carries a symplectic form, which generates unitary evolution, and a metric, which governs uncertainties and transition probabilities. The classical phase space acquires a metric of its own when a vacuum is chosen: quantizing a linear system amounts to choosing a compatible complex structure, equivalently a compatible metric $g$. We take this second metric as the primary object and show that it plays, on phase space, the role that the quantum metric plays on the space of states: fluctuations of linear observables are $g$-norms of Hamiltonian vector fields, and along coherent states $g/2\hbar$ \emph{is} the quantum metric. Squeezed states then have a simple description. A squeezed vacuum is the vacuum of another metric, and squeezing is a property of a pair of metrics, a relative vacuum, whose invariants are the eigenvalues $e^{\pm2r_i}$ of $L=g_0^{-1}g$. We work out the harmonic oscillator in detail, including why a rotated squeezed state no longer minimizes the product of the displayed uncertainties. Quadratic evolution deforms the metric, and only the part of the generator that is self-adjoint with respect to the reference changes the $r_i$, at a rate we give exactly. For fields, a vacuum is unitarily implementable relative to a reference exactly when it lies at finite distance from it in the space of vacua. For a massless field in de Sitter space we revisit the two canonical charts compared by Grain and Vennin: relative to the reference of the standard squeezing formalism the Bunch–Davies state has $\sinh r_k=1/(2|kη|)$, and relative to the vacuum that a radiation era beginning at time $η$ would select it has $\sinh r_k=1/(2k^2η^2)$. The second comparison squeezes twice as fast and is unitarily implementable; the first is not.

comments
26 pages, 4 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.21426 ↗

We study a constrained inverse source problem for time-harmonic Maxwell fields in a homogeneous isotropic spherical region loaded by a (possibly active) metamaterial with parameter vector $θ\coloneqq (\varepsilon,μ)$. For a prescribed exterior field (represented by finitely many vector-spherical-wave coefficients), we consider the unique minimum-energy source that realizes the constraint and analyze its complex power $P(θ)$. Our focus is the \emph{tuning manifold} $\mathcal{M}=\{θ:\Im P(θ)=0\}$, i.e., the set of material parameters for which the minimum-energy source is \emph{self-tuned} in the sense of vanishing reactive power. We prove (i) differentiability of the optimal-source map and of $P(θ)$ away from a closed singular set, (ii) generic local manifold structure of $\mathcal{M}$ via an implicit-function argument, and (iii) quantitative conditioning/robustness bounds that relate parameter drift in $θ$ to reactive-power error and distance to $\mathcal{M}$. In the electrically small regime $k_0a\ll 1$, we derive a controlled low-order asymptotic reduction of $\Im P(θ)$ in terms of static electric and magnetic dipole profiles, with uniform remainder estimates on compact regular parameter sets. This yields local approximations of tuning curves and their conditioning without requiring a closed-form scalar profile. Numerical continuation experiments validate the one-parameter dipole reduction, the mixed-dipole tuning curves, and the identification of robust versus fragile segments of $\mathcal{M}$

comments
32 pages, 4 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.21428 ↗

We study products of multiplication by $x$ with Riemann-Liouville fractional integrals and derivatives of any real order. For the integral $I^α$ of order $α$, the commutator with $x$ gives the relation $uv-vu=hv^s$ with $s=1+1/α$. The coefficients of the normal ordering for this relation are the generalized Stirling numbers $S_{s;h}(n,k)$. We show that these operators give a faithful representation of the algebra in which the real powers of $v$ are defined. We expand $(XI^α)^n$ and $(I^αX)^n$ on locally integrable functions for every $α>0$, and $(XD^β)^n$ and $(D^βX)^n$ on the range of $I^{nβ}$ for every $β>0$. The kernel of $(XI^α)^n$ is an expectation over the Dirichlet distribution. This gives a probabilistic formula for $S_{s;1}(n,k)$, $s>1$. By de Finetti's theorem, the formula describes an urn with $n$ colours: fractional integrals correspond to Pólya urns, and derivatives of integer order correspond to drawing without replacement. The urn probabilities are the terms of a product formula that follows from the recurrence. The cases $s=1,0,2$ give the Stirling numbers of both kinds and the Bessel numbers. The same method gives the kernels of all words in $x$ and fractional integrals.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.21429 ↗

A central problem in time-dependent density-functional theory (TDDFT) is to construct a time-dependent many-electron wave function that reproduces a prescribed time-dependent electron density. This problem admits a natural geometric interpretation, which in turn leads to at least two distinct formulations of TDDFT. The first is the usual variational formulation of TDDFT, in which the density constraint is enforced with a real-valued local potential. The second is geometric TDDFT, introduced in recent works, in which the same density constraint is enforced with an imaginary local potential, or equivalently with a Hermitian nonlocal potential. In this work, we develop this unified viewpoint for continuous electronic systems and systematically compare the two formulations. We formulate the corresponding time-dependent Kohn-Sham schemes and derive a number of exact conditions for geometric TDDFT, including conditions associated with causality, time-reversal symmetry, uniform-coordinate scaling, translational invariance, energy and momentum equations of motion, one-electron self-interaction, and the adiabatic limit. The paper also contains a mathematical section where we provide a fully rigorous justification of some parts of the text. We particularly discuss the mathematical properties of two operators underlying the two formulations of TDDFT and establish sufficient conditions for their invertibility. We explain the functional-analytic subtleties underlying the geometric interpretation of TDDFT and the two formulations of TDDFT. This unified perspective clarifies the mathematical and conceptual relation between variational and geometric TDDFT and provides a foundation for the development of approximations within geometric TDDFT.

comments
44 pages, 6 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.21431 ↗

We show that the Hilbert-space formalism and the Born rule of quantum theory are singled out by the following principle: every correlation that is possible in a theory in which every observable admits an ideal measurement is physically realizable. An ideal measurement is one that yields the same outcome when repeated and does not disturb any compatible observable.

comments
22 pages, 3 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.21448 ↗

An invertible nonunitary similarity deformation leaves a two-qubit Hamiltonian's spectrum unchanged while varying a selected normalized right eigenstate in the fixed physical inner product. We embed this state in a two-parameter maximally correlated family that includes local dephasing and noisy circuit preparation. Hashing and a matching diagonal relative-entropy bound give the exact distillable entanglement and the PPT comparison distances at every finite tensor power. Correlated PPT catalysts cannot improve the Bell-pair distillation rate. The optimized CHSH value is \(2\sqrt{1+t^2}\): every state with nonzero coherence violates CHSH, while complete dephasing is separable. A calibrated finite-sample bound and two equal-fidelity preparations clarify which noise parameters determine the rate. For pure inputs, the binomial Schmidt spectrum gives logarithmic collectively optimized nonlocal magic with vanishing density, despite a positive entanglement density and extensive pairwise-frame magic. Fixed Clifford decoding gives six- and eight-copy CCZ concentration probabilities \(P_6=\frac12(1-2^{-\mathcal M_γ})\) and \(P_8=1-2^{-\mathcal M_γ}\). The same family permits explicit swapping recursions, symmetry-resolved entanglement, and a comparison of qubit stabilizer and fermionic Gaussian resources. These calculations keep the relevant operation classes separate when comparing many-copy limits.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.21490 ↗

We develop an auxiliary-kernel method for constructing the hydrodynamic instantons that govern macroscopic emptiness formation in one-dimensional Galilean quantum fluids. The key step is to represent the equation of state by an auxiliary integral kernel inspired by the Bethe ansatz. For equations of state admitting such a representation, we reduce the imaginary-time hydrodynamic problem to a single integral equation. Its solution determines the full density and current profiles, the vacuum boundary, and the leading emptiness rate. Notably, the construction does not require microscopic integrability. For the Lieb–Liniger gas, we derive the previously conjectured integral equation for the leading rate and use a known elliptic solution to obtain explicit expressions for the rate and vacuum boundary. Direct hydrodynamic numerics support the predicted boundary. We also recover known instanton solutions for a family of polytropic fluids.

comments
53 pages, 8 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.21581 ↗

Programmable photonics provides a versatile platform for optical information processing, but extending programmable transformations to large numbers of optical modes remains challenging. We investigate a modular architecture composed of unitary tiles arranged in alternating and staggered columns. Each physical tile interlaces fixed multiport mixers with programmable phase shifts, confining individual mixing operations to small groups of modes while connecting them across a larger processor. We analyze the relationship between circuit depth, intertile connectivity, and attainable transformations, distinguishing ideal programmable tiles from their physical phase-stack implementations. Numerical target-fitting results show a transition in the reconstruction errors at $R = 2K$, where $K$ and $R$ are the number of tile rows and columns, respectively. This design ultimately aims to enable large and reliable port-count optical photonic processors.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.21582 ↗

We give a constructive criterion for local separation of first-order chiral systems coupling two complex doublets. It combines a Gram decomposition of the coupling sources with separate coordinate dependence and a differential transport test. For recoverable, nondegenerate source families, the criterion is necessary and sufficient within the specified class of mode-independent complex matrix transformations with unit determinant. For a fixed differential operator and admissible Gram decomposition, we identify conditions under which the sources uniquely determine the Hermitian coefficient matrix required for separation. As an application, we construct an explicit algebraic transformation and derive separated radial and angular equations for coupled radiative Einstein–Maxwell perturbations of rotating, charged Plebański–Demiański backgrounds with acceleration, NUT charge, and a cosmological constant, on specified local patches. Its Gram decomposition is unique under additional generic assumptions. We also derive angular endpoint indices for Bonnor and Misner identifications with conical deficits or excesses. Under the stated regularity assumptions, each specified self-adjoint angular realization at fixed real mode parameters has a discrete spectrum and a complete orthonormal eigenbasis.

comments
37 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.21603 ↗

Numerical Analysis54

Parametric generalized algebraic Riccati equations arise in many-query problems in optimal control, state estimation, and filtering, where repeated full-order solutions may become computationally prohibitive for large-scale systems. In this paper, within a projection-based model reduction framework, we propose a two-sided projection approach that constructs reduced bases by minimizing the aggregate relative two-sided projection error of Riccati solution snapshots. Under suitable dissipativity assumptions, the resulting Galerkin-projected PGARE admits a unique symmetric positive semidefinite stabilizing solution. For error assessment, we employ an existing residual-based a posteriori error estimator for the full-order Riccati residual. A projection-based error decomposition developed in this work provides the theoretical motivation for the proposed basis construction. To accommodate clustered solution manifolds, we extend the framework to localized model reduction by combining parameter-space proximity and solution-space correlation for clustering, with classifier-based online basis selection. Numerical experiments on parameterized heat-conduction problems demonstrate the effectiveness of the proposed global and localized approaches in terms of approximation accuracy and computational efficiency.

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

Most machine-learning closures for the Reynolds-averaged Navier-Stokes (RANS) equations are local, predicting the closure quantities at each point solely from local flow features, despite the non-local nature of turbulent interactions. We propose a non-local closure framework based on Graph Convolutional Networks (GCNs) that exploits the mesh connectivity. Each finite-volume cell becomes a graph node, and cells sharing a face are connected by an edge. Through message passing, each layer aggregates information from neighboring nodes, so that after $k$ layers the prediction at a cell depends on its $k$-hop neighborhood, which naturally accounts for non-local effects. To make training feasible when each simulation yields a single large graph, we also introduce a breadth-first-search $k$-hop subgraph sampling strategy, which acts as data augmentation and cuts the cost per processed graph during training. We compare GCNs with feed-forward networks (FNNs) of equal size on two periodic-hills benchmarks: a laminar advection-diffusion transport problem that mimics the non-local character of RANS closures, and the turbulent eddy-viscosity prediction of the Closure Challenge dataset at $Re = 5600$. In the laminar case, FNNs are accurate only within the training regime and with sufficiently informative inputs, whereas GCNs generalize better to unseen geometries, including out-of-distribution flows, and partly compensate for missing input features. In the turbulent proof-of-concept case, the graph-based models achieve modest but consistent improvements compared to FNNs, supporting GCNs as a promising route to non-local RANS closures.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.18858 ↗

We propose a new method for computing the trace of a matrix function $f(A)$, where $A$ is a large, sparse, symmetric matrix. Our approach combines a deterministic global Lanczos approximation with a stochastic correction of its error. Starting the global Lanczos process with the identity matrix yields a direct approximation of the trace through a small tridiagonal matrix. The resulting basis matrices are polynomials in $A$, allowing the process to be implemented using sparse matrix-matrix multiplications when low-degree polynomials in $A$ have moderate fill-in. However, increased fill-in may limit the number of iterations that can be performed efficiently. To address this limitation, we derive an exact representation of the global Lanczos error as the trace of a matrix function and apply a stochastic estimator to the remainder. Even a moderately accurate estimate can substantially improve the accuracy, combining the deterministic method with the rapid initial convergence of stochastic trace estimators. We discuss error bounds and variance reduction, and present numerical experiments that compare the resulting method with existing ones.

comments
22 pages, 4 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.18864 ↗

Functional expansion tallies can represent transport operators for Monte Carlo correlation prediction without first constructing a fine cell transition matrix. We tally Galerkin operators directly from birth-to-absorption histories, retaining the sampled departure measure through an empirical mass matrix. Operator moments and an estimated offspring second moment give branching autocorrelations and integrated autocorrelation times without an eigendecomposition. The analytic benchmark from Part I supplies continuum and noise-free finite-model references. At the compared sizes, cosine and Legendre models have smaller IACT errors and require less operator storage than the cell model, and the branching reweighting reduces their representation error by a further factor near five while leaving the cell error unchanged. The measured runtime benefit is basis dependent. Profiling separates shared transport from the additional costs of operator assembly and prediction.

comments
11 pages, 2 figures, 2 tables. Submitted to M&C 2027, the International Conference on Mathematics and Computational Methods Applied to Nuclear Science and Engineering (American Nuclear Society). Part II of two; the companion paper is Part I, submitted separately
fields
Numerical Analysis
pdf ↗ page arXiv:2611.18870 ↗

We establish explicit eigenvalue bounds for Gram matrices of weighted multivariate Vandermonde operators with separated nodes on a torus. The squared magnitudes of the weights are samples of a nonnegative radial spectral energy density whose profile has bounded variation, finite energy, and finite weighted variation cost; compact support is not required. The estimate holds in every dimension and depends on the periodic Euclidean separation and the weighted variation integral. For compactly supported profiles, our analysis combines a signed layer decomposition with the ball approximants of Holt and Vaaler; the noncompactly supported case follows by truncation. Combining the resulting radial envelopes with a bandlimited sampling identity based on Poisson summation yields the spectral bounds by eliminating off-diagonal interactions and nonzero diagonal aliases. The result covers nonmonotone profiles and discontinuous radial low-pass filters, and it is complemented by a global elementary upper bound on the Holt–Vaaler cost that exhibits two radial regimes.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.18900 ↗

In this work, we propose a so-called {\it Neural Residual Iteration} (NeRI), a weak-form neural-network framework for solving a class of elliptic operator equations and variational inequalities, including nonlinear and nonsymmetric problems that may not admit a global energy functional. The key idea is to construct, at each iteration, a state-dependent linear functional whose derivative with respect to the trial function recovers the current weak residual. A single gradient step is then performed on the residual, yielding a residual-driven neural update without requiring a global energy functional or an additional test network. From a function-space perspective, NeRI can be interpreted as a neural-tangent-kernel-preconditioned realization of classical residual iterations, thereby bridging classical iterative solvers and neural-network optimization. We further extend NeRI to elliptic variational inequalities (VIs) through penalized and constraint-preserving formulations. For wide two-layer networks under gradient flow, we prove finite-time lazy-training estimates and derive an $H^1$-error decomposition relative to the exact weak solution. Numerical experiments on several elliptic problems demonstrate the effectiveness of NeRI, particularly for nonsymmetric and low-regularity problems.

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

We study finite-delay representations of point observables, which are solution values at selected spatial locations, for spatially discretized heat equations. We show that the observables satisfy closed dynamical systems whose evolution depends only on their own history, without requiring solution values elsewhere in the domain. Using semigroup properties, we analyze low-rank approximate closures that can use substantially fewer delay terms than the exact representation. We consider two computational approaches: direct least-squares fitting of delay coefficients from observable trajectories and shift-invert Krylov approximation of the semigroup using preconditioned linear solves. Numerical experiments for constant- and variable-coefficient heat equations in one, two, and three dimensions illustrate the effects of memory length and sensor information on prediction. The results are consistent with the theoretical analysis.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.19040 ↗

The optimal root convergence factor for uniform rational approximation of the exponential on an infinite sector is classical. We prove that, for every fixed infinite sector of opening less than $π$, the normalized pole-counting measures of any reduced root-optimal sequence, after scaling the poles by degree, converge weakly to a uniquely determined probability measure supported on a compact analytic arc outside the sector. For the half-line, the corresponding pole law was previously announced by Stahl and Schmelzer; our new result covers sectors of positive opening. The proof rules out boundary pole accumulation and controls an exponentially small Hermite residual through reflection and noncancellation, without assuming interpolation or orthogonality. We explicitly construct the equilibrium measure and its supporting arc in terms of a zero of a Ferrers function, and relate this parameterization to the Gonchar–Rakhmanov theta equation. We also obtain a degree-independent comparison for simultaneous approximation of finitely many $\varphi$-functions with a common denominator. Numerical pole distributions support the theoretical law.

comments
Optimal convergence factor and pole distribution of free-pole rational approximations to the exponential on infinite sectors
fields
Numerical Analysis
pdf ↗ page arXiv:2611.19119 ↗

In signed diffusive transport, a path of probability densities $ρ_t$ on the circle and a momentum $m_t$ satisfy $\partial_tρ=\partial_{xx}m$, and the cost of the path is the action $\int_0^1\int m^2/(2ρ)\,dx\,dt$. The diffusivity $m/ρ$ is an unknown of this variational problem and can take either sign. On the real line, the constraint $m\ge0$ gives the martingale Benamou-Brenier problem of Huesmann and Trevisan. We study geodesics and minimizing movements, which discretize gradient flows. For signed geodesics, we prove the $Γ$-convergence of the time-discrete problems for all probability endpoints, and of the fully discrete Fourier-grid problems as the space and time meshes tend to zero independently, without a positive lower bound on the densities. For a modified Jordan-Kinderlehrer-Otto (JKO) scheme on the torus, we prove convergence along subsequences to a weak solution of a fourth-order equation, the Derrida-Lebowitz-Speer-Spohn equation for the entropy in dimension one, under the assumption that the densities of the scheme stay above a positive constant on every finite time interval. In dimension one, the normalized minimum values of a discretization with nonnegative momentum and of a discretization by martingale couplings with a fourth-moment cost converge to the same martingale transport cost, and we identify the limit of the minimizing movements with nonnegative momentum for potential energies with bounded second and third derivatives. We compute geodesics and modified JKO trajectories by Douglas-Rachford splitting and by an interior-point method, and bound the optimization errors of selected solutions by dual lower bounds evaluated in interval arithmetic. The computed geodesics approach zero density near the points where the diffusivity changes sign, and along computed trajectories of the modified JKO scheme the density minimum can fall below its initial value.

comments
175 pages, 23 figures, 44 tables
fields
Numerical Analysis, Optimization and Control, Probability
pdf ↗ page arXiv:2611.19210 ↗

We study the low-energy spectrum of high-contrast partial differential equations with strongly anisotropic inclusions. The inclusion stiffness and mass are scaled by a contrast parameter \(η\), while a small material eigenvalue \(ε\) controls anisotropy. Stable extensions of local kernel fields give eigenvalue upper bounds proportional to the inverse contrast, uniformly in anisotropy. Additional low-energy modes arise from fields whose nonzero differential images lie in weak material directions. Each fixed family of compatible weak fields yields additional eigenvalue upper bounds of order $ε+ η^{-1}$, provided a stable extension exists. Under discrete stability assumptions, we obtain corresponding finite element bounds for the weak modes represented by the mesh. For separable scalar diffusion, we prove norm-resolvent convergence to independent background Dirichlet and inclusion Neumann operators as contrast tends to infinity with anisotropy fixed. Numerical experiments for four PDE models illustrate weak modes and mesh-dependent spectral transitions, and scalar diffusion experiments also test spectral decoupling and eigenvalue counting.

comments
25 pages
fields
Numerical Analysis, Spectral Theory
pdf ↗ page arXiv:2611.19235 ↗

We propose, analyze, and implement a convolution quadrature (CQ) algorithm for transient acoustic waves in an unbounded medium consisting of a heterogeneous domain embedded in free space, where the wave speed may be spatially variable and discontinuous. Multistep CQ, applied to the time-domain solution operator, reduces the evolution problem to a family of Helmholtz problems with damped complex frequencies, which can be solved independently in parallel, all time steps at once. The frequency problems are discretized by an overlapping coupling of finite elements (FEM) on a polygonal/polyhedral domain containing the inhomogeneity, and boundary elements (BEM) on a smooth curve enclosed by that domain, in the region where the medium is homogeneous, which accounts exactly for the unbounded exterior. Neither discretization needs to conform to the geometry of the heterogeneous domain, nor to each other. For the resulting FEM–BEM coupling we prove bounds for the solution operators of the transformed problems that are explicit in the Laplace parameter and the wave speed. These bounds yield convergence of the time discretization for A-stable multistep schemes. We also prove explicit estimates on the exponential decay of the transformed solutions away from the heterogeneity, which show that the correction provided by the BEM part is small but relevant, and cheap to compute: a few GMRES iterations suffice, and the correction is needed only over a fixed range of weakly damped frequencies, beyond which it becomes negligible and can be dropped. Numerical experiments confirm the predicted convergence rates in time and space and explore iterative (multigrid) methods for the interior FEM problems.

comments
40 pages, 11 figures, 1 table
fields
Numerical Analysis
pdf ↗ page arXiv:2611.19288 ↗

This work develops and analyzes several discontinuous Galerkin methods for a variational inequality associated with the stationary convective Brinkman–Forchheimer extended Darcy (CBFeD) system. The CBFeD model generalizes the incompressible Navier–Stokes equations by incorporating additional damping and pumping terms. The resulting variational inequality characterizes the motion of a viscous, incompressible fluid in a saturated porous medium under a friction-type slip boundary condition. For the CBFeD variational inequality, we first explore the existence of a unique weak solution. Then, we establish the existence, uniqueness, and stability of the numerical solutions obtained using discontinuous Galerkin methods. Optimal error estimates are derived, measured in the broken $H^1$-norm for the velocity and in the $L^2$-norm for the pressure, when linear velocity elements and piecewise constant pressure approximations are employed. Numerical simulations are carried out to confirm the theoretically predicted convergence orders and to highlight key strengths of the method, including its ability to capture discontinuities, effectively resolve shear layers, handle advection-dominated regimes, and operate robustly on general polygonal meshes.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.19390 ↗

Simulating hypersonic flows in thermochemical nonequilibrium requires solving the Navier-Stokes equations for reacting, possibly ionised mixtures. Compact high-order computations of viscous two-temperature air flows on unstructured grids have not gone beyond P = 2. We present an implicit Flux Reconstruction (FR) method for such flows, built on three ingredients. First, the solver stores and updates the logarithms of the partial densities and temperatures, making every state admissible without a positivity limiter and, for ionised mixtures, imposing charge neutrality consistently with the implicit update. Second, shocks are captured by subcell order blending, extended to steady implicit computations on curved Gauss-Legendre meshes, with second-order subcell blending in subsonic regions and an automatic freeze of the blending near convergence. Third, a pseudo-transient Newton method with a physicality-limited update and automatic CFL control reaches steady state from the free stream with the same settings at every order. The design order is verified up to sixth order on a manufactured solution for five-species air with finite-rate chemistry and vibrational relaxation. Steady viscous solutions up to sixth order are obtained for five- and eleven-species air on the High Enthalpy shock tunnel Göttingen (HEG) cylinder and for eleven-species air on the RAM-C II vehicle. To our knowledge, this work gives the first design-order verification of a high-order method with finite-rate air chemistry and vibrational relaxation, and the first high-order finite-element-type computations of viscous eleven-species, two-temperature air. On the HEG cylinder, the stagnation-point heat flux is within 2% of finite-volume references and within 6% of the measurements, with a comparable number of degrees of freedom to second-order finite-volume computations but on meshes with 20 to 40 times fewer elements.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.19410 ↗

We prove first-order convergence of finite-difference approximations to the Freidlin–Wentzell minimum action for diffusions with multiplicative noise, which answers the question of the sharp rate left open in [Hong, Jin, Sheng, \emph{IMA J. Numer. Anal.} 45 (2025), 1501–1536]. As shown in that work, a bound on the action controls only the $L^2$ norm of the velocity, which leads to a half-order estimate for the difference between the discrete and continuous actions. To improve it, we use the discrete Euler–Lagrange equation to derive mesh-independent $L^\infty$ bounds on the velocity of piecewise affine interpolants of stationary discrete paths with bounded action. For the case of a unique continuous minimizer, we identify the leading coefficient of the error between the discrete and continuous minimum actions on uniform grids, and a scalar example shows that the first-order error bound is sharp. We also prove strong $H^1(0,T;\mathbb R^d)$ subsequential convergence of interpolated discrete minimizers. Numerical experiments for a two-protein genetic toggle switch confirm first-order convergence of the discrete action for transitions in both directions.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.19414 ↗

We develop an analysis and a B-spline Galerkin method for the matrix-valued Bardeen-Cooper-Schrieffer (BCS) gap equation of unconventional superconductors with general long-range interaction kernels on arbitrary Bravais lattices. We define the BCS free energy functional on lattices, show that it is bounded from below, and characterise solutions of the gap equation as its stationary points. For non-repulsive kernels, we prove that fixed-point iteration never increases the free energy and drives the residual to zero. The algebraically decaying tails of the interaction are described by Epstein zeta functions, so the method applies to any power-law exponent $ν>0$, including exponents at or below the lattice dimension such as dipolar interactions in three-dimensional lattices. In the B-spline Galerkin basis, the singular convolutions correspond to block-circulant matrices whose eigenvalues are lattice sums, applied without quadrature at FFT cost. Each iteration takes log-linear work and linear memory, and Broyden updates accelerate convergence. By engineering a suitable dispersion for a prescribed gap, we obtain non-trivial analytic singlet and triplet solutions of the gap equation with power-law interactions on the integer lattice at zero temperature, to our knowledge the first ones. Benchmarks against these solutions and against highly resolved numerical data show convergence rates determined by the B-spline degree and the regularity of the solution. Finally, we compute a nodal superconductor with long-range interactions on the three-dimensional fcc lattice: a chiral state with a line node and two topologically non-trivial Weyl point nodes. On 16 cores, the method reaches a residual of $1.5\times10^{-13}$ for 6.3 million complex unknowns in less than two minutes.

comments
35 pages, 8 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.19486 ↗

We develop a data assimilation framework to address the ``ship-as-a-buoy'' problem, i.e., estimation of the wave field from time series of ship motion. Unlike previous algorithms which only provide information of wave spectrum, our approach reconstructs the instantaneous phase-resolved wave field. The full framework includes two steps: the first step to generate an initial (rough) estimation of the wave field using the response-amplitude-operators (RAOs), and the second step to refine the reconstruction using an ensemble Kalman filter (EnKF) to incorporate the measured motion time series. Together with EnKF in the second step, we model the coupled wave-ship dynamics by a high-order spectral (HOS) method for waves and a Cummins equation for ship motion (although higher-fidelity ship model can be applied). We conduct extensive tests of our method for the case with one ship, and the naturally extended cases with multiple ships or with uncertain parameters in the ship motion model. For all test cases we demonstrate favorable reconstruction of the wave field, which in general further improves with the number of ships available and with uncertain parameters properly estimated. We also provide insights on the successful reconstruction in terms of ensemble correlations between the motion time series and features of the wave field.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.19488 ↗

Pretraining an encoder once and reusing it across tasks is a widespread approach in vision and language. However, neural symbolic mathematics still trains a dedicated sequence-to-sequence model for each task, so that no representation of a function is shared. In this work, we propose the Function Joint-Embedding Predictive Architecture (Func-JEPA, abbreviated f-JEPA): an encoder of mathematical functions, pretrained on their symbolic form, whose latent space imitates the Sobolev space H^1 and in which differentiation is a learned latent operator. The norm of a latent is computed exactly from the function, whereas its direction is learned to match Sobolev angles. The frozen encoder is then reused by lightweight modules for decoding, composition, integration, and regression from samples. The representation and four downstream tasks are evaluated within and outside the pretraining distribution. f-JEPA recovers exact formulas from noisy samples more often than the compared symbolic-regression methods, whereas computer algebra and task-specific models remain stronger on standard integration and differential-equation benchmarks.

comments
42 pages, 16 figures, 30 tables. Code: https://github.com/amorarc/Func-JEPA. Model and data: https://huggingface.co/amorarc/func-jepa
fields
Numerical Analysis
pdf ↗ page arXiv:2611.19542 ↗

Learning the underlying probability distribution from samples is a core problem in statistics and applied mathematics. Generative models based on diffusion and flow matching learn a velocity field whose flow transports a known distribution to the data distribution. They produce novel, realistic samples, although the empirical learning problem is ill posed near the data distribution. Its minimizer transports the samples onto the training data, and small perturbations of the data change the velocity field strongly near the end of the flow. The observed generalization is often attributed to implicit regularization by the network parameterization, early stopping of the training, and the time integration during sampling. Explicit regularization has advanced the theory and computation of many inverse problems and has recently been proposed to prevent memorization in generative models. With a regularizer on the magnitude of the velocity, however, the field approaches the memorizing velocity unless the regularization parameter grows to infinity fast enough, and it then stays bounded by a constant that is small only for large parameters. We show that penalizing the derivatives of order $k$ of the velocity renders the $D$-dimensional empirical problem well posed uniformly in time if $2k > D$ and the training points are in general position. Our experiments in one and two dimensions discretize the velocity with splines and use direct solvers for the regularized least-squares problems to exclude optimization error. Refining the discretization in space and time changes the error of the Hessian-regularized flows only marginally, whereas without the regularizer the error tends to that of memorization. These flows generalize, with errors comparable to or lower than those of well-tuned kernel density estimates.

comments
40 pages (main text pp. 1-24, references pp. 24-26, appendices A-C pp. 27-40), 4 figures, 11 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2611.19587 ↗

Physics-based control is central to robot learning, but differentiating through implicit physics steps typically requires Hessian or Karush–Kuhn–Tucker (KKT) linear solves; we ask whether gradient steps suffice. Each simulation step minimizes an energy under many contact and collision constraints. Without constraints, we view control over $K$ steps as $K$-level optimization with strongly convex lower levels, recast as one min–max problem. Our Penalized Single-loop $K$-level method (PSK) uses only gradients and a projection, updates all levels in parallel, and reaches an $ε$-stationary control in $O(ε^{-3})$ iterations, with a $K$-independent exponent but a $K$-dependent constant. Contact-rich constraints, however, typically violate a constraint qualification (CQ). We replace each constraint by a smooth wall that acts on a band of constant width. Under mild assumptions that need no CQ, every exact solution of the banded lower levels is then feasible and banded Fritz–John, and PSK keeps the $O(ε^{-3})$ complexity. Without a CQ that is uniform in the band width, however, a shrinking band loses the $K$-independent exponent: with width $ε$ and fixed $K\geq2$, deterministic zero-respecting methods need $Ω(ε^{-(K+3)/4})$ calls on a hard instance whose control dimension grows with $1/ε$. We prove our assumptions for smoothed kinematic and dynamic multi-robot navigation among segment obstacles. In navigation experiments, PSK, tuned per case, reaches every goal with sixteen levels and, at equal time, reaches a lower loss than tuned unrolling in 17 of 18 cases, while implicit differentiation is lower in 10.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.19660 ↗

Modern accelerators increasingly support low-precision formats such as 8-bit floats and integers to speed up machine learning. We show that a Cholesky factorization in which both GEMM and TRSM are implemented using the fixed-point Ozaki 1 scheme satisfies the same backward error bounds as the standard floating-point Cholesky factorization, and that the same holds for a Cholesky factorization computed using a low-precision MicroScaled GEMM. We then use our error analyses to construct an adaptive precision Cholesky factorization that exploits low-precision formats while respecting a prescribed element-wise error bound, as long as the factorization succeeds. We test it in two settings. First, we use it to choose the number of Ozaki 1 slices at each iteration, with SYRK/GEMM and TRSM emulated in INT8 fixed-point arithmetic to attain double-precision accuracy. Second, we use it to build a low-precision Cholesky preconditioner for the conjugate gradient method (PCG), in which SYRK/GEMM take low-precision inputs and accumulate in high precision, with the input format selected adaptively for each panel; if the factorization breaks down, diagonal perturbation still yields a valid preconditioner, at the cost of the error bound guarantees. On an NVIDIA GH200, the adaptive Ozaki 1-based factorization is up to 29% faster than a right-looking Cholesky using a fixed slice count of 7, and up to 69% faster than one using cuBLAS' Automatic Dynamic Precision (ADP), while maintaining the same error guarantees. For PCG, FP8 factorizations with diagonal perturbation form effective preconditioners on the 13 tested SuiteSparse matrices, reducing the number of PCG iterations by up to $12\times$ over CG on the same matrix diagonally scaled by powers of two. For synthetic matrices with arithmetic spectra, and geometric spectra with $κ\le 10^4$, FP8 preconditioners also reduce the number of CG iterations.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.19687 ↗

This paper presents a parallel split Bregman/alternating direction method of multipliers (ADMM) \cite{goldstein,tran} for obstacle problems and for the linear complementarity problems (LCPs) that arise in the pricing of American options under the Black–Scholes and Merton jump-diffusion \cite{merton} models. The auxiliary variable of ADMM decouples the inequality constraint from the differential operator, so that every iteration consists of a linear solve with a fixed banded matrix and a pointwise projection. The matrix is factorized once by the SPIKE algorithm \cite{spike}, as in the parallel direct approach of \cite{singh}, and reused in all iterations and time steps in a Fortran~90 MPI implementation. Convergence is proved by a Lyapunov functional for every positive augmentation parameter, for the symmetric obstacle problem and the non-symmetric option LCP alike, and the iterates do not depend on the number of processes. The method therefore needs a single factorization, no tuned relaxation parameter and only pointwise, perfectly parallel updates. One- and two-dimensional obstacle problems, the Black–Scholes call and American put, and European and American options under Merton's model are computed and compared with exact, closed-form, binomial and published values. In two dimension a speed-up of $3.92$ on four processes is obtained. It is also shown that the augmentation parameter has to be scaled to the diagonal of the time-stepping matrix when only a few inner iterations are used.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.19697 ↗

Accurate computation of tail probabilities motivates efficient high-order implementations of the $G_n^{(1)}$ extrapolation transformation. We derive finite recurrence relations in the transformation order for Gaussian, gamma, and inverse Gaussian tail approximations. The Gaussian and inverse Gaussian numerator and denominator sequences satisfy four-term recurrences, whereas the gamma sequences satisfy a three-term recurrence. The derivation exploits the structure of the underlying differential operator and shows that the reduced numerator and denominator obey recurrences with identical coefficients. This construction avoids the repeated evaluation of higher-order derivatives and nested sums required by the explicit formulations. As a result, generating the approximation sequence through order $n$ requires $O(n)$ arithmetic operations, compared with $O(n^3)$ for the Gaussian and gamma distributions and $O(n^4)$ for the inverse Gaussian distribution. The recurrence algorithms also require only a fixed number of previously computed quantities at each order. Numerical results for the three distributions are in excellent agreement with values reported in the literature

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

We propose a new class of explicit methods for Langevin equations with a superquadratic potential that simultaneously preserve the conformal symplecticity and ergodicity as well as achieving high-order convergence. The construction is based on a mollified potential approach, in which the original potential is truncated to quadratic growth at infinity and globally mollified to control the superquadratic behavior while maintaining the underlying properties of the original dynamics. By appropriately choosing the cut-off radius, the far-field quadratic coefficient, and the step size, we obtain the coercivity of the mollified potential and derive its derivative estimates. These estimates allow us to prove uniform-in-time weak convergence for the proposed (including higher-order) explicit conformal symplectic numerical methods. Since the mollified potential is identical to the original one in a ball whose radius grows as the step size decreases, the computational cost of the new methods is essentially the same as that of the usual schemes (e.g., BAOAB) applied to the original potential. Numerical experiments are provided to illustrate the theoretical results.

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

We study a random-feature method for pricing and calibrating European options under jump-diffusion (Merton, Kou) and stochastic-volatility (Heston, SABR) models. The network has one hidden layer with a probit activation and fixed random inner weights, so fitting it to the pricing equation, the payoff and the boundary conditions is a single regularised least-squares problem, with no iterative training. For Merton and Kou the jump integral of each feature is explicit, so no quadrature is needed. One factorisation of the least-squares matrix gives the price at every state and time, its Greeks, and the exact derivatives of the prices with respect to the model parameters for gradient-based calibration. For the jump models, subtracting the Black-Scholes price removes the payoff kink and reduces the pricing error by about two orders of magnitude. The method is then about as accurate as a standard Crank-Nicolson finite-difference scheme at the same run time, although a finite-difference scheme that also subtracts the Black-Scholes price is about two orders of magnitude more accurate still. On the test problems of a recent physics-informed neural network study, the method matches that network's accuracy in seconds instead of about half an hour. The calibration experiments show that a solver can fit the quotes and still return wrong parameters when its pricing error is not small compared with the effect of the parameters on the prices: without the subtraction the solver misses the jump parameters by up to 50%, and with it they are recovered to within 3%. For Heston and SABR, used as an applicability study with boundary conditions that need no reference prices, pricing errors are about one percent and the calibrated parameters are within about 15% of the true values.

comments
29 pages, 4 figures, 14 tables. Code: https://github.com/RiskLabIISc/PiRANN
fields
Numerical Analysis
pdf ↗ page arXiv:2611.19792 ↗

Mean field theories provide optimization results for shallow neural networks by analyzing the weight distribution in infinite width limits. Corresponding results for finite sized networks are obtained by particle approximations, for which sharp quantitative bounds are still an open problem. In this paper, we consider a modified mean field loss, which allows a more fine grained control over finite sized networks. We prove convexity and equidistribution properties, which directly lead to Barron type approximation results for networks sampled from local loss minimizers. We demonstrate that particle approximations of the new loss function naturally lead to gradient descent methods with dropout type regularization.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.19798 ↗

Ensemble Kalman inversion (EKI) is a derivative-free and parallelizable method for parameter estimation in Bayesian inverse problems involving expensive forward models. It adapts Kalman filtering by repeatedly assimilating the observation data through an artificial dynamical system with identity state evolution and the parameter-to-observation map as its observation operator. However, its performance can be limited by ensemble collapse and confinement to the affine span of the initial ensemble. We propose an exploration-enhanced EKI framework that combines multiplicative covariance inflation with a projected-dropout correction of the ensemble mean. Inflation helps maintain ensemble spread, while projected dropout enables the mean to explore directions beyond the initial affine span. For linear inverse problems, we provide a discrete-time, finite-ensemble analysis of the resulting method and prove the least-squares objective converges exponentially to its minimum in expectation. Within the initial ensemble subspace, the contraction factor is independent of the conditioning of the inverse problem, and the limiting ensemble covariance provides a low-rank representation of the posterior covariance. Experiments on ill-conditioned linear systems, 100-dimensional nonlinear benchmarks, and a PDE-constrained barotropic flow inverse problem demonstrate the effectiveness of the proposed method.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.19845 ↗

Computing high-order partial derivatives in high dimensions by automatic differentiation can be costly in both computation and memory. Stein's identity offers an alternative through Gaussian smoothing, but the variance of the resulting estimators can diverge as the step size tends to zero, even with antithetic sampling. We propose a variance stabilization technique that extends antithetic sampling from a reflection pair to $n$ equally spaced points on a circle in the complex plane. Under local analyticity, we prove that, when $n$ is at least the derivative order, the bias is of order $O(σ^n)$ and the variance remains bounded as the smoothing step size $σ$ tends to zero. Numerical experiments support these predictions and demonstrate the effectiveness of the estimator in physics-informed neural networks (PINNs) for polyharmonic and Cahn–Hilliard equations. The technique mitigates the bias-variance trade-off in smoothing-based derivative estimation and is useful for PINNs solving high-order partial differential equations.

comments
20 pages, 6 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.19909 ↗

In this paper, we introduce a new formula for the Moore-Penrose inverses of the rank-deficient Toeplitz matrices, based on the quasi-direct decompositions of Toeplitz matrices. Numerical examples are presented to verify the validity and the efficiency of our method.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.19945 ↗

Equation-derived neural integration can execute prescribed dynamics without training, while informative ensemble learning can estimate uncertain parameters and identify governing interactions without requiring differentiability. Together, these approaches motivate Physics-Spawned Informative Networks ($Φ$SpIN), a framework for prescribed and adaptive hybrid dynamical systems. As a first step toward flood modeling applications, we present $Φ$SpIN-SW, its prescribed-physics realization for the rotating shallow-water equations. Compatible C-grid operators on spherical Voronoi meshes define a computational graph that retains non-polynomial operations and advances the state through recurrent neural integration compiled with JAX. Analytical benchmarks characterize numerical errors, and global and coastal experiments closely reproduce reference solutions generated using the Model Prediction Across Scales (MPAS) model. At approximately 14~km global resolution, A100, H200 and B200 GPUs attain 9-, 19- and 34-fold higher timestep throughput than a 96-core MPAS-SW CPU reference under matched workloads. These results extend training-free neural integration beyond polynomial dynamics to complex geophysical simulation, establishing a computational foundation for subsequent adjoint-free ensemble estimation of physical and neural parameters and informative adaptation of operator structure.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.20054 ↗

Harvest quadrature can change a discrete optimal control problem even when the state scheme stays fixed. We study this effect for a positivity-preserving Lotka–Volterra scheme. The difference appears in a model with harvesting alone: rewarding the scheme's removal flux gives a strictly convex reduced cost, whereas using prey density at the start of each step overestimates harvest and can create negative curvature and a strict local minimum that is not global. Rational root isolation certifies the two-step global minimizers. With diffusion in one space dimension, nonnegative bounded $H^1$ initial data and positive diffusivities, the costs, weighted gradients and Hessians differ by $O(τ)$ uniformly in the spatial mesh, where $τ$ is the time step. A uniform positive lower bound on the reduced Hessian gives the same order for the distance between nearby controls. A large enough effort penalty gives unique global discrete minimizers. We also prove positivity, exact population balance and a common variational limit, and derive exact discrete adjoints and Hessian actions. Numerical tests trace changes in curvature and stationary controls across parameters and grids, with costs evaluated on a common reference using adaptive time stepping. The construction extends to weighted production–destruction systems, giving exact harvest accounting and smooth derivatives on fixed grids.

comments
58 pages, 10 figures
fields
Numerical Analysis, Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2611.20131 ↗

Quasiperiodic geometrical arrangements, which exhibit long-range order in the absence of periodicity, have attracted interest in the design of composites and mechanical metamaterials. In this context, direct numerical simulations explicitly resolving the quasiperiodic microstructure become prohibitively expensive for macroscopic problems, motivating the development of homogenized continuum models. However, the absence of a periodic unit cell in physical space hinders the use of conventional homogenization methods. In the present work, we exploit higher-dimensional periodic representations to perform computational homogenization of quasiperiodic elastic composites. Thereby, effective properties are obtained from unit-cell problems solved using the fast Fourier transform in higher-dimensional spaces. Using two-dimensional Penrose tilings and three-dimensional Ammann–Kramer–Neri tilings as paradigmatic examples, we describe the distribution of heterogeneous material properties in the corresponding higher-dimensional unit cells, compute effective elasticity tensors, and assess convergence of fully resolved finite patches to the homogenized limits. We provide open-source implementations of all numerical models.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.20142 ↗

Physics-based models of vapor-compression cycles are often formulated as large, stiff DAE systems with derivative discontinuities introduced at the points of phase change. We use an implementation of a discontinuity-aware ODE and DAE solver scheme that uses domain-specific, user-declared information to compute appropriate time steps for more efficient integration. This scheme is made open-source within DifferentialEquations.jl. We demonstrate how discontinuity information can be specified symbolically in a declarative modeling language such as Dyad and passed to the solver to address the numerical challenges posed. We apply this discontinuity-aware technique to two applications: first, a scalar ODE with two discontinuities, and then a model of a full vapor-compression cycle. The discontinuity-aware solver yields significantly fewer step rejections and improved solver times, particularly with the Rodas5P solver at loose tolerances, as compared to standard error control, suggesting that exposing physical discontinuity information from equation-oriented models to adaptive solvers can improve practical simulation performance without requiring reassembly of the model.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.20177 ↗

We study the problem of choosing $m$ landmark points so that the span of the kernel translates is as close as possible to the leading $s$-dimensional eigenspace of a positive-definite kernel. The natural measure is the Hilbert-Schmidt operator discrepancy between the reproducing-kernel-Hilbert-space (RKHS) projectors onto the two subspaces. We give a closed form spectral alignment function in terms of the truncated Mercer kernel and relate it to the classical integrated power function (Nyström trace error) through a two-sided sandwich bound. Minimizing the function by gradient descent on the landmark coordinates produces landmark sets that are evenly spaced. Theoretical results show that optimal configurations are those whose eigenfunction sampling matrix is a scaled isometry. On homogeneous spaces these are exactly the minimal equal-weight cubature rules for products of leading eigenfunctions, and for every $m\ge s$ they are the configurations whose sampled eigenfunctions form a unit-norm tight frame. Experiments on $\mathbb{S}^1$ and $\mathbb{S}^2$ agree with the theory. On the circle, with $s\le2m$ and a moderate bandwidth, every random start converges to equispaced landmarks, and on the sphere the optimizer recovers the regular tetrahedron, octahedron, and icosahedron from random starts. Finally, we analyze the numerical conditioning of the problem.

fields
Numerical Analysis, Functional Analysis, Metric Geometry
pdf ↗ page arXiv:2611.20336 ↗

Solutions to scalar hyperbolic conservation laws may develop discontinuities within finite time even from smooth initial data, while higher-order lattice Boltzmann (LB) methods tend to generate non-physical oscillations and out-of-bounds behavior near steep gradients. To address this issue, we first construct a first-order LB method with the upwind-type equilibrium distribution functions under the \(DdQ(2d+1)\) lattice structure, and establish its bound-preserving (BP) conditions. We then develop a second-order multiple-relaxation-time LB (MRT-LB) method by introducing the auxiliary source distribution functions, and analyze its \(L^2\) stability. Building on these, we propose a hybrid LB method that preserves the collision-streaming structure, by conservatively mixing first- and second-order updates through a convex constraint mechanism. We further establish the global BP (GBP), local BP (LBP), and relaxed LBP (RLBP) limiters in the hybrid LB method, together with the associated macroscopic BP constraints. Numerical experiments examine the convergence order, interface capturing performance, and discontinuity resolution capability of the proposed BP hybrid LB method. The results indicate that it effectively suppresses out-of-bounds behavior in the second-order LB method and reduces numerical dissipation in the first-order LB method, while maintaining the prescribed bounds and discrete mass conservation.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.20512 ↗

We consider an optical system with a periodic point spread function, such as a camera with a periodic diffractive filter array placed near the sensor. Such systems produce a monochrome image that we call ``diffractogram'', and that multiplexes the spatial and spectral information about the scene. We present a method to efficiently invert this forward model and recover the hyperspectral scene. The inverse problem is formulated as a large scale $\ell_1$-penalized least squares problem that is solved iteratively with the Alternating Direction Method of Multipliers (ADMM). A Krylov subspace solver, such as LSQR, may require tens to hundreds of iterations to approximatively solve the augmented least-squares problem required in each ADMM iteration. Here we present an exact direct solver for the augmented least-squares problems that exploits the periodicity of the point spread function. Each direct solve costs roughly as much as three LSQR iterations, eliminating inner iterations entirely. We validate the method on both synthetic and experimental datasets.

comments
20 pages, 9 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.20544 ↗

We develop a staggered discontinuous Galerkin neural network (SDGNN) method for scalar elliptic problems with a computable error decomposition. The staggered discontinuous Galerkin (SDG) method requires only local continuity of its trial functions and gives a square, inf-sup stable system without stabilization parameters; we carry this structure over to neural networks. Networks defined on the patches of a staggered mesh satisfy the SDG continuity conditions for all values of the network parameters, and the loss is the squared dual norm of the SDG weak residual. We show that the loss is equivalent, with computable constants, to the square of the training error, the distance between the SDG projection of the network and the SDG finite element approximation, so that the full error is bounded by the discretization error, a multiple of the square root of the loss, and the network projection error. The weak residual requires no derivatives of the networks, the boundary and convection terms carry no penalty or stabilization weights, and the scalar trial functions may jump across the midlines of the primal cells. Numerical experiments show that the square root of the loss tracks the error during the training, that prescribed jumps across a square and a circular interface are captured consistently over the initializations, and that the method is more accurate than physics-informed neural networks at the same parameter counts.

comments
40 pages, 9 figures, 9 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2611.20556 ↗

We propose a unified Onsager-based neural time-stepping (ONTS) framework for solving gradient-flow partial differential equations with conserved and nonconserved dynamics. Unlike conventional neural time-stepping methods that directly parameterize the evolving state, the proposed framework employs spatial neural networks to approximate the Onsager process variables, namely, the rates in nonconserved systems and the fluxes in conserved systems. Within this Eulerian framework, we develop three complementary schemes: an explicit least-squares scheme (E-ONTS), an implicit variational scheme (I-ONTS), and a predictor–corrector scheme (PC-ONTS) that combines explicit prediction with safeguarded implicit correction. For conserved systems, the flux-based formulation guarantees discrete mass conservation under periodic or no-flux boundary conditions. Furthermore, we rigorously establish unconditional discrete energy stability for the implicit schemes, provided that a suitable descent criterion is satisfied, without requiring global minimization of the neural variational objective. Numerical experiments for the heat, Allen–Cahn, Cahn–Hilliard, Fokker–Planck, and coupled Poisson–Nernst–Planck equations demonstrate the accuracy, robustness, and structure-preserving properties of the proposed framework.

comments
35 pages, 8 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.20563 ↗

Governing partial differential equations (PDEs) provide compact and interpretable descriptions of physical systems. Classical methods, such as sparse and symbolic regression, fit a new equation to each observed field: what is learned on one system is not carried to the next, and observation noise corrupts the derivative features they rely on. This paper introduces UNIDE (Unified Identification of Differential Equations), a data-driven approach that learns across PDE families to identify governing equations from new noisy trajectories. It integrates three components: a self-supervised denoiser trained without clean targets, an encoder shared across PDE families that predicts which candidate terms are active, and weak-form least squares with residual-based pruning that estimates their coefficients. We demonstrate UNIDE on synthetic one-dimensional trajectories from six PDE families with known term structures, including the Burgers and Kuramoto–Sivashinsky equations. We train one model per noise level and systematically compare UNIDE with SINDy, WSINDy, and PySR. The results show that UNIDE recovers the exact set of governing terms more often than all three at every noise level from $1\%$ to $80\%$. At $80\%$ noise, where the noise standard deviation is $0.8$ times that of the field, it recovers the exact terms for $92\%$ of held-out trajectories, whereas the best baseline recovers about $1\%$. UNIDE is also efficient: because its neural components are reused rather than refit, it identifies each new trajectory in $0.45$ seconds, $2.7$ times faster than WSINDy and $51$ times faster than PySR. These results demonstrate the potential of learning across PDE families for efficient equation identification under substantial observation noise.

comments
30 pages, 9 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.20678 ↗

We introduce a matrix-free FFT-based solver for three-dimensional linear elastic homogenization problems discretized by the scaled boundary finite element method (SBFEM) on a voxel grid. Owing to its analytical solution in the radial direction, the SBFEM discretization is inherently softer than fully integrated voxel finite elements, whereas its displacement-based formulation remains symmetric, conforming, and supports arbitrary stiffness anisotropy. These properties make SBFEM an attractive candidate for porous and highly heterogeneous microstructures, where existing voxel-based FFT discretizations offer no generally reliable choice: Reduced-integration hexahedral elements, equivalently the rotated staggered grid discretization, may suffer from hourglass instabilities in the presence of voids, whereas fully integrated hexahedral elements are often too stiff. The proposed discretization uses hexahedral SBFEM cells on the full voxel mesh of a regular periodic grid, retaining the simplicity of a fixed-resolution voxel representation without requiring adaptive mesh coarsening. The main contribution is a preconditioner based on the homogeneous SBFEM stiffness operator. We show that this preconditioner may be applied locally in Fourier space and that the condition number of the preconditioned system is bounded by the material contrast, independently of the grid resolution. This result enables a fully matrix-free implementation of the SBFEM-discretized problem, without assembling or storing the global stiffness matrix. Numerical experiments on a short-fibre reinforced composite, a polyurethane foam and a sand-based binder jet microstructure demonstrate robust convergence and competitive accuracy compared with established voxel discretizations. In particular, SBFEM remains stable for porous microstructures, for which reduced-integration hexahedral elements become unstable.

comments
32 pages, 7 figures. Submitted to International Journal of Numerical Methods in Engineering
fields
Numerical Analysis
pdf ↗ page arXiv:2611.20722 ↗

Spaces of fractional smoothness in the sense of Riemann-Liouville of order $0<α<1$ were introduced in [J. Dick, Ann. Math. Pura Appl., 187, 385-403, 2008]. Dick also proved Koksma-Hlawka type inequalities for these spaces, using a notion of fractional discrepancy. In [M. Gnewuch et al., Constr. Approx., 63, 647-711, 2026] upper error-bounds for QMC-integration on these spaces were obtained using $(t,m,s)$-nets and it was proved that the above mentioned Koksma-Hlawka inequalities by Dick are sharp. One step in the proof of the upper bounds was the embedding of the spaces of fractional smoothness into Bessel potential spaces, also called fractional Sobolev spaces. We prove that, up to norm equivalence, spaces of fractional smoothness and Bessel potential spaces are equal. From this we deduce that the upper error bounds for QMC-integration from Gnewuch et al. are indeed optimal for spaces of fractional smoothness. Furthermore, we obtain two types of Koksma-Hlawka inequalities for Bessel potential spaces. The first type uses the fractional discrepancy as introduced by Dick. The second type adopts an approach by Triebel from [H. Triebel, EMS Press, 2010] by using the norm of the (local) discrepancy function in an adjoint Bessel potential space.

comments
36 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.20739 ↗

We develop an adaptive numerical method for linear Fokker–Planck equations on $\mathbb R^d$, based on approximating the evolving probability density by linear combinations of Gaussian functions (LCGs). The method applies to polynomial-type drift fields, without requiring a gradient-flow structure or a stationary distribution. It relies on an operator splitting that separates diffusion and affine drift, for which Gaussian functions can be propagated exactly, from higher-order transport, whose evolution is approximated adaptively by LCGs. Both the number of Gaussian components and their means and covariances are adjusted to meet the prescribed accuracy tolerances. The adaptivity is driven by computable error indicators involving polynomial moments of Gaussians that can be evaluated analytically. We provide a rigorous error analysis that relates the approximation error to the indicators driving adaptivity and illustrate the performance of the scheme in several test cases.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.20743 ↗

We present a numerical method to solve the time-dependent Schrödinger equation at arbitrary order of accuracy in the time step, particularly well suited for tridiagonal Hamilton operators. The method is based on a factorization of the diagonal Padé approximants of the matrix exponential into products of linear factors, which preserves tridiagonal matrix structure at every time step and yields a propagator of order 2q in the time step at a cost of O(qN) operations. The propagator is exactly unitary by construction, and at lowest order q=1 it reduces to the standard Crank-Nicolson algorithm. We further extend the method to any Hamiltonian admitting a decomposition into a sum of tridiagonal or diagonal operators via high-order split-operator techniques (McLachlan, 2022), retaining O(qN) scaling at each time step. We also analytically show and numerically verify that the precision is dictated by the split-operator method. This covers a broad range of physically relevant cases, including higher-dimensional systems, higher-order spatial discretizations, and non-separable potentials.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.20800 ↗

In this paper, we propose a maximum principle preserving continuous finite element method for scalar conservation laws augmented with a fractional diffusion operator of order $s\in (0,1)$. Conservation laws with fractional diffusion operators arise in a variety of physical models involving anomalous transport and nonlocal regularization, including geophysical flows, plasma physics, and nonlinear acoustics. The fractional Laplacian is approximated using a sinc-quadrature representation, yielding a resolvent-based formulation compatible with continuous finite elements and explicit strong stability preserving Runge–Kutta time integration. A first-order monotone scheme is constructed using graph viscosity and is shown to satisfy a discrete maximum principle under an explicit CFL condition. A high-order extension is obtained via entropy-consistent corrections and convex limiting, achieving second-order accuracy while preserving the maximum principle, and hence positivity, as well as mass conservation in the periodic setting. Numerical experiments, including applications to the Surface Quasi-Geostrophic equation, confirm the second-order accuracy and the robustness of the proposed method on unstructured meshes.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.20833 ↗

Fourier neural operators (FNOs) avoid the curse of parametric complexity when approximating the solution operator of certain partial differential equations (PDEs). While recent studies primarily focus on PDEs, in this article we derive upper error bounds for approximating the solution operator of controlled ordinary differential equations (CODEs) $\dot{y}=f(y,u)$ using a FNO. Under a Carathéodory setting and suitable regularity assumptions, including a smallness condition, we prove that the size of the FNO grows at most algebraically in $1/\varepsilon$, namely like $\varepsilon^{-(1+d/(2(s-1)))}$ up to logarithmic factors for GELU networks, and is thus sub-quadratic for sufficiently smooth $f$, where $d=1+n_y+n_u$ and $s$ denotes the Sobolev regularity of $f$. Our proof is based on emulating the Picard iteration through the layers of the FNO while exploiting the differentiation formula of the discrete Fourier transform. This result contributes to the quantitative approximation theory of FNOs for physically motivated problems and provides a theoretical foundation for leveraging a FNO as efficient forward surrogate for the solution operator of CODEs, especially in inverse parameter estimation where repeated evaluations of the forward operator are needed.

comments
41 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.20883 ↗

The Random Feature Method (RFM) distinguishes itself among machine learning approaches to partial differential equations (PDEs) through its superior accuracy and computational efficiency. Nevertheless, the theoretical underpinnings of RFM remain incompletely elucidated. This paper provides a comprehensive analysis of RFM within the framework of kernel methods, focusing on two principal aspects: (i) approximation by finitely many random features in Sobolev norms and the PDE residual seminorm, and (ii) estimation over the induced reproducing kernel Hilbert space (RKHS) from finitely many noiseless collocation observations. We relate both problems to kernel ridge regression (KRR) and establish upper and lower bounds in terms of the eigenvalues of the associated integral operators under the respective assumptions. Combining the approximation and estimation lower bounds, we establish a lower bound under simultaneous restrictions on the numbers of random features and collocation observations. We further quantify how activation regularity affects these eigenvalues, obtaining algebraic upper bounds for finitely smooth activations and stretched-exponential upper bounds for analytic activations.

comments
51 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.20951 ↗

We study integration on a $3^d$-dimensional trigonometric space whose unit ball has all coordinate mixed partial derivatives bounded by one. With evaluations anywhere in $\mathbb{R}^d$, we determine the exact minimal worst-case error among all deterministic algorithms using at most $n$ function values. An optimal quadrature formula is obtained by truncating an exact product quadrature formula on $\{1/2, 1/2+π\}^d$. All weights are positive. For each error tolerance $0<\varepsilon<1$, the information complexity grows exponentially in $d$ with the common base $Λ\approx 1.10546546$. The correction of order $\sqrt{d}$ to the logarithm of the information complexity and the corresponding error limit are determined by the standard normal distribution function. For $b\ge 1$ and $n=\lceil b^d\rceil$, the error tends to one, one half, or zero according as $b<Λ$, $b=Λ$, or $b>Λ$.

comments
16
fields
Numerical Analysis
pdf ↗ page arXiv:2611.21004 ↗

Computing dominant mode subspaces is a major cost in the higher-order singular value decomposition (HOSVD) and its sequentially truncated variant (STHOSVD). Randomized Tucker algorithms can reduce this cost by approximating the required subspaces from small sketches, but may introduce additional approximation errors. We exploit the extreme aspect ratios of tensor unfoldings, whose mode dimensions can remain manageable while being orders of magnitude smaller than the products of the remaining dimensions. Instead of directly approximating the desired subspaces, we sketch the entire unfolding at a scale comparable to its mode dimension to preserve its full row-space geometry, and use randomized preconditioning to recover the desired singular subspaces through small matrix factorizations. We develop randomized preconditioned HOSVD and STHOSVD algorithms incorporating numerical truncation, and further accelerate their large matrix multiplications using mixed precision. Our analysis shows that truncation adds only a term quadratic in the numerical threshold to the classical HOSVD tail-energy bound, while mixed precision introduces a relative \(O(\sqrt{u_\ell})\) correction to the tail-energy term and an additive \(O(u_\ell)\) term under suitable conditions, where \(u_\ell\) is the lower-precision unit roundoff. On synthetic and real tensors, our methods achieve speedups of a fewfold to several dozenfold over classical HOSVD and STHOSVD, with runtimes competitive with those of other randomized methods. The double-precision versions match the classical reconstruction errors to numerical precision, and the mixed-precision variants yield nearly identical errors.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.21049 ↗

We develop a deterministic algorithm for separating the eigenvalues of Hermitian tridiagonal matrices by small diagonal perturbations. For $\|T\|_2\leq1$, $0<δ<1/2$, and $X=\mathrm{diag}(1,\ldots,n)$, our algorithm selects $t\in[0,δ/n]$ such that $D=tX$ satisfies $\|D\|_2\leqδ$ and $\mathrm{gap}(T+D)>c\,δ^2n^{-12}$ for an absolute constant $c>0$. The construction uses a classical convex weighted eigenvalue sum and its finite-scale slope variation. A tridiagonal localization argument turns near-degenerate eigenvalues into separated responses to the fixed diagonal direction, yielding a quantitative gap certificate. An adaptive interval selector then identifies a certifying window in at most $\lceil\log_2(16n^3)\rceil$ refinements, using $O(\log n)$ evaluations of the weighted eigenvalue sum to inverse-polynomial accuracy. A structure-exploiting implementation uses rigorous Sturm eigenvalue enclosures and adaptive precision to certify the stopping condition on six families of test matrices. The directly certified gaps are substantially larger than the worst-case analytical bounds, illustrating both the effectiveness of the construction and the conservatism of the universal certificate. Our results give a deterministic answer to the eigenvalue-separation question underlying the deterministic Minami perturbation problem for tridiagonal matrices.

comments
26 pages, 4 figures. Code and data: https://github.com/KateWenqiZhu/spectral-separation-certificates
fields
Numerical Analysis
pdf ↗ page arXiv:2611.21055 ↗

This paper establishes global numerical analysis for the long-time behavior of Lie advection–diffusion of differential forms discretized by finite element exterior calculus (FEEC). For potential flows we prove a weighted Hodge decomposition implying convergence to harmonic forms of dimension equal to the Betti number, yielding a differential-form antidynamo theorem. For general advection, a mixed FEEC scheme is introduced and shown to preserve key structural properties: the dimension of closed stationary discrete $k$-forms is at least $b_k$. Under verified spectral-preservation assumptions (satisfied for small $h$ by spectral approximation and for arbitrary $h$ by a lowest-order exponential-fitting $M$-matrix discretization), discrete antidynamo theorems are obtained. In particular, on two-dimensional manifolds the numerical $1$-forms converge exponentially to a uniquely determined closed stationary form for every diffusion coefficient $η>0$, rigorously excluding spurious dynamo growth. The results guarantee that FEEC faithfully inherits the topological long-time asymptotics of the continuous system.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.21169 ↗

Transformers have demonstrated the ability to perform in-context learning, that is, to adapt to new tasks from a few examples without updating their parameters. Existing theory has largely focused on emulating gradient-based algorithms for convex statistical problems or establishing general function approximation guarantees without exploiting the underlying statistical structure. We study in-context parameter estimation and trajectory prediction for parametric ordinary differential equations (ODEs), where estimation is generally nonconvex. Under suitable identifiability and regularity conditions, we construct a transformer that estimates unknown system parameters from noisy trajectory observations through a two-stage approximate maximum likelihood procedure: a coarse search provides an initialization within a locally strongly convex region, followed by gradient descent with local linear contraction. For prediction, we compose this estimator with a neural approximation of the ODE solution map. We further show that, through parameter sharing, a single transformer can perform both parameter estimation and trajectory prediction simultaneously. For these constructions, we establish nonasymptotic guarantees and finite-pretraining oracle inequalities that separate errors due to finite pretraining data, finite context length, and finite-sized transformer approximation. Numerical experiments on linear and nonlinear ODEs further show that pretrained transformers can benefit from longer inference contexts without updating their weights.

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

This paper presents a computational model integrating transmural drug transport, smooth muscle cell contraction, nonlinear anisotropic material behavior, and residual stresses to investigate the effects of calcium channel blockers~(CCBs) on local stress distributions in atherosclerotic arteries. The balance of linear momentum is coupled with a three-dimensional reaction-diffusion equation for the drug transport. Smooth muscle contraction is modeled phenomenologically based on a chemo-mechanical model that incorporates the effects of stretch on intracellular calcium dynamics and calcium sensitization. A novel drug-tissue interaction model is proposed to capture the effects of CCBs on intracellular calcium and thus on smooth muscle contraction. Material parameters are identified by fitting to experimental data from the literature and finite element simulations are conducted on five exemplary atherosclerotic arterial geometries reconstructed from histological cross-sections. Simulation results show that although CCBs reduce the stresses in the media through reduced smooth muscle contraction, they shift load to the fibrous cap, whose stress increases in all five geometries (median of up to 28.9~kPa). This increase varies strongly between plaque morphologies and becomes smaller with lower smooth muscle tone before treatment, lower drug concentrations in the arterial wall and increasing axial pre-stretch. A blood pressure reduction of 10~mmHg already lowers it to a median of at most 3.8~kPa in four of the five geometries. Our findings suggest that CCBs may increase the rupture risk of vulnerable plaques with highly loaded fibrous caps under insufficient blood pressure reduction, which remains to be confirmed experimentally and clinically.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.21320 ↗

Physics-informed operator learning trains neural operators on the residual of a parametric partial differential equation (PDE) instead of labeled solution data, but its reliability depends on a variationally correct residual: one that is equivalent to the error in a norm dictated by the equation, the PDE-compliant norm. For nonlinear equations written as first-order systems, we prove that the first-order system least-squares residual is equivalent to the error in this norm near a solution branch if the linearized residual is stable and the residual derivative is Lipschitz continuous, possibly in a norm stronger than the error norm. We verify these conditions for monotone reaction, solution- and gradient-dependent diffusion, and compressible Neo-Hookean hyperelasticity. The stability mechanisms vary across these classes, as do the regions where the equivalence holds, from arbitrary bounded sets to a neighborhood of the branch. In a conforming finite element space, we show that the loss excess of a state near the finite element solution is equivalent to its squared distance from that solution. We use this loss to train a reduced basis neural operator with values in this space, with solution snapshots needed only for the basis and the loss and its symbolically derived gradient assembled by the finite element library. At inference, this loss estimates the error. Numerically, the square root of the loss excess tracks the error within factors comparable to those of the linear case, and the operator achieves higher accuracy in the PDE-compliant norm than grid-based baselines evaluated in the same finite element space.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.21469 ↗

High-dimensional function approximation is often subject to the curse of dimensionality, commonly described by a hypercube scaling regime with a large expense of $R^d$ grid points, where $R$ denotes the side length of a hypercube in $d$ dimensions. Here we show that a second scaling regime, which we call the lattice ball scaling regime, also arises and is relevant for practical applications. In this regime, the expense scales as $d^{R^2}/(R^2!)$ and therefore grows polynomially with $d$. This regime arises without additional special assumptions of special types of function spaces or error norms. The lattice ball scaling regime occurs when $R^2\ll d$, due to the discrete nature of counting the expense as the number of lattice points inside a hypersphere. Here we investigate this regime, which arises from the classical problem of approximating high-dimensional functions from common spaces of analytic or $m$-times continuously differentiable functions using orthogonal series (spectral method) such as Fourier, Chebyshev, and Legendre polynomial series. For many applications, the expense in the lattice ball scaling regime can be substantially smaller than that of the hypercube scaling regime, making accurate approximations more accessible. Numerical illustrations include classifying images of handwritten digits from the MNIST dataset and learning the solution operators of partial differential equations, such as Burgers' equation and the radiative transfer equation. The potential for connections with artificial neural networks and other machine learning methods is also discussed.

comments
12 pages, 8 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.21566 ↗

AI coding agents can now produce numerical software faster than human experts can review it, raising serious concerns about usability and reliability. These and other AI tools are already transforming mathematics and software, and they will soon transform mathematical software. These concerns motivated us to assess AI-generated numerical linear algebra (NLA) kernels, which we did through an audit of a recent public GPU QR competition. All five leading kernels passed the competition's accuracy tests, and the winning kernel achieved a 107-fold speedup over the competition's baseline, which calls NVIDIA's QR routine. Yet each failed at least once on new inputs, even those from the competition's generator, under the same checker, while the baseline passed them all. In light of this, we want to develop reusable formalizations of numerical analysis methods, which remain sparsely represented in existing formal libraries. We describe VSCL, our Lean library of mathematical foundations for numerical computing. We also propose VERNA to connect these tasks by using formalized results to guide kernel assessment against explicit specifications. Drawing on Turing's work on rounding-error analysis and program checking, we discuss design principles for developing trustworthy numerical software when direct human checking is impractical.

comments
44 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.21570 ↗

Probability50

For an insurance portfolio modelled by a large number of i.i.d. losses, the average loss converges to its expected value by the law of large numbers, reflecting the diversification effect of pooling risks. Policy cancellations reduce the portfolio size and thereby weaken this effect. We quantify the resulting increase in risk by applying risk measures to the average loss before and after the cancellation of policies. For a portfolio of size $n$, we show that the impact of cancelling a single contract is of order $n^{-3/2}$, while the cancellation of a fixed proportion of contracts has an effect of order $n^{-1/2}$. We further extend the proportional cancellation regime to heterogeneous portfolios with different cancellation rates and risk characteristics across segments. These asymptotic results provide a quantitative basis for assessing surrender fees and cancellation costs from the insurer's perspective. We complement the theoretical analysis with numerical results for representative life insurance products, illustrating the magnitude of cancellation costs and the effect of portfolio aggregation. The two regimes require different techniques. For the cancellation of a fixed proportion of contracts, we employ central limit theorems in Wasserstein distance. For the cancellation of a single contract, we combine Kantorovich-Rubinstein duality with higher-order distributional approximations based on the Edgeworth and Cornish-Fisher expansions.

comments
43 pages, 2 figures
fields
Probability
pdf ↗ page arXiv:2611.18660 ↗

Threshold crossings in exponentially relaxing shot noise depend on the interplay between incoming impulses and the residual signal left by earlier arrivals. For renewal input, existing high-threshold product approximations of the mean first-passage time (MFPT) leave open when evaluation at a single index preserves the mean with vanishing relative error. Here we derive an exact finite-threshold MFPT series for exponentially marked renewal shot noise and recast it as an average over an auxiliary Poisson index. When the waiting-time density exhibits short-time power-law behavior, $w(t)\sim ct^{κ-1}$, the dominant series contributions shift from the Poisson center by an amount of order $x^{1-κ}$, whereas the averaging kernel has a fluctuation width of order $\sqrt{x}$, with $x=λb$. The competition between these scales yields a crossover at $κ=1/2$, where the deterministic-index product is asymptotically exact in ratio above this boundary, requires a finite multiplicative correction at criticality, and exhibits a growing logarithmic discrepancy below it. A moving-saddle approximation also yields an asymptotically exact MFPT ratio under general strictly positive, finite-mean waiting times. Numerical comparisons across Gamma, Weibull, and generalized-Gamma renewal laws illustrate the approximation regimes and their finite-threshold accuracy. Together, these results provide an exact finite-threshold benchmark for the mean first-passage time and reveal how short-gap renewal statistics determine the asymptotic accuracy of high-threshold approximations.

fields
Probability
pdf ↗ page arXiv:2611.18675 ↗

Two credit models can quote the same bond prices today and still disagree on how information about the issuer unfolds over time. We quantify this disagreement by means of the adapted Wasserstein distance, an optimal transport distance between laws of processes consistent with the flow of information associated with them. For defaultable bond price processes, the squared distance is the smallest probability by which the two default indicators must disagree. This yields closed-form distances for rating reviews and a dynamic programming principle for multi-period rating migration. For a single review, the distance can be estimated from observed posterior survival probabilities at the parametric rate without losing calibration. For intensity models, we obtain an explicit formula for the adapted distance between bond prices that controls the error of bootstrap hedges along a quoted term structure, determine its sharp range over hazard schedules calibrated to the same prices, and show that it is stable under perturbations of the hazard rates. Finally, we complement the theoretical findings with applications to S&P transition data and Monte Carlo experiments to illustrate the size of these effects.

comments
Comments very welcome!
fields
Probability
pdf ↗ page arXiv:2611.18677 ↗

In this paper we study the finite-time asymptotic behavior of the entrance probability of the discounted aggregate claims into an extreme region in a multidimensional risk model. Our non-standard risk model is not restricted to the Levy-Renewal framework, that represents a usual assumption for the stochastic returns and the counting process of the claim vectors, respectively. For the modeling of the distribution of claim vectors, we introduce the notion of set-based multivariate (strongly) regularly varying distributions. For the new set-based classes we provide certain closure properties and some examples to show the difference from the usual definitions of multivariate regularly varying distributions. This set-based framework provides a broad and flexible framework to the actuarial applications, and facilitates the modeling of dependence among the claim vectors that arrive at different time epochs. The two main results of the paper establish a unified asymptotic expression, that demonstrates the presence of multivariate linear single big jump principle. Despite of the assumptions the asymptotic expression remains explicit. In the first main result we suppose that the common distribution of the claim vectors belongs to the class of set-based multivariate regularly varying distributions, and the stochastic returns satisfy a general moment condition. In the second main result, we restrict the claim vectors in the class of setbased multivariate strongly regularly varying distributions, relaxing the moment condition on the stochastic returns. Finally, we conduct a numerical study to illustrate the accuracy of the proposed asymptotic approximation and investigate its sensitivity to the main model parameters.

fields
Probability
pdf ↗ page arXiv:2611.18681 ↗

We propose there a new type of unidimensional discrete-time risk model in ruin theory involving both main claims and by-claims, where the latter ones are counted thanks to an INAR(1) process. In this way, the model embodies a contagion phenomenon, which may be used to describe the damages caused and covered by an insurance company ensuing the spreading of PFAS compounds in the environment. We present mostly asymptotic ruin probabilities, and multiple comparisons with other models derived from the aforementioned one, in particular with two models where the dependence assumptions are relaxed.

fields
Probability
pdf ↗ page arXiv:2611.18704 ↗

An absorbing default process imposes joint restrictions on cumulative default distributions across horizons. We characterize these restrictions for finite homogeneous portfolios. For binomial mixtures whose mixing distribution functions cross at most once, stochastic ordering of the entire default count is equivalent to two inequalities: the probability of no defaults must be nonincreasing and the probability of all defaults must be nondecreasing. In the one-factor Gaussian model, these inequalities give an exact interval of admissible later correlations, obtained from two scalar equations. The intervals are nested as portfolio size increases. If the earlier and later default probabilities are $p_0<p_1$ and the earlier latent correlation is $ρ_0\in(0,1)$, both interval boundaries approach $ρ_0$ at rate $(\log n)^{-1/2}$, with common leading magnitude $ρ_0\sqrt{2(1-ρ_0)}[Φ^{-1}(p_1)-Φ^{-1}(p_0)]$. We also give a constructive absorbing coupling, an exact sequential repair, differential conditions for smooth horizon curves, and a finite-size certificate of incompatibility. Log-domain quadrature, bracketed root finding, and deterministic numerical experiments evaluate the intervals and verify the restrictions on the full count distribution. The framework provides a feasibility analysis of prescribed horizon laws.

fields
Probability
pdf ↗ page arXiv:2611.18759 ↗

Gene genealogies along a chromosome are dependent not only because nearby alleles tend to experience no recombination and are therefore inherited together, but also because alleles at different loci may share parental histories through a common ancestor. Disentangling physical linkage and shared parental trajectories is key to understanding how demography shapes genetic diversity. We develop a mathematical framework for describing the joint genealogies of sampled alleles in a finite admixed population, tracing their ancestry backward to the source populations while explicitly accounting for parental relationships and recombination events. Under a Wright–Fisher model, we show that the joint gene genealogy forms an absorbing Markov chain, derive the likelihood of local ancestry, and connect it to other quantities of interest, notably the admixture fraction. We further establish that, once demographic parameters become constant, local ancestry converges to distinct limiting distributions depending on the demographic setting. Under isolation, chromosomes undergo infinitely many recombination events and linkage disequilibrium is due to drift within population replicates, retaining traces of past admixture events. Under constant gene flow from source populations, recent contributions progressively erase the influence of earlier ancestry. Using the joint genealogy of two alleles, we obtain the limiting variance of admixture fractions in both regimes. We illustrate our framework's flexibility through simulations of endogamy and selection. These examples show how genetic diversity depends on the structure of underlying parental relationships. Our work provides a framework for specifying and analyzing complex demographic scenarios and clarifies the links between local ancestry and mating patterns.

fields
Probability
pdf ↗ page arXiv:2611.18781 ↗

For a directed polymer in a discrete fractional Gaussian environment, we identify the scaling limit of its partition field with the renormalized Stratonovich solution of the one-dimensional parabolic Anderson model with fractional noise and flat initial condition. The underlying walk is simple and symmetric, and the temporal and spatial Hurst indices satisfy $H_0>\frac12$, $\frac12\le H_1<1$ and $2H_0+H_1<2$. After an explicit deterministic normalization, the interpolated partition field converges in law in $C_{\rm loc}([0,\infty)\times\R)$, with convergence of all finite moments of its supremum norm on compacts. We construct the limiting field directly by smoothing the noise in the equation and subtracting the corresponding stationary counterterm. The classical solutions converge in $L^p(Ω;C(\mathcal K))$ for every $1\le p<\infty$ and every compact space-time rectangle $\mathcal K$, including those that meet the initial line $t=0$. For $2H_0+H_1>\frac53$, the limit agrees with the solution that Chen, Ouyang, Tindel and the author constructed using regularity structures. The construction also covers the new range $\frac32<2H_0+H_1\le\frac53$. The proofs rely on Feynman-Kac representations and on estimates and invariance principles for weighted self- and mutual intersections of random walks and Brownian motions, together with uniform increment estimates and Gaussian hypercontractivity.

fields
Probability
pdf ↗ page arXiv:2611.18812 ↗

Let $X\in\mathbb{R}^d$ be a log-concave random vector, and let $N$ be a seminorm on $\mathbb{R}^d$. For $p\ge 1$, we show that $\|N(X)\|_p$ is at most $\mathbb{E} N(X)+C s_p$, where $s_p$ is the supremum of $\|u(X)\|_p$ over all linear functionals $u$ satisfying $|u(x)|\le N(x)$ for every $x\in\mathbb{R}^d$. A choice for $C$ is $2+5e/2$. This bound implies Latała's conjecture on weak and strong moments.

fields
Probability
pdf ↗ page arXiv:2611.18867 ↗

The Ising model under Glauber dynamics on the torus is known to exhibit a phase transition in its mixing time. The mixing is exponentially slow when $β>β_c$ and logarithmically fast when $β<β_c$. In this paper, we generalize the slow-mixing result to $\mathbb{Z}_2$ hyperlattice gauge theory when $β$ is large enough. This is a higher-dimensional analogue of the Ising model, with spins on $k$-cells. Specifically, on the torus of any dimension $m \ge k+2$, we prove explicit exponential lower bounds on the mixing time of Glauber dynamics when $β$ is sufficiently large. More precisely, we prove that the result holds for a broader class of dynamics, allowing more than one $k$-cell to change its value at each step of the algorithm. Finally, we show that there are distinct slow and rapid mixing regimes, as for sufficiently small $β$ the Dobrushin condition is satisfied for Glauber dynamics under the heat-bath rule, which implies logarithmic mixing.

comments
49 pages, 6 figures
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.19051 ↗

We develop the high-dimensional effective dynamics for adaptive, momentum-based variants of Stochastic Gradient Descent (SGD). These effective dynamics are given by a Markov process. They key observation is that the non-Markovianity in the algorithm due to the exponential moving average and preconditioning can be treated using the method of averaging. Our approach applies to a broad class of algorithms including to Adaptive momentum estimation (ADAM), Momentum orthogonalized by Newton-Schultz (MUON), and its variants. It also applies to a broad class of learning tasks, such at tensor PCA, Gaussian projective models, teacher-student networks, and a multi-layer neural network trained on the XOR problem using a hybrid of MUON and ADAM as commonly done in practice. We demonstrate how to this technique can give precise, quantitative comparisons between algorithms. In particular, we find interesting phenomena, such as the cross-over phenomenon where online SGD has better generalization than ADAM early in training until the learning curves cross and ADAM dominates. Furthermore, we prove a version of the Edge of Stability phenomenon. In particular, we introduce an analogue of the infinity Laplacian that sharply characterizes the Edge of Stability.

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

We develop a regeneration scheme for the one-dimensional contact process with temporary immunity, also known as the spatial SIRS process, a non-attractive interacting particle system. The key ingredient is a one-sided space-time shielding mechanism, constructed from infinite infection paths of an auxiliary process. These paths separate the evolution of the infection front from the configuration and graphical history left behind, allowing us to construct regeneration times without relying on attractiveness. The same shielding mechanism also provides coupling arguments for processes started from different initial configurations. Using this approach, we establish a law of large numbers and a functional central limit theorem for the right edge, existence and uniqueness of an invariant law for the process seen from the edge, and complete convergence. We also prove survival from every nonempty finite infected set for sufficiently large immunity-loss rates and derive an explicit extinction criterion.

fields
Probability
pdf ↗ page arXiv:2611.19114 ↗

We establish strong well-posedness for one-dimensional stochastic differential equations whose drift and diffusion coefficients depend on a prescribed quantile of the solution's marginal law. The diffusion coefficient is uniformly non-degenerate and Hölder continuous in space. The drift is the sum of a non-increasing Hölder-continuous component and a globally Lipschitz component of at most linear growth. Both components are Lipschitz continuous in the quantile variable. The main obstacles are the limited spatial regularity of the diffusion and the quantitative control of quantiles in terms of the $L^1$-distance between densities. We freeze the quantile path and combine uniform Hölder estimates for the resulting densities with a cancellation argument for the second-order diffusion perturbation. This yields an $L^1$-stability estimate for the frozen density flows and, together with uniform tail bounds and positive lower density bounds, a Volterra-type estimate for the frozen quantile map. An exponentially weighted supremum norm makes this map a strict contraction on $[0,T]$, giving a unique self-consistent quantile path and hence a unique strong solution. When the diffusion coefficient is independent of the quantile variable, the Yamada–Watanabe approximation also yields stability with respect to the initial condition.

comments
30 pages
fields
Probability
pdf ↗ page arXiv:2611.19222 ↗

We show that every stationary solution of the Dobrushin–Lanford–Ruelle (DLR) equations for the one-dimensional log-gas with a quantitative control on its number variance minimizes the free energy functional. This yields a DLR variational principle for this continuous long-range system. Moreover, we show that any limit point of the finite-volume log-gases is stationary and satisfies this condition. This allows us to give a new, physical proof of the existence of a microscopic limit for the Gaussian Beta Ensembles, known as the Sine-beta point process.

comments
46p
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.19271 ↗

We introduce and study a one-dimensional singular birth-death model constructed from Itô's Brownian excursion measure. In this model, particles are born at the origin at infinite rate, evolve as Brownian excursions away from the origin, and are killed upon returning to the origin. Although the number of particles alive at any fixed deterministic time is almost surely finite, we prove that the set of exceptional times at which infinitely many particles are alive is almost surely dense and has Hausdorff dimension $1/2$. We further investigate the spatial structure of the particle system at such exceptional times. In particular, we identify the critical near-origin profile of the infinite particle cloud, which is governed by a scale of order $\log\log(1/|x|)^{-1}$ as $x\downarrow0$. Finally, we establish laws of large numbers and central limit theorems for two natural observables of the system: the $α$-power sum of the positions of all alive particles and the top particle position.

fields
Probability
pdf ↗ page arXiv:2611.19362 ↗

Let $\{Y_{n}, n\geq 0\}$ be a critical branching process with immigration. Under the minimal moment restrictions, namely, assuming finite variance for the number of particles of the offspring and finite mean for the number of immigrating particles, we obtain a local limit theorem for the process $\{Y_{n}\}$.

comments
31 page, no figures
fields
Probability
pdf ↗ page arXiv:2611.19363 ↗

Transition path time is the time it takes a system to move from the initial state (State A) to a final state (State B) without recrossing back to State A in between. The transition path time is probabilistic in nature, and considerable research has been devoted to studying its distribution. In this paper, we derive a governing integral equation that expresses the density of the transition path time in terms of the probability density of the first passage time, which is well understood. An efficient numerical method is provided to solve this governing equation. Several numerical examples are presented to validate the governing equation and to compare the densities of the transition path time and the first passage time.

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

In this paper, we study Edgeworth expansions for random variables belonging to a fixed finite sum of Wiener chaoses. Building on the work of Mansanarez, Poly and Swan (arXiv:2510.14002) for a single Wiener chaos, we investigate the extension of their approach to functionals $F$ living in a finite sum of Wiener chaoses $\mathcal{W}_{\leq d}$. Within the Malliavin–Stein framework, we bound the total variation distance between the law of $F$ and its Edgeworth approximation of order $2dm$ by $(\sum_{p,q}^d \operatorname{Var}Γ(F_p,F_q))^{m/2}(\operatorname{Var}Γ(F,\operatorname{L}^{-1}F))^{1/2}$, where $F_p$ denotes the projection of $F$ onto the $p$-th Wiener chaos. The presence of several chaotic components introduces additional interactions, since these components are orthogonal but generally dependent. Since our proof relies on the integration-by-parts formalism and the spectral properties of the Ornstein-Uhlenbeck operator, this result extends naturally to the broader framework of Markov chaoses.

comments
47 pages
fields
Probability
pdf ↗ page arXiv:2611.19528 ↗

We study the classical secretary problem with a fixed number of selection opportunities. We derive explicit corrections to the limiting thresholds and to the optimal success probability. A cancellation identity removes the influence of later threshold rounding from the first correction, while a Poisson representation explains its probabilistic meaning. Every bounded rounding of the limiting thresholds shares the first value correction. We obtain integer rounding laws, eventual threshold identities along continued-fraction convergents, and joint rounding frequencies. Rigorous rational bounds show that the first eleven corrections are positive and the twelfth is negative, producing the first shifted convergent identity.

comments
14 pages, 2 tables; ancillary verification code and certificates included
fields
Probability, Optimization and Control
pdf ↗ page arXiv:2611.19541 ↗

We study nonnegativity of the volatility in the continuous-time Guyon-Lekeufack model, in which volatility is an affine function of the convolution of past returns with a kernel $K_1$ and the square root of the integral of past squared returns weighted by a kernel $K_2$. We show that, when volatility is nonnegative and $K_1$ admits a resolvent of the first kind, uniform boundedness of integrals of $K_2$ with respect to this resolvent yields a deterministic upper bound for the asset price, which is then a bounded martingale on every finite time interval. This result is the counterpart of the strict local martingality criterion for negative volatility in Guyon, Jeannin and Jourdain (2026, Corollary 2.6(ii)). We also derive such bounds for popular stochastic volatility models when the Brownian motions driving the asset price and volatility have correlation $-1$. We give sufficient conditions for nonnegative volatility with a completely monotone return convolution kernel $K_1$, and necessary conditions when $K_1$ and $K_2$ are respectively $M$- and $N$-exponential kernels. For $M=1$, we obtain a necessary and sufficient condition.

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

Agents operating in complex scenarios often face uncertainty due to incomplete information about the environment they operate in, ambiguous user queries, complex business rules and the inherently stochastic dynamics of the governing policy. Several new benchmarks have been proposed to evaluate LLM-based agents on complex tasks in multi-tool environments, including settings with policy constraints and varying levels of intent ambiguity. These conditions make it important to evaluate agentic systems systematically and quantify their performance under different conditions to assess their reliability in production. This need is evident in the recently introduced Thinkingbox benchmark, where even the strongest models struggle to perform consistently across diverse business scenarios. This paper presents a statistical framework for evaluating uncertainty and reliability in agentic systems. We define a hierarchy of scenarios, instances, and samples to assess model performance and variability systematically. We apply this framework to common metrics found in the literature: mean pass rate, $pass@k$, and $passhat^k$, with uncertainty estimates for each metric. Aggregating metrics at different levels of the hierarchy reveals different structures and properties of the policy model; we connect this hierarchical aggregation with the known process of \emph{coarse-graining} as intended in the physics and statistical literature. We independently derive exact finite-sample expressions for the sampling variances of the unbiased $pass@k$ and $passhatk$ estimators; related results also appear in recent submissions. Our central contribution is a constructive derivation of hierarchical uncertainty propagation, making explicit its correspondence with coarse-graining and separating execution noise from task heterogeneity.

fields
Probability
pdf ↗ page arXiv:2611.19614 ↗

Conic combinations play an important role across mathematics in areas such as optimization, non-negative matrix factorization, and sparse coding. Frames which span their underlying space using only conic combinations, known as positive spanning sets or conic frames, are of special interest in derivative free optimization. In particular, sets with large cosine measure, a measure of how spread out the vectors are, are favored. We focus on the asymptotics of the cosine measure of Gaussian frames and present tail bounds in a variety of regimes.

comments
47 pages, 0 figures
fields
Probability, Functional Analysis
pdf ↗ page arXiv:2611.19629 ↗

We consider the Dirichlet/Kolmogorov operator associated with the stochastic quantization of the $Φ^4$ model on the plane whose domain is restricted to the space of smooth cylindrical functions. We prove that its closure is maximally dissipative in $L^p$. Our result implies the so-called $L^p$-uniqueness of the Dirichlet operator for every $1\le p<\infty$. In particular, essential self-adjointness and Markov uniqueness follow. The key ingredient is an estimate for the linearized equation for the dynamical $Φ^4_2$ model. The proof is based on techniques from singular SPDE theory and the stopping time argument introduced by Kunick and Tsatsoulis.

comments
35 pages
fields
Probability
pdf ↗ page arXiv:2611.19677 ↗

We study how routing information determines stationary congestion in many-server systems with Poisson arrivals and homogeneous exponential servers. We consider policies that prioritize idle servers and select a queue stochastically no longer than a uniformly sampled queue. In nondegenerate slowdown, where spare capacity is fixed, we identify population laws from the fraction of queues with waiting jobs at each population level. We establish these laws for one-job priority, join-idle-queue, and idle-first sampling. One-job priority attains the join-the-shortest-queue population law and mean delays; further queue information can improve limiting delays in convex order without changing their means. In the super-Halfin-Whitt and Halfin-Whitt regimes, every such policy has the same stationary limits. Our estimates bound idleness-weighted occupancy tails in terms of ordinary tails, uniformly over queue-length thresholds and policies. They also yield process convergence and limit interchange for initial laws uniformly dominated by stationarity, with convergent scaled initial states.

fields
Probability
pdf ↗ page arXiv:2611.19766 ↗

This work establishes moderate deviation principles for semilinear stochastic evolution equations with coefficients depending on fast Markov environments. The environment is either an exponentially ergodic Markov process on a Polish space, independent of the noise, or a finite-state Markov chain whose transition rates depend on time and on a finite-dimensional observation of the state. The rate function is quadratic in the residual of the linearized dynamics. Its covariance is the sum of the averaged covariance of the Wiener noise and the asymptotic covariance generated by the environment, given by a Green–Kubo formula in the independent case and by a Poisson equation in the switching case. The rate function is written with the Moore–Penrose inverse of the square root of this covariance and requires the residual to lie in its range, not merely in the closure. This allows degenerate covariances and nonclosed ranges. In the switching case, the dependence of the invariant distribution on the slow state adds an extra term to the linearized drift. Since the stochastic convolution is not a semimartingale, the proofs combine the regeneration split chain technique with Galerkin approximation. The assumptions are verified for stochastic reaction–diffusion equations, including space-time white noise in one spatial dimension.

comments
68 pages, 2 figures, comments are welcome!
fields
Probability
pdf ↗ page arXiv:2611.19769 ↗

We characterize, in the worst case over kernels, the sharp minimax width of online confidence intervals for elements of a reproducing kernel Hilbert space (RKHS). This resolves the open problem posed by Vakili et al. (2021) in its original discrete-time form. A learner observes $y_i=f(x_i)+ε_i$ at adaptively chosen points, with $\|f\|_{\mathcal H_k}\le B$ and i.i.d. $R$-sub-Gaussian noise, and reports the interval $|f(x)-μ_n(x)|\leρ_n(δ)σ_n(x)$, where $μ_n$ and $σ_n$ are the posterior mean and standard deviation of a surrogate Gaussian process model with regularization parameter $λ$. Writing $ρ_n^*(δ)$ for the minimax confidence width for a fixed kernel, we show that, for the sum of a linear kernel and a periodic Sobolev kernel, all sufficiently large $n$, and all $δ\in(0,1/4]$, $ρ_n^*(δ)\asymp B+(R/λ)\sqrt{γ_n+\log(1/δ)}$, where $γ_n$ is the maximal information gain and grows polynomially in $n$. Building on Lattimore (2023), we construct an adaptive design on a fixed two-dimensional domain for which, under Gaussian noise, the normalized error at a prespecified point is $Ω(B+(R/λ)\sqrt{γ_n})$ with constant probability. This rules out the conjectured polylogarithmic width in the worst case over kernels and online designs.

fields
Probability
pdf ↗ page arXiv:2611.19772 ↗

Uniform sampling of linear extensions is a basic problem in randomized algorithms and the study of finite posets. We prove that the random-to-random shuffle of Ayyer, Schilling, and Thiéry mixes in $O(n\log n+n\log(1/\varepsilon))$ steps on every $n$-element poset, establishing their conjectured mixing order. With constant-time order queries, this gives an $\varepsilon$-approximate uniform sampler using $O(n^2(\log n+\log(1/\varepsilon)))$ elementary operations after preprocessing. The proof establishes relative-entropy contraction by a factor $1-1/n$ for the promotion half-step. Consequently, the uniform extended-promotion chain has the same mixing order. We represent complete promotion scans as reflected coordinate paths in the order polytope and prove that a convex potential with gradients in the same polytope has diagonal Hessian mass at most one along each path. Applying this estimate to an optimal transport potential yields a sharp entropy factorization for every finite-entropy input. Linearization also gives the spectral-gap lower bound $(n+1)/n^2$.

fields
Probability
pdf ↗ page arXiv:2611.19829 ↗

Consider a diagonal random walk $(X_n,Y_n)$ on $\mathbb{Z}^2$ with transition probabilities depending only on the second coordinate. We characterise the distributions of first passage locations, $X(τ_a)$, where $τ_a$ is the first time $Y_n$ reaches level $a$. We obtain a necessary and sufficient condition for a given distribution to be realised as a rescaled first passage location from some starting level. The proof extends Bondesson's method for one-dimensional first passage times. It combines a transformation of generating functions based on Pick functions with a construction using barriers. We also study maximal representations of generating functions of first passage locations and show that analogous converse results for standard and honeycomb random walks require additional restrictions.

comments
24 pages
fields
Probability
pdf ↗ page arXiv:2611.19928 ↗

We introduce stochastic multivariate Taylor measure functions (SMTMFs), which extend the multivariate Taylor measure function framework through random Taylor coefficients and a possibly random Taylor parameter. We establish their measurability properties and derive sufficient conditions for the associated processes to be martingales, including criteria based on conditional covariance and continuous semimartingale decompositions. We construct standard Brownian motion as an almost surely uniformly convergent limit of finite SMTMFs using the Levy-Ciesielski representation. We also show that the completion of the finite stochastic MTMF space under the expected uniform norm contains Brownian motion, Brownian bridges, fractional Brownian motion with Hurst parameter H, and Ornstein-Uhlenbeck processes with integrable initial conditions. Our main result characterizes this completion as the Bochner space, under an admissibility condition on jointly measurable stochastic Taylor coefficients. The proof uses dyadic piecewise linear interpolation to approximate integrable continuous stochastic processes in the expected uniform norm. Thus, the completed SMTMF space encompasses the full class of integrable continuous random functions on a compact time interval.

comments
63 pages; Keywords: Bochner space; Brownian motion; fractional Brownian motion; Martingales; Semimartingales; Stochastic multivariate Taylor measure functions
fields
Probability, Functional Analysis, Statistics Theory
pdf ↗ page arXiv:2611.20027 ↗

This paper presents a graph theory assisted method that checks a sufficient condition for the existence of the limiting probability distribution of a higher order Markov chain and identifies this distribution when the condition is satisfied. This method is more effective as compared to the direct verification of the condition since the latter hinges wholly on computations of the full spectrum on a large-size transition matrix. Even though the graph theoretic tools employed here are well known, their utilization in the context of a higher order Markov chain is new. This method is also implemented as an easy-to-use MATLAB function {\tt gtam}. Several illustrative examples are provided too.

fields
Probability
pdf ↗ page arXiv:2611.20043 ↗

Let $φ_N$ be the planar discrete Gaussian free field in $[-2N,2N]^2\cap\mathbb Z^2$, with zero boundary condition imposed by killing the associated simple random walk on exit. We consider the least height $H_N$ at which the two-sided level set $\{|φ_N|\leq a\}$ contains a nearest-neighbor left–right crossing of $[-N,N]^2\cap\mathbb Z^2$. We prove that $(H_N)_{N\geq1}$ is tight, uniformly over all box sizes. More precisely, for every $a\geq0$ and $N\geq1$, \[ Φ\!\left(-a\sqrt{\frac{2}{\log2}}\right) \leq\mathbb{P}(H_N>a) \leq4\exp\!\left\{-2^{-29}\frac{a^2}{\log(2+a)}\right\}, \] where $Φ$ is the standard normal distribution function. The upper bound yields uniform polynomial moments and a uniform exponential moment of $H_N^2/\log(2+H_N)$. For the upper bound, we compare a marked loop-soup exploration with a graph in which independent site variables open incoming edges. We then estimate connections in a massive field using two auxiliary vertices and bound the Gaussian remainder when the mass is removed. The lower bound uses a Gaussian translation inequality and a square-shell estimate for the Dirichlet energy, without using the massive-field argument. In particular, a height independent of $N$ gives any prescribed crossing probability below one, whereas every fixed finite height has a uniformly positive failure probability.

comments
84 pages
fields
Probability
pdf ↗ page arXiv:2611.20051 ↗

We study a system of Brownian particles on the real line whose jump intensities are excited by pairwise collision local times and decay exponentially between encounters. For every finite number of particles and every interaction strength, we construct a global solution and prove uniqueness in law. Under mean-field scaling, exchangeable chaotic initial data, and uniform integrability of the initial intensities, we prove propagation of chaos on path space. The limit is a nonlinear jump-diffusion whose intensity is driven by the density of its own position; it is unique among such processes with locally bounded mean intensity. The proof combines uniform intensity and local-time estimates, tightness of particle and pair empirical measures, identification of conditional collision local times, and a coupling argument for nonlinear uniqueness. No moment assumptions are imposed on the initial positions or the jump-size distribution.

fields
Probability
pdf ↗ page arXiv:2611.20101 ↗

We establish a central limit theorem, the feedback-driven central limit theorem, for sums whose summands are independent noise variables multiplied by an amplitude that depends on the preceding normalized sum $y$. The summands are martingale differences whose conditional variance, $c+b\,y^{2}$, depends quadratically on $y$, with feedback strength $b$; unlike in the martingale central limit theorem, this conditional variance does not settle to a constant. The noise has finite variance; for positive feedback we assume, as in Lyapunov's theorem, a finite third moment, and for negative feedback bounded noise, so that the conditional variance stays nonnegative. For positive feedback, the normalized sum converges to a Student law, equivalently a $q$-Gaussian with $1<q<2$, independently of the noise distribution. For negative feedback, it converges to a compactly supported density, which is a $q$-Gaussian with $q<1$ when $-\tfrac12<b<0$. The Gaussian law, $q=1$, is recovered at zero feedback, while the Cauchy law, $q=2$, is obtained only as a limiting case, in a triangular array in which the feedback grows slowly with the number of terms. Thus every $q<2$ is obtained for a fixed feedback strength, and $q=2$ as a limit. We further show that the balance identity behind the theorem singles out quadratic feedback: a $q$-Gaussian with $q<2$ satisfies it only for a quadratic conditional variance, and no $q$-Gaussian with $2\le q<3$ satisfies it for any conditional variance. The proofs use the method of moments for negative feedback and a Wasserstein coupling argument for positive feedback, including cases in which the limiting variance is infinite.

comments
35 pages, 3 figures
fields
Probability
pdf ↗ page arXiv:2611.20201 ↗

We introduce \emph{decorated lattices}, a point process obtained by placing finite random point configurations in lattice cells. A stationary mark field selects the motif laws and acts as a random environment transmitting dependence between cells, while allowing flexible local arrangements. Using this construction, one can efficiently generate large regions of disordered patterns with desired local behavior while the random environment controls the asymptotic density fluctuations. Under moment and summability assumptions, we derive an explicit decomposition of the Bartlett spectral measure into contributions from conditional motif fluctuations and correlations between marks. This yields criteria for hyperuniformity, or generally $p$-uniformity. Independent, nondegenerate count fluctuations destroy hyperuniformity, whereas suitable dependence governed by the random environment can restore it despite random and unequal cell counts. Once count fluctuations are sufficiently suppressed, motif geometry and its spatial correlations govern the finer order of uniformity. Under mixing assumptions, we also establish central limit theorems for linear statistics, with fluctuations governed by cell counts or, at a finer scale, by the first spatial moments of the motifs.

fields
Probability
pdf ↗ page arXiv:2611.20213 ↗

We consider a system of Stochastic Differential Equations with two time scales, so called slow-fast system of SDEs. As customary when studying slow-fast dynamics, we seek a coarse grained description of the system, obtained, in the limit of scale separation, by 'averaging out' the fast component of the dynamics (so-called averaging limit). We study slow-fast systems where the fast variable is described by a process which is non-linear in the sense of McKean i.e. by an SDE whose coefficients depend on the law of the process itself, while the slow variable is a linear SDE (linear in the sense of McKean). We show that, when the fast variable is a McKean-Vlasov process and, additionally, the coefficients of the SDE depend on the position of the slow process, the limit of scale separation is not provided by the usual ansatz which one would expect by applying classical averaging paradigms. We identify the limit and provide complete proof.

fields
Probability
pdf ↗ page arXiv:2611.20224 ↗

In this note, we prove local central limit theorems and expansions in the central limit theorem for inhomogeneous Markov chains satisfying a one-step lower ellipticity condition. As for the local limit theorem, in the general inhomogeneous case, compared with \cite{DS}, we are able to prove results without two-sided ellipticity, although only in the one-step case. Compared with \cite{PeligradLLT1,PeligradLLT2}, we are able to prove local limit theorems without a lower $ψ$-mixing condition. Concerning Edgeworth expansions, compared with \cite{DHPTRF1}, we are able to get results without two-sided ellipticity (under some sequential Diophantine conditions). Our conditions are then verified for Markov chains in a random dynamical environment with a one-sided Doeblin condition under very mild assumptions. For Markov chains in a random environment, we also consider the more general case of $φ$-mixing chains and then, under some mild periodicity assumptions on the environment, we prove local central limit theorems and first-order Edgeworth expansions (without any ellipticity assumptions), matching the results for deterministic homogeneous chains. When the chain is driven by a topologically mixing subshift of finite type, we obtain high-order expansions for $φ$-mixing chains under some Diophantine conditions of a deterministic system generated by a periodic point. We then apply our results to bounded additive functionals of posterior states in disordered quantum trajectories and establish local central limit theorems and first-order Edgeworth expansions.

comments
24 pp
fields
Probability
pdf ↗ page arXiv:2611.20233 ↗

We obtain the Mézard-Parisi formula for the antiferromagnetic Potts model on random uniform hypergraphs, including the Erdős-Rényi graph. The upper bound in the graph case was proved by Contucci, Dommers, Giardinà, and Starr, whose interpolation extends to uniform hypergraphs. Here we prove the matching lower bound for a general class of diluted models with finite spin alphabets. The proof follows closely the corresponding argument for diluted Ising models, so we outline only the adjustments needed for several colors.

fields
Probability
pdf ↗ page arXiv:2611.20345 ↗

Characterizing joint distributions that maximize the centered third-order moment under prescribed marginal distributions and pairwise independence has various statistical applications. This problem can be formulated as a multistochastic optimal transport problem. In this work, we generalize the results on the $(3,2)$-multistochastic Monge-Kantorovich problem to cost functions of the form $c(x,y,z)=f(x)f(y)f(z)$, where $f$ is defined on $[0,1]$ through dyadic expansions: $f(x)=\sum_{i\geq 1} a_i x_i$, with $x_i\in\{0,1\}$. Under summability and domination conditions on the coefficients, we show that an optimal transport plan is concentrated on the Sierpinski tetrahedron. We also characterize mixtures of geometric coefficient sequences through Hausdorff moment sequences and construct a recursive dual solution with its integral representation for costs with geometric coefficients.

fields
Probability
pdf ↗ page arXiv:2611.20365 ↗

Particle annihilation (PA) plays an indispensable role in alleviating the numerical sign problem in long-time simulations with the Wigner branching random walk (WBRW) method. However, the effect of PA frequency on long-time accuracy remains poorly understood, leaving its choice largely empirical. To provide systematic guidance for PA scheduling, we establish an overall error estimate for PA through a uniform mesh, separating WBRW variance, resampling variance and squared bias. The analysis shows that, beyond merely controlling particle growth, PA replaces the exponential-in-time variance bound with a linear-in-time bound, thereby alleviating the numerical sign problem. It also reveals bias-variance trade-off induced by PA frequency: frequent PA limits variance but can increase accumulated bias. More importantly, building on the newfound error structure, we propose a variance-constrained cost optimization strategy for adaptive PA scheduling across several PA methods. An intrinsic-time reparameterization provides a common clock for variance control, PA scheduling, and branching dynamics under time-dependent potentials. Numerical experiments validate the theoretical variance behavior and bias-variance trade-off, and results of our schedule populate the low-cost regime of the empirical Pareto frontier objecting to balance accuracy and efficiency.

comments
20 pages, 3 figures
fields
Probability
pdf ↗ page arXiv:2611.20426 ↗

This paper investigates the exit-time asymptotics, at a vanishing noise limit, related to a stochastic particles system in mean-field interaction subjected to frictions, confining potential and flocking forces. The dynamics are governed by a kinetic Langevin-type SDE with an idiosyncratic noise acting solely on the velocity coordinates. Using the seminal large deviations principles of Freidlin and Wentzell [20], and their extension by Azencott [4] to the framework of non-elliptic diffusions, we establish the Arrhenius' law and Kramers' type law related to the first exit-time of the system from an energy level set $\mathcal O^γ_N(R)$ of interest.

comments
37 pages, 3 figures
fields
Probability
pdf ↗ page arXiv:2611.20530 ↗

Yule's nonsense correlation persists for Spearman's rho and Kendall's tau between independent random walks. Neither coefficient concentrates at zero as the sample size grows. For centred random walks with finite increment variances, we derive a universal joint limit expressed through Brownian occupation functionals. Integral formulas give limiting variances of approximately 0.222 and 0.108, respectively, below the Pearson value of 0.241. Rank correlations thus reduce the limiting dispersion on their respective coefficient scales. We prove that both marginal limits have symmetric densities and represent them exactly as limits of polynomial densities determined by Gaussian moment integrals. Spearman's conventional t test and Kendall's normal approximation are asymptotically invalid, with rejection probabilities tending to one under process independence.

fields
Probability
pdf ↗ page arXiv:2611.20572 ↗

Let $P$ be a noncommutative polynomial of arbitrary degree. We prove that the empirical spectral distribution of $P$ evaluated at independent Wigner matrices converges weakly in probability to its Brown measure limit. The same conclusion holds for arbitrary $*$-polynomials in independent iid matrices and their adjoints. The entry laws have bounded real or joint planar densities and a finite $(2+\varepsilon)$ moment; only second moments are required on the Wigner diagonal. The real and imaginary parts of an entry may be dependent, and its pseudovariance need not vanish. The proof develops the coefficient-algebra approach of the author's earlier work on matrix polynomials with Gaussian and non-Gaussian iid inputs \cite{Han}. The main step is a polynomial lower-tail estimate, under only second moments, for the least singular value of a tensor pencil with arbitrary fixed matrix coefficients. We use a logarithmic determinant method: a real-block small-ball argument shows that logarithmic derivatives of the determinant control the inverse pencil. Relative polynomial anti-concentration then gives the lower-tail bound. We establish convergence of logarithmic potentials by Hermitian resolvent comparison and rank truncation. This extends the recent Brown measure convergence theorem of Collins, Kitagawa, Miyagawa, Yuan and Zhong \cite{Collins} for GUE polynomials to non-Gaussian Wigner inputs.

comments
43 pages. This is a preliminary draft and will be revised later
fields
Probability
pdf ↗ page arXiv:2611.20657 ↗

We study the uniform distribution on finite-dimensional Lorentz balls $B_{q,p}^n$ in the range $1<p<q<\infty$. We prove a Sanov-type large deviation principle for the empirical measures of the absolute coordinates of a random vector uniformly distributed on $n^{1/q}B_{q,p}^n$. The rate function is given by an entropy deficit under a weighted quantile constraint. We show that the entropy maximizer is unique and characterize its distribution function as the unique increasing solution of a nonlinear boundary-value problem. The limiting distribution has compact support, for which we obtain an explicit bound. These results establish the conjectured empirical limit of Kabluchko, Prochno and Sonnleitner [Journal of Functional Analysis, 288(1):110682, 2025] in the range $1<p<q<\infty$. As consequences, we determine the exponential volume asymptotics of Lorentz balls and obtain asymptotic independence of any fixed number of coordinates. We also prove a law of large numbers for Lorentz norms with finite parameters and use it, together with the volume asymptotics, to obtain a Schechtman–Schmuckenschläger type theorem for intersections of volume-normalized Lorentz balls. We further derive a variational formula for the logarithmic intersection asymptotics. The proof combines an exponential change of measure with quantile interpolation and a variational argument that does not assume regularity of the maximizing quantile in advance.

comments
22 pages, 1 figure
fields
Probability, Functional Analysis
pdf ↗ page arXiv:2611.20761 ↗

The paper is devoted to the stochastic modelling of high-frequency crypto Limit Order Book (LOB) with general compound marked Hawkes process (GCMHP). We consider marked Hawkes process in a general form. LLN and FCLTs with stochastic and constant centralization are stated. Numerical example for high-frequency LOB dataset for BTC (bitcoin) based on sources from HF crypto LOB data is presented as well. The novelty of the paper lies in the new LLN and FCLTs for the GCMHP, and in the new application associated with high-frequency (HF) crypto LOB.

fields
Probability
pdf ↗ page arXiv:2611.20839 ↗

The solution to a finite-dimensional Hamilton-Jacobi equation is classically known to admit a variational representation in two situations: when the nonlinearity is convex or concave, by the Hopf-Lax formula; and when the initial condition is convex or concave, by the Hopf formula. We identify a third situation: the space variable is split into two groups of coordinates, the nonlinearity is the scalar product of the two corresponding partial gradients, and the initial condition is the sum of a convex function of the first group of coordinates and of an arbitrary Lipschitz function of the second group. This structure is precisely that of the Hamilton-Jacobi equations describing the limit free energy of perceptron models. We illustrate this point by identifying the limit free energy of a class of perceptron models that can be rewritten as bipartite spin glasses, with Ising spins in one layer and bounded soft spins in the other. We also discuss how to extend the approach to several other classes of models, including general Ising and spherical perceptrons, possibly with labelled patterns.

comments
51 pages
fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2611.20870 ↗

We establish regularity results for the solution flow of Stochastic Differential Equations (SDE) on the Wasserstein space $\mathscr{P}(M)$ over a closed Riemannian manifold, under suitable assumptions on the driving vector fields. We derive the SDE governing the associated tangent process and prove its well-posedness by means of the framework developped in \cite{Martin2025} for Covariant SDEs on Inverse Limit Hilbert vector bundles over the diffeomorphism group. We introduce the $\mathrm{IWC}(K)$ condition, a geometric curvature-type condition which generalizes, in the setting of SDEs on $¶(M)$, both the $\mathrm{H.C.K.}$ condition introduced in \cite{cattiaux:hal-00805299} and the ergodicity condition of \cite[Section 4]{wang2020}. Finally, combining this condition with the theory of entropic interpolations (see \cite{Leonard2014}), we establish several consequences of $\mathrm{IWC}(K)$, including control of the distance between two trajectories, gradient estimates for the associated Markov semigroup and a local Poincar{é} inequality. In the case $K >0$, we further obtain the existence and uniqueness of an ergodic invariant measure for the associated semigroup.

fields
Probability
pdf ↗ page arXiv:2611.20989 ↗

In this note we consider, on one hand, the implementation of the parametrix method for estimation of the distance between functionals $\Ee^x f(X_t)$ and $\Ee^x f(\widetilde X_t)$ of two Lévy-type processes $X$ and $\tilde X$. On the other hand, we estimate the weak error appearing by substituting small jumps by a (time-inhomogeneous) diffusion. Both methods rely on the time-dependent cutting procedure, designed to remove small jumps in a time-dependent way.

fields
Probability
pdf ↗ page arXiv:2611.21231 ↗

Hamiltonian Monte Carlo, since its invention and subsequent rise to widespread use, has been motivated by its ability to accelerate convergence to equilibrium compared to diffusive methods, both in terms of dependence on condition number and dimension. In the present work, we establish this acceleration simultaneously in both aspects for critically damped Metropolis-adjusted kinetic Langevin with persistent uniforms. More precisely, for target measures $μ(dx)\propto e^{-U(x)}dx$ with $m$-strongly convex, $L$-gradient Lipschitz, and $L_H$-Frobenius Hessian Lipschitz potentials, we show that the method mixes to $\varepsilon$-accuracy in total variation using $\mathcal O\bigl((κ^{1/2}+L_H^{1/2}m^{-3/4})\,d^{1/4}\bigr)$ gradient evaluations up to logarithmic factors, both uniformly over starting points in domains of high equilibrium probability and from warm starts. The proof incorporates ideas from previous studies by Bou-Rabee and Chen et al. that show either aspect of acceleration separately, into novel coupling technology. This new coupling technology for general Markov chains extends earlier frameworks aimed at capturing fast local equilibration in the presence of slow global mixing. Specifically, via a weak-$(1,1)$ maximal inequality that follows from Hopf's maximal ergodic theorem, we uncover a stability mechanism in high-probability domains with respect to equilibrium. This enables straightforward localization to naturally arising domains of fast local mixing, and seamlessly fits broad local frameworks via Dobrushin contraction, Wasserstein contraction and local Harris' theorems. We develop the Dobrushin formulation.

fields
Probability
pdf ↗ page arXiv:2611.21305 ↗

We establish Bernstein-type inequalities for additive functionals of Markov processes through uniform resolvent estimates between a Banach space and its dual. Under an iterated Poincaré inequality, we obtain the classical Bernstein form sought by Huang and Li in [5], up to numerical constants, in both continuous and discrete time. Suitable choices of the Banach space recover Bernstein-type bounds under Poincaré and Sobolev inequalities and allow unbounded observables. For normal generators, a criterion involving the modulus of the generator captures the contribution of its antisymmetric part. As an application, we obtain Bernstein-type inequalities for $L^{3/2}$ observables of a non-mixing diffusion on the two-dimensional torus. The proof combines perturbation estimates for the Feynman–Kac resolvent with the stationary increment property of additive functionals of stationary processes.

fields
Probability
pdf ↗ page arXiv:2611.21444 ↗

We establish exact relations between three quantities: the growth of the Gaussian Wills functional under dilations, the small-scale metric entropy of the index set, and the critical Hölder exponent of the associated isonormal Gaussian process. For every compact Gaussian-bounded set $T$, the Wills growth exponent $ρ(T)$, the entropy exponent $η(T)$, and the critical Hölder exponent $α_H(T)$ satisfy \[ η(T)=\frac{2ρ(T)}{2-ρ(T)}, \qquad α_H(T) =1-\frac{η(T)}{2} =\frac{2-2ρ(T)}{2-ρ(T)}. \] Thus any one of these parameters determines the other two. Our main tools are a Wills-functional analogue of Sudakov's minoration and a complementary upper bound for $W(rT)$ in terms of local Gaussian widths.

comments
25 pages
fields
Probability, Metric Geometry
pdf ↗ page arXiv:2611.21460 ↗

Algebraic Geometry43

Benedetti and Faenzi conjectured that, for a general trivector $σ\in\mathcal D^{1,6,10}$, the Peskine sixfold $X_1^σ$ is rational if the Brauer class $β$ on the associated K3 surface vanishes. We prove this implication for every $σ$ in a nonempty Zariski open subset $U\subset\mathcal D^{1,6,10}$. When $β=0$, we construct a line on the generic fiber of the Peskine fibration after a cubic field extension and use odd-degree descent to obtain a line over the original function field. We extend criteria for rationality to smooth complete intersections of an arbitrary number of quadrics under suitable hypotheses. Finally, we describe the derived category of the generic fiber of the Peskine fibration in terms of a twisted nodal curve of arithmetic genus two.

comments
38 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.18921 ↗

We provide a new proof of Farb's theorem on the global rigidity of the period map $\mathcal{M}_{g,n} \to \mathcal{A}_g$. We extend this classification to essentially include the period map for $\mathcal{M}_{2,n}$. We also provide a classification of holomorphic maps $\mathcal{M}_g \to \mathcal{A}_{h}$ for $h \leq 2g-1$. The only nonconstant maps in this range are given by taking the Jacobian of a curve and attaching a fixed Abelian variety. In addition to the group theory of the mapping class group, we make extensive use of the theory of variations of Hodge structures and the birational geometry on $\overline{\mathcal{M}}_2$.

comments
Comments welcome!
fields
Algebraic Geometry, Complex Variables, Geometric Topology
pdf ↗ page arXiv:2611.18959 ↗

We study rationality of very general complete intersections in products of projective spaces. By constructing specific reference varieties and apply specialization method in the form of relative torsion orders, we extend the quintic constructions by Hotchkiss and the quartic constructions by Böhning, Graf von Bothmer, Pirutka and Zhang to very general complete intersections in products in every characteristic. In particular, we prove that very general quartic hypersurfaces of positive dimension admit no decomposition of the diagonal in every characteristic.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.18966 ↗

For an irreducible parabolic flat vector bundle of rank $r < 2\sqrt{g}$ on a genus $g$ curve, we prove that an analytically general isomonodromic deformation is stable. This refines Landesman-Litt's semistability result for bundles of rank $< 2\sqrt{g+1}$. The proof applies the non-generically globally generated (non-GGG) lemma to establish infinitesimal obstructions to extending destabilizing subbundles of semistable bundles.

comments
23 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.19219 ↗

This paper studies the higher Chow groups of arbitrary finite type separated schemes using motivic homotopy theory, serving as a Borel-Moore counterpart to the $\mathbb{A}^1$-invariant motivic cohomology of Bachmann-Elmanto-Morrow. We construct a filtration on the G-theory spectrum of a finite type separated scheme $X$, inducing an Atiyah-Hirzebruch style spectral sequence whose associated graded pieces are a complex computing the higher Chow groups of $X$. We prove that this complex is representable in the stable motivic homotopy category, and is a module over the $\mathbb{A}^1$-motivic complex, giving rise to an action of $\mathbb{A}^1$-invariant motivic cohomology on the Bloch-Levine cycle complex. This generalizes some results of Bloch and Levine relating higher Chow groups and motivic cohomology to the case of schemes over an arbitrary base, and which need not be smooth or equidimensional.

comments
54 pages. Comments are welcome!
fields
Algebraic Geometry, K-Theory and Homology
pdf ↗ page arXiv:2611.19346 ↗

Previous work of the authors introduced the class of Horrocks-Mumford sheaves over normal algebraic k-varieties, the most prominent example being the classical Horrocks-Mumford bundle on projective four-space. For a smooth semiprojective toric variety, we derive an explicit description of these sheaves in terms of finitely generated graded modules over the Cox ring which we use for an algorithmic treatment. In particular, we discuss some explicit examples, their indecomposability and local freeness.

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

Up to now, symplectic foliations of Poisson varieties have been primarily studied from a set theoretic perspective by describing their symplectic leaves individually as orbit closures. In the direction of obtaining algebro-geometric characterizations, for the standard Poisson structure $π$ on the full flag variety $G/B_+$ of a complex semisimple algebraic group $G$, we prove that the irreducible components of the reduced part of the 0-degeneracy locus of $(G/B_+, π)$ are precisely the inclusion-maximal $T$-stable complete Poisson submanifolds of $(G/B_+, π)$ that are isomorphic to powers of $\mathbb{P}^1$. This characterization is based on a theorem that explicitly classifies the closed Richardson varieties of $G/B_+$ isomorphic to $(\mathbb{P}^1)^d$. In turn, this theorem is based on a general theorem for arbitrary $T$-stable subvarieties of full flag varieties $G/B_+$ isomorphic to $(\mathbb{P}^1)^d$.

fields
Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2611.19443 ↗

The counting problem for meromorphic differentials on $\mathbb{CP}^1$ with fixed orders of zeros and poles and vanishing residues at some specific poles, up to the action of $\mathrm{PGL}_2(\mathbb{C})$ and the multiplication by a nonzero constant, was completely solved before by several authors. In all the cases when there are finitely many such meromorphic differentials, an explicit formula for their number was found and also, in the case of residueless meromorphic differentials with two zeros, a link to the WDVV equations and the KP hierarchy was established. We consider a real analog of these counting problems by requiring that a meromorphic differential is preserved by a real structure on $\mathbb{CP}^1$. Our real counting problems admit refinements, obtained for example by specifying the orders of poles and zeros that are fixed by the antiholomorphic involution. We obtain explicit formulas for all our real counting problems and also, in the case of real meromorphic differentials with two complex conjugate zeros and residueless poles, establish a link to the open WDVV equations and the system of equations for the wave function of the KP hierarchy. An application to real Hurwitz numbers is also presented.

comments
23 pages
fields
Algebraic Geometry, Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2611.19450 ↗

We study regularized quantum periods under birational contractions involving threefold flips. Let $g:X \dashrightarrow X'$ be a birational map between Fano threefolds with terminal quotient singularities which contracts exactly one prime divisor $E$ and extracts no divisor. We prove that $$ \lim_{r \rightarrow +\infty}\widehat{G}_{X,rE}(t) =\widehat{G}_{X'}(t). $$ The proof uses logarithmically smooth degenerations and positive discrepancies on good resolutions. Compatibility with orbifold invariants is proved using successive quotient-point extractions and the two-component orbifold degeneration formula. We also define stationary descendant invariants of projective terminal Fano threefolds by good resolutions and prove compatibility with a given projective $\mathbb{Q}$-smoothing. The period comparison extends to projective $\mathbb{Q}$-factorial terminal Fano endpoints under the same hypothesis on the birational map. Its proof compares the endpoints on a common resolution.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.19506 ↗

Let $φ\colon X \to S$ be a flat and proper one-parameter degeneration of algebraic varieties with a single degenerate fiber $X_0$. If $φ\colon (X|X_0) \to (S|0)$ is log smooth and saturated, the log Hodge-de Rham spectral sequence is known to degenerate at the page $E_1$. Adding to that some further well-known related properties, we say that the log de Rham complex $Ω^{\bullet,\mathrm{log}}_{X/S}$ is cohomologically flat as a filtered complex, short cffc. Furthermore, if $φ\colon (X|X_0) \to (S|0)$ has only toroidal log singularities, it is known that the reflexive log de Rham complex $\mathcal{W}^\bullet_{X/S}$ is cffc. A major motivation to study this property is that in the Calabi-Yau case, $\mathcal{W}^\bullet_{X/S}$ being cffc implies that a certain logarithmic deformation functor for $φ_0\colon X_0^\partial \to S_0^\dagger$ is unobstructed. In this article, we develop a computational criterion to determine, under very mild assumptions on $φ\colon X \to S$, whether the reflexive log de Rham complex $\mathcal{W}^\bullet_{X/S}$ is cffc. Applying this criterion, we found many explicit examples of degenerations of surfaces where $\mathcal{W}^\bullet_{X/S}$ is cffc, even though the log singularities are worse than toroidal. We did not find any new examples of degenerations of threefolds such that $\mathcal{W}^\bullet_{X/S}$ is cffc.

comments
56 pages, 7 figures, accompanying scripts: https://zenodo.org/records/24200591
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.19580 ↗

We study the minuscule Coxeter matroids of type $E_6$, whose ground set is the set of 27 lines on a smooth cubic surface. We characterize them by a tritangent exchange property and classify them into 230 orbits under the Weyl group. Every nonempty matroidal stratum of the $E_6$-Grassmannian is an open subscheme of a torus, and all orbits but one are realizable over every infinite field. Finally, we compute the tropical $E_6$-Grassmannian and its 60 classes of toric degenerations. This is an extended abstract for a forthcoming paper.

comments
This is an extended abstract for a forthcoming paper
fields
Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2611.19606 ↗

We show that the bi-Lipschitz right-left equivalence of finite holomorphic map germs $(\mathbb{C}^2,0)\to(\mathbb{C}^2,0)$ admits continuous moduli, already among finitely determined polynomial germs of corank one and degree five. The moduli come from a new invariant of finite germs: for two tangent branches of the critical set whose images are tangent, the limit of the ratio of the norms of the images of nearby points is preserved by bi-Lipschitz right-left equivalence. For germs $(F,H)$ with quasihomogeneous components the invariant is computed from the height functions of $F$ and $H$: it is given by the moduli of the values of the height function of the component of lower weighted degree at the roots of a weighted Wronskian. As a first application we obtain a continuous invariant for the germs $(Y^3+3tYX^4+X^6,\,X^N)$, $N\ge7$, built from the Henry–Parusiński family.

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

Let $X'\to X$ be a Galois cover of smooth projective varieties over a field $k$ with group $G$, and let $G$ act on an abelian variety $A$ over $k$. We prove an exact sequence relating the Mordell–Weil group of the twist of $A$ by $k(X')/k(X)$ to the group of $G$-equivariant homomorphisms from the Albanese variety of $X'$ to $A$; the remaining obstruction is killed by $|G|$. This corrects structure theorems in two earlier papers of the author and in a corrigendum to the first, where the equivariance condition was omitted. For the twists of Albanese varieties of cyclic multiple planes considered in those papers, we determine the rank and the torsion subgroup. Over number fields we describe the rank through the Galois action on endomorphisms and prove a specialization result. When $F(x,y)=0$ is the dual of the Fermat cubic, the Mordell curves $y^2=x^3+16F(a,b)$ have rank at least $3$ over $\mathbb Q$ for all $(a,b)\in {\mathbb Q}^2$ outside a thin set.

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

Let $X$ be a regular projective variety with nef anticanonical divisor over an algebraically closed field of characteristic $p>0$, and let $f:X\to A$ be a surjective morphism to an abelian variety. We prove that there exists an isogeny $A' \to A$ such that, the base change $f': X\times_AA' \to A'$ admits a Zariski locally trivial structure. If moreover $-K_X\equiv D$ for some semiample $\mathbb Q$-divisor $D$, then $-K_X\sim_{\mathbb Q}D$, and there exists an isogeny $A' \to A$ such that, the base change $ X\times_AA' \cong X_0\times A'$ where $X_0$ is the fiber over the identity $0\in A'$.

comments
15 pages, comments welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.19691 ↗

Castillo, Duarte, Leyton-Álvarez, and Liendo asked whether iterating ordinary Nash blowups in characteristic zero or normalized Nash blowups in arbitrary characteristic can fail to resolve isolated singularities arXiv:2511.17862. We answer this question affirmatively with two constructions of isolated singularities, one nonnormal and one normal, both giving counterexamples to normalized Nash iteration in every characteristic.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.19759 ↗

In this article, we study the Bridgeland stability of the tangent bundle on del Pezzo surfaces. We obtain a complete description of the region where the tangent bundle is (un)stable with respect to the standard Bridgeland stability conditions associated to the anticanonical polarization.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.19797 ↗

The asymptotic behavior of algebraic curves is classically described by means of linear asymptotes. However, many infinite branches exhibit a non-linear behavior that cannot be represented accurately by straight lines. In this paper we propose a computational framework for far-field prediction of algebraic curves based on generalized asymptotes. Starting from the asymptotic expansion of a real branch at infinity, we retain its non-decaying terms in order to construct an algebraic surrogate, which is then used as an adaptive far-field model outside a sufficiently large compact region. We introduce explicit discrepancy indicators and a switching radius that determine when the exact branch may be replaced by its generalized asymptotic predictor. The framework recovers the classical linear asymptote whenever the latter exists, while remaining effective for branches with polynomial or Puiseux-type dominant behavior. In the implicit setting, we prove algebraicity and compatibility properties of the predictor and derive asymptotic error estimates from the first neglected term of the expansion. A residual certificate distinguishes guaranteed finite-tail replacement from asymptotic radius estimates. Tangential tails, slow decay, and a smooth transition rule clarify the limitations of truncation. Reproducible finite-window tests compare the predictors with fitted polynomial baselines; these tests are not a benchmark of a complete plotting system.

comments
21 pages; 4 figures
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.19936 ↗

Let $\tilde X$ be the successive blowup of the Grassmannian $\operatorname{Gr}(d,n+1)$ with $n\ge3$, in arbitrary characteristic, along sub-Grassmannians of codimension $r_1,\dotsc,r_s\ge2$ that meet transversely. We prove that, if $d\ne2$, then $\tilde X$ is Fano if and only if $\sum_i(r_i-1)\le n$, and we give a similar criterion for $d=2$. As applications, we prove that the successive blowup of $\mathbb{P}^4$ along $s$ planes that meet transversely is Fano if and only if $s\le4$. We also determine when the successive blowup of a smooth quadric fourfold along planes of one family that meet transversely is Fano.

comments
17 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.19973 ↗

We construct projective models for general primitively polarized K3 surfaces $(S,h)$ of genus $21$ (degree $h^2=40$) inside the 12-dimensional fine quiver moduli space $X = N(3;3,4)$ parameterizing stable representations of the $3$-Kronecker quiver with dimension vector $(3,4)$. As a corollary, we show that the corresponding moduli space $\mathscr{M}_{21}$ is unirational and prove O'Grady's generalized Franchetta conjecture for genus $21$. Then we investigate the geometry of $(S,h)$ through its Fourier–Mukai partner $S' = M_{S}(4,h,5)$ and construct an explicit isomorphism $f : S^{[2]} \xrightarrow{\sim} S'^{[2]}$ together with a common closed embedding into the projectivization $\mathbb{P}^{17}$ of the space of global sections of the normalized universal bundle, using the polarization $H_2 - 4δ_2$. Finally, we identify the Brill–Noether locus $\mathfrak{B} = \{Z \in S^{[3]} : h^0(F \otimes I_Z) \ge 2\}$ scheme-theoretically with the $\mathbb{P}^2$-bundle $Y' = \mathbb{P}_{S'}((F')^*)$ and exhibit an isomorphism $S^{[3]} \xrightarrow{\sim} M_{S'}(3,h',6)$.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.20018 ↗

Let $A$ be a simple abelian variety over an algebraically closed field, and set $m(A)=2\dim A/[\operatorname{End}^0(A):\mathbb Q]$. We prove that, for every prime $p$ and every positive rational number $μ$, there exist simple abelian varieties of characteristic $p$ with endomorphism ratio $μ$, both of $p$-rank zero and of positive $p$-rank. In particular, we answer a question of Oort in a stronger form. Our construction combines Honda-Tate theory with explicit deformations of $p$-divisible groups using Breuil windows. An explicit Frobenius matrix, realized in a window with quaternionic multiplication, gives two reduced generic slopes with coprime denominators. Their coprimality, together with specialization and constancy of dimension, determines the full geometric endomorphism algebra. Polarized Serre-Tate theory and Grothendieck algebraization lift these deformations to abelian schemes. A related construction with an additional etale factor yields the positive-$p$-rank result.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.20040 ↗

Given a family π:X\to S of complex projective varieties, polarised by a (sufficiently) relatively very ample L, we give an isomorphism between a Deligne pairing involving higher relative cotangent Chern classes, and the relative projective dual line X^\vee(L). As a consequence, we obtain explicit Deligne pairing isomorphisms for all of the higher associated hypersurfaces of Gelfand–Kapranov–Zelevinsky, including mixed polarisations, as well as higher-rank versions of such hypersurfaces involving sufficiently positive vector bundles.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.20077 ↗

We study the higher-order Milnor and Tjurina numbers of isolated hypersurface singularities and extend these invariants to pairs of plane holomorphic germs. We first show that a conjectured upper bound of Hussain, Yau and Zuo on the ratio between the higher-order Milnor and Tjurina numbers of isolated hypersurface singularities in three-dimensional complex space does not hold: it fails already for the simplest singularity, a non-degenerate quadratic one, and the ratio tends to infinity as the order grows. We then prove that a conjecture of Shi, Yau and Zuo on semiquasihomogeneous singularities holds for plane curves, for every order and over formal power series, and show that it fails in dimension three. Using the theory of higher-order Milnor and Tjurina numbers of foliations in dimension two, we introduce these invariants for pairs of plane germs. For every order, we show that the higher-order Milnor number of a pair is determined by the Milnor number of the pair and the algebraic multiplicity of the associated foliation, and we compute the difference between the higher-order Milnor and Tjurina numbers of the pair. Finally, we establish a bifurcation formula comparing the higher-order Milnor number of a pair with that of the product of the germs. As a consequence, we characterize semitame meromorphic germs as those for which these two numbers agree at some order, or equivalently at every order.

comments
22 pages
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2611.20173 ↗

We prove that all components of the meromorphic differential strata are unirational in genus $2\le g\le 5$ and with relatively low number of poles. In particular, it follows that the moduli space of pointed even spin curves $\mathcal{S}_{5;1}^+=\mathcal{S}_5^+\times_{\mathcal{M}_5}\mathcal{M}_{5,1}$ is unirational.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.20182 ↗

Let $g_{\mathfrak{p}_{\ell}}$ denote the canonical scalar-flat metric on $S^n\setminus \mathfrak{p}_{\ell}$ introduced in Part~I, which for $n=3$ corresponds to the Brill–Lindquist initial data for $\ell$ black holes, and let $η\in H_{\ell}$ be its associated mass matrix. In this paper, we investigate the asymptotic behavior of the metrics and the mass matrix $η$ as subsets of punctures collide. Such collisions cause every mass to diverge; if a cluster $A$ of black holes collapses at a relative scale $t$, the mass matrix satisfies $η=E(A)\ln(1/t)+O(1)$, diverging along an explicit ray $E(A)\in H_{\ell}$. For nested families of clusters, this degeneracy structure naturally organizes into a space of rooted trees. Subtracting the divergence gives a renormalized mass matrix which extends smoothly to every stratum of the Axelrod–Singer compactified moduli space $\overline{M}{}^{\,\mathrm{AS}}_\ell= \overline C_{\ell-1}(\mathbb{R}^n)/\mathrm O(n)$ and splits naturally into one mass matrix per vertex of the bubble tree. Geometrically, at each vertex carrying punctures the suitably rescaled metrics converge to a complete scalar-flat metric with the nodes filled in, adjacent such pieces being joined by Schwarzschild necks, and the renormalized matrix acting as its mass data. For $n=3$, the necks contain minimal spheres, which are common apparent horizons of the merging holes. At vertices bearing two holes, we determine on which side of the limiting horizon each node lies, and we formulate as a conjecture the resulting criterion for a neck to be a component of the outermost horizon. We also compare the mass lower bound of Part~I with the Riemannian Penrose inequality. Because the mass matrix is invariant under rotations of the bubbles, it lives on a Deligne–Mumford-type quotient of the compactification.

comments
35 pages
fields
Algebraic Geometry, Differential Geometry, Geometric Topology
pdf ↗ page arXiv:2611.20282 ↗

We construct 3D polytopes that admit a scaling with maximum likelihood (ML) degree one by using codimension zero toric fiber products of lower-dimensional polytopes and classify all the 3D polytopes that can be constructed in this way. We also study a family of 3D polytopes whose faces admit ML degree one scalings. We give a tight lower bound for the ML degree of these polytopes with a square base and we show that every value between this bound and the normalized volume of the polytope can be attained. These values depend on counting common and repeated roots associated to certain univariate polynomials. This is similar in spirit to the description of the possible ML degrees of rational normal scrolls.

comments
Comments are welcome
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2611.20286 ↗

We study the stability of Lazarsfeld-Mukai bundles associated with smooth curves over abelian surfaces. When the general curve in $|L|$ have Clifford dimension one and maximal gonality, for $ρ\gg 0$ we show that every component of the relative Brill-Noether loci \(W^1_d(|L|)\) dominating the linear system parametrizes generically \(μ_L\)-stable rank-two Lazarsfeld-Mukai bundles. We also apply Bayer-Li wall-crossing to higher-rank bundles: if \(\operatorname{NS}(S)=\mathbb Z\cdot L\), \(A\) is a globally generated complete linear series of degree \(d\) on a smooth curve \(C\in|L|\), \(h^0(C,A)=r+1\) with \(r>2\), and \(d\ne g-1\), then the associated bundle \(E_{C,A}\) is \(μ_L\)-stable and \(L\)-Gieseker-stable. The corresponding object \(E_{C,A}^{\vee}[1]\) for \(d<g-1\), or \(E_{C,A}\) for \(d>g-1\), is stable in the adjacent chamber, as its reduction. These results connect dimension estimates for Brill-Noether loci with stability and wall-crossing on abelian surfaces.

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

Let $p$ be a prime number and $n\ge 1$ an integer. We construct a local logarithmic Cartier transform modulo $p^n$, following an approach by Shiho. More precisely, consider the ring $W$ of Witt vectors of a perfect field of characteristic $p$. Let $f:\mathfrak{X}\rightarrow \mathfrak{S}$ be a log smooth morphism of fs logarithmic $p$-adic formal schemes, whose underlying formal schemes are flat and locally of finite type over $W$, and assume the exact relative Frobenius after reduction modulo $p$ admits a lift $F$. Let $\mathcal{A}$ be Lorenzon's indexed algebra on the reduction modulo $p^n$ of $\mathfrak{X}.$ We define an indexed subalgebra $\mathcal{B}_F\subset\mathcal{A}$ and equip it with an integrable quasi-nilpotent $p$-connection. Our main result is an equivalence between the category of indexed $\mathcal{B}_F$-modules equipped with integrable quasi-nilpotent $p$-connections compatible with the $p$-connection on $\mathcal{B}_F$, and the category of indexed $\mathcal{A}$-modules equipped with integrable quasi-nilpotent connections compatible with the canonical connection on $\mathcal{A}$. This gives a local logarithmic version of the Cartier transform modulo $p^n$.

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

In this paper, we study quasi-F-splitting from the viewpoint of non-commutative algebraic geometry. Let k be a perfect field of characteristic p. For a proper dg-category over k with a Serre functor, we define quasi-F^e-split heights for e\geq 1 by using finite topological restriction homology with coefficients in a shift of the Serre functor. Using the functoriality of polygonic topological Hochschild homology for laced categories due to Harpaz–Nikolaus–Saunier, we show that these heights are invariant under derived Morita equivalence. For a proper Gorenstein scheme of pure dimension over k, the height for e=1 of its dg-category of perfect complexes coincides with the quasi-F-split height in the sense of Yobuko. For a complete Noetherian Gorenstein local \(k\)-algebra with residue field k, the dg-category of perfect complexes supported at the closed point recovers the n-quasi-F^e-splitting of Tanaka–Witaszek–Yobuko for all n,e\geq 1. The proofs use the computation of the zeroth homotopy groups of TR with coefficients due to Dotto–Krause–Nikolaus–Patchkoria, Zariski descent, and Serre duality or local duality.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.20424 ↗

Ishida and Iwashita showed that the canonical abelian quotient singularities of dimension three that are not Gorenstein fall into four families. For the two families that have not been treated before, we extend a method of Kędzierski and compute the toric charts of the $G$-Hilbert scheme explicitly. As a result, we show that the $G$-Hilbert scheme has at worst conifold singularities. Combined with known results, this shows that for every three-dimensional canonical abelian quotient singularity, the $G$-Hilbert scheme has at worst conifold singularities, every essential divisor over the singularity appears on it as a prime divisor, and its limit F-blowup is a resolution of the singularity. These results also hold for every three-dimensional $\mathbb{Q}$-factorial canonical toric singularity in any characteristic, if we replace the $G$-Hilbert scheme by the limit F-blowup of the singularity.

comments
24 pages, 3 figures. Ancillary files contain a Python program and its output for Remark 2.14
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.20586 ↗

We establish a strong Franchetta property for the universal moduli stack of rank two vector bundles over smooth hyperelliptic curves and identify the image of the Chow ring in the cohomology of a fiber via restriction and the cycle class map as precisely the monodromy invariant cohomology classes. More precisely, for every genus $g\geq 2$, degree $d$, and hyperelliptic curve $C$ of genus $g$, we show that the restriction and the cycle class map identifies the Chow ring of the universal moduli stack with the subring of $H^* (Bun_{2,d}(C),\mathbb Q)$ generated by twisted $κ$-classes, which coincides with $H^{*}(Bun_{2,d}(C), \mathbb Q)^{π_1(\mathcal H_g,[C])}$. We use this viewpoint to give an alternative proof to a theorem of Larson in (arXiv:2404.12607), and verify a conjecture of the second author in (arXiv:2604.11958) in the rank $2$ case.

fields
Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2611.20620 ↗

This is a paper about homological algebra of flat pro-quasi-coherent pro-sheaves. We recall and collect various techniques such as accessibility and deconstructibility, and adopt them to ind-schemes under various assumptions. We also discuss the foundations of the notion of an ind-scheme.

comments
LaTeX 2e with xy-pic and mathrsfs font; 54 pages, 4 commutative diagrams
fields
Algebraic Geometry, Category Theory
pdf ↗ page arXiv:2611.20774 ↗

We study the $2k$-dimensional volume of the amoeba of a smooth complete intersection $V$ of dimension $k$ in $(\C^*)^n$, $n\ge2k$, with Newton polytopes $Δ_1,\dots,Δ_{n-k}$. For $n=2k$ we prove $\Vol(\A(V))\ge\mathcal M(V)/\MV(Δ_1,\dots,Δ_k,-Δ_1,\dots,-Δ_k)$, where $\mathcal M(V)$ is the coamoeba volume counted with multiplicity, and we show $\mathcal M(V)\geπ^{2k}$ for plane curves ($k=1$, $n=2$) whose Newton polygon is not centrally symmetric, for nondegenerate varieties with odd $\MV(Δ_1,\dots,Δ_k,Δ_1,\dots,Δ_k)$, and for smooth towers of curve fibrations. We determine the equality case for curves and towers, and prove that $k$-planes in general position never attain the bound. For $n>2k$ we prove two-sided bounds for $\Hm^{2k}(\A(V))$ through coordinate projections, and show that for generic coefficients almost every fibre of the amoeba map is an orbit of a finite group. For lines we prove that in several random models the area of the amoeba of a line in $(\C^*)^n$ is asymptotic to $\frac\pi2n\log n$, and we compute its limit under degenerations of the configuration. Finally we characterise the varieties attaining the extremal volumes. For $n=2k$ every regular fibre of the amoeba map has an even number of points, divisible by $4$ for real varieties with $k\ge2$; the volume-maximal varieties are those with two-to-one amoeba maps and maximal rolled coamoebas, and they are never real when $k\ge2$; a volume-minimal plane curve is characterised by a group of symmetries of maximal order, and its amoeba has no holes. For $n>2k$ the extremal varieties lie in translates of $2k$-dimensional subtori.

comments
56 pages, all comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.20829 ↗

The aim of these notes is to give an account, intended for the non-specialist, of the two proofs of the Göttsche conjecture given, respectively, first by Tzeng, and shortly after by Kool, Shende and Thomas. Given a smooth, complex, projective surface $S$ and a positive integer $δ$, the Göttsche conjecture predicts that if $L$ is a sufficiently positive line bundle on $S$, then the number of $δ$-nodal curves in a general $δ$-dimensional linear subsystem $Λ\subset |L|$ is given by a universal polynomial of degree $δ$ in the four numbers $L^2$, $L K_S$, $K_S^2$, and $c_2(S)$. Besides, the Göttsche–Yau–Zaslow formula expresses the generating function of the aforementioned numbers of $δ$-nodal curves in terms of three explicit quasimodular forms and two unknown universal power series, whose coefficients can be determined by recursion.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.20847 ↗

We show that the Picard rank of $d$-dimensional Gorenstein toric Fano varieties is at most $2d$. This generalizes Batyrev's conjecture of Picard ranks for smooth toric Fano varieties, which was proved by Casagrande for all $\mathbb{Q}$-factorial Gorenstein toric Fano varieties. The convex-geometric proof is a generalization of Casagrande's proof and Eikelberg's theory of non-$\mathbb{Q}$-factorial toric Picard groups, with key ideas from work of Debarre, Øbro, Fujita and the first author. The proof was found using ChatGPT 6.1.

comments
1 figure. 10 pages. Comments are welcome!
fields
Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2611.21074 ↗

We prove that $G$-Fano threefolds which are given by the blow-up of a smooth quadric along a twisted quartic curve are $G$-birationally superrigid if and only if $G$ is isomorphic to $\mathfrak{A}_5\times\mathbb{Z}_2$. We also prove that the action of $G$ is linearisable if and only if $G$ does not contain a subgroup isomorphic to $\mathbb{Z}_2^3$.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.21108 ↗

We prove a uniform bound linear in the rank for the local correction terms in the Riemann–Roch formula for reflexive sheaves on normal surfaces over algebraically closed fields of arbitrary characteristic. We also establish the usual tensor and symmetric-power formulas for second Chern characters and prove Wahl's asymptotic Riemann–Roch conjecture and its higher-rank generalization. These results yield second Chern classes of reflexive sheaves on arbitrary normal projective varieties, compatible with pullback by finite surjective morphisms. We characterize their discriminants as infima of normalized discriminants of compatible vector bundles on smooth alterations. As applications we prove Bogomolov's inequality, effective restriction and boundedness theorems on normal projective varieties, a Miyaoka-type inequality, and a Segre-class criterion for bigness of reflexive sheaves on normal surfaces.

comments
48 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.21118 ↗

We calculate the genus $1$ Gromov-Witten invariants with one tautological divisor insertion of the moduli space $\mathcal{M}(r,n)$ of rank-$r$, $c_2=n$ torsion-free sheaves on $\mathbb{P}^2$ framed along the infinity divisor. As rational functions of the framing parameters, we determine the polar parts of these invariants by exploring the equivariant geometry of the Gieseker-Uhlenbeck map $\mathcal{M}(r,n)\to\mathcal{M}_0(r,n)$. We determine the polynomial part of these invariants by relating their large framing limits to the results \cite{ILPT} for the rank $1$ case, namely $\mathrm{Hilb}^n(\mathbb{C}^2)$. The degree-$0$ invariants with one divisor insertion are evaluated by studying the combinatorics of multi-partitions. We also prove reconstruction results for invariants with multiple insertions. Under the assumption that the eigenvalues of the divisor operator are linearly independent as functions of the Novikov variable, these results determine the full genus $1$ theory from the one-divisor series and the genus $0$ divisor operator.

comments
82 pages, 2 figures, comments welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.21173 ↗

We show that curves of genus 10 which are W(E_6)-covers of the projective line provide counterexamples to Green's Conjecture on syzygies of canonical curves. This leads to a 9-dimensional family of explicit counterexamples to Green's Conjecture. We also show that the same curves provide counterexamples to the Green-Lazarsfeld Secant Conjecture. Both Green's Conjecture and the Secant Conjecture are know to be true in the generic case, as well as in many other situations.

comments
24 pages
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2611.21197 ↗

In this article, we study descent and lifting of Bridgeland stability conditions along Verdier quotients. We give a torsion-pair criterion for lifting every stability condition on the quotient to a weak stability condition with a prescribed heart on the null category. When this criterion holds for every heart on the null category, the space of weak stability conditions with this massless subcategory is homeomorphic to the product of the stability space of the quotient and the discrete set of hearts of bounded $t$-structures on the null category. We apply these results to contractions of relative dimension one, resolutions of nodal varieties, and blowups of smooth projective varieties along smooth centers. For projective surfaces with ADE singularities, we identify the discrete factor through a simply transitive braid group action. When the minimal resolution is a K3 surface, every weak stability condition obtained by lifting a numerical stability condition from the singular surface is the limit of a continuous, quasi-convergent family of numerical Bridgeland stability conditions on the resolution with the same heart.

comments
43 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.21297 ↗

We prove the cohomological and the geometric $P=W$ conjectures for the moduli spaces of $G$-Higgs bundles and $G$-local systems on any smooth complex projective variety $X$ with nilpotent fundamental group, and any connected complex reductive group $G$. To the best of our knowledge, our results provide the first instances of $P=W$ conjectures beyond curves and abelian varieties. Finally, we provide examples of our theorem for classical groups: as a byproduct of this analysis we investigate when symplectic resolutions of the corresponding character varieties exist.

comments
37 pages. Comments welcome!
fields
Algebraic Geometry, Differential Geometry, Representation Theory
pdf ↗ page arXiv:2611.21437 ↗

We prove that the generic splitting type of the logarithmic bundle of an arrangement of at most eighteen lines in the complex projective plane is determined by the intersection lattice. In particular, Terao's freeness conjecture holds for seventeen and eighteen lines. For any number of lines, it holds for free arrangements whose smaller exponent is at most eight. By the theorem for at most sixteen lines, the problem reduces to a uniformity condition for lattices of seventeen lines: if all realizations have minimal Jacobian-syzygy degree at least seven, then all or none have degree seven. The proof has two parts. First, a realization of minimal degree seven has defect at most four, the defect being the length of the zero scheme of a minimal section. This uses the residual inflection quartic of the associated degree-seven foliation, local inflection identities, and fixed-point theory for critically fixed rational maps of degree seven with exact finite certificates. Second, the uniformity condition holds at these defects. For multiplicities at most six, a critical realization contains a twelve-line core of minimal weight, and an exact search through extensions of the cores shows that the lattice has a single Galois orbit of realizations; the only family left at defect four has no critical member. For a point of multiplicity seven we use the zero scheme of the pencil derivation and a classification of transversal structures. Terao's conjecture for seventeen and eighteen lines needs only defects one, two and three and, for seventeen lines, this classification at multiplicity seven. The proof is computer-assisted.

comments
77 pages, 0 figures. Computer-assisted proof; source code, data and certificates included as ancillary files
fields
Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2611.21506 ↗

This paper is concerned with the study of the fixed-genus asymptotics of motivic measures of moduli spaces of stable pointed curves and their minimal all-light Hassett compactifications as the number of markings tends to infinity. A motivic wall-crossing argument gives a universal change of variables between the two generating series, depending only on the value of the Lefschetz class. For an arbitrary motivic measure, we use stabilization graphs and support patterns to express the all-light series in terms of universal chain factors and finite residual quotient families. This formal decomposition isolates the rational trivalent contribution without requiring a fixed-locus formula for finite quotients. To pass from formal identities to asymptotics, we formulate analytic hypotheses (the $\mathrm{H}_g$-hypotheses) for scalar realizations with positive real Lefschetz value. We introduce vertex tameness and residual-quotient tameness, whose conjunction, graph tameness, provides geometric sufficient conditions for the $\mathrm{H}_g$-hypotheses. In genus at least two, this yields explicit leading asymptotics in both chambers, depending only on the genus and the Lefschetz value; genera zero and one are treated separately. As an application, we prove graph tameness for Hodge-Deligne evaluations and deduce fixed-product universality and asymptotic concentration of Hodge numbers on the diagonal.

comments
62 pages; 8 figures
fields
Algebraic Geometry, Mathematical Physics
pdf ↗ page arXiv:2611.21569 ↗

We prove that very general Küchle fourfolds of types (c1), (c6), (b8), and (b11) are irrational. The key ingredients are a new rationality criterion, based on the theory of Hodge atoms due to Katzarkov–Kontsevich–Pantev–Yu and its integral extension by Guéré, and a computation of the action of quantum multiplication on the vanishing cohomology of these fourfolds, which uses a version of the Quantum Lefschetz Hyperplane Principle. Quantum multiplication acts as a scalar on the vanishing cohomology, and we give an enumerative interpretation of this scalar.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.21576 ↗

Dynamical Systems39

We propose a single formal object, the generalized particle system (GPS), under which self-propelled particle systems (SPPS) and agent-based models (ABMs) are instances of one construction. A GPS is a typed finite population, a per-particle state space with arbitrary internal structure, a global environment, a neighbourhood map that may depend on the configuration, and type-indexed local rules; these assemble into a generator whose iteration is a monoid action, i.e. an autonomous dynamical system. Update schedules and stochastic rules are added at the same generality, so sequential and noisy models (the original Primordial Particle System, Vicsek) are covered, not approximated. The construction isolates the one ingredient separating the two communities: in the classical ABM reading the dependency graph is fixed; in an SPPS it is a function of the state. Under an exchangeability axiom (rules see neighbours only through the multiset of their types and states) the generator is equivariant for type-preserving permutations and descends to a dynamical system on counting measures, the setting of kinetic limits of swarming models. We read the tuple as a metamodel: its structural components coordinatize a space of models inside which numerical parameters live. Six pre-registered experiments on one engine implementing the generator test the claims: freezing the neighbourhood map destroys alignment ($\varphi = 0.91 \to 0.04$) while yielding a different, non-aligned aggregation; the realized neighbourhood graph rewires up to 64% of its edges per step, its rewiring rate anti-correlated with order ($-0.99$); a topological instead of metric neighbourhood reshapes a flocking phase diagram; the same rule with cohesion and separation off shows a Vicsek-type transition whose susceptibility peak grows with system size. One prediction failed and one subsumption claim is unconfirmed; both are reported.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.18709 ↗

We study the dependence of the Hausdorff dimension of projected quasi-Bernoulli measures on a conformal iterated function system on the real line. For every fixed quasi-Bernoulli probability measure on the symbolic space, we prove that the dimension of its push-forward under the coding map is lower semicontinuous in the $C^{1+θ}$ topology, without any separation assumption or shift-invariance requirement on the symbolic measure. The proof combines bounded distortion and finite-scale entropy estimates with uniform control of the entropy dimension over measures whose densities are bounded above and below. For invariant Gibbs measures associated with Hölder continuous potentials, we also prove joint lower semicontinuity with respect to the defining system and the potential. As an application, we obtain a generic dimension formula: for each fixed shift-invariant quasi-Bernoulli measure, a dense $G_δ$ set of systems with derivative moduli strictly less than 1/2 has projected dimension equal to the minimum of one and the entropy-to-Lyapunov-exponent ratio.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.18752 ↗

Equation-free modelling is a computation multiscale modelling scheme for the simulation of complex dynamical systems. Efficient computations are achieved by solving the given microscale model in small, well-separated `patches' spread across the space-time domain, with each patch providing a data point for the macroscale simulation. Patch coupling bridges the unsimulated space between patches and supports the macroscale dynamics. Accurate simulations require coupling conditions that preserve underlying symmetries of the microscale equation. Failing to preserve such symmetries may result in an unphysical macroscale simulation that does not satisfy required conservation laws. Here we develop equation-free modelling that preserves self-adjoint symmetry for microscale models defined by a compact self-adjoint operator on a bounded domain with fixed boundary conditions. This new design for equation-free modelling greatly increases the range of systems for which equation-free modelling is applicable.

fields
Dynamical Systems, Numerical Analysis
pdf ↗ page arXiv:2611.18788 ↗

In this paper, we study probability measures on the unit tangent bundle which are invariant under the geodesic flow and whose projection to the base manifold is the normalized Riemannian volume. We show that the Liouville measure is the only such measure on a complete oriented surface of finite area with ergodic geodesic flow. In particular, this resolves a conjecture of Katok–Knieper–Weiss in dimension two. The same holds for ergodic planar billiards with piecewise C2 boundary, such as the Bunimovich stadium, the Sinai billiard, and generic polygons. The proof combines the Fourier analysis in the fibers with holomorphic functions on the transport twistor space. As a consequence, on these surfaces and on the Bunimovich stadium, a high-energy sequence of normalized Laplacian eigenfunctions tends to be equidistributed in the phase space if and only if it tends to be equidistributed in the physical space. In particular, on every stadium, every failure of equidistribution in the phase space implies scarring in the physical space. Combined with Hassell's theorem, this gives a new proof of scarring in the physical space for almost every stadium. In higher dimensions, we obtain an entropy bound for the ergodic components of such measures. We also construct counterexamples for hyperbolic toral automorphisms.

comments
35 pages, 9 figures
fields
Dynamical Systems, Analysis of PDEs, Differential Geometry, Spectral Theory
pdf ↗ page arXiv:2611.18817 ↗

The purpose of this paper is a conceptual clarification of the role of a special class of measures on topological Markov chains - multiplicative Markov measures - in the context of random walks. It is achieved by combining the interpretation of multiplicative Markov measures on the boundary of a free group as the unique solutions of the Radon - Nikodym problem for product cocycles of the boundary action and the fact that the Radon - Nikodym cocycle of the harmonic measure of a nearest neighbour random walk on a free group is a product one.

journal
Pure Appl. Funct. Anal. 10 (2025), no. 2, 339-362
fields
Dynamical Systems, Probability
pdf ↗ page arXiv:2611.18853 ↗

We study history independence of fast directions and its relation to the Binder–DeMarco dimension formula for regular polynomial skew products of degree $d\ge2$. Assuming uniform expansion on the support of the measure of maximal entropy and a base Lyapunov exponent larger than the vertical exponent, we prove that history independence is equivalent to conjugacy to a polynomial product by an affine shear map. Under history independence, the measure of maximal entropy satisfies the Binder–DeMarco dimension formula. If, in addition, the splitting is dominated, the dimension formula also implies history independence. The proof first upgrades the measurable fast direction to a holomorphic line field and then uses its invariance on periodic fibers to force the affine product structure. The converse dimension implication combines an entropy comparison argument with rigidity of local symmetries of periodic fiber Julia sets.

fields
Dynamical Systems, Complex Variables
pdf ↗ page arXiv:2611.18917 ↗

We give a computer-assisted proof that the Julia set of the degree-four Fibonacci renormalization 2-periodic point has zero planar Lebesgue measure. As a corollary, the degree four Fibonacci polynomial $z^4+c_{\mathrm{Fib}}$ has zero measure Julia set.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.18993 ↗

It is known that Veech dichotomy, which states that minimal directions are uniquely ergodic, holds for Veech surface and covering surface branched at a single non-periodic connection point of Veech surface. We give a sufficient condition for Veech dichotomy holds for a finite translation cover of a Veech surface, and applies it on branched cover of square-tiled surfaces to construct examples that satisfy Veech dichotomy but aren't Veech surfaces.

comments
9 pages, 2 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.19243 ↗

For every $N\ge2$, we prove that Zariski-generic nonzero real circulations, with any prescribed signs, admit at most $N^{2N}$ labeled, collision-free rotating relative equilibria modulo translations, rotations in $SO(2)$, and positive scaling. The excluded parameters lie in an explicit finite union of quadratic hypersurfaces. The proof combines a logarithmic-residue obstruction to positive-dimensional complex solution sets with Bézout degree bounds.

comments
8 pages. Comments welcome. The work was done with the help of AI
fields
Dynamical Systems
pdf ↗ page arXiv:2611.19478 ↗

We establish a quantitative criterion for variational bifurcation with prescribed exact stabilizers under finite group actions. Combining scalar spectral flow on fixed spaces with overgroup nullities, we bound the number of bifurcation parameters when the restricted singular set is finite. The theorem allows strongly indefinite Fredholm Hessians and singular ambient endpoints, without parameter differentiability or regular crossings. Finite Morse index reduces the inputs to indices and nullities; extensions cover varying form domains and regular matrix Sturm–Liouville systems. For a Newtonian nine-body family containing a reported counterexample to Moeckel's stability conjecture, we prove analytically that two nonconjugate exact reflection types bifurcate at a common central mass, displacing the central body. Positivity excludes larger stabilizers, while a scalar Schur complement synchronizes the bifurcations, independently of the reported stability assertion.

comments
34 pages, 4 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.19490 ↗

Recovering dynamical equations from data is a central problem in nonlinear science. In practice, measurements are corrupted by noise and often contain fast oscillations that are not part of the slow dynamics of interest. For this reason, data are typically pre-processed before model recovery or classsification. Here, we reveal the effects of filtering, a specific denoising technique, on recovery. Our analysis show that equation discovery performed on filtered data recovers, up to a fixed precision, the normal-form (effective) equations rather than the original system.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.19516 ↗

Studies of evolving Boolean network systems have found that Boolean functions cluster into equivalence classes with a characteristic frequency distribution - a pattern governed by the Zyklenzeiger symmetry group - but the dynamical origin of this symmetry has remained unexplained. Here we show that it is a consequence of a fundamental symmetry of Boolean network dynamics itself. A Boolean network consists of nodes that update according to Boolean functions of their regulatory inputs; its global dynamics is encoded in a state-space network. We identify the dynamical symmetry group of ensembles of Boolean networks that average over random interaction topologies: for networks with $N$ nodes, it is the $N$-dimensional hyperoctahedral group, generated by node-flips and node-label permutations. These transformations are admissible for every Boolean network regardless of topology; for random-topology ensembles, including all ensembles of fixed in-degree $K<N$, they constitute the complete symmetry group. We also show that input-label permutations constitute a hidden gauge freedom of the dynamics. The Zyklenzeiger symmetry of Boolean functions follows directly from the node-flips of the hyperoctahedral group together with this gauge freedom. Boolean networks related by the hyperoctahedral group have isomorphic state-space networks and form its orbits, and Burnside's lemma gives the number of these orbits for any fixed network topology. It provides a symmetry reduction of the analysis of Boolean network dynamics and explains why the Boolean functions of evolved networks fall into Zyklenzeiger classes, and why these classes split in finite networks.

comments
17 pages, 7 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.19639 ↗

Investigating word complexity cutoffs for partial and light mixing in subshifts, we construct partially mixing rank-one subshifts whose word complexity functions $p(q)$ satisfy $ \liminf_{q\to\infty}\frac{p(q)}q<2+ε$ for any prescribed $ε>0$ and, conversely, we prove that every lightly mixing rank-one subshift satisfies $ \liminf_{q\to\infty}\frac{p(q)}q>2, $ establishing $2$ as the optimal limiting threshold in the rank-one setting. More quantitatively, we show that every $α$-partially mixing rank-one subshift satisfies $ \liminf_{q\to\infty}\frac{p(q)}q\geq 2+\fracα{(1+α)}. $ Our constructions are a combination of staircase and Chacon-like rank-one stages; we introduce the independently interesting notion of mixing spans and meshes to establish partial mixing while retaining low word complexity.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.19805 ↗

We consider generalized standard maps, that is, maps $F_h:(x,y) \mapsto (x+y+f(x;h),y+f(x;h))$ under quite general assumptions. These maps are area preserving. In particular, the Chirikov standard map, the area preserving Hénon map and the case $f(x;h)= \varepsilon(x-x^n)$, $n\ge 2$, where $\varepsilon = 4 \sinh^2(h/2)$ satisfy our hypotheses. For all these cases, the problem of the existence of transverse homoclinic points arises. We prove that, for a wide class of generalized standard maps, the primary homoclinic points are transverse, provided that some constant is different from 0.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.19842 ↗

This paper studies the number of limit cycles of the polynomial Liénard system $\dot x=y-F(x)$, $\dot y=-x$, where $F(x)=a_1x^{2N}+a_2x^{2m+1}+x^{2n+1}$, with integers \(N,m,n\) satisfying $2\le N\le m<n$, $a_1\ne0$ and $a_2\neq 0$. It is proved that this system has exactly one limit cycle and that every periodic orbit is hyperbolic and attracting for $a_2<0$; this system has no limit cycles for $a_2>0$. The uniqueness proof compares the widths and relative midpoints of the two scalar arcs obtained in potential coordinates. This result gives a positive answer to Conjecture 1.4 of Cen et al. (Sci. China Math., 2026).

fields
Dynamical Systems
pdf ↗ page arXiv:2611.19873 ↗

We study the polynomial Liénard system $$\dot x=y-(a_1x^{2m+1}+a_2x^{2n+1}+x^{2N}),\qquad \dot y=-x,$$ where $0\leq m< n<N$ are integers and $a_1a_2<0$. The supremum of the numbers of limit cycles in this family is at least two for every integer $N\geq3$ and at least three for $N=5$. These results disprove Conjectures 1.5 and 1.6 of Cen et al. [Sci. China Math. 69 (2026)].

comments
22 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.19874 ↗

We prove that any non-minimal critical point of a real analytic potential on a finite-dimensional Euclidean space possesses a nonconstant zero-energy Newton trajectory that converges to the equilibrium as \(t\to+\infty\). By time reversibility, this yields forward Lyapunov instability. We do not assume the critical point is isolated. The proof constructs angular minima via quadratic regularization, matching the regularization coefficient to the leading inertial term. A free forcing coefficient allows continuation past bounded accumulations of correction orders. For polynomial potentials, this produces a complete Hahn-series solution, and differential algebraicity gives a common Puiseux denominator. A fixed-denominator continuation estimate together with a finite Taylor transfer extends the construction to analytic potentials. The realization theorem for the resulting invariant formal phase curve then yields a genuine trajectory. We also exhibit an isolated polynomial singularity for which an exact Euler-field identity admits no relatively differentiable solution on the negative set of the potential.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.19880 ↗

We study minimal sets of countable groups acting by homeomorphisms on regular curves. If the ambient action has a finite orbit, every infinite minimal set is an equicontinuous Cantor system. If there is no finite orbit, the minimal set is unique and remains minimal for every finite-index subgroup. A minimal set supporting an invariant probability is a finite orbit, an equicontinuous Cantor system, a circle isometry action, or a Cantor extension obtained by splitting a countable invariant subset of such a circle. Without an invariant probability, infinitely many nondegenerate components can occur. Their homeomorphism types determine the underlying space, and every nonempty countable family of types is realized. The two-generator free group admits an example with arc components on a dendrite, whereas its restricted wreath product with the integers admits none on any regular curve.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.19898 ↗

In this paper, we first distinguish a very recently introduced notion of mean asymptotic expansivity from asymptotic expansivity. Then, we extend the spectral decomposition theorem due to Smale to bi-mean asymptotically expansive homeomorphisms with the shadowing property. We also extend a measurable spectral decomposition theorem due to Shin to shadowable measures for bi-mean asymptotically expansive homeomorphisms. Each of the chain transitive sub-systems obtained by Shin can be further decomposed into chain mixing systems by using the ideas of Richeson and Wiseman. Next, we use a probabilistic argument to recover both Smale-like and Bowen-like spectral decompositions for expansive homeomorphisms with the shadowing property. Moreover, we investigate inter-relations among several variants of the shadowing property including the eventual shadowing property, the thick shadowing property, the ergodic shadowing property, the mean ergodic shadowing property and the $M_α$-shadowing property.

comments
22
fields
Dynamical Systems
pdf ↗ page arXiv:2611.19977 ↗

In this paper, we generalize the fact that essentially free p.m.p. actions of a countably infinite group admit a minimal model, proved by Weiss and Zucker. We prove that minimal models exist for every essentially free non singular action. Furthermore, as in the p.m.p. case, we prove that all essentially free $μ$-stationary actions (with respect to a fixed generating probability measure $μ$) admit a common minimal model.

fields
Dynamical Systems, Group Theory
pdf ↗ page arXiv:2611.20055 ↗

We study outer measures generated by covering costs that depend on both the diameter and the location of a covering set. After establishing the metric and Borel-regularity properties of this construction, we investigate its stability under perturbations of the spatial gauge. For power gauges, we prove a uniform logarithmic criterion: if the exponent perturbation multiplied by $\log(1/r)$ converges uniformly to $λ$, then the induced measure is multiplied by $e^{-λ}$. Pointwise asymptotic equivalence, however, is insufficient: on $[0,1]$ we construct bounded gauges whose ratio is eventually equal to one at every fixed point, although their induced measures differ by a prescribed factor. In the converse direction, continuity of the ratio in the spatial variable on a Baire space yields equality of the measures on every compact subset of a suitable dense $G_δ$ set. The results identify a concrete obstruction to pointwise-to-measure stability and a localization principle, while leaving open the corresponding question for all Borel sets.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.20104 ↗

This paper studies contraction properties of stochastic dynamical systems governed by Itô stochastic differential equations. We consider two trajectories driven by a common noise process and measure their separation using Finsler distances, which encompass Riemannian and norm-induced distances. Two notions of contraction are then investigated: $L^p$-contraction, defined by exponential decay of the $L^p$-norm (or the $p$-th moment) of the distance, and almost sure contraction, defined by exponential decay of the distance along almost every sample path. Each notion is characterized by a differential condition that is necessary and sufficient for contraction under mild hypotheses. Relations between contraction notions and an associated incremental input-to-state stability result are also established. As an illustration, we apply the established theory to analyze noise-induced synchronization and quantify its robustness with respect to parameter perturbations.

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

Medicaid covers nearly 78 million people, yet care quality varies across states, programs, and clinical domains. Using the 2024 CMS Child and Adult Core Sets (9,781 usable state-measure observations from 11,100 records), this study combined descriptive statistics, benchmark-gap analysis, correlation, and OLS regression to find where shortfalls cluster. Disparities were strongly domain-specific. Maternal and Perinatal Health scored lowest (28.0%), followed by Dental and Oral Health (38.5%) and Behavioral Health (44.4%), while Long-Term Services and Supports (82.8%) and Experience of Care (67.8%) scored highest. State performance correlated strongly with national benchmarks (r = 0.77, approximately), so rates should be read against each measure's benchmark. Domain was the strongest predictor, and the model explained 31.2% of variance. Because of heteroscedasticity and influential observations from mixing bounded and utilization measures, estimates are descriptive. Quality improvement should be targeted by domain, prioritizing maternal health, behavioral health network adequacy, and dental provider participation.

comments
21 pages, 6 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.20276 ↗

We explore the maximally generalized McMullen family of rational maps $F_{n,d,c,a}(z) = z^n + a/z^d + c$, for $n,d\in \mathbb{Z},$ with $n,d\geq 3$, $a\in \mathbb{C}^*$ and $c\in \mathbb{C}$. In the dynamical plane, we establish annular regions containing the Julia sets, and show that the geometric limits of both the Julia and filled Julia sets as $n,d\to \infty$ are contained in the unit circle. In parameter space, for any fixed $a\in \mathbb{C}^*$, we examine the boundedness locus in the $c$-plane. When $n=d$ we find that as $n\to \infty$, the boundedness locus tends to the union of two unit circles centered at $\pm 2\sqrt{a}$. For arbitrary $n,d$, we identify a spine consisting of unit circles determined by the critical values, and prove that the boundedness locus tends to the spine as $n,d\to \infty$.

comments
33 pages, 17 figures including 53 images
fields
Dynamical Systems
pdf ↗ page arXiv:2611.20303 ↗

For a set $S$ of positive integers let $T_S$ send $x$ to $\lceil 3x/2\rceil$ if $x\in S$ and to $\lceil x/2\rceil$ otherwise. The odd numbers give the Collatz map, the even numbers give it again after a shift by one, and $S=\mathbb{N}$ gives Mahler's map $x\mapsto\lceil 3x/2\rceil$. All these maps are subgraphs of the up-down graph $G$, in which every $x$ has the edges $x\to\lceil x/2\rceil$ and $x\to\lceil 3x/2\rceil$, and so are the families of maps in which the direction is forced at some numbers and free at the others. The cycles of the maps are the simple cycles of the subgraph, their divergent orbits are its rays, and all maps of a family are bounded exactly when the subgraph has no ray. We classify the simplest sets and show that density says little: some sets of density one send every orbit to 1, and some periodic sets of arbitrarily small density have increasing orbits. Every positive integer is the least element of a cycle of some map. The critical proportion of steps up is $\log_3 2$: cycles stay below it, divergent orbits stay above it, and both come arbitrarily close. For sets periodic modulo a power of 2, an effective up-frequency from a finite Markov chain takes the place of the density, and a finite computation can prove that every orbit reaches a cycle. Mahler's Z-number problem is implied by a question about one such map. Finally, we ask how far the Collatz map is from maps whose behaviour can be proved. Finite changes never help. Adding fewer than $\log_{3/2}N+1$ even numbers below $N$ makes an orbit increase, while removing the odd numbers congruent to 9 or 15 modulo 16, an eighth of all integers, gives a map all of whose orbits provably reach the cycle (1,2); removing 22 residue classes modulo 512, a proportion 0.043, also suffices.

fields
Dynamical Systems, Number Theory
pdf ↗ page arXiv:2611.20344 ↗

The asymptotic phase is the central object of phase reduction theory for limit-cycle oscillators. It is a scalar coordinate defined throughout the basin of attraction of a limit cycle that advances at a constant natural frequency along every trajectory. Computing the phase from a given mathematical model requires solving a first-order partial differential equation (PDE) over the entire basin, which is challenging due to high computation costs and complex boundary conditions. In this study, we propose a physics-informed neural network to efficiently calculate the asymptotic phase of limit-cycle oscillators. By incorporating three types of loss functions, we train a physics-informed neural network (PINN) to satisfy the governing PDE for the asymptotic phase and the adjoint equation for the phase gradient. The trained network delivers the phase function accurately and, via automatic differentiation, allows the calculation of the phase gradient governing the oscillator's response to perturbations, which enables rapid entrainment closed-loop control using strong inputs. We validate the approach using three types of limit-cycle oscillators and demonstrate that the PINN can facilitate fast and global phase-locking control.

comments
First version preprint, submitted for publication
fields
Dynamical Systems
pdf ↗ page arXiv:2611.20450 ↗

Super-linearization is, roughly speaking, embedding an $n$-dimensional nonlinear dynamical system into an $(n + m)$-dimensional linear system. We introduce and address, in this paper, the inverse problem: given a linear system $\dot x= M x$, what type of dynamical systems can be super-linearized to it? We focus on the special case where the dimension reduction is one (i.e., $m = 1$) and the leading $n$-by-$n$ principal submatrix of $M$ is diagonalizable, and provide a solution to the problem.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.20486 ↗

Transverse subgroups form a special class of discrete subgroups of connected semisimple real algebraic groups that includes all discrete subgroups of rank-one Lie groups, as well as Anosov and relatively Anosov subgroups. We study the joint distribution of partial Cartan projections and the two associated Cartan flags for Zariski dense $θ$-transverse subgroups. Assuming local mixing of the associated Bowen-Margulis-Sullivan measure, we prove two local limit theorems and deduce counting asymptotics in Euclidean balls and tubes, together with equidistribution of the Cartan flags. These qualitative conclusions hold for $θ$-Anosov subgroups, for which the local mixing hypothesis is satisfied. If the group is linearly $θ$-regular near the direction of maximal growth, a polynomial error in local mixing gives polynomial errors in these results. Applying the quantitative local mixing theorem of Kim-Oh-Pan, we obtain local limit and counting theorems with polynomial error estimates for several classes of relatively Anosov representations of Fuchsian groups.

comments
40 pages, 2 figures
fields
Dynamical Systems, Geometric Topology, Number Theory
pdf ↗ page arXiv:2611.20668 ↗

Transverse subgroups form a special class of discrete subgroups of connected semisimple real algebraic groups that includes all discrete subgroups of rank-one Lie groups, as well as Anosov and relatively Anosov subgroups. For torsion-free Zariski dense $θ$-transverse subgroups, we establish Haar local mixing for the partial Weyl chamber action under a Bowen-Margulis-Sullivan (BMS) local mixing hypothesis. The proof is based on a transfer principle using the domains of discontinuity introduced by Delarue-Monclair-Sanders and extended to transverse subgroups by Guedes Bonthonneau-Lefeuvre-Weich. For $θ$-Anosov subgroups, we verify the BMS hypothesis by adapting existing arguments and hence obtain Haar local mixing. As a consequence, we obtain asymptotics for the volume and distribution of long returns and recover the growth indicator from return volumes. Under linear $θ$-regularity, the transfer also holds with polynomial error estimates. This condition is satisfied by subgroups of $θ$-Anosov or relatively $θ$-Anosov groups.

comments
40 pages
fields
Dynamical Systems, Geometric Topology, Number Theory
pdf ↗ page arXiv:2611.20681 ↗

This work develops a stochastic Solow growth model in which the aggregate saving rate is state dependent and evolves on a faster time scale than capital. The saving target follows a mean-reverting process driven by symmetric $α$-stable Lévy noise, while the saving control adjusts toward this target and capital accumulates according to a Solow equation. After scaling, the model is a three-dimensional stochastic dynamical system with multiplicative heavy-tailed noise and a logistic saving function. We establish invariance of the economically meaningful state space for the discrete reflected model, derive the stationary distribution of the saving target in the Gaussian limiting case, and characterize how the tail index and logistic sensitivity affect the coupled dynamics. Monte Carlo simulations show bimodal capital and saving distributions, asymmetric first-passage behavior between low- and high-capital regimes, and a nonlinear relationship between output volatility, the logistic sensitivity, and the tail index. In particular, heavier tails increase the dispersion of the scaled saving target and low-to-high first-passage frequencies, but do not necessarily increase relative output volatility. The results highlight the importance of state-dependent saving and non-Gaussian shocks for growth dynamics.

fields
Dynamical Systems, Probability
pdf ↗ page arXiv:2611.20707 ↗

Let $G$ be a semi-group acting continuously on a compact metric space $X$. The action $G\curvearrowright X$ is called Glasner if for every infinite set $A\subseteq X$ and every $\varepsilon>0$, there exists $g\in G$ such that $gA$ is $\varepsilon$-dense in $X$. Let $\mathcal{K}(X)$ denote the space of nonempty compact subsets of $X$. A $G$-invariant Borel probability measure on $\mathcal{K}(X)$ is called an invariant random compact (IRC), and the action is IC-rigid if $δ_X$ is the only IRC supported on infinite compact subsets of $X$. In this paper we give a pair-correlation criterion implying both IC-rigidity and the Glasner property. As an application, we prove both these properties for finitely generated $\operatorname{Ad}$-Zariski-dense semi-groups acting on compact homogeneous spaces $G/Λ$, where $G$ is connected and noncompact with simple Lie algebra and $Λ<G$ is a cocompact lattice; in particular, this applies to finitely generated Zariski-dense semi-groups of $\mathrm{SL}_d(\mathbb{R})$ and $\mathrm{PSL}_d(\mathbb{R})$. We also derive a Fourier-analytic criterion for semi-group actions on $\mathbb{T}^d$ and use it to prove IC-rigidity for actions arising from suitable matrix-valued polynomials.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.20816 ↗

We propose a conservative, semi-implicit nonstandard finite difference scheme for the reaction–diffusion equation $u_t=λ(|u_x|^{p-2}u_x)_x+f(u)$, $p>1$, where, as is customary, the $p$-Laplacian is regularized by a parameter $\eps>0$. The scheme combines a denominator function, a lagged diffusion coefficient, and a nonlocal treatment of the loss part of the reaction. For every time step and mesh size we prove that the scheme is well posed and positive, that it preserves an invariant region $[0,K]$ whenever the reaction admits one, and that it reproduces every constant equilibrium exactly. Without reaction, it conserves mass, satisfies a discrete maximum principle, and, for $1<p\le 2$, decreases a discrete energy. An example shows that the energy may increase for $p>2$. The truncation error is $O(k+h^2)$ at interior nodes. Numerical tests confirm first order in time and second order in space, and show that the scheme remains positive and bounded for step sizes at which the explicit method breaks down.

fields
Dynamical Systems, Numerical Analysis
pdf ↗ page arXiv:2611.20862 ↗

Let $M$ be a compact smooth manifold of dimension at least three, $\varphi:M\to\mathbb R$ be continuous, and $R\ge2$ be an integer. We construct a $\mathcal C^\infty$ diffeomorphism $T:M\to M$ and an observable $f\in\mathcal C^\infty(M,\mathbb R)$ such that $(T,\varphi)$ has a unique equilibrium state $μ$ and $μ(f)=0$. The system $(T,μ)$ is exponentially mixing of order $R$ but not of order $R+1$ for Hölder observables, and $n^{-1/2}\sum_{i=0}^{n-1}f\circ T^i$ does not satisfy the central limit theorem. The main results have been formalised in Lean 4.

comments
39 pages, 0 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.20966 ↗

In this paper, we prove that the Odd Shift $S_{odd}$ is not sofic for dimensions $d \ge 3$. Our proof uses lower bounds from communication complexity, specifically the result of Raz and Spieker on the nondeterministic communication complexity for the connectivity problem. We also prove that $S_{odd}$ is not sofic for dimension $d=2$ under the assumption we call Mute Ocean.

comments
20 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.21008 ↗

We show that principal ample groupoids with local polynomial growth of degree at most $s$ have dynamic asymptotic dimension at most $\lfloor s\rfloor$. As a consequence, $σ$-compact principal ample groupoids with local polynomial growth have slow dynamic asymptotic dimension growth.

comments
14 pages
fields
Dynamical Systems, Operator Algebras
pdf ↗ page arXiv:2611.21133 ↗

When the species of a siphon in a mass-action network, however many, are fast and their invariant face loses transverse stability along the slow flow, trajectories follow the face past this loss before leaving it. We study three consequences. (i) If the transverse Metzler linearisation is irreducible, the entry-exit relation with its Perron root gives the exit. Under acyclic feeding between its strongly connected components, a max-plus recursion over the reactions gives it; in general neither the Perron root nor the diagonal blocks do. (ii) With one slow species, acyclic feeding and a transversal exit, a fold of the interior critical manifold followed by a drop onto the face gives a unique, exponentially attracting relaxation oscillation whose turning points tend to the fold and exit point. Exactly $3474$ minimal planar networks of molecularity $\leq 3$, with fast per-capita rate affine and decreasing in the slow species, meet our sufficient conditions for it. (iii) A siphon-breaking reaction of rate $δ$ and finite min-plus breaking order $w$ unfolds the transcritical point into a fold if a Perron-weighted second-order self-interaction is positive, and not if negative; the fold's critical component lies at distance of order $δ^{w/2}$ from the face. For $δ=e^{-μ/^Karepsilon}$ the broken face is a floor at $-μ$ in the recursion, and planar cycles leave it between the entry-exit and transcritical points, depending on $μ$. Simulations confirm predicted exits and cycles, including cyclic feeding, where the prediction is conjectural, and high-precision computations confirm the folds; the errors shrink as $^Karepsilon$ or $δ$ decreases.

comments
36 pages, 2 figures, 4 tables. Data and code: https://doi.org/10.5281/zenodo.24259972. Companion papers: arXiv:2610.27188, arXiv:2611.15129
fields
Dynamical Systems
pdf ↗ page arXiv:2611.21420 ↗

For every $a>0$, we prove the existence of a sequence of polynomials with rational coefficients whose non-autonomous iteration produces a Julia set of planar area $a$. We also construct a sequence of rational maps with rational coefficients whose Julia set has the same prescribed area. No individual map in this rational sequence is Möbius-conjugate to a polynomial, and no choice of Möbius coordinates at successive phases turns it into a polynomial sequence. In both cases, for every $n\geq1$, the Julia set obtained by starting the iteration at the $n$-th map, called the phase-$n$ Julia set, is a Cantor set and meets every neighborhood of each of its points in positive planar area. For every $A\in(0,1)$, we construct two sequences of quadratic polynomials, each with $\infty$ in every phase Julia set and with first phase Julia set of normalized spherical area $A$. In one sequence, every phase Julia set is a Cantor set of locally positive spherical area. In the other, every phase Julia set has countably infinitely many connected components and equals the closure of its interior. Both sequences admit invariant measurable line fields whose essential supports are the corresponding phase Julia sets. Finally, for every $d\in[0,2]$, we construct a sequence of quadratic polynomials for which every phase Julia set is a Cantor set of zero spherical area with local Hausdorff dimension $d$ at each of its points.

comments
27 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.21499 ↗

We consider the multiplicative process given by random compositions of linear cocycles over toral translations. Under appropriate generic assumptions, we establish effective large deviations estimates as well as the Hölder continuity of the associated Lyapunov exponent of the process. These properties in particular show the regularizing effect of randomness on quasiperiodic dynamics. The novelty of our approach allows for the study of such properties notwithstanding the lack of a spectral gap for the corresponding transition operator.

comments
60 pages, 5 figures
fields
Dynamical Systems, Mathematical Physics
pdf ↗ page arXiv:2611.21556 ↗

We introduce Hyperlyve (Hyperplane Partitioned Lyapunov Verification and Enumeration), a framework for proving the asymptotic stability of nonlinear dynamical systems, including those with neural network controllers. Hyperlyve learns and formally certifies continuous piecewise-affine (CPA) neural Lyapunov functions within a counterexample-guided inductive synthesis (CEGIS) loop. Hyperlyve's key innovation is a parallel algorithm that enumerates the hyperplane arrangement formed by the ReLU activations of deep networks and certifies that Lyapunov conditions hold within each polyhedral region. We derive sound and complete regional tests to verify the asymptotic stability of the exact smooth dynamics (rather than a piecewise-linear approximation) within a compact domain of interest. Furthermore, we formally characterize the computational complexity of the CPA neural Lyapunov verification problem as co-NP-complete, filling a key gap in the literature. Empirical results demonstrate that Hyperlyve enumerates ReLU networks over 150-times faster than competing tools, which contributes to Hyperlyve proving the asymptotic stability of systems that are currently intractable for state-of-the-art verifiers.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.21599 ↗

Number Theory38

Very recently, Lee announced a proof of the Twin Prime Conjecture assuming the Ratios Conjecture for the Riemann zeta function. We obtain conditional asymptotic formulas with power-saving errors for each of Landau's four prime problems. In the function field setting, using Sawin's estimates for factorization functions in squarefree progressions and a discriminant cohomology argument, we obtain unconditional Goldbach and prime-pair asymptotics over sufficiently large fixed odd fields, including prime fields. Similar results may be possible for other problems in analytic number theory.

comments
46 pages
fields
Number Theory
pdf ↗ page arXiv:2611.18825 ↗

Suppose $q=p^{s_1}$ and $σ=p^{s_2}$ for a prime $p$ and $s_1,s_2\in\mathbb{N}.$ In this paper, we characterize for which values of $p, d, s_1, s_2, \ell$ there exists an irreducible polynomials over $\mathbb{F}_q$ of the form \begin{align*} x^\frac{σ^d-1}{\ell}+\sum_{j=0}^{d-1}a_j x^\frac{σ^j-1}{\ell} \end{align*} for fixed $d,\ell\in\mathbb{N}$ where $\ell\mid (σ-1).$ In particular, we enumerate irreducible polynomials of this form.

fields
Number Theory
pdf ↗ page arXiv:2611.18927 ↗

We prove $p$-adic modularity of a certain class of abelian threefolds over $\mathbf{Q}$ (with imaginary multiplication and rational $p$-isogeny), including the Jacobians of some genus 3 curves known as Picard curves. More precisely, we study a deformation problem for residual 3-dimensional totally reducible Galois pseudorepresentations over an imaginary quadratic field which are ordinary at primes over $p$ and conjugate self-dual. We show that under certain conditions the universal pseudodeformation ring in any weight (including the non-classical low weight corresponding to an abelian threefold) is isomorphic to a specialization of the ordinary Hida Hecke algebra on $U(2,1)$. The conditions that we assume are essentially class group conditions as well as weak regularity of the Hecke algebras in sufficiently high classical weights.

comments
67 pages
fields
Number Theory
pdf ↗ page arXiv:2611.19007 ↗

We show that any ring of totally real abelian integers has a JR-number and therefore the first-order theory of every ring of totally real abelian integers is undecidable. It then follows that the first-order theory of the ring of integers of any abelian extension of $\Q$ is undecidable and that there is one formula without parameters defining $\Z$ in any such ring. The main arithmetic input is a recent paper of Bajpai, Das, Kedlaya, and Mello proving that the houses of cyclotomic integers form a well-ordered subset of $\R$.

fields
Number Theory, Logic
pdf ↗ page arXiv:2611.19103 ↗

In the seventh century CE, Brahmagupta gave a parametric solution to the problem of finding two numbers $x$ and $y$ such that $x+y, x-y$ and $xy+1$ are all squares. We describe a method for generating infinitely many rational parametric solutions of the problem and another method for generating parametric solutions of the problem in terms of univariate polynomials with integer coefficients. The complete solution of the problem still remains elusive.

comments
6 pages
fields
Number Theory
pdf ↗ page arXiv:2611.19315 ↗

Assuming the Riemann hypothesis, we establish lower bounds for large oscillations of the iterated argument functions \(S_n(t)\) of the Riemann zeta function. As a corollary, we prove that, for every fixed integer \(n \geq 0\), \[S_n(t)=Ω_{\pm}\Big(\frac{(\log t)^{1/2}(\log_3 t)^{1/2}}{(\log_2 t)^{n+1/2}} \Big).\] For even \(n\), this recovers two results of Chirre and Mahatab in 2021. For odd \(n\), our result strengthens theirs by establishing the missing direction of oscillation with the same order of magnitude.

comments
13 pages
fields
Number Theory
pdf ↗ page arXiv:2611.19383 ↗

In 1971, Serre showed that the mod $p$ Galois representation associated to a non-CM elliptic curve over a number field is surjective for all but finitely many primes $p$. That is, there exists a constant $c(E,K)$, for $E$ a non-CM elliptic curve over a number field $K$, such that $ρ_{E,p}:\mathrm{Gal}(\overline{K}/K)\to \mathrm{Aut}(E[p])$ is surjective for all primes $p>c(E,K)$. We give a bound for this constant using an effective version of the Faltings isogeny theorem for specific number fields. We show that, for $K=\mathbb{Q}(\sqrt{D})$ with $|D|<50$ and $K$ a formally real number field, given a non-CM elliptic curve $E$ over $K$ we have $c(E,K)\le 2C_1(K)\log N_{K/\mathbb Q}\operatorname{rad}\left( 2\mathcal O_K\mathfrak N_{E}\right )+2 C_2(K)$, where $\mathfrak N_E$ denotes the conductor ideal of $E$, and the constants $C_1(K)$ and $C_2(K)$ can be described explicitly. We also show that for primes greater than this bound, the image cannot be contained in the normalizer of a non-split Cartan subgroup. This works for any Galois number field. Our proof assumes the Generalized Riemann Hypothesis (GRH).

comments
25 pages
fields
Number Theory
pdf ↗ page arXiv:2611.19556 ↗

A prime $p$ is elite if all sufficiently large Fermat numbers $F_n=2^{2^n}+1$ are quadratic nonresidues modulo $p$. Let $E(x)$ be the number of elite primes up to $x$. The best published bounds are $E(x)\ll x/(\log x)^{3/2}$ unconditionally and $E(x)\ll x^{5/6}$ under the Generalized Riemann Hypothesis (GRH), both due to Just. Just and Pollack remarked, without a written proof, that sorting primes by the exact power of $2$ dividing $p-1$ should give $x/(\log x)^{2-\varepsilon}$ and $x^{3/4+\varepsilon}$. We give complete proofs of slightly sharper statements: $E(x)\le(16+o(1))x\log\log x/(\log x)^2$ unconditionally, and $E(x)\ll x^{3/4}(\log x)^{1/2}$ under GRH. We also recall, with short proofs, known facts about the period of $(F_n\bmod p)$ that go back to Aigner: every elite prime $p$ satisfies the defining condition from the index $v_2(\operatorname{ord}_p 2)$ onwards, and the period is even unless $p\in\{3,5\}$. Finally, we show under GRH that, when the moduli involved are at most $x^{1/3}$, the set of primes bounded by the sieve argument has size $\asymp x\log\log x/(\log x)^2$. This indicates that the remaining factor $\log\log x$ cannot be removed by this method alone. All theorems of the paper have been formalized in the Lean 4 proof assistant, with the Brun–Titchmarsh inequality and two standard consequences of GRH as explicit hypotheses.

comments
11 pages. Includes a Lean 4 formalization with three analytic inputs as explicit hypotheses
fields
Number Theory
pdf ↗ page arXiv:2611.19610 ↗

Let $k$ be a finite extension of the rational function field in one variable over a finite field, and let $\mathcal{O}_k$ be its ring of integers. Let $\overline{k}$ be an algebraic closure of $k$. For integers $e \geq 2$ and $n \geq 1$, we study the number of points in the affine space $\overline{k}^n$ whose coordinates are integral over $\mathcal{O}_k$, have absolute logarithmic Weil height equal to $m \geq 0$, and generate an extension of degree $e$ over $k$. More precisely, we derive an asymptotic formula for this quantity as $m \rightarrow \infty$ whenever $n > e$, except in the cases $(n,e)\in \{(3,2),(4,3),(5,4)\}$. When $k$ is the rational function field, however, we use Weierstrass semigroups to obtain asymptotic formulas for the cases $(n,e)\in \{(1,2),(2,2),(3,2)\}$, thereby completing the picture in the setting $e=2$. As an application, we also derive asymptotic estimates for the number of certain decomposable forms with coefficients in $\mathcal{O}_k$.

fields
Number Theory
pdf ↗ page arXiv:2611.19949 ↗

Let $F_n$ denote the $n$th Fibonacci number. We study the Diophantine equation $$ F_{n+5}+F_n=y^5 $$ in positive integers $n$ and $y$. We prove that this equation has no solutions. The proof uses a recurrence identity to reduce the problem to the two equations $$ X^2-5Z^5=44,\qquad X^2+44=5Z^5. $$ We show that the first equation has exactly the solutions $(X,Z)=(\pm7,1)$ for $Z>0$, and that the second has no such solutions. To obtain these results, we use ideal factorization in $\mathbb Q(\sqrt{11})$ and $\mathbb Q(\sqrt{-11})$ and reduce the problem to six quintic Thue equations. Their complete solution sets are computed with the Magma Online Calculator and independently verified with PARI/GP.

comments
8 pages
fields
Number Theory
pdf ↗ page arXiv:2611.19995 ↗

We study nonrational integral units $u,v$ satisfying $au+sv=1$, with integers $1<a<s$, in varying cyclic cubic fields. The ratio $u/v$ generates the joint order $R=\mathbb{Z}[u,v]$ and gives effective finiteness for each fixed first weight and each fixed gap. Consecutive weights yield exactly seven simultaneous-isomorphism classes, at $a=2,4,13$; in every proper order among them, $\{-1,u,v\}$ generates $R^\times$.

fields
Number Theory
pdf ↗ page arXiv:2611.20024 ↗

We give a new computational approach of p-rationality of a number field k, when the method using ray class groups is out of reach in a reasonable time when the degree of k and p are too large. The method is based for a part on the utilisation of the Logp-function that we have defined in the 80's. The general pari/gp program makes no assumptions about k and p. For quadratic fields, we give other programs giving more information (surprisingly these programs, with many instructions, are much faster).

comments
The programs may be copied and pasted, on tex or pdf files, without any knowledge of PARI language. They have been tested as much as possible. They give the response (k is or not p-rational) whatever k and p. Any comments and remarks for improvements are welcome
fields
Number Theory
pdf ↗ page arXiv:2611.20082 ↗

We obtain a family of estimates for short Weyl sums $$ \left| \sum_{x-y<m\le x}e^{2πiαm^n} \right| \ll y\left( \frac{1}{q}+\frac{1}{y}+\frac{q}{y^n} \right)^{\frac{s-1}{s\cdot2^{n-1}}} \bigl(\log(qy)\bigr)^{ \frac{(n-1)^s+s-2}{s\cdot2^{n-1}}}, $$ where $n\ge3$ and $s\ge2$ are fixed integers, $x\ge y\ge2$, $α\in\mathbb R$, $a\in\mathbb Z$, $q\in\mathbb N$, $(a,q)=1$, and $\left|α-\frac{a}{q}\right|\le\frac{1}{q^2}$. For $n\ge4$, we also derive from the modern form of Vinogradov's mean value theorem the estimate $$ \left| \sum_{x-y<m\le x}e^{2πiαm^n} \right| \ll y\left( \frac{1}{q}+\frac{1}{y}+\frac{q}{y^n} \right)^{\frac{1}{n(n-1)+2}} \log y. $$ Using these estimates, repeated Dirichlet approximation, and an estimate in the intermediate range, we establish an asymptotic formula for the number of representations $$ p_1+p_2+m^n=N,\quad |p_i-μ_iN|\le H,\quad i=1,2, \quad |m^n-μ_3N|\le H, $$ where $p_1,p_2$ are primes, $m$ is a positive integer, and $μ_1,μ_2,μ_3$ are fixed positive numbers whose sum is $1$. The asymptotic formula holds in the range $$ N^{1-θ_n}(\log N)^{A_n}\le H\le N^{1-δ}, \qquad θ_n=\min\left\{\frac{1}{2n},\frac{2}{n^2}\right\}, $$ where $0<δ<θ_n$ is fixed, $A_3=3$, $A_4=\frac{61}{4}$, and $A_n=6n-12+\frac{22}{n}-\frac{12}{n^2}$ for $n\ge5$. In the cubic case, the logarithmic exponent in the previously known lower bound for $H$ is reduced from $10$ to $3$. For $n\ge4$, the exponent of $N$ is reduced from $1-\frac{1}{n(n-1)}$ to $1-\frac{2}{n^2}$.

comments
22 pages
fields
Number Theory
pdf ↗ page arXiv:2611.20151 ↗

We study elliptic curves over $\mathbb{Q}(t)$ obtained from an elliptic surface by imposing two quadratic conditions, each of which produces a new point. By the Kani-Rosen decomposition, the joint cover is rational only when the branch loci of the two conditions meet; for two quadratic conditions this means that they share a root. We apply this to two surfaces. For Elkies's rank-four K3 surface with torsion $\mathbb{Z}/4\mathbb{Z}$, a catalogue of $194$ quadratic conditions contains exactly two such pairs. One recovers the rank-six curve of the authors; the other gives a second, inequivalent curve with torsion $\mathbb{Z}/4\mathbb{Z}$ and rank six. For the universal curve with torsion $\mathbb{Z}/2\mathbb{Z}\times\mathbb{Z}/6\mathbb{Z}$, $42$ conditions give exactly $21$ rational joint covers, which yield seven curves of rank two. Two more arise from a tower of conditions. Five of these nine curves are the curves of Dujella, Kazalicki and Peral; the other four are not equivalent to any of them. In both cases we determine the Mordell-Weil groups over $\mathbb{Q}(t)$ exactly, and we prove that the curves are pairwise inequivalent under invertible changes of parameter, even over $\overline{\mathbb{Q}}$.

comments
15 pages
fields
Number Theory
pdf ↗ page arXiv:2611.20161 ↗

We say that a monic polynomial $f(x)\in {\mathbb Z}[x]$ is {\em monogenic} if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,θ,θ^2,\ldots,θ^{{\rm deg}(f)-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(θ)$, where $f(θ)=0$. Let $n,a,c\in {\mathbb Z}$ with $n\ge 3$, and suppose that \[{\mathcal F}_{n,a,c}(x):=x^n+cx^{n-1}+acx^{n-2}+a^2cx^{n-3}+\cdots +a^{n-2}cx+a^{n-1}c\] is irreducible over ${\mathbb Q}$. Recently, Jakhar, Kalwaniya and Yadav have given necessary and sufficient conditions for the monogenicity of ${\mathcal F}_{n,a,c}(x)$, under the assumption that all prime divisors of the discriminant of ${\mathcal F}_{n,a,c}(x)$ not dividing $ac$ also do not divide $n+1$. In this note, we provide necessary and sufficient conditions for the monogenicity of ${\mathcal F}_{n,a,c}(x)$ without this restriction.

fields
Number Theory
pdf ↗ page arXiv:2611.20332 ↗

In 1973, Montgomery posed the pair correlation conjecture (PCC) for the zeros of the Riemann zeta function. Motivated by PCC, Montgomery conjectured that the nontrivial zeros of the Riemann zeta function are almost surely simple, and proved that at least $2/3$ are simple assuming the Riemann hypothesis (RH). In 1978, Mueller and Gallagher were able to prove asymptotically $100\%$ are simple assuming PCC and RH. Recently, Goldston et al. noticed that the assumption of RH can be removed in Mueller and Gallagher's method. In fact, assuming PCC by itself without RH is sufficient to prove that asymptotically $100\%$ of the nontrivial zeros are both simple and on the critical line. We adapt the notion of horizontal multiplicity from Goldston et al. to show that the nontrivial zeros of Artin $L$-functions attached to irreducible linear representation of the Galois group over $\mathbb{Q}$ are almost surely simple and lie on the critical line without assuming the generalized Riemann hypothesis (GRH). We will assume the appropriate version of PCC along with some other widely believed conjectures.

fields
Number Theory
pdf ↗ page arXiv:2611.20347 ↗

Khinchin's theorem says that, for Lebesgue almost every real number, the geometric mean of the partial quotients in its continued fraction expansion converges to a universal constant $K\approx 2.6854520010\ldots$. We show that the same constant is obtained when the partial quotients are sampled along any fixed strictly increasing deterministic sequence of indices. Thus arithmetic progressions, polynomial sequences, prime indices, and lacunary sequences all give the usual Khinchin constant. We also look at a different selection rule: instead of restricting the indices, we restrict the values of the partial quotients. In this case the answer changes. The geometric mean of the prime-valued partial quotients converges almost surely to a new constant $K_{\mathcal P}\approx {3.439477971}\ldots$.

comments
8 pages
fields
Number Theory
pdf ↗ page arXiv:2611.20421 ↗

We present a Mathematica package entitled ECPack.wl, where we implement many important properties and commands relevant to the study of elliptic curves over the rationals and finite fields, namely $\mathbb{Q}$ and $\mathbb{F}_q$, where $q=p^r$ and $p$ is prime. By streamlining the analysis of general elliptic curves and their transformations, ECPack.wl offers foundational computational tools for applications in high-energy physics, including elliptic Feynman integrals. This package significantly extends the functionalities of a package due to McGee in so far as we are able to study all versions of elliptic curves, such as the long Weierstrass, quartic and Legendre forms. We implement suitable transformations that are required for the general case, as well as those associated with fields of characteristic 2 and 3. Furthermore, the package computes many curve properties, such as point arithmetic, minimality checks, rank bounds and analytic rank, group structure, invariants, and the Weil and Tate pairings, over both $\mathbb{Q}$ and $\mathbb{F}_p$, as well as the Kodaira classification of the singular fibres of one-parameter families of elliptic curves, with the associated F-theory data. The package and its accompanying notebooks are available at https://github.com/DhamakedarDarsh/Mathematica-Code-and-worked-out-notebooks-for-Elliptic-Curves

fields
Number Theory, Mathematical Physics
pdf ↗ page arXiv:2611.20548 ↗

We study the distribution of primes among Frobenius conjugacy classes in finite Galois extensions of global fields. In earlier work, the author and Koyama proved that the existence and nonvanishing of the limit of partial Euler products on the critical line for Artin $L$-functions (the Deep Riemann Hypothesis (A), or DRH(A)) are equivalent to an asymptotic formula for weighted prime counting functions with an unspecified constant term. In this article, we prove that a refined asymptotic formula is equivalent to the full version of DRH, namely the convergence of the Euler products on the critical line (DRH(A)) and the determination of their limiting values (DRH(B)). Here, the constant term is given explicitly in terms of the residue of the zeta function, central derivatives of Artin $L$-functions, ramified primes, and higher prime-power contributions.

fields
Number Theory
pdf ↗ page arXiv:2611.20592 ↗

Let $(U_{n})$ be a nondegenerate Lucas sequence with coprime integer parameters. Assuming the rational $abc$ conjecture, we prove that almost every index $n$ has a primitive prime divisor of $U_{n}$ of multiplicity one. More quantitatively, the logarithmic contribution of repeated primitive prime factors tends to zero relative to the primitive part along any family with $φ(n) / n$ bounded below, and also in Cesàro mean over all indices. We derive explicit logarithmic lower bounds for Lucas non-Wieferich primes with ranks in prescribed residue classes. Both signs of the discriminant are allowed. Independently, we describe initial multiplicities at good odd primes by a unique Hensel root in the recurrence-parameter disk and by the exact contraction rate of a normalized Dickson-polynomial iteration. Applications include rank and period lifting for Fibonacci numbers and the Wall-Sun-Sun condition.

fields
Number Theory
pdf ↗ page arXiv:2611.20650 ↗

Let $k\ge2$ be an integer. Inspired by an observation of Erdős (1976), we investigate the behavior of $h_k(n)$, the number of $k$-full integers in the interval $(n^k, (n+1)^k)$ for positive integers $n$. Let $δ_k$ denote the supremum of the exponents $δ$ for which the inequality $h_k(n) > (\log n)^δ$ holds for infinitely many positive integers $n$. We improve the previously known lower bound $δ_k \ge 1/2$, implied by Munsch, Shparlinski, and Yau (2020), to $δ_k \ge 1$. Furthermore, for any given integer $m \ge 1$, we derive an effective upper bound for the smallest positive integer $n$ satisfying $h_k(n)\ge m$.

comments
8 pages
fields
Number Theory
pdf ↗ page arXiv:2611.20656 ↗

In this paper, inspired by recent work of Guo and Zhao, and of Guo and Zudilin, we establish two parametric extensions of their $q$-supercongruences using Gasper and Rahman's quadratic summation, the Chinese remainder theorem, and the creative microscoping method. These extensions yield two one-parameter generalizations of the $q$-supercongruences considered by Guo and Zhao and by Guo and Zudilin.

comments
17 pages
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2611.20776 ↗

For a positive integer $n\ge 2$, we look at the number of solutions of the Diophantine equation $$ n(x_1+\cdots+x_n)=x_1\cdots x_n. $$ Denoting by $f(n)$ this number we show that $\liminf_{n\to\infty} \log f(n)/\log n=0$.

journal
Proc. Amer. Math. Soc. 154 (2026), no. 2, 541--548
fields
Number Theory
pdf ↗ page arXiv:2611.20783 ↗

We study the Diophantine equation $$n^h(x_1 + \ldots + x_n) = x_1 x_2 \cdots x_n,$$ where $h \in \mathbb{Z}_{\ge 0}$, and $x_1 \le \ldots \le x_n \in \mathbb{Z}^+$. We define the solution set $ELE(h, n)$ consisting of all such integer tuples. We derive bounds on $x_n$ and $x_{n-1}$ in $ELE(h,n)$. We prove that $x_1 \cdot\ldots\cdot x_n \le n^h(n^h + 1)(n^h + n - 1)$. We also show that for $h = 1$, $x_{n-1} \le n + \max_{d \mid 2n^2 - 2n,\, d \le \sqrt{2n^2 - 2n}} d$, and for $h \ge 2$, the inequality $x_{n-1} \le 2n^h$ holds in $ELE(h, n)$. Moreover, we study the minimal value $g(h, n)$ of the largest coordinate $x_n$, and define $g(h) = \min_{n \ge 2} g(h,n)$. We prove that $$ \liminf_{n \to \infty} \frac{g(h,n)}{\frac{\log \log n \cdot \log \log \log \log n}{\log \log \log n}} \ge 1. $$ We also estimate the growth of the number of solutions. We show that for any $\varepsilon > 0,$ we have $\sum_{m \le n} |ELE(h,m)| < n^{h+1+\varepsilon} $ for sufficiently large $n$, and that $|ELE(h,n)| > n^{1 - \varepsilon}$ for infinitely many $n$.

journal
Res. Number Theory 11 (2025), no. 4, Paper No. 94, 15 pp
fields
Number Theory
pdf ↗ page arXiv:2611.20799 ↗

Let $p>2$ be a prime and $F/\mathbf{Q}_p$ be a finite extension. We prove that every admissible smooth mod $p$ representation of $\mathrm{GL}_2(F)$, with a central character, and satisfying a Casimir annihilation condition, has finite length.

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

Let $Γ$ be a rank-two subgroup of the integral norm-one units in a totally real non-Galois cubic field. We prove that two distinct affinely equivalent minima of Godwin's spread on $Γ\setminus\{1\}$ generate $Γ$ and determine its complete minimum set: a pair with sum $\pm2$ or a triple of integral translates of product one. Every minimum generates the order $\mathbb{Z}[Γ]$. For an order whose norm-one units have such a pair, the order generated by its units is the smallest suborder with the same minimum value. We also give explicit families and a maximal order with minima in two distinct affine classes.

fields
Number Theory
pdf ↗ page arXiv:2611.20930 ↗

Let $S_k$ denote the least Carmichael number with exactly $k$ prime factors. Like the later searches of Pinch, our algorithm builds the prime factors of a candidate in increasing order and stops as soon as the preproduct $P$ satisfies $Pλ(P) > B$. At that point there is at most one possible cofactor, and we recover all of its prime factors at once in polynomial time. We prove an unconditional bound on the number of candidates the search examines, in terms of how far $B$ exceeds the product of the first $k$ primes. When the search is run in doubling passes, this gives a running time of $e^{O(k)} = S_k^{O(1/\log k)}$ under a natural conjecture on the size of $S_k$. We also show that the constant in the exponent is sharp for the set of square-free numbers that the bound counts. Finally, we compute $S_k$ for every $k \leq 64$; Pinch had computed it for $k \leq 35$.

fields
Number Theory
pdf ↗ page arXiv:2611.21013 ↗

The goal of this article is to introduce the category of effective filtered multivariable $(\varphi, N)$-modules and the category of multivariable $(\varphi, N_\nabla)$-modules of finite $E_Δ$-height over the rigid-analytic open polydisk $\mathcal{O}_Δ$, and to establish an exact tensor equivalence between them. This generalizes Kisin's analytic classification of filtered $(\varphi, N)$-modules and provides the rigid-analytic foundation for multivariable $p$-adic Hodge theory.

comments
35 pages, comments welcome
fields
Number Theory
pdf ↗ page arXiv:2611.21039 ↗

We continue our study of the invariants of the $L$-functions of deree 2 twisted by Dirichlet characters. In a previous paper, we proved that twisting does not change degree and internal shift. Our aim now is to show a corresponding theorem for the conductor. This paper is intended as the second part of a series aiming to prove a general version of the Weil converse theorem with minimal assumptions on the shape of the functional equation of twists.

comments
7 pages
fields
Number Theory
pdf ↗ page arXiv:2611.21046 ↗

We prove an explicit version of Tartakowsky's theorem over all totally real number fields. Namely, a positive definite integral lattice of rank at least five represents every totally positive integer that it represents locally, provided that the norm of the integer exceeds an explicit bound, exponential in powers of the volume of the lattice and of the discriminant of the field. As an application, we give explicit criterion sets for universal quadratic forms over all but finitely many real quadratic fields. Finally, we determine the minimal criterion sets for an infinite family of real quadratic fields.

comments
30 pages, preliminary version
fields
Number Theory
pdf ↗ page arXiv:2611.21117 ↗

We express Néron functions on Jacobians of odd-degree hyperelliptic curves of arbitrary genus in terms of admissible pairings, using the pullback of the theta divisor via a generalized Abel–Jacobi morphism. Over non-archimedean local fields, we relate Néron functions to local Néron pairings on the curve and, moreover, deduce a comparison between unramified $p$-adic Néron functions and unramified local Coleman–Gross height functions. Furthermore, we decompose the Néron function into an intersection term $I$ and a Green function term $T$, and compute $T$ for specific semistable reduction types. We compare our decomposition with other decompositions in the literature.

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

Let $P^+(n)$ denote the largest prime factor of $n$, with $P^+(1)=1$. We prove that, for every $β>103/(256\sqrt e)$, there is a constant $C=C(β)>0$ such that every sufficiently large integer $N$ can be written as $N=a+b$, where $a,b\in\mathbb{Z}_{>0}$ and $$ P^+(a)\leq N^β,\qquad P^+(b)\leq(\log N)^C. $$ This strengthens Balog's result, which gives two $N^β$-smooth summands for $β>4/(9\sqrt e)$. The proof combines Balog's argument with convolution estimates that are uniform in the residue class.

fields
Number Theory
pdf ↗ page arXiv:2611.21136 ↗

For a polynomial $f$, $a>0$ and $b,ω\in\mathbb{C}$, consider the translate $J^{(a,b,ω)}f(z)=f(z/a)-ωf(b/a)$. We show that for $f(x)=(x^{2}-1)^{n}$ and $ω=\pm1$ every zero of $J^{(a,b,ω)}f$ lies on the Cassini oval $|z^{2}-a^{2}|=|b^{2}-a^{2}|$. We call these translates \emph{Cassini polynomials} and give their zeros explicitly, prove that the zeros for $ω=1$ and $ω=-1$ strictly interlace on each component of the oval, and evaluate their discriminants and resultants in closed form. We then prove the reduced monic polynomials $Q_{n}=a^{2n}J^{(a,b,ω)}f/(z^{2}-b^{2})$ factor into homogenized cyclotomic polynomials, satisfying $\operatorname{Res}(Q_{m},Q_{n})=(b^{2}-a^{2})^{2(m-1)(n-1)}$ for coprime $m,n$, and have discriminants governed by a Lucas sequence. We then prove a comparison principle: if $f$ is even or odd with all zeros in $[-1,1]$, $b\in\mathbb{R}$ and $|ω|\le1$, then every zero of $J^{(a,ib,ω)}f$ satisfies $|z^{2}-a^{2}|\le a^{2}+b^{2}$, and the symmetry hypothesis cannot be removed. As an application, every solution of $\det(A(P_{n})-λI)=F_{n+1}$, where $A(P_{n})$ is the adjacency matrix of the path on $n$ vertices and $F_{n+1}$ is a Fibonacci number, satisfies $|λ^{2}-4|\le5$. This disproves, for every $n$, a conjecture of Gullerud, Johnson and Mbirika that the real parts of these solutions are unbounded.

fields
Number Theory
pdf ↗ page arXiv:2611.21142 ↗

We define a notion of Möbius-pseudorandomness for integer sequences generated by multivariate polynomials computed by small and simple algebraic circuits. This mirrors a related definition of Kalai that concerns boolean functions computed by small boolean circuits. We then prove Möbius-pseudorandomness results for polynomials computed by algebraic circuits with few multiplication gates (of any depth), for polynomials with small-dimensional partial derivative space, and for the determinant and permanent. We conjecture that these results hold in general for polynomial-size algebraic circuits.

fields
Number Theory
pdf ↗ page arXiv:2611.21201 ↗

We study the Zeta functions associated with polygonal numbers, focusing on their meromorphic continuation, poles, residues, and trivial zeros. We then investigate the distribution of their nontrivial zeros. Under explicit hypotheses, we derive an asymptotic formula for the mean real part of zeros in long height windows. The formula predicts convergence of this mean to 1/4 as the height tends to infinity. We also formulate a stronger concentration conjecture and examine numerical evidence for it.

comments
19 pages
fields
Number Theory
pdf ↗ page arXiv:2611.21202 ↗

Given an ideal $\mathcal I$ on the nonnegative integers, we study the family $Σ(\mathcal I)$ of all sets for which every $\mathcal{I}$-small modification is not a nontrivial sumset $A+B$. We prove that $Σ(\mathcal I)$ is comeager whenever $\mathcal{I}$ is an Erdős–Ulam ideal generated by a nonincreasing sequence of positive weights. This answers an open question for the ideal $\mathcal{Z}$ of asymptotic density zero sets in [Proc. Amer. Math. Soc. \textbf{151} (2023), 3681–3689]. We also show that $Σ(\mathcal I)$ is either empty or a dense $G_δ$-complete set whenever $\mathcal{I}$ is an $F_σ$ ideal which is invariant under finite modifications. This implies that the family of nontrivial sumsets $A+B$ is $F_σ$-complete (hence, Borel). On the other hand, we construct a meager ideal $\mathcal{I}$ for which $Σ(\mathcal I)$ is neither meager nor comeager. Finally, we prove that $Σ(\mathcal Z)$ is coanalytic and not $F_{σδ}$.

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

Zywina recently showed that infinitely many elliptic curves over $\mathbb{Q}$ have rank $2$, settling a long-standing open question. We explore the analytic version of this problem, showing that every elliptic curve over $\mathbb{Q}$ has infinitely many quadratic twists with analytic rank either $2$ or $4$, subject to GRH. We also obtain, under the same assumption, infinitely many congruent number curves with odd analytic rank between $3$ and $17$.

comments
15 pages, comments welcome!
fields
Number Theory
pdf ↗ page arXiv:2611.21447 ↗

We investigate the complex moments of the derivative of the Riemann zeta function through a random Euler product model. For each fixed $σ>1/2$ and every $s\in\mathbb{C}$ with $\operatorname{Re}(s)>0$, we show, under the Lindelöf hypothesis, that the $2s$-th moment of $|ζ'(σ+\mathrm{i}t)|$ over $t\in[1,T]$ converges, as $T\to\infty$, to the corresponding moment of the derivative of the random Euler product. We then establish, unconditionally, an asymptotic formula for the latter moment as $σ\downarrow 1/2$ throughout the half-plane $\operatorname{Re}(s)>0$. For positive real moments, our approach is based on a change-of-measure argument and a Gaussian limit theorem for the logarithmic derivative under a tilted probability measure. For general complex moments, we combine Fourier analysis of weighted complex measures with regularized Riesz distributions. As an application, under the Lindelöf hypothesis, we resolve the conjecture of Simm and Wei [J. Lond. Math. Soc. 113 (2026)] on the complex moments of the derivative of the Riemann zeta function for every $s\in\mathbb C$ with $\operatorname{Re}(s)>0$. We establish the predicted asymptotic formula as $σ\downarrow1/2$, with the leading order $s^2+2s$ and an explicit leading coefficient involving an arithmetic factor and the confluent hypergeometric function of the first kind. The conjecture also holds unconditionally when $\operatorname{Re}(s)\in (0,2)$.

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

Information Theory36

In this paper, we study reduced similarity decompositions of \emph{deterministic} datasets using redundancy graphs and obtain \emph{ensemble} bounds for the minimum size of such constrained decomposition. We consider batch decompositions that reduce similarity \emph{across} batches and use the Lovász local lemma to obtain bounds for the minimum size of a decomposition with a given pairwise dissimilarity. We then consider unique batch decomposition with a given relaxation parameter and obtain upper and lower ensemble bounds for the minimum size. Throughout, we use Binomial random graphs to obtain the desired ensemble bounds, by conditioning on the number of similar \emph{pairs} of data points.

comments
Accepted for publication in Springer Proceedings in Mathematics and Statistics, QEDS conference, Ranchi, India
fields
Information Theory
pdf ↗ page arXiv:2611.18625 ↗

We study information-theoretic and algorithmic aspects of random matrix discrepancy in proportional regime. The problem amounts to finding $κ=\min_{\x\in\mB^n}\|\sum_{i=1}^{n}\bar{A}_i\x_i\|_2$, where $\bar{A}_i\in\mR^{d\times d}$ is a collection of $n$ iid GOE matrices, $\mB^n$ are vertices of the unit cube in $\mR^n$, and $α=\lim_{n\rightarrow \infty}\frac{n}{d^2}$ is a proportionality constant. Strong progress is made in several directions: (i) We develop a Random duality theory (RDT) framework and utilize its a lifted variant to establish lower bounds on $κ$, which precisely match the bounds obtained via the first moment in [81]. (ii) To address analytical challenges, we propose a negative Hopfield model as a proxy for implementation of a fully lifted RDT. On the 2nd lifting level, this model fits remarkably well between the information-theoretic lower bounds from [81] and the algorithmic upper bounds from [38]. (iii) On the 3rd and 4th lifting levels, parametric RDT concepts predict a sizeable computational gap for lower $κ$ values in the proxy model. Extending proxy information-theoretic fitting to algorithmic suggests a similar computational gap for matrix discrepancy in low $κ$ regime, aligning with [73]. (iv) We design a Controlled Loosening Up (CLuP) algorithm for matrix discrepancy. Its performance strongly matches our analytical results -- closely approaching information-theoretic predictions in lower $α$ ranges (indicating a small or nonexistent computational gap) and following the proxy model's algorithmic predictions in higher $α$ ranges (indicating a sizeable computational gap). Both the information-theoretic and algorithmic predictions match the corresponding phenomenologies of the symmetric binary perceptron (SBP) vector analogue in the entire $α\in(0,\infty)$ range [1,2,14,31,51,92,111].

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

We complete the Eskenazis–Nayar–Tkocz conjecture: among the one-dimensional projections of the uniform measure on a cube, differential entropy is maximized precisely in directions with equal coordinate magnitudes. Pang proved the conjecture in every dimension at least $150$. We prove the remaining dimensions using polynomial entropy bounds in dimensions three through six and exact certificates for derivatives of the logarithm of the diagonal projection density. The proof uses integer arithmetic and certified one-dimensional integration. We also derive quantitative stability estimates and determine the optimal asymptotic coefficient of a linear stability bound. The source code and the outputs of all finite verifications accompany the paper.

comments
20 pages, 1 figure
fields
Information Theory, Probability
pdf ↗ page arXiv:2611.18798 ↗

Co-channel interference (CCI), caused by the inevitable aggressive channel reuse in dense deployments, remains a critical bottleneck for current and future wireless communication systems. In this paper, we address this bottleneck in an N-co-channel wireless communications network of single-antenna transmitters and receivers. The limiting case of this problem leads to a novel "thought experiment": If each receiver's own desired channel link is simultaneously completely blocked, can a Maximum Likelihood Detection at each receiver still recover its transmitted symbol? In the traditional way of thinking, the answer is no: The receiver obtains nothing but co-channel interference (CCI) plus thermal noise, and a receiver-side phase rotation cannot help, since there is no desired signal to align. Given only the channel matrix H -- and no knowledge of the transmitted symbols -- can the transmitters' phases be chosen so that the received signal becomes "almost" the desired symbol at every receiver? We show that the answer is yes. We first develop the underlying framework for the general case (nonzero own-channel link case), turning classical co-channel systems into a novel discrete phase-optimization problem, "Game of Phases: Surrogate Symbol Optimization", and present two algorithms, "Minimum Phased-Interference Power algorithm (MiPIP)" and "Maximum Phased-Interference Support (MaPRIS)". We then show that the MaPRIS resolves the thought experiment: it converts hostile CCI into an "almost" desired symbol even when the own desired channel link is zero, yielding the counter-intuitive result that higher CCI variance yields higher SINR. Extensive simulation results confirm the findings. The gain promised by the proposed algorithms comes on top of any other CCI reduction techniques as our framework here is based on a bottom-line baseband model.

comments
23 pages. Submitted to the IEEE Open Journal of the Communications Society
fields
Information Theory
pdf ↗ page arXiv:2611.18942 ↗

Communication over multiple-input multiple-output (MIMO) systems is degraded by phase noise (PN) arising from imperfect local oscillators, with PN becoming more severe at higher carrier frequencies. Existing methods either rely on linearized Kalman-filter approaches or apply variational Bayes (VB) only to individual stages, such as data detection under a static phase prior, or channel estimation alone, leaving no unified framework that tracks an evolving PN process consistently across pilot and data transmission. This paper develops such a framework for uplink massive MIMO. Specifically, we first propose VB-Tracking, which employs von Mises priors and coordinate-ascent VB inference to jointly estimate the channel and track the transmit and receive PN trajectories during the pilot phase without linearization. We then propose VB-Detecting for joint data detection and phase tracking by absorbing the transmit PN into a composite transmit variable. Using a sequentially propagated von Mises predictive prior, the composite variable admits an exact closed-form posterior. Finally, we propose VB-Refining, which periodically re-estimates the channel during data transmission using the soft posterior moments of reliably detected transmit symbols as virtual pilots. We show that VB-Detecting scales linearly in the number of users, receive antennas, constellation size, and iterations. Simulations against EKF-EP, EKF-ZF, and JED baselines show that VB-Tracking, VB-Detecting, and VB-Refining together achieve lower channel NMSE and symbol error rate, with the performance gap widening at high SNR and under severe PN.

fields
Information Theory
pdf ↗ page arXiv:2611.18947 ↗

Token transmission over conventional digital modulation is vulnerable to channel impairments, leading to bit errors that cause received tokens to become contextually inconsistent. This paper proposes a receiver-side dual-stage channel-posterior integration framework for masked language model (MLM)-aided token reconstruction. In the proposed framework, the receiver detects unreliable token positions from channel reliability and constructs a vocabulary-level channel-posterior. In particular, within the receiver, Posterior-Weighted Input Embedding (PWE) injects this posterior into the MLM input, while Adaptive Output Logit Fusion (AOF) reuses it at the output with a channel-adaptive weight. Consequently, multiple unreliable tokens can be reconstructed in a single bidirectional MLM inference without retransmission, transmitter-side encoding, or additional MLM training. Experiments over noisy channels show up to a $67.2$\% improvement in cosine similarity over context-only MLM reconstruction, with consistent gains across different MLM architectures and existing language-model-aided methods.

comments
6 pages, 5 figures, This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible
fields
Information Theory
pdf ↗ page arXiv:2611.18958 ↗

Constant dimension subspace codes (CDCs) have become an important object in coding theory due to their applications in random network coding. The paper is devoted to constructing optimal Ferrers diagram rank-metric codes for block Ferrers diagrams, which play a crucial role in the multilevel construction of CDCs. Let \(\mathbb{F}_q\) be the finite field with \(q\) elements of characteristic \(p\), \(P\) be a power of \(p\), and \(e\) be a positive integer. Let \(L=\mathbb F_{q^{eP}}\) and \(σ\) be the Frobenius \(\mathbb F_q\)-automorphism of \(L\), set \(N=σ^e-\mathrm{id}\). Based on the multiplicative property of the kernel filtration of the nilpotent map \(N\), we construct optimal Ferrers diagram rank-metric codes for block monotone diagrams. Specifically, considering \(n \times l\) Ferrers diagrams, we prove that optimal codes always exist for block monotone diagrams when \(n = eP\). Furthermore, by employing puncturing on columns, we prove that optimal codes also always exist for block strictly monotone diagrams, removing the restriction \(n = eP\). Consequently, optimal codes always exist for block upper triangular diagrams, specifically for maximum sum-rank distance (MSRD)-constructible block diagram pairs, which generalizes the corresponding results in \cite{neri2024,calderini2026}, in which the rank distance or the characteristic is restricted. Furthermore, by employing both puncturing and shortening on columns, we prove that optimal codes always exist for quasi-block strictly monotone diagrams, thereby generalizing the corresponding results in \cite{pratihar2023, zhang2019}. The optimal codes constructed in this paper will potentially be beneficial to the further construction of CDCs.

fields
Information Theory
pdf ↗ page arXiv:2611.19070 ↗

Zero-shot diffusion codecs such as Turbo-DDCM compress images without any training. In each coded step, the encoder selects noise vectors from one codebook and transmits a single index for the selected set. We propose sectioned codebooks. A coded step is divided into sections, and each section has its own large codebook and transmits its best vector as a short field of bits. A model based on order statistics quantifies how well the bits of a step are used and predicts the gain of sectioned codebooks from measurements of Turbo-DDCM alone. Fast Walsh-Hadamard transforms make sections of $2^{20}$ vectors practical. At equal bits, sectioned codebooks improve the PSNR of Turbo-DDCM by 0.18 to 0.51 dB on three datasets, improve LPIPS and DISTS, and save 16 to 21% of the bits at equal PSNR. Codecs that are robust to channel errors by design are usually compared only with unprotected codecs. We compare them, at equal total bits, with a codec protected by one channel code. With one BCH code, the sectioned codec outperforms all reported results of Robust Turbo-DDCM and BitFlat on two datasets, by up to 7.74 dB at the highest bit error rate. At the lowest bit error rate its margin over BitFlat is only 0.08 to 0.16 dB. When the code fails, the receiver can still decode the fields as received. Additional experiments cover burst errors and packet loss, and all observed gains of robust codecs stay within a limit derived from the channel capacity.

comments
14 pages, 6 figures, 7 tables
fields
Information Theory
pdf ↗ page arXiv:2611.19192 ↗

We propose two enhanced conditional innovation (CI) metrics for informed dynamic scheduling (IDS) in belief-propagation (BP) decoding of LDPC codes. The CI-based residual BP (CIRBP) algorithm uses the CI metric to guide the selection of the variable node (VN) to be updated and has been shown to outperform several existing IDS-based BP decoders, especially at the early decoding stage. However, the original CI metric uses only the absolute difference between the current and precomputed posterior probabilities and does not separately account for the reliability associated with each probability. By reformulating the CI metric relative to the decision boundary, we separate each posterior probability into its decision side and a linear-distance term reflecting reliability. Replacing the latter with the binary entropy complement yields the proposed entropy-based CI (E-CI) metric. Moreover, the proposed quadratic CI (Q-CI) metric is derived from the leading quadratic term in the local expansion of the entropy complement, avoiding the logarithmic operations required for direct E-CI evaluation. We apply both proposed metrics to the CIRBP decoder and its node-wise variant. Numerical results show that the proposed metrics generally provide lower frame error rates than the original CI metric, with their relative advantages depending on the code and decoding procedure.

comments
25 pages, 18 figures, 3 tables
journal
Entropy 2026, 28, 1246
fields
Information Theory
pdf ↗ page arXiv:2611.19269 ↗

Watermarking has emerged as an important technique for distinguishing AI-generated text from human-written text. However, most existing work is primarily empirical, relies on ad hoc watermarking designs, and lacks a fundamental understanding of the performance limits. In this paper, we propose a unified theoretical framework for statistical watermarking of large language models (LLMs), casting the problem as an independence test between generated text and common randomness and jointly designing the watermarking embedder and the detector. Our objective is to maximize detection power while controlling the worst-case false positive rate (FPR) and limiting distortion to text quality. A central focus of our framework is the design of the common randomness, which plays a critical role in both watermark embedding and detection. We characterize the fundamental limits of statistical watermarking under both fixed and optimizable common randomness. Our results show that optimizing the common randomness does not improve the fundamental limits: the best achievable performance is the same as that with fixed common randomness. Nevertheless, common randomness design remains highly important because it can substantially simplify detector design. In particular, with optimizable common randomness, a fixed, deterministic, and model-agnostic detector can achieve optimal performance. We further study a practical setting with fixed uniform common randomness and a fixed deterministic detector, and characterize its performance gap relative to the optimizable case, thereby demonstrating the practical value of optimizable common randomness.

fields
Information Theory
pdf ↗ page arXiv:2611.19305 ↗

We study the sample complexity of the empirical planning or plug-in approach for reinforcement learning (RL) with a generative model. We show the discounted plug-in approach finds an $\varepsilon$-optimal policy with $O(SA (1-γ)^{-3} \varepsilon^{-2} \log(SA/δ))$ samples, where $S, A, γ, δ$ are the state and action sizes, discount factor, and failure probability, respectively. In the average-reward setting, we show that discounted plug-in and direct (undiscounted) plug-in achieve $O(SAH\varepsilon^{-2}\log(SA/δ))$ and $O(SAD\varepsilon^{-2}\log(SA/δ))$ complexities, respectively, where $H$ upper-bounds the optimal bias span and $D$ is the diameter. Combining with our lower bounds for nonadaptive generative models, these results resolve the minimax sample complexity of discounted RL and average-reward RL --- in both the span- and diameter-based classes --- up to constant factors. Our main technical contribution is a novel Bellman residual bracketing technique which improves the efficiency of prior absorbing-MDP-based concentration analyses.

fields
Information Theory, Optimization and Control, Probability
pdf ↗ page arXiv:2611.19566 ↗

We study the boomerang spectrum of the almost perfect nonlinear power function $x^{q+2}$ over $\F_{q^2}$, where $q$ is an odd prime power with $q\equiv1\pmod6$. The connection of Pal and Stănică between boomerang entries and $(-1)$-differential entries reduces the problem to counting roots of a single equation. We determine the complete contribution from nonzero parameters in $\F_q$. For parameters outside $\F_q$, we obtain a quintic over $\F_q$ in terms of the parameter's trace and norm, with a separate formula when the trace is zero. We exclude the entry four when $q\equiv1\pmod{12}$ and characterize its occurrence when $q\equiv7\pmod{12}$ through a repeated-root parametrization and a residual cubic. We also evaluate the first nonsubfield moment and an aggregate quadratic-character sum, and prove a Weil bound for each nonzero trace. Explicit secant and residual-cubic formulas express the second, third, and fourth falling-factorial moments as finite sums. Once the size-four frequency is known, these moments recover all remaining frequencies through a nonsingular five-dimensional system. A closed-form evaluation of the nonsubfield distribution remains open.

fields
Information Theory, Number Theory
pdf ↗ page arXiv:2611.19619 ↗

We give a recursive construction, with closed-form index functions, of perfect and odd perfect periodic autocorrelation sequences over the eight simple unit quaternions $\Qe=\{\pm1,\pm i,\pm j,\pm k\}$ in every length $2^n$. The sequences are built, as in the recursive perfect array construction of Blake, from \emph{twisted periodic extensions}: a short sequence continued with period $M$ up to a right factor $u\in\Qe$. Over roots of unity the twists cannot be regenerated by a one-dimensional recursion, consistently with Mow's conjecture; over $\Qe$ we show that no single sequence of length $M\not\equiv0\pmod 4$ carries a twist $\pm i,\pm j$ or $\pm k$ either, but that \emph{pairs} of sequences whose $i$- and $(-i)$-twisted autocorrelations are complementary do. These $i$-pairs behave exactly like Golay pairs: they double under interleaving with a right factor $j$ in place of a sign, every Golay pair of length $n$ gives an $i$-pair of length $2n$, and they exist in length $6$ where no Golay pair exists. An $i$-pair of length $M$ interleaves to an odd perfect sequence of length $4M$, and a perfect and an odd perfect sequence of length $M$ interleave to a perfect sequence of length $4M$ with the array orthogonality property for the divisor $2$. The $i$-pairs of length $2^t$ are $x^{(t)}_{r,a}=j^{w_t(r,a)}$, where $w_t(r,a)$ counts the changes in the bit string formed by $r$ and the binary digits of $a$, and the odd perfect sequence of length $2^{t+2}$ is $y^{(t)}_{2a+r}=j^{w_t(r,\,a\bmod 2^t)}\, i^{(1-2r)\lfloor a/2^t\rfloor}$. The construction also gives odd perfect sequences over $\Qe$ in every length $24\cdot2^s$ and perfect sequences in every length $6\cdot4^s$.

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

We characterize the exact redundancy of lossy source coding under average and almost-sure distortion constraints. For general source and output alphabets, we establish the asymptotic redundancy coefficients under suitable regularity conditions. Under the average distortion constraint, the coefficient is half of the minimum probability that an output reveals information about the source, among all rate-distortion optimal channels. Under the almost-sure distortion constraint, the coefficient is either $1/2$ or $1$, depending on whether the $D$-tilted information is constant or not. Both converse results follow from a common change-of-measure inequality. Finally, we verify the required conditions under both distortion requirements always hold for finite alphabets.

fields
Information Theory
pdf ↗ page arXiv:2611.19729 ↗

The Gaussian mass of a lattice is the evaluation of its theta series at a real nome and is relevant to lattice coding for the wiretap Gaussian channel. The ratio of the Gaussian mass of stable lattices to the Gaussian mass of the integer lattice was conjectured to be $\le 1$ (Regev et al., 2024). Kominers proved this bound recently for lattices obtained by Construction~A from binary self-dual codes. Building on Kominers' bound, we establish corresponding inequalities on average for Construction~$A_4$ lattices obtained from free self-dual quaternary codes and for Construction~$A_6$ lattices obtained from self-dual senary codes. We also prove the strict Gaussian-mass inequality for extremal unimodular lattices of both Type~II and Type~I. The Type~I result uses the Rains–Sloane definition of extremality. Its proof combines a universal theta truncation with an exact inversion of the shadow coefficients, and a Gaussian inequality for translated lattices. In addition, we obtain an averaging bound over the genus of Type~II lattices, and extend the binary Construction~A inequality to Siegel theta series of arbitrary genus, with further quaternary results under conditions on the residue code.

comments
50 pages
fields
Information Theory, Number Theory
pdf ↗ page arXiv:2611.19749 ↗

We are developing a new approach to the problem of error correction in communication channels, in which the input sequence is transformed in such a way that the interdependence of symbols increases significantly. Then, after the sequence is transmitted over the channel, this property is used for error correction, so that the residual error rate is significantly reduced. A natural example of its application is the transmission of binary sequences whose entropy (per symbol) is less than one, since in this case the length of the transmitted sequence remains constant during encoding and decoding. An algorithm has been developed to implement the maximum likelihood method, in which the encoding and decoding times are linear. This algorithm was used to experimentally investigate its effectiveness on popular channel models, and it was found that there are certain sets of parameters for which the proposed method is quite effective.

fields
Information Theory
pdf ↗ page arXiv:2611.19833 ↗

This paper investigates a sparse rotatable array (SRA)-enabled cell-free multiuser multiple-input multiple-output (MIMO) system. Under a network-wide antenna activation budget, distributed access points (APs) select active antenna elements from their installed arrays and adjust panel orientations, enabling joint control of sparse array apertures and antenna directivity. To avoid frequent hardware reconfiguration in response to instantaneous channel variations, we formulate a two-timescale stochastic optimization problem to maximize the expected minimum-user rate. Long-term antenna activation and panel orientations are optimized based on user spatial distributions and statistical channel state information (CSI), while short-term precoders adapt to instantaneous CSI. Under line-of-sight (LoS) propagation, we derive the optimal single-user antenna allocation, characterize the two-user max-min signal-to-interference-plus-noise ratio (SINR) and establish conditions for discrete activation and panel rotation to attain the continuous-position benchmark, and obtain a closed-form multi-AP zero-forcing (ZF) allocation benchmark under a continuous antenna-count relaxation. For the general mixed-integer nonconvex stochastic problem, we develop an alternating algorithm based on sample-average approximation (SAA), integrating uplink-downlink (UL-DL) duality for short-term precoding, weighted minimum mean-square error (WMMSE) surrogates for panel-orientation optimization, and multi-start greedy search for antenna activation. Numerical results demonstrate that the proposed design outperforms the fixed-array benchmark, improves all-user service reliability with fewer active antennas, and adapts effectively to nonuniform user spatial distributions.

fields
Information Theory
pdf ↗ page arXiv:2611.19959 ↗

In this work, we introduce linearized multiplicity codes, which are a common generalization of linearized Reed–Solomon codes and univariate multiplicity codes. We also introduce the ordered sum-rank metric, which is a common generalization of the sum-rank metric and the Niederreiter-Rosenbloom-Tsfasman (NRT) metric (or ordered Hamming metric). We provide a Singleton bound for the ordered sum-rank metric and show that linearized multiplicity codes attain it. That is, they are maximum ordered sum-rank distance (MOSRD) codes. We introduce the support lattice for the ordered sum-rank metric and study duality, support distributions and weight distributions of MOSRD codes. We also show that MOSRD codes are ordered MDS, dually quasi MSRD and, under some divisibility conditions, MSRD (and thus MDS). For linear MOSRD codes, we give lower bounds on the field extension degree by the number of matrix columns, and upper bounds on the block length by the base field size. We conclude by showing that linearized multiplicity codes attain such bounds exactly in almost all cases, and the same growth order in all cases.

fields
Information Theory
pdf ↗ page arXiv:2611.19996 ↗

We present a Scalable Windowed Axial-attention Neural Receiver (SWAN-Rx) for multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems. The receiver improves reception accuracy and reduces forward-pass computation while supporting frozen-weight reuse across bandwidth allocations and channel conditions. It combines a common resource-element representation of received observations and pilot context with alternating time-axis and local frequency-axis attention. Shared parameters and relative positional information permit soft detection across allocation lengths without inference-time parameter updates. At fixed subcarrier spacing, model configuration, and symbol count, bounded frequency neighborhoods give linear growth of forward-pass computation with bandwidth. Evaluations compatible with the 5G New Radio physical layer reuse weights trained on four physical resource blocks (PRBs) at up to 273 PRBs and on unseen channels. At the training bandwidth, SWAN-Rx achieves lower pre- and post-decoding bit error rates than the implemented three-step neural receiver (NRX) and DeepRx-MIMO baselines, with 16.9% and 39.7% fewer parameters and 56.3% and 35.7% fewer forward-pass operations, respectively. The same weights achieve lower pre-decoding error rates than these baselines throughout the evaluated bandwidth-extrapolation and 16-PRB channel-transfer tests, with an estimated 0.4-0.9 dB signal-to-noise ratio reduction relative to NRX at a pre-decoding error rate of $10^{-2}$ in the 16-PRB tests.

comments
This work has been submitted to IEEE for possible publication
fields
Information Theory
pdf ↗ page arXiv:2611.20058 ↗

The capacity of faster-than-Nyquist (FTN) signaling in additive white Gaussian noise (AWGN) channels has been established and is achieved by Gaussian inputs. However, the capacity of FTN signaling with finite-constellations is not yet fully characterized. The achievable information rate (AIR) provides a lower bound on this constrained capacity by quantifying the rate supported by a specified input distribution and receiver. This paper investigates the AIR of FTN signaling with finite constellations using full-state and reduced-state Bahl-Cocke-Jelinek-Raviv (BCJR) receivers, with bidirectional decision feedback incorporated into the reduced-state receiver. Especially, the detection problem is formulated in a reproducing kernel Hilbert space (RKHS), where a geometric foundation is established to understand FTN under severe time packing. The formulation establishes that the Ungerboeck metric remains valid even when the noise covariance is singular. We further characterize detection errors geometrically using RKHS distances between competing sequences. We also study outage probability for reduced-state detection, which occurs when AIR is zero, in addition to deriving the zero-AIR outage criterion for reduced-state detection. Unlike ISI-free Nyquist signaling, reduced-state FTN detection can retain residual ISI that causes the receiver to assign excessive confidence to incorrect symbols, leading to outage even at high signal-to-noise ratio (SNR). Our results confirm both the spectral efficiency gains and the feasibility of FTN systems employing finite constellations and realistic receiver architectures.

fields
Information Theory
pdf ↗ page arXiv:2611.20243 ↗

We characterize, within a constant number of bits, the minimum achievable rate for several one-shot coding problems, such as channel simulation and lossy source coding. The basis of our work is a new information measure between random variables $X, Y$ that we call the functional information $I_F(X \to Y)$. We show that this quantity characterizes the minimum one-shot rate $R^*(X \to Y)$ of channel simulation, in which a sample $Y \sim P_{Y \mid X}$ is communicated in the presence of common randomness: $I_F(X \to Y) \leq R^*(X \to Y) < I_F(X \to Y) + 1.45$. For the achievability result, we construct an explicit code using the Poisson functional representation. Using these results, we develop new bounds for one-shot variable-rate lossy source coding: given some distortion measure $Δ$, we use $I_F(X \to Y)$ to define the functional rate-distortion function $R_F$. Then, letting $R_O$ denote the one-shot operational rate-distortion function with private encoder randomness and distortion measure $Δ$, we make use of our channel simulation result to show that $R_F(D) \leq R_O(D) < R_F(D) + 2.45$ at every positive distortion level $D$. Finally, we generalize our channel simulation result by introducing the Rényi $α$-functional information $I_{F, α}(X \to Y)$ and show that it characterizes the minimum Arimoto-Rényi conditional entropy for channel simulation, ${R^*_α(X \to Y)}$, associated with the Campbell cost: ${I_{F, α}(X \to Y) \leq R^*_α(X \to Y) \leq I_{F, α}(X \to Y) + O(1/α)}$.

fields
Information Theory
pdf ↗ page arXiv:2611.20279 ↗

This paper investigates weighted sum-rate (WSR) optimization for a simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS)-assisted multi-user multiple-input multiple-output (MIMO) integrated sensing and communication (ISAC) system operating under the energy splitting (ES) protocol. A hybrid propagation model is considered, where the base station (BS)-STAR-RIS channel follows far-field propagation, whereas the STAR-RIS-user channels are modeled using near-field spherical wavefronts. Practical hardware impairments (HWIs), including STAR-RIS phase perturbations and signal-dependent additive distortion at the BS and user equipment (UEs), are incorporated into the system model. Under this framework, the WSR maximization problem is formulated subject to radar beampattern, quality-of-service, transmit-power, and STAR-RIS ES constraints. The resulting problem is highly non-convex due to the coupling among the active beamformers, passive STAR-RIS coefficients, and HWI-dependent signal-to interference-plus-noise ratio expressions. An alternating optimization (AO)-based successive convex approximation framework is developed to iteratively solve the active and passive beamforming subproblems. Numerical results demonstrate stable convergence of the proposed algorithm and consistent WSR improvement over direct-link transmission. Besides, severe HWIs also lead to WSR saturation in the high transmit-power regime, whereas stringent sensing constraints reduce communication throughput. Increasing the STAR-RIS aperture and the number of BS antennas improves the achievable WSR, although the performance gain becomes limited under strong hardware distortion.

fields
Information Theory
pdf ↗ page arXiv:2611.20492 ↗

We extend the recursive construction of perfect and odd perfect sequences over the simple unit quaternions $\Qe=\{\pm1,\pm i,\pm j,\pm k\}$ of Blake to arrays of any dimension. The three operations of that construction act on one direction of an array at a time, and are valid whenever the array is periodic in the remaining directions. Starting from a perfect array $P$ of shape $M_2\times\cdots\times M_d$ they give perfect arrays of shape $2^a\times M_2\times\cdots\times M_d$ for every $a\ge0$, with explicit index functions and with the array orthogonality property for the divisor $2$ in the lifted direction; from $a=5$ on these arrays are, in general, Kronecker products of a sequence with $P$ in neither order. Applied direction by direction, the construction gives perfect arrays over $\Qe$ in every shape $2^{a_1}\times\cdots\times2^{a_d}$, and in every shape $2^{a_1}\times\cdots\times2^{a_{d-1}}\times N$ for which a perfect sequence of length $N$ over $\Qe$ exists. The contrast with the binary alphabet is sharp: a perfect binary array of shape $2^{a_1}\times\cdots\times2^{a_d}$ exists only when $\sum a_k$ is even and $\max a_k\le\frac12\sum a_k+1$, by a theorem of Jedwab and Kraemer on Menon difference sets in abelian $2$-groups, whereas over $\Qe$ there is no constraint on the shape. We also show that, unlike the one-dimensional case, single arrays carrying a non-central twist do exist in two dimensions, and determine where the one-dimensional non-existence argument breaks.

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

Distributed deep neural network (DNN) inference typically follows a model-first paradigm, in which a predefined DNN is partitioned and deployed over a physical network. On irregular communication-computation topologies, however, this approach can create transmission bottlenecks and leave distributed resources underutilized. This paper reverses this perspective and asks: given a physical network, what kind of DNN can it naturally support? To answer this question, we propose a network-native DNN architecture synthesis paradigm in which the physical network topology directly defines inter-node neural dependencies. Neural computation is allocated across nodes under communication, computation, storage, synchronization, and latency constraints. We establish structural properties of the synthesis problem and develop linear programming (LP)-based Architecture Synthesis (LPAS), an efficient topology-guided algorithm that produces a feasible architecture with a computable bound on suboptimality. Experiments on physical networks of different sizes show that LPAS achieves relative gaps below 0.6% to the LP-derived upper bound, with substantially lower runtime than direct mixed-integer LP optimization on larger networks. Under matched network deadlines, the network-native architectures activate more compute nodes and utilize a larger proportion of available model-storage capacity than the model-first baseline. After training, the network-native models achieve higher classification accuracy across all evaluated dataset-precision settings, with the average gain of up to 10.69%. This network-native design paradigm thus turns the physical network from a deployment constraint into an architecture design primitive.

fields
Information Theory
pdf ↗ page arXiv:2611.20824 ↗

This paper introduces a practical framework for semantic communication over wireless channels, focusing on the compression of high-dimensional embeddings under quantization and channel errors. Building upon a relaxed Gaussian Information Bottleneck (GIB) model, the approach provides analytical solutions for task-relevant information preservation, even with non-Gaussian targets. The framework relaxes traditional Gaussian assumptions, enabling effective compression for discrete and complex data such as text embeddings. It derives closed-form gradients for optimizing the compression matrix and establishes bounds linking continuous representations to discrete, noisy system performance. Comprehensive experiments on text classification tasks demonstrate that the proposed method outperforms task-agnostic quantization-based compression methods, maintaining high semantic fidelity at low bit budgets per embedding. The approach offers a scalable, interpretable, and resource-efficient solution for deploying semantic communication in general-purpose networks.

fields
Information Theory
pdf ↗ page arXiv:2611.20863 ↗

Jamming is a major threat to space telemetry downlinks, which operate under severe power and bandwidth constraints. This paper develops a jamming-aware analysis and design framework for protograph-based spatially coupled low-density parity-check (SC-LDPC) codes. For pulsed jamming with jamming state information (JSI) at the receiver, we derive a two-state protograph-based extrinsic information transfer (PEXIT) recursion that tracks the messages originating from clean and jammed symbols separately and merges them at the check nodes through a mutual-information-matched Gaussian approximation. For non-interleaved pulsed jamming, we map each pulse realization, through the serialization of the lifted codeword, to a profile of jammed fractions over the variable-node types, and we prove that, under random lifting, this profile determines the local channel-state statistics. The resulting position-dependent thresholds are the objective of a constrained differential-evolution search over protographs, coupling memories, and edge spreadings. At different code rates, the designed ensembles are compared with the Consultative Committee for Space Data Systems (CCSDS) accumulate, repeat-by-4, and jagged accumulate (AR4JA) LDPC codes whose block length matches the SC-LDPC constraint length, with longer AR4JA codes whose block length is comparable with the size of the sliding window decoder, and with non-optimized SC-LDPC codes. Under pulsed jamming with random pulse positions and with JSI, the ensembles designed over random pulse realizations, decoded through sliding window decoding, reach a bit error rate of $10^{-4}$ at lower signal-to-noise ratios than all the benchmarks.

fields
Information Theory
pdf ↗ page arXiv:2611.20914 ↗

This paper investigates the $(K, L, M, N)$ multi-access coded caching (MACC) system introduced by Hachem et al. The system consists of a server storing $N$ equal-sized files, $K$ cache nodes, each with a storage capacity of $M$ files, and $K$ users, each accessing $L$ consecutive cache nodes in a cyclic wrap-around topology. The server transmits coded information to the users via an error-free capacitated broadcast channel, such that each user obtains its own requested file as a combination of the server transmission and the accessible caches' content. Our objective is to minimize the worst-case transmission load over all possible user demands. First, for the cyclically $L$-separated placement, we derive a new converse bound using the acyclic index coding bound. By carefully counting all valid cache supports, the proposed converse improves upon an existing bound for the same placement. We then develop a linear coded caching scheme based on a novel determinant-based interference alignment strategy, which achieves the new converse bound exactly. Exploiting the determinant structure of a random generating matrix (each of whose columns corresponds to one user), this scheme simultaneously aligns interference across all users into low-dimensional subspaces, while preserving the decodability of their desired packets. Furthermore, by averaging acyclic index coding bounds over cyclic user permutations, we derive a general converse bound applicable to arbitrary uncoded cache placements. By combining the proposed scheme with memory sharing, we demonstrate that the achievable transmission load is within a factor of two of the global bound under uncoded placement. Finally, theoretical and numerical comparisons demonstrate that the proposed scheme generally achieves a strictly lower load than existing schemes.

fields
Information Theory
pdf ↗ page arXiv:2611.21006 ↗

Sum All-Reduce is a fundamental collective communication primitive in which each node holds a local vector and every node must recover the componentwise sum of all vectors. In distributed training, this operation is often implemented over a ring topology using a reduce–multicast scheme. We study sum All-Reduce on directed rings via linear network coding, which includes reduce–multicast as a special case. We give a necessary and sufficient feasibility condition in terms of the coding matrices. For a ring with $N\geq 3$ nodes and unit-capacity links, where each node holds a vector containing $K$ symbols, we prove that the number of time units $T$ required by any feasible linear code satisfies $T\ge\max\bigl\{K+N-2,\ \lceil\frac{2(N-1)}{N}K\rceil\bigr\}$, giving a rate $K/T$ of at most $N/(2(N-1))$. The bound is tight over every field. When $K\ge N$, an interleaved reduce–multicast code achieves the bound; when $K<N$ and $K$ divides $N$, a reduce–partial-multicast code does. When $K<N$ and $K$ does not divide $N$, no coordinate-wise code—in particular, no reduce–multicast code—achieves the bound, while an explicit linear network code does.

fields
Information Theory
pdf ↗ page arXiv:2611.21190 ↗

Transmitting quantized semantic embeddings over a bit-flip channel requires a binary mapping that minimizes expected reconstruction distortion. The classical Binary Switching Algorithm (BSA) ($\mathcal{O}(K^3 \log K)$ for $K$ centroids) yields locally optimal assignments but ignores hierarchical bit significance, making it incompatible with Unequal Error Protection (UEP). We propose Recursive Spectral Graph Partitioning (RSGP), which recursively bisects the centroid affinity graph along the Fiedler eigenvector so that early bits separate semantically distant groups while later bits refine local structure. RSGP runs in $\mathcal{O}(K^3)$ with no iterative outer loop, and is the only method studied to show a systematic positive UEP gain: protecting early bits over later ones improves accuracy for RSGP, while being neutral or harmful for unstructured assignments. Experiments on the Banking77 dataset and the Massive Text Embedding Benchmark (MTEB) confirm that RSGP consistently matches or exceeds BSA accuracy across codebook sizes and error profiles.

fields
Information Theory
pdf ↗ page arXiv:2611.21238 ↗

Insertion-deletion (insdel) codes correct synchronization errors. By the half-Singleton bound, an ${[n,2]}_q$ code has minimum insdel distance at most $2n-4$. The smallest field size of two-dimensional Reed–Solomon (RS) codes attaining this bound is $Θ(n^3)$. Unlike the minimum Hamming distance, the minimum insdel distance of an RS code depends on the ordering of its evaluation points. An evaluation set is called ordering-free if every ordering of its points gives an RS code attaining the half-Singleton bound. In this paper, we first show that for $n\ge6$ every ${[n,2]}_q$ code attaining the half-Singleton bound is an RS code, and hence $q\ge\binom{n}{3}+2$. Secondly, we show that an ordering-free evaluation set with $n\ge6$ points in $\mathbb{F}_q$ satisfies $n<q^{1/3}+2$, and that it has at most $r+1$ points if $q=r^3$ for a prime power $r\ge3$. Finally, by using cross-ratios, we construct an ordering-free evaluation set with $r+1$ points in $\mathbb{F}_{r^3}$ for every prime power $r$. Hence, the bound $r+1$ is attained for $r\ge3$. Moreover, the constructed set is even robust against permutations combined with insdel errors.

comments
16 pages
fields
Information Theory
pdf ↗ page arXiv:2611.21275 ↗

We study $K$-out-of-$N$ oblivious transfer (OT) between a server and a client over a discrete memoryless channel, under an honest-but-curious model. The client must retrieve $K$ out of $N$ messages stored by the server while learning nothing about the remaining $N-K$ messages, and the server must not learn the client's selection. For a binary erasure channel (BEC) with parameter $ε$, we show that the $K$-out-of-$N$ OT capacity is $\min\Big(\frac{Kε}{N-K},1-ε\Big)$. This characterization generalizes the known capacity results for $1$-out-of-$2$ OT and for $1$-out-of-$N$ OT when $ε\ge\tfrac{N-1}{N}$. We also investigate OT reductions, specifically, we show that constructing a $K$-out-of-$N$ OT protocol from repeating $K$ times an optimal $1$-out-of-$N$ OT protocol can be suboptimal, but we also identify certain ranges of $ε$ and $M < N$ for which a $1$-out-of-$N$ OT protocol can be optimally realized via the repetition of a $1$-out-of-$M$ OT protocol. Finally, we discuss extensions of our results to a generalized erasure channel (GEC).

comments
Submitted to IEEE Transactions on Information Theory
fields
Information Theory
pdf ↗ page arXiv:2611.21359 ↗

Classical random regular low-density parity-check codes can have minimum distance growing linearly with block length. We study CSS check matrices formed as full $J\times L$ arrays of arbitrary $P\times P$ permutation matrices, sampled uniformly subject to commutation. For fixed column weight $J\ge3$ and fixed even row weight $L>2J$, we prove that the relative minimum distance converges to zero in probability as $P\to\infty$, with block length $n=LP$. We analyze the weight enumerators that count all nontrivial logical representatives after excluding stabilizers. A coefficientwise lower bound shows that, at every fixed relative weight $0<α<1$ along even-weight sequences, exponentially many such representatives exist with high probability. Their typical and mean counts have exponent lower bound $h_2(α)/2$, where $h_2$ is the binary entropy function. We compare this bound with the classical LDPC and dense CSS mean weight-distribution exponents. The existence, with high probability, of a logical operator below every fixed target weight $δn$ yields the distance conclusion.

comments
17 pages, 1 figure
fields
Information Theory
pdf ↗ page arXiv:2611.21389 ↗

We introduce a new framework for the study and evaluation of the fundamental limits of channel coding, emphasizing genuinely nonasymptotic results. The {\em channel coding sample complexity} $n^*({\cal W},ε)$ of a channel ${\cal W}$ is defined as the smallest blocklength at which it is possible to transmit information through that channel with error probability below $ε$ and at a rate at least as high as that given by an appropriate constraint also in terms of $ε$. This formulation follows analogous developments in statistics, computer science and, more recently, in lossless source coding. For any discrete memoryless channel we derive nonasymptotic bounds on the sample complexity, with explicit constants. These bounds show that the sample complexity is characterized not by the usual channel capacity, but by the channel's Augustin–Csiszár capacity of order $1/2$, which coincides with the cutoff rate as well as with the channel's Sibson capacity of order $1/2$. The proof is partly based on a new channel-coding one-shot converse in terms of hypothesis testing. We also examine extensions of the sample complexity framework to general target rates. Moreover, we derive corresponding results for the sample complexity of the additive white Gaussian noise channel with a quadratic power constraint. Their proof relies on new, explicit upper bounds on the best achievable error probability, which may be of independent interest.

comments
31 pages, 3 figures
fields
Information Theory, Statistics Theory
pdf ↗ page arXiv:2611.21395 ↗

A classifier built from a handful of labeled examples knows where each class sits in feature space but not how it varies, which is why prototype rules and linear probes overfit in the low-data regime. Knowledge Fermentation (KF) recovers this second-order knowledge by letting classes exchange what they know about variation. Residuals around class prototypes act as carriers; the variance of each direction is measured on classes that took no part in estimating it, and directions above the level of the surrounding medium define a structured noise that acts on a linear classifier as a closed-form change of geometry. A convex objective trains the classifier at a noise strength calibrated on the distances between prototypes, and unlabeled examples, when available, join as carriers in repeated rounds. We prove that the held-out variances are unbiased for the directions on which they are measured, that the fermented map never expands a direction, and that damping caused by wrong assignments limits itself. On 14 datasets from vision and language and 8 frozen encoders, with all constants fixed, KF is on par with the best of six tuned inductive baselines. With unlabeled carriers it raises one-shot accuracy from 52.4% to 65.8% on average and attains the highest average accuracy among nine transductive methods, significantly so on vision encoders, while information maximization stays ahead on sentence encoders. Controlled studies attribute the gain to the task-level geometry and show that it grows with the within-class variation that the classes of a task share.

fields
Information Theory
pdf ↗ page arXiv:2611.21477 ↗

Graph signal processing tests how smoothly the decisions of next-generation massive sensor networks with $N$ nodes vary over their neighbour graph. Memory becomes the bottleneck when the neighbour graph arrives only after data erasure, a late-graph setting motivated by dispersed sensor networks and telemetry. We analyse three collection scenarios, reliable rounds, continuous broadcast and ordered capture, and test the Dirichlet energy $\mathcal E_G=\mathbf z^{\mathsf T}\mathbf L\mathbf z/N$ of the fused decision map $\mathbf z\in\{\pm1\}^N$, with late-graph Laplacian $\mathbf L$, against two thresholds. Hidden Matching uses $O(\log N)$ qubits on fused bits, but in reliable rounds and continuous broadcast, where nodes report $b$ sub-bits separately, a classical record buffer before it uses $O(N b)$ bits; classical methods need $Ω(\sqrt N)$ bits in the worst case. The recently introduced Quantum Oracle Sketching builds quantum oracles from random data streams without storing them. We combine coherent loading of separately reported sub-bits, exact in reliable rounds and by Quantum Oracle Sketching in continuous broadcast, with nonlinear fusion and Hidden Matching readout. The register count $R$ does not grow with $N$, and the memory is $O(\log N)$ logical qubits and classical bits, at fixed $b$, graph bounds, thresholds and error targets: an exponential memory advantage over every classical receiver and over Hidden Matching with that buffer. We prove unbiasedness in reliable rounds, preparation bounds in continuous broadcast, classical lower bounds and, for a planner-supplied multi-hop coefficient stream, spectral error bounds. Broadcast simulations match analytic averages at $N=1024$, without resolved bias growth up to $N=2^{20}$. Fault-tolerant hardware, gate rates and, in continuous broadcast, report counts remain open.

comments
19 pages, 8 figures
fields
Information Theory
pdf ↗ page arXiv:2611.21500 ↗

We study a time-slotted generate-at-will status-update system over an erasure channel with transmission success probability $q$, subject to average sampling- and transmission-rate constraints $f_s$ and $f_r$, respectively. The sampler-transmitter pair jointly decides whether to idle, retransmit a stale packet, or replace it with a fresh sample. We derive a universal lower bound on the optimal average age of information, analyze a class of stationary randomized policies, and obtain an optimal policy within this class that provides a $4$-approximation guarantee. The joint problem reduces to the sampling-constrained problem when $f_s\leq qf_r$ and the transmission-constrained problem when $f_s\geq f_r$. For $qf_r<f_s<f_r$, we formulate a constrained Markov decision process (CMDP) and introduce the class $\barΠ$ of $(W,R)$ policies, where $W$ specifies a waiting threshold for transmission and $R$ specifies a packet-replacement threshold. We prove that, for every choice of Lagrange multipliers, the corresponding Lagrangian-relaxed Markov decision process admits an optimal policy in $\barΠ$. We then formulate a linear program (LP) over distributions of $(W,R)$ policies and prove that choosing a policy according to an optimal LP solution yields an optimal CMDP policy. Moreover, there exists an optimal LP solution assigning positive probability to at most three $(W,R)$ policies. Since $\barΠ$ is countably infinite, for every $ε>0$ we construct a finite subset $\barΠ_ε\subset\barΠ$ and show that the LP restricted to this set yields an $ε$-optimal policy. Finally, we derive a stronger pair of lower bounds by considering systems with only the sampling-rate or transmission-rate constraint. Using these bounds, we construct a policy randomizing among four $(W,R)$ policies with a $2$-approximation guarantee for $qf_r<f_s<f_r$.

fields
Information Theory
pdf ↗ page arXiv:2611.21547 ↗

Statistics Theory35

We study diffusion models under the manifold hypothesis with possibly large score estimation and discretization errors, and show that while they may not exactly recover the data distribution, they will exactly recover the support (or data manifold). In continuous time, we use a Lyapunov function to show that even if the relative score estimation error is fixed (and not necessarily vanishing), then the rate at which the process approaches the support is $O(\sqrt{(T-t)|\log(T-t)|})$ as $t \to T$, where $T$ is the final time. In discrete time, we use geometric time steps with a fixed (non-vanishing) ratio and show that with a fixed (also not small) relative score estimation error, the process approaches the data manifold exponentially with the number of iterations. The proof relies on controlling a Gaussian measure of a neighborhood of the cut-locus of the data manifold, using a polynomial approximation argument combined with quantitative semi-algebraic estimates.

comments
57 pages, 1 figure
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2611.18738 ↗

For each standard Borel observation space, we construct a single anytime-valid two-sample procedure that is asymptotically log-optimal for every pair of unknown probability laws and every limiting ratio of diverging sample sizes, including zero and infinity. For independent balanced pairs, the optimal log-wealth rate is $2\JS(P,Q)$, where $\JS$ is the Jensen–Shannon divergence. Unequal sizes yield weighted Jensen–Shannon information and the one-sample limit $\log W(n_1,n_2)/n_2\to\KL(Q\|P)$ when $n_1/n_2\to\infty$. Refining finite partitions and logarithmic-loss learning with measurable characteristic kernels provide universal constructions. Our main contribution is the generality of our construction, and its connections to classical batch efficiency notions. Practical implementations allow continuous classifier fine-tuning, as demonstrated on finite alphabets, Gaussian data, and handwritten digits.

comments
55pgs
fields
Statistics Theory, Information Theory
pdf ↗ page arXiv:2611.19062 ↗

In classical statistics, local asymptotic normality provides a general framework for characterizing optimal testing power and constructing asymptotically efficient procedures. Extending this framework to quantum statistical models introduces additional challenges arising from the noncommutativity of observables and the need to optimize over quantum measurements. In this paper, we develop a theory of asymptotic efficiency for quantum hypothesis testing using quantum local asymptotic normality and the asymptotic representation theorem. We establish sharp nuisance-maximin power bounds for one-sided tests and two-sided tests within the unbiased class by reducing the corresponding classical–quantum Gaussian shift experiments to classical testing problems. This reduction is justified through a quantum Hunt–Stein argument that accommodates both commuting and noncommuting Gaussian coordinates. Under suitable asymptotic invariance conditions, the resulting bounds transfer to the original quantum experiments and are attained by scalar symmetric logarithmic derivative tests. We further develop a two-stage adaptive construction that achieves the same local asymptotic power without knowledge of the reference parameter. As an application, we study testing of smooth spectral functionals of quantum states. We compare scalar symmetric logarithmic derivative tests with the weak Schur sampling plug-in test and with optimally weighted linear statistics of its fluctuations. This comparison distinguishes loss from the plug-in weighting from a gap between the best such spectral statistic and the scalar score procedure. We characterize equality of the corresponding variances and illustrate the two gaps through explicit examples.

comments
82 pages
fields
Statistics Theory, Mathematical Physics
pdf ↗ page arXiv:2611.19141 ↗

We develop Bayesian inference for multivariate $α$-stable distributions with von Mises–Fisher spectral measure, motivated by the hitting distribution of Brownian motion on the unit sphere. Inference proceeds via a LePage-type series representation with latent radial, spectral, and Poisson components; truncation bias is absorbed through a Gaussian error term, yielding a likelihood that is smooth in $α\in(0,2)$ with no special treatment at the Cauchy boundary $α=1$. The stability index $α$, spectral concentration $κ$, mean direction $η$, and spectral mass $Γ_\infty$ are estimated jointly by Markov chain Monte Carlo. At the Gaussian boundary $α\to 2$, the limiting covariance matrix equals twice the second moment matrix of the spectral measure, with explicit parametric form determined by $η$ and $κ$; in particular, the anisotropy of the limiting Gaussian distribution is controlled solely by the spectral concentration $κ$. Simulation across $α\in[0.25, 1.99]$ confirms reliable recovery of all parameters.

fields
Statistics Theory
pdf ↗ page arXiv:2611.19201 ↗

This paper considers estimation and inference for the average dose-response function under right-censored treatment duration and missing outcomes for censored units. Using the duration lower bounds provided by censored records, we construct a novel multiply robust estimator through augmented local estimating equations. Under suitable regularity conditions, the estimator remains consistent when any two of the outcome regression, treatment density, and censoring survival function are consistently estimated. We establish its convergence rate and asymptotic distribution within a cross-fitting framework under appropriate conditions on nuisance estimation. To address local smoothing bias that can distort confidence interval coverage, we further develop a debiased estimator that supports asymptotically valid pointwise inference without undersmoothing. Under additional uniform conditions, we construct simultaneous confidence bands using a Gaussian multiplier bootstrap. Simulation studies evaluate estimation accuracy, the validity of pointwise and uniform inference, and robustness to nuisance model misspecification. A semi-synthetic study calibrated to NHANES illustrates the proposed methods in a setting with a known dose-response function.

fields
Statistics Theory
pdf ↗ page arXiv:2611.19204 ↗

We study the \emph{structural dimension} of a second-order object: the minimum latent dimension that remains necessary relative to a declared class of competing dependence. Building on minimum-rank factor analysis and low-rank-plus-sparse decomposition, we use distances to lower-dimensional classes to describe inference near structural ambiguity. General distance and tangent-cone facts yield confidence statements and local margins. For rank-zero competitors with bounded residual degree, we derive exact maximum-weight $b$-matching formulas, support-slack tangent cones and sparse-spike angles; a shared residual support across a field can produce separation absent pointwise. We give positive-semidefinite brackets, a dimension-free Gaussian likelihood expansion, an exact quotient by the tangent of a low-rank background, and a detection floor from the margin. Equal-angle configurations with different branch multiplicities motivate static and spectral detection conjectures. Joint low-rank/residual profiling and the sharp composite information boundaries remain open.

fields
Statistics Theory
pdf ↗ page arXiv:2611.19322 ↗

Unlike in continuous regression, a small input perturbation in classification can move an input across a decision boundary and flip the predicted label. Decision-boundary geometry is therefore essential to understanding adversarial classification risk. Under anisotropic smoothness and margin conditions, we quantify this geometric contribution and establish sharp minimax rates for adversarial excess risk relative to the ordinary Bayes risk. These rates comprise a statistical term governed by the harmonic mean smoothness and a geometric cost of adversarial perturbations governed by the least smooth direction. As smoothness and the margin exponent vary, the adversarial term exhibits a phase transition from a fractional power of the attack radius to linear scaling, with a logarithmic correction in a critical regime. In addition, we construct an adaptive classifier that attains these rates over a range of smoothness and margin classes. We further characterize the minimax rate for adversarial excess risk under a budget on ordinary excess risk, yielding an explicit trade-off curve. The curve identifies attack regimes where ordinary minimax optimality entails a suboptimal adversarial rate. Finally, numerical experiments support the theoretical findings.

comments
42 pages, 10 figures, 1 table
fields
Statistics Theory
pdf ↗ page arXiv:2611.19347 ↗

We consider Bayesian prediction in independent Gamma scale models with arbitrary known positive shape parameters. When the dimension is at least three, we construct a shrinkage prior toward any prespecified positive scale vector. The resulting predictive density strictly dominates the Jeffreys predictive density under Kullback–Leibler loss and is minimax. The prior is obtained by weighting the Jeffreys prior with a Markov potential. The transition is determined by the beta–gamma decomposition. The domination result is nonasymptotic.

fields
Statistics Theory
pdf ↗ page arXiv:2611.19374 ↗

For the ergodic Cox–Ingersoll–Ross (CIR) diffusion with known diffusion scale and a fixed initial value, we prove local asymptotic normality (LAN) of the exactly sampled experiment for the drift parameters whenever the Feller index exceeds $1$, assuming only a vanishing mesh and a diverging observation horizon. This improves the previously known condition that the index exceed $(11+\sqrt{89})/2$. The proof cuts off the continuous score near $0$, recovers the remainder by exact conditional centering on each sampling interval, and transfers LAN by a conditional-likelihood argument.

comments
17 pages, Manuscript (13pages)+Online Appendix (4 pages)
fields
Statistics Theory
pdf ↗ page arXiv:2611.19479 ↗

We develop a complete asymptotic theory for monitoring data drift in production artificial intelligence (AI) systems whose inputs take values in a finite set of categories. The framework combines two complementary inferential tools. Under the no-drift hypothesis $H_0$, the two-sample likelihood-ratio statistic $G$ of Wilks follows a universal Chi_{r-1}^2 law, independently of the divergence chosen and of the sample sizes; the calibrated Population Stability Index (PSI) of Yurdakul and Naranjo (2021) shares the same Chi_{r-1}^2 limit and is asymptotically equivalent to the $G$-test under $H_0$. Under the drift hypothesis $H_1$, the plug-in phi-divergence is asymptotically normal with a variance computed in closed form for the one-sample, two-sample and symmetrized configurations, yielding standardized $Z$-statistics, detection boundaries, power functions and sample-size planning rules. We supply a per-category decomposition that localizes the drift on specific categories, a Benjamini–Hochberg procedure for monitoring many features simultaneously, and an explicit comparison with the heuristic PSI cut-offs of industrial practice. Two fully worked simulation examples - one one-sample with the Rényi divergence and multiple testing, one two-sample with the Kullback-Leibler (KL) divergence and sample-size planning - illustrate every notion of the paper on realistic production data.

comments
43 pages, 1 figure
fields
Statistics Theory
pdf ↗ page arXiv:2611.19497 ↗

When a discovery depends on analysis choices, a list of selected hypotheses that controls the false discovery rate (FDR) gives little indication of how easily the finding could change: the selected set may be very sensitive to a variety of analyst choices, like the target FDR level, which machine learning algorithms are used in the pipeline, the choice of test statistics, and so on. We propose that scientists should measure and control a new metric called the \emph{stable FDR} (sFDR), and give methods to control it, including simple wrappers around existing FDR analysis pipelines. sFDR is a natural continuous extension of the FDR: we assign each hypothesis an allocation between zero and one, and the sFDR equals the expected fraction of null allocation to total allocation. If one runs multiple analyses of the same data by varying different reasonable choices, allocations can be determined by simply dividing each run's selection indicators by its discovery count, then averaging across analyses and rescaling. The resulting sFDR equals the average of the ordinary FDRs of the runs, even though the runs are dependent: thus sFDR control holds under the same assumptions that the original FDR control held. (In contrast, naively reporting just fractions of times each variable was selected need not control the sFDR.) It is interpretable: hypotheses that were always selected are allocated 1 and those never selected are allocated 0. In leukemia expression and neuroimaging analyses, findings with larger allocations were more often supported in separate samples. We also develop procedures that can assign stable allocations directly from p-values, e-values, or knockoff statistics, resulting in stable-BH, stable e-BH and stable knockoff procedures. A representation by e-values describes which allocation rules control the error rate and gives ways to optimize allocations for different follow-up goals.

comments
61 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.19585 ↗

We study the false discovery rate (FDR) of the Benjamini-Hochberg procedure for $K$ hypotheses at nominal level $q$ under Gaussian dependence of one-sided p-values. We ask whether the global null is least favorable after optimizing over correlation matrices. We show that the global null attains the worst-case FDR for $K\le3$ at every level. In dimension eight, an explicit mixed-null construction has FDR $21q/20$ for $0<q<1/2$. It exceeds the global-null maximum for all sufficiently small $q$, by a uniform extension of the known fixed-matrix small-level Simes bound. For $0<q<1/2$, we identify eight as the first inflation dimension in the monotone rank-one class and prove that $21q/20$ is its exact eight-dimensional maximum. In the same level range, the sharp multiplicative bound over all dimensions in this class is twice the omega constant $w = W(1)$, where $W$ is the Lambert $W$ function. This bound is approached as the dimension increases. We also give scale conditions for stability around the independence benchmark $m_0q/K$, where $m_0$ is the number of true nulls, and obtain a dimension-free upper bound of $q+q^2/2+O(q^3)$ at small levels under the global null with nonpositive correlations.

comments
33 pages, including appendices
fields
Statistics Theory
pdf ↗ page arXiv:2611.19589 ↗

We initiate the study of estimating a discrete distribution with respect to the hockey-stick divergence from independent samples. We provide non-asymptotic upper and lower bounds on the minimax expected loss in terms of the alphabet size, the number of samples, and the divergence parameter. The upper bounds are achieved by add-constant estimators, while the lower bound is derived via a Bayes risk argument. Both upper bounds and lower bounds reveal a transition between polynomial and exponential regimes as the parameters of the problem vary.

fields
Statistics Theory
pdf ↗ page arXiv:2611.19702 ↗

Gaussian approximation provides a foundation for online statistical inference in reinforcement learning. We establish sharp non-asymptotic Gaussian approximation rates in Wasserstein distance for asynchronous Q-learning with Polyak-Ruppert averaging. We prove an upper bound of $\widetilde{O}(n^{-1/4})$, where $n$ is the number of iterations, together with a matching lower bound up to logarithmic factors. Q-learning is more challenging to analyze than linear stochastic approximation due to the nonlinearity of the Bellman operator. Asynchronous updates introduce further challenges due to Markovian noise. Our analysis separates the errors from Bellman nonlinearity, Markovian noise, and the finite-sample covariance discrepancy. In particular, we show that Markovian noise induces an unavoidable bias even when the Bellman operator is linear. The trade-off between this bias and the covariance discrepancy determines the convergence rate. We further extend our analysis to the synchronous setting and establish a sharp rate of $\widetilde{O}(n^{-1/2})$.

fields
Statistics Theory
pdf ↗ page arXiv:2611.19850 ↗

We study the computation of approximate nonparametric maximum likelihood estimators (NPMLEs) for Gaussian location mixtures in arbitrary dimension $d\ge 1$ via the Fisher-Rao gradient flow. We provide a certified algorithm based on an entropic proximal discretization of the flow which, given a sufficiently small $\varepsilon > 0$, returns an absolutely continuous mixing measure $\tildeμ$ admitting an exact finite-dimensional representation and satisfying $\hat L_n-L_n(f_{\tildeμ})\le\varepsilon$. For almost every dataset $X_1,\cdots, X_n \in \mathbb{R}^d$ satisfying $n>2(d+1)(m+1)^2$, where $m$ is the number of support points of the NPMLE, the algorithm requires $O(n\varepsilon^{-1}\log^{d+2}(1/\varepsilon))$ time. En route, we also establish results on the well-posedness and convergence properties of the continuous-time Fisher–Rao flow. In particular, initializing the flow at the uniform probability measure on a ball containing the convex hull of the observations, we show that $\hat L_n-L_n(f_{μ_t})=O(\log t/t)$. We also establish that, for almost every dataset satisfying the same condition on $n$ as above, the set of global maxima of the optimal score is the same as the support of the NPMLE, and the Hessian of the optimal score is nondegenerate at these points, extending a result of (Polyanskiy-Sellke, 2025) to higher dimensions.

fields
Statistics Theory, Optimization and Control
pdf ↗ page arXiv:2611.19882 ↗

We investigate the problem of estimation for a tempered fractional Brownian motion with drift of the form: $X_t=μt + σB_{H,λ}(t)$, for all $t\geq 0$. Based on discrete observations of $X$ and by using the method of moments with the ergodic theorem, we construct estimators of the drift parameter $μ\in\R$ and noise parameters $ σ^2,H,λ\in(0,\infty)$. We establish the asymptotic properties of the proposed estimators, including convergence in probability, almost sure convergence, and asymptotic normality. Finally, by using Gladyshev's results \cite{gladyshev1961new} we provide some consistent alternative estimators of $σ^2$, $H$ and $λ$, when $μ=0$ and $H\in (0,1)$.

fields
Statistics Theory
pdf ↗ page arXiv:2611.20023 ↗

For a bivariate copula $C$ with $(U,V)\sim C$, the conditional distribution functions $L_t=\partial_1C(U,t)$ are random variables with means $t$, so that measures of directed dependence become risk functionals. The absolute Lorenz curves of the variables $L_t$ form the rearranged copula $C^\uparrow$. In this picture Chatterjee's rank correlation $ξ$ is a squared Sobolev seminorm and the rearranged Spearman correlation an $L^1$ norm of $C^\uparrow-Π$, and both arise from one spectral risk measure, applied either to the conditional laws of $V$ or to the laws of $L_t$. The resulting classes $ω_φ$ and $κ_φ$ of spectral dependence measures have mirror-image axiomatic properties. For every spectrum we determine the exact upper bound of $κ_φ$ in terms of $ξ$, and we prove sharp inequalities between $ξ$, $κ_φ$ and the values of $C^\uparrow$, which show how little global measures say about the tails. For plug-in estimators based on the empirical checkerboard copula we obtain consistency, rates and a resolution limit, and a simulation study shows that tail-localised measures separate copulas with identical $ξ$. An application to large credit portfolios illustrates the results.

fields
Statistics Theory
pdf ↗ page arXiv:2611.20028 ↗

Weighted split conformal prediction handles covariate shift by reweighting calibration scores with the likelihood ratio $v=dQ_X/dP_X$; its training-conditional coverage is a functional of the self-normalized weighted empirical distribution function $\hat F_m$, and we study the process $\sqrt m(\hat F_m-F_Q)$. It converges in $\ell^\infty$ to the Gaussian process $W(G(t))-F_Q(t)W(K^2)$, with $G(t)=\mathbb{E}_Q[v\mathbf{1}\{S\le t\}]$ and $K^2=1+χ^2(Q\|P)$, if and only if $χ^2(Q\|P)<\infty$ (for non-degenerate scores); $\sup v$ plays no role. The limit gives the joint law of the coverage across levels, consistent bootstraps, inflations asymptotically exact uniformly in the level, and Berry-Esseen-type rates. With estimated ratios, a uniform expansion remains valid when the estimate uses the calibration covariates; the estimation error enters through a covariance term that can reduce the variance below the oracle's, and a pairs bootstrap reproduces it. When the ratio is known, the weighted conformal threshold is semiparametrically efficient if and only if the ratio and the coverage indicator are uncorrelated under the test distribution, with an explicit efficient correction otherwise. When $χ^2(Q\|P)=\infty$, the ratio has a regularly varying tail of index $p\in(1,2)$ and the score decouples from it in the far tail, the finite-dimensional limits are $p$-stable at the rate $m^{1-1/p}$ up to a slowly varying factor.

fields
Statistics Theory
pdf ↗ page arXiv:2611.20052 ↗

An experiment-level failure replaces the joint observation law while preserving the target. We study honest confidence sets when a declared upper bound on failure probability equals the allowed noncoverage probability. For a Uniform support endpoint and a Gaussian mean on fixed compact parameter intervals, every honest deterministic procedure has full-range worst-case expected diameter under arbitrary or absolutely continuous joint failures. Independent randomisation gives sharp minimax risks of $(2+o(1))\log N/N$ for the endpoint in $[1,2]$ and $(2σ+o(1))(\log N/N)^{1/2}$ for the mean with known variance $σ^2$. A failure distribution shared by many targets forces average clean-state noncoverage to decrease with expected diameter. One-sided local Kullback–Leibler bounds then yield lower bounds with logarithmic factors. The endpoint experiment also has a sharp deterministic frontier as the remaining error budget vanishes. Under exchangeable failures without ties, observation order recovers both randomised benchmark rates deterministically. In a reference-calibrated roster, we derive the randomised minimax reliability rate. A prespecified reference reserve of logarithmic size permits deterministic attainment of the same order on a subclass whose conditionally independent reserved responses have probabilities bounded away from zero and one in every state.

fields
Statistics Theory
pdf ↗ page arXiv:2611.20079 ↗

We study a graphical model (DAG) with time to event as a response variable. We use the Aalen additive hazard model for modelling the effect on the response variable of covariates, combined with a multiple linear regression for earlier layers in a DAG. This enables modelling covariates affecting the event process both directly and indirectly. The indirect component effect is represented by a product $θ_1(t)β_2(t)$, where $θ_1(t)$ describes the effect of the independent covariate on the dependent covariate and $β_2(t)$ is the effect of the dependent covariate on the final time to response variable, in the additive hazard model. We estimate $β_2(t)$ by the order-restricted estimator recently introduced in Anevski and Merai (arXiv:2606.23882v2), thereby enabling disease models with early onset or late onset covariate effects. Combining our previously obtained results with the DAG allows for modelling early onset or late onset covariate effects together with direct and indirect covariate effects, which should be of particular interest for studying causality for complex diseases. We present a nonparametric plug-in estimator of the indirect effect. We derive the limit distribution of the plug-in estimator of the indirect component, and show that it has $n^{1/3}$ pointwise asymptotic rate and a limit distribution which is proportional to the Chernoff distribution.

comments
10 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.20155 ↗

We study the problem of estimating the mean of a random vector in $\mathbb R^d$ under $\ell_p$ norms, assuming only the existence of a covariance matrix. In the Euclidean norm, the sample mean is already optimal in expectation, and robust estimators are usually needed only to obtain high-probability tails. Our results show that this picture changes for $\ell_p$ norms with $p>2$: robustification is already necessary even for the expected risk. We prove that the minimax risk exhibits a sharp phase transition, controlled by the interaction between the sample size $n$, the dimension $d$, and the norm parameter $p$. In the large-sample regime, the classical Gaussian rate remains achievable. In the complementary regime, heavy-tailed distributions create a genuinely non-Gaussian obstruction. Furthermore we show that the simple estimator: coordinate-wise median of means whose number of buckets chosen according to the geometry of the loss, optimally tracks this phase transition in its expected risk minimax. We also show that natural projection-based median-of-means estimators for general norms, despite achieving the optimal confidence trade-off relative to the sample-mean benchmark of Lugosi and Mendelson (Probab. Theory Relat. Fields, 2019), can be polynomially suboptimal for $\ell_p$ norms even in the constant-probability regime.

comments
Accepted at NeurIPS 2026
fields
Statistics Theory
pdf ↗ page arXiv:2611.20176 ↗

We study vector-valued regression with predictors filling a tube around an unknown $m$-dimensional manifold $\mathcal{M}$ in $\mathbb{R}^D$. In the Manifold-Index Model, the mean response is $F=f\circΠ_{\mathcal{M}}$, where $Π_{\mathcal{M}}$ is the nearest-point projection onto $\mathcal{M}$ and $f:\mathcal{M}\to\mathbb{R}^p$ is a possibly non-injective link function. Multiscale ANisotropic lOcal Regression (MANOR) estimates tangent planes by multiscale PCA of predictors with similar responses, then refines them by pooling outer products of local slopes. The neighborhoods narrow tangentially while retaining complete normal fibers. We assume a Lipschitz link differential and bounded response noise. For $p\ge m$, under our geometric and sampling conditions, $n$ independent observations give mean tangent-space error of order $n^{-2/(m+4)}$ and integrated squared prediction error at the $m$-dimensional nonparametric rate $n^{-4/(m+4)}$, up to logarithmic factors. In a scaling regime with fixed intrinsic dimension, model and scale parameters, and ratio of manifold volume to the $m$-th power of its reach, the required sample size grows polynomially in $D+p$, and computation is polynomial in $n$, $D$ and $p$. Numerical experiments on curves with non-monotone links and surfaces with vector-valued responses compare observed convergence rates with the theoretical bounds; a Langevin dynamics example tests prediction of hitting probabilities under an approximate manifold-index model.

comments
89 pages, 17 figures, 8 tables
fields
Statistics Theory
pdf ↗ page arXiv:2611.20275 ↗

In this work, we study high-dimensional transfer learning with unaligned ordinal responses, allowing different domain-specific regression coefficients, cumulative links and thresholds. We develop the sample-split and full-target algorithms that pool source and target likelihoods and then estimate a target correction. Under suitable conditions, our algorithms achieve minimax-optimal rates for parameter estimation and excess risk. Simulations favor the full-target algorithm over the sample-split algorithm for finite-sample estimation and prediction. An application to a medical dataset further demonstrates the predictive gains of our full-target algorithm over the target-only and pooled baselines when transferring information from the five-category source data to binary hospital mortality.

fields
Statistics Theory
pdf ↗ page arXiv:2611.20411 ↗

Decorrelation has two forms. A left transform keeps coefficients and changes noise; a right transform keeps noise and changes coefficients. Cholesky whitening alone keeps noise variables inactive when true ones come first; decorrelation preserving coefficients and noise loses information.

fields
Statistics Theory
pdf ↗ page arXiv:2611.20420 ↗

We establish quantitative mixing-time bounds for Markov chain Monte Carlo algorithms targeting multimodal and heavy-tailed mixtures. The dynamics of a Markov chain are decomposed into local and global levels, and possibly weak Poincaré inequalities at both levels are combined to form convergence bounds. We apply this framework to location and scale mixtures of strongly log-concave distributions, obtaining explicit convergence bounds for random-walk Metropolis, proximal, and random-scan Gibbs samplers. For location mixtures connected along a finite path, the bounds depend polynomially on the number of components and exponentially on neighboring separation, remaining informative as the overall diameter grows. For scale mixtures, we relate the global dynamics of the chain to the isoperimetry of the log-scale mixing distribution, and illustrate the effect of heavy-tailed targets by examining inverse-gamma mixing distributions.

fields
Statistics Theory
pdf ↗ page arXiv:2611.20513 ↗

We propose a sine-based modification of the separating information maximum likelihood (SIML) estimator for integrated volatility and covariance under equidistant sampling with microstructure noise. The estimator allows for nonzero initial observation noise. We establish consistency under moment assumptions and asymptotic normality under first-order Malliavin regularity of the diffusion coefficients. We also construct a feasible noise-bias correction using an estimator of the unknown noise covariance. This correction permits wider spectral bandwidths for consistency and stable asymptotic normality.

comments
34 pages
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2611.20543 ↗

Fréchet regression extends regression analysis to metric space-valued responses such as probability distributions. Its asymptotic theory often relies on local entropy conditions, which control the complexity of small balls in the response space. A commonly used condition requires the associated local entropy integral to remain bounded as the balls shrink, but this requirement can fail when the response space is infinite-dimensional. We determine the exact rate at which this integral diverges in the Wasserstein space of probability distributions supported on a compact interval. Specifically, for a broad class of ball centers, we establish matching upper and lower bounds for the local covering entropy and show that the local entropy integral grows at the rate of the reciprocal square root of the ball radius. This rate persists when the response space is restricted to a large class of continuous distributions. The same rate holds for uniform local entropy integrals, with the supremum taken over ball centers. These results quantify the local complexity of the Wasserstein space and provide sharp benchmarks for entropy assumptions in statistical problems with distribution-valued responses.

comments
9 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.20685 ↗

Simulation studies often estimate several quantities from a single sample, and the best importance sampling density depends on how the errors on these quantities are combined. We characterise the optimal auxiliary density for a general error criterion. We show that it is the nominal density reweighted by a weighted length of the vector of estimated functions, where the weights are set by the error criterion, or by the curvature of the loss when the criterion comes from a loss on the errors. We also provide a lower bound on the best achievable error. The optimal density is explicit for smooth losses, including the usual losses on covariance matrices. We also derive allocation laws for the cells of a histogram and characterise the minimax density for the probabilities of several events. When there is no closed form, we show how to compute the optimal density numerically.

comments
25 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.20831 ↗

Modern data-analysis pipelines increasingly involve searching among candidate analyses before reporting an estimate. We investigate the replicability of the resulting conclusions by studying independent repetitions of the entire search-and-report procedure on new samples. Can the reported estimates become increasingly similar across studies while remaining systematically displaced from the scientific target? We first show that this can happen in a simple Gaussian model. Although every prespecified candidate estimator is unbiased and consistent, searching over exponentially many candidates within each study yields a selected estimator converging to a limit different from the target, a selection-induced pseudotruth. Across independent repetitions, the reported estimates thus become replicable but systematically inaccurate, while the selected candidates differ with probability tending to one. We then study dependent Gaussian candidates, including marginal regression coefficients, and show that Gaussian width governs the displacement, which persists when squared width is of the same order as sample size. Metric entropy and generic chaining reveal that the effective complexity of the search is determined by the geometry of statistically distinguishable analyses rather than by their nominal number. Large-deviation arguments further extend the phenomenon beyond Gaussian models. Numerical agreement between independent studies therefore need not indicate either a stable analytical path or proximity to the scientific target.

fields
Statistics Theory
pdf ↗ page arXiv:2611.21081 ↗

Simulation-based inference (SBI) enables posterior estimation when the likelihood is intractable but data can be simulated from the model. For high-dimensional or variable-length data, SBI methods typically rely on low-dimensional summary statistics as conditioning inputs for posterior estimation, making their sufficiency crucial for accurate inference. Mutual information (MI) provides a natural information-theoretic characterization of sufficiency, quantifying how much parameter information a summary retains. However, these MI quantities are generally intractable in likelihood-free settings. Sui et al. (2026) estimate MI from a trained neural posterior using the Barber–Agakov (BA) lower bound, while discussing, but not computing, a Fisher-information upper bound. This makes the estimate ambiguous: a small lower bound may indicate either an insufficient summary or an inaccurate density estimator. We address this limitation with a tractable diagnostic that estimates the BA gap and reveals what the difference between bounds has actually measured. We extend the resulting sufficiency metric to observation-centered restricted data spaces, allowing simulations to focus on a neighborhood of the data while preserving the target posterior and enabling valid sufficiency comparisons between summaries. We illustrate the use of this diagnostic tool on a temporal epidemic-type aftershock sequence model by comparing learned and hand-crafted summary statistics for variable-length earthquake catalogs.

comments
37 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.21158 ↗

Spectral properties of the sample covariance are key to modern machine learning with high-dimensional data. Random matrix theory (RMT) supplies powerful tools; however, most classical results assume proportional asymptotics, where $d/n$ tends to a finite limit. In functional data analysis and kernel methods, a fixed infinite-dimensional Hilbert space is often the more natural setting for the observations, beyond the scope of proportional asymptotics. This calls for a dimension-free spectral theory for i.i.d. observations $\boldsymbol{x}_1, \dots, \boldsymbol{x}_n$ in a Hilbert space $\mathcal{H}$ with trace-class population covariance $Σ$. Building on the dimension-free ridge regression analysis of Cheng and Montanari (2024), we establish two deterministic equivalents with explicit nonasymptotic error bounds. The first approximates the empirical spectral law $\widehatμ_n$ of the sample Gram matrix by a deterministic law $μ_n$. The second characterizes the conditional prediction risk of analytic spectral filters in linear regression. Previous sharp approximations to prediction risk in this setting have focused on ridge regression and closely-related problems. Our analysis covers a broader class of filters at the bulk scale, with an explicit user-friendly spectral stability condition to check. We apply our theory to power and critical spectral laws, and we recover the proportional regime. For prediction, we study (negative) ridge estimators, iterated ridge, and gradient flow. Mathematically, building on the idea of stochastic interpolation, we construct a deterministic backward path to interpolate the spectral parameter. The resulting bounds on resolvent and mixed-resolvent traces give mesoscopic approximations to the spectral law within the bulk and, by Cauchy's formula, deterministic equivalents for the prediction variance and squared bias of analytic spectral filters.

comments
100 pages, 12 figures
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2611.21254 ↗

We study nonparametric instrumental variable regression when the outcome takes values in a separable Hilbert space $\mathbb{Y}$, for instance a curve, a density or the kernel mean embedding of a distribution. The structural function solves an ill-posed operator equation whose conditional expectation operator need not be injective, and whose solutions need not belong to the hypothesis space. We analyse a two-stage kernel estimator that extends kernel instrumental variable regression to $\mathbb{Y}$-valued outcomes and allows spectral regularisation in both stages, including Landweber iteration and Showalter's method in the second stage. We show that the second stage is a regularisation method in the Hilbert scale generated by the inverse of the kernel integral operator. This viewpoint identifies the solution towards which the estimator converges: the minimum-norm solution in the reproducing kernel Hilbert space in the well-specified case and, in the misspecified case, the unique solution in the range of the continuous extension of the projection operator associated to the well-specified setting. Under source conditions and link conditions expressed through general index functions, we derive non-asymptotic bounds in a scale of interpolation norms that hold with high probability in terms of the first-stage error, with or without identification and in the well- and misspecified settings. For polynomial link conditions, we recover the rate of scalar kernel instrumental regression and extend it to targets outside the hypothesis space; for exponential link conditions, we obtain logarithmic rates in the severely ill-posed regime.

comments
59 pages, 0 figures
fields
Statistics Theory
pdf ↗ page arXiv:2611.21391 ↗

We study how well a sum of $n$ independent random vectors with $p$ coordinates can be approximated by a Gaussian vector with the same mean and covariance. We measure the error over rectangles, so the bounds apply to maxima and simultaneous confidence regions. The coordinates may be arbitrarily dependent, even exactly linearly dependent, and the bounds do not deteriorate as the covariance matrix becomes singular. After standardizing the coordinate variances, bounded or sub-exponential coordinates give the $n^{-1/2}$ sample-size rate up to logarithmic factors, with the size or tail bounds held fixed. The main upper bounds retain the Gaussian expected maximum, improving the rates when the coordinates are strongly dependent. Fourth-moment refinements give further improvements when large observations contribute little to individual coordinate variances. If we instead impose a fixed moment bound of order $q>4$ on the largest absolute coordinate, together with a coordinate fourth-moment bound, the rate becomes $n^{-1/2+1/q}$ up to logarithmic factors. At $q=4$, the slower $n^{-1/4}$ rate is unavoidable, confirming our earlier conjecture. We also allow the bounds on observation size to grow with $n$. Lower-bound examples show that the dependence on sample size, observation size, and Gaussian width is sharp up to logarithmic factors in the regimes studied, and in several regimes the upper and lower bounds match including the logarithmic terms.

code
github.com/VC2015/rectangle-clt-singular ∎ Lean project (lean-kane/lakefile.toml, lean-kane/lean-toolchain) builds, no sorry at 1803366, checked 2026-11-17 build details
comments
107 pages. Supplemental Material (28 pages) and archived Lean verification: https://github.com/VC2015/rectangle-clt-singular
fields
Statistics Theory
pdf ↗ page arXiv:2611.21474 ↗

Weighted conformal p-values generalize conformal inference to cases with covariate shift. One way to use them is to pass them to the Benjamini-Hochberg (BH) procedure, either to decide which test units to select or to detect outliers. But weighted conformal p-values may not be positively dependent, so we want to know: does BH still control the false discovery rate (FDR) in finite samples? Based on experiments, it appears to, but we prove it doesn't. We give two counterexamples, certified in exact rational arithmetic, where the FDR exceeds its target level $q$. We also identify how large the difference between the FDR and $q$ can be. With $n$ calibration points, $m$ test units and weight ratio $B$, the relative excess $\mathrm{FDR}/q-1$ is bounded by a function of $n$, $m$, $B$ and $q$ that is of order $\sqrt{Bm/(nq)}$ when $Bm/(nq)$ is small. The bound holds for every configuration with $B\le n$ and every $n$. This order can be reached when multiple non-null test units share a common threshold: in a Poisson-limit model, that configuration's excess is $c(q)\sqrt{Bm/(nq)}$ to first order as $B/n\to0$ and then $m\to\infty$. For some fixed distributions with this structure, the excess decreases only like $n^{-1/2}$ as $n$ grows. If every test unit is null, the excess is $O(B/n)$ at fixed $m$, and in certain configurations it grows linearly with $m$. To assist practitioners in judging how large the FDR can be, we turn that bound, which depends only on $n$, $m$, $q$ and $B$, into a lowered BH level with proved finite-sample control, and give a much less conservative rule of thumb that covers every worst case we were able to find but provides no guarantee.

comments
55 pages, 3 figures, 1 table. Main text 10 pages; full proofs in the appendices
fields
Statistics Theory
pdf ↗ page arXiv:2611.21509 ↗

Consider an online prediction setting, where at each time, we are given a new feature vector and asked to provide a prediction interval or prediction set that will likely contain the corresponding response. In this setting, if the data points are i.i.d. (or more generally, exchangeable), conformal prediction provides a mechanism for building valid prediction sets around the output of any trained model, offering coverage probability $\geq 1-α$ at each time $t$. In practice, however, issues such as distribution drift, changepoints, or other challenges may cause violations of the i.i.d. assumption. In this adversarial setting, online conformal prediction methods can still offer guarantees on long-run empirical coverage. However, there is a trade-off between these two types of goals: enforcing tight constraints on long-run empirical coverage to protect against the adversarial setting can lead to unstable oscillations in the instantaneous training-conditional coverage in the i.i.d. setting. In this work, we seek best-of-both-worlds algorithms that aim to minimize cumulative error in instantaneous training-conditional coverage when in the i.i.d. setting, while also offering long-run empirical coverage guarantees in the adversarial setting. Specifically, consider a condition that requires long-run empirical coverage to deviate from the target level $1-α$ by at most $\mathcal{O}(T^{-β})$, for some $β\in[0,1]$. We prove that this family of conditions can be described with a phase transition. For $β\in[0,\frac{1}{2}]$, it is possible to construct algorithms satisfying such a constraint in the adversarial setting, while offering the same instantaneous coverage performance as split conformal prediction if the data is in fact i.i.d. On the other hand, for $β\in(\frac{1}{2},1]$, this type of condition comes at a cost, and does not achieve best-of-both-worlds behavior.

fields
Statistics Theory
pdf ↗ page arXiv:2611.21542 ↗

Differential Geometry33

In the level set method, all level sets of a function move by mean curvature. The function is then a solution of a degenerate parabolic equation, the level set equation. Since the beginning of the 1990s it has been known that solutions are Lipschitz and, in general, not $C^2$. We show that, along a level set that is initially a smooth closed surface in ${\mathbf R}^3$, the Hessian of the solution is bounded up to its first singular time. In fact, at each non-generic singularity the Hessian tends to zero, at a rate given by its instability. Using these bounds, we show in the sequel that, surprisingly, at the singular time the solution is twice differentiable and has a backward time derivative at every point of the level set, whatever the singularity, and identify both the Hessian and time derivative.

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

Let $(M,g)$ be a complete, connected, and non-compact four-manifold with nonnegative scalar curvature and nonnegative $Q$-curvature. If $g$ is not Ricci-flat, we show that both the fundamental group $π_1(M)$ and the integral of $Q$-curvature are finite, satisfying $$|π_1(M)|\int_MQ_g dμ_g\leq 8π^2$$ with the equality holding if and only if $(M,g)$ is isometric to $(\mathbb{R}^4, e^{2u}|\mathrm{d}x|^2)$ with vanishing isoperimetric ratio.

comments
44 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.19234 ↗

We consider a domain $Ω\subset\mathbb{R}^d$ divisible by a discrete subgroup $Γ$ of the unimodular affine group $\operatorname{SL}_d(\mathbb{R})\ltimes\mathbb{R}^d$. We prove that $Ω=\mathbb{R}^d$ if $Γ$ is virtually solvable or if its linear holonomy is virtually contained in a semisimple Lie subgroup of real rank one. In particular, we establish the Kleinian Markus conjecture in both cases.

comments
13 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.19331 ↗

This paper investigates the global hyperbolicity of regular sub-Lorentzian manifolds. We establish a criterion for global hyperbolicity on complete Riemannian manifolds, formulated in terms of a smooth time function and an admissible growth function. The proof relies on the theory of differential inclusions. The proposed condition relaxes the classical requirements on the differential of the time function. The effectiveness of the obtained criterion is illustrated on classical nonholonomic structures: the Grushin space, the Heisenberg group, and step-2 Carnot groups, for which we find explicit asymptotic bounds on the expansion rate of causal cones that guarantee the preservation of global hyperbolicity.

fields
Differential Geometry, Optimization and Control
pdf ↗ page arXiv:2611.19336 ↗

Let $X:M^n\to\R^{n+1}$ be an $n$-dimensional complete self-shrinker with constant squared norm $S$ of the second fundamental form. For $n=4$, we prove that if $f_3=\sum_iλ_i^3$ is constant, where $λ_i$ denotes principal curvatures, then $S=0$, or $S=1$ and the image $X(M^n)$ in the rigid cases is one of the hyperplane, the sphere or the standard generalized cylinders. In every dimension, under assumption of sub-exponential growth we prove the same conclusion. Without assumption of sub-exponential growth, we prove if $S\leq 3+1/\sqrt n$, then the same conclusion holds.

fields
Differential Geometry
pdf ↗ page arXiv:2611.19462 ↗

We classify compact complex surfaces admitting either a geometrically Dolbeault formal or an ABC-geometrically formal Hermitian metric. Furthermore, we prove that on a compact Kähler surface, every ABC-geometrically formal metric is Kähler, whereas, for geometrically Dolbeault formal Hermitian metrics, Gauduchon, LCK, and Kähler conditions are equivalent. On non-Kähler surfaces, an ABC-geometrically formal Hermitian metric is LCK and, except on Inoue surfaces, Vaisman.

comments
41 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.19531 ↗

We study splitting phenomena for extremal toric generalized Kähler structures on products of compact toric manifolds. We prove that every extremal symplectic potential splits when the skew-symmetric parameter $B$ is block diagonal, without any restriction on $A$. We also construct two types of non-splitting examples on $\mathbb{CP}^1\times\mathbb{CP}^1$: an explicit constant-generalized-scalar-curvature structure with a splitting potential but a non-product generalized Kähler structure, and a deformation family of constant-generalized-scalar-curvature structures with genuinely non-splitting potentials.

fields
Differential Geometry
pdf ↗ page arXiv:2611.19590 ↗

We prove sharp fill-in inequalities for compact spin initial data sets satisfying the dominant energy condition. The inequalities relate the spacetime mean curvature of the boundary to its hyperspherical radius and stable one-systole. Equality characterizes spacelike graphs of constant boundary height over round Euclidean balls and, in the systolic case after passing to the universal cover, over products of a round disk with Euclidean space. We also prove rigidity under comparison with strictly convex Euclidean domains, using normalized boundary metrics. The proofs use a modified Dirac operator with a chiral boundary condition.

comments
24 pages, comments are welcome!
fields
Differential Geometry, Mathematical Physics
pdf ↗ page arXiv:2611.19617 ↗

Analogous to Perelman's W-entropy defined for Ricci flow, K. Ecker defined a functional W for the mean curvature flow in R^{n+1} and the region it encloses, and made the conjecture that this functional is monotonically increasing in time. In this paper, we give a negative answer to Ecker's conjecture.

fields
Differential Geometry
pdf ↗ page arXiv:2611.19837 ↗

We prove that the geometric limit of a global Calabi flow in a real class of the controlled Kähler cone is independent of the initial metric. Under cohomological K-polystability, the limit is a smooth cscK metric in the original class and complex structure. We also establish varying-class closedness and an equivariant continuity method. We apply this method to construct a smoothly varying family of cscK metrics throughout an explicit interval of symmetric real Kähler classes on the blow-up of the projective plane at four points in general position.

comments
48 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.19934 ↗

We introduce an equation which generalises that of a concircular vector field to sections of the ambient tangent bundle along submanifolds. Totally umbilic hypersurfaces and various overdetermined systems (such as Obata's and Tashiro's equations) are obtained as specific cases. Given an ambient manifold $M$ and a connected submanifold $P$ of dimension at least $2$, the solution space $W(P;M)$ is shown to have dimension at most $\mathrm{dim } M+1$ with all solutions being of `special type' whenever it exceeds $\mathrm{codim } P+1$. This bound is shown to be sharp. When the submanifold $P$ is simply connected we show the maximum dimension is attained exactly when $P$ has constant sectional curvature $κ$ relative to the ambient manifold $M$. In the case of maximum dimension we introduce a bilinear form $\mathbb{I}$ on $W(P;M)$ which is Riemannian, degenerate or Lorentzian, depending on the sign of $κ$ and show $P$ immerses into $(W(P;M),\mathbb{I})$'s unit quadric. Hence our main result shows that whenever $P$ is simply connected, has dimension of at least $2$, and has constant curvature $κ\neq0$ relative to its ambient manifold $M$, there is an isometric immersion (which we construct explicitly) of $P$ with its metric induced from $M$, into the $\mathrm{dim } M$-dimensional space form of curvature $κ$.

comments
16 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.19961 ↗

In this paper, we prove that a group is the fundamental group of a closed, connected, oriented smooth four-manifold admitting a metric of positive biorthogonal curvature if and only if it is finitely presented. This answers a question of Bettiol. The manifold can be chosen to be stably parallelizable, hence spin with vanishing signature, and with Euler characteristic $2(1-p+q)$, where $p$ and $q$ are the numbers of generators and of nontrivial relators in a given finite presentation. Moreover, we show that the class of closed oriented four-manifolds admitting positive biorthogonal curvature is closed under surgery along embedded circles. As applications, we obtain metrics of positive biorthogonal curvature on the boundary of every compact oriented five-manifold that has a handle decomposition with handles of index at most two, which includes every oriented $S^2$-bundle over a closed oriented surface. We also obtain such metrics on $Y\times S^1$ for every closed orientable three-manifold $Y$ of positive scalar curvature and, after connected sum with copies of $S^2\times S^2$, on a large class of four-manifolds with arbitrary fundamental group. Finally, we show that for the fundamental group of a finite aspherical two-dimensional complex $X$ the minimal Euler characteristic of such manifolds equals $2χ(X)$.

fields
Differential Geometry, Geometric Topology
pdf ↗ page arXiv:2611.20037 ↗

A canonical metric $g_{\mathfrak{p}_{\ell}}$ on $S^n \setminus \mathfrak{p}_{\ell}$, where $\mathfrak{p}_{\ell}=(p_1,\ldots,p_{\ell})$ and $n \ge 3$, is a metric conformal to the round metric that is complete, scalar-flat, and asymptotically flat at each puncture $p_i$. For $n=3$ these metrics are the Brill–Lindquist time-symmetric initial data for $\ell$ black holes, and their ends carry ADM masses. In this paper we study the masses, through the mass matrix, as functions on the conformal moduli space $M_{\ell}(S^n)$. The mass matrix $η=(η_{ij})$ is a symmetric matrix with zero diagonal and vanishing row sums (these matrices form the space $H_{\ell}$), and it determines the \emph{normalized ADM mass} at the $i$-th end via $\hat{\mathfrak{m}}_i=\sum_{j\ne i}e^{η_{ij}}$. We prove that the mass map $Ξ\colon M_\ell(S^n)\to H_{\ell}$ is a homeomorphism onto its image. On the other hand, the moduli space $\mathcal{M}_\ell(S^n)$ is homeomorphic to the moduli space of those equilateral $\ell$-gons in the hyperbolic space $\mathbb{H}^{n+1}$ whose sides, extended to infinity, end at distinct points (the Gauss map). By a theorem of Kapovich–Leeb–Millson and Balser, every polystable configuration is the Gauss image of such a polygon, and the Gauss map identifies the space of all equilateral $\ell$-gons with a natural compactification of $M_\ell(S^n)$. In particular, the mass matrix has an explicit description in terms of the pairwise vertex distances of the polygon. The mass matrix diverges as punctures collide. The degeneration, its renormalization, and the resulting compactification of the moduli space are the subject of a sequel to this paper.

comments
22 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.20272 ↗

Let $M$ be a compact homogeneous Riemannian manifold, and let $m$ be its invariant probability measure. At $m$, the Wasserstein entropy Hessian has a sharp lower bound given by $λ_1$, the first positive eigenvalue of the Laplace-Beltrami operator on $M$. We study how this bound changes under perturbations of the density by counting the generalized Hessian eigenvalues below $λ_1$. Using a Schur complement and Peter-Weyl triple products, we reduce this count to the first eigenspace and its interaction with higher modes, including isotropy multiplicities. We apply this method to two important families of homogeneous manifolds. On the unit round sphere $S^d$, $d\geq 2$, we prove that the bound $λ_1=d$ holds only at the uniform density and obtain an exact local index formula for every nonzero smooth mean-zero perturbation $η$. Writing its degree-two component as $x^{\mathsf T}Qx$, the index at $1+\varepsilonη$ is $n_-(\varepsilon Q)+\dim\ker Q$ for sufficiently small nonzero $\varepsilon$. On the normal complete flags $SU(N)/T^{N-1}$, we find a perturbation with complementary indices $N(N-2)^2+2N-1$ and $(N-2)(3N-1)$ under opposite signs, whose proportions tend to one and zero as $N$ grows. A resonant example on $S^1\times S^2$ shows that spherical rigidity does not hold on every homogeneous manifold.

comments
40 pages
fields
Differential Geometry, Probability
pdf ↗ page arXiv:2611.20444 ↗

The global existence of the initial boundary value problem for the Einstein equation in \((2+1)\)-dimension with totally geodesic timelike boundary is proved by a Hamiltonian approach. The initial boundary value problem is formulated within the framework of the ADM formalism, and the ADM reduction is carried out under the constant mean curvature spatial harmonic gauge. Deriving energy estimates for the flows in the reduced phase space shows the global existence.

fields
Differential Geometry
pdf ↗ page arXiv:2611.20532 ↗

We construct a gradient shrinking Ricci soliton on the simply-connected eight-manifold $\mathsf{SU}(3)\times_{\mathsf T^2}\mathbb{CP}^1$. This Riemannian manifold is not Einstein, is nowhere locally Kähler, is locally irreducible, and is invariant under the effective cohomogeneity one action of $\mathsf{PSU}(3)\times S^1$. This new gradient Ricci soliton is found by first constructing an approximate solution, certifying the residual, and applying a fixed-point theorem.

fields
Differential Geometry
pdf ↗ page arXiv:2611.20552 ↗

Motivated by the Gukov–Witten proposal that the endomorphism algebra of a coisotropic A-brane should be described by a deformation quantization of its transverse holomorphic symplectic geometry at the perturbative level, we study deformation quantization on transverse holomorphic symplectic manifolds $(M,Ω)$. Extending the approach of Nest–Tsygan to this setting, we show that, under an admissibility condition, equivalence classes of deformation quantizations are in bijection with \[ \hbar H^2\bigl(\operatorname{F}_1Ω^\bullet(M,\mathbb C),d\bigr) [[\hbar]], \] where $\operatorname{F}_1Ω^\bullet(M,\mathbb C)$ is the differential ideal generated by transverse $(1,0)$-forms. We further illustrate this framework through examples arising from mapping tori, $T$-duality, and coisotropic lifts in cotangent bundles. These examples clarify the roles of admissibility and the transverse Atiyah class, as well as the distinction between deformation quantizations and global star products. Finally, for a coisotropic A-brane $M$ induced from a transverse complex manifold $Q$, we use transverse jets and the Fock representation to construct a perturbative level action $End(M)\curvearrowright Hom(M,Q)$ under suitable compatibility assumptions, providing a geometric realization of the brane quantization philosophy.

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

For complete immersed surfaces in Euclidean four-space whose mean curvature vector has constant length, translators are affine planes parallel to their fixed nonzero velocity, and self-expanders are planes through their centre. This rigidity requires no Lagrangian assumption, properness, volume growth control, or bound on the second fundamental form. Complete Lagrangian translators and self-expanders in $\mathbb{C}^{2}$ with constant Gaussian curvature are flat and, up to unitary equivalence, are properly embedded products of two complete planar curves. Translating factors are lines or grim reapers. Expanding factors are lines through the origin or nonstraight self-expanders. The proofs use moving frames, a transnormal function, a cubic tensor identity, and analytic continuation.

fields
Differential Geometry
pdf ↗ page arXiv:2611.20763 ↗

We develop an algebraic framework for homogeneous metric flows with closed three-form flux on reductive homogeneous spaces. The geometric data are encoded by the complete reductive bracket $μ$ on $\mathfrak g=\mathfrak k\oplus\mathfrak m$, while the flux is treated as an additional invariant datum $H$ satisfying $d_μH=0$. For the metric equation \[ \partial_tg = -2\operatorname{Ric}_g + \frac12\mathcal K_{g,H}, \] we derive the corresponding bracket evolution \[ \dotμ= -π(P_{μ,H})μ, \qquad P_{μ,H} = \operatorname{Ric}_μ^{\sharp} - \frac14\mathcal K_{μ,H}^{\sharp}. \] We apply this formulation to the full flag manifold $\mathrm{SU}(3)/T^2$. For a prescribed closed invariant three-form, we compute explicitly the quadratic flux operator, the induced three-parameter metric system, and the evolution of the transported bracket coefficients. The system has exactly four positive stationary points. They correspond to the normal homogeneous Einstein metric and the three invariant Kähler–Einstein metrics. The normal stationary point has unstable index two, whereas each Kähler–Einstein stationary point has unstable index one. When the flux also evolves by the Hodge heat equation, we derive the closed system for its amplitude and the three metric coefficients. Every isotropic solution becomes extinct in finite time, with $h^2/λ^2\to0$. For a nonzero transverse mode the absolute perturbation is of order $(T-t)^{3/5}$, whereas the perturbation relative to the collapsing scale is of order $(T-t)^{-2/5}$. We relate the invariant three-form to the NS–NS sector of the strict $\mathrm{SU}(3)$-structure ansatz in type IIA supergravity.

fields
Differential Geometry
pdf ↗ page arXiv:2611.20909 ↗

This article concerns a conjecture proposed by Michor and Mumford in their 2005 paper, in which the vanishing of the geodesic distance is associated to the local unboundedness of the sectional curvature. In this article, we consider a Riemannian Banach manifold with all of its curvature tensors locally bounded. We derive several properties regarding the local boundedness of curvature tensors, and give a sufficient condition for a non-degenerate geodesic distance, which partially verifies the conjecture in its converse form.

fields
Differential Geometry
pdf ↗ page arXiv:2611.20941 ↗

We consider the Zermelo navigation problem for a time-dependent Finsler metric, which can be recast as the study of lightlike geodesics of a Lorentz–Finsler metric on a non-relativistic spacetime. To control how such geodesics separate, we introduce a null flag curvature, defined for any pseudo-Finsler metric with a lightlike cone, and show that it governs the Taylor expansion of the norm of a Jacobi field. We then prove a formula relating the null flag curvatures of two anisotropically conformal pseudo-Finsler metrics. Applying it to the spacetime associated with a time-independent Randers metric, which is anisotropically conformal to a stationary spacetime, we obtain compact expressions for the flag curvature of Randers metrics, both in terms of their $(α,β)$ data and of their Zermelo data $(h,W)$. These expressions allow us to compute explicitly the flag curvature when $W$ is conformal, affine or projective, and when $α$ is a Kähler metric. We also introduce a Weyl-type curvature, invariant under anisotropic conformal changes, whose vanishing characterizes Finsler manifolds of scalar flag curvature, and we obtain the flag curvature of $F + \mathrm{d}f$, showing in particular that $F$ has scalar flag curvature if and only if $F + \mathrm{d}f$ does.

comments
57 pages, comments are welcome, YouTube five-minute overview: https://www.youtube.com/watch?v=wAEw75s2wKs
fields
Differential Geometry
pdf ↗ page arXiv:2611.21002 ↗

We prove radial symmetry for every strictly plurisubharmonic function $u$ on the unit ball in $\C^n$, $n\ge2$, that is smooth up to the boundary, vanishes there, and has complex Hessian determinant $μe^{-u}$ for a constant $μ>0$. The known Fubini–Study family therefore exhausts all such solutions. For the corresponding complex Monge–Ampère mean field equation, this establishes the Berman–Berndtsson symmetry conjecture in the smooth class and gives uniqueness throughout the known existence range. The classification also yields the sharp Moser–Trudinger inequality on the ball in Cegrell's finite-energy class.

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

A holomorphic conformal structure is rigid in the presence of rational curves: a complex conformal manifold that is not conformally flat contains no immersed rational null geodesic. So a natural compactification of such a manifold, on which its null geodesics close up, must degenerate along the boundary. We study this phenomenon for the complex conformal manifold that LeBrun attached to a complex contact manifold $Z$ in inverting Salamon's twistor construction: the space $M_{\mathbb{C}}$ of balanced conics of $Z$ transverse to the contact distribution, with its holomorphic Riemannian metric of holonomy contained in $\mathrm{Sp}(n,\mathbb{C})\mathrm{Sp}(1,\mathbb{C})$. Its compactification by the degenerate conics of $Z$ forces the metric to become singular at the boundary. We develop a framework, the singular LeBrun transform, in which these singularities are a source of information rather than an obstacle: the singularities of the metric and of its curvature are read off from the degenerate rational curves of $Z$, locally through the contact neighbourhood of a curve and globally through the incidence variety. As an application, we give an alternative proof of the LeBrun–Salamon conjecture that all positive quaternionic-Kähler manifolds are symmetric, which was recently claimed by OpenAI and by Hu, Liu and Wan. The emphasis of the paper, however, is less on this result than on the framework developed here, which should apply to other problems of the same kind; we conclude with two such directions, negative quaternionic-Kähler manifolds and a singular Merkulov transform for Legendre moduli spaces.

comments
91 pages, 1 figure, Fano, Legendre,VMRT, curvature, quaternionic-Kähler, twistor
fields
Differential Geometry, Algebraic Geometry
pdf ↗ page arXiv:2611.21010 ↗

We study diagonal conic Finsler optical structures with radial coefficients and an arbitrary angular Finsler norm. We obtain the spray curvature block and identify the angular-pole radial-transverse flag curvature at a critical radius with the negative optical-arclength radial Jacobi coefficient. We prove that a compactly supported radial conformal two-jet determines the critical radius and any signed radial coefficient. A navigation Randers sphere yields unequal oriented periods with a common radial coefficient.

fields
Differential Geometry
pdf ↗ page arXiv:2611.21016 ↗

We construct a class of complete gradient shrinking Kähler-Ricci solitons on non-compact toric manifolds by exhausting a family of singular Kähler-Ricci solitons associated to multiple divisors. The construction method will be also extended on non-compact $\mathbf G$-manifolds.

fields
Differential Geometry
pdf ↗ page arXiv:2611.21051 ↗

We show that the branching locus of a $\mathbb Z_2$-harmonic spinor is smooth (resp. real-analytic) near every point of frequency $\frac{1}{2}$ for smooth (resp. real-analytic) ambient defining data. This partially strengthens the previous regularity results obtained by Clifford Taubes and Boyu Zhang.

comments
42 pages, comments welcome
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.21174 ↗

It is well known that Morita equivalent Lie groupoids have isomorphic differentiable cohomology. At the cochain level, however, explicitly transporting a cocycle from one groupoid to a Morita equivalent one is less straightforward. We provide explicit formulas for such cohomological transfers in arbitrary degree. More precisely, for the pullback of a Lie groupoid along a surjective submersion, we construct an explicit cochain-level homotopy inverse to the natural pullback map. We first treat Čech groupoids, where the construction only involves a partition of unity, and then extend it to arbitrary surjective submersions, for which the extra choice of local sections is needed. We also show that the resulting operators preserve the complexes associated with $\mathcal{VB}$-groupoids, including homogeneous and $\mathcal{VB}$-cochains. As an application, we obtain explicit transfer maps for deformation cocycles of Morita equivalent Lie groupoids and recover the Morita invariance of deformation cohomology.

fields
Differential Geometry, Category Theory
pdf ↗ page arXiv:2611.21212 ↗

The conjecture of Bando, Kasue, and Nakajima asserts that every simply connected Ricci-flat $4$-manifold that is asymptotically locally Euclidean (ALE), that is, asymptotic at infinity to a flat cone $\mathbb{R}^4/Γ$, is hyperkähler for one of its orientations. A toric ALE instanton is a Ricci-flat ALE $4$-manifold with an effective isometric action of the $2$-torus; such a manifold is simply connected. We prove the conjecture for the toric ALE instantons whose group at infinity $Γ$ is conjugate in $\mathrm O(4)$ to a subgroup of $\mathrm{SU}(2)$: each of them is a multi-Eguchi–Hanson metric with collinear centres. In particular, the conjecture holds for toric ALE instantons with $|Γ|\in\{1,2,3,4,6\}$. The proof uses a closed formula for toric gravitational instantons, which expresses the metric through Hankel determinants of a positive measure on the fixed points of the torus action. With it, the problem becomes a question about lattice points in a parallelogram determined by the end.

fields
Differential Geometry
pdf ↗ page arXiv:2611.21430 ↗

We prove that the differential of a non-constant conformal curve between Euclidean spaces has full rank outside a discrete set. In particular, conformal curves are real-analytic outside a discrete set. We provide examples of entire associative and coassociative conformal curves with a non-empty singular set. We show that every non-constant Special Lagrangian conformal curve is a real-analytic conformal immersion. We also prove that a non-constant conformal curve has discrete fibers.

comments
31 pages
fields
Differential Geometry, Analysis of PDEs, Complex Variables
pdf ↗ page arXiv:2611.21505 ↗

We study $ \mathrm{U}(1) $-invariant Cayley submanifolds in $ \mathbb{R}^{8} $, under the action with weights $ (e^{i θ_{1}}, e^{i θ_{2}}, e^{-i(θ_{1} + θ_{2})}, 1) $ on coordinates $ (z_{1}, z_{2}, z_{3}, z_{4}) \in \mathbb{C}^{4} $. Locally, we can prove that $ N $ can be written as a graph of functions $ u, v, a_{1}, a_{2}: \mathbb{R}^{2} \rightarrow \mathbb{R} $ (where $ a_{3}= -a_{1}-a_{2} $), where unlike in the special Lagrangian setting, the moment-map parameters are not required to be constant, which gives rise to additional degrees of freedom in the reduced equations. We prove that $ N $ is Cayley if and only if a non-linear, Cauchy-Riemann system of partial differential equations in $ u, v, a_{1}, a_{2} $ holds, with ellipticity away from its degeneracy locus. We investigate the special Lagrangian and coassociative reductions of the system, obtaining potential functions in both cases. For general $ \mathrm{U}(1)^{2} $-invariant Cayley $ 4 $-folds, we derive almost-conservation laws (with clear obstruction terms) involving natural $ S_{3} $-invariant and alternating combinations of the moment-map parameters. These identities exhibit additional source terms, distinguishing the general Cayley system from its special Lagrangian and coassociative reductions.

comments
32 pages
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2611.21522 ↗

We study the mean curvature flow in Riemannian manifolds evolving by the Ricci-Bourguignon flow. Using DeTurck's trick, we establish short-time existence and uniqueness for the mean curvature flow in this time-dependent ambient geometry. In the case where the ambient metric evolves by a self-similar solution to the Ricci-Bourguignon flow, we characterize the associated mean curvature solitons and derive a Huisken monotonicity-type formula adapted to the Ricci-Bourguignon setting. As a consequence, we show that, in compact ambient manifolds, type-I singularities of the mean curvature flow in a gradient shrinking Ricci-Bourguignon soliton background have, after suitable parabolic rescaling, weighted minimal hypersurfaces as their limiting models, while in the noncompact setting, we establish the corresponding result for a gradient shrinking Schouten soliton background. This provides a geometric framework for understanding how the ambient scalar curvature influences the formation and structure of singularity models for the mean curvature flow. We also show how to construct explicit examples of mean curvature flow in a gradient Ricci-Bourguignon soliton background.

comments
29 pages
fields
Differential Geometry, Mathematical Physics, Analysis of PDEs, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.21523 ↗

In this paper, we establish the equivalence between the Kähler–Finsler and Kähler–Berwald conditions for complex Finsler metrics. That is, a Kähler–Finsler metric always satisfies the complex Berwald condition: its Chern–Finsler nonlinear connection reduces to the Chern connection of a Kähler metric. We also provide, for the first time, smooth weakly Kähler–Finsler examples which are not Kähler–Berwald; and propose a condition that is formally stronger than weakly Kähler–Finsler, with equivalence holding in complex dimension two. Then we prove the de Rham decomposition and uniformization theorems for Kähler–Berwald manifolds, and show that every strongly pseudoconvex locally symmetric complex Finsler metric is both Kähler–Berwald and complex Einstein–Finsler. Additionally, we establish several rigidity theorems for the Kobayashi and Carathéodory metrics: $F_K$ is Kähler–Berwald if and only if it is Kähler; if the manifold is simply connected, then $F_C$ is Kähler–Berwald if and only if it is Kähler.

comments
48 pages, no figures. The core results in the Kähler--Berwald setting were first announced at the Young Mathematicians Workshop on Several Complex Variables, Incheon, Republic of Korea, August 2026, when the equivalence between the Kähler--Berwald and Kähler--Finsler conditions had not yet been established
fields
Differential Geometry, Complex Variables
pdf ↗ page arXiv:2611.21573 ↗

A $G_2$-structure $\varphi$ on a $7$-manifold $\mathcal M$ determines a two-dimensional space of invariant totally symmetric cubic forms on each fiber of the rank-$27$ bundle $S^2_0T^*\mathcal M$ of traceless symmetric $2$-tensors. This space is spanned by the trace cubic $C_0$ and a cubic $C_\varphi$ that, up to a constant factor, is the pointwise integrand of the Yukawa coupling on the $G_2$ moduli space. We determine the exact infinitesimal stabilizers over $\mathbb C$ of all nonzero cubics in this family. For $C_0+λC_\varphi$, the stabilizer has dimension $78$ precisely at the two non-real values $λ_\pm=(1\pm i\sqrt7)/8$. Its dimension is $21$ for $C_0$ and $14$ in all other cases. At $λ_\pm$, the stabilizer is simple of type $E_6$, and the corresponding cubic is linearly equivalent to the complex Albert algebra cubic norm. The two cubics at $λ_\pm$, which we call critical, define complex-conjugate $E_6$-reductions of the complexified bundle. At any element with nonzero critical norm, the corresponding cubic determines a complex Albert algebra with basepoint stabilizer $F_4$; a line subbundle of the tangent bundle selects a smooth bundle of these algebras with tensorial operations and a Euclidean real form. The induced Levi-Civita connection preserves either critical cubic exactly when the $G_2$-structure is torsion-free. Its orthogonal projections onto the two exceptional reductions coincide with the connection induced by the minimal $G_2$-connection.

comments
115 pages, 2 figures
fields
Differential Geometry, Rings and Algebras
pdf ↗ page arXiv:2611.21589 ↗

Functional Analysis31

We initiate a systematic study of Nevanlinna-Pick interpolation and function theory for matrix-valued holomorphic functions on the unit disk taking values in the numerical radius unit ball - a class we term as $ν$-Schur functions. In contrast to the operator-norm setting, where commutatnt lifting reduces interpolation to the positivity of a single Pick matrix, we show that a natural one-parameter familty of Pick-type matrices arising from Ando's characterization is necessary but not sufficient for solvability. We overcome this obstruction by establishing two necessary and sufficient solvability criteria. The first is constructive, resting on a factorization of $ν$-Schur function $F=PGQ$ into a classical Schur function $G$ and bounded holomorphic matrix functions $P, Q$ coupled by a boundary condition. This yields an accompanying Choi-Li-type dilation representation. The second is dual and geometric, characterizing solvability via a Nehari-type distance from a cononical model-space interpolant to a subspace determined by the interpolation data. Finally, we introduce $ν$-inner functions - $ν$-Schur functions whose non-tangential boundary values lie almost everywhere in the set of extremal numerical contractions - and prove that every non-extremal problem admits a $ν$-inner solution. As a consequence, we obtain a numerical-radius Caratheodory approximation theorem: $ν$-inner functions are dense in the $ν$-Schur class under the compact-open topology.

comments
36 pages. Comments are wellcome
fields
Functional Analysis
pdf ↗ page arXiv:2611.19189 ↗

In this paper, we introduce and study a generalized notion of multidimensional mixed Bohr radii for holomorphic functions defined on the unit ball of the finite-dimensional Minkowski sequence space with values in complex Banach spaces. We first prove that the multidimensional mixed Bohr radius is positive for every non-null bounded linear operator whose norm is sufficiently small relative to the scaling parameter. We then determine the exact asymptotic behavior of the multidimensional mixed Bohr radius for infinite-dimensional Banach spaces of finite cotype and we obtain analogous bounds for spaces without finite cotype. Finally, for concave Banach lattices and summing operators, we prove lower bounds that involve a logarithmic factor. These results connect classical scalar Bohr phenomena with operator-valued and Banach space valued settings, and highlight how the geometry of the spaces and the mapping properties of the operator influence coefficient estimates and their dependence on dimension. Several examples illustrate the consistency of our results with the classical Bohr radius and the sharp Defant–Frerick asymptotics.

comments
19 pages
fields
Functional Analysis, Complex Variables
pdf ↗ page arXiv:2611.19268 ↗

Fractional Cauchy problems with a Caputo derivative of order bounded by one are solved by Mittag-Leffler operator families that lack the semigroup property but remain bounded for classes of sectorial generators, even with spectrum in the right half-plane. To study their transient growth we introduce the fractional Kreiss constant via the Laplace transform of the propagator family. For a closed generator on a Banach space with a time-scale separation and a finite spectral component, that is, a finite-rank projector commuting with the generator whose complement carries a bounded family, we prove that the projected part of the propagator (typically slow spectral part carrying dynamics that is pertinent at mid and long time-scales) is comparable to a deflated Kreiss constant up to a factor linear in the rank, uniformly in fractional order and independently of the dimension. The analytic core of this result is a Bernstein-type inequality for a class of non-rational functions on vertical lines proved by bounding the turning of the derivative. This is a fundamentally different technique from the classical one used in Kreiss theorem for Markov semigroups based on counting intersections of algebraic curves. Importantly, we show that the rank dependence cannot be removed while keeping the Kreiss constant upper bound. Finally, we show that in Hilbert spaces, generators whose numerical range avoids the sector of instability obey the sharp bound of normal operators, which no spectral-set estimate improves. To conclude, we discuss how subdiffusion driven by a self-excited oscillator, the time-fractional Schrödinger equation, and time-changed Markov dynamics illustrate the theory.

fields
Functional Analysis, Spectral Theory
pdf ↗ page arXiv:2611.19352 ↗

This article constructs a pair of bounded commuting 3-symmetric operators with no Jordan-family extension. The operators are coordinate multipliers on a Sobolev space of functions with values in three dimensional complex Euclidean space with an equivalent Hilbert norm. Their quadratic symbol has no operator polynomial factorization, even with an auxiliary target Hilbert space. The construction transfers the nonfactorability of the matrix quadratic used by Russo to the symbol of a commuting 3-symmetric tuple. The factorization approach of McCullough–Russo and Russo then supplies the obstruction to a Jordan-family extension.

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

We introduce the notion of a strengthening set in a Hilbert space and prove an exponential lower bound for its Kolmogorov widths. For compact sets containing the origin, the strengthening property is equivalent to the existence of such a bound. As an application, we obtain an exact formula for the widths of the global attractor of a diagonal dissipative system.

fields
Functional Analysis, Dynamical Systems
pdf ↗ page arXiv:2611.19378 ↗

We characterize the real Hausdorff locally convex spaces on which every proper lower semicontinuous convex function has a maximal monotone convex subdifferential. Equivalent conditions are given in terms of the portability of closed convex sets and identities involving upper envelopes. Among normed spaces, this property is equivalent to completeness; among Fréchet spaces, it is equivalent to normability. We also prove that the property is preserved under products with finite-dimensional spaces.

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

Let $A$ be an f-algebra and let $V$ be an order ideal of its order dual $A^{\sim}$ that separates the points of $A$. In a comment accompanying a theorem of Huijsmans and de Pagter (J. Funct. Anal. 59 (1984), 41–64), it is stated that the proof of that theorem can easily be adapted to show that the order continuous dual $V_n^{\sim}$ of $V$ is an f-algebra under the Arens multiplication. We show that this statement is false. The Arens multiplication on $V_n^{\sim}$ requires two invariance conditions on $V$, with respect to the module actions of $A$ and of $V_n^{\sim}$, which do not follow from the stated hypotheses and can fail already in the most natural case, where $A$ carries a Riesz norm and $V=A^$ is the norm dual of $A$. We prove that the first condition holds if and only if $A$ is bounded, and that the second holds whenever the Riesz norm is submultiplicative (which forces $A$ to be bounded); in that case $(A^)_n^{\sim}$ is indeed an f-algebra. We then construct a bounded f-algebra of finitely supported real sequences, equipped with a non-submultiplicative Riesz norm, for which the second condition fails, so that the Arens multiplication on $(A^*)_n^{\sim}$ is not even defined. The comment has also been used in the literature to derive a further result, which is false as well. This clarifies the exact scope of the comment.

fields
Functional Analysis
pdf ↗ page arXiv:2611.19647 ↗

Lau's fixed point conjecture is proved for elementary amenable groups. More generally, a weak$^*$-continuous nonexpansive representation of such a group on a nonempty weak$^*$-closed nonexpansive retract of a weak$^*$-compact convex subset $C$ of a dual Banach space has a nonempty common fixed point set that is a nonexpansive retract of $C$. For finite left amenable semigroups, continuity and weak$^*$-closedness of the retract are unnecessary. The argument also leads to a new class of amenable groups with the same retraction property, which contains all elementary amenable groups and may be strictly larger. This class may provide a useful framework for further research on Lau's conjecture. Bruck's theorem is also extended from abelian to elementary amenable group actions on nonexpansive retracts of weakly compact convex sets with the fixed point and conditional fixed point properties, without weak continuity, thus partially answering a longstanding question of Bruck. Several consequences of the theorem are recorded.

fields
Functional Analysis, Group Theory
pdf ↗ page arXiv:2611.19666 ↗

We give a short and elementary proof of a classical fact that an $n$-dimensional real or complex normed space with the absolute projection constant equal to one is linearly isometric to $\ell_\infty^n$. The proof uses only finite-dimensional convexity and linear algebra, with no infinite-dimensional ingredients. The same approach yields a quantitative stability estimate of order $\varepsilon^{\frac{1}{3}}$ when the absolute projection constant is at most $1+\varepsilon$. This improves Zippin's estimate of order $\varepsilon^{\frac{1}{8}}$ in each fixed dimension as $\varepsilon \to 0$. The real and complex cases are treated by the same arguments.

fields
Functional Analysis, Metric Geometry
pdf ↗ page arXiv:2611.19902 ↗

We find the right orders of both the entropy numbers and the Kolmogorov widths of classes of multivariate functions with bounded mixed derivative, when the class is defined by the restriction in the uniform norm and the error of approximation is measured in the uniform norm. The case of functions of two variables was settled about 30 years ago and the case of three or more variables stayed open.

fields
Functional Analysis
pdf ↗ page arXiv:2611.19907 ↗

We characterize all (not necessarily surjective) Schatten $p$-isometries of the Grassmann space of rank $k$ projections on a complex Hilbert space for every $p\in(0,\infty]$. We prove that every such isometry is induced by a linear or conjugate-linear isometry of the underlying Hilbert space $\mathcal H$, with the additional possibility of composition with orthocomplementation when $\dim \mathcal H = 2k > 2$. Our result generalizes Wigner's theorem, which plays a central role in the mathematical foundations of quantum mechanics. It also extends previous results on Schatten $p$-isometries of Grassmann spaces, including characterizations of surjective isometries by Gehér and Šemrl for $p=\infty$ and by Qian et al. for $0<p<\infty$ and that of not necessarily surjective isometries by Gehér for $p=2$.

fields
Functional Analysis
pdf ↗ page arXiv:2611.19919 ↗

We study finite sums of weighted composition operators on the classical Fock space. We show that no cancellation phenomenon occurs when the composition symbols are pairwise distinct: such a sum is bounded, compact, or belongs to the Schatten class S_p, 0<p<\infty, if and only if each summand has the corresponding property. We also obtain two-sided essential norm estimates and quantitative Schatten norm comparisons for fixed distinct nonconstant symbols. As an application, we obtain corresponding boundedness, compactness, and Schatten-class results for finite sums of generalized Volterra-type integral operators.

fields
Functional Analysis
pdf ↗ page arXiv:2611.19948 ↗

We present a unified operator-theoretic treatment of dynamical frames based on defect operators, Stein equations, and the Sz.-Nagy-Foiaş dilation theory of contractions. An explicit realization of the minimal isometric dilation relates generating vectors to the wandering subspace and provides a geometric interpretation of standard frame constructions. For Parseval dynamical frames, polar decomposition yields a complete factorization of the generating families through the adjoint defect operator. General dynamical frames are described in terms of positive solutions of a Stein equation, leading to an equivalent formulation of the frame index. We also collect characteristic-function criteria for strong stability and joint strong stability. In the diagonal case, the characteristic function expresses the classical separation and Carleson conditions in operator-theoretic terms. The emphasis is on explicit constructions, direct proofs, and a common framework for known results.

fields
Functional Analysis
pdf ↗ page arXiv:2611.20029 ↗

In this paper Hilbert's projective metric on the interior of the positive cone of an Archimedean vector lattice with a strong order unit is studied. We show that every surjective isometry between two such projective cones is induced by a lattice isomorphism, possibly composed with the inversion map, and that the inversion occurs precisely when the vector lattice is a bounded inverse closed $f$-algebra. In particular, two such projective cones are isometric if and only if the underlying vector lattices are lattice isomorphic, and we determine the corresponding isometry groups. We apply these results to spaces of Hölder continuous functions, absolutely continuous functions, and continuous functions of bounded variation, for which we describe the surjective isometries explicitly. Finally, we show that the projective cones of these spaces of functions on an interval all have the same metric completion, but that no two of them are isometric.

fields
Functional Analysis
pdf ↗ page arXiv:2611.20046 ↗

How few observations are needed for the stable recovery of the initial state of a linear dynamical system? We study this question for systems governed by a positive operator, with fixed sensors and freely chosen sampling times and positive weights. Our main tool is an interpolation theorem for translates of a nonzero continuous integrable totally positive function. For every uniformly separated sequence of centers, we choose one node near each center so that the corresponding collocation operator is boundedly invertible. The displacement, node separation, and operator bounds depend only on the kernel and the lower separation of the centers; no upper bound is needed on their gaps. If a single integer orbit is a frame, we construct weighted Riesz bases whose sampling counts attain the spectral lower bound up to a bounded additive error. The same method yields bases from continuous functional calculus, including explicit resolvent bases. In the case of normal operators, we give a single-orbit frame for which every admissible weighted design has sampling count growing faster than the radial spectral count.

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

We study higher-order isometric liftings of bounded operators on Hilbert spaces under convexity and concavity assumptions. First, we prove that every $m$-convex operator $T$ satisfying $\sup_{n\geq 1}n^{-(m-1)}\|T^n\|^2<\infty$ admits a minimal $m$-isometric lifting whose complementary diagonal entry is an expansive $(m-1)$-isometric weighted shift. Next, we show that every $m$-concave operator admits a minimal $m$-isometric lifting with an expansive $m$-isometric weighted-shift component, without imposing an additional growth assumption. We also establish an alternation between convexity and concavity under polynomial growth conditions and give examples illustrating limitations of converse implications.

fields
Functional Analysis
pdf ↗ page arXiv:2611.20171 ↗

We introduce the Lipschitz numerical range, radius, and index with respect to a norm-one Lipschitz map, unifying the Lipschitz numerical index of a Banach space and the numerical index with respect to an operator. For real-valued maps, we obtain metric formulas on finite metric spaces and graphs. In particular, a connected simple unweighted graph with at least two vertices is bipartite if and only if its real Lipschitz-free space, or equivalently its dual, has classical numerical index one. We also characterize finite metric spaces by universal numerical-radius attainment. Among complete metric spaces, we characterize length spaces by non-denseness of maps attaining their $g$-Lipschitz numerical radius for every norm-one $g$. Moreover, we derive upper bounds for the $g$-Lipschitz numerical index with $\ell_p$ targets, $1<p<\infty$, and lower bounds for the Lipschitz numerical index of spaces with property $β$. Finally, for norm-one operators $G: X \to Y$ between real Banach spaces, we prove $$ n_{G^*}(Y^*,X^*) \leq n_{L,G}(X,Y) \leq n_G(X,Y), $$ with equality in the upper bound whenever $X$ is separable or $Y$ is $1$-complemented in its bidual. This extends recent equality results for the identity operator to arbitrary norm-one operators and a broader class of target spaces.

comments
48 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.20406 ↗

We study Euclidean perimeter plus Yukawa repulsion with a fixed radial source density and a fixed ordinary volume. For each sufficiently small positive screening parameter, we construct two smooth, positive, strictly increasing densities whose constrained shape Hessians at the unit ball agree for every coupling. Their source masses, Yukawa moments, and ball self-energies also agree. Just above their common first global transition threshold, all minimizers form one rotation orbit of tetrahedral shapes for one density and one orbit of sectoral threefold shapes for the other. Both transitions are continuous, and the minimizing shapes are strictly convex. We obtain the two densities by fixing the boundary data that determine the Hessian and changing the higher derivatives that determine the reduced quartic energy. We compute a positive quartic coefficient, restore the three scalar observables by interior corrections, and add a finite exterior density barrier to control all finite-perimeter competitors.

fields
Functional Analysis
pdf ↗ page arXiv:2611.20471 ↗

We prove that among the Hardy spaces $\mathcal{H}^p$ of Dirichlet series with $1\le p<\infty$, only $\mathcal{H}^2$ has local unconditional structure. Consequently, $\mathcal{H}^p$ admits an unconditional basis exactly when $p=2$. At the endpoint $p=1$, we also construct a Schauder basis of Dirichlet polynomials and give an explicit formula for each basis vector. Together, these results answer the basis questions posed by Aleman, Olsen and Saksman, as well as the question of Saksman and Seip concerning an unconditional basis for $\mathcal{H}^1$.

comments
43 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.20559 ↗

We conjugate composition operators on the Zygmund and little Zygmund spaces of an infinite, locally finite rooted tree $T$ by the second-difference isometries. A path Green kernel gives row-finite matrices that characterize boundedness and yield exact operator norms. A rigidity result holds on the chain $\mathbb{N}_0$. Boundedness on $\mathcal{Z}_0(\mathbb{N}_0)$ is equivalent to $\varphi(n)=qn+b$ for all sufficiently large $n$, with $q\in\mathbb{N}_0$ and $b\in\mathbb{Z}$. For these symbols, $\varphi(n)>n$ eventually characterizes Li-Yorke chaos of $C_\varphi$ on either Zygmund space, allowing noninjectivity and periodic vertices. If $C_\varphi$ is bounded on $\mathcal{Z}_0(T)$ and $\varphi^k(T)$ eventually avoids every finite set, then for each $λ\ne0$, $λC_\varphi$ is Li-Yorke chaotic on either space exactly when the norms of its powers are unbounded. For $\varphi_q(n)=q(n+1)-1$ with integer $q\ge2$, the corresponding conditions are $|λ|q^2>1$ on both Zygmund spaces and $|λ|q>1$ on the little Lipschitz space. For bounded $C_\varphi$ on $\mathcal{Z}_0(\mathbb{N}_0)$, topological mixing and Devaney chaos each hold exactly for injective symbols with no periodic vertices and eventual slope $q\ge2$. For such bounded operators with strictly increasing $\varphi$ and $\varphi(0)>0$, $q\ge2$ also characterizes hypercyclicity and frequent hypercyclicity.

comments
19 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.20744 ↗

Let $M$ be a real expanding $d\times d$ matrix and let $\mathscr D=\{d_0,\ldots,d_{N-1}\}\subset\R^d$ consist of $N\ge2$ distinct vectors. We study the existence of frame measures for the self-affine probability measure $μ$ generated by the maps $S_i(x)=M^{-1}(x+d_i)$ with equal weights $1/N$. Extending the entropy obstruction for self-similar measures with a common scalar contraction, we prove that $μ$ admits no frame measure if the conditional entropy of the first symbol given the spatial point is positive. In particular, this holds whenever $N>|\det M|$, without assuming absolute continuity or imposing arithmetic conditions. When $M$ has integer entries, $\mathscr D\subset\Z^d$, and $N=|\det M|$, the measure $μ$ admits a frame measure if and only if $μ$ is normalized Lebesgue measure on its attractor.

fields
Functional Analysis
pdf ↗ page arXiv:2611.20880 ↗

We prove that if \(X\) is a Banach space for which Bourgain's vector-valued Stein inequality holds, then \(X\) is superreflexive. We also present an example of a superreflexive Banach space for which the vector-valued Stein property fails.

comments
17 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.21025 ↗

In this paper, we investigate surjective maps $Φ:\mathscr B(H)\to\mathscr B(H)$ preserving various operator quantities associated with products of differences, namely, $$α\big((Φ(A)-Φ(B))Φ(C)\big) =α\big((A-B)C\big) \quad \text{for all}~ A,B,C\in\mathscr B(H),$$ where $α$ denotes one of the following: the numerical radius, maximal numerical range, minimum modulus, surjectivity modulus, reduced minimum modulus, or spectral radius. Under suitable assumptions, we establish structural characterizations of these maps and determine their possible forms.

fields
Functional Analysis
pdf ↗ page arXiv:2611.21135 ↗

Let $\mathscr{E}=\{E_α\}_{α\in I}$ be an increasing family of Borel subsets of a locally compact topological group $G$, indexed by a linearly ordered set $I$ with no greatest element. We call a nonnegative finitely additive $σ$-finite measure on the Borel $σ$-algebra of $G$ admissible if it takes finite values on the sets in $\mathscr{E}$ and these values are not bounded above. Every admissible measure $μ$ can be normalized to have total mass one by applying a generalized limit pointwise to the net of measures $\left\{B\mapsto\frac{μ(B\cap E_α)}{μ(E_α)}\right\}_{α\in I}$, defined for all sufficiently large $α$. We study invariant finitely additive measures obtained by normalizing admissible measures. We show that every invariant measure constructed in this way can be obtained by normalizing a measure of a special form. An example is given showing that not every measure of the type under consideration can be obtained by normalizing a countably additive measure. We obtain a generalization of the Yosida-Hewitt decomposition to finitely additive $σ$-finite measures.

comments
13 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.21199 ↗

We develop a scale-explicit analytic framework for operator-theoretic problems on the Paley–Wiener spaces $B_σ^p$, $σ>0$, throughout the full range $0<p\leq\infty$. Using localized Paley–Wiener packets, we obtain sharp-order point-evaluation estimates, quantitative separation of distinct point-evaluation functionals, sampling estimates, and Carleson measure characterizations. As a principal application, we develop a comprehensive theory of weighted composition operators $W_{ψ,\varphi}:B_σ^p\to B_τ^q$, $0<p,q\leq\infty$, $σ,τ>0$. Boundedness forces every nonconstant symbol to be affine with real slope. A sharp dichotomy appears: when $p\leq q$, the weight is governed by the residual bandwidth $τ-σ|a|$; when $q<p$, the weight must also supply the missing integrability, with exponent $pq/(p-q)$, and boundedness coincides with compactness. We also obtain compactness criteria and essential-norm estimates, characterize differences of weighted composition operators via a no-cancellation principle for distinct symbols, and determine the connected and path-connected components of the corresponding operator spaces.

comments
74 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.21261 ↗

In this note, we consider a weighted shift operator of weight sequence which is a finite perturbation of a 2-periodic weighted shift. We characterise the equality of the closure of its numerical range and its essential numerical range. We end up with some applications and comments.

fields
Functional Analysis
pdf ↗ page arXiv:2611.21280 ↗

OpenAI recently presented a remarkable solution to the longstanding separable quotient problem in Banach space theory. The result establishes its independence from ZFC, relative to the consistency of ZFC with a measurable cardinal. Under the continuum hypothesis, the paper constructs a nonseparable Banach space $X$ with no separable infinite-dimensional quotient. The present paper offers an alternative exposition of the mechanism leading to $X$ and its properties. Our aim is to make the methods and results more accessible and to offer a clearer understanding of this exotic space.

comments
44 pages 1figure
fields
Functional Analysis
pdf ↗ page arXiv:2611.21328 ↗

Let G be an infinite compact abelian group and let K={0,a_1,a_2,...}, where a_1>a_2>...>0 and a_n\to 0. We construct a nonzero real, even, purely singular Rajchman measure whose Fourier–Stieltjes range is contained in K. We then classify the compact abelian groups on which every positive null palette is exactly realizable in each of four classes: purely singular measures, atomless purely singular measures, strongly continuous purely singular measures, and Rajchman purely singular measures. Exact realization by a purely singular measure is always possible; atomless exact realization fails precisely for groups topologically isomorphic to \mathbb{T}\times F with F finite; and universal exact Rajchman realization is equivalent to \operatorname{Tor}(\widehat G) being infinite, or equivalently to G/G_0 being infinite. On \mathbb{T} we also give palette-dependent sufficient conditions for exact Rajchman realization. Finally, if U\subset\mathbb{C} is open and 0\in\overline U, we construct a continuous Rajchman measure with nonzero singular part whose Fourier–Stieltjes range is contained in U, assuming metrizability of G when 0\notin U. This gives a negative answer to an open-range absolute-continuity question of Ohrysko and Wojciechowski.

comments
40 pages, no figures
fields
Functional Analysis, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.21340 ↗

We determine the sharp universal constants in positive-input $L_p$-regularity for finite-dimensional quantum Markov semigroups with a faithful invariant state. For $1<p<\infty$, they are $p\sin(π/p)/(2(p-1))$ under KMS symmetry and $\frac{p}{2(p-1)}\tan(\fracπ{2}\min\{1/p,1-1/p\})$ without a symmetry assumption, with the endpoint values at $p=1$ given by $π/2$ and $π/4$, respectively.

comments
19 pages; comments are welcome
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2611.21411 ↗

We construct a compact operator $T$ with trace class self-commutator and vanishing Helton-Howe measure such that $T\oplus S-M\notin \mathcal{S}_2$ for every bounded operator $S$ and every bounded normal operator $M$. This gives counterexamples to Voiculescu's normal dilation and stable classification conjectures. The construction uses magnetic shifts on finite square tori. Their real parts have commutators of uniformly bounded trace norm, while their frame errors admit logarithmic lower bounds in the lattice size. A summability criterion for frame error turns these finite-dimensional estimates into a compact counterexample. The same operator inequalities yield a rank profile invariant under Hilbert-Schmidt perturbations and normal stabilization, which distinguishes the example from zero.

comments
23 pages
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2611.21495 ↗

We investigate the Fourier algebra of a certain class of groupoids, called the HLS groupoids, within Paterson's continuous framework for locally compact groupoids. We develop the basic harmonic analysis of HLS groupoids by obtaining concrete descriptions of their topology, representations, and Fourier algebra. We then study the restriction maps from the Fourier algebra $A(\mathcal{G})$ of an HLS groupoid $\mathcal{G}$ to the Fourier algebras of its isotropy subgroups, and construct explicit norm-preserving lifts for these restriction maps. As applications, we describe the norm of every element of $A(\mathcal{G})$ in terms of the norms of its restrictions to the isotropy subgroups. We prove an analogue of Leptin's theorem characterizing when $A(\mathcal{G})$ has a bounded approximate identity. We also show that the Gelfand spectrum of $A(\mathcal{G})$ is homeomorphic to $\mathcal{G}$. Finally, using abstract arguments that, unlike our methods for HLS groupoids, do not yield explicit constructions, we show that norm-preserving lifts exist and that the Gelfand spectrum of the Fourier algebra is homeomorphic to the groupoid for every étale groupoid. This generalizes Eymard's theorem and answers a question of Paterson for étale groupoids.

fields
Functional Analysis
pdf ↗ page arXiv:2611.21572 ↗

Classical Analysis and ODEs20

We study a scale of strengthened fractional Hörmander conditions, indexed by $δ\ge0$ and adapted to the Hardy spaces $H^p$, $0<p<1$, which was recently considered by Han and Wu [Y.~Han, H.~Wu, \emph{The weighted $H^p$ estimates for commutators of fractional integrals}, Potential Anal. \textbf{59} (2023), 1827–1850] for fractional integrals with a single kernel. We show that these conditions form a strictly decreasing scale in $δ$, and we compute the exact range of $δ$ for a natural family of homogeneous kernels. We then apply them to the integral operators \[ T_αf(x)=\int_{\RR^{n}}k_1(x-A_1y)\cdots k_m(x-A_my)\, f(y)\,dy, \] where $A_1,\dots,A_m$ are invertible matrices and $\frac n{q_1}+\dots+\frac n{q_m}=n-α$, $0<α<n$. Assuming that each kernel $k_i$ satisfies an $L^{p_i}$ size condition of order $n-n/q_i$ and the Hörmander condition of order $δ=n(\frac1p-1)$, we obtain, for $\max\{\frac n{n+1},\frac n{n+α}\}<p<1$ and $1/q=1/p-α/n$, the $H^{p}_{w^p}(\RR^{n})-L^{q}_{w^q}(\RR^{n})$ boundedness of $T_α$ for weights $w$ such that $w^{a}\in\mathcal A_1$, where $\frac1a=\frac1q-\sum_i\frac1{p_i}$, and $w(A_ix)\le c\,w(x)$ a.e. For a single kernel, this relaxes the smoothness and weight conditions of a recent result of Han and Wu. No homogeneity is assumed on the kernels; the case $k_i(x)=Ω_i(x)|x|^{-n/q_i}$ with $Ω_i$ homogeneous of degree zero is included. Finally, we show that the strengthened condition cannot be replaced by the classical fractional Hörmander condition.

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

We develop a Calderón–Zygmund theory without the doubling property, a metric or a martingale structure. Our measure spaces carry an exhausting family of admissible sets with recursive child partitions. A stopping-time construction gives a decomposition of an integrable function, with a bounded good part and bad terms that cancel on the parents of the stopping sets. We introduce the corresponding atomic Hardy and BMO spaces, establish their duality and interpolation properties, and prove weak-type $(1,1)$ and Hardy-space bounds for singular integral operators under a Hörmander condition and a size estimate between each stopping set and its parent. We apply this framework to arbitrary flow trees, whose associated flow measures need not be either locally or globally doubling. As a result, we obtain endpoint bounds for Riesz transforms and spectral multipliers satisfying a scale-invariant Sobolev condition of order greater than $3/2$ in this setting.

fields
Classical Analysis and ODEs, Functional Analysis, Probability
pdf ↗ page arXiv:2611.18991 ↗

Recently, for a given Riemannian manifold with certain curvature constraints, S. Kajántó and A. Kristály [KK24] formulated a variational problem (on either positively or negatively curved Riemannian model spaces) and computed the eigenvalues and eigenfunctions in terms of the radii, curvature and weight. Moreover, they conjectured that a saturation phenomenon exists also in the case of positively or negatively curved Riemannian model spaces (not only in the Euclidean case), and this is based entirely on the incompatibility of a system of nonlinear equations involving special functions, like Ferrers functions of the first kind and conical functions of the first kind. In this paper, we provide a partial solution for both positive and negative curvature case.

comments
15 pages, 1 figure
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.19185 ↗

We prove that the discrete Bilinear Hilbert Transform along the primes, \begin{align} \mathcal{H}_{\mathbb{P}}(f,g)(x) := \sum_{n \neq 0} \frac{Λ(|n|)}{n} f(x-n) g(x+n), \qquad Λ(n) := \begin{cases} \log p & \text{ if } n = p^k, \ k \geq 1 \\ 0 & \text{ otherwise} \end{cases} \end{align} extends to a bounded operator from $\ell^p \times \ell^q \to \ell^r$ whenever $p,q \in (1,\infty)$ and $\frac{1}{r}=\frac{1}{p}+\frac{1}{q}$ in the Banach range, $r \geq 1$, and a particular portion of the quasi-Banach range $r \in \left(\frac{2}{3},1\right)$; in the diagonal case, this extends up to the endpoint $(\frac{5}{3},\frac{5}{3},\frac{5}{6})$. After $U^3$-based reductions, the philosophy of the proof becomes similar to that of Krause-Mirek-Tao (on different bilinear operators in discrete harmonic analysis), namely a ``splitting" of the problem into an arithmetic component, handled by analysis within cyclic subgroups, and an analytic component, handled by analysis along arithmetic progressions. For the arithmetic component, we draw upon previous work of most of the authors on Carleson operators along the primes; the main analytic input are estimates for UMD space-valued bilinear singular integrals with modulation invariance, due to Di Plinio-Li-Martikainen-Vuorinen.

code
github.com/anastasiosfragkosmath/Prime_BHT_Palomar_Submission ∎ Lean project (lakefile.toml, lean-toolchain) builds with 1 sorry warning at 37e79d9, checked 2026-11-17 build details
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.19335 ↗

We prove the weak-type estimate at the end-point $\big(1,1,\frac{1}{2}\big)$ for the bilinear Bochner–Riesz mean at the critical index $α_c=n-\frac{1}{2}$ in all dimensions $n\geq 1$. Our proof is motivated by Christ's method for the linear Bochner–Riesz operator at the critical index. We develop a bilinear analogue of the $TT^*$ method to address the end-point boundedness of the bilinear Bochner–Riesz operator. This approach provides a useful tool in addressing the end-point issues for bilinear operators.

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

Let $k\in\mathbb N$, $X$ be a ball Banach function space, and $W^{k,X}$ denote the corresponding ball Banach Sobolev space. In this article, we solve six questions in [Math. Z. 311 (2025)]. Specifically, we first prove that the constants in its VMO-type characterization of $W^{k,X}$ are sharp uniformly over all ball Banach function spaces satisfying suitable assumptions. Next, we show that the BBM-type formula and the BSVY-type formula involving minimizing polynomials or ball averages fail in general. In contrast, we establish higher-order BBM-type formulas involving Taylor polynomials and further obtain a Taylor-type characterization of $W^{k,X}$ under suitable assumptions. Moreover, we construct counterexamples to show that the characterization of $W^{k,X}$ via higher-order minimizing polynomials fails in general. Finally, we provide a necessary and sufficient condition for special John–Nirenberg–Campanato spaces defined via congruent cubes to be independent of their integrability exponent $q$.

comments
38 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.19376 ↗

We study maximal averages over the surfaces parametrized by $c+Φ$ in $\mathbb{R}^3$, where $c$ is a constant and $Φ$ is mixed homogeneous and real analytic away from the origin. Under the assumption that the Hessian determinant of $Φ$ vanishes identically, we classify the possible graphing functions for all positive weights. For surfaces in each resulting class, we establish sharp $L^{p}$-estimates for the corresponding maximal averages.

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

Let $f,g\in C^{2}\left( a,b\right) .$ In this paper we investigate properties of the function% \[ v_{g}\left( f\right) \left( x\right) =-\frac{f^{2}\left( x\right) }{g\left( x\right) }\frac{d}{dx}\frac{g\left( x\right) f^{\prime}\left( x\right) }{f\left( x\right) }% \] where $f:\left( a,b\right) \rightarrow\mathbb{R}$ is a solution of the second order differential equation $f^{\prime\prime}+pf^{\prime}+qf=0.$ Criteria for the monotonicity of $v_{g}\left( f\right) $ are given which depend on the coefficients $p$ and $q$. It is shown that for classical orthogonal polynomials $p_{n}\left( x\right) $ the Turán inequalities are equivalent to the non-negativity of the functions $v_{g}\left( p_{n}\right) $ for a suitable function $g.$ This allows new and simple proofs of classical and recent Turán inequalities.

comments
26 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.19637 ↗

We study how the regularity of a continuous function controls the Fourier ratio of its sampled values, and how errors in sensor placement affect recovery from incomplete measurements. For a periodic function on the square sampled on an $N$ by $N$ grid, we show that Hölder regularity $C^{0,γ}$ with $0<γ<1$ leads to a bound of order $N^{1-γ}$, that Lipschitz regularity leads to the critical bound $\sqrt{1+\log N}$, and that fractional Sobolev regularity $W^{s,p}$ with $0<s<1$ and $sp>2$ leads to a bound of order $N^{1-s}$, where both polynomial exponents are sharp. A common translation of the grid removes the hypothesis on the sampled mass needed on a fixed grid and yields an estimate in terms of the $L^2$ norm of the gradient, and with two derivatives the bound is independent of the grid size. We extend the energy argument behind these results to compact Riemannian manifolds and prove that the critical square-root logarithm is necessary on every compact surface. Finally, we treat separate sensor displacements as measurement error and combine the analytic bounds with random sampling to obtain stable recovery of the sampled vector on the square and of bandlimited functions on compact manifolds, where the number of samples depends on the suprema of the chosen eigenfunctions.

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

We study the Fourier Ratio for spectral expansions of nonnegative self-adjoint operators. Weighted Cauchy–Schwarz estimates turn eigenvalue counting bounds into Fourier Ratio bounds for spectrally regular functions. On a compact measured resistance space, Kasue's identity expresses the reciprocal eigenvalue sum as one half of the average resistance distance. We use this identity to obtain a sharp coefficient estimate for every finite-energy function, with no spectral cutoff. Bounded orthonormal system recovery theorems then yield reconstruction estimates whose sample counts depend on both the Fourier Ratio and the pointwise size of the chosen eigenfunctions. We distinguish these estimates from the weaker diameter-only bounds and give an interval example with a sample count logarithmic in the dimension of the spectral subspace for fixed accuracy and energy ratio. Resistance also controls errors caused by displaced sensors. We apply the estimates to standard self-similar fractals and finite electrical networks, where the geometric constant becomes the normalized square root of the Kirchhoff index. A separate observation describes Fourier Ratios of coefficient families with a limiting distribution.

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

In this paper, we study the Erdős similarity problem by replacing affine copies with images of polynomial maps or analytic maps. This is inspired by a connection between a partial converse of Szemerédi's theorem and the Erdős similarity problem and its variants, as well as a version of polynomial Szemerédi's theorem by Bergelson and Leibman. In particular, we strengthen several known results in the literature. We show that a large class of sequence are not polynomially universal in this sense. First, for sequences satisfying suitable gap hypotheses, an explicit Cantor-type witness is constructed. Second, for sets satisfying certain growth conditions, a random Cantor-type witness is constructed, extending work of Kolountzakis. This also extends certain results in recent work of Cuéllar-Iosevich-Kulkarni-Aravena-Yavicoli to the polynomial setting. Finally, we show for arbitrary sequences $A$ with zero as an accumulation point that the $(d+3)$-fold sumset $(d+3)A$ is not polynomially universal when restricted to polynomials of degree at most $d$; this complements classical work of Bourgain.

comments
25 pages
fields
Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2611.19824 ↗

The DEG1 challenge asks whether positive solutions of a super-exponential Minkowski-curvature equation are unique for step weights with a single sign change and negative mean. In this paper, we give a Neumann counterexample by studying $\left(\frac{u'}{\sqrt{1-(u')^2}}\right)' + λa_{μ,h}(t)(e^{u^2}-1)=0$ with $u'(0)=u'(2h)=0$, where $a_{μ,h}=1$ on $(0,h)$ and $a_{μ,h}=-μ$ on $(h,2h)$, with $μ>1$. Using the shooting method, we prove that the positive solution curve has exactly two nondegenerate folds for $(λ,h)$ in a nonempty open region. As $μ$ increases through the corresponding critical values, the number of positive solutions is successively $1$, $2$, $3$, $2$, and $1$.

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

In this paper, we solve a classical problem investigated by Gelfand and Shilov on a family of fractional integral operators whose kernels have singularity appeared on the light-cone in R^n+1. As an implication, we obtain a desired sharp estimate for the L^p to L^q-boundedness of cone multiplier operators having a negative order.

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

We use nonlinear Dirichlet resolvents to prove Hardy inequalities with capacity-based and resolvent-based weights for $1<p<\infty$ on arbitrary open sets. On bounded Sobolev extension domains, integrability against either weight characterizes Sobolev functions satisfying homogeneous Dirichlet conditions on arbitrary closed subsets of the boundary. On bounded Lipschitz domains, the resolvent-based weight $\bm{W}_{D,p}$ converges locally in $L^1$ to the negative of Barozzi's interior variational mean curvature as $p\downarrow1$.

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

For the dyadic paraproduct $π_b$ and $Q\ge1$, let $Φ_b(Q)$ be the supremum of $\|π_b\|_{L^2(w)}$ over dyadic weights with $[w]_{A_2^d}\le Q$. Beznosova's linear bound $Φ_b(Q)\lesssim Q\,\|b\|_{\mathrm{BMO}_d}$ is sharp over $\mathrm{BMO}_d$, while every nonzero symbol safisfies $Φ_b(Q)\gtrsim Q^{1/2}$. We ask which properties of a fixed symbol place its growth between these extremes, and identify two: the distribution of the Haar coefficients of $b$ over scales and the nesting of their supports. Symbols supported on $L$ consecutive scales obey a two-weight bound of order $\sqrt L$; as a consequence, polynomial decay of the scale tails determines the sharp trowth exponent, except at a critical rate where the growth is determined up to a factor $(\log Q)^{1/2}$. For symbols supported on a chain, $\sup_Q Q^{-1/2}Φ_b(Q)$ is comarable to $\|S_d b\|_{\infty}$, and for every symbol the boundedness of the dyadic square function $S_d b$ is necessary for minimal growth $Q^{1/2}$. Conversely, $Φ_b(Q)\lesssim Q^{3/4}\|S_d b\|_{\infty}$ for every symbol, and the bound $\|π_b\|_{L^2(w)}\lesssim [w]_{A_2^d}^{1/2}\|S_d b\|_{i\infty}$ holds for every symbol at weights whose local $A_2$ imbalance has bounded evergy off a family of dyadic chains with disjoint tops; this class contains all weights used in our lower bounds.

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

These notes present Bourgain's proofs of the discretized sum-product theorem and its applications. The discussion emphasizes the construction of trees with multiscale porosity from small additive doubling, using either quantitative Freiman theorrem or the Plünnecke-Ruzsa inequality, and the amplification of these structures by multiplication. Additive combinatorial tools connect the resulting growth estimates to discretized sum-product problem. The notes also discuss the passage to the exceptional set estimates for orthogonal projections, the exclusion of Borel subrings of intermediate Hausdorff dimension, and Fourier decay for multiplicative convolutions of measures.

comments
64 pages, 13 figures
fields
Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2611.20639 ↗

We prove that for every $q>2$, the $q$-variation operator associated with the bilinear Hilbert transform is bounded from $L^r(\mathbb R)\times L^s(\mathbb R)$ to $L^p(\mathbb R)$ whenever $1<r,s<\infty$, $p>2/3$, and $1/p=1/r+1/s$.

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

The concept of a linked pair of two sequences of polynomials, one of which is orthogonal, is introduced. Such a pair always has a resultant that factors. Two methods for producing such linked pairs are given: one for general orthogonal polynomials and the other for any polynomial in the Askey scheme. Generalized discriminants are introduced and evaluated, including a general product formula for each operator in the Askey scheme. A new notion of companion orthogonal polynomials is also introduced and used to evaluate the discriminants of orthogonal polynomials. These methods recover all known formulas for the generalized discriminants of classical polynomials and provide new ones.

comments
32 pages
fields
Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2611.20962 ↗

Let $\mathbb{B}^d$ be the closed unit ball in $\mathbb{R}^d$, $d\ge1$. We prove that, for every convex $f\in C(\mathbb{B}^d)$ and every integer $n\ge1$, there exists a polynomial $P_n$ of total degree at most $n$, convex on all of $\mathbb{R}^d$, such that $\|f-P_n\|_{C(\mathbb{B}^d)}\le c\,ω_2(f,n^{-1};\mathbb{B}^d)$. Here $ω_2$ is the ordinary second modulus of smoothness and $c=c_d$ depends only on $d$. In particular, we obtain the rate $O(n^{-2})$ for convex functions with uniformly bounded second derivatives.

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

For a compact smooth plane curve $S$ with nonzero curvature and a union $X\subseteq B_R$ of unit balls satisfying a one-dimensional Katz–Tao condition, we prove $\|\mathrm{Br}_A E_S f\|_{L^2(X)} \leq C_{\varepsilon,\varepsilon'} R^{\varepsilon}|X|^{13/62}\|f\|_2$. The proof relies on a refined local broad estimate that uses density decomposition and the short frequency intervals associated with coarse tubes.

comments
18 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.21374 ↗

Representation Theory19

We extend results of Spaltenstein on irreducible components of two-dimensional usual Springer fibres in reductive groups of simply lace type to the case of two-dimensional affine Springer fibres associated to loop groups. One of our methods is to relate these affine Springer fibres with certain subsets of the affine Weyl group.

comments
21 pages
fields
Representation Theory
pdf ↗ page arXiv:2611.18938 ↗

Let $D$ be a quaternion division algebra over a non-Archimedean local field $F$ of characteristic zero. We prove the conjecture of Dagar, Sharma, and Verma classifying irreducible smooth representations of $\mathrm{GL}_n(D)$ distinguished by $\mathrm{GL}_1(D)\times\mathrm{GL}_{n-1}(D)$ for $n>2$. These are precisely the trivial representation and the irreducible normalized parabolic inductions $\one_{n-2}\timesτ$, where $τ$ is an infinite-dimensional irreducible representation of $\mathrm{GL}_2(D)$ distinguished by $\mathrm{GL}_1(D)\times\mathrm{GL}_1(D)$. The proof combines a choice of cuspidal inducing factor with orbit conditions and multisegment methods.

fields
Representation Theory
pdf ↗ page arXiv:2611.19149 ↗

Let $\mathcal B$ be an abelian category with enough projective and injective objects, and let $\mathcal B\ltimes_ηF$ be an $η$-extension of $\mathcal B$ with $η$ associative. Given a cotorsion pair $(\mathcal X, \mathcal Y)$ in $\mathcal B$, we show that the cotorsion pair $(Δ(\mathcal X),Δ(\mathcal X)^\perp)$ exists for arbitrary associative $η$, removing the square-zero assumption $F^2=0$ from Hu's construction. When $(\mathcal X, \mathcal Y)$ is hereditary, the heredity of $(Δ(\mathcal X),Δ(\mathcal X)^\perp)$ is characterized by the first left derived functor of a canonical defect functor $δ$. We also remark that Hu's construction and hereditary result for the cotorsion pair $({}^\perp U^{-1}(\mathcal Y), U^{-1}(\mathcal Y))$ remain valid without the nilpotence assumption on $η$. Under nilpotence hypotheses, we establish a completeness criterion for $(Δ(\mathcal X),Δ(\mathcal X)^\perp)$ using the Beligiannis radical functor $\mathfrak r$. And we also provide a completeness criterion for $({}^\perp U^{-1}(\mathcal Y), U^{-1}(\mathcal Y))$ if $\mathcal B\ltimes_ηF$ has enough injective objects. We give sufficient conditions for their coincidence. Dual results are obtained for $ζ$-coextensions. Finally, we specialize the theory to $θ$-extension rings and tensor rings, where the abstract conditions admit explicit module-theoretic descriptions.

fields
Representation Theory, Rings and Algebras
pdf ↗ page arXiv:2611.19449 ↗

We classify the homomorphism spaces between Weyl modules for the general linear group $\mathrm{GL}_3$ over an algebraically closed field of characteristic $2$. We prove that these spaces have dimension at most one and give an explicit recursive procedure that determines when they are nonzero and constructs generators in terms of semistandard tableaux. As a consequence, we determine the dimensions of certain homomorphism spaces between Specht modules in characteristic $2$.

comments
14 pages. Comments welcome
fields
Representation Theory
pdf ↗ page arXiv:2611.19514 ↗

We construct the spectral action in the context of Betti metaplectic Langlands theory. More precisely, we prove that the category of twisted sheaves on $\text{Bun}_G$ with nilpotent singular support admits a canonical action by the symmetric monoidal category of quasicoherent sheaves on the moduli of twisted $H$-local systems, where $H$ is the metaplectic dual group. This confirms the Betti version of the conjecture of Gaitsgory–Lysenko, originally formulated in the de Rham setting under the name ``metaplectic vanishing conjecture". Given a symmetric monoidal category with suitable symmetry, we develop a categorical framework by introducing a notion of twisted factorization homology and studying its categorical action. We show that the category of quasicoherent sheaves on the moduli of twisted local systems can be realized as a twisted factorization homology. Using metaplectic factorizable Satake we further prove that the metaplectic Hecke action naturally fits into our categorical framework. Combining these results, we obtain the desired spectral action.

comments
139 pages
fields
Representation Theory
pdf ↗ page arXiv:2611.19626 ↗

We establish the continuous extension of the geometric side of the twisted trace formula to a natural space of test functions, which are not necessarily compactly supported, for reductive algebraic groups. The continuity of the geometric side of the (untwisted) Arthur trace formula was established by Finis–Lapid. Subsequently, Parab generalized their result to the twisted trace formula under a certain restriction on the truncation parameter and an additional assumption. In this paper, we remove his restriction and assumption, and prove the continuous extension for the twisted trace formula. We also give a revised form of Parab's decay estimate for the geometric side.

comments
44 pages
fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2611.19744 ↗

We obtain bases of the centers of the ordinary $q$-Schur superalgebra $\mathcal{S}_q(m|n,r)$ and the queer $q$-Schur superalgebra $\mathcal{Q}_q(n,r)$ in terms of Casimir elements of the Hecke algebra $\mathcal{H}_r$ and the Hecke-Clifford algebra $\mathcal{H}_r^c$, respectively. The key step is to find an invertible submatrix of the character table of $\mathcal{H}_r$ or $\mathcal{H}_r^c$ whose column index set is the support of the corresponding $q$-tensor module appearing in Schur-Weyl duality: for $\mathcal{H}_r$ this is the set $H_{m,n}(r)$ of $(m|n)$-hook partitions of $r$, while for $\mathcal{H}_r^c$ this is the set $\mathrm{SP}_n(r)$ of strict partitions of $r$ of length $\leq n$. Unlike the case of ordinary $q$-Schur algebras, the submatrix formed by taking the row index set to be the same as the column index set need not be invertible. We determine that the row index set should be chosen as $H_{\min\{m,n\},\max\{m,n\}}(r)$ for $\mathcal{S}_q(m|n,r)$, and as the preimage of $\mathrm{SP}_n(r)$ under the Glaisher correspondence for $\mathcal{Q}_q(n,r)$.

comments
20 pages
fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2611.20015 ↗

For a commutative uniserial ring $R$ of length $n$ we describe the indecomposable objects in the monomorphism category of $R$ independent of the specific ring for $n\leq 5$ and only dependent on the residue field for $n = 6$. Thus, the classification problem for the monomorphism category of $\mathbb{Z}/p^6 \mathbb{Z}$ reduces to the known case of $\mathbb{F}_p[x]/(x^6)$, resolving the Birkhoff Problem.

fields
Representation Theory
pdf ↗ page arXiv:2611.20099 ↗

The binary projectively $\mathfrak{sl}(2)$-invariant differential operators between spaces of weighted densities on the 1-dimensional manifold are called Gordan transvectants or Rankin-Cohen (GRC) brackets. For the two contact series (with an even and an odd ``time'' variable) on the supercircle or superstring of dimension $1|2$, we describe analogs of GRC brackets. We have discovered many new operators. For $\mathfrak{osp}(2|2)\subset\mathfrak{k}(1|2)$, the space of invariant binary operators of every given order is $2$-dimensional for all weights of the densities, not only for the weights considered so far. For $\mathfrak{pe}(2)\subset\mathfrak{m}(1)$, there are three independent binary operators of order $2$, not two. While classifying them, we correct an earlier result on the unary operators: the order-$2$ Bol operator over $\mathfrak{m}(1)$ is only one member of a $1$-parameter family invariant for all weights, which corrects Theorem 5.1 of arXiv:2110.10504. We correct earlier findings in the $1|3$-dimensional case and consider $\mathfrak{osp}_a(4|2)$-invariant (GRC) brackets in $1|4$-dimensional case, where the order-$2$ bracket is independent of the parameter $a$ and is invariant under the whole of $\mathfrak{k}(1|4)$. In the $1|5$-dimensional case, the analogs of Bol operators are odd, of order $5+2k$, where $k=0,1,2,\dots$, and so is the first GRC bracket of odd order, which is of order $5$. We also settle the exceptional case $\mathfrak{as}\subset\mathfrak{kas}\subset\mathfrak{k}(1|6)$.

comments
75 pages
fields
Representation Theory
pdf ↗ page arXiv:2611.20128 ↗

A finite-dimensional algebra over an algebraically closed field is gentle if and only if its trivial extension is special biserial. We prove the corresponding characterisation for almost gentle algebras, that is, an algebra over such a field is almost gentle if and only if its trivial extension is special multiserial, which answers a question of Green and Schroll. As a consequence, the property of having a special multiserial trivial extension is invariant under stable equivalence.

fields
Representation Theory, Rings and Algebras
pdf ↗ page arXiv:2611.20135 ↗

In their recent paper, Gan, Gross and Prasad proposed a precise conjecture to describe the restrictions of representations of classical groups that lie in an L-packet of Arthur type. On top of local root numbers, the main notion considered is the relevance of two A-parameters. In this paper, we establish that the relevance of two A-parameters is sufficient for the existence of a Bessel period for a pair of representations in the associated L-packets. Moreover, such a pair is unique. We also prove the necessity of relevance for co-tempered A-parameters, and give several counterexamples in the general case.

comments
69 pages, comments welcome
fields
Representation Theory
pdf ↗ page arXiv:2611.20494 ↗

The \(\de\)-invariant measures the interaction between two simple modules and controls the behavior of their convolution product. Using categorical interpretations of Cao's tropical and \(F\)-invariants, we establish folding formulas for the \(Λ\)-invariants between determinantial modules in arbitrary symmetrizable type and derive the corresponding \(\de\)-formula by symmetrization. We apply the \(\de\)-formula to quiver Hecke Kirillov–Reshetikhin modules and show that, in every finite type, their \(\de\)-invariants are completely determined by the coefficients of the symmetrized inverse \(t\)-quantized Cartan matrix. We obtain explicit formulas in all finite types, including closed formulas in the classical types \(A\), \(B\), \(C\), and \(D\).

fields
Representation Theory
pdf ↗ page arXiv:2611.20611 ↗

We prove the conjecture of Kang, Lawrie, and Song that Zhu's $C_2$-algebra of a simply-laced boundary admissible affine vertex algebra is isomorphic to the Jacobian ring of an invariant potential obtained by lifting a polynomial twisted period from a Cartan subalgebra via the Chevalley isomorphism. We further identify the $C_2$-algebras of the corresponding Drinfeld-Sokolov reductions with the Jacobian rings of the restrictions of this potential to Slodowy slices. We also extend the Jacobian presentation to non-simply-laced principal boundary admissible affine vertex algebras, where the restriction of the potential to the Cartan subalgebra satisfies a Dunkl-singularity equation with root-length-dependent multiplicities.

fields
Representation Theory, Algebraic Geometry, Quantum Algebra
pdf ↗ page arXiv:2611.20659 ↗

Let $\mathcal S_2$ be the Lie algebra of divergence-free Laurent polynomial vector fields on a two-dimensional torus. We determine its simple weight modules with uniformly bounded weight multiplicities. As a consequence, we obtain a classification of its simple Harish-Chandra modules, i.e., weight modules with finite-dimensional weight spaces, which are either simple generalized highest weight modules or simple quotients of tensor fields modules.

comments
34 pages
fields
Representation Theory
pdf ↗ page arXiv:2611.20712 ↗

The main results of this manuscript are fourfold. First, we introduce relative holomorphic discrete series supermodules over basic classical Lie superalgebras $\mathfrak{g}$ and $\mathfrak{sl}(n\vert n)$. These are unitarizable highest weight supermodules whose $\mathfrak{g}_{\bar{0}}$-constituents are Harish-Chandra modules of relative holomorphic discrete series representations. We show that these are exactly the unitarizable highest weight supermodules whose globalizations have supermatrix coefficients square-integrable modulo the center. Second, we define the formal superdimension of a relative holomorphic discrete series supermodule as the parity-weighted sum of the formal dimensions of its $\mathfrak{g}_{\bar{0}}$-constituents. We show that it equals, up to sign, the value at zero of an $L$-packet supercharacter obtained by averaging over the Weyl group. Third, we prove a Kac-Wakimoto theorem for formal superdimension: it is nonzero if and only if the highest weight is maximally atypical. For integral highest weights, it equals the superdimension of a finite-dimensional simple supermodule with the same degree of atypicality. We realize these supermodules through derived Zuckerman functors. For nonintegral highest weights, it is computed by generalized Duflo-Serganova cohomology. Finally, to establish the Kac-Wakimoto conjecture, we develop the theory of generalized Duflo-Serganova cohomology for unitarizable supermodules. We prove that the cohomology of a unitarizable simple supermodule is unitarizable and either zero or simple.

comments
97 pages. Comments are welcome
fields
Representation Theory, Mathematical Physics
pdf ↗ page arXiv:2611.20729 ↗

Let $H_{R,a}(\mathfrak{S}_n)$ be the Hecke algebra over a principal ideal domain $R$ with parameter $a\in R$. The representation theories of $H_{\mathbb{C}(v^{1/2});v}(\mathfrak{S}_n)$ and $H_{\mathbb{C};0}(\mathfrak{S}_n)$ differ substantially and have largely been studied independently. In this paper, we relate the categories of finitely generated modules of these two algebras through specialization functors from the category of finitely generated $H_{\mathbb{C}[v^{1/2}];v}(\mathfrak{S}_n)$-modules. We first investigate the fundamental properties of these functors concerning dimensions, essential surjectivity, and characters. We then construct $H_{\mathbb{C}[v^{1/2}];v}(\mathfrak{S}_n)$-modules which, through these functors, provide connections between skew Specht modules of $H_{\mathbb{C}(v^{1/2});v}(\mathfrak{S}_n)$ and $0$-Hecke skew Specht modules of $H_{\mathbb{C};0}(\mathfrak{S}_n)$, and between Kazhdan–Lusztig cell modules of $H_{\mathbb{C}(v^{1/2});v}(\mathfrak{S}_n)$ and dual plactic class modules of $H_{\mathbb{C};0}(\mathfrak{S}_n)$. Both families of $H_{\mathbb{C};0}(\mathfrak{S}_n)$-modules are closely related to regular Schur labeled skew shape posets. We further explore how specialization functors relate the Frobenius characteristic to the quasisymmetric characteristic and connects the branching rules for skew Specht modules with those for $0$-Hecke skew Specht modules. Finally, we use the established connection with Kazhdan–Lusztig cell modules to obtain a result on the classification of dual plactic class modules up to isomorphism.

comments
64 pages
fields
Representation Theory, Combinatorics
pdf ↗ page arXiv:2611.20790 ↗

In this article, we consider the twin group $T_n$ for a positive integer $n$ and present two techniques for constructing high-dimensional and complicated representations of $T_n$. The first technique consists of composing a known representation of $T_n$ with the well-established Cohen map, while the second technique relies on the tensor product of two known representations of $T_n$. To implement these techniques, we consider the two representations $η_1$ and $η_2$ of $T_n$ introduced recently by Nasser. The first technique is applied to the representation $η_1: T_n \longrightarrow \mathrm{Aut}(\mathbb{F}_n)$, which maps $T_n$ into the automorphism group of the free group $\mathbb{F}_n$ with $n$ generators. The second technique is applied to the representation $η_2: T_n \longrightarrow \mathrm{GL}_n(\mathbb{Z}[t^{\pm 1}])$, which maps $T_n$ into the general linear group over the ring of Laurent polynomials in an indeterminate $t$. Using these techniques, we construct new high-degree representations of $T_n$ and examine, for some of them, structural properties such as faithfulness and reducibility. This work provides new avenues for developing representations of $T_n$ and related groups using these techniques.

fields
Representation Theory
pdf ↗ page arXiv:2611.20849 ↗

We determine exactly when the Brauer algebra of type $C$, denoted by $\B_r(C,δ)$, is semisimple over $\C$, where $δ\neq0$. We first analyze the two admissible cases for homomorphisms from the top layer to the second layer. We construct an auxiliary operator on the space spanned by symmetric Brauer diagrams with a fixed bottom partial diagram and exactly two horizontal edges in each row. Using this operator, we prove that, in each admissible case, the corresponding quadratic condition is necessary and sufficient for the existence of a nonzero homomorphism. The constant terms of these quadratic expressions depend on sums of contents of horizontal $2$-strips in bipartitions. We then show that a failure of semisimplicity is detected by cell modules in the second layer. Finally, by relating the content sums for admissible bipartition pairs to the known sums for horizontal $2$-strips in ordinary partitions, we obtain an explicit finite set of exceptional nonzero parameters.

fields
Representation Theory
pdf ↗ page arXiv:2611.20855 ↗

Let $π$ be a ladder representation of $\mathbf{GL}_m(F)$, $F$ a non-Archimedean local field. We construct an exact sequence of costandard modules, indexed by a lower Bruhat interval of a symmetric group and graded by the length, whose Euler characteristic is the determinantal formula of Tadić and Lapid–Mínguez. This is an analogue of the dual Bernstein–Gelfand–Gelfand resolution. The proof is combinatorial, through Jacquet modules and the Bruhat order; we also interpret the coresolution as a Cousin complex on Zelevinsky's space, which extends it to the balanced representations of Lapid–Mínguez.

comments
28 pages, v1
fields
Representation Theory
pdf ↗ page arXiv:2611.21150 ↗

Geometric Topology13

We prove that a balanced sutured manifold $(M,γ)$ satisfying $\dim_{\mathbb C} SHI(M,γ)=1$ is an integral homology product; that is, $H_*(M,R_-(γ);\mathbb Z)=H_*(M,R_+(γ);\mathbb Z)=0$. Consequently, for every taut balanced sutured manifold $(M,γ)$, $SHI(M,γ)\cong\mathbb C$ if and only if $(M,γ)$ is a product sutured manifold. The proof uses the enhanced Euler characteristic of $SHI$ and a specialization formula for sutured torsion.

comments
2 pages
fields
Geometric Topology
pdf ↗ page arXiv:2611.18745 ↗

We show that an odd number n is the determinant of an amphichiral knot of braid index at most three if and only if both n and n + 4 are sums of two squares. The proof rests on the known description of amphichiral knots of braid index three as closures of alternating 3-braid words with a rotation or reflection symmetry (Birman–Menasco, Stoimenov, Jung). Determinant formulas for closed 3-braids are also known (e.g. through the reduced Burau representation at t = -1); what is added here is their evaluation on the two symmetric families, which gives the condition on n + 4, and an explicit construction for the converse. For amphichiral knots of braid index three this describes which determinants occur, which bears on the determinant part of a question of Jung. We did not find the statement in the literature we searched. As a consequence, for an odd n with n + 4 not a sum of two squares, every amphichiral knot with determinant n has braid index at least five; we test this on 4,999 amphichiral knots of Burton's census with up to 19 crossings whose determinant satisfies this hypothesis.

comments
9 pages. Scripts, logs and result files of the computational checks: https://doi.org/10.5281/zenodo.24157621
fields
Geometric Topology
pdf ↗ page arXiv:2611.18776 ↗

We introduce a new infinite family of invariants of singular knot and links and of pseudoknots by extending the biquandle fares construction to the case of psyquandles. We give the axioms explicitly for four cases of fare-based invariants: 1-fares, signed crooked 2-fares, signed through 2-fares and signed complete 2-fares. We provide examples of each type, illustrating the method of computation and collecting some results for toy examples using small-cardinality psyquandles and abelian coefficient groups.

comments
13 pages
fields
Geometric Topology, Quantum Algebra
pdf ↗ page arXiv:2611.19133 ↗

We show that a single Legendrian surgery on the canonical contact structure of the unit cotangent bundle $ST^*K$ of the Klein bottle $K$ produces a planar contact $3$--manifold $(Y,ξ)$ with infinitely many pairwise non-homeomorphic Stein fillings. The fillings are obtained from the disk cotangent bundle $DT^*K$ by attaching a single Weinstein $2$--handle along the images of one Legendrian knot under the powers of a contactomorphism of $(ST^*K,ξ_{\mathrm{can}})$, no positive power of which extends over $DT^*K$. The construction takes place in a planar open book of $(ST^*K,ξ_{\mathrm{can}})$, and $(Y,ξ)$ is contactomorphic to Baykur's recent example of a planar contact $3$--manifold with infinitely many Stein fillings. Since $(ST^*K,ξ_{\mathrm{can}})$ has a unique minimal symplectic filling up to homeomorphism, finiteness of fillings is not preserved under Legendrian surgery, even for planar contact $3$--manifolds. The same construction gives the planar contact $3$--manifolds with infinitely many rational homology ball Stein fillings found earlier by the author.

comments
18 pages, 9 figures
fields
Geometric Topology, Symplectic Geometry
pdf ↗ page arXiv:2611.19217 ↗

We give a complete classification of the inclusion relations between the link spectrum of the horseshoe template $L(0,1)$ and those of the nonnegative Lorenz-like templates $L(0,a)$. For a template $T$, its link spectrum $\mathscr L(T)$ consists of the link types carried by $T$, allowing parallel strands along its strips. For integers $a\geq0$, the spectra of $L(0,a)$ and $L(0,1)$ are comparable under inclusion if and only if $a\notin\{0,2\}$. More precisely, \[ \mathscr L(L(0,a))=\mathscr L(L(0,1)) \quad\Longleftrightarrow\quad a=1, \] while \[ L(0,a)\prec L(0,1) \qquad (a\geq3). \] For $a=0$ and $a=2$, the two spectra are incomparable. The main new containment is \[ L(0,2n)\preceq L(0,1)\qquad(n\geq2), \] which goes beyond the classical parity-preserving nesting relations. A key ingredient is a braid-theoretic criterion: every $T$-link \[ T((r_1,s_1),\ldots,(r_k,s_k)) \] with $s_k\geq2r_k$ is a horseshoe link. This gives a large explicit family belonging to both the Lorenz and horseshoe spectra. In the reverse direction, we construct a horseshoe link outside the Lorenz spectrum. For each integer $m\geq6$, we obtain infinitely many horseshoe links of braid index $m$ excluded from every other nonnegative $L(0,a)$. These examples give infinitely many links with any prescribed number of components at least three. In the other direction, for each positive number of components, we give infinitely many links carried by both $L(0,0)$ and $L(0,2)$ and excluded from the horseshoe spectrum.

comments
34 Pages
fields
Geometric Topology
pdf ↗ page arXiv:2611.19467 ↗

Building on the Livne-like construction of Cartwright, Koziarz and Yeung, we construct a closed smooth 4-manifold with a map to the two-sphere whose generic fiber has genus 109 and whose four exceptional fibers are determined by explicit braid and permutation data. A pencil of four-pointed spheres realizes the same global braid monodromy and makes the covering holomorphic. We show that the contraction of its thirty-six exceptional curves is the Cartwright-Steger surface, hence our smooth construction gives a topological description of this complex surface.

comments
21 pages
fields
Geometric Topology
pdf ↗ page arXiv:2611.19620 ↗

We show that the SL(2;C) character variety of the n-punctured sphere is described via the determinantal variety defined by an n x n symmetric matrix of rank at most 4 whose entries are the traces of simple closed curves on the surface. This result generalizes the Fricke-Klein-Vogt relations to arbitrary n, and we determine the structure of the kernel of the associated matrix.

comments
4 pages
fields
Geometric Topology, Mathematical Physics, Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2611.19943 ↗

Let $Ω$ be an irreducible properly convex projective domain admitting a discrete cocompact group action of projective automorphisms. We prove that the Holmes–Thompson volumes of projective simplices with vertices in $Ω$ are uniformly bounded. As a consequence, we prove that a closed properly convex projective manifold of dimension at least two has positive simplicial volume if and only if it is irreducible.

comments
28 pages
fields
Geometric Topology, Differential Geometry
pdf ↗ page arXiv:2611.20237 ↗

We introduce a notion of pseudo-morphism for groups, which extends the notion of group morphism from a group to a ring. We show that pseudo-morphisms from a group $G$ to an integral domain $R$ form a filtred Hopf algebra which can be seen as an efficient notion of dual for $G$. We also show that pseudo-morphisms are closely related to the notion of polynomial maps in the sense of Eilenberg-MacLane/Passi, the two notions even coinciding when $G$ is finitely generated and $R$ is a field. It follows that, in that case, polynomial maps are endowed with an Hopf structure. In a second part, we study non repeated Milnor invariants (in the $4$-dimensional context of $2$-string links) from this pseudo-morphism point of view. We show that they form a sub-bialgebra of the Hopf algebra of pseudo-morphisms on the group of $2$-string links up to link-homotopy, and prove that it is isomorphic to an explicit quotient $\textrm{Mil}$ of a polynomial ring. This leads to a fully algebraic description of the group of 2-string links up to link-homotopy as the dual group associated to $\textrm{Mil}$. As a by-product, we obtain that non repeated Milnor invariants are polynomial maps, and we show that this can be used to give a new proof of their finite type property.

comments
30 pages, comments are welcome !
fields
Geometric Topology, Algebraic Topology, Group Theory
pdf ↗ page arXiv:2611.20304 ↗

We prove that the group $H_2(\mathcal{I}_3;\mathbb{Z})$ is finitely generated, where $\mathcal{I}_3$ is the Torelli subgroup of the mapping class group of a closed genus-three surface $Σ_3$. A key role in the proof is played by establishing the following property: for each symplectic transvection $t_x\in\mathrm{Sp}_{6}(\mathbb{Z})$, we have $$ \bigl(t^{120}_x-1\bigr)^{57}\bigl(t_x^{24}-1\bigr)(t_x-1)^6H_2(\mathcal{I}_3;\mathbb{Z})=0. $$ The proof is based on the study of the spectral sequences associated with the action of $\mathcal{I}_3$ on the Bestvina-Bux-Margalit complex of minimizing cycles and with the actions on certain auxiliary complexes of the stabilizers of two- and three-component multicurves on $Σ_3$. The remaining ingredients are Tavgen's theorem, which asserts that $\mathrm{Sp}_{6}(\mathbb{Z})$ has bounded elementary generation, and the result of Kassabov and Putman, which asserts that $H_2(\mathcal{I}_3;\mathbb{Z})$ is finitely generated as a $\mathbb{Z}[\mathrm{Sp}_6(\mathbb{Z})]$-module.

comments
106 pages
fields
Geometric Topology, Algebraic Topology, Group Theory
pdf ↗ page arXiv:2611.20353 ↗

We prove that every representation $ρ:π_1(Σ_g)\rightarrow\mathrm{PSL}_2(\mathrm{R})$ which sends every simple closed curve to a hyperbolic element admits a branched developing map. As a corollary, the mapping class group action on the Euler class zero component of the $\mathrm{PSL}_2(\mathrm{R})$-character variety of a genus $g$ surface is ergodic if $g\geq3$. (The action is not ergodic if $g=2$.) Moreover, almost every representation of nonzero Euler class admits a branched developing map.

fields
Geometric Topology
pdf ↗ page arXiv:2611.20374 ↗

For 0<L<=2arcsinh(1), the hyperbolic string vertices of Costello and Zwiebach consist of the bordered hyperbolic surfaces with geodesic boundary of length L whose interior simple closed geodesics have length at least L. We show that the corresponding regions in moduli space are compact oriented orbifolds with corners whose boundaries are, including orientations and automorphism groups, the spaces of twisted sewings. Hence their generating chain satisfies the master equation without the bracket term exactly in a complex of geometric chains. The usual connected form cannot hold exactly for geometric chains; we determine its exact form, show that it holds modulo gluing and covering relations in a complex computing the homology of the moduli spaces, and that the vertex currents are the unique top-dimensional solution. Finally we compare with Costello's homotopical framework. In a strict model given by hyperbolic surfaces with marked boundary points, every solution of his master equation with his initial condition integrates exactly to the vertex currents, up to the sign (-1)^(3g-3+n); such solutions exist, are unique up to homotopy, and correspond to the hyperbolic vertices. Under a continuity assumption on the comparison map and granting the inputs of Costello's homology computation, the hyperbolic vertices represent his homotopy class of solutions, for a completed notion of homotopy.

comments
65 pages
fields
Geometric Topology, Mathematical Physics
pdf ↗ page arXiv:2611.20615 ↗

We classify the Morse indices and ordered handles arising from nondegenerate critical points of smooth functions on effective orientable four-dimensional orbifolds. Let $ρ\colon G\to\mathrm{SO}(4)$ be a faithful representation of a finite group. Let $V\subset\mathbb R^4$ be the negative eigenspace of a nondegenerate Hessian that is invariant under $ρ(G)$. The splitting $\mathbb R^4=V\oplus V^\perp$ determines an ordered quotient handle. Two such ordered handles admit an orientation-preserving isomorphism if and only if their negative eigenspaces lie in the same orbit under $N_{\mathrm{SO}(4)}(ρ(G))$. We determine the possible Morse indices and the normalizer orbits for every family in the completed Du Val list.

comments
42 pages
fields
Geometric Topology
pdf ↗ page arXiv:2611.21153 ↗

Logic13

This paper investigates a relational semantics for onto-epistemic logic with two semi-negations. The frames carry two pairs of quasi-orders and two commuting involutions. Some frames have nondistributive lattices of stable sets. The four- and nine-valued entailments are recovered as joint entailment on two particular finite frames. Sound and complete binary consequence calculi are given for both component entailments and for joint entailment. The joint Lindenbaum algebra embeds subdirectly into the product of its two component quotients. This embedding shows that joint derivability is the intersection of the two component derivability relations. The finite model property is proved using Dedekind-MacNeille completion and a filter-ideal representation of the resulting lattice. All three entailments are decidable by interleaving the search for a derivation with the search for a finite countermodel.

fields
Logic
pdf ↗ page arXiv:2611.18977 ↗

We study distributive lattices with an ideal-valued generalized implication satisfying a commutativity identity. This class extends commutative weak Heyting algebras by allowing implication values to be non-principal ideals. We characterize its intersection with several known classes of gi-lattices, study gi-deductive systems and their relationship with gi-filters and gi-congruences, and extend the relational characterization of commutativity to this setting. The resulting correspondence yields a Priestley-style duality by restricting the established duality for gi-lattices.

fields
Logic
pdf ↗ page arXiv:2611.19521 ↗

We prove Chang-style omitting types theorems for standard first-order Lukasiewicz logic. Starting from a prescribed model $M$, we obtain an extension that omits higher-complexity types while preserving lower-level types already realized in $M$. If $T$ is a $Π_{n+2}$-theory, every model of $T$ has an exact extension that preserves its realized $Σ_{n+1}$-types and omits every $Σ_{n+2}$-type not generated by a $Σ_{n+1}$-type. An iterated construction also omits infinity-universal types, whose unbounded quantifier complexity cannot eventually be generated by the corresponding lower-complexity fragments of a single type. The main tool is a refinement of Robinson's infinite forcing sensitive to the quantifier complexity of formulas.

fields
Logic
pdf ↗ page arXiv:2611.19540 ↗

Recent theories that take determinateness as primitive are either nonclassical theories of nonclassical truth, like Field's INT, or classical theories of classical truth, like Fujimoto and Halbach's CD and CD^+. This paper develops a third option: a classical theory of nonclassical truth. The theory, KFDcs, extends the Kripke-Feferman theory KFcs with a primitive determinateness predicate. Unlike CD^+, KFDcs keeps the iteration of truth unrestricted and gives up its completeness. With or without a consistency axiom, KFD is proof-theoretically equivalent to the theory \widehat{ID}_2 of twice iterated fixed points, with ordinal {\varphi}({\varphi}({\varepsilon}_0, 0)0), thus stronger than CD^+. It is also shown that replacing full induction with internal induction yields ordinal {\varphi}({\varphi}(ω, 0)0), and restricting internal induction to total formulae yields {\varphi}({\varepsilon_0},0), the ordinal of KF.

fields
Logic
pdf ↗ page arXiv:2611.19552 ↗

The axiom V = HOD, referring to the class of hereditarily ordinal-definable sets, is contingently contingent by forcing—it holds contingently in the generic multiverse of some models of set theory but not others. Thus we introduce and investigate the \emph{contingent HOD dichotomy}, according to which either (1) the set-theoretic universe V is close to HOD by forcing—HOD is a ground, V = HOD is forceable, the universe is ordinal-definable from a set parameter $V=\text{HOD}_b$, the blurry HOD hierarchy collapses to kappa-HOD for some cardinal kappa, and furthermore these features are invariant by forcing and hold throughout the generic multiverse; or (2) the universe V is far from HOD by forcing in all those respects, so $V\neq\text{HOD}$, but also HOD is not a ground, V = HOD is not forceable, the set-theoretic universe is not ordinal-definable from a set, the universe is not kappa-HOD for any kappa, and these features hold invariantly throughout the generic multiverse. We investigate the nature of the dichotomy in connection with large cardinals, with set-theoretic geology, with the iterated $\text{HOD}^α$ classes, and with the maximality principles MP and MP(R), showing generally that both prongs of the dichotomy occur with diverse set-theoretic phenomena.

comments
32 pages
fields
Logic
pdf ↗ page arXiv:2611.19573 ↗

A temporal logic discussed in the author's book "Logics of Time and Computation" is given a simpler proof of semantic completeness, eliminating some flaws in the original.

fields
Logic
pdf ↗ page arXiv:2611.19699 ↗

Let $G=(X,E)$ be a Borel graph generated by $n$-many bounded-to-one Borel functions. We show that $G$ admits a Borel proper $(2n+1)$-coloring, which answers a problem of Kechris, Solecki and Todorčević.

fields
Logic, Combinatorics
pdf ↗ page arXiv:2611.19846 ↗

We present a hypersequent calculus $H_R$ for cyclic involutive residuated lattices and prove strong standard completeness for arbitrary theories in a fixed countable propositional language. Standard models are chains on $[0,1]$; neither commutativity nor equality of the monoid unit and the dualizing constant is assumed. The chain semantics is the class $K_R$ defined by unit cyclicity and all ordered finite-history conditions. Every countable member of $K_R$ embeds into a standard chain preserving the entire signature. The construction combines central-support reconstruction, gap insertion and relative contraction. A relative comparison construction supplies the required chain countermodels. We also prove admissibility of the unrestricted density rule for theoremhood and effective elimination from finite proofs without additional assumption leaves. Elimination uses terminating enumeration of density-free proofs; ordinary Cut is retained, and no complexity bound is claimed. Further constructions give bounded standard embeddings for nontrivial countable chains of involutive uninorm logic and pseudo-uninorm logic with weak commutativity. Using ordinary chain completeness for arbitrary theories, these yield strong standard completeness for both logics. A companion Lean~4 development formalizes the main results, with its scope and external inputs stated explicitly.

comments
102 pages
fields
Logic
pdf ↗ page arXiv:2611.19940 ↗

We conjecture that for each integer $\ell\geq 2$, the equivalence relation arising from the shift action of $\mathbb{N}^{\ell}$ on $2^{ω^{\ell}}$ is hypersmooth. We prove this conjecture for $\ell=2$, reduce the general case to a problem in Borel graph colorings, and establish the general case in measure. We also show that under certain mild hypotheses on a hypersmooth equivalence relation $E$, every finite-index Borel super-equivalence relation of $E$ is hypersmooth.

comments
72 pages, 15 figures
fields
Logic
pdf ↗ page arXiv:2611.20267 ↗

We answer a question of Goldberg about cover exacting cardinals. Concretely, we show that if $κ$ is $ω_1$-strongly compact, then no cardinal $λ>κ$ is $γ$-cover exacting for some cardinal $γ$.

comments
10 pages
fields
Logic
pdf ↗ page arXiv:2611.20299 ↗

A probabilistic Turing machine is an ordinary Turing machine that may also toss fair coins, with no limit on its running time or memory. If it always halts, it decides only computable problems. Aaronson et al. studied machines that may run forever on some coin tosses, with the answer read only from the runs that halt. Suppose the correct answer must be more than twice as likely as the wrong one. They showed that these machines decide exactly the problems solvable with a fixed list of questions about the halting problem. They asked what happens when the correct answer need only be the more likely one. We show that the machines then decide exactly the problems solvable by asking such questions one after another, each chosen after the earlier answers. We also show that the factor two can be replaced by any fixed factor greater than one. A machine may promise two numbers: a lower bound on its probability of halting, and a lower bound on its probability of being right when it halts. From these two numbers we compute exactly how many questions fixed in advance the machine can replace. The main idea is that probability acts as a budget for how often a computable guess may change its mind. The results extend to oracle machines and to machines nested inside each other. Quantum machines decide the same problems.

fields
Logic
pdf ↗ page arXiv:2611.20517 ↗

We introduce the notion of exact properness, a strong form of properness for uncountable models, and prove iteration theorems and the consistency of forcing axioms for this class. We discuss examples of posets in the class and give some applications of the forcing axioms.

fields
Logic
pdf ↗ page arXiv:2611.21390 ↗

We construct an invariant symmetric ternary relation with existence and stationarity over models for classes of characteristic-zero Frobenius fields associated with Melnikov formations. For proper formations, the automorphism theories of their canonical root-predicate expansions have amalgamation and no model companion. The underlying fields are then unbounded, and their theories are NSOP$_1$ but not simple. In this case, on triples of elementary submodels, the constructed relation implies ordinary nonforking, which implies Kim-independence, which implies linear disjointness; all three implications are strict. We also study p.e.c. fields with group actions, namely fields existentially closed in every regular extension carrying an extension of the action. We prove that the class of p.e.c.\ difference fields of characteristic zero is not elementary, and that the theory of all characteristic-zero difference fields with canonical root predicates has no model companion.

fields
Logic
pdf ↗ page arXiv:2611.21508 ↗

Rings and Algebras13

In this paper, we develop a bialgebra theory for NS-algebras via the Manin triple approach. We first study representations of NS-algebras and establish an equivalence among NS-bialgebras, matched pairs and Manin triples of NS-algebras. We then introduce the NS-Yang-Baxter equation (NS-YBE) and show that its symmetric solutions induce triangular NS-bialgebras. We further investigate the relationship between symmetric solutions of the NS-YBE and $\mathcal O$-operators of NS-algebras, and characterize pre-NS-algebras in terms of invertible $\mathcal O$-operators. As an application, we investigate the relation between NS-bialgebras and dendriform D-bialgebras via double constructions of Connes cocycles. In particular, we show that every NS-bialgebra induces a dendriform D-bialgebra structure on the direct sum of two copies of its underlying vector space.

comments
28 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2611.19107 ↗

Let $F$ be an algebraically closed field of characteristic zero. We consider polynomial maps with constants $ω(x,y)=A_1x^k+A_2y^k$ on $M_n(F)$, where $A_1$ is invertible and $k\geq2$. We show that the necessary condition for surjectivity obtained by Saini and Singh (Polynomial maps with constants on matrix algebra, Linear Algebra Appl. 752 (2027), 256-277) is not sufficient in any dimension $n\geq6$. We also completely characterize surjectivity for $n=5$ and $6$.

comments
Preliminary version
fields
Rings and Algebras
pdf ↗ page arXiv:2611.19228 ↗

Diassociative algebras (associative dialgebras) and dendriform algebras are vector spaces with two binary operations, introduced by J.-L. Loday in the study of Leibniz algebras; their operads are Koszul dual to each other. We survey the classification problem for these two classes, including the Zinbiel algebras, the commutative dendriform algebras, which are Koszul dual to Leibniz algebras. We recall the definitions, the main examples and the Loday diagram with its extension by left-symmetric algebras and dialgebras, and describe the methods used to classify algebras of small dimension: direct computation from lists of associative algebras, annihilator (central) extensions and geometric classification by degenerations. We then collect, by dimension, the known algebraic classifications of diassociative algebras, dendriform algebras and their commutative case, the Zinbiel algebras, point out lists that later work corrected, and summarise the cohomological results that the methods rely on. We close with a list of open problems.

comments
11 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2611.19249 ↗

Let $M_n(\mathbb{H})$ denote the algebra of $n\times n$ quaternion matrices. We study common invariant right subspaces of tuples in $M_n(\mathbb{H})^r$ and determine exact real semialgebraic dimensions for two associated sets. If $n_1,\ldots,n_s$ are positive integers, $n=n_1+\cdots+n_s$, and $q=\sum_{1\leq a<b\leq s}n_an_b$, the set of tuples preserving at least one nested chain with successive increments $n_1,\ldots,n_s$ has dimension $4rn^2-4(r-1)q$. For $r\geq2$ and $1\leq k<n$, the set of tuples with at least two distinct common $k$-dimensional right invariant subspaces has dimension $4rn^2-4(r-1)(k(n-k)+n-1)$. The proofs use finite right-module coordinates and a common local-rank argument.

comments
29 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2611.19492 ↗

For additively coupled elements with invertible sum and selected commuting outer inverses, we study coincidence of the core idempotents and inversion of the Hua element. Intertwining forces coincidence for finite-Drazin data in unital rings and for generalized-Drazin data in complex unital Banach algebras. Under coincidence, the output splits into an invertible core and a complementary parallel sum, called the residue, yielding exact criteria for inverse existence and success of the prescribed candidate. Explicit ring examples show that strict generalized-Drazin input inverses need not force coincidence under intertwining, and that a common core with a Harte-quasinilpotent residue need not give a strict output inverse. For rings finite as modules over a commutative central subring with the same identity, we prove intertwining transfer and automatic bicommutation for commuting outer inverses with Harte-quasinilpotent remainders, without Noetherianity. This gives input-core coincidence under intertwining. If the central subring is Noetherian, every Harte-quasinilpotent element also has separated left and right powers. For common-core data in the finite-central class, the candidate is a strict output inverse exactly when the residual parallel sum is Harte-quasinilpotent. In the Banach setting, uniform input spectral gaps characterize continuity of the core and candidate along convergent input pairs, with intertwining and quasinilpotent input remainders at every term and at the limit. The output gap is equivalent when the residues of the sequence and limit are also quasinilpotent. Exact defect identities give local estimates on augmented inverse data. At an exactly intertwined base with invertible coefficient operators, we determine the feasible first-order defect space and its sharp norm constant, with a norm-specific matrix calibration.

comments
33 pages
fields
Rings and Algebras, Functional Analysis
pdf ↗ page arXiv:2611.19664 ↗

We complete the description of the automorphism group of the super Jordan plane $\mathcal B$ over a field of characteristic zero, extending the classification of super-automorphisms obtained by N. Andruskiewitsch and F. Dumas in \cite{AD}. We characterize a subgroup $\mathbb L$ stabilizing two one-dimensional vector spaces and obtain two semidirect product decompositions of it. This subgroup contains all super-automorphisms and its structure motivates our main result. Precisely, we prove that $\operatorname{Aut}\mathcal B=\operatorname{Inn}\mathcal B\rtimes\operatorname{Aut}_{\mathrm{super}}\mathcal B$, where $\operatorname{Inn}\mathcal B$ and $\operatorname{Aut}_{\mathrm{super}}\mathcal B$ denote, respectively, the groups of inner automorphisms and super-automorphisms of $\mathcal B$. We also characterize the nilpotent elements of $\mathcal B$ and prove that every nonzero nilpotent has nilpotency index two. Furthermore, we give a geometric interpretation of three distinguished families of nilpotent elements. After degree truncation and projectivization, two of these families yield projective linear subspaces, while the third yields quadratic Veronese varieties of arbitrary dimension.

fields
Rings and Algebras, Quantum Algebra
pdf ↗ page arXiv:2611.19704 ↗

A ring is reversible if $ab=0$ implies $ba=0$, and symmetric if $abc=0$ implies $acb=0$. Szabo proved that the smallest order of a unital reversible nonsymmetric ring is $256$. We classify all such minimal rings: up to isomorphism there are exactly $186$ of them, $19$ of characteristic $2$ and $167$ of characteristic $4$, and there are none of characteristic $8$ or higher. All of them are local with residue field $\mathbb{F}_2$, the nilpotency index of the Jacobson radical is $4$ or $5$, and $120$ of them form $60$ pairs $R$, $R^{op}$ of non-isomorphic rings. The classification is obtained by a general method of deformation of graded algebras over $\mathbb{Z}/2^e\mathbb{Z}$, whose completeness is proved, and it is checked against the known examples: $\mathbb{F}_2Q_8$, Szabo's example and the ten rings in the family of generalized quaternion rings studied by Grau, Oller-Marcén and Szabo. The presentations of the $186$ rings and the code are provided as ancillary files.

comments
13 pages, 3 tables. Ancillary files: presentations of the 186 rings and Python code. Submitted to J. Pure Appl. Algebra
fields
Rings and Algebras
pdf ↗ page arXiv:2611.19962 ↗

In this paper, we study the global extension problem of Lie algebras from the perspective of dgLas and the Maurer–Cartan formulism. We propose a new equivalence relation of global extensions, generalizing the early work of Agore and Militaru. This new concept can be better adopted in the study of classical contraction and deformation problems for Lie algebras. Meanwhile, we construct dgLas that control based formal deformations of global extension structures under these equivalences. As byproducts, we obtain the classification of infinitesimal deformations in terms of the cohomology of the controlling dgLas and the corresponding obstruction theory. We relate the dgLa controlling deformation of global extensions under framed equivalence to that of non-abelian extensions constructed by Frégier, obtaining a geometric interpretation of the decomposition of global cohomology into as a disjoint union of non-abelian cohomology. As an application, we study a particular family of an Inönü–Wigner contraction from $\g\rtimes_{\mathrm{ad}}\g$ to $V_{\mathrm{ab}}\rtimes_{\mathrm{ad}}\g$ in the framework of global extension, deformation, and the dgLa approach.

comments
35 pages, comments are welcome
fields
Rings and Algebras
pdf ↗ page arXiv:2611.20072 ↗

A right A-module M is called iso-multiplication if for every submodule N of M there is a two-sided ideal B of A such that N ?A MB. We construct noncommutative examples of isomultiplication modules which are not multiplication modules, including triangular algebras of arbitrary dimension. We classify all iso-multiplication modules over T_2(k) without a finitegeneration assumption. For a semiprime right Goldie ring we prove that the classical localization of an iso-multiplication module is multiplicity-free. Further consequences address composition length and local rings; we distinguish these from standard Morita, Ore-localization, and chaincondition results.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.20073 ↗

The family of Barnes-Wall lattices includes the balanced Barnes-Wall lattice $M_n$ over $\mathbb{Z}[\sqrt{2}]$ and two ordinary Barnes-Wall lattices $L_n$ and $L'_n$ over $\mathbb{Z}$, which are geometrically equivalent to each other. Embedding of these lattices into the Cayley-Dickson algebras of an appropriate dimension is considered. It is shown that for all $n \geq 2$ the lattices $M_n$ and $L_n$ are closed under multiplication and are generated by the sets of pairwise products of their elements. The lattices $L_n \cdot L'_n$, $L'_n \cdot L_n$, and $L'_n \cdot L'_n$, generated by pairwise products of elements of the lattices $L_n$ and $L'_n$, also are studied.

fields
Rings and Algebras, Combinatorics
pdf ↗ page arXiv:2611.20105 ↗

The Hopf algebra Markov chain dynamical system, on the Hopf algebra of non-planar binary forests, that models the action of Merge on workspaces in Chomsky's Minimalist Model of syntax, satisfies a universal property, determined by the fact that the Merge operation is a Hochschild 1-cocycle. This universal property has an interpretation in terms of models of the syntax-semantics interface, as it shows that, if the side of semantics possesses a sufficiently rich compositional structure, then that structure is uniquely induced by the syntactic Merge, once the semantic values of lexical items and syntactic features are assigned. We illustrate how this universality works by showing, in particular, full compatibility of this Hopf algebraic formulation with Heim-Kratzer semantics.

comments
59 pages, LaTeX
fields
Rings and Algebras
pdf ↗ page arXiv:2611.20305 ↗

We view generalized inverses from another perspective, through invertibility in the skew corner bimodules $eRf$ attached to a pair of distinct idempotents $e, f$ of a ring $R$. Many generalized inverses are defined by a system of equations together with conditions on ranges and kernels, which makes them harder to visualize as inverses in the traditional sense. In the language of invertible blocks, however, they become genuine one or two-sided inverses of a suitable compression of the element. We will systematically show how block invertibility in a skew corner $eRf$ can be used to visualize Drazin's $(b,c)$-inverse, which contains the Moore–Penrose, Bott-Duffin $(e,f)$ inverses amongst others. On this foundation we develop a way to produce units of the corner ring from complementary blocks, and transport stable range one across two-sided Peirce decompositions for distinct idempotents.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.20370 ↗

This paper introduces a new class of Manin triples of compatible Lie algebras and investigates the corresponding bialgebra structures. To this end, we first study an invariant-c$2$c form on a compatible Lie algebra, namely a nondegenerate symmetric bilinear form that is invariant with respect to one Lie bracket and is a commutative $2$-cocycle with respect to the other, which naturally arises from a quadratic differential Novikov algebra. Then we introduce the notion of compatible Lie-anti-pre-Lie algebras (compatible LAPL algebras in short), which serve as the underlying algebra structures of compatible Lie algebras endowed with invariant-c$2$c forms. Furthermore, we introduce the notion of a compatible LAPL bialgebra, which is shown to be equivalent to a Manin triple of compatible Lie algebras with respect to the invariant-c$2$c form. We investigate triangular compatible LAPL bialgebras, which are obtained from antisymmetric solutions of the compatible LAPL Yang-Baxter equation. We also use $\mathcal{O}$-operators of compatible LAPL algebras to construct such solutions. Finally, we show that every differential Novikov bialgebra gives rise to a compatible LAPL bialgebra and that this construction preserves triangularity.

comments
28 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2611.20604 ↗

Operator Algebras12

We study norm stability of third-type generalized Jordan identities, allowing their auxiliary maps to be arbitrary. A canonical normalization eliminates these witnesses with a factor of four. For a unital $C^*$-algebra and a unital contractive Banach bimodule, the zero-defect maps are precisely sums of a derivation and multiplication by a central module element. We characterize scalar stability by the closed range of the normalized Jordan-defect operator. For operator bimodules, two explicit $2\times2$ tests recover an ordered Leibniz defect and a commutator defect. If the algebra has an approximate diagonal bounded by $M$ and the module is weak$^*$ closed, these tests yield approximation by an inner derivation plus a central multiplier with error at most $8M$ times the normalized matrix defect. The corresponding completely bounded estimate holds at all matrix levels. For full matrix algebras the constant is $8$, independently of their size, and weak$^*$ closedness is unnecessary. When the map vanishes at the identity, the constants improve to $2M$ and $2$, respectively.

fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2611.19171 ↗

We associate a spectral triple with each stabilizer code in a projective error model arising from a nice error basis and equipped with a length function. The spectral triple records the dimension of the code as well as the minimum code distance. For Pauli stabilizer codes of dimension greater than one with Hamming weight, Latrémolière's dual propinquity provides a pseudometric which allows us to compare codes of different physical and logical dimensions. We show that in the resulting topology, minimum distance of a code is locally constant for qubits and for qudits of dimensions three and five. Thus correction of all errors up to a prescribed weight is a local property in these cases. Moreover, for each prime $p$, we classify the underlying $C^*$-algebras in the metric closure as a subclass of AF algebras, namely those arising as tensor products of $C((\mathbb{Z}_p)^r)$, for $r \in \{0,1,2, \ldots , \infty\}$, with matrix algebras of $p$-power order or the UHF algebra of type $p^\infty$. Every such $C^*$-algebra not isomorphic to $M_{p^k}(\mathbb{C})$ for any $k\geq 1$ occurs as the underlying algebra of a point in the metric boundary. In particular, we obtain the CAR algebra as a metric limit of qubit stabilizer codes.

comments
28 pages, comments welcome
fields
Operator Algebras
pdf ↗ page arXiv:2611.19453 ↗

In this paper, we study Fourier and convolution inequalities on locally compact quantum groups in the presence of the scaling group. For $1\le p\le 2$, we investigate a family of scaling Fourier transforms and the associated norms $H_{p,θ}(\mathbb G)$, and we show that $H_{p,θ}(\mathbb G)<1$ for the real quantum $az+b$ group and $0<θ<1$, $1<p<2$. We also investigate scaling convolution for locally compact quantum groups and, by extending the ordinary convolution, obtain the corresponding scaling Young inequality in four different regions. In Young Region~II, under $1<p,s<2$ and $2\leq r<\infty$, we construct sequences proving norm one at every effective vertex and prove strict inequality at every other effective point.

fields
Operator Algebras, Functional Analysis, Quantum Algebra
pdf ↗ page arXiv:2611.19855 ↗

We study minimal circle homeomorphisms and their products with Cantor systems, and show that these actions have diagonal dimension at most two and fine tower dimension at least two. Consequently, diagonal dimension, fine tower dimension, and tower dimension are all equal to two for minimal circle homeomorphisms. We also obtain a strict separation between tower dimension and fine tower dimension on a one-dimensional space.

comments
24 pages
fields
Operator Algebras, Dynamical Systems
pdf ↗ page arXiv:2611.19895 ↗

Let $G$ be an amenable discrete quantum group with the modified rapid decay property relative to a proper central length $\ell$. We construct a modularly corrected commutator seminorm on $C_r^*(G)$ and prove its right invariance. Averaging over the coproduct yields a regular bi-invariant Lip-norm. For the spectral projections $P_R=χ_{[0,R]}(D_\ell)$, we equip the finite-dimensional operator systems $A_R=P_RC_r^*(G)P_R$ with the Lip-norms induced by the compressed left and right coactions. We prove quantum Gromov–Hausdorff convergence and obtain an explicit approximation estimate. These spectral compressions are length-filtered Peter–Weyl truncations of the compact dual. The resulting regular bi-invariant Lip-norm also places the family within Leimbach's operator Gromov–Hausdorff convergence theorem. The construction applies to non-unimodular discrete quantum groups, including discrete duals of standard deformations of compact semisimple Lie groups.

fields
Operator Algebras
pdf ↗ page arXiv:2611.19920 ↗

Let $X$ be a discrete metric space of bounded geometry. We prove that $X$ has property A if and only if the canonical map $$λ:C^*_{u,max}(X)\to C^*_u(X)$$ is an isomorphism.

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

We study approximate $K$-conjugacy for minimal Cantor–circle extensions with arbitrary circle homeomorphism cocycles, allowing orientation reversal. Under the assumption of classical rigidity, we show that two such systems are approximately $K$-conjugate if and only if there exists an ordered unital graded $K$-theory isomorphism satisfying the finite coefficient $K$-condition. Our approach combines dynamical corrections along Kakutani–Rokhlin towers with the classification and uniqueness theory of $C^*$-algebras. Moreover, the crossed-product isomorphisms implementing approximate $K$-conjugacy can be chosen as inner perturbations of a fixed isomorphism and its inverse.

comments
Comments are welcome!
fields
Operator Algebras
pdf ↗ page arXiv:2611.20232 ↗

We study $R^*$-subalgebras of von Neumann algebras. In finite homogeneous type $\mathrm I_n$, every $R^*$-subalgebra is locally finite-dimensional. We also give a trace criterion for local finite dimensionality in the semifinite setting under a finite-trace hypothesis, and prove an approximate halving property for projections in strongly dense $R^*$-subalgebras of type $\mathrm{II}_1$ factors. For three projections in an $R^*$-subalgebra of a type $\mathrm{II}_1$ factor, the reduced word-length filtration gives bounds on layer growth, criteria for stabilization, and uniform bounds on minimal-polynomial degrees at each fixed word length. Finally, we give a negative answer to Kadison's fifteenth problem by constructing an infinite-dimensional unital $*$-algebra generated algebraically by three projections in which every selfadjoint element has finite spectrum. The resulting $R^*$-algebra embeds unitally into every type $\mathrm{II}_1$ factor.

fields
Operator Algebras
pdf ↗ page arXiv:2611.20690 ↗

We give an overview of the second quantisation of spectral triples and compute the entropy of the noncommutative space described by it in terms of a spectral action. This reviews earlier work by Chamseddine, Connes and the second author, but presented here concisely, including the procedure of second quantisation using infinite-dimensional Clifford algebras. We exemplify the theory by considering noncommutative metric spaces consisting of $N$ points. The entropy of these discrete spaces is explicitly computed, and we study the resulting entropic force as well as the evolution of the spaces in time.

comments
18 pages, 4 figures
fields
Operator Algebras, Mathematical Physics
pdf ↗ page arXiv:2611.21139 ↗

We construct a separable, unital, simple, nuclear $C^*$-algebra in the UCT class such that every nonzero projection in its stabilization is infinite, while it contains a nonzero projectionless hereditary subalgebra. The construction gives a negative answer to the question whether infiniteness of all nonzero projections in a unital simple nuclear $C^*$-algebra implies pure infiniteness.

fields
Operator Algebras
pdf ↗ page arXiv:2611.21234 ↗

We establish two characterisations of Property A for discrete metric spaces of bounded geometry. Such a space has Property A if and only if its Roe algebra coincides with its quasi-local algebra, and if and only if the canonical map from its maximal Roe algebra to its reduced Roe algebra is injective. Both characterisations hold in the uniform and ordinary Roe settings. We also prove, without assuming Property A, that strong quasi-locality is equivalent to norm approximability by finite-propagation operators. In particular, the strongly quasi-local algebra always coincides with the Roe algebra. As applications, we show that a discrete group is exact whenever its full group $C^*$-algebra has the local lifting property, and that the maximal injective crossed-product functor agrees with the reduced crossed-product functor precisely for exact discrete groups.

fields
Operator Algebras
pdf ↗ page arXiv:2611.21255 ↗

For normal states of arbitrary von Neumann algebras, we characterize positive finite multiples of Araki relative entropy among non-degenerate divergences. The axioms are monotonicity under normal unital completely positive maps, tensor additivity, superadditivity for product second states, and separate lower semicontinuity in the predual norm. Alternatively, a conditional-expectation identity replaces the two tensor assumptions. The proof uses order bounds and asymptotic estimates on tensor powers. An appendix proves the known analytic estimates needed here, using standard modular theory and Haagerup L^p spaces. We also obtain the corresponding characterization in the C* algebraic setting.

comments
27 pages
fields
Operator Algebras, Information Theory, Mathematical Physics
pdf ↗ page arXiv:2611.21549 ↗

Algebraic Topology10

We develop toric geometry spectral algebraic geometry. In particular, we lift toric varieties to flat schemes over the sphere spectrum. Furthermore, we prove several rigidity and strictness results allowing us to define and produce strict group actions of flat algebraic tori. As an application, we give a construction of the Tate curve in spectral algebraic geometry. This approach lets us produce a lift of the Tate curve to $\mathbb{S}[[q]]$. We furthermore describe how to lift (arithmetic) toric stacks.

comments
29 pages, Comments are welcome
fields
Algebraic Topology, Algebraic Geometry
pdf ↗ page arXiv:2611.18852 ↗

Locally standard $T$-pseudomanifolds are singular analogues of quasitoric manifolds. In this paper, we study a certain class of four-dimensional locally standard $T^2$-pseudomanifolds over convex polygons. We establish an Orlik-Raymond type classification and study their ordinary and equivariant cohomology, as well as their intersection and equivariant intersection cohomology. We also introduce ring structures on middle-perversity intersection cohomology and equivariant intersection cohomology via change of perversity. We show that these rings can be described in terms of the cohomology and equivariant cohomology of associated nonsingular spaces, which are quasitoric manifolds or $S^4$. Furthermore, we give combinatorial descriptions of the equivariant cohomology and equivariant intersection cohomology in terms of labelled graphs.

comments
44 pages, 5 figures, 1 table
fields
Algebraic Topology, Geometric Topology
pdf ↗ page arXiv:2611.19010 ↗

We classify pointed self-maps of $M=\mathbb{RP}^{3}\#\mathbb{RP}^{3}$ up to pointed homotopy. Using the universal cover $S^2\times\mathbb R$, we reduce the problem to paths in the sphere mapping space with even or odd endpoint conditions. The evaluation fibration, Whitehead products, and a double-coset calculation determine the resulting secondary invariants. The classes inducing the trivial fundamental-group endomorphism split into four families, each in bijection with $\mathbb Z$ after choosing a reference homotopy class. Every other realizable endomorphism sends both standard generators to reflections. For each such endomorphism, the realizable multipliers on $π_2(M)\cong\mathbb{Z}$ are precisely the odd integers $d$, and the classes with fixed multiplier are in bijection with $\mathbb Z/|d|\mathbb Z$ after choosing a reference homotopy class. We compute an explicit composition law on the double-reflection submonoid and determine the pointed self-homotopy equivalences. The classes inducing the trivial fundamental-group endomorphism form a subset $\mathcal{T}$ that is preserved by composition on either side with arbitrary pointed homotopy classes and satisfies $\mathcal{T}^2=\{0\}$, where $0$ is the constant class. For each fixed triple $(m,k,d)$ in the double-reflection case, the $|d|$ classes induce identical homomorphisms on every homotopy group. Thus the secondary invariant detects distinctions invisible to these induced homomorphisms.

comments
57 pages
fields
Algebraic Topology
pdf ↗ page arXiv:2611.19310 ↗

We study faithful Galois extensions in a presentably symmetric monoidal $\infty$-category $\mathscr{C}$ by a dualizable $\mathbb{E}_1$-group $G$. We prove that these extensions correspond to colimit-preserving symmetric monoidal functors from $\mathrm{An}^{\mathrm{B}G}$ to $\mathscr{C}$. Under suitable assumptions, we use this correspondence to construct a Galois pro-anima that classifies Galois extensions in $\mathscr{C}$. This generalizes the étale fundamental groupoid of commutative rings and Mathew's weak Galois groupoid.

comments
39 pages. Comments welcome!
fields
Algebraic Topology, Category Theory
pdf ↗ page arXiv:2611.19411 ↗

To study derived defect topological quantum field theories, we construct an $(\infty,1)$-category of stratified bordisms and sketch its $(\infty,d)$-dimensional analogue. In the first chapters we develop a method for constructing symmetric monoidal $(\infty,1)$-categories, inspired by Segal spaces but better suited to geometric inputs, which we call interval Segal spaces. Using this framework, we construct the $(\infty,1)$-category of $d$-dimensional smooth manifolds via smooth $\infty$-sheaves thereof, in an attempt to address fibrancy issues present in prior work on this subject. We further equip this category with a symmetric monoidal structure, compute its homotopy 1-category, and extend the construction to manifolds endowed with tangential structures, obtaining the interval Segal space of $d$-dimensional bordisms with tangential structure. To model the stratifications supporting topological defects, we work with conically smooth stratified spaces, a suitably smooth framework for conical stratifications. We define stratified topological manifolds as stratified $\mathcal{B}$-manifolds for a suitable $(\infty,1)$-category of basics $\mathcal{B}$. Using these, we construct an interval Segal space whose objects are compact closed stratified topological $(d-1)$-manifolds and whose 1-morphisms are stratified $d$-dimensional bordisms, and we endow it with a symmetric monoidal structure. We also use tangential structures on conically smooth stratified spaces to formulate a notion of defect labels, aiming toward bordisms with labeled defects in the style of Carqueville et al. Finally, we sketch a higher-dimensional generalization of the interval category to a category of $d$-cubes for $d>1$, conjecturally presenting $(\infty,d)$-categories, and outline how stratified factorization homology may be used to produce derived stratified defect TQFTs.

comments
PhD thesis, Instituto Superior Tecnico, Universidade de Lisboa, 2026. 205 pages
fields
Algebraic Topology, Category Theory
pdf ↗ page arXiv:2611.19459 ↗

Lurie's cobordism hypothesis classifies fully extended framed topological field theories valued in a symmetric monoidal $(\infty,n)$-category $\mathcal{C}$ with duals by the $\infty$-groupoid $\mathcal{C}^{\mathrm{fd}}$ of fully dualisable objects. This classification results in an $O(n)$-action on $\mathcal{C}^{\mathrm{fd}}$, where $O(n)$ acts on the framed bordism category by change of framing. Lurie observed that for a connective spectrum, this action is ``a version of the classical $J$-homomorphism.'' We make this identification explicit: with respect to the right action of $O(n)$ on framings, the $O(n)$-action on the localisation $L(\mathrm{Bord}_n^{\mathrm{fr}}) \simeq S$ is precisely $\ominus J_n$, the inverse of the unstable $J$-homomorphism $J_n \colon O(n) \to \mathrm{GL}_1(S)$. The identification of the action with the unstable $J$-homomorphism in the setting of smooth stacks is due to Grady–Pavlov; we give an independent proof in Lurie's original formulation of the cobordism hypothesis, using the abstract Pontryagin–Thom construction. The sign (i.e.\ whether the action is $J_n$ or $\ominus J_n$) depends on the convention for the $O(n)$-action on framings, and is relevant for $\mathrm{pin}^\pm$ theories and hence for quantum systems with time-reversal symmetry. We compute the induced action on homotopy groups of the sphere spectrum in low degrees, yielding explicit invariants for invertible TFTs in dimensions $1$, $2$, and $3$, and connect these to the Kitaev chain, the framing anomaly, the spin-statistics theorem, and anomaly inflow. We recover the Galatius–Madsen–Tillmann–Weiss theorem as a consequence of the cobordism hypothesis and relate the homotopy fixed-point and mapping-spectrum perspectives on invertible TFTs via the duality between tangential and normal framings.

comments
22 pages; Comments Welcome!
fields
Algebraic Topology, Mathematical Physics, Category Theory
pdf ↗ page arXiv:2611.19615 ↗

Let $M$ be a connected oriented closed manifold of dimension $d\geq 2$, equipped with a regular CW structure, and let $P$ be its face poset. We consider the cyclic Hasse diagram $G_P^{\mathrm{cyc}}$, obtained from the directed Hasse diagram $G_P$ by adding an arrow from each maximal cell to every $0$-cell of $M$. Over an arbitrary field $\mathbb K$, we completely describe the path cohomology algebra $PH^*(G_P^{\mathrm{cyc}})$ in terms of the $\mathbb K$-Betti numbers of $M$. In particular, this algebra is not graded commutative whenever the dimension of $H^*(M)$ over $\mathbb K$ is at least 4. This disproves Grigor'yan's conjecture on graded commutativity. Moreover, as $M$ ranges over connected oriented closed surfaces, the even subalgebras $PH^{\mathrm{even}}(G_P^{\mathrm{cyc}})$, regarded as ungraded associative unital $\mathbb K$-algebras, satisfy no common algebraic identity beyond those satisfied by all associative unital $\mathbb K$-algebras. These results distinguish GLMY path cohomology from classical cohomology, whose cup product is graded commutative and whose even subalgebra is commutative. As an application, we construct a digraph $G$ for which the Künneth formula for the categorical product $G\times G$ fails, answering a question of Pinto negatively and disproving another conjecture of Grigor'yan.

fields
Algebraic Topology, Combinatorics
pdf ↗ page arXiv:2611.19813 ↗

The Extended Persistent Homology Transform (XPHT) describes a shape through the extended persistence diagrams of its directional height functions. We present an algorithm for computing a finite directional sample of the three-dimensional XPHT from a triangulated boundary. Our main construction determines essential first-homology pairings by combining an ordered tree-cotree decomposition with evaluation-dual cocycles. The decomposition supplies a homology basis compatible with the height filtration, while the cocycles are used to determine the essential birth-death pairs. Degree-zero persistence and duality determine the remaining boundary diagrams. Under the boundary-reduction hypotheses and with critical-point sign labels, these diagrams yield the extended persistence of the solid. The resulting procedure uses graph constructions and linear algebra over F2 on boundary meshes extracted from three-dimensional binary images.

fields
Algebraic Topology
pdf ↗ page arXiv:2611.20413 ↗

One of the best known invariants of multi-parameter persistent homology is the rank invariant, which is subsumed by the generalized rank invariant (GRI), obtained by naturally extending its domain. Möbius inversion of the GRI not only provides a compact encoding of this invariant but is also useful for clarifying its relationship with other invariants of multi-parameter persistent homology. However, Möbius inversion of the GRI has been defined only under suitable finiteness conditions on its domain and support. This work studies the extent to which Möbius inversion can be extended beyond these finiteness conditions. Namely, we formalize the notion of Möbius invertibility, which captures when Möbius inversion exists beyond these finiteness conditions, and investigate when the GRI is Möbius invertible. A central result we establish is that Möbius invertibility of the GRI is guaranteed for finitely presentable $d$-parameter persistence modules when $d\leq 2$, but may fail when $d>2$. Establishing this failure also corrects an error in the existing literature. In response to this higher-dimensional obstruction, we show that for finitely presentable $d$-parameter persistence modules, restricting the GRI to intervals subordinate to the finite grid supporting a minimal free presentation preserves its Möbius inversion whenever the latter exists over all intervals. Since computing the GRI over all intervals in $\mathbb{R}^d$ is infeasible in practice, this result provides a principled justification for restricting the GRI to those intervals.

comments
Theorem C(iii) in v4 was incorrect and has been replaced by dimension-dependent statements. Section 3.5 is new. Substantial material from v4 has been moved to a separate paper. 69 pages
fields
Algebraic Topology
pdf ↗ page arXiv:2611.20463 ↗

We study the regular slice filtration of representation spheres $S^V\wedge H\underline{M}$. For every finite group $G$, we locate all slices in an explicit interval $[n(V),k(V)]$ and show that both endpoints occur. We introduce a \emph{defect vector} to measure a slice's failure. For the Klein four-group with $\underline{\mathbb F}_2$-coefficients, a balanced defect allows us to move $S^V\wedge H\underline{\mathbb F}_2$ by certain $RO(G)$-graded cohomology classes to its $\dim V$-slice, which is again a representation sphere, while an odd defect obstructs any spherical slice. As an application, we obtain closed formulas for the bottom slice of $Σ^nH\underline{\mathbb{F}}_2$ for every $n$, recovering the computation of Guillou and Yarnall by a different method. Along the way, we determine the complete slice tower of $S^{\inftyα_i}\wedge H\underline{\mathbb F}_2$ and consequently, the partial tower for $S^{nα_i}\wedge H\underline{\mathbb F}_2$.

comments
Comments are welcome
fields
Algebraic Topology
pdf ↗ page arXiv:2611.20547 ↗

Commutative Algebra10

We provide explicit formulas for the Betti numbers of all powers of Ferrers ideals and edge ideals of threshold graphs.

fields
Commutative Algebra
pdf ↗ page arXiv:2611.19071 ↗

We prove a cardinality obstruction to realizing an abelian group as the ideal class group of a half-factorial Dedekind domain. If an abelian $p$-group $P$ satisfies $\bigcap_{r\ge1}p^rP=0$ and admits a half-factorial generating subset, then $|P|\le\max\{\aleph_0,|P/pP|\}$. The proof separates generators of equal order by finite quotients. Its group-theoretic ingredient is a direct summand generated by selected members of an arbitrary finite generating set. The torsion subgroup of $\prod_{j\ge1}\mathbb{Z}/p^j\mathbb{Z}$ is uncountable and $p$-adically separated, but has countable quotient modulo $p$; hence it has no half-factorial generating subset. This gives a negative answer to the universal half-factorial Dedekind realization problem for every prime. Pure subgroups give counterexamples of every uncountable cardinality at most the continuum, so the least cardinality of a counterexample is $\aleph_1$. We also study free-kernel lifting, order-preserving lifts across torsion kernels, character-compatible generators, and the failure of compatibility under unions and contraction. These results distinguish global realizability from half-factoriality on bounded subgroups and from integrality of cross numbers.

comments
Comments are welcome!
fields
Commutative Algebra, Group Theory
pdf ↗ page arXiv:2611.19262 ↗

We investigate a conjecture proposed by Cooper et al. in 2017 regarding a lower bound for the Waldschmidt constant of monomial ideals. We first show that this conjecture does not hold in general by explicitly computing the Waldschmidt constant for a family of monomial ideals. Also, we identify a class of monomial ideals for which this conjecture holds by proving a containment between symbolic and ordinary powers. For a monomial ideal, we provide a new lower bound for the Waldschmidt constant, which modifies the conjectured lower bound under a certain condition.

fields
Commutative Algebra
pdf ↗ page arXiv:2611.19424 ↗

In this paper, we study Smirnov's conjecture: Let $(R,\mathfrak{m})$ be a Noetherian local ring of characteristic $p>0$ and dimension $d$. Let $I$ be an $\mathfrak{m}$-primary ideal. If $R$ is weakly $F$-regular, analytically unramified and Cohen-Macaulay, then $\displaystyle L_1(I)=e(I)-e_{\mathrm{HK}}(I)$ if and only if $I$ is stable. Here, $e(I)$ and $e_{\mathrm{HK}}(I)$ denote the Hilbert-Samuel multiplicity and the Hilbert-Kunz multiplicity of $R$ with respect to $I$, respectively. Moreover, $\displaystyle L_1(I)=\lim_{q\to\infty}\frac{e_1(I^{[q]})}{q^d},$ where $q=p^e$ and $e_1(I^{[q]})$ denotes the first Hilbert coefficient of $R$ with respect to the $q$th Frobenius power of $I$. We prove the conjecture when $R$ is either excellent and strongly $F$-regular, or excellent of dimension $3$.

comments
6 pages, comments are welcome
fields
Commutative Algebra
pdf ↗ page arXiv:2611.19444 ↗

Let $A$ be the coordinate ring of a bounded-rank locus of generic, symmetric, alternating, or Hankel matrices. Thus $A$ is the quotient of a polynomial ring by a generic determinantal, symmetric determinantal, generic Pfaffian, or Hankel determinantal ideal. In each case there is a nested family of rank primes ${\mathfrak p}_1\supset {\mathfrak p}_2\supset\cdots\supset{\mathfrak p}_q$ and a standard-monomial basis whose shapes are diagrams with parts at most $q$. We isolate the common properties of these four straightening theories and use them to give a uniform treatment of products $D_σ={\mathfrak p}_{σ_1}\cdots{\mathfrak p}_{σ_s}$ in the quotient ring $A$, extending analogous results over suitable polynomial rings. In all four cases the shape $σ$ must have parts of size at most $q$. We determine their primary decompositions and associated primes in the rank-$q$ quotient, compute all symbolic powers with respect to the full set of associated primes, and prove that their symbolic Rees algebras are finitely generated. In the generic, symmetric, and alternating cases the respective symbolic Rees algebras are also normal, and Cohen–Macaulay. We also determine the asymptotic resurgence $\widehatρ$ and Waldschmidt constants of these ideals and prove they are related by $\widehatρ(D_σ)=α(D_σ)/\widehatα(D_σ)$.

fields
Commutative Algebra
pdf ↗ page arXiv:2611.19607 ↗

Let $I\subset S$ be an unmixed, codimension 2 ideal in a regular local ring, or an unmixed, codimension 2 ideal that is homogeneous in a positively graded polynomial ring over a field. We prove the statement of the title when $\pd_{S}(S/I) \leq 3$, and conjecture that this dichotomy holds in codimension 2 with any projective dimension.

comments
12 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2611.20186 ↗

Motivated by open questions of Kabbaj and Mimouni, we determine the position of full $t$-linkage among the standard classes of integral domains and its relationship with almost Krullness. Full linkage for a star operation is equivalent to cancellation in the monoid of all nonzero fractional star ideals. For the $t$-operation, this full cancellation law, denoted by $\mathrm{TCL}$, lies strictly between the $t$-almost Dedekind and completely integrally closed classes; on the $\mathrm{PvMD}$ locus, we recover the known $t$-almost Dedekind characterization. We prove that $\mathrm{TCL}$ and almost Krullness are incomparable. A monoid algebra arising from Reinhart's example satisfies $\mathrm{TCL}$ but is neither almost Krull nor a $\mathrm{PvMD}$. In the opposite direction, we construct a locally factorial almost Krull domain with a maximal ideal $0\ne M=M_t=(M^2)_t\subsetneq D$. For this domain the canonical locally divisorial operation $κ$ is cancellative and $κ_f=t$, but cancellation does not descend to $t$. In contrast, finite valuation patching proves that the Heinzer–Ohm and Arnold–Matsuda almost Krull non-$\mathrm{PvMD}$s satisfy $\mathrm{TCL}$ with $t<κ$; in the latter example $κ=v$. Class-monoid, residual, and support criteria identify the obstruction to descent. Thus the missing $t$-linkage node is governed by cancellation in the entire fractional $t$-ideal monoid, rather than by local Krullness alone.

comments
Comments are welcome!
fields
Commutative Algebra, Rings and Algebras
pdf ↗ page arXiv:2611.20599 ↗

Let $k$ be a field of characteristic zero, and let $n\geq 3$ be an integer. For $2\leq j\leq n-1$, let $a_j\in k$, and $g_j(x_j)\in k[x_j]\setminus k.$ We give two classes of simple and non-invertible $k$-derivations of $k[x_1,\ldots,x_n].$ The first class consists of the $k$-derivations $(1 +x_1^{m_2}x_2)\partial_{x_1}+x_1^{m_1}\partial_{x_2}+(a_2 x_3 +g_2(x_2))\partial_{x_3}+\cdots+(a_{n-1}x_n + g_{n-1}(x_{n-1}))\partial_{x_n},$ where $m_1$ and $m_2$ are two positive integers such that $m_2$ does not divide $m_1$. The second class consists of $k$-derivations $(1-x_2^α x_1^β)\partial_{x_1} +x_1^m\partial_{x_2}+(a_2 x_3 +g_2(x_2))\partial_{x_3}+\cdots+(a_{n-1}x_n + g_{n-1}(x_{n-1}))\partial_{x_n},$ where $α\geq 1,β\geq 1$ and $m\geq β+1$ are integers, under the assumption that $a_j=0,$ for all $2\leq j\leq n-1$ or deg$_{x_2}g_2(x_2)=1$.

comments
22 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2611.21018 ↗

Let $R=k[[x_1,\ldots,x_n]]$ be a formal power series ring over a field $k$ of characteristic zero, and let $\mathcal D=\mathcal D(R,k)$ be the ring of $k$-linear differential operators. We prove that if $\mathcal M$ is a nonzero left $\mathcal D$-module with $(0)\notin\operatorname{Ass}_R(\mathcal M)$, then $(0)\in\operatorname{Ass}_R D(\mathcal M)$, where $D(-)$ denotes Matlis duality, without assuming holonomicity or finite generation over $\mathcal D$. As a significant consequence of this result, we establish the Lyubeznik–Yıldırım conjecture in equicharacteristic zero. We also obtain a criterion for the Matlis dual of a $\mathcal D$-module to be non-holonomic.

fields
Commutative Algebra
pdf ↗ page arXiv:2611.21166 ↗

In this paper we prove that the pinched Veronese subalgebra $k [x^3,x^2y,xy^2,x^2z,xz^2,y^3,y^2z,yz^2,z^3] \subset k[x,y,z]$ has no Koszul filtration regardless of the field $k$, despite it being a Koszul algebra. We do this by showing that no ideal $(f,g)$ minimally generated by two linear forms can belong to a Koszul filtration. By the definition of a Koszul filtration this, in turn, implies that no Koszul filtration can exist.

fields
Commutative Algebra
pdf ↗ page arXiv:2611.21324 ↗

Group Theory10

We investigate complemented skew left braces, that is, skew braces in which every skew subbrace admits a complement. We establish that if every minimal subbrace of a finite skew brace is complemented, then the brace is supersoluble and all its skew subbraces of prime power order are elementary abelian. We also show that the converse does not hold in general, providing a finite counterexample. Furthermore, we prove that every subbrace of a finite direct product of square-free skew braces is complemented. Finally, we extend our investigation to the infinite setting, proving that every multipermutational complemented skew brace is hypercyclic and that all its skew subbraces whose additive groups are $p$-groups are elementary abelian.

comments
14 pages
fields
Group Theory
pdf ↗ page arXiv:2611.19369 ↗

We settle a long-standing problem by proving that every block-primitive combinatorial design is point-primitive. Since block-primitivity and point-primitivity coincide for symmetric designs by duality, it remains to treat the non-symmetric $2$-designs. For these we apply the O'Nan–Scott theorems for primitive and for quasiprimitive permutation groups and prove that the automorphism group of every such design is almost simple on points and on blocks. Together with the classification of finite simple groups, this classifies all non-symmetric block-primitive $2$-designs except for two families of block stabilizers in even characteristic. The exceptions are as follows. One family is of subfield type, $PSL_2(q_0)$ with $q=q_0^{d}$, $d\geq2$, of order below the dihedral point stabilizer $D_{2(q\pm1)}$, and includes $S_3\cong PSL_2(2)$ and $A_5\cong PSL_2(4)$. The other is the dihedral block stabilizer $D_{2(q-1)}$, where the block is a union of $a$ of the $q/2$ orbits, so that $v=q(q-1)/2$, $k=a(q-1)$ and $λ=2a(aq-a-1)/(q-2)$, the last an integer exactly when $(q-2)/2$ divides $a(a-1)$; this family is exhausted by finite enumeration except at the degrees beyond its range. We then determine which of these designs have strength $t\geq 3$. Apart from the inversive planes and the five Witt designs, exactly two Steiner families arise, attached to the exceptional maximal subgroups of $PGL_2(q)$. There is no non-complete design of strength $t\geq 6$.

comments
156 pages
fields
Group Theory
pdf ↗ page arXiv:2611.19398 ↗

We develop a framework for constructing simple alternating full groups A(G, X), associated with finite fragmentations of minimal expansive dihedral Cantor actions, with controlled orbital-graph codings and purely non-Hausdorff singularities. We also prove that positive entropy of a naturally labeled admissible orbital line forces exponential word growth of the acting group. As an application, we construct continuum many pairwise abstractly nonisomorphic, finitely generated, infinite, simple, torsion, amenable groups of exponential word growth. They arise as alternating full groups of fragmented minimal expansive dihedral Cantor actions with linearly repetitive generic regular orbital graphs and purely non-Hausdorff singularities. Under the same minimality, expansivity, linear repetitivity and singularity assumptions, if every finite clopen coding is determined by a bounded fragmentation window, the alternating full group has intermediate word growth.

comments
47 pages
fields
Group Theory, Dynamical Systems
pdf ↗ page arXiv:2611.19571 ↗

We prove that for every $k\ge 2$, the free group $\mathbb{F}_k$ on $k$ generators admits a finite generating set $S$ such that the Schreier graphing of the Bernoulli action of $\mathbb{F}_k$ with respect to $S$ does not admit spanning subgraphings that would approximate the cost of the action. In particular, this gives an example of a graphing that spans a treeable countable pmp equivalence relation, but does not admit a spanning subtreeing.

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

We prove that the simple unitary group $U_3(4)=\operatorname{PSU}_3(\mathbb{F}_4)$, of order $62400$, is the Galois group of a regular extension of $\mathbb{Q}(t)$, and hence of infinitely many extensions of $\mathbb{Q}$. The extension has four branch points, with inertia groups of orders $2$, $2$, $3$, $3$, and it is the only extension with these properties up to a rational change of the coordinate $t$. We give an explicit polynomial of degree $65$ for it.

comments
28 pages, 2 figures; the polynomials and the programs of the proofs are included as ancillary files
fields
Group Theory, Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2611.20383 ↗

We introduce new kinds of regular monoids of transformations consisting of mappings which preserve or reverse the orientation of a finite cycle.

journal
Semigroup Forum 58 (1999) 190 to 206
fields
Group Theory
pdf ↗ page arXiv:2611.20987 ↗

Fix a chain $X_n=\{1<\cdots<n\}$, where $n$ is a positive integer. The Catalan monoid $\mathcal{C}_n$ consists of all decreasing and order-preserving transformations of $X_n$, with function composition as the operation. For $β\in\mathcal{C}_n$, its centralizer is $C(β)=\{α\in\mathcal{C}_n:αβ=βα\}$. We characterize the elements of $C(\varepsilon)$, $C(μ)$, and $C(β)$, where $\varepsilon\in\mathcal{C}_n$ is an idempotent, $μ\in\mathcal{C}_n$ is a nilpotent, and $β\in\mathcal{C}_n$ is a general element. For an idempotent $\varepsilon\in\mathcal{C}_n$, we derive formulas for the cardinality of $C(\varepsilon)$, as well as formulas for the numbers of idempotents and nilpotents of $C(\varepsilon)$. We relate indexing sets arising in these formulas to Dyck paths and Narayana numbers. For a nilpotent $μ\in\mathcal{C}_n$, we present algorithms that construct $C(μ)$, its subset of idempotents, and its subsemigroup of nilpotents, thereby determining their cardinalities. We also describe the nilpotents whose centralizers consist only of idempotents, of nilpotents together with the identity, or of nilpotents and idempotents. We extend these descriptions to arbitrary elements of $\mathcal{C}_n$. To obtain our results, we represent $β\in\mathcal{C}_n$ as a sequence $\langle T_1,\ldots,T_m\rangle$ of rooted trees. The sets of vertices of the trees form a partition of $X_n$. Each tree is level-ordered, which means that it can be drawn in such a way that moving from the root down, level by level, from left to right at each level, we pass through an increasing sequence of consecutive elements of $X_n$.

comments
36 pages
fields
Group Theory, Combinatorics
pdf ↗ page arXiv:2611.21071 ↗

We prove that a finite group with average irreducible character degree less than $14/3$ is solvable if it has no chief factor isomorphic to $A_5$. This answers a question of Aziziheris and Eivazzadeh.

comments
10 pages
fields
Group Theory
pdf ↗ page arXiv:2611.21181 ↗

Thompson's group $V$ was introduced in 1965 as one of the first examples of an infinite finitely presented simple group. The Higman-Thompson groups $V_{k, r}$ naturally generalize $V$; they exhibit many of the same interesting properties and have been extensively studied in the literature. Monoid theoretic analogues $TV_{k, r}$, $PTV_{k, r}$, and $IV_{k, r}$ of the Higman-Thompson groups were first considered by Thompson, and published many years later in work of Birget. The monoid theoretic analogue of the symmetric group is the full transformation monoid, in that every monoid is isomorphic to a submonoid of some full transformation monoid. The analogous role for inverse monoids is played by the symmetric inverse monoid. Birget's three monoids $TV_{k, r}$, $PTV_{k, r}$, and $IV_{k, r}$ are to $V_{n, r}$ what the full, and partial transformation monoids, and the symmetric inverse monoid are to the symmetric group. The second author and De Witt recently showed that $TV_{k, r}$ is finitely presented. In this paper we show that the remaining two monoids $PTV_{k, r}$ and $IV_{k, r}$ are also finitely presented.

comments
33 pages, 1 figure, and 4 tables
fields
Group Theory, Rings and Algebras
pdf ↗ page arXiv:2611.21237 ↗

We prove an expansion theorem for direct powers of all nonabelian finite simple groups $G$ other than the alternating groups and the Suzuki groups ${}^2B_2(q)$. If $G^m$ is generated by $d\ge2$ elements, then $G^m$ has a symmetric generating multiset of at most $Cd$ elements and normalized spectral gap at least $C^{-1}d^{-\log_2 3}$, for an absolute constant $C>0$. In particular, this answers a question of Sabatini on $\mathrm{PSL}_2(\mathbb{F}_p)^p$. For $\mathrm{PSL}_2(\mathbb{F}_q)$, we use the expander graphs constructed by Lubotzky–Samuels–Vishne, and an amplification trick for direct powers; in high rank, we use the Ershov–Jaikin-Zapirain property (T) theorem.

comments
23 pages, 1 figure
fields
Group Theory, Combinatorics
pdf ↗ page arXiv:2611.21492 ↗

Complex Variables9

Let $X$ be a compact complex manifold. Using Bishop's extension theorem, we show that a meromorphic map, or more generally a meromorphic correspondence, $f\colonΔ^k_*\to X$ extends meromorphically across $0$ if and only if its graph has finite $2k$-dimensional volume near $\{0\}\times X$; equivalently, all mixed integrals $\intω_E^{k-m}\wedge(f^*ω)^m$, $1\le m\le k$, are finite. The criterion extends to arbitrary proper analytic subsets, and yields an energy criterion with a sharp exponent, a dichotomy for maps into Hopf manifolds, a rationality criterion for maps between projective manifolds, and, for $k=2$ and pluriclosed targets, the equivalence of extension with finiteness of the single integral $\int(f^*ω)^2$.

comments
15 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.18954 ↗

In 1977, Schmeisser proposed a strengthening of Sendov's conjecture: if all zeros of a polynomial $p$ of degree $n\ge2$ lie in the closed unit disk, then for every point $ξ$ in the convex hull of the zeros of $p$, there exists a critical point $ζ$ of $p$ such that $ |ξ-ζ|\le 1.$ We prove this conjecture in every degree. The proof combines a covering of the convex hull by diameter disks, inequalities for reflected polynomials, and quantitative estimates for centred products, supplemented by rigorous computer-assisted verification in a finite range of degrees.

comments
34 pages, 3 figures
fields
Complex Variables
pdf ↗ page arXiv:2611.19084 ↗

The existence of a complex structure on $\sfS^{6}$ implies that of strictlty pseudoconvex structures on $\sfS^{5}$ which can be turned inside out by a homotopy.

comments
4 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.19396 ↗

We characterize boundedness and compactness of weighted composition operators $W_{u,\varphi}:Q_{p_1}\to Q_{p_2}$, where $W_{u,\varphi}f=u(f\circ\varphi)$, $p_1>0$, and $0<p_2<1$. A separation theorem for the two terms in $(W_{u,\varphi}f)'$, together with value and derivative embedding theorems, gives two capacity conditions on $u$ and $\varphi$. For $p_1=1$ and $p_1>1$, the derivative condition has a maximal-integral and an area-integral form respectively.

fields
Complex Variables
pdf ↗ page arXiv:2611.20096 ↗

Let $E_n$ be $α_n$-uniformly perfect compact sets that converge to a compact set $E$ in the Hausdorff distance $d_n=d_H(E_n,E)$. We prove that the logarithmic capacity of $E_n$ converges to that of $E$ whenever $\log(1/α_n)=O(\log(1/d_n))$ and that no factor tending to infinity can be inserted in this bound. A common energy-transfer theorem also yields Hausdorff continuity of Riesz capacity under local capacity bounds, including bounds obtained from lower Hausdorff content density. Finally, we correct our earlier claims about the uniform convergence of Green functions.

comments
11 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.20215 ↗

In their paper on non-coercive boundary value problems, Kohn and Nirenberg show that a priori estimates for all forms satisfying $\bar{\partial}$-Neumann boundary conditions follow from a compactness estimate. Inspired by Hamilton, we show that these a priori estimates are stable under deformations of the complex structure, the hermitian metric and the volume form of the underlying manifold. We use a parameter $m$ to encode a deformation of this data. We show that if a family of $\bar{\partial}$-Neumann problems depends smoothly on $m$ and the compactness estimate(s) hold (with constants uniform in $m$), then the family of solution operators also depends smoothly $m$. As a consequence we obtain sufficient conditions for the Bergman kernel to vary smoothly in a family of domains. We also provide a sufficient condition for the uniform compactness estimate(s) to hold in a family of domains.

fields
Complex Variables
pdf ↗ page arXiv:2611.20249 ↗

In this note we develop the notion of a meromorphic mapping between infinite-dimensional complex manifolds. We restrict ourselves with second countable Hilbert manifolds modelled on a separable Hilbert space.

fields
Complex Variables
pdf ↗ page arXiv:2611.21182 ↗

Let $X$ be a compact embeddable strictly pseudoconvex CR manifold with Reeb field $T$ and Szeg\H o projection $Π$. Herrmann, Hsiao, Marinescu and the second author showed, for any volume form, that the semi-classical cut-offs $χ(k^{-1}ΠPΠ)$ of first-order elliptic self-adjoint Toeplitz operators have full asymptotic expansions. For $P=-\sqrt{-1}T$ and $T$-invariant volume forms, Chang, Herrmann and Hsiao showed that the diagonal coefficients are $a_{j}\intχ(t)t^{n-j}dt$ with local invariants $a_{j}$, computed $a_{0}$ and $a_{1}$, and used normal forms in the Sasakian case. We add one step: on a compact Sasakian manifold, regular or not, $a_{j}=a_{j}(g^{T})/(2π^{n+1})$, where $a_{j}(\cdot)$ is the universal Bergman kernel polynomial and $g^{T}$ the transverse Kähler metric; no line bundle on $X$ is needed. This gives an exact correspondence: the logarithmic term of the Szeg\H o kernel vanishes to infinite order over an open set if and only if $a_{j}(g^{T})=0$ there for all $j\ge n+1$, which for circle bundles is a local form of the theorem of Lu and Tian with its converse. For $(n,0)$-forms on complete Sasakian manifolds, a cut-off by the self-adjoint generator of the Reeb flow, which avoids the self-adjointness question for the Toeplitz operator, gives the same results with twisted coefficients.

comments
33 pages. Comments are welcome!
fields
Complex Variables, Analysis of PDEs, Differential Geometry, Spectral Theory
pdf ↗ page arXiv:2611.21343 ↗

It is well known that the symmetrized bidisc $\mathbb{G}_2$ is star-like about the point $(0,0)$. In our attempt to check if there are other points about which $\mathbb{G}_2$ is star-like, we find that $\mathbb{G}_2$ cannot be starlike about any point $(s,p)\neq(0,0)\in \mathbb{G}_2$.

fields
Complex Variables
pdf ↗ page arXiv:2611.21527 ↗

General Mathematics7

For $0<q<1$, we study (q)-completely monotone and q-Bernstein functions defined by the Jackson derivative. We establish the positive linear closure of the latter class and prove an integral characterization of q-Bernstein functions continuous at zero on a geometric lattice. The representing measures satisfy the natural Lévy integrability condition, and the corresponding integral kernels are positive semidefinite. We prove that classical completely monotone and Bernstein functions belong to the respective q-classes and examine composition with absolutely monotone functions. Explicit examples show the limits of product closure, composition, and definiteness with respect to ordinary addition.

journal
Journal of Applied Mathematics, Statistics and Informatics 10 (2014), no. 2, 43-50
fields
General Mathematics
pdf ↗ page arXiv:2611.18683 ↗

We exemplify the applicability of the rational wave numbers by formulating the relativistic Dirac equation on the discrete sequence space $\mathbb{H}^\mathbb{Z}$ over the quaternions $\mathbb{H}$ and demonstrating how this resolves fundamental issues relating to Dirac's equation. Generating $\mathbb{H}^\mathbb{Z}$ from the primitive basis $\mathcal{P}_0 = \{E_Z, E_{\bar{1}}\}$ as both a static closure and a dynamic enumeration, we show that coupling local quantum kinematics with global cosmological expansion leads to the following results: (1) Dirac 4-spinors and the Clifford algebra $\mathrm{C}\ell_{1,3}(\mathbb{R})$ emerge from the second Cayley–Dickson doubling (biquaternions $\mathbb{H} \otimes \mathbb{C}$); (2) under dynamic generation on an integer clock lattice with causal horizon $Λ_m$, relativistic difference operators require temporal depth, establishing clock beat $m = 2$ as the universal Matter Genesis Threshold; (3) the Nielsen–Ninomiya fermion doubling barrier is circumvented on modular sequences $\mathbb{Z}/Q\mathbb{Z}$ because candidate zone-edge doubler modes ($p = Q/2$) are actively pruned at the generational boundary by the coprime sieve projector $\mathcal{S}_Q$ ($\gcd(Q/2, Q) > 1$), preserving exact chiral symmetry without Wilson terms; (4) the discrete fermionic Green's function $S_Q(n, m)$ possesses no coincident-point singularity ($n = m$), converting ultraviolet loop integrals into finite Dedekind and Kloosterman character sums, realizing Dirac's demand for an infinity-free theory; and (5) Zitterbewegung is resolved as an observable stroboscopic beat against vacuum reference $E_Z$, identifying rest mass $m_0$ as a vacuum coupling beat frequency for stationary periodic cycles on the saturated quotient graph.

comments
26 pages
fields
General Mathematics
pdf ↗ page arXiv:2611.18691 ↗

Many scheduling problems need many different feasible timetables, and a view of how much freedom each event has. We study a Las Vegas algorithm that samples satisfying assignments of a Boolean formula one variable at a time: it draws each value from an estimate of its conditional probability, propagates, and restarts on a contradiction. Every output is a checked solution and comes with the exact probability of producing it. We prove that a run succeeds with probability at least $2^{-K}$, where $K$ is the expected Kullback–Leibler divergence between the true and estimated conditional probabilities along the run of a uniform solution. We also bound the distance of the outputs from uniform from the samples alone; it is a divergence in the opposite direction to $K$, so a sampler can succeed more often while being farther from uniform. On generated timetabling instances counted exactly, belief propagation on the timetabling problem brings $K$ to at most about one bit, and the estimated counts are within 2% of the exact ones. On a real university instance of the International Timetabling Competition 2019, rerunning only the failed runs delivered all 72 requested timetables with each of two estimators. Belief propagation succeeds in 31% of runs. Steered by a Markov chain that carries a nearly feasible timetable, it succeeds in 65% of runs, with outputs at least 300 bits from uniform. There the importance weights are too uneven to estimate the number of timetables, and we certify a lower bound instead. For random 3-SAT, an estimator whose $K$ grows logarithmically would give a polynomial-time Las Vegas algorithm beyond the densities at which any algorithm is proved to succeed; we conjecture that one exists below the satisfiability threshold.

fields
General Mathematics
pdf ↗ page arXiv:2611.18720 ↗

In SET, each card has four properties with three values each, and three cards form a \emph{set} when every property is all the same or all different. We prove that the maximum number of sets among $13$, $14$, $15$, and $16$ cards is $16$, $19$, $23$, and $26$, respectively. Viewing cards as points of $\mathbb{F}_3^4$ and sets as lines, we show that a configuration that leaves one of the $40$ line directions of $\mathbb{F}_3^4$ unused projects into $\mathbb{F}_3^3$ without losing a set, which reduces the problem to three properties, where exhaustive search is feasible. We force an unused direction by counting repeated directions in the planes through a card on many sets, and treat configurations containing a magic square separately.

comments
4 pages, 2 figures
fields
General Mathematics
pdf ↗ page arXiv:2611.18722 ↗

Let $R$ be a commutative Krasner hyperring with identity and $M$ an $R$-hypermodule. We consider the prime spectrum $\operatorname{Spec}_R(M)$, consisting of all prime subhypermodules of $M$. In this paper, we introduce a Zariski topology on $\operatorname{Spec}_R(M)$ and investigate its fundamental topological properties, including irreducibility, connectedness, compactness, and separation axioms, providing necessary and sufficient conditions for each. In particular, we prove that $\operatorname{Spec}_R(M)$ is irreducible if and only if the nilradical of $M$ is a prime hyperideal, and that it is connected precisely when the underlying hyperring is not a nontrivial direct product. We further investigate the functoriality of the Zariski topology in the category of Krasner hyperrings and hypermodules. Moreover, using the fundamental relation $ε^{*}$, the smallest regular relation on $M$ for which the quotient $\overline{M}=M/ε^{*}$ becomes an $\overline{R}=R/Γ^{*}$-module, we establish a correspondence between the Zariski topologies of $M$ and $\overline{M}$. We show that this correspondence is functorial and thereby relate the hypermodule-theoretic setting to the classical theory of modules over rings.

comments
14 pages; No photo
fields
General Mathematics
pdf ↗ page arXiv:2611.18726 ↗

A strict unit-triangle configuration is a finite connected family of closed equilateral unit triangles in which distinct triangles are disjoint or meet at a common vertex, and no vertex belongs to more than two triangles. A vertex belonging to exactly one triangle is a pole. We prove that every strict configuration with one or two poles contains at least fourteen triangles, a sharp bound for two poles attained by the double kite and the reverse double kite. A strict four-regular configuration whose contact graph has an edge cut of size at most two contains at least twenty-eight triangles. A decomposition into three strict two-pole components requires forty-two triangles; both known ring constructions attain the bound. The proof reduces minimal counterexamples to two-connected contact graphs, applies area bounds to complementary unit-sided polygons, and excludes the remaining cases by exact angle certificates. The supplement contains 13,668 stored marked records, 233 exclusion certificates, a standard-library verifier, and independent checks of the complete enumeration.

comments
15 pages, 6 figures, 2 tables. The complete computational supplement, including enumeration data, exact exclusion certificates, independent verification programs, and reproducibility instructions, is available on Zenodo at https://doi.org/10.5281/zenodo.24093082
fields
General Mathematics
pdf ↗ page arXiv:2611.18742 ↗

We introduce three families of discrete hyperbolic cosecant probability distributions, supported either bilaterally on $\mathbb{Z}$ or unilaterally on $\mathbb{N}_0$, inspired by series evaluations of Srinivasa Ramanujan. We determine their exact normalization constants in terms of singular values of complete elliptic integrals and the Gaußian constant $G=\varpi/π$ with the lemniscate constant $Γ^2(1/4)/(2\sqrt{2π})$ by explicitly calculating some series, e.\,g. $$ \sum_{κ\in \mathbb{Z}} 2κ\operatorname{cosech}(κπ) = G^2 + \frac{1}π. $$ Furthermore, by connecting these distributions to Fourier transforms of powers of the hyperbolic secant and applying the Poisson summation formula, we obtain closed-form evaluations for even moments and hyperbolic secant lattice sums, e.\,g. $$ \sum_{k \in \mathbb{Z}} \mathrm{sech}^4(k π) = \frac{2}{3} \left(G^4 + G^2 + \frac{1}π\right). $$ This machinery proves conjectures on lattice sums arising in electrostatics proposed by Vigren and Dieckmann (Symmetry, 2020).

comments
23 pages, 3 tables
fields
General Mathematics
pdf ↗ page arXiv:2611.18913 ↗

Spectral Theory7

We construct thin planar domains on which the Dirichlet and the Neumann Pólya inequalities both hold strictly. For the neighborhoods of a given finite connected embedded polygonal graph (branches and cycles are allowed) there is a single radius threshold below which both inequalities hold for every eigenvalue index. We also show that every nonempty bounded connected open set in the plane can be approximated, in measure and in the Hausdorff distance, by smooth simply connected domains satisfying both inequalities. Along the same sequence, the first Dirichlet eigenvalue tends to infinity, while each Neumann eigenvalue of fixed positive index tends to zero. In the special case of rectangular frames our estimates lead to explicit sufficient conditions, with no restriction on the aspect ratio.

comments
28 pages
fields
Spectral Theory, Differential Geometry
pdf ↗ page arXiv:2611.19186 ↗

We study the wave operators for a Jacobi matrix whose spectral measure satisfies the Szegő condition. We formulate a sufficient condition in terms of the associated Verblunsky parameters and show that it is sharp.

fields
Spectral Theory, Mathematical Physics, Analysis of PDEs, Classical Analysis and ODEs, Complex Variables
pdf ↗ page arXiv:2611.19545 ↗

We study the echolocation problem: whether local spectral data determine a point up to isometry. We characterize cospectrality by the existence of a spectral symmetry exchanging the two point evaluations and introduce a pointwise analogue of Sunada's method for constructing such symmetries. This yields cospectral, non-similar points on closed hyperbolic surfaces of every genus at least three and on round lens spaces. We also obtain Neumann examples on a scalene triangle and on a planar slit domain, and reinterpret a known Dirichlet example of Dixon, Miah, Safronov, Snyder, Vakaryuk, and Wyman through the same framework.

comments
21 pages
fields
Spectral Theory, Differential Geometry
pdf ↗ page arXiv:2611.20007 ↗

We introduce the notion of regularized (or renormalized) Ray-Singer analytic torsion on odd dimensional convex-cocompact hyperbolic manifolds. We prove that the leading asymptotic along a certain sequence of representations is a constant multiple of a regularized volume extending the classical results which hold for finite volume hyperbolic manifolds possibly with singularities. Furthermore, we establish some of the functional equations, including Fried type identity, also extending the identities on finite volume hyperbolic manifolds.

comments
66 pages, 1 figure
fields
Spectral Theory
pdf ↗ page arXiv:2611.20716 ↗

The Schrödinger operator in one dimension is considered. When the electric potential has a linear/V-shaped well, an approximation of the ground-state is established at fixed distance from the well. In this situation, the classical WKB analysis and the localization techniques à la Agmon near a non-degenerate minimum do not work. We propose an alternative to the WKB analysis better suited to the shape of the well and we prove that our Ansatz is an exponentially good approximation by means of revisited (and simplified) Agmon estimates.

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

We disprove a decade-old conjecture about a spectral stability of Schroedinger operators with potentials which are small in a subordination sense. Our counterexample is based on a complex perturbation of a critical attractive square well.

comments
6 pages
fields
Spectral Theory
pdf ↗ page arXiv:2611.21141 ↗

We prove the ten martini theorem for a large class of monotone potentials. The key strategy is to establish polynomially large gaps for periodic approximations.

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

Category Theory6

Let $g_x$ be the Balmer-Favi idempotent at a point $x$ of the spectrum of a rigidly-compactly generated tensor triangulated category. We study the equality $\operatorname{Cosupp}(g_x)=\operatorname{gen}(x)$ by expressing $g_x$ as a local dual. We prove the equality for the derived category of a Noetherian scheme and for the stable module category of a finite group scheme over a field of positive characteristic. For $E(n)$-local spectra we express the maps between distinct monochromatic layers of the sphere in terms of the chromatic fracture square. The height-two splitting gives the equality through height two at every prime. For a Noetherian local ring we characterize the Gorenstein property by the form of its closed-point idempotent.

comments
11 pages
fields
Category Theory, Commutative Algebra, Algebraic Topology
pdf ↗ page arXiv:2611.19221 ↗

We prove that the zero-identity Boolean category of Došen and Petrić, freely generated by a nonempty set of propositional variables, is maximal. Adjoining any equation between parallel morphisms that does not follow from the defining equations, and closing under the operations on morphisms and uniform formula substitution, collapses this category to a preorder. This disproves their conjecture that the category is not maximal. The proof uses Boolean Coherence to select a pair of variable occurrences on which the two morphisms differ. Composition with morphisms selecting these occurrences, uniform substitution and two isomorphisms yield equality of the product projections. We prove that any zero-identity Boolean category satisfying such an additional equation under every interpretation of the variables is a preorder. We also give a Lean formalization of these proofs and their dependencies. It includes Boolean Coherence and the correspondence between substitution on tagged occurrence sets and substitution on finite ordinals.

fields
Category Theory, Logic
pdf ↗ page arXiv:2611.19496 ↗

We study the Dedekind-MacNeille completion through representable functors on the wide subcategory $\mathbf{Pos}_{\mathrm{cl}}$ of posets and lower cut-continuous (closed) maps. On this category the completion is contravariantly functorial and naturally isomorphic to $\mathrm{Hom}_{\mathbf{Pos}_{\mathrm{cl}}}(-,[1])^{\mathrm{op}}$, via $A\mapstoχ_A$ and its inverse $f\mapsto f^{-1}(\{0\})$. The naturality of this identification makes the Yoneda lemma applicable: uniqueness of the representing object and the endomorphism monoid of the completion follow formally. We also show that $\mathbf{CLat}_\vee$ is full in $\mathbf{Pos}_{\mathrm{cl}}$, that $\mathbf{CLat}_\wedge$ is equivalent to a full subcategory of $\mathbf{Pos}_{\mathrm{cl}}^{\mathrm{op}}$, and that the covariant adjunction refines to a $2$-adjunction whose idempotent monad has Eilenberg–Moore algebras equivalent to $\mathbf{CLat}_\vee$.

comments
10 pages
fields
Category Theory, Rings and Algebras
pdf ↗ page arXiv:2611.19599 ↗

This note develops a provisional admissibility framework for Aharonov-Bohm type arbitrage. Starting from a categorical filtration $F:\mathcal T_{\mathrm{mic}}^{\mathrm{op}}\to \mathsf{Prob}$ and its distortion on microscopic histories, we ask when a favorable closed microscopic loop can be realized as an executable relative ordinal arbitrage over an open macro-time interval. The history endofunctor $\mathsf{Hist}$ retains the staged decomposition of economic activities, while the twisted-arrow category $\operatorname{Tw}(\mathsf{Hist}(\mathcal T_{\mathrm{mic}}))$ represents a microscopic loop as an arrow between distinct histories. An observable clock $Π: \mathsf{Econ} \to \mathcal T_{\mathrm{mac}}$ and a microscopic realization functor $J: \mathsf{Hist}(\mathcal T_{\mathrm{mac}}) \to \operatorname{Tw}(\mathsf{Hist}(\mathcal T_{\mathrm{mic}}))$ connect economic histories with their microscopic geometry. Executability is treated separately through configuration histories, capacity constraints, observations, and policies. This yields pathwise and almost-sure notions of execution. A finite foreign-exchange model illustrates stochastic execution, capacity failure, terminal settlement, and comparison with a benchmark strategy. A parameterized finite filtration is constructed whose nontrivial statewise distortion agrees exactly with the relative FX settlement multiplier. Hence the resulting filtration–policy model satisfies the bridge $V_*(π^q)=dF(γ)V_*(π^p),$ and, under order compatibility, realizes relative ordinal arbitrage. The remaining problem is to identify the filtration parameters from independent market primitives and to study stability under refinement.

comments
26 pages
fields
Category Theory
pdf ↗ page arXiv:2611.19870 ↗

A metric compact Hausdorff space is a Lawvere metric space equipped with a compatible compact Hausdorff topology (which does not need to be the induced topology). These spaces maintain many important features of compact metric spaces, but the resulting category is much better behaved. We prove that the category of separated metric compact Hausdorff spaces is dually equivalent to a variety of infinitary algebras.

fields
Category Theory
pdf ↗ page arXiv:2611.20113 ↗

Our goal in this paper is to work towards developing a framework for characterizing dualities of weak categorical structures. It is often the case that duality involutions are characterized by relations which are more general than $f^2=1$. Moreover, it is also true that many dualities cannot be expressed using involutions alone. We develop a framework of relative involutions and relative inverses to express these dualities at least within categorical and bicategorical structures. In particular, we utilize this framework to express the dualities of virtual double categories and some important constructions on them. In the second part, we explore the problem of slicing and consider how dualities of monoidal structures interact with slice constructions. We end by providing a construction for both enriched slice model categories and enriched coslice model categories.

fields
Category Theory
pdf ↗ page arXiv:2611.20350 ↗

K-Theory and Homology5

We give an explicit formula for the conductors of the primitive idempotents of fibered Burnside algebras of finite rank. This formula generalizes previous results for Burnside rings, monomial representation rings, and cyclic fibers, removing the coprimality condition required in the latter case. We also derive some consequences for cyclic fiber groups and $p$-groups.

fields
K-Theory and Homology
pdf ↗ page arXiv:2611.18875 ↗

We study finite-summability of unbounded representatives of $K$-homology classes for crossed-product $C^*$-algebras associated with actions on compact spaces. Using Kasparov's Dirac–dual-Dirac method, we isolate geometric conditions on the $γ$-element under which elements of $K$-homology can be transferred to a crossed product associated with a proper action and represented by finitely summable unbounded cycles defined from Dirac-type operators with an unbounded potential. We relate finite-summability of these operators to integrability properties of the potential by spectral estimates for Schrödinger operators on manifolds of bounded geometry. In particular, for finitely generated nilpotent groups this leads to finitely summable, unbounded representatives of all $K$-homology classes. We also give examples showing that representability of $K$-homology classes by finitely summable unbounded cycles is not invariant under $KK$-equivalence.

comments
28 pages
fields
K-Theory and Homology, Operator Algebras, Spectral Theory
pdf ↗ page arXiv:2611.19583 ↗

We introduce the notion of an \(\ell^p\)-Busemann space, which is a complete Busemann convex geodesic metric space whose tangent cones admit uniformly controlled homogeneous bi-Lipschitz embeddings into \(\ell^p\)-spaces. An \(\ell^p\)-Busemann space is called admissible if it contains dense sequences of closed convex subsets isometric to certain Finsler manifolds. We then prove that the rational coarse Novikov conjecture holds for proper metric spaces with bounded geometry that admit coarse embeddings into admissible \(\ell^p\)-Busemann spaces.

fields
K-Theory and Homology, Metric Geometry
pdf ↗ page arXiv:2611.19678 ↗

We construct equivariant Callias classes on the Borel–Serre space of a Hilbert modular group and prove a Kasparov product formula. For torsion-free normal congruence subgroups and twists by powers $m_j\geq2$ of the holomorphic cotangent line bundles, we identify the image of the maximal higher index in the representation ring of the finite quotient with the equivariant index of the cuspidal Dolbeault operator on total forms. The comparison uses a Fredholm homotopy that separates an invertible noncuspidal block. As an application, we compute the $A_5$-equivariant index on the principal level-two Hilbert modular surface over $\mathbb Q(\sqrt5)$ for all parallel powers $m\geq2$. The resulting class in $R(A_5)$ is $15$-periodic in $m$ and has virtual dimension four. We express this class as an alternating sum of Hilbert cusp-form representations and deduce dimension identities for the full Hilbert modular group.

fields
K-Theory and Homology
pdf ↗ page arXiv:2611.21192 ↗

In this note, we explain the circle action on the Hochschild homology of categories of sheaves and their admissible subcategories in terms of the six-functor formalism using factorization homology, including (quasi-)coherent sheaves on derived stacks, sheaves on manifolds with prescribed microsupports, and Tamarkin categories with prescribed microsupports. We also explain the Gysin sequence for $C_\ell$ and $S^1$-(co)invariants and the Künneth sequence for $S^1$-(co)invariants of the Hochschild homology relative to any complex-oriented symmetric monoidal category.

comments
38 pages. Comments are welcome!
fields
K-Theory and Homology, Algebraic Geometry, Algebraic Topology, Symplectic Geometry
pdf ↗ page arXiv:2611.21205 ↗

Metric Geometry5

We prove for any parameter $p \geq 1$ that the $p$-Wasserstein space $\mathcal{W}_p(X,d_X)$ of a generic compact metric space $(X,d_X)$ is isometrically rigid, that is, its isometries are precisely the push-forwards of the isometries of $(X,d_X).$ We also study the question whether the isometry class of a $p$-Wasserstein space completely determines the isometry class of the underlying space. We prove for any $p\geq 1$ that for a generic compact metric space $(X,d_X),$ its $p$-Wasserstein space $\mathcal{W}_p(X,d_X)$ is isometric to another $p$-Wasserstein space $\mathcal{W}_p(Y,d_Y)$ if and only if $(Y,d_Y)$ is isometric to $(X,d_X).$ En route we prove that a stronger property, which we call the Dirac preservation property, is also generic.

comments
22 pages
fields
Metric Geometry, Functional Analysis, Probability
pdf ↗ page arXiv:2611.19372 ↗

A polygon inscribed in one circle and circumscribed about another moves in a one-parameter family, by Poncelet's porism. We study this family through the tangent lengths from the vertices to the inner circle and find a number of quantities that remain constant during the motion. For example, the sum of the fourth powers of the distances from the circumcenter to the points of contact, plus twice the squared area, is constant. We also obtain a version of Euler's formula for $n$-gons, extend a problem on bicentric hexagons from Kvant, and find a second quadratic invariant that goes along with the classical theorem of Weill. The basic invariants have elementary proofs; for the main ones we give two proofs, one of them without derivatives. Reciprocation at a limiting point of the two circles turns these results into statements about billiards in ellipses, and gives short proofs of theorems of Akopyan, Schwartz and Tabachnikov and of Bialy and Tabachnikov. Using the elliptic curve of the family, we show that the area determines the polygon up to a reflection, find the polygons of largest and smallest area, which proves two conjectures of Cieślak and Mozgawa, and find all points for which the product of the distances to the vertices is constant.

comments
35 pages, 2 figures, all comments are welcome
fields
Metric Geometry
pdf ↗ page arXiv:2611.20477 ↗

We prove that every sequence of iterated Steiner symmetrals of a convex body converges in shape. That is, every such sequence can be corrected by a sequence of rotations to achieve convergence in Hausdorff distance. Moreover, for a fixed corresponding family of subspaces, the same rotations can be used for every initial convex body, and their successive increments can be chosen to be square-summable.

comments
comments welcome!
fields
Metric Geometry
pdf ↗ page arXiv:2611.21167 ↗

For any $\varepsilon>0$ we construct a continuous motion of a line segment in the plane, such that the center point of the line segment traverses a given bounded set except for a subset of area less than $\varepsilon$, while the rest of the line segment sweeps only an area less than $\varepsilon$. We further show that a circle with a pair of antipodal points removed has the Strong Kakeya Property in the plane: that is, given any two copies of such a punctured circle, we can continuously move one to the other, while staying in a set of arbitrarily small Lebesgue measure. We give a full characterization of those subsets of a great circle that have this property on the sphere. We also show how the first mentioned result can be applied to obtain discontinuity results about the area swept by continuously moving objects.

comments
19 pages
fields
Metric Geometry, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.21316 ↗

We prove the Reinhardt conjecture: among centrally symmetric convex disks in the plane, the smoothed regular octagon has the least optimal lattice packing density, and equality holds precisely for its nonsingular affine images. The proof combines explicit bounds on the number of control arcs, local cost inequalities and rigorous finite verification of the remaining switching types.

comments
The purpose of this paper is to show that the conjecture can be resolved. The present proof is long, and the author hopes that further work will lead to a shorter and more beautiful proof
fields
Metric Geometry, Optimization and Control
pdf ↗ page arXiv:2611.21470 ↗

Quantum Algebra5

Field algebras, introduced by Bakalov and Kac, generalize vertex algebras by replacing locality with a weaker associativity-type axiom. We develop the structure theory of field algebras with a view toward geometric examples in which a natural bilinear form fails to be symmetric. We prove a reconstruction theorem for field algebras, producing a field algebra structure from a generating family of fields. We associate to every finite-rank lattice $L$ equipped with an arbitrary bilinear form a canonical field algebra $V_L$, generalizing the Heisenberg and lattice vertex algebras. We then study potential definitions of commutants in this setting and analyze when they are realized as subfield algebras. Finally, we realize these constructions geometrically by looking at the homology of the moduli stack of complexes of quiver representations, extending previous results from Dominic Joyce.

comments
33 pages
fields
Quantum Algebra, Algebraic Geometry
pdf ↗ page arXiv:2611.18762 ↗

We prove Schlösser's conjecture relating quantum FII spherical functions to Askey–Wilson polynomials for equal left and right coideal parameters and determine the corresponding radial operator. An explicit transport formula gives the shifted restrictions for arbitrary nonzero parameters.

fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2611.19024 ↗

Let $V$ be a vertex operator algebra. For every weak $V$-module $W$, we construct a weak $V \otimes V$-module $\mathcal{R}(W)$ representing the bifunctor $\mathcal{I}\binom{W}{-\;-}$ of intertwining operator spaces, in the sense that there exists a natural isomorphism \[ \mathcal{I}\binom{W}{-\;-} \cong \Hom_{V\otimes V} \ab\big(-\otimes -, \; \mathcal{R}(W)). \] As applications of this natural isomorphism, we first establish a Yoneda-type lemma for spaces of intertwining operators, and then identify the unique largest locally restricted submodule $\mathcal{R}_{\lr}(V^\prime)$ of $\mathcal{R}(V^\prime)$ with the coend of the bifunctor $-\otimes-^\prime$: \[ \mathcal{R}_{\lr}(V^\prime) \cong \int^{M} M \otimes M^\prime, \] where $M$ ranges over restricted $V$-modules. Finally, the connection between $\mathcal{R}(W^\prime)$ and the regular representation $\mathfrak{D}_ξ(W)$ constructed in \cite{Li02} is established, where $ξ\in \C^{\times}$. In particular, if $V$ is a $C_2$-cofinite vertex operator algebra and $W$ is a restricted $V$-module, then $\mathcal{R}(W^\prime)$ is also a restricted $V \otimes V$-module and is canonically isomorphic to $\mathfrak{D}_ξ(W)$.

comments
47 pages
fields
Quantum Algebra, Category Theory
pdf ↗ page arXiv:2611.20048 ↗

We give new relations in the kernel of the foam evaluation. As a consequence we obtain categorifications of all the Kelulé relations introduced by Morrison. Along the way, we discover an equivalent set of relations for which we provide categorifications as well.

comments
41 pages, many figures, comments welcome
fields
Quantum Algebra, Geometric Topology, Representation Theory
pdf ↗ page arXiv:2611.20184 ↗

We construct a rank-$m$ Nazarov-Sklyanin Lax operator for generalized Macdonald functions. The operator acts on the horizontal Fock module of quantum toroidal $\mathfrak{gl}_1$, extended by an auxiliary polynomial space with $m$ components. A geometric realization is given by the tensor product with the dual tautological line on the equivariant $K$-theory of a Hecke correspondence studied by Negut. The eigenbasis is indexed by an $m$-tuple of partitions and an addable corner, whose content is the eigenvalue. We give an anti-normal factorization and prove that the Lax operator is self-adjoint for the transported Euler pairing. With unit framing weight, the rank-one specialization recovers the Nazarov-Sklyanin factorization. We then show that the Lax operator is conjugate to the companion matrix of a projected q-Miura operator of the deformed $W$-algebra of type $\mathfrak{gl}_m$. This also gives an explicit presentation of the $K$-theory of the Hecke correspondence.

comments
40 pages
fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2611.20373 ↗

Symplectic Geometry4

We study Gutt–Hutchings capacities with finite cyclic coefficients and show that torsion in positive $S^1$-equivariant symplectic homology detects new obstructions to symplectic embeddings between convex toric domains. Prime-field coefficients give no additional obstructions in this class, while the torsion responsible for the new obstructions already appears over $\mathbb Z/p^{p+2}$ for every prime $p$. We prove a stabilization theorem for these capacities on convex bodies with arbitrary commutative coefficients, yielding a sharp stabilized embedding obstruction in an explicit example. Clarke duality makes these phenomena accessible to computation. We extend the filtered equivariant Clarke–Floer comparison to arbitrary commutative coefficient rings and compute the capacities using models of dual action sublevels built from representation spheres. The circle-action weights encode orbit covering multiplicities, whose products govern the new obstructions.

comments
29 pages, 4 figures
fields
Symplectic Geometry, Differential Geometry
pdf ↗ page arXiv:2611.20238 ↗

In this article, we continue our study of equivariant symplectic capacities of open sets in a cotangent bundle defined via the Chiu-Tamarkin complex constructed from the microlocal theory of sheaves. The paper consists of two parts: 1) We develop the theory of $S^1$-equivariant Chiu-Tamarkin complex over complex-oriented ring spectra. 2) Applications of the theory to symplectic capacities: We show that a product formula for the capacities, whose Ekeland-Hofer capacities version is folklore since 1988, is not true via an (uncountable family of) counterexample(s). The counterexample (family) is the product of a concave toric domain of dimension $6$ ($2n\geq 6$) and a $2$-dimensional disk. We also prove a Weyl law of the capacities for all toric domains in dimension $2n$. The algebraic verification is based on a chain model for the Chiu-Tamarkin complex of all toric domains in $\mathbb{R}^{2n}$, which recovers Irie's conjectural chain model of $S^1$-equivariant symplectic homology for star-shaped toric domains (defined only) in $\mathbb{R}^4$.

comments
104 pages, 6 figures. Comments are welcome!
fields
Symplectic Geometry, Algebraic Topology, K-Theory and Homology
pdf ↗ page arXiv:2611.21220 ↗

We study Belavin–Drinfeld Poisson bivectors $π_{(\bar{\mathbfΓ}^r,\bar{\mathbfΓ}^c)}$ on $\operatorname{Mat}_{n\times m}(\mathbb{C})$ from the perspective of Poisson deformation theory. We prove that the log-canonical part $π_0$ of $π_{(\bar{\mathbfΓ}^r,\bar{\mathbfΓ}^c)}$ is $\mathbb{T}_{(\mathbfΓ^r,\mathbfΓ^c)}$-log-symplectic if and only if the pair $(\mathbfΓ^r,\mathbfΓ^c)$ of Belavin–Drinfeld triples is aperiodic. In this case, we show that $π_{(\bar{\mathbfΓ}^r,\bar{\mathbfΓ}^c)}$ is a maximal $\mathbb{T}_{(\mathbfΓ^r,\mathbfΓ^c)}$-invariant Poisson deformation of $π_0$, and we construct a $\mathbb{T}_{(\mathbfΓ^r,\mathbfΓ^c)}$-equivariant Poisson birational map between $(\operatorname{Mat}_{n\times m},π_0)$ and $(\operatorname{Mat}_{n\times m},π_{(\bar{\mathbfΓ}^r,\bar{\mathbfΓ}^c)})$.

comments
4 figures
fields
Symplectic Geometry, Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2611.21263 ↗

Given a mirror pair of smooth affine principal upper cluster varieties admitting reddening sequences, we show that homological mirror symmetry for principal cluster varieties -- assumed compatible with certain cluster structures -- descends under freezing. This allows us to induct on the following class. A skew-symmetrizable matrix is peelable if, by mutations and removing sinks or sources, it can be reduced to the empty matrix; it is sub-peelable if it is a principal submatrix of a peelable matrix. We establish homological mirror symmetry for full rank upper cluster varieties whose mutable matrix is sub-peelable. We show sub-peelability for the Fock–Goncharov SL(n) quiver for any compact surface with nonempty boundary, all of whose boundaries have markings. Consequently, we establish homological mirror symmetry between the moduli of decorated SL(n) local systems and the corresponding pinned PGL(n) spaces. The results were obtained using ChatGPT Astra.

comments
57 pages
fields
Symplectic Geometry, Algebraic Geometry, Combinatorics, Representation Theory
pdf ↗ page arXiv:2611.21484 ↗

History and Overview3

Most first courses in differential equations introduce students to very special differential equations which can be solved in closed form from a small set of techniques (such as separable equations and integrating factors). Frequently other equations can be converted to one of these forms through a change of variable; however, these transformations are usually just given without any explanation of \emph{how} people found them, or \emph{why} problems of these forms have nice solutions, but not related ones. We consider the first order differential equation $dy/dx = f(x,y)$ where $f(x,y)$ does not factor as $A(x)B(y)$, and assume $f(x,y) = g(y/x^r)$ for some nice function $g$ and some real number $r$. This can be reduced to a separable equation only when $r=1$. We then discuss generalizations and what conditions on $f$ lead to a change of variables yielding a separable equation. Our goals are twofold. First, to encourage students and instructors to be active, questioning the methods and results, seeing how far they can be extended and why they work. Second, we discuss how to appropriately use AI to take ideas and special cases as prompts and quickly create extensions and editable notes that can be shared with students, freeing up professors (and students) from straightforward calculations \emph{without} sacrificing learning and understanding.

comments
Version 1.0, 8 pages
fields
History and Overview
pdf ↗ page arXiv:2611.18764 ↗

Mainstream artificial intelligence systems, particularly Large Language Models (LLMs), are fundamentally constructed upon the Optimization-Driven (OD) paradigm. This paradigm can be characterized as an ill-posed optimization problem within a high-dimensional parameter space. When confronted with real-world scenarios characterized by noise and conflicting constraints, the logic of global error minimization inherently induces a strong smoothing effect. Consequently, this yields statistical compromise solutions that flatten local features, making it arduous to overcome the inherent bottleneck of Out-of-Distribution (OOD) generalization. Existing AI models generate outputs purely based on statistical probabilities. They lack the capacity to autonomously discern truth from falsehood or establish causal logic, thereby lacking genuine cognitive intelligence. To address the ontological limitations of the OD paradigm, this paper proposes a novel paradigm termed \textit{Structure-Enabled Intelligence}. This approach abandons the conventional path of relying solely on computing power scaling and data fitting to achieve emergent intelligence. Instead, it embeds mathematical structures and physical mechanisms as underlying priors into the algorithmic architecture, constraining the model's solving process with structured scientific rules. Through this paradigm shift from ``data-driven objective fitting'' to ``mechanism-structure dominance,'' the proposed approach fundamentally mitigates the issue of statistical compromise, enhances the model's extrapolation and generalization capabilities, and simultaneously reshapes human-AI synergy by upholding human subjectivity in scientific cognition.

fields
History and Overview
pdf ↗ page arXiv:2611.19431 ↗

I show that the axioms and rules of inference about the horizontal in the subsystem of Grundgesetze without value-ranges fail to capture its intended interpretation. That is, I build a nonstandard model in which $-a$ is the true iff $a$ is not the false, thereby confirming a conjecture made by Landini that $a \to (-a) = a$ is not provable in this subsystem. This motivates our main result, namely, soundness and completeness proofs for the first-order fragment without value-ranges with respect to a new nonclassical semantics of boolean truncation. Simply put, the widespread assumption that Grundgesetze's first-order logic is classical first-order logic is mistaken.

journal
Notre Dame Journal of Formal Logic, 67(3), pp. 437-455, 2026
fields
History and Overview, Logic
pdf ↗ page arXiv:2611.19892 ↗

General Topology1

Let $K$ be a compact metrizable space. For $f\in C(K)$ let $M_f$ be the largest lower semicontinuous map with $k\in M_f(k)\subseteq f^{-1}(f(k))$. We say that $K$ has the double commutant property if for every $f\in C(K)$ every continuous function that is constant on all sets $M_f(k)$ is constant on the fibres of $f$; this is exactly the condition that the double commutant of every multiplication operator on $C(K)$ is the closed algebra generated by the operator and the identity. We show that an arc connected continuum has this property if the points having an open locally connected neighbourhood are dense, and we extend this to some continua that are not arc connected. We then develop new techniques that work when such points are not dense, or do not exist at all, and prove that several well-known continua have the property: the Cantor comb, the Cantor fan and, more generally, the cone over every compact metrizable space, every smooth fan with a closed set of end points, and the Cantor grid $(C\times[0,1])\cup([0,1]\times C)$. The property passes to open images. Examples show that the hypotheses cannot be weakened in several directions. For individual functions we show that, on a continuum all of whose arc components are dense, every function that is constant on no arc satisfies the double commutant condition, and that on every smooth dendroid and every fan the functions satisfying it are dense.

fields
General Topology
pdf ↗ page arXiv:2611.20152 ↗

Revised papers545

In this work apply the algebra of operators of quantum mechanics in the Helmholtz wave equation in cylindrical coordinates in paraxial approximation to describe the raising and lowering operators for the Laguerre-Gauss modes.

comments
errors detected
fields
Mathematical Physics
pdf ↗ page arXiv:1111.0886 ↗

In this work we study algebraic, geometric and topological properties of the Milnor classes of local complete intersections with arbitrary singularities. We describe first the Milnor class of the intersection of a finite number of hypersurfaces, under certain conditions of transversality, in terms of the Milnor classes of the hypersurfaces. Using this description we obtain a Parusiński-Pragacz type formula, an Aluffi type formula and a description of the Milnor class of the local complete intersection in terms of the global Lê cycles of the hypersurfaces that define it. We consider next the general case of a local complete intersection $Z(s)$ defined by a regular section $s$ of a rank $r$ holomorphic bundle $E$ over a compact manifold $M$, $r \geq 2$. We notice that $s$ determines a hypersurface $Z(\tilde s)$ in the total space of the projectivization $\mathbb{P}(E^{\vee})$ of the dual bundle $E^{\vee}$, and we give a formula expressing the total Milnor class of the local complete intersection $Z(s)$ in terms of the Milnor classes of the hypersurface $Z(\tilde s)$.

comments
Note (2026): This preprint gave rise to two papers: arXiv:1909.01117 (J. Topol. 13, 2020) and arXiv:2611.13267 (2026). Apart from this note, the manuscript remains identical to the original 2012 version
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:1208.5084 ↗

We present a summary of recent and older results on Bessel integrals and their relation with zeta numbers.

comments
30 pages, no figure
fields
Mathematical Physics
pdf ↗ page arXiv:1209.1036 ↗

We fix constructive foundations for Arithmetic on a map theoretical, algorithmic level. In contrast to elementhood and quantification based traditional foundations such as Principia Mathematica PM, Zermelo-Fraenkel set theory ZF, or v. Neumann-Goedel-Bernays set theory NGB, our fundamental primitive recursive theory PR has as its basic "undefined" (not further defined) terms just terms for objects and maps. Goodstein's axiomatic uniqueness rules are derived as theorems in PR - with equality definability as a side result -, S is obtained by predicate comprehension, and the equivalence of the theory of partially defined maps and the categorical theory of mu-recursion identifies mu-recursive maps and while-loops with partially defined maps. Keywords: Goedel theorems, primitive recursion, categorical free-variables Arithmetic, mu-recursion, totality

comments
Replaces older version. Significant additions and corrections
fields
Logic, Category Theory
pdf ↗ page arXiv:1312.7275 ↗

In this paper, we study a family of binomial ideals defining monomial curves in the n-dimensional affine space determined by $n$ hypersurfaces of the form $x_i^{c_i} - x_1^{u_{i1}} \cdots x_n^{u_{1n}}$ in $\Bbbk[x_1, \ldots, x_n]$ with $u_{ii} = 0$, $i \in \{1, \ldots, n\}$. We prove that the monomial curves in that family are set-theoretic complete intersections. Moreover, if the monomial curve is irreducible, we compute some invariants such as genus, type and Frobenius number of the corresponding numerical semigroup. We also describe a method to produce set-theoretic complete intersection semigroup ideals of arbitrary large height.

comments
19 pages. Author-accepted manuscript of the article published in Journal of the Australian Mathematical Society
journal
Journal of the Australian Mathematical Society 110 (2021), no. 1, 48-70
fields
Commutative Algebra
pdf ↗ page arXiv:1705.10268 ↗

We prove global Strichartz estimates without loss outside two strictly convex obstacles, combining arguments from M.Ikawa (1982,1988) with more recent ones inspired by N.Burq, C.Guillarmou, and A. Hassell (2010) and O. Ivanovici (2010). This is to be contrasted with the loss in the smoothing estimate for the Schrödinger equation with Dirichlet boundary conditions in the presence of a trapped geodesic.

fields
Analysis of PDEs
pdf ↗ page arXiv:1709.03836 ↗

Using the algebraic classification of all $2$-dimensional algebras, we give the algebraic classification of all $2$-dimensional rigid, conservative and terminal algebras over an algebraically closed field of characteristic 0. We have the geometric classification of the variety of $2$-dimensional terminal algebras, and based on the geometric classification of these algebras we formulate some open problems.

comments
Corrected version
journal
A. J. Calderón, A. Fernández Ouaridi, I. Kaygorodov, The classification of 2-dimensional rigid algebras, Linear and Multilinear Algebra, 68 (2020), no. 4, 828--844
fields
Rings and Algebras
pdf ↗ page arXiv:1810.01636 ↗

We study the structure of the family of numerical semigroups with fixed multiplicity and Frobenius number. We give an algorithmic method to compute all the semigroups in this family. As an application we compute the set of all numerical semigroups with given multiplicity and genus.

comments
16 pages. Author-accepted manuscript of the article published in Portugaliae Mathematica
journal
Portugaliae Mathematica 78 (2021), no. 2, 147-167
fields
Group Theory
pdf ↗ page arXiv:1904.05551 ↗

Training artificial neural networks predominantly relies on offline, gradient-based backpropagation algorithms. In contrast, biological circuits process and retain information through decentralized, continuous-time adaptation. In this work, we explore an online, gradient-free learning methodology by formulating the tuning of synaptic weights as a closed-loop trajectory tracking problem driven by model-free control principles. Rather than performing global optimization across static parameters, decentralized controllers adjust synaptic interactions in real-time using solely local input-output tracking errors. We present an exploratory benchmark neural architecture, whose purpose is to assess the dynamic resilience of the proposed approach, particularly in tracking target outputs and adapting to abrupt non-stationarities and structural perturbations (such as topological changes or dynamic dropout) without requiring offline retraining. This empirical preliminary study provides a proof-of-concept for control-theoretic learning paradigms and outlines the foundation for scalable, dynamically evolving connectome frameworks.

comments
13 pages, 6 figures, Submitted to the 9th Annual Learning for Dynamics & Control Conference
fields
Optimization and Control
pdf ↗ page arXiv:1905.02230 ↗

In this article, we propose a covariance based method for combining partial data sets in the genotype to phenotype spectrum. In particular, an expectation-maximization algorithm that can be used to combine partially overlapping relationship/covariance matrices is introduced. Combining data this way, based on relationship matrices, can be contrasted with a feature imputation based approach. We used several public genomic data sets to explore the accuracy of combining genomic relationship matrices. We have also used the heterogeneous genotype/phenotype data sets in the https://triticeaetoolbox.org/ to illustrate how this new method can be used in genomic prediction, phenomics, and graphical modeling.

comments
partially wrong theory
fields
Statistics Theory
pdf ↗ page arXiv:1912.03358 ↗

A relation between $\frac{1}{2}$-derivations of Lie algebras and transposed Poisson algebras has been established. Some non-trivial transposed Poisson algebras with a certain Lie algebra (Witt algebra, the algebra $\mathcal{W}(a,-1)$, the thin Lie algebra and a solvable Lie algebra with abelian nilpotent radical) have been done. In particular, we have developed an example of the transposed Poisson algebra with associative and Lie parts isomorphic to the Laurent polynomials and the Witt algebra. On the other side, it has been proved that there are no non-trivial transposed Poisson algebras with a Lie algebra part isomorphic to a semisimple finite-dimensional algebra, a simple finite-dimensional superalgebra, the Virasoro algebra, $N=1$ and $N=2$ superconformal algebras, or a semisimple finite-dimensional $n$-Lie algebra.

comments
Corrected version
journal
B. L. M. Ferreira, I. Kaygorodov, V. Lopatkin, $\frac{1}{2}$-derivations of Lie algebras and transposed Poisson algebras, Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas, 115 (2021), no.~3, 142
fields
Rings and Algebras
pdf ↗ page arXiv:2010.00443 ↗

We relate the decidability problem for BS with unordered cartesian product with Hilbert's Tenth problem and prove that BS with unordered cartesian product is NP-complete.

comments
the result is uncorrect
fields
Logic, Combinatorics
pdf ↗ page arXiv:2101.00198 ↗

Let $f$ be the ordinary $p$-stabilization of the weight-one Eisenstein series, where $χ$ is odd and $χ(p)=1$. Under a Gorenstein hypothesis on the cuspidal Hecke algebra, we prove a factorization of the even branches of the cyclotomic $p$-adic $L$-function of $f$ by evaluating a cup product of cyclotomic units via local reciprocity. The odd branches follow from the Eisenstein specialization formula of Fukaya and Kato with a minor modification for the exceptional character considered here. We then obtain results on the $μ$- and $λ$-invariants. On the algebraic side, we compute the Selmer characteristic ideals at $f$ and the Iwasawa invariants of the higher-weight specializations. For every nontrivial twist of $f$, the ordinary characteristic ideal is generated by the corresponding $p$-adic $L$-function. On the untwisted branch it has one additional factor, the cyclotomic augmentation parameter. Imposing the strict local condition at $p$ removes this factor. For higher-weight specializations coming from newforms of level prime to $p$, Kato's divisibility then gives the cyclotomic main conjecture after inverting $p$.

comments
24 pages, any comments are welcome. v2: minor revision, comments are welcome. v3: with improve exposition
fields
Number Theory
pdf ↗ page arXiv:2206.14636 ↗

Transposed Poisson structures on complex Galilean-type Lie algebras and superalgebras are described. It is proven that the principal Galilean Lie algebras and superalgebras do not admit nontrivial transposed Poisson structures. We also prove that each complex finite-dimensional solvable Lie algebra of dimension greater than one admits a nontrivial $\frac{1}{2}$-derivation and a nontrivial ${\rm Hom}$-Lie structure, and that each complex finite-dimensional non-abelian solvable Lie algebra admits a nontrivial transposed Poisson structure.

journal
I. Kaygorodov, V. Lopatkin, Z. Zhang, Transposed Poisson structures on Galilean and solvable Lie algebras, Journal of Geometry and Physics, 187 (2023), 104781
fields
Rings and Algebras
pdf ↗ page arXiv:2209.00264 ↗

We give a construction of classifiers for double negation stable h-propositions in a variety of cubical set models of homotopy type theory and cubical type theory. This is used to give some relative consistency results: classifiers for double negation stable propositions exist in cubical sets whenever they exist in the metatheory; the Dedekind real numbers can be added to homotopy type theory without changing the consistency strength; we construct a model of homotopy type theory with extended Church's thesis, which states that all partial functions with double negation stable domain are computable.

fields
Logic
pdf ↗ page arXiv:2209.15035 ↗

We show that coherent topoi are right Kan injective with respect to flat embeddings of topoi. We recover the ultrastructure on their category of points as a consequence of this result. We speculate on possible notions of ultracategory in various arenas of formal model theory.

comments
26 pages. Second version corrects several minor inaccuracies
fields
Category Theory, General Topology, Logic
pdf ↗ page arXiv:2211.03104 ↗

A positive braid with at least one full twist is known to be a minimal braid, i.e, it achieves the braid index for its closure. In this paper we find knots that are the closure of positive minimal braids that cannot be represented by positive braids with full twists. More precisely, we show that some satellite knots with companions and patterns given as the closure of positive braids cannot be represented as the closure of positive braids with full twists. As a consequence, we find infinitely many satellite knots with companions and patterns being Lorenz knots that are not Lorenz knots. This gives an answer to the question whether a satellite knot having Lorenz pattern and companion is also a Lorenz knot, originally addressed by Birman and Williams in a special case in the 1980s.

comments
V3: 12 pages, 3 figures, Published in the New York Journal of Mathematics
fields
Geometric Topology
pdf ↗ page arXiv:2211.12816 ↗

The measure of the positivity set $\{ x \in [0; 2π] \mid f(x) > 0 \}$ of a trigonometric polynomial $f$ is bounded from below by the Motzkin density. We generalize the bound to polynomials in several variables and almost periodic functions. We then use these generalizations to extend known results on Taikov's problem.

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

In this paper we present cartesian structure for symmetric Gray-monoidal double categories. To do this we first introduce locally cubical Gray categories, which are three-dimensional categorical structures analogous to classical, locally globular, Gray categories. The motivating example comprises double categories themselves, together with their functors, transformations, and modifications. A one-object locally cubical Gray category is a Gray-monoidal double category. Braiding, syllepsis, and symmetry for these is introduced in a manner analogous to that for 2-categories. Adding cartesian structure requires the introduction of doubly-lax functors of double categories to manage the order of copies. The resulting theory is algebraically rather complex, largely due to the bureaucracy of linearizing higher-dimensional boundary constraints. Fortunately, it has a relatively simple and compelling representation in the graphical calculus of surface diagrams, which we present.

comments
This version was published by Applied Categorical Structures as Volume 34, article number 65 (2026) (DOI: https://doi.org/10.1007/s10485-026-09883-x). Since the previous version, minor errors are corrected and the proof of proposition 3.7 is given in more detail using properties of transformations and modifications described at the end of section 2
journal
Applied Categorical Structures, Volume 34, article 65 (2026)
fields
Category Theory
pdf ↗ page arXiv:2302.07810 ↗

Accurate time-series forecasting is critical for many problems involving temporal data. Ensemble modeling is a well-established technique that leverages multiple predictive models to improve accuracy and robustness, since a single predictor's performance can vary widely due to shifts in the underlying data distribution. This paper proposes a new methodology for building robust ensembles of time series forecasting models. Our approach uses Adaptive Robust Optimization (ARO) to construct a linear regression ensemble whose model weights adapt over time. We demonstrate the effectiveness of our method through synthetic experiments covering eight disturbance scenarios, from no drift to abrupt regime shifts, and real-world applications, including air pollution management, energy consumption forecasting, and tropical cyclone intensity forecasting. In the real-world applications, our adaptive ensembles outperform the best ensemble member in hindsight by 16-26% in root mean square error (RMSE) and 14-28% in conditional value at risk at the 15% level and improve over the other ensemble methods we compare on most metrics. In the synthetic experiments, they have lower mean RMSE than a rolling-ridge comparator in seven of the eight scenarios, significantly in four, while an abrupt regime shift that first appears after model selection remains a limitation.

comments
Accepted at NeurIPS 2026 (poster). 27 pages. Code: https://github.com/leobix/adaptive_ensemble
fields
Optimization and Control
pdf ↗ page arXiv:2304.04308 ↗

This paper extends the $\ell_1$-penalized likelihood Selective Inference method to survey settings. We establish its asymptotic validity for generalized linear models with an increasing number of covariates and survey weights, allowing inference on pseudo-true parameters of possibly misspecified selected models. Moreover, we generalize the method to facilitate inference on nonlinear functionals, such as the average marginal effect in survey-weighted logit models. The effectiveness of the proposed approach is illustrated using simulated data and the 2020 Canadian Internet Use Survey.

comments
54 pages, 4 tables
fields
Statistics Theory
pdf ↗ page arXiv:2304.07855 ↗

For algebraic stacks over number fields, we define their Brauer-Manin sets, Brauer-Manin pairings, and extend the descent theory of Colliot-Thélène and Sansuc. By extending Sansuc's exact sequence, we show the torsionness of Brauer groups of stacks that are locally quotients of varieties by linear groups. With mild assumptions, for stacks that are locally quotients or Deligne-Mumford, we show that the Brauer-Manin obstruction coincides with some other cohomological obstructions such as obstructions given by torsors under connected groups or abelian gerbes. For Brauer-Manin sets of these stacks, we show the properties such as descent along a torsor, product preservation are still correct. These results extend classical theories of those on varieties.

comments
29 pages, clarified cohomology conventions, corrected hypotheses and proofs for the fundamental exact sequence, Künneth formula and Brauer-Manin descent and product results, and updated references and exposition (git commit f78a28cb)
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2306.14426 ↗

This paper studies a class of multivariate threshold autoregressive models, known as censored and kinked structural vector autoregressions (CKSVAR), which are notably able to accommodate series that are subject to occasionally binding constraints. We develop a set of sufficient conditions for the processes generated by a CKSVAR to be stationary, ergodic, and weakly dependent. Our conditions relate directly to the stability of the deterministic part of the model, and are therefore less conservative than those typically available for general vector threshold autoregressive (VTAR) models. Though our criteria refer to quantities, such as refinements of the joint spectral radius, that cannot feasibly be computed exactly, they can be approximated numerically to a high degree of precision.

comments
ii + 36 pp., 4 figures. Split from arXiv:2211.09604v1. Author accepted manuscript
fields
Statistics Theory
pdf ↗ page arXiv:2307.06190 ↗

Many machine learning problems are quadratic programs, including Support Vector Machines (SVMs). A general quadratic program has input size $Θ(n^2)$, and assuming the Strong Exponential Time Hypothesis (SETH), no $O(n^{2-o(1)})$ time algorithm exists when the objective matrix is positive semidefinite (Backurs, Indyk, and Schmidt, NeurIPS'17). SVMs, however, are given by $n$ data points of dimension $d$, often much smaller than $n$, and have only $O(1)$ equality constraints. In this work, we design the first nearly-linear time algorithm for solving quadratic programs whenever a low-rank factorization of the quadratic objective matrix is given, the number of linear constraints is small, the coefficients of the objective and some optimal solution are bounded by $\mathrm{poly}(n)$, and some feasible point has all entries between $1/\mathrm{poly}(n)$ and $\mathrm{poly}(n)$. For linear SVM on $d$-dimensional data, our randomized algorithm runs in expected time $\widetilde O(nd^{(ω+1)/2}\log(n/ε))$ when $(d+1)^{ω-1}\le n$ and the data points have norms at most $\mathrm{poly}(n)$ and margin at least $1/\mathrm{poly}(n)$, where $ω<2.258$ is the matrix multiplication exponent. Its output satisfies the equality constraint only approximately. For Gaussian kernel SVM, when $d=O(\log n)$, the squared dataset radius is $o(\log n/\log\log n)$ and the dual variables lie in a box $[0,R]^n$ with $R\le\mathrm{poly}(n)$, our randomized algorithm runs in expected time $n^{1+o(1)}$ for any accuracy $ε\ge 1/\mathrm{poly}(n)$. We also prove that, assuming SETH, when the squared dataset radius is $Ω(\log^2 n)$, $Ω(n^{2-o(1)})$ time is required on some inputs to reach error $\exp(-Θ(\log^2 n))$ for the program without the bias term. This improves upon the prior best lower bound in both the dimension $d$ and the squared dataset radius.

comments
ICLR 2025. This version corrects the Gaussian kernel result, which needs accuracy at least $1/\mathrm{poly}(n)$, and the comparison with the lower bound of Backurs, Indyk and Schmidt. Abstract shortened to meet arxiv requirement
fields
Optimization and Control
pdf ↗ page arXiv:2307.07735 ↗

This paper establishes the averaging method to a coupled system consisting of two stochastic differential equations which has a slow component driven by fractional Brownian motion (FBM) with less regularity $1/3< H \leq 1/2$ and a fast dynamics under additive FBM with Hurst-index $1/3< \hat H \leq 1/2$. We prove that the solution of the slow component converges almost surely to the solution of the corresponding averaged equation using the approach of time discretization and controlled rough path. To do this, we employ the random dynamical system (RDS) to obtain a stationary solution by an exponentially attracting random fixed point of the RDS generated by the non-Markovian fast component.

comments
34pages
fields
Probability, Dynamical Systems
pdf ↗ page arXiv:2307.13191 ↗

We compare concentration in increasing dimension with geometric and metric–measure degeneration of compact Cauchy hypersurfaces. For vacuum $T^3$-Gowdy developments we establish an exact law for redistribution of normalized spatial volume, without imposing polarization. An explicit strict bound on the \emph{initial} spatially averaged wave-map energy guarantees divergence of the transverse circle length $L(τ)$. Under this expansion hypothesis, we classify \emph{all convergent distance-scaling regimes}: if $a_τL(τ)\to\ell$, the rescaled sections concentrate to a point for $\ell=0$, to the uniformly measured circle of circumference $\ell$ for $0<\ell<\infty$, while for $\ell=\infty$ their associated pyramids converge to the maximal pyramid. The classification applies to Ringström's generic non-polarized class, including nondegenerate true spikes, and requires no uniform geometric control at spike points. The argument compares orbit metrics with their initial values outside an exceptional set of probability at most $L(τ_0)/L(τ)$. The normalized Laplacian splits into periodic one-dimensional Schrödinger operators indexed by toroidal Fourier modes; its non-invariant sectors satisfy a uniform spectral gap $Λ_τ\ge cL(τ)^2$. Thus only torus-invariant modes persist at bounded spectral energy, with quantitative heat-semigroup and resolvent estimates. Separately, an initial-data perturbation criterion yields strictly monotone transfer toward a prescribed region in a relatively open low-velocity non-polarized class. Explicit high-velocity solutions exhibit contrasting point-collapse and unbounded-diameter geometries governed by the torus marking.

comments
14 pages
fields
Differential Geometry, General Topology
pdf ↗ page arXiv:2308.00080 ↗

We classify smooth projective surfaces that are quotients of abelian surfaces by finite groups. We also record the orbifold boundary associated to a quotient map and describe its structure explicitly in the case of augmented irregularity one.

comments
15 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2308.00884 ↗

We prove that every infinite minimal subshift with word complexity $p(q)$ satisfying $\limsup p(q)/q < 3/2$ is measure-theoretically isomorphic to its maximal equicontinuous factor; in particular, it has measurably discrete spectrum. Among other applications, this provides a proof of Sarnak's conjecture for all subshifts with $\limsup p(q)/q < 3/2$ (which can be thought of as a much stronger version of zero entropy). We also show that all such subshifts are balanced, and that orbit equivalence between them is characterized by the additive eigenvalue group. As in [CP23], our main technique is proving that all low-complexity minimal subshifts have a specific type of representation via a sequence $\{τ_k\}$ of substitutions, usually called an S-adic decomposition. The maximal equicontinuous factor is the (possibly twisted) product of an odometer with a rotation on a compact abelian connected one-dimensional group (either a circle or solenoid), for which we can give an explicit description in terms of the substitutions $τ_k$. We also prove that all such odometers and groups may appear for minimal subshifts with $\limsup p(q)/q = 1$, demonstrating that lower complexity thresholds do not further restrict the possible structure.

fields
Dynamical Systems
pdf ↗ page arXiv:2308.14901 ↗

We described all transposed Poisson algebra structures on oscillator Lie algebras, i.e., on one-dimensional solvable extensions of the $(2n+1)$-dimensional Heisenberg algebra; on solvable Lie algebras with naturally graded filiform nilpotent radical; on $(n+1)$-dimensional solvable extensions of the $(2n+1)$-dimensional Heisenberg algebra; and on $n$-dimensional solvable extensions of the $n$-dimensional algebra with trivial multiplication. We also answered one question on transposed Poisson algebras, posted in a paper by Beites, Ferreira and Kaygorodov. Namely, we found that the semidirect product of ${\mathfrak sl}_2$ and an irreducible module gives a finite-dimensional Lie algebra with non-trivial $\frac{1}{2}$-derivations, but without non-trivial transposed Poisson structures.

comments
Corrected version
journal
I. Kaygorodov, A. Khudoyberdiyev, Transposed Poisson structures on solvable and perfect Lie algebras, Journal of Physics A: Mathematical and Theoretical, 57 (2024), no. 3, 035205
fields
Rings and Algebras
pdf ↗ page arXiv:2310.00624 ↗

Davies efficient covering theorem states that an arbitrary measurable set $W$ in the plane can be covered by full lines so that the measure of the union of the lines has the same measure as $W$. This result has an interesting dual formulation in the form of a prescribed projection theorem. In this paper, we formulate each of these results in a nonlinear setting and consider some applications. In particular, given a measurable set $W$ and a curve $Γ=\{(t,f(t)): t\in [a,b]\}$, where $f$ is $C^1$ with strictly monotone derivative, we show that $W$ can be covered by translations of $Γ$ in such a way that the union of the translated curves has the same measure as $W$. This is achieved by proving an equivalent prescribed generalized projection result, which relies on a Venetian blind construction.

comments
incorporated referee comments, to appear in Analysis & PDE
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2310.08776 ↗

We study the fractional $Φ^4_3$-measure (with order $α> 1$) and the dynamical problem of its canonical stochastic quantization: the three-dimensional stochastic damped fractional nonlinear wave equation with a cubic nonlinearity, also called the fractional hyperbolic $Φ^4_3$-model. We first construct the fractional $Φ^4_3$-measure via the variational approach by Barashkov-Gubinelli (2020). When $α\leq \frac{9}{8}$, this fractional $Φ^4_3$-measure turns out to be singular with respect to the base Gaussian measure. We then prove almost sure global well-posedness of the fractional hyperbolic $Φ^4_3$-model and invariance of the fractional $Φ^4_3$-measure for all $α> 1$ by further developing the globalization framework due to Oh-Okamoto-Tolomeo (2024) on the hyperbolic $Φ^3_3$-model. Furthermore, when $α> \frac{9}{8}$ , we prove weak universality of the fractional hyperbolic $Φ^4_3$-model by utilizing the convergence of Gibbs measures.

comments
107 pages. We have corrected some errors, updated some references, and made some minor modifications. To appear in Peking Math. J
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2311.00543 ↗

We study the monodromy on the $\ell$-adic cohomology of smooth proper surfaces over complete discrete valuation fields of mixed characteristic $(0,p)$, with algebraically closed residue field and $p>5$. When the surfaces admit proper models whose special fiber has at worst a rational double point, we show that the monodromy action of inertia is finite, depends on an étale neighborhood of the singularity and its nontrivial part coincides with a restriction of the reflection representation of a Weyl group naturally associated with the singularity. We extend this description for degenerations into general rational singularities whose deformations lie in the Artin component: the monodromy is described by restricting the reflection representation of the Weyl group associated with the exceptional $(-2)$-curves in the minimal resolution of the special fiber. Moreover we determine minimal finite extensions over which such surfaces have good reduction. The proof relies on a mixed-characteristic extension of Grothendieck–Springer simultaneous resolutions and an identification of monodromy and Springer representations via relatively perverse nearby cycles.

comments
44 pages; significant revision of multiple sections and various fixes. Added a section extending the theorem to more general rational singularities
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2312.09175 ↗

This paper proposes Inverse Gram Matrix (IGM) methods to prioritize Pairwise Reciprocal Matrices (PRMs) in the Analytic Hierarchy Process (AHP). The IGM methods include Pseudo-IGM, Normalized-IGM, and Lagrangian-IGM. Interestingly, the proposed IGM methods achieve the minimum Weighted Least Squares (WLS) error. Since clarity, explainability, usability, and verification of the closed-form solutions of WLS appear to be incomplete in the literature, comprehensive mathematical proofs, detailed computational demonstrations, and intensive simulation verification to extend the prior studies are offered in this study. After a simulation of one million random PRM instances was performed to verify the equivalence of the IGM methods, another simulation of ten thousand random PRM instances was performed to verify that any one of the proposed IGM methods is the exact closed-form solution to the WLS optimization problem. The proposed IGM methods under the WLS framework provide the promising alternatives to Saaty's Eigenvector method in AHP. The open-source R package igm4ahp, along with its user manual, tutorials, and simulation datasets, is publicly available on GitHub and permanently archived on Zenodo.

comments
29 pages, 2 tables. Package user manual, tutorials, and demonstrations: https://kkfyuen.github.io/igm4ahp/ . Code and simulation datasets on GitHub: https://github.com/kkfyuen/igm4ahp . Permanently archived on Zenodo: https://doi.org/10.5281/zenodo.24223557
fields
Optimization and Control
pdf ↗ page arXiv:2401.01190 ↗

This article is a continuation of the work done in [Das et al., Annals of Pure and Applied Logic 174 (2023), 103289] on $\mathcal{I}$-characterized subgroups and concerns in addition the generalized version of Arbault sets, namely, $\mathcal{I}$-Arbault sets that is generated from this collection. A special class of ideals, namely, non-$snt$ ideals was introduced in 2023 ($snt$ stands for ``strongly non translation invariant") which was found to be effective in understanding ``Eggleston's dichotomy". Here we introduce another new class of ideals $\mathcal{H}$, a subclass of non-$snt$ ideals. We are able to establish a (new) necessary and sufficient condition for a $P$-ideal to be dense in Theorem 2.8 using the condition used to define the class $\mathcal{H}$ from which it follows that $\mathcal{H}$ coincides with dense $P$-ideals. Furthermore the important fact is established that the class of non-$snt$ ideals strictly contains the class of dense $P$-ideals. Subsequent investigation leads us to Theorem 2.14 which establishes the novelty of $\mathcal{I}$-characterized subgroups for ideals coming from the class $\mathcal{H}$ and arbitrary arithmetic sequences showing that these are not even Arbault sets. Before all these, we also present a correct and revised proof of the main result of [Das et al., Annals of Pure and Applied Logic 174 (2023), 103289], namely Theorem 3.8 (which had a gap in the proof). Finally we extend the results of [Das et al., Bul. Sci. Math. 179 (2022), 103157] for generalized version of Arbault sets and primarily show that for each ideal coming from the class $\mathcal{H}$, the class of $\mathcal{I}$-Arbault sets not only properly contains the class of classical Arbault sets but also a large subfamily of sets of absolute convergence while being contained in the class of weak Dirichlet sets.

fields
General Topology
pdf ↗ page arXiv:2401.02103 ↗

Two players take turns claiming empty cells from an $n\times n$ grid. The first player (if any) to occupy a transversal (a set of $ n $ cells having no two cells in the same row or column) is the winner. What is the outcome of the game given optimal play? Our aim in this paper is to show that for $n\ge 4$ the first player has a winning strategy. This answers a question of Erickson. We also consider variants of the game in which the family of winning transversals is restricted, both in the original game and in its Maker–Breaker version.

comments
15 pages
fields
Combinatorics
pdf ↗ page arXiv:2401.16768 ↗

We define a new class of infinitary logics $\mathscr L^1_{κ,α}$ generalizing Shelah's logic $\mathbb L^1_κ$ defined in \cite{MR2869022}. If $κ=\beth_κ$ and $α<κ$ is infinite then our logic coincides with $\mathbb L^1_κ$. We study the relation between these logics for different parameters $κ$ and $α$. We give many examples of classes of structures that can or cannot be defined in these logics. Finally, we give a different version of Lindström's Theorem for $\mathbb L^1_κ$ in terms of the $φ$-submodel relation.

fields
Logic
pdf ↗ page arXiv:2402.13344 ↗

Given a CNF formula $\varphi$ with clauses $C_1, \dots, C_m$ over a set of variables $V$, a truth assignment $\mathbf{a} : V \to \{0, 1\}$ generates a binary sequence $σ_\varphi(\mathbf{a})=(C_1(\mathbf{a}), \ldots, C_m(\mathbf{a}))$, called a signature of $\varphi$, where $C_i(\mathbf{a})=1$ if clause $C_i$ evaluates to 1 under assignment $\mathbf{a}$, and $C_i(\mathbf{a})=0$ otherwise. Signatures and their associated generation problems have given rise to new yet promising research questions in algorithmic enumeration. In a recent paper, Bérczi et al. interestingly proved that generating signatures of a CNF is tractable despite the fact that verifying a solution is hard. They also showed the hardness of finding maximal signatures of an arbitrary CNF due to the intractability of satisfiability in general. Their contribution leaves open the problem of efficiently generating maximal signatures for tractable classes of CNFs, i.e., those for which satisfiability can be solved in polynomial time. Stepping into that direction, we completely characterize the complexity of generating all, minimal, and maximal signatures for XOR-CNFs.

comments
20 pages, 4 figures
fields
Combinatorics
pdf ↗ page arXiv:2402.18537 ↗

In the present paper, we introduce a method to construct two variable biorthogonal polynomial families with the help of one variable biorthogonal and orthogonal polynomial families. By using this new technique, we define 2D Hermite Konhauser polynomials and we investigate several properties of them such as biorthogonality property, operational formula and integral representation. We further inverstigate their images under the Laplace transformations, fractional integral and derivative operators. Corresponding to these polynomials, we define the new type bivariate Hermite Konhauser Mittag Leffler function and obtain the similar properties for them. In order to establish new fractional calculus, we add two new parameters and consider 2D Hermite Konhauser polynomials and bivariate Hermite Konhauser Mittag Leffler function. We introduce an integral operator containing the modified bivariate Hermite Konhauser Mittag Leffler function in the kernel. We show that it satisify the semigroup property and obtain its left inverse operator, which corresponds to its fractional derivative operator.

fields
General Mathematics
pdf ↗ page arXiv:2404.00035 ↗

We establish that for any small constant $\varepsilon>0$, there exists a nontrivial equidistributed set (with an unbounded complement) such that the observability cost in the short time $(0,T)$ of diffusion equations over $\mathbb{R}^{N}$ can be improved to a sharper exponential form of $Ce^{\varepsilon/T}$, where $C>0$ is a constant independent of $T$.

comments
arXiv admin note: text overlap with arXiv:2108.04540
fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2404.04945 ↗

This article deals with the $H^{1}$--level local null controllability for the energy-critical nonlinear Schrödinger equation in $\mathbb{R}^3$. Firstly, we demonstrate that the problem under consideration is well-posed using Strichartz estimates. Moreover, through the Hilbert uniqueness method, we prove the linear Schrödinger equation to be controllable by means of a control force supported in the exterior of a ball. Finally, we use a perturbation argument and show local controllability for the critical nonlinear Schrödinger equation.

comments
22 pages. To appear on SEMA Journal
fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2404.07749 ↗

We show that the bigraded quasi-isomorphism type of the bigraded, bidifferential algebra of forms on a compact Kähler manifold generally contains more information than the de Rham cohomology algebra with its real Hodge structure. More precisely, on any closed Riemann surface of genus at least two, there is a nontrivial ABC-Massey product. Furthermore, starting from dimension three, there are simply connected projective manifolds with a nonzero ABC-Massey product of three divisor classes. In particular, compact Kähler manifolds are generally not formal in the sense of pluripotential homotopy theory.

comments
12 pages, 2 figures, final version
journal
J. Topol., 19: e70107 (2026)
fields
Algebraic Topology, Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2404.09867 ↗

We consider controlled SDEs with measurable coefficients, a uniformly elliptic diffusion coefficient and an $L_d$-drift. In this framework we investigate the relationship among value functions, PDEs, and operator semigroups. First, for a cost with an infinite time horizon on a bounded domain, we identify the value function as an $L_{d_0}$-viscosity solution to an HJB equation and we establish quantitative regularity estimates. The constant $d_0 \in (d/2, d)$ only depends on the space dimension $d$, the ellipticity constants of the diffusion coefficient and the $L_d$-bound of the drift. To illustrate applications of these results, we provide a uniqueness theorem under an additional assumption on the diffusion coefficient, showing a stochastic representation, and we discuss stability of value functions. Second, we consider a cost with a finite time horizon, terminal and running terms, assuming an $L_{d + 1}$-drift. We show that the value function indexed over the terminal cost is a nonlinear semigroup on $C_b (\mathbb{R}^d)$ and we establish a regularization by noise effect, which shows that the semigroup regularizes lower semicontinuity to local Hölder continuity. We also establish quantitative regularity estimates for the semigroup that are local in time and global in space. Lastly, under an additional $L_{d + 2, loc}$-assumption on the drift, we relate the semigroup to a parabolic PDE, showing that the associated value function is an $L_{d + 1}$-viscosity solution. Our proofs of the regularity of the value functions, the $C_b$-Feller property of the semigroup and its regularization by noise effects are based on a strong Markov selection principle and analytic estimates for linear diffusions that were recently established by N. V. Krylov in a series of papers. We highlight that our method covers frameworks without uniqueness of the controlled SDEs, as well as the associated PDEs.

comments
Some errors from the previous version are fixed
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2404.17236 ↗

This paper deals with the Elliptical Wishart and Inverse Elliptical Wishart distributions, which play a major role when handling covariance matrices. Similarly to multivariate elliptical distributions, these form a large family of covariance distributions, encompassing, \textit{e.g.}, the Wishart or $t$-Wishart ones. Our first major contribution is to derive a stochastic representation for Elliptical Wishart and Inverse Elliptical Wishart matrices. This later enables us to obtain various key statistical properties of these distributions such as expectations, variances, and Kronecker moments up to any order. The stochastic representation provides an efficient method for generating random matrices from these distributions. Additionally, Elliptical Wishart distributions have a specific dependence structure - a random scale shared by all columns - which strongly influences their asymptotic behavior. Lastly, the practical relevance of Elliptical Wishart distributions, particularly the $t$-Wishart distribution, is demonstrated through a fitting experiment conducted on real electroencephalographic data. This experiment highlights their effectiveness in accurately modeling real covariance matrices.

fields
Statistics Theory
pdf ↗ page arXiv:2404.17468 ↗

We consider secure distributed matrix multiplication, in which a user computes the product of two matrices with the help of honest-but-curious servers, any $T$ of which may collude. Using the outer-product partition, the matrices are split into $K$ and $L$ blocks and hidden by random masks. Assuming the user has precomputed the products of the random matrices, we develop methods that use this precomputation to reduce the number of servers required. Polynomial codes are designed through degree tables, whose distinct entries count the servers. We show that precomputation can reduce the minimum number of servers by designing degree tables specifically for this setting. For Gap Additive Secure Polynomial (GASPr) codes, we give a precise formula and show that it is monotone in the chain length $r$, so only the extremes GASP_small and GASP_big matter. We also prove lower bounds attained by GASP_small in several regimes. Consequently, any fraction of colluding servers below one can be tolerated, compared to the threshold of one half without precomputation, and the order of the total computational complexity decreases when the colluders are a fixed fraction of the servers. We show that no existing construction uses fewer servers than the better of GASP_small and GASP_big once the mask products are precomputed. We introduce Gap-Reduced Additive Secure Polynomial (GRASP) codes, which retain a single interval for the mask degrees while selecting the information degrees carefully. For $K = T = 4$ and every $L \geq 3$, we give an explicit GRASP code that uses one fewer server than every GASPr code and is within two servers of optimal. For large $T$, the configuration becomes an integer packing problem independent of $T$, and the number of servers saved by GRASP over GASPr grows quadratically in $K$ and $L$.

comments
16 pages, 4 figures, 2 tables
fields
Information Theory
pdf ↗ page arXiv:2405.06121 ↗

We prove quantitative estimates for averages of the von Mangoldt and Möbius functions along polynomial progressions $n+P_1(m),\ldots, n+P_k(m)$ for a large class of polynomials $P_i$. The error terms obtained save an arbitrary power of logarithm, matching the classical Siegel–Walfisz error term. These results give the first quantitative bounds for the Tao–Ziegler polynomial patterns in the primes result. The proofs are based on a quantitative generalised von Neumann theorem of Peluse, a recent result of Leng on strong bounds for the Gowers uniformity of the primes, and analysis of a ``Siegel model'' for the von Mangoldt function along polynomial progressions.

comments
31 pages. We thank an anonymous reader for pointing out errors in some assertions of Theorem 1.3(2) and Corollary 1.4 in the published version. We have corrected these errors, which affect only the edge cases
fields
Number Theory
pdf ↗ page arXiv:2405.12190 ↗

Recently, Özarslan and Elidemir (2023) introduced a methodology for constructing two-variable biorthogonal polynomial families with the help of one-variable biorthogonal and orthogonal polynomial families. The primary objective of the paper is to introduce novel class of two-variable biorthogonal polynomials namley bivariate Jacobi Konhauser polynomials. We investigate several fundamental properties of these polynomials including their biorthogonality property, operational formula, generating function, and integral representation. Furthermore, We inverstigate their images under the Laplace transform, fractional integral and derivative operators. Corresponding to these polynomials, we define the new type bivariate Jacobi Konhauser Mittag Leffler (JKML) function and obtain the similar properties for them.

comments
Eastern mediterranean university. arXiv admin note: subtantial text overlap with arXiv:2404.00035
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2405.15043 ↗

In this paper, we compute the index and nullity for minimal submanifolds of some complex Einstein spaces. We investigate the stability of these minimal submanifolds and suggest a criterion for instability for some cases. We also compute some higher eigenvalues for the Laplacian of the Berger spheres and provide with an algorithm.

comments
14 pages, 2 figures
fields
Differential Geometry, Mathematical Physics, Geometric Topology
pdf ↗ page arXiv:2406.03347 ↗

Best Response Dynamics (BRD) constitute a family of strategy update rules designed to identify Pure Nash Equilibria (PNEs) in strategic games. In each iteration, a player is selected uniformly at random and adopts a best response strategy, maximising their payoff given the current strategies of the other players. If no improvement is possible for the selected player, another is chosen. The process terminates upon reaching a state where no player wishes to deviate, corresponding to a PNE. However, convergence is not guaranteed as either PNEs may not exist, or the dynamics may become confined within substructures of the game, which we call traps, that admit no PNEs. We investigate this behaviour in the context of random games with $N$ players, each choosing between two actions and receiving independently and identically distributed payoffs. The payoff distribution is permitted to have atoms, allowing for the possibility of ties. The induced dynamics define a class of random walks on the $N$-dimensional hypercube, where the landscape includes two types of absorbing sets: PNEs and traps. Our analysis encompasses BRD, simple random walks, and a broad class of nearest-neighbour processes. We prove that, with high probability, these dynamics reach a PNE before encountering any trap. Our results complete and generalise the ones by Amiet, Collevecchio, Scarsini and Zhong (2021), using a different approach.

comments
28 pages, 4 figures, 1 table. To appear in Mathematics of Operations Research
fields
Probability
pdf ↗ page arXiv:2406.09732 ↗

Harary introduced the concepts of sum and integral sum graphs. A graph $G$ is a {\em sum graph} if the vertices of $G$ can be labeled with distinct positive integers so that $e = uv$ is an edge of $G$ if and only if the sum of the labels on vertices $u$ and $v$ is also a label in $G$. An {\em integral sum graph} is also defined just as sum graph, the difference being that the labels may be any distinct integers. This survey presents results obtained by different authors, in detail, on sum and integral sum graphs.

comments
89 pages, 78 figures. This article is an updated/modified/corrected one of its previous version
fields
Combinatorics
pdf ↗ page arXiv:2407.10917 ↗

We initiate a novel application of the quantum inverse scattering method for the 20-vertex model, building upon seminal work from Faddeev and Takhtajan on the study of Hamiltonian systems. In comparison to a previous work of the author in late 2023 which characterized integrability of a Hamiltonian flow for the 6-vertex model from integrability of inhomogeneous limit shapes, formalized in a work of Keating, Reshetikhin and Sridhar, notions similar to those of integrability can be realized for the 20-vertex model by studying new classes of higher-dimensional L-operators. Such L-operators provided by Boos and colleagues have algebraic, combinatorial, and geometric, qualities, all of which impact leading order approximations of correlations, products of L-operators, the transfer matrix, and the quantum monodromy matrix.

comments
Full template (41 pages, longer version discussing several model is still available at: https://drive.google.com/file/d/1b6TFV-ldIokLQzOk2Bup8QvCNoiXVk26/view?usp=sharing)
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2407.11066 ↗

As low-precision arithmetic becomes more widely available on modern hardware, we develop mixed-precision variants of Lloyd's algorithm for k-means clustering, with a family of mixed-precision kernels for Euclidean distance computation as the main ingredient. These kernels are guided by rounding-error analysis and use a simple reliability test to decide whether the expanded distance formula can be evaluated safely with low precision or a higher-precision correction by the direct distance formula is required. Thus, most distance computations can be carried out with low precision, while high-precision arithmetic is used selectively when cancellation may lead to a loss of accuracy. We evaluate the proposed methods on large-scale distance-computation benchmarks, synthetic clustering problems, and image-segmentation tasks. The experiments verify that the mixed-precision kernels on GPUs can substantially improve performance while retaining accuracy and convergence behavior of higher-precision baselines. In particular, our implemented distance computation in CUDA achieves speedups of up to $4\times$ over the \texttt{PyTorch} baseline that evaluates the expanded formula in FP64 on an NVIDIA A100 GPU, with overall maximum relative errors of order $10^{-3}$, while providing increased numerical robustness in cancellation-prone calculations. The resulting mixed-precision kernels show efficiency for clustering and image segmentation, although the observed gains depend on factors such as feature dimension, and number of clusters. The mixed-precision kernels offer a favorable trade-off between performance and accuracy for clustering, and suggest that similar ideas may be beneficial for other distance-based machine learning methods.

fields
Numerical Analysis
pdf ↗ page arXiv:2407.12208 ↗

We give a new construction of the model structure on the category of simplicial sets for homotopy $n$-types, originally due to Elvira-Donazar and Hernandez-Paricio, using a right transfer along the coskeleton functor. We observe that an analogous model structure can be constructed on the category of cubical sets, and use it to equip the category of (simple) graphs with a fibration category structure whose weak equivalences are discrete $n$-equivalences.

comments
29 pages; final journal version
journal
Topology and its Applications 396 (2027) 110022
fields
Category Theory, Algebraic Topology, Combinatorics
pdf ↗ page arXiv:2408.05289 ↗

We prove an asymptotic formula for a special case of the Gauss hypergeometric function, which arises in the explicit formula for the second moment of Maass form symmetric-square $L$-functions.

comments
New method. In the previous version, the error estimate was not uniform in all parameters
fields
Number Theory, Classical Analysis and ODEs
pdf ↗ page arXiv:2408.05615 ↗

We present a comprehensive study of algebras satisfying the identity $(xy)z=y(zx),$ named as shift associative algebras. Our research shows that these algebras are related to many interesting identities. In particular, they are related to anti-Poisson-Jordan algebras and algebras of associative type $σ$. We study algebras of associative type $σ$ to be Koszul and self-dual. A basis of the free shift associative algebra generated by a countable set $X$ was constructed. An analog of Wedderburn-Artin's theorem was established. The algebraic and geometric classifications of complex $4$-dimensional shift associative algebras are given. In particular, we proved that the first non-associative shift associative algebra appears only in dimension $5$.

comments
Corrected version
journal
H. Abdelwahab, I. Kaygorodov, B. Sartayev, Shift associative algebras, Rendiconti del Circolo Matematico di Palermo. Second Series, 74 (2025), no. 5, 145
fields
Rings and Algebras
pdf ↗ page arXiv:2408.07078 ↗

We explore estimation and prediction accuracy for sparse linear models, focusing on scenarios where both predictors and errors carry serial correlations. We establish a clear link between predictor serial correlation and the performance of the LASSO, showing that even orthogonal or weakly correlated stationary AR processes can lead to significant spurious correlations due to their serial correlations. To address this challenge, we propose a novel approach named ARMAr-LASSO (ARMA residuals LASSO), which applies the LASSO to predictors that have been pre-whitened with ARMA filters and lags of dependent variable. We establish oracle inequalities for the feasible estimator and assess its estimation, selection, and forecasting performance empirically. Our findings are supported by extensive simulations and an application to real-world macroeconomic data, which highlight the superior performance of the ARMAr-LASSO for handling sparse linear models in the context of time series.

comments
64 pages, 4 Figures, 3 Tables. arXiv admin note: substantial text overlap with arXiv:2208.00727
fields
Statistics Theory
pdf ↗ page arXiv:2408.09288 ↗

The Johnson-Lindenstrauss lemma is the theoretical core of the dimensionality reduction methods based on random projections. While a standard probabilistic proof uses matrices with Gaussian entries, the computational cost of random projections can be drastically reduced by the use of simpler variables, especially if they vanish with a high probability. In this paper, we propose an elementary analysis of random projections under classical assumptions that emphasizes the key role of sub-Gaussianity: any 1-sub-Gaussian distribution with variance 1 yields the same sufficient target dimension as the Gaussian distribution. We then extend the analysis to sparse projections, with data-dependent sparsity conditions on the pairwise differences of the points, and we quantify the cost of sparsity on the target dimension. A complementary lower bound shows the limits induced by the sparsity of the data itself.

journal
Transactions on Machine Learning Research 2025
fields
Statistics Theory
pdf ↗ page arXiv:2409.06275 ↗

In this paper, we study properties of nodal orders defined over arbitrary base fields. In particular we give a classification of complete real nodal orders.

fields
Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2410.05792 ↗

A finite extension of global fields $L/K$ satisfies the Hasse norm principle if any nonzero element of $K$ has the property that it is a norm locally if and only if it is a norm globally. In 1931, Hasse proved that any cyclic extension satisfies the Hasse norm principle, providing a novel approach to extending the local-global principle to equations with degree greater than $2$. In this paper, we introduce the projective Hasse norm principle, generalizing the Hasse norm principle to multiple fields and asking whether a line through the origin that contains a simultaneous norm locally in every field must also contain a norm globally in every field. We show that the projective Hasse norm principle is independent of the conjunction of Hasse norm principles in all of the constituent fields in the general case, and that the projective principle holds whenever the fields are all Galois and jointly linearly disjoint, without assuming their individual Hasse norm principles. We also give a criterion in terms of their Galois groups and prove that the implication holds whenever the Galois group of their compositum has fourth-power-free order. A counterexample of Demarche and Wei shows that this bound is sharp. We also prove an analogue of the Hasse norm theorem for the projective Hasse norm principle, namely that the projective Hasse norm principle holds for every finite family of cyclic extensions.

comments
30 pages. Comments are welcome
fields
Number Theory
pdf ↗ page arXiv:2410.11159 ↗

We propose and analyze a framework for mean-field Markov games under model uncertainty. In this framework, a state-measure flow describing the collective behavior of a population affects the given reward function as well as the unknown transition kernel of the representative agent. The agent's objective is to choose an optimal Markov policy in order to maximize her worst-case expected reward, where worst-case refers to the most adverse scenario among all transition kernels considered to be feasible to describe the unknown true law of the environment. We prove the existence of a mean-field equilibrium under model uncertainty, where the agent chooses the optimal policy that maximizes the worst-case expected reward, and the state-measure flow aligns with the agent's state distribution under the optimal policy and the worst-case transition kernel. Moreover, we prove that for suitable multi-agent Markov games under model uncertainty the optimal policy from the mean-field equilibrium forms an approximate Markov-Nash equilibrium whenever the number of agents is large enough.

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

In the first part of the manuscript, we establish several consistency results concerning Woodin's HOD hypothesis and large cardinals around the level of extendibility. First, we prove that the first extendible cardinal can be the first strongly compact in HOD. Second, answering a question in \cite{CFH}, we prove that the first supercompact cardinal can be the first strongly compact, non supercompact, of HOD. We extend a former result of Woodin by showing that under the HOD hypothesis the first extendible cardinal is $C^{(1)}$-supercompact in HOD. We also show that the first cardinal-correct extendible may not be extendible, thus answering a question by Gitman and Osinski \cite[\S9]{GitOsi}. In the second part of the manuscript, we discuss the extent to which weak covering can fail below the first supercompact cardinal $δ$ in a context where the HOD hypothesis holds. Answering a question of Cummings et al. \cite{CumFriGol}, we show that under the $\mathrm{HOD}$ hypothesis there are many singulars $κ<δ$ where $\mathrm{cf}^{\mathrm{HOD}}(κ)=\mathrm{cf}(κ)$ and $κ^{+\mathrm{HOD}}=κ^{+}.$ In contrast, we also show that the $\mathrm{HOD}$ hypothesis is consistent with $δ$ carrying a club of $\mathrm{HOD}$-regulars cardinals $κ$ such that $κ^{+\mathrm{HOD}}<κ^{+}$. Finally, we close the manuscript with a discussion about the $\mathrm{HOD}$ hypothesis and $ω$-strong measurability.

fields
Logic
pdf ↗ page arXiv:2411.03558 ↗

We study two new classes of Poisson-type algebras, namely, $δ$-Poisson and transposed $δ$-Poisson algebras. We show that these algebras are related to many interesting identities; in particular, they are related to shift associative algebras, $F$-manifold algebras, algebras of Jordan brackets, etc. We classify simple $δ$-Poisson and transposed $δ$-Poisson algebras and find their depolarizations. We study the Koszulity and self-duality of the $δ$-Poisson and mixed-Poisson operads. Bases of the free $δ$-Poisson and mixed-Poisson algebras generated by a countable set $X$ are constructed.

journal
H. Abdelwahab, I. Kaygorodov, B. Sartayev, $δ$-Poisson and transposed $δ$-Poisson algebras, Journal of Non-Associative Structures, 1 (2026), no. 1, 6
fields
Rings and Algebras
pdf ↗ page arXiv:2411.05490 ↗

We study the equivariant cohomology classes of torus-equivariant subvarieties of the space of matrices. For a large class of torus actions, we prove that the polynomials representing these classes (up to suitably changing signs) are covolume polynomials in the sense of Aluffi. We study the cohomology rings of complex varieties in terms of Macaulay inverse systems over $\mathbb{Z}$. As applications, we show that under certain conditions, the Macaulay dual generator is a denormalized Lorentzian polynomial in the sense of Brändén and Huh, and we give a characteristic-free extension (over $\mathbb{Z}$) of the result of Khovanskii and Pukhlikov describing the cohomology ring of toric varieties in terms of volume polynomials.

comments
to appear in International Mathematics Research Notices
fields
Algebraic Geometry, Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2411.17572 ↗

Information from related source studies can often enhance the findings of a target study. However, the distribution shift between target and source studies can severely impact the efficiency of knowledge transfer. In the high-dimensional regression setting, existing transfer approaches mainly focus on the parameter shift. In this paper, we focus on the high-dimensional quantile regression with knowledge transfer under three types of distribution shift: parameter shift, covariate shift, and residual shift. We propose a novel transferable set and a new transfer framework to address the above three discrepancies. Non-asymptotic estimation error bounds and source detection consistency are established to validate the availability and superiority of our method in the presence of distribution shift. Additionally, an orthogonal debiased approach is proposed for statistical inference with knowledge transfer, leading to sharper asymptotic results. Extensive simulation results as well as real data applications further demonstrate the effectiveness of our proposed procedure.

comments
63 pages
fields
Statistics Theory
pdf ↗ page arXiv:2411.19933 ↗

We present a novel class of projected gradient (PG) methods for minimizing a smooth but not necessarily convex function over a convex compact set. We first provide a novel analysis of the constant-stepsize PG method, achieving a unified iteration complexity for finding an approximate stationary point for convex and nonconvex problems. We then develop an "auto-conditioned" projected gradient (AC-PG) variant that achieves the same iteration complexity without requiring the input of the Lipschitz constant of the gradient or any line search procedure. The key idea is to estimate the Lipschitz constant using first-order information gathered from the previous iterations, and to show that the error caused by underestimating the Lipschitz constant can be properly controlled. We then generalize the PG methods to the stochastic setting, by proposing a stochastic projected gradient (SPG) method and a variance-reduced stochastic gradient (VR-SPG) method, achieving new unified complexity bounds in different oracle settings. We also present auto-conditioned stepsize policies for both stochastic PG methods and establish comparable convergence guarantees.

fields
Optimization and Control
pdf ↗ page arXiv:2412.14291 ↗

We study continuous-time mean–variance portfolio selection in markets where stock prices are diffusion processes driven by observable factors that are also diffusion processes, yet the coefficients of these processes are unknown. Based on the recently developed reinforcement learning (RL) theory for diffusion processes, we present a general data-driven RL approach that learns the pre-committed investment strategy directly without attempting to learn or estimate the market coefficients. For multi-stock Black–Scholes markets without factors, we further devise an algorithm and prove its performance guarantee by deriving a sublinear regret bound in terms of the Sharpe ratio. We then carry out an extensive empirical study implementing this algorithm to compare its performance and trading characteristics, evaluated under a host of common metrics, with a large number of widely employed portfolio allocation strategies on S\&P 500 constituents. The results demonstrate that the proposed continuous-time RL strategy is consistently among the best, especially in a volatile bear market, and decisively outperforms the model-based continuous-time counterparts by significant margins.

comments
99 pages, includes appendix. Accepted for publication in Management Science. Corrected author layout and proof headings
fields
Optimization and Control
pdf ↗ page arXiv:2412.16175 ↗

Causal models in statistics are often described using acyclic directed mixed graphs (ADMGs), which contain directed and bidirected edges and no directed cycles. This article surveys various interpretations of ADMGs, discusses their relations in different sub-classes of ADMGs, and argues that one of them—the noise expansion (NE) model—should be used as the default interpretation. Our endorsement of the NE model is based on two observations. First, in a subclass of ADMGs called exogenously bidirected graphs (which retain most of the good properties of directed acyclic graphs and bidirected graphs), the NE model is equivalent to many other interpretations, including the ordinary Markov and nested Markov models. Second, the NE model for an arbitrary ADMG is exactly the union of the observed margins of NE models on its exogenously bidirected expansions. This property is referred to as completeness, as it shows that the model does not commit to any specific latent variable explanation. In proving the nested Markov property, we also develop an ADMG-based theory for causality and its complete characterization via the potential outcome calculus. Finally, we compare the NE model with the closely related but different interpretation of ADMGs as directed acyclic graphs (DAGs) with latent variables that is commonly used in the literature. We argue that the ``latent DAG'' interpretation is mathematically unnecessary, makes obscure ontological assumptions, and discourages practitioners from deliberating over important structural assumptions.

comments
38 pages
fields
Statistics Theory
pdf ↗ page arXiv:2501.03048 ↗

Quantales are well known in logic and computer science, and categories enriched in them unify ordered, metric, relational, and tropical structures. Problems in dynamic programming, synchronization, and discrete event systems require reconciling local data, represented by objects in a quantale-enriched category, across the edges of a network, represented by an undirected graph. Concurrently, replacing inner products with hom-objects and linear adjoints with adjoint functors initiates a categorification of graph and sheaf Laplacians, with a view toward enrichment in larger monoidal categories and bicategories. To this end, we lay the foundations for an enriched harmonic analysis on graphs through cellular sheaves of quantale-enriched categories and a Laplace operator that we call the Lawvere Laplacian. Over an arbitrary unital quantale, the weighted global sections of such a sheaf are the vertex data that agree across every edge up to the tolerances of a weight function. They form the quantale-enriched category of natural transformations from a weight diagram into the sheaf, which is a weighted limit when the quantale is commutative. When the restriction maps have right adjoints, we prove that the weighted global sections are the suffix points of the Lawvere Laplacian, which are the equilibria of its harmonic flow. Under a continuity hypothesis, the harmonic flow converges to the greatest weighted global section below its initial cochain, and for central weight functions the weighted global sections form a complete coreflective subcategory of the cochains. Instances of the theory include the Bellman–Ford iteration over the Lawvere quantale, the reconciliation of local cost estimates, quantale and clock synchronization, and coupled max-plus discrete event systems.

fields
Category Theory
pdf ↗ page arXiv:2501.03890 ↗

We develop an inductive method for generalised pairs (g-pairs) without the NQC assumption. It is based on $P$-trivial MMPs, whose steps are trivial with respect to a given nef divisor $P$. For klt g-pairs, if $P$ is numerically equivalent to an effective divisor, we perturb the boundary so that any MMP on $K_X+B+M+αP$ is $P$-trivial for $α\gg0$. For lc g-pairs, the components with coefficient one cannot be perturbed, so we use induction on lc centres. If $K_X+B+M-P$ is a $\mathbb{Q}$-divisor, then local Cartier indices control the coefficients under divisorial adjunction, and we prove a special termination. This includes the case $P=0$, where $K_X+B+M$ is a $\mathbb{Q}$-divisor. As applications, we prove that a projective lc g-pair $(X,B+M)$ of dimension $3$ has a minimal model if $K_X+B+M$ birationally has a Nakayama-Zariski decomposition with nef positive part and either $K_X+B+M\equiv D\geq0$ or $M\equiv D\geq0$. We also prove this for klt g-pairs in arbitrary dimension. In dimension $4$, the last condition can be replaced by the log abundance of the nef data. For usual pairs, this is a theorem of Birkar and the author.

comments
28 pages. All comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2501.07551 ↗

Given a sequence of integers $(n_k)_{k \in \mathbb{N}}$ satisfying $\liminf_{k \rightarrow \infty}\frac{n_{k+1}}{n_k} \ge q > 1$, a scheme of real-valued weights $(c_{k,N})_{k \leq N}$, and a function $f: \mathbb{T} = \mathbb{R}/\mathbb{Z} \to \mathbb{R}$, it is a classical problem to determine whether \[ S_N(x):=\frac{\sum_{k=1}^N c_{k,N} f(n_k x)}{ \sqrt{\sum_{k=1}^N c_{k,N}^2}} \] converges to a normal distribution as $N \rightarrow \infty$. This question can be traced back to early works of Kac and Erdős and has since then been investigated. It is well known that the asymptotic behavior of $S_N$ is determined not only by the analytic properties of $f$, but also by the arithmetic properties of the sequence $(n_k)_{k \in \mathbb{N}}$ and by the subtle interaction between the two. In this article, we identify conditions on $(n_k)_{k \in \mathbb{N}}$, $f$ and $(c_{k,N})_{k \leq N}$ that can be regarded as minimal for a central limit theorem to hold for $S_N$. This addresses a question raised by Mark Kac [Ann. of Math., 1946].

comments
24 pages, 2 figures. Incorporated referee suggestions; to appear in J. London Math. Soc
fields
Probability, Dynamical Systems, Number Theory
pdf ↗ page arXiv:2501.12763 ↗

We study properties of compactly supported $p$-adic pro-étale cohomology of smooth partially proper rigid analytic varieties. In particular, we prove a comparison theorem, in a stable range, with compactly supported syntomic cohomology, which is built from compactly supported Hyodo-Kato and ${\mathcal B}^+_{\rm dr}$-cohomologies. We derive from that a (limited version of a) fundamental diagram.

comments
Version accepted for publication at Nagoya Journal
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2501.13651 ↗

Given a graph $F$, a graph $G$ is weakly $F$-saturated if all non-edges of $G$ can be added in some order so that each new edge introduces a copy of $F$. The weak saturation number $\operatorname{wsat}(n, F)$ is the minimum number of edges in a weakly $F$-saturated graph on $n$ vertices. Bollobás initiated the study of weak saturation in 1968 to study percolation processes, which originated in biology and have applications in physics and computer science. It was shown by Alon that for each $F$, there is a constant $w_F$ such that $\operatorname{wsat}(n, F) = w_Fn + o(n)$. We characterize all possible rational values of $w_F$, proving in particular that $w_F$ can equal any rational number at least $\frac 32$.

comments
18 pages, 3 figures. Revised according to referee comments
fields
Combinatorics
pdf ↗ page arXiv:2501.15686 ↗

We continue our local analysis of groups interpretable in various dp-minimal valued fields, as introduced in [8]. We associate with every infinite group $G$ interpretable in those fields an infinite type-definable infinitesimal subgroup $ν(G)$, generated by the four infinitesimal subgroups $ν_D(G)$ associated with the distinguished sorts $K$, $\textbf{k}$, $Γ$ and $K/\mathcal{O}$. To show that $ν(G)$ is type-definable, we show that the resulting subgroups $ν_D(G)$ commute with each other as $D$ ranges over the four distinguished sorts. We then study the basic properties of $ν(G)$. Among others, we show that $ν(G_1\times G_2)=ν(G_1)\times ν(G_2)$ and that if $G_1\le G$ is a definable subgroup then $ν(G_1)$ is relatively definable in $ν(G)$. We also discuss possible connections between $\mathrm{dp\text{-}rk}(ν(G))$ and elimination of imaginaries.

fields
Logic
pdf ↗ page arXiv:2502.08163 ↗

There has recently been significant interest in fault tolerant spanners, which are spanners that still maintain their stretch guarantees after some nodes or edges fail. This work has culminated in an almost complete understanding of the three-way tradeoff between stretch, sparsity, and number of faults tolerated. However, despite some progress in metric settings, there have been no results to date on the tradeoff in general graphs between stretch, lightness, and number of faults tolerated. We initiate the study of light edge fault tolerant (EFT) graph spanners, obtaining the first such results. First, we observe that lightness can be unbounded if we use the traditional definition (normalizing by the MST). We then argue that a natural definition of fault-tolerant lightness is to instead normalize by a min-weight fault tolerant connectivity preserver; essentially, a fault-tolerant version of the MST. However, even with this, we show that it is still not generally possible to construct $f$-EFT spanners whose weight compares reasonably to the weight of a min-weight $f$-EFT connectivity preserver. In light of this lower bound, it is natural to then consider bicriteria notions of lightness, where we compare the weight of an $f$-EFT spanner to a min-weight $(f' > f)$-EFT connectivity preserver. The most interesting question is to determine the minimum value of $f'$ that allows for reasonable lightness upper bounds. Our main result is a precise answer to this question: $f' = 2f$. In particular, we show that the lightness can be untenably large (roughly $n/k$ for a $k$-spanner) if one normalizes by the min-weight $(2f-1)$-EFT connectivity preserver. But if one normalizes by the min-weight $2f$-EFT connectivity preserver, then we show that the lightness is bounded by just $O(f^{1/2})$ times the non-fault tolerant lightness (roughly $n^{1/k}$, for a $(1+ε)(2k-1)$-spanner).

comments
Appeared at ICALP 2025; this version corrects some errors from the ICALP version
fields
Combinatorics
pdf ↗ page arXiv:2502.10890 ↗

We present a new method for generating confidence sets within the split conformal prediction framework. Our method performs a trainable transformation of any given conformity score to improve conditional coverage while ensuring exact marginal coverage. The transformation is based on an estimate of the conditional quantile of conformity scores. The resulting method is particularly beneficial for constructing adaptive confidence sets in multi-output problems where standard conformal quantile regression approaches have limited applicability. We develop a theoretical bound that captures the influence of the accuracy of the quantile estimate on the approximate conditional validity, unlike classical bounds for conformal prediction methods that only offer marginal coverage. We experimentally show that our method is highly adaptive to the local data structure and outperforms existing methods in terms of conditional coverage, improving the reliability of statistical inference in various applications.

comments
Corrected Lemma 1 and the finite-sample conditional coverage bounds. Revised the proofs for local quantile regression and asymptotic conditional validity
fields
Statistics Theory
pdf ↗ page arXiv:2502.16336 ↗

Relative to an inaccessible cardinal, it is consistent with ZF + DC that there exists an ultrafilter $U$ on $ω$ such that two infinite ultraproducts of finite sets, $\prod A_n / U$ and $\prod B_n / U$, have the same cardinality if and only if $0 < \lim_U |A_n|/|B_n| < \infty$. In particular, this holds in $W[U]$, where $W$ is the Solovay Model and $U$ is $[ω]^ω$-generic.

fields
Logic
pdf ↗ page arXiv:2503.00310 ↗

We prove that smooth reparametrizations of the geodesic flow on a manifold of constant negative curvature are contact Anosov flows. In particular we give a new class of exponentially mixing Anosov flows. Moreover, this introduces the notion of $C^0$-contact and we prove that the classical Gray stability theorem that is known in the smooth case fails in this setting.

comments
A fatal mistake in the previous argument
fields
Dynamical Systems
pdf ↗ page arXiv:2503.00454 ↗

We study the differential geometry of coherent manifolds modelled on convenient vector spaces and apply it to coherent quantization. A smooth coherent product determines geometric structures on the label manifold. We construct a common invariant domain for the quantizations of coherent vector fields and of coherent diffeomorphisms with smooth diffeomorphic adjoints. These quantizations are distinguished operators on the associated quantum space and satisfy commutator, covariance, and formal adjoint relations. Their coherent matrix elements can be calculated by differentiation and substitution in the coherent product. Extending the operators to the common invariant domain leaves their Hilbert space closures unchanged. Motions in subgroups of diffeomorphisms give rise to Lie algebras of generators without requiring a Lie group structure on the subgroup. Suitable coherent motions recover the infinitesimal quantization by differentiation. We express quantum dynamics through coherent matrix elements and obtain a coherent action principle by restricting the quantum action to coherent states. For Klauder spaces, the construction gives creation and annihilation operators, the canonical commutation relations, Segal fields, Weyl operators, and normal ordering on the common invariant domain.

comments
52 pages. Substantial revision of "Coherent manifolds". We construct a common invariant domain for finite and infinitesimal quantization by adjoining iterated derivatives of coherent states. We extend the theory of motions to subgroups of diffeomorphisms without assuming a Lie group structure and revise the applications to variational principles and bosonic quantization on Klauder spaces
fields
Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2503.09827 ↗

Given $d>0$ and a positive integer $n$, let $G$ be a triangle-free graph on $n$ vertices with average degree $d$. With an elegant induction, Shearer (1983) tightened a seminal result of Ajtai, Komlós and Szemerédi (1980/1981) by proving that $G$ contains an independent set of size at least $(1+o(1))\frac{\log d}{d}n$ as $d\to\infty$. By a generalisation of Shearer's method, we prove that the number of independent sets in $G$ must be at least $\exp\left((1+o(1))\frac{(\log d)^2}{2d}n\right)$ as $d\to\infty$. This improves upon results of Cooper and Mubayi (2014) and Davies, Jenssen, Perkins, and Roberts (2018). Our method also provides good lower bounds on the independence polynomial of $G$, one of which implies Shearer's result itself. As certified by a classic probabilistic construction, our bound on the number of independent sets is sharp to several leading terms as $d\to\infty$.

comments
12 pages, 1 figure; v2 accepted to Combinatorica
fields
Combinatorics, Probability
pdf ↗ page arXiv:2503.10002 ↗

In this paper, we study an insulation problem that seeks the optimal distribution of a fixed amount $m>0$ of insulating material coating an insulated boundary $Γ_I\subseteq \partialΩ$ of a thermally conducting body $Ω\subseteq \mathbb{R}^d$, $d\in \mathbb{N}$. The thickness of the thin insulating layer $Σ_{I}^{\varepsilon}$ is given locally via $\varepsilon \mathtt{d}$, where $\mathtt{d}\colon Γ_{I}\to [0,+\infty)$ specifies the (to be determined) distribution of the insulating material. We establish $Γ(L^2(\mathbb{R}^d))$-convergence of the problem (as $\varepsilon\to 0^+$). Different from the existing literature, which predominantly assumes that the thermally conducting body $Ω$ has a $C^{1,1}$-boundary, we merely assume that $Γ_I$ is piece-wise flat. To overcome this lack of boundary regularity, we define the thin insulating boundary layer $Σ_{I}^{\varepsilon}$ using a Lipschitz continuous transversal vector field rather than the outward unit normal vector field. The piece-wise flatness condition on $Γ_I$ is only needed to prove the $\liminf$-estimate. In fact, for the $\limsup$-estimate is enough that the thermally conducting body $Ω$ has a $C^{0,1}$-boundary.

comments
17 pages, 4 figures. Corrected typos and clarified the proof of Lemma 5.3
journal
SIAM J. Math. Anal. 58(1) (2026), 450-470
fields
Analysis of PDEs
pdf ↗ page arXiv:2503.11903 ↗

For a linear operator $T$ bounded from $L^p(Y)$ to $L^q(X)$, the Christ–Kiselev theorem gives $L^p \to L^q$ bounds for the maximal function $T^{*}$ associated to a filtration on $Y$. This result has been extended to the multiparameter setting, establishing bounds for the maximal function associated to a product of filtrations. In this note, we strengthen these results by proving $ρ$-variational bounds for the multiparameter truncations when $ρ>p$. Furthermore, we give a multilinear extension of the Christ–Kiselev theorem, establishing strong variational bounds for the multiparameter truncations for a general multilinear operator.

comments
To appear in Bulletin of the London Mathematical Society, 19 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2503.22844 ↗

Graph alignment - identifying node correspondences between two graphs - is a fundamental problem with applications in network analysis, biology, and privacy research. While substantial progress has been made in aligning correlated Erdős-Rényi graphs under symmetric settings, real-world networks often exhibit asymmetry in both node numbers and edge densities. In this work, we introduce a novel framework for asymmetric correlated Erdős-Rényi graphs, generalizing existing models to account for these asymmetries. We conduct a rigorous theoretical analysis of graph alignment in the sparse regime, where local neighborhoods exhibit tree-like structures. Our approach leverages tree correlation testing as the central tool in our polynomial-time algorithm, MPAlign, which achieves one-sided partial alignment under certain conditions. A key contribution of our work is characterizing these conditions under which asymmetric tree correlation testing is feasible: If two correlated graphs $G$ and $G'$ have average degrees $λs$ and $λs'$ respectively, where $λ$ is their common density and $s,s'$ are marginal correlation parameters, their tree neighborhoods can be aligned if $ss' > α$, where $α$ denotes Otter's constant and $λ$ is supposed large enough. The feasibility of this tree comparison problem undergoes a sharp phase transition since $ss' \leq α$ implies its impossibility. These new results on tree correlation testing allow us to solve a class of random subgraph isomorphism problems, resolving an open problem in the field.

journal
Jakob Maier, Laurent Massoulié, Asymmetric graph alignment and the phase transition for asymmetric tree correlation testing. Math. Stat. Learn. 9 (2026), no. 3/4, pp. 247 to 335
fields
Information Theory
pdf ↗ page arXiv:2504.02299 ↗

Given a probability measure with density, Fermat distances and density-driven metrics are conformal transformations of the Euclidean metric that shrink distances in high density areas and enlarge distances in low density areas. Although they have been widely studied and have shown to be useful in various machine learning tasks, they are limited to measures with density (with respect to Lebesgue measure, or volume form on manifold). In this paper, by replacing the density with the Distance-to-Measure, we introduce a new metric, the Fermat Distance-to-Measure, defined for any probability measure in $\mathbb{R}^d$. We derive strong stability properties for the Fermat Distance-to-Measure with respect to the measure and propose an estimator from random sampling of the same measure, featuring an explicit bound on its convergence rate.

fields
Statistics Theory
pdf ↗ page arXiv:2504.02381 ↗

We prove the Kudla–Rapoport conjecture for unramified unitary groups with maximal parahoric level structure. Our approach differs from the local proof of C. Li and W. Zhang. We reduce the conjecture to a global intersection problem using local-global compatibility. Then we apply an inductive procedure based on the modularity of generating series of global special divisors. This strategy follows the framework developed in the proof of the arithmetic fundamental lemma by W. Zhang and Mihatsch–Zhang and arithmetic transfer identities by Z. Zhang and Luo–Mihatsch–Zhang.

comments
Major revision: serious gap in the analytic part fixed; exposition improved
fields
Number Theory
pdf ↗ page arXiv:2504.18528 ↗

A crystallization is an edge-colored graph encoding a contracted triangulation of a closed PL manifold, providing a combinatorial framework for studying PL-manifold invariants. In this framework, we determine the regular genus of several important $4$-manifolds. We first prove that $\mathcal{G}(\mathbb{S}^2\times\mathbb{S}^1\times\mathbb{S}^1)=6$, thereby resolving a conjecture on the regular genus of $\mathbb{S}^2\times\mathbb{S}^1\times\mathbb{S}^1$. We also establish that $\mathcal{G}(\mathbb{S}^1\times\mathbb{S}^1\times\mathbb{S}^1\times\mathbb{S}^1)=16$. These computations lead to further observations on the regular genus of the $n$-torus and motivate the conjecture $\mathcal{G}(\mathbb{T}^n)=1+\frac{(n+1)!(n-3)}{8}$ for $n\geq 5$. We then apply our combinatorial methods to small covers. For the simple polytope $Δ^2\timesΔ^2$, we classify the corresponding small covers up to Davis-Januszkiewicz equivalence and obtain exactly seven equivalence classes. One of these is $\mathbb{RP}^2\times\mathbb{RP}^2$, while the remaining six are $\mathbb{RP}^2$-bundles over $\mathbb{RP}^2$. We prove that all seven small covers have regular genus $8$. Thus, the paper provides regular genus computations for a collection of $4$-manifolds arising from products and small covers. The approach is purely combinatorial and relies on various combinatorial moves.

comments
25 Pages, 15 figures
fields
Geometric Topology, Combinatorics
pdf ↗ page arXiv:2506.01315 ↗

We study the statistical accuracy of Schrödinger bridge models based on an Ornstein-Uhlenbeck reference process. Given a known, compactly supported initial distribution and independent samples from an unknown target distribution, we estimate a right Schrödinger log-potential by minimizing empirical Kullback-Leibler (KL) risk over a prescribed function class. For bounded sub-Gaussian target densities, potentially with unbounded support, we establish a non-asymptotic high-probability oracle inequality for the KL-divergence between the target and estimated terminal marginals. Under additional two-sided Gaussian bounds and smoothness assumptions on the target log-density, we derive approximation guarantees for sparse ReLU networks and establish a KL convergence rate of $\widetilde{O}(n^{-2s / (2s + d)})$ for exact empirical risk minimization. This matches, up to logarithmic factors, the classical nonparametric KL-risk convergence exponent, while allowing target densities on $\mathbb R^d$ whose tails are controlled by Gaussian envelopes.

comments
62 pages, 2 figures
fields
Statistics Theory
pdf ↗ page arXiv:2506.03043 ↗

We consider the Lasserre hierarchy for computing bounds on the stability number of graphs. The semidefinite programs (SDPs) arising from this hierarchy involve large matrix variables and many linear constraints, which makes them difficult to solve using interior-point methods. We propose solving these SDPs using the alternating direction method of multipliers (ADMM). When the second level of the Lasserre hierarchy for a given graph is intractable for the ADMM, we consider an intermediate-level relaxation of the hierarchy. To warm-start the ADMM, we use an optimal solution from the first level of the Lasserre hierarchy, which is equivalent to the well-known Lovász theta function. Additionally, we use this solution to determine which degree two monomials to add in the Lasserre hierarchy relaxation to obtain an intermediate level between 1 and 2. Computational results demonstrate that our approach yields strong bounds on the stability number, which are computable within reasonable running times. We provide {improved} bounds on the stability number of various graphs from the literature.

fields
Optimization and Control
pdf ↗ page arXiv:2506.08648 ↗

This paper restructures the author's earlier article in Journal of Homotopy and Related Structures to correct its erroneous invariant-dimension calculations for the fourth Singer algebraic transfer and is written as a replacement for that article. More precisely, we determine the domain and image of the transfer in the degree families $2^{s+t+1}+2^{s+1}-3$ with $t\ne3$ and $2^{s+t}+2^s-2$ with $t\notin\{2,3,4\}$, where $s,t$ are positive integers. Divided-power spikes are basis elements dual to polynomial monomials whose exponents have the form $2^j-1$ for nonnegative integers $j$. Their translates under ${\rm GL}_4(\mathbb F_2)$, the group of invertible $4\times4$ matrices over the field with two elements, generate submodules of the Steenrod kernel, the subspace annihilated by all positive Steenrod squares. We present these submodules as quotients of sums of permutation modules on complete flags, which are chains in $\mathbb F_2^4$ containing one subspace of each dimension $0,1,2,3,4$. Identifying the relation spaces in these presentations gives explicit equivariant comparison isomorphisms. A recursion obtained by separating even and odd exponents in each variable reduces the comparisons to specified identities of finite-dimensional subspaces. These comparisons apply to both complete degree families, including the parameter values omitted from the transfer theorem. Duplication and partial flag embeddings also give theoretical comparisons in specified parameter ranges. As a consequence, Singer's injectivity conjecture holds in rank four in both degree families under the stated parameter restrictions. The cokernel is one-dimensional in homological degree $256$ and zero in every other degree in those ranges.

comments
26 pages. The aim of the present paper is to correct and restructure the author's earlier article, "On Singer's conjecture for the fourth algebraic transfer in certain generic degrees", published in Journal of Homotopy and Related Structures, Vol.19, pp.431--473 (2024), which has now been retracted by the author, and to serve as its definitive replacement
fields
Algebraic Topology, Geometric Topology, Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2506.10232 ↗

The high dimensionality of kinetic equations with stochastic parameters poses major computational challenges for uncertainty quantification (UQ). Traditional Monte Carlo (MC) sampling methods, while widely used, suffer from slow convergence and high variance, which become increasingly severe as the dimensionality of the parameter space grows. To accelerate MC sampling, we adopt a multiscale control variates strategy that leverages low-fidelity solutions from simplified kinetic models to reduce variance. To further improve sampling efficiency and preserve the underlying physics, we introduce surrogate models based on structure and asymptotic preserving neural networks (SAPNNs). These deep neural networks are specifically designed to satisfy key physical properties, including positivity, conservation laws, entropy dissipation, and asymptotic limits. By training the SAPNNs on low-fidelity models and enriching them with selected high-fidelity samples from the full Boltzmann equation, our method achieves significant variance reduction while maintaining physical consistency and asymptotic accuracy. The proposed methodology enables efficient large-scale prediction in kinetic UQ and is validated across both homogeneous and nonhomogeneous multiscale regimes. Numerical results demonstrate improved accuracy and computational efficiency compared to standard MC techniques.

fields
Numerical Analysis
pdf ↗ page arXiv:2506.10636 ↗

Bimodal provability logics are modal logics where the two modalities are interpreted as two formal provability predicates of arithmetic theories. We present modular labelled calculi for four different bimodal provability logics, whose rules arise from the relational semantics of these logics, while the second-order property of Noetherianity of models is enforced using techniques from cyclic proof theory. Completeness with respect to the semantics is established via proof search and countermodel construction. We further present regular and finite variants of the calculi via proof transformations.

comments
40 pages
fields
Logic
pdf ↗ page arXiv:2506.14307 ↗

Algebraic K-theory participates in localization sequences, as first established by Quillen. We identify their boundary maps with the \emph{residue} map from logarithmic TC under the cyclotomic trace, resolving a conjecture of Rognes. As a consequence, we obtain e.g. a trace map from the K-theory of periodic complex K-theory to the logarithmic TC of connective complex K-theory. Moreover, we find that there exists a stable infinity-category C such that TC(C) realizes logarithmic TC for specific log structures, such as the natural ones on discrete valuation rings, connective complex K-theory, and truncated Brown–Peterson spectra. This provides evidence for the existence of a category of modules in the context of logarithmic geometry. We conjecture that such a category can be chosen to reflect additional structure on logarithmic TC, and we give evidence for this for discrete valuation rings.

comments
35 pages, revised version. Introduction rewritten and Section 3.6 added (allowing for the removal of some auxiliary results from v1), otherwise minor changes
fields
Algebraic Topology, Algebraic Geometry, K-Theory and Homology
pdf ↗ page arXiv:2506.14545 ↗

For standard factor graphs (S-FGs), whose local functions are nonnegative-real valued, a popular approximation of the partition function is given by the Bethe approximation, which is also known as the Bethe partition function. Vontobel gave a combinatorial characterization of the Bethe partition function with the help of graph covers. The proof of this characterization heavily relied on the method of types. In this paper, we study double-edge factor graphs (DE-FGs), whose local functions are complex valued and satisfy certain positive-semidefinite constraints. DE-FGs and their partition functions are particularly relevant to quantum information processing. Approximating the partition function of a DE-FG is more difficult than approximating the partition function of an S-FG because the DE-FG partition function is a sum of complex values rather than nonnegative-real values. We develop a Bethe approximation of the partition function of a DE-FG based on sum-product-algorithm (SPA) fixed points. However, one cannot directly apply the method of types to prove a similar graph-cover-based combinatorial characterization of the Bethe partition function as in the case of S-FGs. Despite this, we establish such a combinatorial characterization for a class of DE-FGs that satisfy an easily checkable condition. Towards proving this characterization, we apply a suitable loop-calculus transform (LCT) to DE-FGs. Originally, the LCT was introduced by Chertkov and Chernyak as a special linear transform for S-FGs and later extended by Mori. Our proposed LCT is applicable to both S-FGs and DE-FGs and generalizes prior versions by handling zero-valued SPA fixed-point message components, which are common in DE-FGs. Supported by numerical results, we conjecture that the graph-cover-based combinatorial characterization of the Bethe partition function holds more broadly for DE-FGs.

comments
arXiv admin note: substantial text overlap with arXiv:2412.05942
fields
Information Theory
pdf ↗ page arXiv:2506.16250 ↗

In this paper we show how to extend the large deviation principle for the paths of the Hill, Lane and Sudderth urn model to the case in which the urn increment is not a binary variable. In particular, we extend Theorem 1 of [Stochastic Processes and their Applications, 127 (2017), 3372-3411] to urn processes with integer increments from zero to $K$. The increment probabilities depend on the mean of the preceding increments and are continuous and strictly positive on the entire state interval. We derive the terminal entropy and uniform estimates for the probabilities of individual attainable final values. We identify the zero-cost states and paths. We prove the existence and strict convexity of the normalized limiting cumulant generating function and provide conditions for duality with the entropy. We characterize the realizable continuous concave entropies and construct the corresponding urn probabilities.

comments
153 pages. 10 figures
fields
Probability
pdf ↗ page arXiv:2506.22234 ↗

We study reinforcement learning (RL) for a class of continuous-time stochastic linear-quadratic (LQ) control problems, where volatilities depend on both states and controls while states are scalar-valued and there are no running control rewards, the last feature also leading to the so-called indefinite LQ controls. We propose a model-free, data-driven exploration mechanism that adaptively adjusts entropy regularization by the critic and policy variance by the actor. Unlike the constant or deterministic exploration schedules employed in the existing literature, which require extensive tuning for implementations and ignore learning progress during iterations, our adaptive exploratory approach boosts learning efficiency with minimal tuning. Despite its flexibility, our method achieves a sublinear regret bound that matches the best-known model-free results for this class of LQ problems, which were previously derived only with fixed exploration schedules. Numerical experiments demonstrate that adaptive explorations accelerate convergence and improve regret performance compared to the non-adaptive model-free and model-based counterparts.

comments
31 pages. Author-accepted manuscript, with publication details and updated author notes
journal
IEEE Transactions on Automatic Control, Early Access, pp. 1-16, 16 September 2026
fields
Optimization and Control
pdf ↗ page arXiv:2507.00358 ↗

We study geometrically formal Hermitian metrics on compact complex manifolds, focusing on Dolbeault, Bott-Chern, and Aeppli cohomologies. We establish topological and cohomological obstructions to their existence and we provide a detailed analysis for several classes of compact complex manifolds. We prove that on any blow-up of a Kähler manifold no Kähler metric can be geometrically formal, and that Kähler metrics with nonnegative curvature operator are necessarily geometrically formal.

comments
Revised and expanded version: title changed to "Geometrically formal Hermitian manifolds"; Theorems 6 and 7 of v1 fixed; Calabi-Eckmann results (Theorems 13 and 14 of v1) restricted to standard Hermitian metrics; Blow-up theorem strengthened; new sections on Dolbeault formality of compact Lie groups and geometric Aeppli formality of meta-Abelian solvmanifolds added
fields
Differential Geometry
pdf ↗ page arXiv:2507.10263 ↗

In [Bailo, Carrillo, Hu. SIAM J. Appl. Math. 2023] the authors introduce a finite-volume method for aggregation-diffusion equations with non-linear mobility. In this paper we prove convergence of this method using an Aubin–Simons compactness theorem due to Gallouët and Latché. We use suitable discrete $H^1$ and $W^{-1,1}$ discrete norms. We provide two convergence results. A first result shows convergence with general entropies ($U$) (including singular and degenerate) if the initial datum does not have free boundaries, the mobility is Lipschitz, and the confinement ($V$) and aggregation ($K$) potentials are $W^{2,\infty}_0$. A second result shows convergence when the initial datum has free boundaries, mobility is just continuous, and $V$ and $K$ are $W^{1,\infty}$, but under the assumption that the entropy $U$ is $C^1$ and strictly convex.

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

Two families of directional direct search methods have emerged in derivative-free and blackbox optimization (DFO and BBO), each based on distinct principles: Mesh Adaptive Direct Search (MADS) and Sufficient Decrease Direct Search (SDDS). MADS restricts trial points to a mesh and accepts any improvement, ensuring that none are missed, but at the cost of restricting the placement of trial points. SDDS allows greater freedom by evaluating points anywhere in the space, but accepts only those yielding a sufficient decrease in the objective function value, which may lead to discarding promising points. This work introduces a new class of methods, Adaptive Direct Search (ADS), which uses a novel acceptance rule based on the so-called punctured space, avoiding both mesh and sufficient decrease conditions. ADS enables flexible search while addressing the limitations of MADS and SDDS, and retains the theoretical foundations of directional direct search. Computational results in constrained and unconstrained settings highlight its performance compared to both MADS and SDDS.

fields
Optimization and Control
pdf ↗ page arXiv:2507.23054 ↗

Let $β\equivβ^{(2n)}$ be a real bivariate sequence of degree $2n$. We study the existence of representing measures for $β$ supported in the curve $y=x^{d}$ ($d\ge 1$) in the case when all column dependence relations in the moment matrix $M_n(β)$ are generated by the relation $Y=X^{d}$. We prove that the core variety of $β$, $\mathcal{CV}(L_β)$, is nonempty (equivalently, representing measures exist) if and only if $C$, the partially defined \textit{core matrix} of $β$, admits a positive, recursively generated completion $C[A]$. Moreover, $\mathcal{CV}(L_β)$ is the entire curve $y=x^{d}$ if and only if there is a positive definite completion $C[A]$. In the remaining case, if there is a measure, it is unique and finitely atomic. For $d = 3$, we use these results to compute the core variety of $β$ and give new characterizations of the existence of representing measures, which complement a result of the first author.

comments
32 pages
journal
Adv. Oper. Theory 12, 5 (2027)
fields
Functional Analysis
pdf ↗ page arXiv:2508.10375 ↗

Let $X$ be a Riemann surface with canonical bundle $K_X$ and holomorphic tangent bundle $T_X=K_X^{-1}$. For each integer $r\geq 2$, each $q\in H^0(K_X^r)$, and each choice of a square root of $K_X$, we obtain a cyclic Higgs bundle. A diagonal harmonic metric $h=(h_1,\ldots,h_r)$ induces Hermitian metrics $H_j=h_j^{-1}\otimes h_{j+1}$ on $T_X$ for $j=1,\ldots,r-1$, together with a possibly degenerate Hermitian metric $H_r$ determined by $h_1,h_r$, and $q$. We call $h$ complete if the Kähler metrics induced by $H_1,\ldots,H_{r-1}$ are all complete. Li–Mochizuki proved that if $q$ is nonzero unless $X$ is hyperbolic, there exists a unique complete harmonic metric on the corresponding cyclic Higgs bundle satisfying $\det(h)=1$. The Hitchin equation depends on $q$ only through the subharmonic weight $φ_q=\frac{1}{r}\log|q|^2$ on $K_X$. We establish uniqueness of complete solutions with determinant $1$ for general subharmonic weight functions $\varphi$ whose exponentials are $C^2$ outside a compact subset of $X$. On the unit disc $\mathbb D=\{z\in\mathbb C:|z|<1\}$, we also prove that a real complete solution exists for every subharmonic weight function. We further establish a monotone approximation theorem. If $\varphi_ε$ are smooth subharmonic weight functions on the discs $\mathbb D_ε=\{z\in\mathbb C:|z|<1-ε\}$ decreasing to $\varphi$ as $ε\searrow0$, the corresponding complete solutions $h_ε$, normalized by $\det(h_ε)=1$, converge monotonically to a complete solution $h$ associated with $\varphi$.

comments
This paper has been withdrawn following its merger with arXiv:2610.23441v1. The combined version is available as arXiv:2610.23441v2
fields
Differential Geometry, Complex Variables
pdf ↗ page arXiv:2508.12848 ↗

We consider continuous-time birth-and-death dynamics in $\mathbb{R}^d$ admitting infinite-volume Gibbs point processes as reversible measures. The birth rates are translation invariant, have finite range, and are uniformly bounded from above and away from zero. For all translation-invariant initial measures, we show that the specific relative entropy is non-increasing along trajectories and that, if the entropy is initially finite, then every long-time weak limit point is a Gibbs point process for the same interaction. Our proofs rest on a lower bound for entropy dissipation in terms of the reduced Palm measure of the evolved law.

comments
Revised version with an extended graphical construction and weaker assumptions on the interaction and on the initial measures; proof strategy essentially unchanged. 54 pages, 1 figure
fields
Probability
pdf ↗ page arXiv:2508.21196 ↗

For a hierarchically hyperbolic group, we give sufficient conditions ensuring that suitable powers of a finite collection of elements generate a right-angled Artin subgroup; under an additional condition, this subgroup is undistorted. We verify these hypotheses in two natural situations: one modeled on mapping class groups, using structural assumptions on the ambient HHG, and one modeled on RAAGs, requiring the chosen elements to be rigidly fully supported. Our results recover known embedding theorems for mapping class groups and extend the non-annular undistortion theorem of Clay–Leininger–Mangahas, while also recovering the Kim–Koberda extension graph theorem for RAAGs.

comments
V4: Updated terminology and references to reflect revisions to the companion paper on RAAG embedding obstructions. V3: Revised Proposition 2.19, corrected its citation, and added a brief proof. V2: Revised the definition of fully supported axial elements and incorporated the referee's comments. Comments are welcome!
fields
Group Theory
pdf ↗ page arXiv:2509.02454 ↗

Charts are oriented labeled graphs in a disk. Every simple surface braid ($2$-dimensional braid) can be described by a chart. Moreover, a chart represents an oriented closed surface embedded in four-space. In this paper, we study such embedded surfaces using charts. Let $Γ$ be a chart. Let ${\rm Cross}(Γ)$ denote the set of all the crossings of $Γ$, and let $Γ_m$ denote the union of all the edges of label $m$. A 4-chart $Γ$ is said to be ${\it linear}$ if every connected component of $$(Γ_1\cup Γ_3)-{\rm Cross}(Γ)$$ is acyclic. In this paper, we prove that after deleting free edges and hoops, every linear minimal $4$-chart with three crossings is lor-equivalent (equivalent under label changes, orientation reversals, and reflections) to the chart describing a $2$-twist-spun trefoil knot.

comments
39 pages, 37 figures
fields
Geometric Topology
pdf ↗ page arXiv:2509.04114 ↗

Let $f$ be a finite signal. The classical uncertainty principle tells us that the product of the support of $f$ and the support of $\hat{f}$, the Fourier transform of $f$, must satisfy $|supp(f)|\cdot|supp(\hat{f})|\geq |G|$. Recently, Iosevich and Mayeli improved the uncertainty principle for signals with Fourier supported on generic sets. This was done by employing the Fourier restriction theory in $L^p$ spaces. In this paper, we extended the $(p,q)$-restriction setting to Orlicz spaces. Then we apply uncertainty principles to the problem of exact recovery, which again extends and recovers the result that Iosevich and Mayeli obtained in Lebesgue spaces.

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

Projective geodesic extensions are reparametrizations of the trajectories of a nonholonomic mechanical system (with only a kinetic energy Lagrangian), in such a way that they can be interpreted as part of the geodesics of a Riemannian metric. We derive necessary and sufficient conditions for the existence of these extensions, in the case where the constrained Lagrangian remains preserved up to a conformal transformation. When the nonholonomic system has a symmetry group (a Chaplygin system), we clarify the relation between projective geodesic extensions and closely related concepts, such as $φ$-simplicity, invariant measures and Hamiltonization. Throughout the paper, new and relevant examples illustrate the key differences between all these concepts.

comments
39 pages. To appear in J. Geom. Phys
fields
Differential Geometry
pdf ↗ page arXiv:2509.15863 ↗

We study infinite Euclidean distance discriminants of algebraic varieties, defined as the loci of data points whose fibers under the second projection from the Euclidean distance correspondence are positive-dimensional. In particular, these discriminants contain all data points with infinitely many critical points for the nearest-point problem. We present computer code that computes the infinite Euclidean distance discriminant, and use it to present numerous varieties with nonempty such discriminants. Moreover, we prove that for any data point, the fiber under the second projection is contained in a finite union of hyperspheres centered at that point. For curves, we include a complete characterization; their infinite Euclidean distance discriminants turn out to be affine linear spaces. Finally, we introduce and characterize skew-tube surfaces in three-dimensional space. By construction, these have a one-dimensional infinite Euclidean distance discriminant. We further demonstrate that many skew-tubes have significantly lower Euclidean distance degrees than generic surfaces of the same degree.

fields
Algebraic Geometry, Differential Geometry, Metric Geometry, Optimization and Control
pdf ↗ page arXiv:2509.17456 ↗

In this paper, we explore how functor-induced isomorphisms are encoded by $G$-matrices. We first show that the Grothendieck group isomorphism induced by a tilting module can be realized via the $G$-matrix of this tilting module. Building on this, we compare $g$-vectors for a tilted algebra and its associated hereditary algebra, and provide $G$-matrix interpretations of the Coxeter transformation, the Nakayama functor, and the Auslander-Reiten translation for suitable algebras. Furthermore, we demonstrate the geometric representations of any Weyl group can be realized by the $G$-matrices of tilting modules or support $τ$-tilting modules arising from generalized preprojective algebras. Consequently, the group generated by the transpose of these $G$-matrices is isomorphic to the corresponding Weyl group. Finally, we show that the Grothendieck group isomorphism induced by a $2$-term silting complex can also be realized via the $G$-matrix of this $2$-term silting complex.

comments
27 pages
fields
Representation Theory
pdf ↗ page arXiv:2509.17781 ↗

For $1\le p<\infty$, let $F^p_\varphi$ be the Fock spaces on ${\mathbb C}^n$ with the weight function $\varphi$ that \(\varphi \in {\mathcal{C}}^{2}\left( {\mathbb{C}}^{n}\right)\) is real-valued and satisfies $ m{ω}_{0} \leq d{d}^{c}\varphi \leq M{ω}_{0} $ for two positive constants \(m\) and \(M\), \({ω}_{0} = d{d}^{c}{\left| z\right| }^{2}\) is the Euclidean Kähler form on \({\mathbb{C}}^{n}\), \({d}^{c} = \frac{\sqrt{-1}}{4}\left( {\bar{\partial } - \partial }\right)\). In this paper, we completely characterize those positive Borel measure $μ$ on ${\mathbb C}^n$ so that the induced Toeplitz operators $T_μ$ is $r$-summing on $F_{\varphi}^{p}$ for $r \ge 1$.

comments
Updated to the accept version, corrected typos, results unchanged
journal
Publised in International Mathematics Research Notices, Volume 2026, Issue 22
fields
Functional Analysis, Complex Variables
pdf ↗ page arXiv:2509.19967 ↗

This paper proposes a novel approach for Asset-Liability Management (ALM) by employing continuous-time Reinforcement Learning (RL) with a linear-quadratic (LQ) formulation that incorporates both interim and terminal objectives. We develop a model-free, policy gradient-based soft actor-critic algorithm tailored to ALM for dynamically synchronizing assets and liabilities. To ensure an effective balance between exploration and exploitation with minimal tuning, we introduce adaptive exploration for the actor and scheduled exploration for the critic. Our empirical study evaluates this approach against two enhanced traditional financial strategies, a model-based continuous-time RL method, and three state-of-the-art RL algorithms. Evaluated across 200 randomized market scenarios, our method achieves higher average rewards than all alternative strategies, with rapid initial gains and sustained superior performance. The outperformance stems not from complex neural networks or improved parameter estimation, but from directly learning the optimal ALM strategy without learning the environment.

comments
8 pages, 2 figures. Updated publication information and corrected a typo in the caption of Figure 1
journal
Proceedings of the 6th ACM International Conference on AI in Finance (ICAIF 2025), pp. 360-368, 2025
fields
Optimization and Control
pdf ↗ page arXiv:2509.23280 ↗

Periodic tangles are 1-dimensional submanifolds in the 3-space with translational symmetry. In this paper, we define the linking numbers for singly, doubly, and triply periodic tangles using appropriate motifs and show that they are well-defined and invariant under link-homotopy. Furthermore, we extend the notion to the triple linking numbers for singly, doubly, and triply periodic tangles, and the higher order linking numbers for singly periodic tangles under certain assumptions.

comments
29 pages, 19 figures. v2: The title was changed. Definitions of triply linking numbers for doubly and triply periodic tangles were added
fields
Geometric Topology
pdf ↗ page arXiv:2509.24568 ↗

Motivated by applications to duality theorems for $p$-adic pro-étale cohomology of rigid analytic spaces, we study the category of Topological Vector Spaces in the setting of condensed mathematics. We prove that it contains, as full subcategories, both the category of (topologically) bounded algebraic Vector Spaces and the category of perfect complexes on the Fargues-Fontaine curve. Vector Spaces coming from $p$-adic pro-étale cohomology of smooth partially proper rigid analytic varieties are examples of sheaves belonging to the former category.

comments
Post-referee version
fields
Algebraic Geometry, Functional Analysis, Number Theory
pdf ↗ page arXiv:2509.25981 ↗

We develop a block-activated decomposition algorithm for multi-stage stochastic variational inequalities with nonanticipativity constraints. The algorithm features two computational novelties: (i) At each iteration, it activates only a user-chosen subset of scenarios. (ii) For each activated scenario, it employs the resolvent of the cost operator and the projector onto the constraint set separately. These reduce computational load and enhance tractability, in contrast with existing approaches, which often require evaluating the resolvent of the sum of the cost operator and the normal cone operator of the constraint set. As an application, we demonstrate that in risk-averse stochastic programming with conditional value-at-risk objective functions, our method requires only projecting onto constraint sets, together with solving univariate equations involving the proximity operators of the cost functions, thereby avoiding solving high-dimensional constrained subproblems as required by existing methods.

fields
Optimization and Control
pdf ↗ page arXiv:2509.26198 ↗

The identification of valid inequalities, such as the rounded capacity inequalities (RCIs), is a key component of cutting plane methods for the Capacitated Vehicle Routing Problem (CVRP). While a deep learning-based separation method can learn to find high-quality cuts, our analysis reveals that the model produces fewer cuts than expected because it is insufficiently sensitive to generate a diverse set of generated subsets. This paper proposes an alternative: enhancing the performance of a trained model at inference time through a new test-time search with stochasticity. First, we introduce stochastic edge selection into the graph coarsening procedure, replacing the previously proposed greedy approach. Second, we propose the Graph Coarsening History-based Partitioning (GraphCHiP) algorithm, which leverages coarsening history to identify not only RCIs but also, for the first time, the Framed capacity inequalities (FCIs). Experiments on randomly generated CVRP instances demonstrate the effectiveness of our approach in reducing the dual gap compared to the existing neural separation method. Additionally, our method discovers effective FCIs on a specific instance, despite the challenging nature of identifying such cuts.

fields
Optimization and Control
pdf ↗ page arXiv:2510.00958 ↗

Assuming the abundance conjecture in dimension $d$, we establish a non-algebraicity criterion of foliations: any log canonical foliation of rank $\le d$ with $ν\neqκ$ is not algebraically integrable, answering question of Ambro–Cascini–Shokurov–Spicer. Under the same hypothesis, we prove abundance for klt algebraically integrable adjoint foliated structures of dimension $\le d$ and show the existence of good minimal models or Mori fiber spaces. In particular, when $d=3$, all these results hold unconditionally. Using similar arguments, we solve a problem proposed by Lu and Wu on abundance of surface adjoint foliated structures that are not necessarily algebraically integrable.

comments
30 pages. Accepted version. To appear in Math. Ann
fields
Algebraic Geometry, Dynamical Systems
pdf ↗ page arXiv:2510.04419 ↗

A Kronecker coefficient is the multiplicity of an irreducible representation of a finite group $G$ in a tensor product of irreducible representations. We define Kronecker Hecke algebras and use them as a tool to study Kronecker coefficients in finite groups. We show that the number of simultaneous conjugacy classes in a finite group $G$ is equal to the sum of squares of Kronecker coefficients, and the number of simultaneous conjugacy classes that are closed under elementwise inversion is the sum of Kronecker coefficients weighted by Frobenius-Schur indicators. We use these tools to investigate which finite groups have multiplicity-free tensor products. We introduce the class of doubly real groups, and show that they are precisely the real groups which have multiplicity-free tensor products. We show that non-Abelian groups of odd order, non-Abelian finite simple groups, and most finite general linear groups do not have multiplicity-free tensor products.

comments
Final version accepted to Journal of Algebra
fields
Representation Theory, Group Theory
pdf ↗ page arXiv:2510.04497 ↗

The generalized Jeffreys-type law is formulated as a multi-term time-fractional Jeffreys-type equation, whose dynamics exhibit rich scaling crossover phenomena associated with different diffusion mechanisms. In this work, we provide a microscopic stochastic interpretation of the MT-TFJE through a continuous-time random walk (CTRW) framework with a generalized waiting-time distribution, elucidating the physical mechanisms underlying the scaling crossover. Based on the Laplace-Volterra formulation and spectral analysis, we establish the well-posedness and stability of the MT-TFJE and derive Sobolev regularity estimates under appropriate assumptions on the initial data and source term. We further develop a high-accuracy numerical scheme, termed CIM-CLG, which combines a contour integral method for temporal approximation with a Chebyshev-Legendre Galerkin method for spatial discretization. The proposed method achieves exponential temporal convergence under the stated regularity of the governing equation, together with high-order spatial accuracy. The temporal approximation involves $\mathcal{O}(N)$ independent contour evaluations, while FFT-based transforms have a computational cost of $\mathcal{O}(M^n\log M)$ for spatial dimensions $n=1,2$. The resulting algorithm is naturally parallelizable. Detailed implementation procedures and rigorous error estimates are presented. Extensive numerical experiments in one and two dimensions demonstrate the efficiency, accuracy, and robustness of the proposed method, providing a computationally effective framework for generalized nonlocal diffusion problems.

comments
48pages
fields
Numerical Analysis
pdf ↗ page arXiv:2510.07930 ↗

Large reasoning models (LRMs) have achieved remarkable progress in complex problem-solving tasks. Despite this success, LRMs typically suffer from high computational costs during deployment, highlighting a need for efficient inference. A practical direction is to switch the LRM between thinking and non-thinking modes dynamically. However, such approaches often introduce additional reasoning errors and lack statistical guarantees for the performance loss, which are critical for high-stakes applications. In this work, we propose Probably Approximately Correct (PAC) Reasoning that controls the performance loss under the user-specified tolerance. Specifically, we construct an upper confidence bound on the performance loss and determine a threshold for switching to the non-thinking model. Theoretically, using the threshold to switch between the thinking and non-thinking modes ensures bounded performance loss in a distribution-free manner. Our experiments on reasoning benchmarks show that the proposed method can save computational budgets and control the user-specified performance loss.

comments
Accepted at NeurIPS 2026 (poster). Camera-ready version. Project page: https://zenghao-stat.github.io/pages/pac_reasoning/. Code: https://github.com/Jianguo99/PAC-Reasoning
fields
Statistics Theory
pdf ↗ page arXiv:2510.09133 ↗

These are lecture notes for a mini-course on stochastic sewing, taught at the University of Edinburgh and Beijing Institute of Technology in Spring/Summer 2025. The aim is to introduce the reader to stochastic sewing techniques and to show how they can be successfully applied to study various problems in stochastic analysis, including: regularization by noise for stochastic differential equations driven by Brownian motion, a Lévy process or fractional Brownian motion, the study of averaging operators, and the analysis of numerical algorithms.

fields
Probability
pdf ↗ page arXiv:2510.12165 ↗

The main result of this article is a geometric interpretation of magnitude, a real-valued invariant of metric spaces. We introduce a Euclidean embedding of a (suitable) finite metric space $X$ such that the magnitude of $X$ can be expressed in terms of the `circumradius' of its embedding $S$. The circumradius is the radius of the unique sphere that goes through $S$. We give three applications: First, we describe the asymptotic behaviour of the magnitude of $tX$ as $t\rightarrow \infty$, in terms of the circumradius. Second, we develop a matrix theory for magnitude that leads to explicit relations between the magnitude of $X$ and the magnitude of its subspaces. Third, we identify a new regime in the limiting behaviour of $tX$, and use this to show submodularity-type results for magnitude as a function on subspaces.

comments
18 pages, 2 figures
fields
Metric Geometry
pdf ↗ page arXiv:2510.14684 ↗

We examine second bounded cohomology and mod p homology in finite index subgroups of 1-relator groups and groups with a presentation of positive deficiency. We use this to determine exactly which subgroups of 1-relator groups are boundedly generated.

comments
32 pages, final version before publication
fields
Group Theory
pdf ↗ page arXiv:2510.15469 ↗

Deep hashing encodes high-dimensional image features into compact binary codes, enabling efficient similarity search in large-scale content-based image retrieval, a problem akin to semantic-preserving lossy compression under extreme bit-rate constraints. A fundamental challenge in deep hashing stems from the discrete nature of quantization in generating the codes. W-type regularizations, such as $z\mapsto\||z|-1\|_1$, are widely adopted and empirically effective at pushing network outputs toward binary values. However, existing methods often directly optimize these regularizations without convergence guarantees. While proximal gradient methods offer a promising solution, the coupling between W-type regularizers and neural network outputs results in composite forms that generally lack closed-form proximal solutions. In this paper, using Fenchel duality, we reformulate the nonconvex W-type regularization term through its convex conjugate, yielding a min-max problem with tractable proximal updates. We show that this min-max problem captures the stationarity of the original deep hashing objective up to the quantization error. Building on this problem, we present a stochastic primal-dual hashing algorithm, referred to as DualHash, with oracle complexity guarantees. We derive two algorithm instances: a momentum-based version with $O(\varepsilon^{-4})$ oracle complexity and an improved $O(\varepsilon^{-3})$ version using variance reduction, both for $\varepsilon$-KKT points of the min-max problem, which yield near-stationarity guarantees for the original objective. Experiments on three standard datasets demonstrate competitive retrieval accuracy and reduced quantization error, validating the practical value of DualHash for image retrieval problems. Our implementation of DualHash is available at https://github.com/RailLee/DualHash.

comments
44 pages, 9 figures, 5 tables
fields
Optimization and Control
pdf ↗ page arXiv:2510.18218 ↗

U-statistics are a fundamental class of estimators that generalize the sample mean and underpin much of nonparametric statistics. Although extensively studied in both statistics and probability, key challenges remain: their high computational cost - addressed partly through incomplete U-statistics - and their non-standard asymptotic behavior in the degenerate case, which typically requires resampling methods for hypothesis testing. This paper presents a novel perspective on U-statistics, grounded in hypergraph theory and combinatorial designs. We identify the dependency graph of an incomplete U-statistic with the line graph of its design hypergraph and use Stein's method to derive Berry-Esseen bounds for deterministic designs under full degeneracy. We further extend these results to studentized statistics using a variance estimator tailored to the fully degenerate setting. The resulting bounds establish Gaussian limits for superlinear design sizes with fixed kernel order and accommodate diverging order under separate conditions. We also develop efficient algorithms for constructing equireplicate designs, a subclass of deterministic designs, which yield minimum-variance incomplete U-statistics in the second-order case. Beyond its theoretical contributions, our framework provides permutation-free alternatives to tests based on fully degenerate U-statistics, as demonstrated in experiments with the two-sample Maximum Mean Discrepancy test and a one-sample mean test based on a higher-order U-statistic.

fields
Statistics Theory, Combinatorics
pdf ↗ page arXiv:2510.20755 ↗

This article is about the (minimal) sector containing the numerical range of the principal part of a linear second-order elliptic differential operator defined by a form on closed subspaces $V$ of the first-order Sobolev space $W^{1,2}(Ω)$ incorporating mixed boundary conditions. We relate the angle of sectoriality and the $\mathcal{H}^\infty$-angle of realizations of the elliptic operator to two reference angles: the optimal angle of the $L^2$-realization and the optimal angle of the coefficient function. We thereby consider the operator in several scales of Banach spaces: the Lebesgue space, the negative Sobolev space, and their interpolation scale. For the latter two types of spaces, we rely on recent results regarding the Kato square root property. We focus on minimal assumptions on geometry, and we consider both real and complex coefficients, in particular aiming at explicit estimates built on readily accessible problem data. New results include an explicit estimate for the angle of sectoriality for the elliptic operator on $L^p(Ω)$ with complex coefficients without any assumptions on geometry, which reduces to the known sharp angle for real coefficients, a new estimate on the angle of the sector containing the numerical range of a linear, continuous and coercive Hilbert space operator, and an estimate on the $\mathcal{H}^{\infty}$-angle for the elliptic operator on $L^p(Ω)$ with real coefficients.

fields
Functional Analysis, Analysis of PDEs
pdf ↗ page arXiv:2510.23450 ↗

In this paper, we prove that if $X$ is a weak Asplund space, then $X\times\mathbb R$ is also a weak Asplund space. This resolves an open problem posed by D. G. Larman and R. R. Phelps in 1979 (J. London Math. Soc. (2) 20 (1979), 115-127). The proof combines the Banach-Mazur game, properties of maximal monotone operators, and the G$\mathrm{\hat{a}}$teaux differentiability of Minkowski functionals. Specifically, we introduce an iterative perturbed Minkowski convex cone approximation game method, and establish a theoretical framework to verify the existence of dense differentiability sets for convex functions on product spaces. By relating the properties of convex functions on the base space and the product space via projection mappings, and constructing dense $G_δ$ subsets using sequences of dense open cones, we demonstrate that the product space satisfies the definition of a weak Asplund space.

fields
Functional Analysis
pdf ↗ page arXiv:2510.26827 ↗

In a series of papers, we have considered a non-stationary difference equation which was originally discovered for the deformed Virasoro conformal block. The equation involves mass parameters and, when they are tuned appropriately, the equation is regarded as a quantum KZ equation for $U_q\bigl(A_{1}^{(1)}\bigr)$. We introduce a $\widehat{\mathfrak{gl}}_N$ generalization of the non-stationary difference equation. The Hamiltonian is expressed in terms of $q$-commuting variables and allows both factorized forms and a normal ordered form. By specializing the mass parameters appropriately, the Hamiltonian can be identified with the $R$-matrix of the symmetric tensor representation of $U_q\bigl(A_{N-1}^{(1)}\bigr)$, which in turn comes from the 3D (tetrahedron) $R$-matrix. We conjecture that the affine Laumon partition function of type $A_{N-1}^{(1)}$ gives a solution to our $\widehat{\mathfrak{gl}}_N$ non-stationary difference equation. As a check of our conjecture, we work out the four-dimensional limit and find that the non-stationary difference equation reduces to the Fuji-Suzuki-Tsuda system.

journal
SIGMA 22 (2026), 115, 47 pages
fields
Quantum Algebra, Mathematical Physics
pdf ↗ page arXiv:2510.27142 ↗

In this article, we present a new proof the Murnaghan–Nakayama-type rule for the stable Grothendieck polynomials of Grassmannian type, which was originally established by Nguyen–Hiep–Son–Thuy.

comments
Title has been changed, and minor revisions have been made
journal
Indian Journal of Pure and Applied Mathematics, 2026
fields
Combinatorics, Representation Theory
pdf ↗ page arXiv:2511.00830 ↗

We recast the well-known axiom system of quantum mechanics used by physicists (the Dirac calculus) in the language of Continuous Logic. For the basic version of the axiomatic system we prove that along with the canonical continuous model the axioms have approximate finite models of large sizes, in fact the continuous model is isomorphic to an ultraproduct of finite models. We analyse the continuous logic quantifier corresponding to Dirac integration and show that in finite context it has two versions, local and global, which coincide on Gaussian wave-functions.

fields
Logic
pdf ↗ page arXiv:2511.01900 ↗

Let $β_1$ be the first 3-torsion class in the stable homotopy groups of spheres in even degree. Toda showed that $β_1^5 \neq 0$, whilst $β_1^6 = 0$. Shimomura generalised this to the 144-periodic family generated by $β_1$, written as $\{β_{1+9s}\}_{s\geq 0}$, and showed that any $5$-fold product $\prod_5 β_{1+9s} \neq 0$, whilst all 6-fold products $\prod_6 β_{1+9s} = 0$. In this article, we give a simple proof of these results as well as some generalisations to other 144-periodic families. Along the way, we also refine known detection results for these families. Our tools include BP-synthetic spectra, and the well-known Adams–Novikov spectral sequence for the spectrum of topological modular forms at the prime $3$ as well as its Adams operations.

comments
20 pages, comments welcome! v2: strengthens mod tau detection and fixes errors pointed out by referee. Accepted in BLMS
fields
Algebraic Topology, K-Theory and Homology
pdf ↗ page arXiv:2511.02324 ↗

This paper investigates streaming codes for three-node relay networks under burst packet erasures with a delay constraint $T$. In any sliding window of $T+1$ consecutive packets, the source-to-relay and relay-to-destination channels may introduce burst erasures of lengths at most $b_1$ and $b_2$, respectively. Let $u = \max\{b_1, b_2\}$ and $v = \min\{b_1, b_2\}$. Singhvi et al. proposed a construction achieving the optimal rate when $u\mid (T-u-v)$. In this paper, we present an extended delay profile method that attains the optimal rate under a relaxed constraint $\frac{T - u - v}{2u - v} \leq \left\lfloor \frac{T - u - v}{u} \right\rfloor$ and it strictly cover restriction $u\mid (T-u-v)$. %Furthermore, we demonstrate that the optimal rate for streaming codes is not achievable when $0< T-u-v<v$ under the convolutional code framework.

comments
There is a flaw in the proof of the main result (Theorem 4, Section V). The proposed code construction fails to achieve the claimed rate optimality under the burst erasure and delay model. This manuscript is withdrawn to avoid incorrect conclusions being cited
fields
Information Theory
pdf ↗ page arXiv:2511.06882 ↗

The prisoners and hats puzzle, or simply the hat puzzle, is a family of games in which a group of prisoners are each assigned a colored hat and are asked to guess the color of their own hat. Various versions of the puzzle arise depending on the number of prisoners, the number of possible hat colors, and the information available to them before and after the game begins. These puzzles are broadly classified according to whether the prisoners' declarations are made simultaneously or non-simultaneously. In this paper we present a general theorem concerning the existence of a winning strategy when the declarations are non-simultaneous. We also discuss the relationship between the construction of such strategies and the Axiom of Choice, as well as their connection to the simultaneous-declaration case.

comments
27 pages. Accepted for publication in Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (ZML)
fields
Logic
pdf ↗ page arXiv:2511.09154 ↗

The Diederich–Fornæss worm domain, an important example of a smoothly bounded pseudoconvex domain without a Stein neighborhood basis, provides key counterexamples in the theory of several complex variables. In this paper, we examine its automorphism group and observe that its boundary is locally spherical everywhere except at the exceptional locus and the closure of the caps.

fields
Complex Variables
pdf ↗ page arXiv:2511.10614 ↗

We propose Log-Averaged Mirror Prox (LAMP), a linear-space primal-dual method for large-scale optimal transport. LAMP implements primal mirror prox updates by tracking an averaged dual sequence, reducing storage complexity from $\mathcal{O}(nm)$ to $\mathcal{O}(n+m)$ while preserving dense, GPU-friendly reductions. Consequently, LAMP preserves the last-iterate $\widetilde{\mathcal{O}}(\|C\|_\infty nm\varepsilon^{-1})$ arithmetic complexity of conservatively parameterized primal-dual mirror prox. We further analyze LAMP as a direct optimal transport solver in a more performant parameter regime, providing a last-iterate sub-optimality certificate dependent on infeasibility and an explicit $\mathcal O(\|C\|_\infty\log (m)/t)$ term. Moreover, we give a computable sufficient condition for ergodic convergence. Numerical experiments with an optimized CUDA implementation show that LAMP outperforms first-order baselines in several high-accuracy (entropic) optimal transport problems. LAMP is further shown to scale up to problems with $n=m=2^{18}$ marginal supports, which were previously beyond the reach of primal-dual first-order methods.

comments
33 pages, 6 figures
fields
Optimization and Control
pdf ↗ page arXiv:2511.11359 ↗

We propose a policy gradient algorithm for multiobjective decision-making on continuous state spaces, in which the long-run average of a reward vector must be steered into a target set despite an adversarial disturbance, by scalarizing the reward along the direction prescribed by Blackwell's Approachability Theorem instead of tuning weights by trial and error. Existing approachability-based learning is confined to countable state spaces, because the scalarization is updated at the visits to a recurrent state, which on a continuous state space has probability zero. We update it instead at the returns to a set after a minimum number of steps, show that a geometric drift condition, uniform over the policy class, controls the cycle lengths while the policy is being learned, and replace the parallel learners of the existing algorithm by a single two-timescale actor-critic. We show that the distance to the target set is asymptotically bounded by the per-cycle remainder from Blackwell's condition, and decompose this remainder into the errors of the actor, the policy class, the direction tracking and the return set. We illustrate the algorithm on a heating, ventilation, and humidity control problem with adversarial weather and occupancy.

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

We study Dehn twists in the outer automorphism group of a free group through the doubled handlebody, a connected sum of copies of the product of a circle and a two-sphere, in which the Dehn twist along a primitive torus is induced by twisting a regular neighborhood of the torus. Our main result states that sufficiently large powers of the Dehn twists along a compatible collection of primitive tori generate a right-angled Artin group. The proof is a ping-pong argument in the universal cover, the complement of a Cantor set in the three-sphere, where intersection numbers become counts of orbits of lifts. Along the way we show that commuting Dehn twists along primitive tori have tori whose lifts never cross, and that a Dehn twist determines the oriented cyclic splitting dual to its torus. Finally, we construct a compact space of primitive curves on which multitwists act parabolically and fully irreducible outer automorphisms act with north–south dynamics.

comments
59 pages. Substantially revised. The bigon-bihedron criterion and the criterion for commuting Dehn twists of earlier versions are withdrawn. The main theorem is now proved with crossing numbers of lifts in place of intersection numbers of tori
fields
Group Theory, Geometric Topology
pdf ↗ page arXiv:2511.15063 ↗

We investigate certain almost-simple algebraic supergroups over an algebraically closed field of characteristic zero or odd characteristic. Beyond those whose Lie superalgebras are simple and appear in Kac's classification, we construct new families of almost-simple supergroups whose Lie superalgebras are either non-simple or simple but fall outside Kac's classification.

fields
Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2511.16293 ↗

We address the problem of identifying the dynamical law governing the evolution of a population of indistinguishable particles, when only aggregate distributions at successive times are observed. Assuming a Markovian evolution on a discrete state space, the task reduces to estimating the underlying transition probability matrix from distributional data. We formulate this inverse problem within the framework of entropic optimal transport, as a joint optimization over the transition matrix and the transport plans connecting successive distributions. This formulation results in a convex optimization problem, and we propose an efficient iterative algorithm based on the entropic proximal method. We illustrate the accuracy and convergence of the method in two numerical setups, considering estimation from independent snapshots and estimation from a time series of aggregate observations, respectively.

comments
10 pages, 5 figures. Published in European Journal of Control
journal
European Journal of Control, 101592 (2026)
fields
Optimization and Control
pdf ↗ page arXiv:2511.16458 ↗

In this paper, we study a class of real-valued mean-field backward stochastic differential equations (BSDEs) with generators of quadratic growth in the control variable and the mean-field term. For bounded terminal conditions satisfying suitable structural regularity, we establish existence and uniqueness under two complementary quadratic regimes; the uniformly continuous path-dependent case additionally requires a uniform quadratic bound on the normalized generator. Our approach for these results combines Malliavin calculus with refined BMO and stability estimates, and bridges the gap between the quadratic BSDE results of [Ann. Probab. 45 (2017), pp. 3795–3828] and [Ann. Appl. Probab. 35 (2025), pp. 2128–2174]. Motivated by a mean-field exponential utility maximization problem, we further extend our framework to terminal conditions without imposing continuity or Markovian structure on the terminal condition. Under a suitable smallness condition on the oscillation of the terminal value around its mean, the associated quadratic BSDE admits a unique solution in a suitable small solution class. We then apply the extended theory to solve a mean-field exponential utility maximization problem, thereby extending the constrained exponential utility framework of Hu et al. [Ann. Appl. Probab. 15 (2005), pp. 1691–1712] to a mean-field setting.

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

We initiate a study of certain notions related to the algebraic dynamics of endomorphisms of projective varieties. Our main results include: (i) a characterization of projective varieties that occur as iterated images of endomorphisms of normal projective varieties; (ii) exploring stability behavior in the Stein factorizations of the iterates; and (iii) a structure result concerning endomorphisms whose iterates lie in a finite union of connected components of the endomorphism scheme, thereby completing a result of Brion.

comments
22 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2511.18453 ↗

We show that every canonically fibered link in $S^3$ is the binding of a braided open book in $S^3$, addressing a question of Montesinos and Morton. We introduce mutual arc presentations as our main technical tool, which we consider to be of independent interest. We prove that any fibered link admitting such a presentation is the binding of a braided open book.

comments
V2: 13 pages, 11 figures. A technical section has been removed and will appear separately. Some revisions have been made in response to a referee report. Accepted version, to appear in Michigan Mathematical Journal
fields
Geometric Topology
pdf ↗ page arXiv:2511.21837 ↗

Campana introduced a notion of Campana rational connectedness for Campana orbifolds and conjectured that certain Fano orbifolds are Campana rationally connected. In this paper, we study a version of this conjecture in positive characteristic and verify a stronger statement for some toric orbifolds. We also provide examples illustrating the relation between the failure of separable Campana rational connectedness and singularities.

comments
17 pages; v2: added missing assumption in Theorem 1.3
fields
Algebraic Geometry
pdf ↗ page arXiv:2511.22545 ↗

The paper contains a new proof of the theorem by Krieger which establishes the canonicity of the future cover of a sofic shift. In addition the paper describes a method to produce new canonical covers from a given one, resulting in canonical covers related to, but generally different from the future cover.

comments
v4: The proof of Theorem 4.6 has been corrected. This version is to appear in Dynamical Systems. 30 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2512.01368 ↗

We consider a two-dimensional diffusion process in a two-layered plane, governed by distinct covariance matrices in the upper and lower half-planes and by two drift vectors pointed away from the $x$-axis. We first analyze the case where the generator of the process is in divergence form, that is, when the flux is continuous across the interface. Then we extend the study to a broader class of processes whose behavior at the interface forms an oblique two-dimensional analogue of the skew Brownian motion. We provide a detailed theoretical analysis of this transient process. Our main results are as follows: (i) we derive explicit Laplace transforms of the Green's functions; (ii) we compute exact asymptotics of the Green's functions along all possible trajectories in the plane; (iii) We determine all positive harmonic functions, identifying the full and minimal Martin boundaries, which turn out to be distinct. The nonminimality of the Martin boundary is a noteworthy phenomenon for diffusions with regular coefficients. To obtain an analytical description of the process, we fully develop a three-variable version of the so-called kernel method by deriving and exploiting a functional equation involving unknown Laplace transforms of Green's functions and two known kernels $γ_+(x,y)$ and $γ_{-}(x,z)$. The introduction of independent auxiliary variables $y$ and $z$, associated with each half-plane, is a key idea.

comments
56 pages
fields
Probability
pdf ↗ page arXiv:2512.09136 ↗

Vehicle platooning is an important technology in modern transportation systems, offering significant improvements in highway traffic efficiency and fuel economy. Achieving coordinated behavior among vehicles in a platoon depends on wireless communication. However, packet losses in wireless communication can create critical safety issues when they occur together with sudden braking. In this paper, we propose a rigorous simulation-based method for studying such safety issues by analyzing the minimum inter-vehicle distance over time across control parameters that guarantee string stability. In particular, our method computes the exact distance at simulation time instants and guarantees that the change in distance between consecutive simulation time instants remains bounded. Therefore, the distances obtained at simulation times are representative of the continuous-time behavior, and the distances between those times can be accurately approximated. Our derivation relies on a lifted state representation and differential inequalities. For the proposed simulation method, we provide two approaches for selecting simulation times to ensure that the error in distance approximation remains within a given bound. We then extend our method to fuel-efficiency analysis, with guaranteed error bounds for calculating the average fuel savings of vehicles. Through an example involving a highway scenario with a merging lane, we demonstrate that among string-stable control parameter settings for a vehicle platoon, some perform better in terms of safety under simultaneous packet losses and sudden braking. We also identify control parameters that result in tradeoffs between safety and average fuel savings in a vehicle platoon.

comments
18 pages, 11 figures. Journal version of Y. Chen, A. Cetinkaya, "Time-discretized simulation approach for safety analysis of vehicle platoons under sudden braking and communication losses", SICE International Symposium on Control Systems (ISCS), 2025
fields
Optimization and Control
pdf ↗ page arXiv:2512.09416 ↗

The paper develops and analyzes a higher-order unfitted finite element method for the incompressible Stokes equations, which yields a strongly divergence-free velocity field up to the physical boundary. The method combines an isoparametric Scott-Vogelius velocity-pressure pair on a cut background mesh with a stabilized Nitsche/Lagrange multiplier formulation for imposing Dirichlet boundary conditions. We construct finite element spaces that admit robust numerical implementation using standard elementwise polynomial mappings and produce exactly divergence-free discrete velocities. The key components of the analysis are a new inf-sup stability result for the isoparametric Scott-Vogelius pair on unfitted meshes and a combined inf-sup stability result for the bilinear forms associated with the pressure and the Lagrange multiplier. The finite element formulation employs a higher-order Lagrange multiplier space, which ensures stability and mitigates the loss of pressure robustness typically associated with the weak enforcement of boundary conditions for the normal velocity component. The paper provides a complete stability and convergence theory in two dimensions, accounting for the geometric errors introduced by the isoparametric approximation. The analysis shows optimal-order velocity convergence in both the $H^1$ and $L^2$ norms and establishes optimal $H^1$-convergence and nearly optimal $L^2$-convergence of a post-processed pressure. Numerical experiments illustrate and confirm the theoretical findings.

fields
Numerical Analysis
pdf ↗ page arXiv:2512.12050 ↗

The duality theorem of Lass relates the matching polynomials of a simple graph $G$ with the matching polynomials of its complement $\bar G$. In particular, this relation gives rise to Godsil's result, which offers a nice interpretation of the Lebesgue integral associated with the Hermite orthogonality measure. In this work, we show that similar to matching polynomials, the path-cover polynomials also satisfy duality relations and give combinatorial interpretations of the Lebesgue integral and the inner product in the space of associated Laguerre polynomials. Similar duality relations hold for clique-cover polynomials and chromatic polynomials. As applications, we find an efficient algorithm that computes these graph polynomials for cographs. We also give explicit formulas to compute the number of Hamiltonian paths and cycles in complete multipartite graphs.

journal
Discrete Mathematics 350 (2027), no. 3, 115528
fields
Combinatorics
pdf ↗ page arXiv:2512.15351 ↗

We verify that an isoperimetric minimizing cluster on a simply connected homogeneous Riemannian manifold with at most one end always has connected boundary. In particular, the boundary of a single-bubble isoperimetric minimizer on such manifolds must be connected, and hence all isoperimetric sets and their complements must be connected. This is demonstrably false without the simple connectedness assumption or the restriction on the number of ends.

comments
18 pages; corrected an omission in Lemma 3.2 by introducing the notion of locally almost perimeter minimizing partition
fields
Differential Geometry, Geometric Topology
pdf ↗ page arXiv:2512.15403 ↗

We prove fiberwise criteria for full faithfulness and equivalences of integral transforms between proper flat families of schemes over a separated Noetherian base. The kernels are bounded pseudocoherent complexes which are relatively perfect over each factor, and need not be perfect. A key ingredient is the calculus of mates, which controls the units and counits of adjoint integral transforms under base change. In particular, we give a complete argument for a fiberwise criterion of Hernández Ruipérez–López Martín–Sancho de Salas, and extend it to arbitrary separated Noetherian bases. As applications, we extend a result of Orlov on field extensions to singular varieties, and show that over a Noetherian local ring these properties can be detected on the special fiber.

comments
focused narrative on filling gap in HLS09; removed fibration invariances
fields
Algebraic Geometry
pdf ↗ page arXiv:2512.16503 ↗

Probabilistic approximate quantum error correction (PAQEC) lets a recovery fail with some probability, in exchange for higher fidelity when it succeeds. Prior PAQEC code searches keep the codewords orthonormal with penalty terms and tune the code without its best recovery. We propose a gradient method with three new parts. First, the codewords move on the complex Stiefel manifold, so they are orthonormal at every step without penalties. Second, every code is trained against its best recovery, which we solve for at each step rather than learn. Third, a fast Petz recovery that we can differentiate even for symmetric codes gets the search close, and the exact semidefinite program finishes it. We train a single five-qubit code over generalized amplitude damping noise. At weak noise ($γ= 0.1$, $p = 0.05$) and equal success probability, it has $23$ times lower infidelity than the permutation-invariant code of prior work, and $9$ times lower than that work's numerically optimized code. At equal fidelity it succeeds $91\%$ of the time, against $76\%$ for the permutation-invariant code.

fields
Numerical Analysis
pdf ↗ page arXiv:2512.18061 ↗

This paper studies a modification of the classical Osipov-Lanchester model in which the total population of the two sides, $N=R+B$, stays constant. In this model the ratio $y=R/B$ obeys the Riccati equation $\dot y=αy^2-β$, which is solvable in elementary functions for all values of the parameters. The main result is a complete classification of the stable regimes. An asymptotically stable invariant set in the quadrant $R,B\ge 0$ exists only in three cases: $α<0,\ β<0$ gives a stable interior equilibrium; $α=0,\ β<0$ makes the boundary $B=0$ stable; $α<0,\ β=0$ makes the boundary $R=0$ stable. If $α>0$ or $β>0$, every solution except one unstable equilibrium reaches a boundary of the quadrant in finite time, where the model stops being applicable. If the parameters vary in time, a fixed distance from the boundaries is kept when $α(t)$ and $β(t)$ obey buffer dynamics that push them away from zero. Finally, in the case $α<0,\ β<0$ the original system grows exponentially, while in the two degenerate cases it grows at most linearly. Growth demanded of a given cost, the sum of the two channels, bounds their imbalance and, with the perturbation bound, confines the parameters to an explicit wedge about $|α|=|β|$ truncated near the origin: the narrow corridor of the model.

comments
20 pages, 1 figure. Submitted version. This preprint has not undergone peer review or any post-submission improvements or corrections. A revised version has been accepted for publication in Operations Research Forum
fields
Dynamical Systems, Optimization and Control
pdf ↗ page arXiv:2512.18515 ↗

We study chains of locally free subsheaves of equal rank whose successive quotients are nonzero divisorial torsion sheaves. Fixing the determinant of the initial term defines a normalized hierarchical depth. An ample intersection argument proves finiteness on every smooth projective variety. On an algebraically closed smooth projective curve, the depth equals the degree of the determinant difference precisely when that difference is effective; otherwise, no normalized filtration exists. For birational morphisms of smooth projective surfaces, reflexive pushforward contracts exactly those steps whose determinant divisors are entirely exceptional. This yields a comparison of filtration lengths without a commutativity assumption. Explicit examples show that pullback can strictly increase depth and compute a depth of twenty on a two-point blowup. Finally, we distinguish preservation of evaluation codes for genuinely descended bundles from removal of zero coordinates caused by exceptional fixed components. The coding statements use specified compatible fiber bases or the block Hamming metric.

comments
12 pages. Substantially revised and shortened from 31 pages. Definitions and normalization clarified; several statements and proofs corrected. Birational comparison results reformulated using reflexive pushforward, and examples and coding applications revised
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2512.18654 ↗

Koszul duality for superalgebras involves both the intrinsic super parity and the degree shift introduced by suspension. We study this duality while keeping the two gradings separate, using a $\mathbb Z\times\mathbb Z$-graded refinement of the commutativity convention of Deligne and Morgan. In this setting, the Koszul suspension preserves the parity degree and raises the independent weight by one. We realize the polynomial superalgebr $\mathcal O(k^{m|n})$ and its Koszul dual as function algebras on bigraded spaces and construct an isomorphism between their differential calculi of polyvector fields and mixed differential forms. For admissible quadratic Poisson structures, whose bivectors have bidegree $(0,2)$, this isomorphism descends to the differential calculi on Poisson cohomology and mixed Poisson homology. With respect to the corresponding mixed volume forms, Koszul duality preserves unimodularity and, in the unimodular case, identifies the induced Batalin–Vilkovisky algebra structures on Poisson cohomology.

fields
Rings and Algebras, Mathematical Physics
pdf ↗ page arXiv:2512.20127 ↗

We establish improved $L^r\mapsto L^p$ estimates for oscillatory integral operators satisfying the positive cinematic curvature condition. In ambient dimension $n\geq4$, the output range is $p>2+8/(3n-4)$, with the full Knapp-admissible input range $r'\leq (n-2)p/n$. The proof combines a transverse covering $L^2$ estimate, Wolff's two-ends reduction, and refined decoupling. In dimension $n=3$ we retain the range $p>4$.

comments
Improved the result using a transverse covering $L^2$ estimate
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2512.22516 ↗

Given a commutative unital algebra $\mathcal O$, a proper ideal $\mathcal I$ in $\mathcal O$, and a positively graded differential variety over $\mathcal O/\mathcal I$, we provide a $\mathbb Z$-graded extension, whose negative part is an arborescent Koszul-Tate resolution of $\mathcal O/ \mathcal I$. This extension is obtained through an algorithm exploiting the explicit homotopy retract data of the arborescent Koszul-Tate resolution, so that the number of homological computations in the construction is significantly reduced. For a positively graded differential variety over $\mathcal O$ that preserves the ideal $\mathcal I$, the extension admits a manifest description in terms of decorated trees and computed data. As a by-product, to every Lie-Rinehart algebra over the coordinate ring of an affine variety $ W \subseteq M = \mathbb{C}^d$, one associates an explicit differential $\mathbb{Z}$-graded variety over $M$ whose negative component is the arborescent Koszul-Tate resolution of the coordinate ring $\mathbb C[x_1, \ldots, x_d]/\mathcal I_W$ of $W$, and whose positive component is the universal dg-variety of the given Lie-Rinehart algebra. Concrete examples are given.

comments
46 pages
journal
Commun. Math. Phys. 407, 264 (2026)
fields
Mathematical Physics, Commutative Algebra, Differential Geometry
pdf ↗ page arXiv:2512.23148 ↗

We propose a decision-theoretic framework for computational complexity, complementary to classical theory: moving from syntactic exactness (Turing / Shannon) to semantic simulability (Le Cam). While classical theory classifies problems by the cost of exact solution, modern computation often seeks only decision-valid approximations. We introduce a framework where "computation" is viewed as the efficient simulation of a target statistical experiment within a bounded risk distortion (Le Cam deficiency). We formally define computational deficiency ($δ_{\text{poly}}$) and use it to construct the complexity class LeCam-P (Decision-Robust Polynomial Time), characterizing problems that may be syntactically hard but semantically easy to approximate. We show that classical Karp reductions can be viewed as zero-deficiency simulations, and that approximate reductions correspond to bounded deficiency. Furthermore, we establish the No-Free-Transfer Inequality, showing that strictly invariant representations inevitably destroy decision-relevant information. This framework offers a statistical perspective on approximation theory, bridging the gap between algorithmic complexity and decision theory.

fields
Statistics Theory, Information Theory
pdf ↗ page arXiv:2512.24860 ↗

Let $\mathbb{R}^{2,2}$ denote the model space of flat pseudo-Riemannian manifolds of signature $(2,2)$. We prove that the only domain divisible by a discrete subgroup of the isometry group of $\mathbb{R}^{2,2}$ is $\mathbb{R}^{2,2}$ itself. In the Kleinian setting, this provides the first completeness theorem of closed flat pseudo-Riemannian manifolds beyond the Euclidean and Lorentzian cases. Along the proof, we show as a result of independent interest concerning the existence of syndetic hulls in semidirect products $R \ltimes G$, where $G$ is a homothety Lie group. This construction generalizes earlier constructions in affine geometry due to Carrière and Dal'bo.

comments
29 pages. Main changes from v2: The main result remains unchanged. Proposition B has been replaced by a reduction result specific to SO(2,2). The original Proposition B from v2 will be presented in a separate paper, together with applications to other completeness results
fields
Differential Geometry, Group Theory, Geometric Topology
pdf ↗ page arXiv:2601.01276 ↗

Rare events in molecular dynamics are often related to noise-induced transitions between different macroscopic states (e.g., in protein folding). A common feature of these rare transitions is that they happen on timescales that are on average exponentially long compared to the characteristic timescale of the system, with waiting time distributions that have (sub)exponential tails and infinite support. As a result, sampling such rare events can lead to trajectories that can be become arbitrarily long, with not too low probability, which makes the reweighting of such trajectories a real challenge. Here, we discuss rare event simulation by importance sampling from a variational perspective, with a focus on {the computation of committor functions and mean first exit times that both play a prominent role in molecular dynamics}. The idea is to design importance sampling schemes that (a) reduce the variance of a rare event estimator while controlling the average length of the trajectories and (b) that do not require the reweighting of possibly very long trajectories. In doing so, we study different stochastic control formulations for committor and mean first exit times, which we compare both from a theoretical and a computational point of view, including numerical studies of some benchmark examples.

comments
60 pages, 9 figures, to appear in CAMCoS (https://msp.org/soon/coming.php?jpath=camcos)
fields
Probability, Optimization and Control
pdf ↗ page arXiv:2601.01489 ↗

The classification up to homeomorphism of closed topological nonorientable 4-manifolds with fundamental group of order 2 due to Hambleton-Kreck-Teichner can be used to classify a large set of 4-manifolds with $π_1 = \Z/2p$ for odd $p > 1$. It is plausible that this set comprises all homeomorphism classes of such 4-manifolds. This is done through a cut-and-paste construction, which is then used to calculate an extension of the Hausmann-Weinberger invariant for every cyclic group of even order and to produce 4-manifolds that are not homotopy equivalent to a connected sum and which need not be smoothable.

comments
Note has been revised, and results have been added
fields
Geometric Topology
pdf ↗ page arXiv:2601.05132 ↗

We present two algorithms for constructing orthonormal bases of vector-valued rational functions with respect to a discrete inner product. \rev{Every pole is prescribed together with a tangential direction, which fixes the direction of the residue at that pole.} Building on the pencil formulation of the inverse eigenvalue problem for scalar rational functions by Van Buggenhout, Van Barel and Vandebril (2022), we show that, for functions with $k$ components, the recurrence relations are represented by a pencil of $k$-Hessenberg matrices, i.e., matrices with at most $k$ nonzero subdiagonals, \rev{and that the poles are the ratios of the entries on the $k$th subdiagonal. This extends the banded Hessenberg structure of orthogonal vector-valued polynomials to rational functions, and it replaces the semiseparable-plus-diagonal representation of Delvaux and Van Barel (2005), in which every pole belongs to a single component, by a pencil.} We derive an updating algorithm based on rotations and a Krylov-type algorithm \rev{that orthogonalizes a tangential rational Krylov subspace, and we compare their accuracy. Finally, we show that the lightning method and the AAA algorithm fit in our framework; for AAA, the barycentric weights follow from a singular value decomposition of a small block of the pencil.} The approximation of $\sqrt{z}$ on $[0,1]$ with exponentially clustered poles and sample points serves as a stress test for our methods.

comments
26
fields
Numerical Analysis
pdf ↗ page arXiv:2601.11317 ↗

We consider the dimer model in cylindrical domains $Ω_δ$ on square grids of mesh size $δ$ with two Temperleyan boundary components of different colors. Assuming that the $Ω_δ$ approximate a cylindrical domain $Ω$ as $δ\to 0$, we prove the convergence of height fluctuations to the Gaussian Free Field in $Ω$ plus an independent discrete Gaussian multiple of the harmonic measure of one of the boundary components. The limit of the dimer coupling functions on $Ω_δ$ is holomorphic in $Ω$ but not conformally covariant. Given this, we determine the limiting structure of height fluctuations from general principles rather than from explicit computations. In particular, our analysis justifies the inevitable appearance of the discrete Gaussian distribution in the doubly connected setup.

comments
28 pages, 3 figures. Changes in v2: expanded proofs of Proposition 2.2, Lemma 2.6, and Proposition 3.3; several references added; misprints fixed
fields
Probability, Mathematical Physics, Complex Variables
pdf ↗ page arXiv:2601.13332 ↗

We prove that for a non-isotrivial abelian scheme over a smooth curve, the genus of a generic sequence of multi-sections with small heights tends to infinity. As an application, we give a new proof of the uniform boundedness of $\ell$-primary torsion points on fibers of an abelian scheme over a smooth curve, a result originally proved by Cadoret and Tamagawa. Furthermore, our approach allows us to reprove a conjecture of Cadoret and Tamagawa without additional assumptions. Our approach is based on the theory of Betti foliations and the arithmetic equidistribution theorem.

comments
47 pages
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2601.15089 ↗

We define a notion of marked length spectrum for $S^1$-symmetric Riemannian metrics on the two-sphere having only one equator. We prove that isospectral metrics in this class have conjugate geodesic flows. Under a further ${\mathbb Z}_2$-symmetry assumption, we show that the marked length spectrum determines the metric. Finally, we show that every isospectral class of metrics contains a unique ${\mathbb Z}_2$-symmetric metric and give an explicit description of this isospectral class as an infinite-dimensional convex set, generalizing the known description of $S^1$-symmetric Zoll metrics. This paper contains also two appendices, in which we provide an elementary proof of the fact that a $C^2$ real-valued function on an interval is determined by the set of tangent lines to its graph, and we classify a class of $S^1$-invariant contact forms on three-manifolds.

journal
SIGMA 22 (2026), 116, 47 pages
fields
Differential Geometry, Dynamical Systems, Symplectic Geometry
pdf ↗ page arXiv:2601.16804 ↗

We establish dual representation and stability results for multimarginal optimal transport (MOT) with bounded continuous costs. Our approach uses mutually $c$-conjugate potentials: each component is the largest function compatible with the dual constraint when the others are fixed. A single sweep of successive component updates produces such a family from any real-valued feasible family while preserving contact points. The resulting potentials are bounded and upper semicontinuous. On fixed compact metric spaces, normalization at fixed reference points yields a compact class of continuous potentials in the product uniform norm. This class is independent of the marginals and contains a dual maximizer for every marginal tuple. We prove its Lipschitz dependence on the cost in Hausdorff distance. Under uniform cost convergence and weak marginal convergence, transport values converge. The corresponding normalized optimizer sets are upper stable in the product uniform norm, without uniqueness assumptions. We also obtain value bounds in total variation and, for coordinatewise Lipschitz costs, Wasserstein distance. For coordinatewise Lipschitz reference costs, a power-growth condition on the dual objective gives one-sided Hölder estimates for optimizer sets under joint perturbations. On finite spaces, polyhedral structure yields linear growth and one-sided Lipschitz estimates with reference-dependent constants. On Polish spaces, total boundedness of the coordinate cost profiles in the uniform norm yields a compact normalized representation. For a fixed cost satisfying this condition, value continuity and upper stability of normalized conjugate optimizer sets hold under weak marginal convergence.

fields
Optimization and Control
pdf ↗ page arXiv:2601.17171 ↗

We study intrinsic factorizations of quantum gates using determinant-one unitaries supported on arbitrary two-dimensional subspaces of $\C^N$, where $N=2^n$. For $U\in U(N)$ write $r=\operatorname{rank}(U-I)$. When $r\ge2$, we characterize all factors that lower the active rank by two through traceless compressions of the Cayley transform on $\Ran(U-I)$. For the ordered active eigenangles $\vartheta_j\in(0,2π)$, existence is equivalent to $\vartheta_1+\vartheta_2\le2π\le\vartheta_{r-1}+\vartheta_r$. For $U\in SU(N)$, combining this construction with eigenangle merging realizes the classical reflection-length formula in two-level form: $\ell^{SU}(U)=\max\{ν(U),r-ν(U)\}$, where $ν(U)$ is the positive eigenangle sum divided by $2π$. On the full-rank open set, the age indexes $N-1$ connected components with constant intrinsic length. We place these factorizations within the spectral description of the dictionaries formed by faithful $SU(2)$ and $U(2)$ embeddings. For $n\ge2$, these dictionaries are Haar-null of Hausdorff dimensions $N^2-N+1$ and $N^2-N+2$; the former is compact and the latter dense. Distances to compact sectors reduce to eigenvalue matching. Further results concern ambient minimality of embedded geodesics and a first-order sharp spectral bound on coherence production.

fields
Numerical Analysis
pdf ↗ page arXiv:2601.17936 ↗

We introduce multivariate multicycle (MM) codes, a Koszul-complex formulation of abelian multicycle (AMC) codes, which are multidimensional scalar lifted-product codes over a finite abelian group algebra, that unifies bivariate bicycle, multivariate bicycle, abelian two-block group algebra, generalized bicycle, trivariate tricycle, and toric codes. MM codes are Calderbank-Shor-Steane (CSS) codes defined from length-$(t+1)$ chain complexes, and for $t\geq4$ they possess metachecks for both types of checks, which can be used for single-shot decoding. We offer a framework that facilitates the construction of long-length chain complexes through the use of the Koszul complex. In particular, obtaining explicit boundary maps (parity check and metacheck matrices) is particularly straightforward in our approach. We also determine when an MM code encodes logical qubits, count the independent check relations not generated by its metachecks, and show that middle-degree codes with even $t$ have equal $X$ and $Z$ distances. This simple but very general parameterization of codes permitted us to efficiently perform a numerical search, where we identify several MM code candidates with high rates and high code distances. Examples of new codes with parameters $[[n,k,d]]$ include $[[96,12,8]]$, $[[144,12,12]]$, $[[486,24,12]]$, $[[630,70,9]]$, and $[[648,60,9]]$. For selected codes, we report confinement profiles and study single-shot and few-shot decoding under phenomenological and circuit-level noise. Our codes also include explicit collapsed 5D through 9D instances, and our 5D instances have check weights lower than those of recent small instances of quantum Tanner codes.

fields
Information Theory
pdf ↗ page arXiv:2601.18879 ↗

In this paper, we consider control constrained $L^2-$Dirichlet boundary control of a convection-diffusion equation on a two dimensional convex polygonal domain. We discretize the control problem based on the local discontinuous Galerkin method with piecewise linear ansatz functions for the flux and potential. We derive a priori error estimates for the full as well as for the variational discrete control approximation. We present a selection of numerical results to demonstrate the performance of our approach and to underpin the theoretical findings.

fields
Optimization and Control
pdf ↗ page arXiv:2601.18969 ↗

The paper considers a global version of the notion of log canonical threshold for plurisubharmonic functions $u$ of logarithmic growth in $\mathbb{C}^n$, aiming at description of the range of all $p>0$ such that $e^{-u}\in L^p(\mathbb{C}^n)$. Explicit formulas are obtained in the toric case. By considering Bergman functions of corresponding weighted Hilbert spaces, a new polynomial approximation of plurisubharmonic functions of logarithmic growth with control over its singularities and behavior at infinity (a global version of Demailly's approximation theorem) is established. Some application to tame polynomial maps are given.

comments
V2: Some typos fixed V3: A typo fixed. To appear in Indiana Univ. Math. J
fields
Complex Variables
pdf ↗ page arXiv:2601.23118 ↗

Constructing accurate and computationally efficient surrogate models for predicting dynamical system responses is critical in many engineering domains, yet remains challenging due to the strongly nonlinear and high-dimensional mapping from external excitations and system parameters to system responses. This work introduces a novel Function-on-Function Nonlinear AutoRegressive model with eXogenous inputs (F2NARX), which reformulates the recently proposed $\mathcal{F}$-NARX method from a function-on-function regression perspective. The proposed framework substantially improves predictive efficiency while maintaining high accuracy. By combining principal component analysis with Gaussian process regression, F2NARX further enables probabilistic predictions of dynamical responses via the unscented transform in an autoregressive manner. The effectiveness of the method is demonstrated through case studies of varying complexity. Results show that F2NARX outperforms state-of-the-art NARX model by orders of magnitude in efficiency while achieving higher accuracy in general. The probabilistic prediction capability of F2NARX is further demonstrated by combining it with active learning for first-passage probability estimation, showing its potential for reliability-oriented applications.

fields
Dynamical Systems
pdf ↗ page arXiv:2602.01929 ↗

This paper is devoted to studying the deformation behavior of pseudo-effective canonical divisors and volumes of adjoint classes in Kähler families. Based on recent developments in the Kähler minimal model program, for flat families with fiberwise canonical singularities, we establish the global stability of the pseudo-effectivity of canonical divisors and uniruledness, assuming in addition that one fiber is projective, while the same conclusion for Kähler threefolds is also true without the projectivity assumption of the central fiber. For a smooth Kähler family whose central fiber is projective with a big adjoint class, we show that its volume remains locally constant. Finally, using the (relative) minimal model program for Kähler threefolds, we verify the deformation invariance of volumes of adjoint classes and plurigenera for smooth Kähler families of threefolds, thereby partially confirming Siu's invariance of plurigenera conjecture in dimension three.

comments
Final version. To appear in the Mathematische Annalen
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2602.04158 ↗

Classical two-sample tests aim to determine whether two distributions are equal or not based on samples from each one. Even in an distribution-free setting, well-known methods such as the permutation test can provide statistical evidence that the two distributions differ. However, failure to reject equality does not necessarily establish that they are similar. In this work, we study the complementary problem of certifying distributional similarity with finite-sample confidence, without imposing assumptions on the underlying distributions. We show, however, that for continuous distributions, any distribution-free upper confidence bound on the total variation (TV) distance must be trivial with high probability, even if the distributions are identical. Thus, certifying similarity in TV with a distribution-free guarantee is practically impossible. We therefore examine the blurred TV distance, a relaxation of TV distance that enables us to quantify similarity after applying a common blurring operation while retaining the interpretation of TV. We construct distribution-free upper and lower confidence bounds on blurred TV, establish their finite-sample validity, and examine its properties in high dimensions.

comments
54 pages, 4 figures
fields
Statistics Theory
pdf ↗ page arXiv:2602.05862 ↗

We study polynomial regression of numerical metric errors on the Fermat quintic. A known hypersurface volume-ratio identity gives the exact reference $C-\log p_4$ relative to the induced Fubini–Study metric, where $p_4=\sum_i|z_i|^8$ on unit-normalized homogeneous coordinates. We optimize algebraic metrics at degrees $6,8,10,12$ while preserving finite Fermat symmetry, then fit their remaining logarithmic volume-form error. Regression splits and bootstrap draws keep the five roots of each sampled line together, with all compared teachers evaluated on common clouds. Warm-start replication correlations exceed $0.9997$ at $k=8,10,12$. Across degrees, source-derived modes fall short of target-specific fits, including in a post-hoc quartic check, but outperform random spans of matched rank in the tested libraries. Two independent random-invariant $k=10$ starts have residual correlations $0.768$--$0.803$, while their fitted cubic modes correlate at $0.979$--$0.983$ and retain useful calibrated cross-start prediction. Their fitted modes agree poorly with those of the principal warm-start teacher. Adding the phase-sensitive invariant $J_7$ improves prediction beyond the cubic modulus-only library for all seven warm-start teachers. The gain depends on the library: at $k=12$, a quartic modulus-only fit explains about 97–98\% of residual variance and the conditional interval for the added $J_7$ gain includes zero for both replicas under both measures. The gains therefore establish neither phase independence nor irreducible phase necessity; fixed-baseline augmentation preserves this distinction. The fitted components depend on the numerical protocol; global optimality and a universal finite-degree correction remain unestablished.

fields
Differential Geometry
pdf ↗ page arXiv:2602.07834 ↗

We study the recently introduced Busemann subgradient method due to Goodwin, Lewis, López-Acedo and Nicolae, extending it to minimize the mean of a stochastic function over general Hadamard spaces. We prove a strong convergence theorem under a local compactness assumption and further prove weak convergence of the method over separable Hadamard spaces. The proof is based on a general (weak) convergence theorem for stochastic processes in Hadamard spaces which confine to a stochastic variant of quasi-Fejér monotonicity, together with a nonlinear variant of Pettis' theorem, which are of independent interest. Lastly, we provide best function value estimates as well as a strong convergence result under a strong convexity assumption, and in that latter case in particular derive explicit rates of convergence. We illustrate the practical use of the general mean minimization problem and the associated Busemann subgradient method through statistical models for phylogenetic inference via the Billera-Holmes-Vogtmann tree space.

comments
31 pages
fields
Optimization and Control
pdf ↗ page arXiv:2602.08127 ↗

Recent advances in imaging technologies, deep learning and numerical performance have enabled non-invasive detailed analysis of artworks, supporting their documentation and conservation. In particular, automated detection of craquelure in digitized paintings is crucial for assessing degradation and guiding restoration, yet remains challenging due to the possibly complex scenery and the visual similarity between cracks and crack-like artistic features such as brush strokes or hair. We propose a hybrid approach that models crack detection as an inverse problem, decomposing an observed image into a crack-free painting and a crack component. A deep generative model is employed as powerful prior for the underlying artwork, while crack structures are captured using a Mumford–Shah-type variational functional together with a crack prior. Joint optimization yields a pixel-level map of crack localizations in the painting.

journal
Eurographics Workshop on Graphics and Cultural Heritage (GCH 2026)
fields
Numerical Analysis
pdf ↗ page arXiv:2602.09730 ↗

We compute the equivariant Kazhdan–Lusztig and inverse Kazhdan–Lusztig polynomials of the thagomizer matroid $T_n=M(K_{1,1,n})$ under the action of the hyperoctahedral group $\Bn$. For $n\ge2$, this action identifies $\Bn$ with the full automorphism group of $T_n$. For every $n\ge0$, we give multiplicity-free decompositions of all coefficients of both polynomials into irreducible representations and prove that both coefficient sequences are strongly induced log-concave with respect to induction from $\Bn\times\Bn$ to $\B{2n}$. The formulas for Kazhdan–Lusztig polynomials follow from the palindromicity of the equivariant $Z$-polynomial and the known equivariant formulas for the graphic matroids of cycle graphs under the action of $\Sn$. The inverse formula follows from Proudfoot's equivariant inversion identity. For $n\ge2$, we also obtain explicit formulas for both polynomials of $M(K_{2,n})$ under the inherited action of $\Bn$, again with multiplicity-free coefficients.

fields
Combinatorics
pdf ↗ page arXiv:2602.10646 ↗

In this paper, we study deformation quantization of symplectic vector fields à la Fedosov. We provide an explicit construction to quantize each symplectic vector field as a derivation of the deformed star algebra. This recovers a result of Müller-Bahns and Neumaier with an explicit formula of higher total degree terms. Moreover, we show that this quantization yields a non-abelian $2$-cocycle on the Lie algebra of symplectic vector fields with values in the deformed star algebra. For a Fedosov deformation quantization with vanishing first characteristic class, this non-abelian $2$-cocycle can provide a formal deformation of the crossed-product algebra generated by the action of symplectic vector fields. In this sense, we can quantize any Lie algebra action by symplectic vector fields.

comments
48 pages. Minor changes since v2. An extended algebra recommended by ChatGPT is introduced after Lemma 2.14 to clarify the ranges of the operators in the following sections
fields
Quantum Algebra, Mathematical Physics, Symplectic Geometry
pdf ↗ page arXiv:2602.10988 ↗

Power system operators routinely perform N-1 contingency analysis, yet conventional tools provide limited guidance on which lines or transformers deserve heightened attention during fast post-fault transients. In particular, static screening does not reveal whether (1) the same faulted line repeatedly triggers severe downstream overloads, or (2) a specific transformer emerges as vulnerable across many distinct fault scenarios. This paper introduces a real-time dynamic N-1 screening framework that addresses this gap by estimating, for each counterfactual single-phase transmission fault, the probability of transient overcurrent on critical grid elements. The output is an operator-facing dashboard that ranks (a) faulted lines whose outages most frequently lead to dangerous transformer overloads, and (b) transformers that consistently overload across top-risk scenarios, both of which are actionable indicators for real-time situational awareness. The approach models post-fault electromechanical dynamics using a linear stochastic formulation of the swing equations with short-lived, fault-localized uncertainty, and combines analytic transient evaluation with cross-entropy based importance sampling to efficiently estimate rare but high-impact events. All N-1 contingencies are evaluated in parallel with linear computational complexity. The framework is demonstrated on the IEEE 118-bus system, where it reveals latent high-risk lines and transformers that remain invisible under deterministic dynamic or static N-1 analysis. Results show orders-of-magnitude computational speedup relative to brute-force Monte Carlo, enabling practical deployment within real-time operational cycles.

comments
15 pages, 5 figures, 3 Tables, 1 Algorithm
fields
Optimization and Control
pdf ↗ page arXiv:2602.12293 ↗

In these lecture notes, a group-theoretical introduction to BMS symmetries is provided in a self-contained manner. More precisely, all definitions and structures are purely based on geometrical and group-theoretical notions defined at null infinity and valid in any dimension (four or higher), in a way that circumvents its traditional bulk realisation as asymptotic symmetries. The topics which are reviewed are: the definition of BMS transformations as conformal Carrollian isometries of null infinity, the semidirect structure of the BMS group, the holographic reconstruction of Minkowski spacetime in terms of good cuts, the one-to-one correspondence between good cut subspaces and Poincaré subgroups (aka vacua), as well as a basic introduction to the unitary representations of the BMS group.

comments
v1: 40 pages; v2: 50 pages, typos fixed, Figure 3, Section 6, and Appendix A.6 added
fields
Mathematical Physics
pdf ↗ page arXiv:2602.12965 ↗

Consider the projectivization $\mathbb{P}(E)$ of a holomorphic vector bundle $E$ over a smooth curve, equipped with a fixed Kähler class $[ω]$. Our first main result establishes that the existence of an extremal Kähler metric in $[ω]$ is equivalent to the weighted stability of a moment polytope $Δ$ with respect to explicit weight functions depending on the topological data of $\mathbb{P}(E)$. We then introduce a class of test configurations, which we call compatible test configurations. These are constructed by gluing horospherical test configurations of the fibers, arising from convex functions on $Δ$ via Delcroix's construction, to the principal bundle associated with $\mathbb{P}(E)$. Our second main result shows that the weighted stability of $Δ$ naturally arises when computing the relative uniform K-stability of $[ω]$ with respect to compatible test configurations.

comments
V2 following referee report: title, abstract and introduction updated in light of recent results in the field; clarification of Appendix A; simplification of the proof of Lemma 3.13; minor corrections. Accepted in Mathematische Annalen
fields
Differential Geometry, Algebraic Geometry
pdf ↗ page arXiv:2602.13133 ↗

We study two log-concave sampling problems: constrained sampling and composite sampling. First, we consider sampling from a distribution proportional to $e^{-f}$ on a convex set $K\subset\mathbb R^d$, where $f$ is convex. Using an epigraph lifting, we reduce this problem to uniform sampling up to a one-dimensional exponential tilt over a convex set in $\mathbb R^{d+1}$. We then apply the proximal sampler to the lifted distribution. We develop an unbiased implementation of its restricted Gaussian oracle by using the cutting-plane method and rejection sampling, requiring only a separation oracle for $K$ and evaluation and subgradient oracles for $f$, without relying on projections or barrier functions. Second, we study composite sampling from $e^{-f-h}$, where $f$ and $h$ are closed and convex. This structure arises naturally in Bayesian inference, where $f$ represents data fidelity and $h$ encodes prior information. By applying an epigraph lifting to $h$, we reduce composite sampling to constrained sampling in $\mathbb R^{d+1}$, allowing us to build on the approach developed in the first part. This leads to a double lifting formulation in $\mathbb R^{d+2}$, for which we implement the proximal sampler using different combinations of subgradient and proximal oracles for $f$ and $h$. We establish mixing time bounds in Rényi and $χ^2$ divergences for both problems. Finally, we revisit the convergence analysis of the proximal sampler from a variational perspective. Starting from variational formulations of its two half-steps as optimization problems over probability measures, we use a dynamic formulation of entropy-regularized optimal transport to recast them as optimal control problems. This allows us to derive their governing PDEs directly through the lens of optimization, without first analyzing particle-level SDEs.

fields
Optimization and Control
pdf ↗ page arXiv:2602.14478 ↗

We study max-min bilinear completely positive (CP) programs and their associated min-max programs. We establish reformulations of these problems as linear optimization over the product of the CP cone and the copositive (COP) cone, namely, the COP-CP programs. A hierarchy of coupled Moment-SOS type semidefinite relaxations is proposed to solve these COP-CP programs. We show that this approach has asymptotic convergence under mild assumptions. Moreover, we use the coupled flat truncation conditions (FTCs) to certify tightness of semidefinite relaxations, and we give sufficient conditions for finite convergence of the hierarchy, under which the FTCs hold at every optimal solution of all sufficiently high-order relaxations. Numerical experiments are presented to show the effectiveness of our method.

comments
34 pages, 2 figures
fields
Optimization and Control
pdf ↗ page arXiv:2602.14949 ↗

We consider a stochastic heat equation with nonlinear finite-rank space-coloured multiplicative noise that admits a unique nonnegative solution when given nonnegative initial data. Inspired by existing results for fully discrete finite difference schemes and building on the convergence analysis of semi-discrete mass-lumped finite element approximations, a fully discrete numerical method is introduced that combines mass-lumped finite elements with a Lie-Trotter splitting strategy. This discretization preserves nonnegativity at the discrete level and is shown to be convergent under suitable regularity conditions. A rigorous convergence analysis is provided, highlighting the role of mass lumping in ensuring nonnegativity and of operator splitting in decoupling the deterministic and stochastic dynamics. Numerical experiments are presented to confirm the convergence rates and the preservation of nonnegativity. In addition, we examine several numerical examples outside the scope of the established theory, aiming to explore the range of applicability and potential limitations of the proposed method.

comments
22 pages, 4 figures, code for numerical experiments available via URL in section 6; added clarification on difference of results to current literature (beginning of section 5), minor clarifications added, typos corrected, updated reference [10] from preprint to published version; to appear in Communications in Applied Mathematics and Computer Science https://msp.org/soon/coming.php?jpath=camcos
fields
Numerical Analysis
pdf ↗ page arXiv:2602.16508 ↗

We start studying the character variety of the algebraic supergroup OSp(1|2) from the algebraic perspective. We do this by first investigating the specific case of the character variety of the free group on two letters and try to describe the ring of invariants with respect to the conjugation action. The explicit description of the corresponding character variety for SL(2) was done by Fricke and Klein, so this can be seen as a variant of this theorem for its supergeometric counterpart OSp(1|2) and briefly touch upon the character stack for OSp(1|2)

comments
31 pages, comments welcome. (v4) reformulation of main theorem and minor changes, (v3) added an example after the main theorem and some comments,(v2) reorganized the material, corrected typos, added a section about character stacks
fields
Algebraic Geometry
pdf ↗ page arXiv:2602.20482 ↗

This paper establishes a functional stable central limit theorem for a class of superdiffusive solutions to stochastic differential equations driven by an $α$-stable process.

comments
12 pages; introduction expanded; to appear in Bernoulli
fields
Probability
pdf ↗ page arXiv:2602.20607 ↗

We prove that one may approximate parametric suprema of constructible and power-constructible functions using functions within the same class. This resolves a conjecture by Adiceam and Cluckers, which was posited after studying a question posed by Sarnak. We apply our result to prove that a certain subclass of Cexp-class distributions is tempered and to make uniform a bound concerning pushforward measures.

comments
Accepted version; 42 pages
fields
Algebraic Geometry, Logic, Number Theory
pdf ↗ page arXiv:2602.23126 ↗

Krall-type polynomials are orthogonal polynomials for a Stieltjes measure obtained by adding jumps at the boundary of the orthogonality interval of either the generalized Laguerre polynomials or the Jacobi polynomials. We show that both the recurrence relations and the second-order linear differential equations defining these polynomials are explicitly determined in terms of specific solutions of certain integrable systems. When only one jump is present, this leads to integrable cases of the Painlevé III or the Painlevé V equation. In the case of two jumps, first studied by Koornwinder [Canad. Math. Bull. 27 (1984), 205-214], we obtain a new integrable system of partial differential equations of Schlesinger type. When the jumps are equal and the starting polynomials are the Gegenbauer polynomials, this system reduces to an integrable case of the Painlevé V equation.

journal
SIGMA 22 (2026), 114, 40 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2603.01132 ↗

We establish a connection between the stability of discrete-time algorithms (DTAs) and continuous-time dynamical systems, in particular their $O(s^r)$-resolution ordinary differential equations (ODEs). We show that exponential stability of a common equilibrium transfers to the DTA whenever the one-step error is small relative to the distance to the equilibrium and the one-step Lyapunov decay. This condition is sharp in order, and one-step consistency alone is insufficient. The result is local and allows step-size-dependent ODEs and Lyapunov functions, covering $O(s)$-resolution ODEs whose decay rate vanishes as the step size tends to zero. Asymptotic stability is not inherited in general, but a comparison criterion and a checkable compatibility condition ensure it carries over for equilibria and compact sets. For resolution ODEs, joint regularity of the update map guarantees the required error bound. We apply the framework to two-timescale gradient descent ascent (TT-GDA), generalised extragradient, two-timescale proximal point, and (regularised) damped Newton, showing that for small step sizes and suitable parameters, every saddle point with invertible Hessian is locally exponentially stable for all but TT-GDA. For degenerate saddle points, the framework yields asymptotic stability and convergence rates.

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

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. Added references. To appear on Moduli
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2603.01956 ↗

We solve the problem of topological classification for smooth structurally stable flows on closed four-dimensional manifolds, the non-wandering set of which contains exactly two saddle equilibria, and the wandering set contains isolated trajectories connecting these saddle equilibria (heteroclinic curves). In particular, we show that for a flow of the class under consideration on $\mathbb{CP}^2$, the number of heteroclinic curves is a complete topological invariant, while on the sphere $\mathbb S^4$, there exists a countably many equivalence classes with an arbitrary odd number $γ\geq 3$ of heteroclinic curves. These results contrast with a three-dimensional case, where under similar conditions there exists only finite set of equivalence classes for each number of heteroclinic curves.

fields
Dynamical Systems
pdf ↗ page arXiv:2603.07470 ↗

We train a reinforcement learning agent to simplify hard unknot diagrams and pair it with a learned crossing selector to search for short unknotting sequences. Three examples found by the agent lead to an infinite family of prime two-bridge knots of unknotting number three whose connected sums with the figure-eight knot also have unknotting number three, and fifteen new unknotting upper bounds were found on the set of prime knots up to 13 crossings.

comments
19 pages, many figures, comments welcome
fields
Geometric Topology
pdf ↗ page arXiv:2603.07955 ↗

Fluid reconfigurable intelligent surfaces (FRIS) combine the position reconfigurability of fluid antennas (FA) with the phase control suburbs of reconfigurable intelligent surfaces (RIS). In this paper, we propose fluid-port-selected receive index modulation (FPS-RIM), which uses fluid-port selection as an additional spatial degree of freedom. Two operating modes are considered: FPS-RIM index-only (FPS-RIM-IO), which conveys information through the receive-antenna index, and FPS-RIM symbol-augmented (FPS-RIM-SA), which additionally conveys a constellation symbol. Under finite-resolution phase control, the active port and its quantized phase are jointly determined by the post-quantization in-phase component. A low-complexity Top-$L$ detector retains the receive-index candidates with the largest received energies and performs joint detection over the reduced candidate set. For spatially correlated FRIS cascaded channels, we derive selection-aware joint moments that account for phase quantization, fluid-port selection, and overlapping port selections between receive-index states. Correlated Gaussian distance models and quadratic-form Laplace transforms are then used to obtain unconditional pairwise error probabilities and a union-bound bit error rate expression. Numerical results show that fluid-port selection improves the error performance over conventional RIS schemes and that the proposed detector approaches maximum-likelihood performance with a moderate list size. The analytical results closely follow the simulations.

fields
Information Theory
pdf ↗ page arXiv:2603.11714 ↗

In this article, we discuss gradient robust discretizations for the simulation of non-linear incompressible Navier-Stokes problem and the optimal control of such flow. We consider several formulations of the flow problem that are equivalent for the continuous non-linear forward problem and compare their gradient robust discretization. We will then discuss the influence of the chosen formulation on the adjoint equations needed for gradient computation in the solution of the optimal control problem.

comments
12 pages, submitted to the proceedings of Numerical Mathematics and Advanced Applications ENUMATH 2025
fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2603.12028 ↗

A graph is split if its vertex set can be partitioned into a clique and an independent set. Let $K_{1,4}+e$ denote the graph obtained from $K_{1,4}$ by adding an edge between two leaves. Ryjáček et al. [J. Combin. Theory Ser. B 134 (2019), 239–263] conjectured that every $4$-connected graph with minimum degree at least 6 that contains neither $K_{1,4}$ nor $K_{1,4}+e$ as an induced subgraph is Hamiltonian. They proved the conclusion for $5$-connected graphs with the same minimum degree bound. We prove that every $3$-connected split graph of order at least 13 that contains neither of these induced subgraphs is Hamilton-connected. Together with Dirac's theorem, this proves the conjecture of Ryjáček et al. for split graphs.

fields
Combinatorics
pdf ↗ page arXiv:2603.12770 ↗

For nonlinear time-delay systems, we show that the existence of a Lyapunov-Krasovskii functional (LKF) with pointwise dissipation (i.e., dissipation in terms of the current solution norm) suffices for input-to-state stability, provided that uniform global stability can also be ensured using the same LKF. To this end, we employ elements of a recently developed stability theory in which the behavior of solutions is not assessed through the classical norm but rather through a specific LKF. As a consequence of our results, we obtain a strengthening and extension of the classical Lyapunov-Krasovskii theorem for undisturbed systems to systems with uniformly bounded disturbances. We discuss the advantages of our approach by means of an example.

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

In this paper, we investigate the geometric structures of $G$-fans associated with rank $3$ real cluster-cyclic exchange matrices. In this class, a simple recursion for tropical signs was found, which enables us to study the detailed properties of $c$-, $g$-vectors. We introduce two kinds of upper bounds of the $G$-fans. The first one is the global upper bound, which comes from a hyperbolic surface containing all $g$-vectors after an initial mutation. The second one is the local upper bound, which reflects the internal separateness structure. As applications, we prove that there is no periodicity among $g$-vectors, and we completely determine the sign of $g$-vectors. We also prove the monotonicity of $g$-vectors under the minimum assumption. Moreover, we show that the three global upper bounds can be simplified to a single uniform upper bound.

comments
58 pages, 13 figures, Comments are welcome. ver. 2: revise a mistake in Example 9.4 and some minor points. ver. 3: minor revisions
fields
Combinatorics, Representation Theory
pdf ↗ page arXiv:2603.16326 ↗

We prove Ehrenborg's conjecture that every connected bipartite graph $G$ with parts of size $m$ and $n$ has at most $\frac{1}{mn}\prod_{v\in V(G)} \operatorname{deg}(v)$ spanning trees, and that equality holds if and only if $G$ is a Ferrers graph.

comments
simplified proofs, 13 pages
fields
Combinatorics
pdf ↗ page arXiv:2603.17997 ↗

We isolate two combinatorial properties, each expressible by a $Π_2$-sentence over the structure $(H(ω_3),\in,ω_1,ω_2,\text{NS}_{ω_2})$, such that each property is consistent with CH, and their conjunction together with $2^ω\le ω_2$ and $2^{ω_1} = 2^{ω_2} = ω_3$ implies the existence of a c.c.c. forcing which forces the higher Baumgartner's axiom.

comments
To appear in Forum of Mathematics, Sigma
fields
Logic
pdf ↗ page arXiv:2603.20905 ↗

We establish small-data global existence and decay for the causal-informational nonlocal gravity model CETOmega in 3+1 dimensions. Under harmonic gauge the field equations reduce to a quasilinear hyperbolic system with causal memory generated by a retarded Stieltjes operator K^{-1}. We establish three results: (i) commutator estimates for the Klainerman vector fields acting on K^{-1}, showing that the nonlocal operator costs at most two additional derivatives relative to Einstein vacuum; (ii) a sharp Sobolev-level bound on the memory convolution under explicit integrability conditions on the spectral density rho; (iii) global existence, uniform energy bounds, and pointwise (1+t)^{-1} decay for small initial data in H^N with N>=10. The proof combines the Lindblad-Rodnianski ghost weight method with commutator estimates and resolvent identities adapted to the Stieltjes kernel. A key structural observation is that retarded causality of the kernel is mathematically necessary for the stability argument: acausal modifications destroy the hyperbolic energy identity on which the bootstrap relies. We verify that the spectral conditions are satisfied by explicit, physically motivated kernel families. Because the memory operator generates a persistent tail that does not vanish at late times, classical scattering to free waves does not hold; we establish instead modified scattering, proving convergence to a solution of a linear wave equation with an explicit, computable memory profile in the energy topology. We discuss quantitative observational signatures including gravitational wave memory excess, frequency-dependent phase shift, and anomalous late-time ringdown tail controlled by the same spectral constants governing the stability conditions.

comments
Withdrawn by the author due to errors in the main argument: the resolvent bound uniform in mu>=0 (Lemmas 3.15-3.16) fails at low frequency, the decay estimate of Lemma 3.17(ii) is unjustified, and Proposition 6.6 uses an invalid L^inf x L^2 bound on R^3. The global stability theorem is not established as stated
fields
Analysis of PDEs
pdf ↗ page arXiv:2603.26689 ↗

Co-moving volumes and Reynolds transport theorem along a fluid flow are fundamental ingredients for deriving balance laws in fluid mechanics, where the classical theory of flow maps of ODEs associated to smooth vector fields plays a central role. In connection with weak solutions of the Navier-Stokes equations, DiPerna-Lions (Invent. Math. 1989) generalized the classical notions of ODEs and flow maps to vector fields in Sobolev spaces. DiPerna-Lions theory also characterizes the evolution of the measure of the inverse image of each Borel measurable set under generalized flow maps in terms of the divergence of vector fields. On the other hand, the image of a measurable set under generalized flow maps, which corresponds to a co-moving volume in the classical theory, is not necessarily measurable, even though the flow map is measurable. In this paper, we show that if a Borel measurable set is trimmed by removing a null set depending on the pair of evolution time and initial time but not on the initial set, its image becomes Borel measurable, and its measure is consistent with the measure of the classical untrimmed case in the smooth approximation limit. Then, by defining co-moving volumes with such a trimming procedure, we prove a version of Reynolds transport theorem for generalized flow maps. While the usual DiPerna-Lions theory mainly treats transport through compositions with flow maps and push-forward measures, our proofs are organized with the direct treatment of forward images in mind. The approach makes the passage from classical material transport to generalized flows explicit. In particular, it clarifies the measurability of suitably trimmed forward images and their stability under smooth approximation.

fields
Analysis of PDEs
pdf ↗ page arXiv:2603.27491 ↗

A graph G is unstable if its canonical double cover CDC(G) has strictly more automorphisms than Aut(G) x Z_2; a related but distinct question is when two non-isomorphic graphs share the same CDC. We place both problems in one framework of lifting and guided folding, and show that each is governed by the same datum: the conjugacy classes of strongly switching involutions in Aut(CDC(G)). Folding the lift of a two-fold isomorphism along a guide always returns a graph TF-isomorphic to the original. If it is not isomorphic to it, the two form a TF-cousin pair; if two distinct guides both return an isomorphic copy, the graph is unstable. From a seed pair (C_k u C_k, C_2k) with k odd, the construction gives TF-cousin pairs and unstable graphs of every order from 6 on. We introduce the claw graphs CG(n) and prove that CG(n) and CG'(n) are TF-cousins if and only if n is odd; for n = 1 they are the Petersen graph and a cubic companion on 10 vertices, with the Desargues graph as their common CDC. We conjecture that in every TF-cousin pair one member contains two vertex-disjoint copies of C_k and the other contains C_2k for some odd k, and that every unstable asymmetric graph contains both C_k and C_2k for some odd k; the first is verified for all connected graphs on at most 9 vertices.

comments
13 pages, 10 figures
fields
Combinatorics
pdf ↗ page arXiv:2603.27559 ↗

We study two related problems on simple, un-directed graphs: Edge Deletion to Cactus and Spanning Tree to Cactus. Edge Deletion to Cactus has been known to be NP-hard on general graphs at least since 1988. We show improved exact algorithms for the former and a polynomial time algorithm for the latter.

fields
Combinatorics
pdf ↗ page arXiv:2603.27655 ↗

We prove the asymptotic mixed normality of the least absolute deviation (LAD) estimator for a locally $α$-stable stochastic differential equation (SDE) observed at high frequency, where $α\in(0,2)$. We investigate both ergodic and non-ergodic cases, where the terminal sampling time diverges or is fixed, respectively, under different sets of assumptions. The objective function for the LAD estimator is expressed in a fully explicit form without necessitating numerical integration, offering a significant computational advantage over the existing non-Gaussian stable quasi-likelihood approach. We also give illustrative numerical results that support our theoretical finding.

comments
61 pages
fields
Statistics Theory
pdf ↗ page arXiv:2603.28564 ↗

We investigate Diophantine pairs and triples of triangular numbers with the property $D(a)$ for a non-zero integer $a$. We prove that if a triangular number belongs to a $D(a)$-pair, it can be extended to infinitely many $D(a)$-triples of triangular numbers. Additionally, we determine infinite families of integers $a$ that admit such pairs, as well as families for which no $D(a)$-pairs can exist.

comments
Accepted for publication in Bull. Belg. Math. Soc. Simon Stevin; this is the accepted version
fields
Number Theory
pdf ↗ page arXiv:2603.29565 ↗

Monotone co-design enables compositional engineering design by modeling components as feasibility relations between required resources and provided functionalities. However, its boolean formulation cannot natively represent quantitative criteria such as cost, confidence, or implementation choice. In practice, these considerations are introduced through ad-hoc scalarization or by augmenting the resource space, which obscures system structure and increases computational complexity. Therefore, we develop a quantale-enriched theory of co-design in which resources and functionalities are quantale-enriched categories and design problems are quantale-enriched profunctors, which lifts co-design from boolean feasibility to quantitative evaluation. Series, parallel, and feedback composition remain valid over any commutative quantale, and change-of-base maps between quantales yield heterogeneous composition, so that subsystems evaluated in different local semantics can be composed in a common framework. Numerical examples on a target-tracking system and a UAV delivery problem demonstrate this framework and show how it avoids the drawbacks of boolean-only formulations.

fields
Category Theory, Optimization and Control
pdf ↗ page arXiv:2603.29921 ↗

We separate rigorously what is necessary, what is sufficient, and what is neither for the integral conditions associated with the overdetermined free boundary problems $QS(f,g)$ (Laplacian, quadrature surfaces) and $B(f,g)$ (bi-Laplacian, Kirchhoff–Love plates) with non-constant boundary data $g$. The integral conditions are the natural extension of the constant-datum criteria of \cite{Barkatou2010,Barkatou2020}. The positive results are all radial or model-explicit; the natural integral conditions fail to be sufficient for radial existence, and the question of their sharpness in the non-radial class remains open. Every quantitative statement below is established either in the radially parametrized class $\mathcal{O}_C^{\rm rad}$ or in an explicit radial model.

fields
Analysis of PDEs
pdf ↗ page arXiv:2604.00376 ↗

We construct and analyze a class of one-dimensional boundary Hamiltonians arising from two-dimensional symmetry-protected topological phases with $\mathbb{Z}_N^{\times 3}$ symmetry on a triangular lattice. Using a cohomology-based transformation, the lattice models for the edge modes are explicitly obtained, and their structure is shown to be governed by the arithmetic properties of $N$. For prime $N$, the boundary theory admits a formulation in terms of mutually commuting Temperley-Lieb algebras. For the composite values of $N$, the models exhibit hierarchical or factorized structures. We demonstrate that the phases can be understood in terms of primary models augmented by local defect degrees of freedom that partition the system into independent segments. Finally, the global symmetry is realized on the boundary in a non-on-site and anomalous manner, directly realizing the corresponding 't Hooft anomaly.

fields
Mathematical Physics
pdf ↗ page arXiv:2604.00910 ↗

An old and well-known open problem in the critical point theory asks whether, for some $p \neq 2$ and some bounded domain $Ω$, there exists a critical value of the $p$-Dirichlet energy $\|\nabla u\|_{p;Ω}^p$ over an $L^p(Ω)$-sphere in $W_0^{1,p}(Ω)$ lying outside of a Ljusternik–Schnirelman type sequence of critical values, the latter will be called LS eigenvalues of the $p$-Laplacian. In this work, we provide a positive answer by showing the existence of a non-LS eigenvalue when $p>2$ is sufficiently close to $2$ and $Ω$ is just a planar rectangle close to the square. The arguments pursue the observation that a simple eigenvalue of the Laplacian can be a common point for several branches of eigenvalues of the $p$-Laplacian as $p$ varies. Since LS eigenvalues are continuous with respect to $p$ and exhaust the whole spectrum when $p=2$, we deduce that at least one of the branches must contain non-LS eigenvalues.

comments
17 pages, 1 figure. Exposition revised, main theorem strengthened, its proof simplified, several remarks added, and bibliography updated. Accepted to Algebra i Analiz (St. Petersburg Mathematical Journal)
fields
Analysis of PDEs, Functional Analysis, Spectral Theory
pdf ↗ page arXiv:2604.01138 ↗

In the Drosophila melanogaster egg chamber, collective migration of border cells toward the oocyte is guided by spatial chemoattractant gradients, yet the distribution of these signals within the tissue remains difficult to quantify experimentally. We develop a spatially resolved mathematical framework to examine how tissue geometry shapes local chemoattractant concentrations during migration. A phase-field model represents the egg chamber architecture and is coupled to a diffusion–reaction equation with spatially heterogeneous diffusivity, restricting free chemoattractant transport primarily to extracellular space while reducing diffusion within cellular domains. Chemoattractant is secreted from the oocyte boundary and degraded throughout the domain, producing geometry-dependent concentration patterns. We further couple this chemical field to a mechanical model of cluster migration through the Tangential Interface Migration (TIM) force, which links local chemoattractant cues with contact-mediated motion along neighboring nurse-cell interfaces. Simulations show that tissue architecture and signal localization jointly influence migration speed and directional persistence. In particular, geometric bottlenecks and intersections can flatten local gradients and slow migration. This framework provides a mechanistic approach for investigating how extracellular geometry, chemical signaling, and cell–cell interactions together regulate collective cell migration in vivo.

fields
Analysis of PDEs
pdf ↗ page arXiv:2604.01357 ↗

Continuous-time algebraic Riccati equations (CAREs) arise in numerous disciplines and can be written in several forms. When the coefficient matrices are small and dense, stabilizing solutions can be computed for all these forms. The situation differs for large-scale sparse problems: for CAREs in general form, only a reformulation of the Newton–Kleinman iteration is currently available. The low-rank alternating direction implicit (ADI) algorithm for CAREs, known as Riccati-ADI (RADI), is among the most successful and computationally efficient methods in the literature. However, RADI applies only to simplified forms of CAREs; no low-rank ADI algorithm is available for CAREs in general form. This paper presents a low-rank ADI algorithm for CAREs in general form, which contains RADI as a special case. Unlike the Newton–Kleinman iteration, which computes a new approximation at every step, the proposed algorithm—like RADI—recursively accumulates low-rank factors of an approximation to the stabilizing solution. Moreover, the residual admits a low-rank factorization, so its norm can be computed efficiently; in the Newton–Kleinman iteration, computing the residual norm is considerably more involved. An automatic shift-generation strategy is also proposed, enabling the algorithm to select its shifts without user input. Numerical experiments on benchmark problems with orders ranging from \(10^6\) to \(10^7\) show that the proposed method is accurate and computationally efficient, and that it outperforms the Newton–Kleinman iteration.

fields
Numerical Analysis
pdf ↗ page arXiv:2604.06556 ↗

This lecture note addresses the common misconception that the Gaussian distribution always yields the largest Cramér-Rao Bound (CRB). We show that this property only holds under restrictive conditions: specifically, when the mean and covariance parameters are decoupled in the Fisher Information Matrix (FIM), when the parameter of interest lies in the mean vector and when there are no additive nuisance parameters. Beyond this framework, we provide counterexamples demonstrating that non-Gaussian distributions can produce larger CRB.

fields
Information Theory
pdf ↗ page arXiv:2604.06974 ↗

In this paper, we introduce a generalised diagonal dimension. We explain why the generalised diagonal dimension extends the notion of diagonal dimension defined by Li, Liao, and Winter, and under which conditions these dimensions coincide. We prove permanence properties for the generalised diagonal dimension and compare it with the nuclear dimension. We investigate applications of the generalised diagonal dimension in large-scale geometry; specifically, we show that the generalised diagonal dimension of a noncommutative Cartan subalgebra in the C*-algebra generated by finite-propagation operators on a uniformly locally finite metric space is bounded above by the asymptotic dimension of the space, and we conjecture that the two are equal.

comments
20 pages. An anonymous referee pointed out a substantial gap in the proof of the main theorem in version 1 of this paper. Version 2 describes this gap, states a weaker version of the main theorem, and corrects some minor mistakes. The author will not pursue this topic further because he has left academia
fields
Operator Algebras
pdf ↗ page arXiv:2604.07237 ↗

Let $F$ be a local non-archimedian field of odd residue characteristic and let $G=PGL(2)$. In this paper we study an analog of irreducible cuspidal representations of the group $G(F)$ when $F$ is replaced by the field $K=F((t))$. The story turns out to be similar to the classical case, but also with some differences. We present a construction of such representations essentially (up to a small subtlety) starting from a quadratic extension $L$ of $K$ and a character $θ:L^*/K^*\to \mathbb C^*$ which is not Galois invariant. We also show that the restriction of the representations we construct to the group $P(K)$ (here $P$ is a Borel subgroup of $PGL(2)$) is irreducible. However, contrary to the classical case it turns out that these restrictions are not isomorphic to the "standard" irreducible cuspidal representation of $P(K)$. In the Appendix we propose a notion of cuspidality for smooth representations of the group $H(K)$ for an arbitrary split reductive group $H$.

comments
The article has been significantly expanded compared to the previous version
fields
Representation Theory, Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2604.11735 ↗

In many real-world problems, recovering sparse signals from underdetermined linear systems remains a fundamental challenge. Although $\ell_1$ norm minimization is widely used, it suffers from estimation bias that prevents it from reaching the Bayes-optimal reconstruction limit. Nonconvex alternatives, such as the log-sum penalty, have been proposed to promote stronger sparsity. However, maintaining their algorithmic stability is challenging. To address this challenge, we introduce an adaptive smoothing strategy within an approximate message passing framework to mitigate algorithmic instability. Furthermore, we evaluate the typical exact-recovery threshold for Gaussian measurement matrices using the replica method and state evolution. The results indicate that the adaptive method achieves exact recovery over a broader region than $\ell_1$-norm minimization, although metastable states hinder the attainment of the information-theoretic limit.

comments
26 pages, 6 figures
fields
Information Theory
pdf ↗ page arXiv:2604.13511 ↗

We propose and analyze an experimentally accessible Lindblad master equation for a quantum harmonic oscillator, simplifying a previous proposal to alleviate implementation constraints. It approximately stabilizes periodic grid states introduced in 2001 by Gottesman, Kitaev and Preskill (GKP), with applications for quantum error correction and quantum metrology. We obtain explicit estimates for the energy of the solutions of the Lindblad master equation. We estimate the convergence rate to the codespace when stabilizing a GKP qubit, and numerically study the effect of noise. We then present simulations illustrating how a modification of parameters allows preparing states of metrological interest in steady-state.

fields
Optimization and Control
pdf ↗ page arXiv:2604.13529 ↗

We study the Rokhlin lemma in the context of infinite measure-preserving bijections, and completely classify such bijections up to $λ$-approximate conjugacy, where $λ$ is the infinite measure which is preserved. This sharpens considerably the classical version of the Rokhlin lemma, which provides such a classification up to $μ$-approximate conjugacy where $μ$ is a probability measure equivalent to $λ$.

comments
New version with more historical background, 13 pages, comments welcome!
fields
Dynamical Systems
pdf ↗ page arXiv:2604.13802 ↗

Support vector machines (SVMs) can yield classifiers with similar predictive performance but different internal structures, particularly in the contributions of individual explanatory variables and their interactions. We introduce Orthogonal Representation Contribution Analysis (ORCA), a post-training methodology for SVMs constructed from tensor products of truncated Christoffel–Darboux kernels. The associated reproducing kernel Hilbert space (RKHS) admits a finite orthonormal polynomial basis in which the regularized component of the fitted decision function has an exact expansion. Squared expansion coefficients induce an additive decomposition of its squared RKHS norm. Based on this representation, normalized Orthogonal Kernel Contribution (OKC) indices quantify the fractions of the squared RKHS norm associated with total polynomial degrees, interaction orders, and input-variable contributions, both individually and through interactions of arbitrary order. ORCA summarizes these indices through joint structural maps, variable-specific displays, and comparisons of fitted classifiers. A controlled quartet of classification problems illustrates substantial structural differences under matched predictive performance. A double-spiral experiment compares five Jacobi kernels, while an application to the Vertebral Column data illustrates the method after cross-validated model selection. ORCA provides a quantitative characterization of the internal structure of fitted SVMs, revealing differences that may remain undetected by standard predictive performance metrics.

fields
Statistics Theory
pdf ↗ page arXiv:2604.15285 ↗

Let \(Λ\) be a finite-dimensional Koszul algebra with Koszul dual \(Λ^!\). We establish derived Koszul dualities at the level of bounded derived categories, both in the graded setting \(\mathsf{D}^{b}(Λ\textup{-gmod})\) and in the ungraded setting \(\mathsf{D}^{b}(Λ\textup{-mod})\). We first prove a graded derived Koszul duality for every finite-dimensional Koszul algebra, with no Noetherian or coherence assumptions on the Koszul dual. We then show that the bounded derived category \(\mathsf{D}^{b}(Λ\textup{-mod})\) can be reconstructed from the graded theory as the triangulated hull of an orbit category. This yields a genuinely non-graded derived Koszul duality. We further establish singular and dg refinements of these dualities. For Iwanaga–Gorenstein Koszul algebras, this gives a stable Koszul duality for graded Gorenstein-projective modules and their ungraded counterparts, providing a non-graded form of the Bernstein–Gel'fand–Gel'fand correspondence. As applications, we obtain new descriptions of the bounded derived categories \(\mathsf{D}^{b}(\mathcal{O}_λ)\) for all integral blocks of category \(\mathcal{O}\), including singular blocks, which are non-graded counterparts of the Koszul dualities of Beilinson, Ginzburg, and Soergel. We also establish analogous dualities for certain categories of perverse sheaves arising in geometric representation theory. Finally, we formulate conjectural descriptions of bounded derived and singularity categories of finite-dimensional graded algebras in terms of dg orbit categories.

comments
41 pages. Following the referee's report, the manuscript was shortened, and several minor typographical and mathematical errors were corrected. The research was completed in 2021 and arose from a question related to the author's Ph.D. thesis on Koszul duality. All mathematical results were independently obtained and established by the author without the use of AI tools
fields
Representation Theory, Category Theory
pdf ↗ page arXiv:2604.16805 ↗

In this paper, we study the stability of the shadow, a projection of a probability measure onto the set of couplings with prescribed marginals in the Wasserstein space, and its application to transfer learning. The shadow was introduced by \citet{EcksteinNutz2022} to analyze the stability of the Sinkhorn algorithm and was recently revisited by \citet{kim2026extensioncouplingprojectionoptimal} for statistical applications, particularly for reconstructing joint distributions from unpaired marginal observations. Under suitable regularity assumptions on Brenier potentials, we establish quantitative continuity of the shadow. As a key ingredient in our analysis, we also establish a stability bound for optimal transport maps under a smoothness assumption based on the previous results \citet{Li_Nochetto_2021, balakrishnan2025stabilityboundssmoothoptimal}. Also, we show the uniqueness of optimal transport projection provided that source measure is absolutely continuous, and the separable cost satisfies some regular conditions introduced by \cite{gangbo1996geometry}, which includes the $p$-th power of distance for $1 < p <\infty$. As an application, we investigate transfer learning from the perspective of shadow projection. Specifically, we consider a transport-based domain adaptation model with unpaired target covariate and response observations. We bound the generalization error of it by the approximation error and the distance between the shadow and its empirical counterpart, and also show and the consistency of the proposed estimator under smooth the Brenier potentials transporting the source marginals to their target counterparts. Additionally, assuming their strong convexity, we derive sample-complexity bounds and concentration of the generalization error. In particular, our analysis applies to suitable families of strongly log-concave measures.

comments
26 pages; fix error in the previous version by assuming regular Brenier potentials; add application of Wasserstein projection to transfer learning
fields
Statistics Theory, Optimization and Control, Probability
pdf ↗ page arXiv:2604.17711 ↗

We show some simple sufficient conditions under which the multilinear embedding theorem holds for fractional sparse operators. By verifying these conditions, we establish the theorem for power weights. We also clarify the relation between vanishing local Morrey spaces and $L^p \to L^q$, $1<p,q<\infty$, infinitesimal relative boundedness theorem. More precisely, we establish that belonging to some vanishing local Morrey spaces of the weight $v$ with an appropriate power provides sufficient conditions under which $L^p \to L^q$, $1<p,q<\infty$, infinitesimal relative bounds holds for Schrödinger operators $(-Δ)^{α/2}+v$.

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

Classical guidance laws aim at minimizing the miss distance, thus implicitly determining the minimum warhead lethality radius required against nominal targets. However, nonnominal targets or scenarios might render the designed warhead insufficient, causing a significant degradation in the single-shot kill probability (SSKP). We propose a guidance methodology that shifts the interceptor's objective from minimizing the miss distance to directly maximizing the SSKP, while taking into account the warhead's probabilistic lethality model. Complying with the generalized separation theorem, the paradigm presented here modifies deterministic differential-game-based guidance laws using Bayesian decision theory. For this purpose, we obtain the saddle-point solution of the deterministic differential game whose objective is the SSKP. Extensive Monte Carlo simulations demonstrate substantial SSKP improvement over the standard and recently introduced estimation-aware guidance laws, when tested against nominal and nonnominal evasively maneuvering targets.

comments
This work has been submitted to the IEEE for possible publication. 11 pages, 6 figures, and 4 tables
fields
Optimization and Control
pdf ↗ page arXiv:2604.17811 ↗

An explicit solution is derived for the Bellman inequality corresponding to minimax optimal dual control. The minimizing player determines control action as a function of past state measurements and inputs. The maximizing player selects disturbances and model parameters for the underlying linear time-invariant dynamics. The optimal minimizing policy is a dual controller that optimizes the tradeoff between exploration and exploitation. Once sufficient data has been collected, the policy becomes a deterministic certainty equivalence controller. However, when data is insufficient, the policy introduces a randomized term to improve excitation.

comments
The first version was accepted for CDC 2026, but withdrawn due to a proof error. This corrected version has been submitted to European Control Conference 2027
fields
Optimization and Control
pdf ↗ page arXiv:2604.18550 ↗

We observe that for a quasi-compact and quasi-separated scheme the structure sheaf generates the perfect complexes if and only if the lattice of thick subcategories is distributive if and only if the affinization map is 0-affine. Examples are discussed, including an example of a quasi-projective scheme which is not quasi-affine but for which these equivalent conditions hold.

comments
Added an abstract generalization of the main theorem and references to work of Ito and Olander
fields
Algebraic Geometry, Category Theory
pdf ↗ page arXiv:2604.18793 ↗

Depth is widely viewed as a central contributor to the success of deep neural networks, yet standard approximation results typically give error bounds only for the final output of a network. Inspired by classical multiscale expansions and multigrade deep learning, we give depth a scale-dependent interpretation by constructing a single network whose intermediate readouts approximate the target at successively finer scales. For any $f\in L^p([0,1]^d)$ with $1\le p <\infty$ and any integer $N\ge2$, we construct a single network of width $3dN+2d+4$ with the same activation pattern in every hidden layer, using sine in the first two neurons and $\mathtt{ReLU}$ in the rest. For every $\ell\ge0$, the $L^p$ approximation error of the readout $Φ_\ell$ at layer $\ell+4$ is bounded by $(2d+1)ω_{f,p}(N^{-\ell})$, where $ω_{f,p}$ denotes the $L^p$ translation modulus of $f$. Under the Hölder condition $ω_{f,p}(t)\le Ct^α$ with $C>0$ and $0< α\le 1$, this estimate yields the geometric bound $(2d+1)C N^{-α\ell}$. More generally, if $ω_{f,p}(t)$ has a known upper bound that tends to zero as $t\downarrow0$, we obtain a stopping rule for adaptive depth selection. We can stop at the first depth where the error bound meets the desired tolerance and later append layers to meet a tighter tolerance while keeping all earlier maps and readouts fixed.

fields
Numerical Analysis
pdf ↗ page arXiv:2604.20219 ↗

In this paper, we show that starting from a geodesic ball $\overline{B_{r_0}}(0)$ in $\mathbb{H}^n$, for $n\geq3$, with prescribed non-decreasing rotationally symmetric mean curvature and the fixed conformal class $[g_{\mathbb{S}^{n-1}}]$ on the boundary, the solution $g(t)$ to the normalized Ricci flow $(1.2)$ which is continuous up to the boundary, exists for all $t>0$ and converges locally uniformly in $B_{r_0}(0)$ to a complete hyperbolic metric as $t\to\infty$(see Theorem 1.2 for details). Moreover, the sectional curvature of $g(t)$ maintains less than $-1$ for $t>0$.

comments
Typos have been corrected. The first part of the proof of Theorem 4.2 has been moved to the end of the proof of Lemma 4.1 to complete the latter's proof. An AI-assisted proof of Theorem 1.3 without condition (1.18) has been placed in the appendix
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2604.20375 ↗

This is a continuation of the research in [16]. Let $(\overline{M},g_{-1})$ be a closed geodesic $r_0$-ball in the hyperbolic space $(\mathbb{H}^n,g_{-1})$. Let $m\neq1$ be a positive constant. In this paper, we show that for $n\geq3$, starting from the metric $m g_{-1}$ on $\overline{M}$, with certain prescribed non-decreasing rotationally symmetric mean curvature and the fixed conformal class $[g_{\mathbb{S}^{n-1}}]$ on the boundary $\partial M$, the solution $g(t)$ to the normalized Ricci flow $(1.2)$ which is continuous up to the boundary, exists for all $t>0$, and converges locally uniformly in the interior $M$ of $\overline{M}$ to a complete hyperbolic metric as $t\to\infty$(see Theorem 1.1 for details). Under some additional conditions, we show the same conclusion holds for $n=2$.

comments
Typos have been corrected. The first part of the proof of Theorem 4.2 has been moved to the end of the proof of Lemma 4.1 to complete the latter's proof. An AI-assisted proof of Theorem 1.2 without conditions (1.20) and (1.21) has been placed in the appendix
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2604.20383 ↗

We classify pairs $(X,G)$ consisting of a (possibly singular) cubic threefold $X\subset\mathbb{P}^4$ and a finite subgroup $G\subset\mathrm{Aut}(X)$ such that $X$ is $G$-birationally rigid, i.e., $X$ is a $G$-Mori fiber space (over a point), and $X$ is not $G$-birational to any $G$-Mori fibre space that is not $G$-biregular to $X$.

comments
65 pages, typos removed, the proof of Theorem 17 is simplified
fields
Algebraic Geometry
pdf ↗ page arXiv:2604.20426 ↗

We study the relationship between presheaf constructions and free cocompletions in the context of formal category theory, elucidating the coincidence between the two concepts in familiar settings. We show that, in a virtual equipment satisfying mild assumptions, free cocompletions under classes of weights are exhibited by presheaf constructions. We furthermore extend the theory of weighted colimits from enriched category theory to this setting, developing the concepts of atomicity and rank, and providing recognition theorems for presheaf objects, free cocompletions, and cocomplete objects. As an application of our methods, we construct free cocompletions, under arbitrary classes of colimit-small weights, of (possibly large) categories enriched in (not necessarily symmetric) monoidal categories and bicategories; this resolves a longstanding omission in the literature on enriched category theory. As a consequence, we obtain a categorified Eilenberg–Watts theorem, which extends the classical theorem for categories of modules for rings (seen as one-object Ab-enriched categories) to categories enriched in a bicategory.

comments
68 pages; v3: sharpened results, additional examples
fields
Category Theory
pdf ↗ page arXiv:2604.22370 ↗

We study the control of finite-state systems driven by exogenous disturbances, and design causal policies that track the performance of any lookahead benchmark controller. This objective is formalized through dynamic regret, so that favorable disturbance sequences are compared against a strong benchmark, while under adverse disturbance sequences the comparison accounts for the benchmark's degraded performance. This benchmark-relative framework provides an alternative to classical MDP formulations, which assume i.i.d. disturbances, and to robust control approaches, which optimize against worst-case disturbances. Our main result is a nested dynamic-programming solution that computes both the optimal worst-case regret and a regret-optimal policy. In particular, we introduce the Regret-Bellman operator, whose fixed-point value function feeds into a finite-horizon dynamic program. Numerical examples show that regret-optimal policies interpolate nicely between MDP-based and robust controllers without requiring knowledge of the disturbance distribution, and can even outperform both under i.i.d. or structured disturbances.

fields
Optimization and Control
pdf ↗ page arXiv:2604.23760 ↗

Submersions with definite folds are submersions on manifolds with boundary whose restrictions to the boundary are definite fold maps. In this paper, we study differential-topological properties of manifolds with boundary admitting such maps into Euclidean spaces. When the target is $\mathbb{R}$, we obtain restrictions on the homeomorphism and diffeomorphism types of the source manifolds by using results for $m$-functions. For targets of dimension greater than one, we focus on the cases where the restrictions to the boundary are round fold maps or image simple fold maps, both defined by conditions on the singular value set. Then, we study the diffeomorphism types and Euler characteristics of manifolds admitting such maps. These results have applications to non-singular extensions of definite fold maps.

comments
15 pages, 3 figures
fields
Geometric Topology
pdf ↗ page arXiv:2604.26249 ↗

This work investigates a two-stage method for constructing projection-based reduced-order models (ROMs) of parameterized partial differential equations (PDEs). Based on established tensorial ROM methodology, the proposed approach reduces dimensionality offline by encoding solution snapshots using a multi-linear Tucker factorization, so that a reduced basis which varies nonlinearly with PDE parameters can be rapidly constructed online and used in a Galerkin ROM. Two novel extensions of this strategy, tailored to the cases of structured PDEs and sparse parameter sampling, are presented: the construction of reduced bases orthonormalized with respect to a general discrete inner product, and the interpolation of encoded states via radial basis functions. Basic representation and ROM error estimates are presented demonstrating the validity of these modifications, and the approach is challenged on state-linear examples where monolithic-basis ROMs are known to struggle, including a realistic instance of Maxwell's equations in 3D. Results suggest that the proposed nonlinear basis ROM can effectively mitigate linear restrictions on Kolmogorov $n$-width while improving upon previous tensorial ROM technology, particularly in the highly nonlinear and data-limited regimes characteristic of practical use cases.

fields
Numerical Analysis, Dynamical Systems
pdf ↗ page arXiv:2604.26280 ↗

We study the quantum Gromov–Hausdorff convergence of spectral truncations of \(C(G)\), where \(G\) is a coamenable compact quantum group equipped with a proper length function. Using higher-order commutator seminorms, we establish sufficient conditions for the induced Lipschitz seminorms to define compact quantum metric structures. Furthermore, for the Dirac operators associated with the length function, we prove that their spectral truncations converge to the original space in the quantum Gromov–Hausdorff distance. Our results apply to \(SU(N)\), \(SO(N)\), and related examples, including coamenable compact quantum groups of Kac type with polynomial growth.

fields
Operator Algebras
pdf ↗ page arXiv:2604.27475 ↗

We describe a dynamical system in which a symbolic field is coupled to a geometric field via a bipartite Hilbert-Schmidt kernel. The system is fully described by a retarded functional differential equation (RFDE) on the history space, subject to Lipschitz and small gain conditions. We show that the RFDE is well-posed under constant input and that it admits a compact global attractor. The principal subsystem $(H_L, X_R, P)$, which is comprised of the two primary fields as well as an executive field, is shown to be globally stable independent of delay, provided that the interfield coupling satisfies $C_{\mathcal{K}}^2<μ_Lμ_R$. In addition, we describe design specifications that fulfill the hypotheses of the main Theorem.

comments
V5: Various minor corrections and other improvements
fields
Dynamical Systems
pdf ↗ page arXiv:2605.03940 ↗

We use an ansatz based on rotations of the Pauli basis to construct exact propagating solutions of the sourceless SU(2) Yang–Mills equations in $(3+1)$ dimensions. By examining and extending this ansatz, we obtain two wave families with nontrivial transverse structures and a family of finite-amplitude waves on a self-similar non-Abelian background. These solutions can retain a genuinely non-Abelian structure while admitting arbitrary wave profiles propagating at the speed of light and carrying the corresponding longitudinal electric or magnetic fields. We also investigate the parameter conditions for their non-Abelian character and their energy transport. For the self-similar family, we study the structure of its singular plane and construct suitable sources to replace the singular region while preserving wave propagation in the remaining regions. This offers a possible interpretation of these solutions as propagating fields outside sources.

comments
17 pages, 0 figure. 1 Table, Revised version
fields
Mathematical Physics
pdf ↗ page arXiv:2605.04964 ↗

Shock solutions for multi-temperature Euler equations are inherently ambiguous due to the loss of microscopic physical detail during model reduction and occurrence of non-conservative terms. This paper presents a detailed analytical study of shock structures in such models. We present two distinct Hugoniot relations, each corresponding to a physically admissible shock solution. Through classical analysis à la Courant–Friedrichs, we demonstrate that both satisfy admissibility conditions, revealing a fundamental non-uniqueness in shock structures. By relating these solutions to existing numerical schemes, the structure-preserving and vanishing viscosity approaches, we provide physically justified references for constructing and evaluating discontinuous numerical approximations. In particular, we emphasize that the Hugoniot relation is not uniquely determined by the macroscopic PDEs alone, but must be supplied from external sources such as experiments or first-principles simulations. This insight demonstrates the essential role of microscopic physics in resolving shock ambiguity and contributes to the theoretical foundation for modeling discontinuous plasma flows.

fields
Mathematical Physics
pdf ↗ page arXiv:2605.06131 ↗

Information theory plays a central role in establishing fundamental limits on what any learning or estimation algorithm can -- and cannot -- achieve, regardless of computational power. This draft provides an introduction to these connections. We begin by introducing concentration inequalities along with the notions of covering and packing in metric spaces, and the associated concept of metric entropy. These tools are essential for our analysis. We then introduce the learning-theoretic framework and derive upper bounds on generalization error in terms of metric entropy, Rademacher complexity, and the VC dimension, as well as mutual information and relative entropy. Finally we discuss the minimax estimation framework and establish lower bounds on minimax risk using Fano's inequality, yielding bounds in terms of relative entropy and covering and packing numbers. A significantly revised and augmented version of this manuscript will appear as two chapters in the forthcoming third edition of Cover and Thomas's Elements of Information Theory. For questions, please contact abbas@ee.stanford.edu.

fields
Information Theory, Statistics Theory
pdf ↗ page arXiv:2605.06710 ↗

We provide a rigorous construction of I.M. Singer's universal connection, a natural connection on a bundle of paths associated to any manifold, using the theory of diffeology. Furthermore, we generalize the universal connection to the diffeological setting, which enables the reconstruction of diffeological principal bundles with connections from their holonomy representations, extending known bundle-reconstruction results into diffeology. In particular, any two diffeological bundle-connection pairs with conjugate holonomy representations must be isomorphic as bundles, with the isomorphism taking horizontal paths to horizontal paths. Finally, we show that reconstruction and holonomy are functorial and, for a fixed diffeological group $G$, form an adjoint equivalence between the category of smooth homomorphisms from based loop groups into $G$ and the category of pointed diffeological principal $G$-bundle-connection pairs, extending to the diffeological setting the known equivalences for manifolds and Lie groups.

comments
First Revision: 39 pages, 1 figure. Comments welcome!
fields
Differential Geometry, Mathematical Physics
pdf ↗ page arXiv:2605.07730 ↗

We propose a closed-form spectral framework for relative log-density estimation in linearly parameterized probabilistic models, including unnormalized and conditional models. This is achieved by representing the Kullback-Leibler (KL) divergence as an integral of weighted chi-squared divergences, converting KL estimation into a family of least-squares problems. We derive an explicit spectral formula based only on first- and second-order feature moments, yielding closed-form estimators of both divergences and log-density potentials for fixed features. The framework extends to a broad class of $f$-divergences and can be combined with kernelization or feature learning with neural networks (with then only a closed form for the last layer). We prove convergence guarantees for the resulting estimators and empirically compare them on synthetic data with optimization-based variational formulations, including logistic and softmax regression for normalized conditional models.

comments
Published at Advances in Neural Processing Systems
fields
Optimization and Control, Statistics Theory
pdf ↗ page arXiv:2605.10668 ↗

We study the reconstruction of the initial wave field of a nonlinear Schrödinger equation from lateral measurements. Our approach combines a Legendre-polynomial-exponential-time dimensional reduction with a Carleman-based contraction principle. First, we expand the solution in a weighted Legendre basis in time and truncate the expansion to obtain a coupled nonlinear elliptic system for the spatial coefficients. Next, we solve this reduced system by constructing a contraction map on a suitable admissible set. This contraction map admits a unique fixed point, which is the limit of the corresponding Picard iteration. We also establish a stability estimate showing that this fixed point remains close to the exact reduced solution in the noisy-data case. Finally, we present numerical experiments in two space dimensions for several different inclusion geometries and nonlinear exponents. The numerical results show that the proposed method recovers the main geometric features of the initial wave field, namely the locations and shapes of the inclusions, and that the relative reconstruction errors change only slightly for the tested additive noise levels of $5\%$, $10\%$, and $20\%$ in the boundary data.

fields
Numerical Analysis
pdf ↗ page arXiv:2605.11409 ↗

We provide a stratification of the $\mathrm{AGL}_r(\mathbb{C})$-representation variety of the fundamental group of the complement of a twisted Hopf link in terms of a stratification of the corresponding $\mathrm{GL}_r(\mathbb{C})$-representation variety. For ranks $1$ and $2$, we explicitly describe this stratification and compute the motives of these varieties in terms of the Lefschetz motive $q=[\mathbb{C}]$ in the Grothendieck ring of complex algebraic varieties $K_0(\mathbf{Var}_{\mathbb{C}})$.

comments
22 pages, 1 figure. v2: Correction of an error in the computation of the second motive appearing in Theorem A
fields
Geometric Topology
pdf ↗ page arXiv:2605.13585 ↗

The Kuramoto mean field game describes a population of oscillators which, above a critical value of the interaction parameter, form synchronized Nash equilibria. We show that these synchronized equilibria are unique, up to rotations, for each value of the parameter. Moreover, the unique equilibrium depends smoothly on the interaction parameter, and converges smoothly to the uniform distribution when the parameter approaches its critical value. These statements are direct consequences of our main technical result: the self-consistency map is strictly concave, as was previously conjectured by Carmona, Cormier, and Soner. In the proof, we decompose the second derivative of the self-consistency map as the sum of two moments, and prove that each of them is negative by using symmetrization arguments to exploit hidden monotonicity and skewness properties of the equilibria.

comments
v2: Improved exposition throughout and minor simplifications to the proofs. Results unchanged
fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2605.13783 ↗

We consider non-Fuchsian monodromy preserving deformations on a Riemann sphere. The associated isomonodromic deformation parameters on this surface comprise the positions of the singularities, together with the Birkhoff (spectral) invariants owing to the presence of irregular singularities. Our first main result is the derivation of the Loewner evolution of these isomonodromic deformation parameters. Using this result, we construct martingale observables for Schramm-Loewner evolution (SLE(4)) processes in the presence of double poles. Geometrically, the expressions contain the pre-Schwarzian and Schwarzian of the Loewner evolution, arising from conformal covariance of the observable. Furthermore, we characterize these SLE(4) observables uniquely in terms of confluent BPZ equations of a CFT with central charge c=1.

comments
36 pages, 1 figure; v2 typos have been fixed
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2605.13802 ↗

We construct a monomial basis of a quantum affine algebra of simply-laced type, associated to the PBW basis of Beck-Nakajima. We show that there exists a simple algorithm of computing canonical basis in terms of the monomial basis. We dsicuss the relations of the canonical basis obtained from this PBW basis with Lusztig's canonical basis constructed by using the geometry of quivers.

comments
Theorem 2.13 does not hold in this form. The proof of the theorem depends on Proposition 2.5. But there is a counter example for Proposition 2.5
fields
Quantum Algebra
pdf ↗ page arXiv:2605.14247 ↗

English: Sophie Germain (1776-1831) is the first woman known for important original research in mathematics, specifically in elasticity theory and number theory. We outline Germain's recently unearthed number theory results on Fermat's Last Theorem, in the context of her life, work, and interactions with Lagrange, Legendre, and Gauss. For two centuries her accomplishment was thought to consist of a single theorem attributed to her by Legendre, the first general result towards proving Fermat's Last Theorem. But recent discoveries in her handwritten manuscripts and correspondence show that she accomplished much more, albeit forgotten. In particular, she had a plan for proving Fermat's Last Theorem in its entirety, and carried this plan far, using then new tools, e.g., congruence, modular primitive roots, and permutations. Français: Sophie Germain (1776-1831) est la première femme connu pour des recherches originales importantes en mathématiques, en particulier en théorie de l'élasticité et en théorie des nombres. Nous exposons les résultats récemment découverts de Germain en théorie des nombres sur le dernier théorème de Fermat, dans le contexte de sa vie, de son oeuvre et de ses interactions avec Lagrange, Legendre et Gauss. Pendant deux siècles, ses résultats ont été considérés comme formant un seul théorème, attribué à elle par Legendre, et qui était le premier résultat général pour démontrer le dernier théorème de Fermat. Mais des découvertes récentes dans ses manuscrits et sa correspondance montrent qu'elle a accompli bien plus, quoique ce fut oublié. En particulier, elle avait un plan pour démontrer dans son intégralité le dernier théorème de Fermat, et elle a mené loin ce plan, utilisant alors de nouveaux outils, par exemple, la congruence, les racines primitives modulaires et les permutations.

comments
English, 10 pages; Français, 11 pages. https://sites.google.com/view/davidpengelley/david-pengelley
journal
English: Mathematics Today, Vol. 62, No. 5, October 2026, 132-135. Institute for Mathematics & its Applications
fields
History and Overview, Number Theory
pdf ↗ page arXiv:2605.15046 ↗

The conjectures of Low and Natario–Tod, and Penrose's question on Arnold's Problem list ask if causality in spacetimes can be formulated in terms of linking of spheres of light rays in the manifold of all light rays. For $(2+1)$-dimensional spacetimes, this link happens in the manifold coverable by a solid torus $S^1\times \mathbb R^2$. This was solved positively by Chernov and Nemirovski, which raises the question of which link invariants can be used to study causality. Chernov, Martin and Petkova proved that Heegaard–Floer and Khovanov homology completely capture causality. Allen–Swenberg conjectured that the Jones polynomial, which is obtained as an alternating Euler characteristic from Khovanov homology, is also sufficient. But they constructed complicated examples of links $\mathrm{AS}(n)_{n=1}^{\infty}$ that suggest that the Alexander–Conway polynomial -- which is the Euler characteristic of Heegaard–Floer homology -- is not enough. The Links–Gould polynomial is a quantum invariant that specializes to the classical Alexander–Conway polynomial in two different ways and somewhat surprisingly inherits some of its characteristic classical features. We show that it distinguishes all the Allen-Swenberg links from the link of causally unrelated events and hence detects causality in all known examples where the Alexander–Conway polynomial is not sufficient. This suggests that it may completely capture causality. The work on the categorification of the Links–Gould Polynomial is an ongoing and hard problem, and it is not a subject of this paper. As a corollary, we also compute the Seifert genus of all Allen–Swenberg links.

comments
15 pages
fields
Geometric Topology, Quantum Algebra
pdf ↗ page arXiv:2605.15515 ↗

We report on the status of the conjecture of Bousquet-Mélou and Mishna that the univariate counting generating function of a small-step quarter-plane lattice model is D-finite if and only if a particular group associated to the walk is finite. While the finite-group case is fully resolved, the infinite-group case remains incomplete. First we survey the known cases. By invoking asymptotics results from probability theory and a case analysis completed by Bostan, Raschel and Salvy (2014), we establish that the generating functions of 14 infinite-group models are not D-finite, and that for an additional 18 models the generating function for walks that end on an axis is not D-finite. We conclude with a discussion of limitations of asymptotic arguments to resolve the remaining cases.

comments
17 pages; A Conjecture about the non D-finiteness of Q(1,0;t) for several versions in v1 is proved in this version. Lucas Pannier is added as a co-author
fields
Combinatorics, Probability
pdf ↗ page arXiv:2605.16688 ↗

We establish an intrinsic square-root curvature-energy estimate for two-sided strongly stable CMC hypersurfaces in $\mathbb{R}^{n+1}$ for $3\leq n\leq 5$. By means of a weighted Hölder closure, we control a supercritical curvature norm in terms of the $L^2$ norm of the traceless second fundamental form, from which the pointwise bound follows via Moser iteration. In dimensions $n=3$ and $4$, the estimate holds without any scale restriction on the mean curvature. In regions of finite Morse index, this bound restricts points with low principal curvatures to neighborhoods of at most as many centers as the index, and yields an upper bound on the total diameter of separated degeneration sets in terms of their curvature energy and the index.

comments
17 pages
fields
Differential Geometry
pdf ↗ page arXiv:2605.17466 ↗

We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models of self-interacting random processes. We determine the asymptotic behavior of the walk under the assumption that its increments have moments of order $p$ for some $p>2$. In the linear case, where the drift depends linearly on the current position, we establish a phase transition in the convergence in distribution of the normalized process to Gaussian limits. In the nonlinear case, we identify three distinct regimes separated by a critical line and show that the normalized process exhibits qualitatively different behaviors in each regime, including convergence in distribution to a Gaussian law, convergence to a non-Gaussian limit given by the stationary distribution of a stochastic differential equation, and almost sure localization on a hypersphere.

comments
42 pages
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2605.17725 ↗

In this paper, we use derived sheaves to study rigidity phenomena in the cotangent bundles of manifolds endowed with some locally conformally symplectic ($\frak{lcs}$) structure. Taking inspiration from the work of Guillermou, Kashiwara and Shapira, we define a quantization for ``$\frak{lcs}$'' Hamiltonian isotopies, as well as new quantities: the asymptotic Betti numbers of a sheaf. We then show that those quantities are ``well behaved'' with respect of said quantization and use this to give a sheaf-theoretical proof of the Chantraine-Murphy theorem. We also consider the quantization in light of the Tamarkin morphism and the displacement energy of sheaves. This allows us to derive a non-squeezing theorem for $\frak{lcs}$ geometry that is similar, although not identical, to the one recently proven by Bertelson, Chakravarthy, and Sandon. Indeed, the result shown in this paper is more in line with the contact non-squeezing theorem shown by Eliashberg, Kim and Polterovich in 2006.

fields
Symplectic Geometry, Algebraic Topology
pdf ↗ page arXiv:2605.18614 ↗

We explore log Manin's conjecture for integral points and its connections to $\mathbb A^1$-connectedness. We prove log Manin's conjecture for Campana rational curves and for $\mathbb A^1$-curves on split toric varieties. Our arguments combine the Cox ring description of the moduli space of rational curves with Batyrev's heuristic-type counting arguments. As our proofs are geometric in nature, they give a geometric explanation of the mysterious leading constant for Campana points proposed by Chow–Loughran–Takloo-Bighash–Tanimoto.

comments
minor revision, 49 pages, to appear in Algebraic Geometry and Physics,
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2605.19898 ↗

We study the connection problem for a class of linear differential equations of order $N$ closely related to the Baxter equation of the quantum Toda chain. The space of solutions is $N$-dimensional and several linearly independent solutions decay at each singularity, leading to a rich structure of boundary value problems. We derive the weakest quantization conditions compatible with decaying behavior at both singularities, and formulate these conditions in terms of the associated monodromy data. In doing so, we prove the quantization conditions predicted by the topological string/spectral theory duality for a family of deformed Schrödinger equations. More generally, our results point to a hierarchy of spectral problems interpolating between the minimal conditions studied here and the maximally decaying boundary conditions of the $N$-particle quantum Toda chain.

comments
30 pages; version published in Annales Henri Poincaré
fields
Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2605.20338 ↗

Doob fixed-time conditioning enables the sampling of rare trajectories of Markov processes by modifying the drift so that reaching a prescribed target at a given time is guaranteed. We study the statistics of this conditioned path ensemble through the moment generating function in the weak-noise large deviation regime. Since the Doob drift is rarely available in closed form, we reinterpret the conditioned ensemble as the original process post-selected on the terminal constraint, thereby avoiding explicit construction of the Doob transform. This viewpoint then yields an optimal-control representation for the leading exponential contribution to the generating function, expressed as a variational principle with terminal boundary conditions set by the Doob end-point constraint. We illustrate the framework with two analytical examples and with an application to heat dissipation under Doob-controlled dynamics in a minimal model of biomolecular folding.

comments
13 pages + Appendices, 4 figures (v2: fixed typos, added clarifications and more explanations, and updated references prior to publication in JSP)
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2605.24537 ↗

Neural networks with randomly generated hidden weights (RaNNs) have been extensively studied, both as a standalone learning method and as an initialization for fully trainable deep learning methods. In this work, we study RaNN expressivity for learning solutions to non-linear partial differential equations (PDEs). Despite their widespread use in practical applications, a rigorous theoretical understanding of the approximation properties of RaNNs in this context remains limited. Here, we derive error bounds for RaNN approximations to time-dependent Sobolev functions and obtain a dimension-free approximation rate $\frac{1}{2}$ for sufficiently regular functions. We apply our results to two important classes of non-linear PDEs: Porous Medium Equations and Compressible Navier-Stokes Equations, showing that RaNNs are capable of efficiently approximating solutions to these complex, non-linear PDEs. Our theoretical analysis is supported by numerical experiments, showing that the obtained convergence rates extend beyond the considered setting.

fields
Numerical Analysis
pdf ↗ page arXiv:2605.25057 ↗

Given a signing $σ\colon E(K_{n,n})\to\{-1,+1\}$ of the complete bipartite graph, when does $K_{n,n}$ admit a $1$-factorization in which every perfect matching has discrepancy bounded below by a positive absolute constant? Unlike the complete-graph case resolved by Ai, He, Im, and Lee, the bipartite setting carries an unavoidable obstruction: any balanced one-sided signing—one whose edge signs depend on a single bipartition class, with the two labels split as evenly as possible—forces every perfect matching to have discrepancy at most $1/n$. We prove that this is essentially the only obstruction: For every $0<\varepsilon\leq1$ and all sufficiently large $n$, every signing of $K_{n,n}$ either (i) admits a $1$-factorization in which every perfect matching has discrepancy at least $\varepsilon/53$, or (ii) is $\varepsilon$-close, in normalized Hamming distance, to a balanced one-sided signing. The linear dependence on $\varepsilon$ is optimal up to an absolute factor. A key ingredient is a rank-one stability argument: if the density of rank-two $2\times 2$ switching patterns is small, then the sign matrix is close in Hamming distance to a rank-one sign matrix.

comments
16 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2605.25444 ↗

We study how much a linear program (LP) or an integer program (IP) can be compressed when solved repeatedly over a fixed feasible region with varying objective coefficients. We provide a framework that compresses LP and IP formulations with guarantees on the probability of preserving optimality, using either an uncertainty set for the cost vector or historical samples. Our framework exposes a tunable tradeoff between compression and the probability of recovering an optimal solution. We characterize the minimum dimension of affine reformulations preserving the full optimizer set over a given cost region and provide sample-based learning algorithms with fast-rate guarantees, without requiring a nondegeneracy assumption for LPs. With high confidence over the training data, the learned reformulation preserves the optimizer set for an independent test cost with probability at least $1-ρ-\widetilde{O}(d^\star_ρ/n)$, where $ρ$ bounds the excluded probability mass and $d^\star_ρ$ is the retained region's decision-relevant dimension. Existing data-driven approaches to LP and IP reduction do not, to our knowledge, learn a single low-dimensional affine reformulation with a prescribed probability of preserving the full optimizer set. Experimental results show substantial improvements over the compared baselines in accuracy, sample efficiency, and computational speed.

comments
Accepted at NeurIPS 2026. 32 pages, 11 figures
fields
Optimization and Control
pdf ↗ page arXiv:2605.25635 ↗

This paper introduces a novel class of well-balanced numerical schemes for hyperbolic systems of balance laws in 1D using the kinetic relaxation framework. Kinetic relaxation methods approximate nonlinear hyperbolic systems via a linear system of transport equations where nonlinearities are relegated to the source term. While these methods simplify the Riemann problem, they fail to preserve the discrete steady-state solutions of the original system because of the modified source term. We propose two distinct strategies to achieve the well-balanced property: a modified Finite Volume (FV) approach using well-balanced reconstruction operators and a well-balanced Semi-Lagrangian (SL) approach based on characteristic backtracking. Both methods ensure that the steady solutions of the original system remain invariant during the transport and projection steps. We demonstrate the efficacy of these schemes with first-, second-, and third-order accuracy using palindromic splitting techniques. Numerical results for Burgers' equation, the Shallow Water Equations with bathymetry, and the Euler equations with gravitational potential confirm that our relaxation schemes maintain steady states to machine precision while capturing complex transient dynamics.

fields
Numerical Analysis
pdf ↗ page arXiv:2605.25887 ↗

Competitive resource allocation problems over frequency and space can be formulated as a minimax interaction between transmit power and worst-case interference. This formulation naturally arises in multi-operator low Earth orbit (LEO) satellite spectrum sharing, where transmissions from competing constellations interfere in real-time. Under Gaussian channels, the corresponding power-allocation problem admits a convex-concave formulation with a unique saddle point. Discrete constellations yield generally nonconvex mercury/water-filling formulations. In this paper we propose the adversarial water-filling (AWF) problem with corresponding theory and algorithms for these settings. In addition, we develop a domain-specific wireless foundation model for AWF to learn the AWF search dynamics. The architecture incorporates permutation-invariant channel representations, a constraint-aware graph neural network (GNN) with sparse message passing, and global latent variables capturing the low-dimensional water level implied by the AWF optimality. Through learned projected extragradient iterations, the model approximates stationary solutions of the constrained minimax problem arising under mercury/water-filling. We further establish projected-stationarity/Karush-Kuhn-Tucker consistency and conditional local convergence of the learned AWF dynamics under local regularity and stability conditions. Experiments demonstrate empirical generalization across unseen problem sizes, constraint structures, discrete constellations, and channel-weighted objectives, while achieving a median speedup exceeding one order of magnitude over Mirror-Prox on matched instances at comparable first-order solution quality. The related code can be found at https://github.com/convexsoft/AWF.

comments
Published in IEEE Journal of Selected Topics in Signal Processing
journal
IEEE Journal of Selected Topics in Signal Processing. Print ISSN: 1932-4553. Online ISSN: 1941-0484
fields
Information Theory, Optimization and Control
pdf ↗ page arXiv:2605.26163 ↗

We consider a random walk on a closed manifold $M$ driven by a probability measure $μ$ on the set of $C^2$-diffeomorphisms. Provided $μ$ has compact support, satisfies certain gap, pinching, and ergodicity conditions, and is weak-$*$ close to volume-preserving, we prove $M$ carries exactly one atom-free stationary probability measure $Υ_μ$. It has finite high-dimensional Riesz energy and coincides with volume in the volume-preserving setting. Moreover, for every $x\in M$, the $n$-step distribution $μ^{*n}*δ_{x}$ converges to $Υ_μ$ unless $x$ is trapped in a finite $μ$-invariant set. Our result applies to a variety of situations: bi-expanding random walks on surfaces, non-linear perturbations of Zariski-dense random walks on the torus $\mathbb{T}^d$, on cocompact lattice quotients of $\mathrm{SO}(2,1), \mathrm{SO}(3,1)$, or on the sphere $\mathbb{S}^d$.

comments
50 pages. Corrected the stationary-measure regularity statement in the dissipative setting; clarified hypotheses and proofs, improved exposition, and updated references
fields
Dynamical Systems
pdf ↗ page arXiv:2605.27008 ↗

The wormhole contribution to the gravitational path integral may be interpreted as smooth remnant of correlations among the erratic large-$N$ behaviors of dual CFTs. In this work, we investigate this idea in (2+1)-dimensional gravity. We show that one-sided boundary gravitons are intrinsically incomplete in the sense that the associated observable algebra has a nontrivial center regardless of choices of boundary conditions. Based on asymptotic symmetries, we bootstrap a general Poisson bracket to construct completions of the boundary gravitons. In the simplest completion, the commutant of the boundary graviton observable algebra is given by an observable algebra of monodromy data which we interpret as an effective description of one-sided black holes. We show that, to describe Lorentzian multi-boundary wormholes, only the monodromy data with a positivity restriction is needed. The positivity restriction results in emergent erratic large-$N$ behaviors for some observables. We filter out the erratic observables by restricting to a subspace on which they act trivially. The monodromy observables generate nonlocal symmetries lack of corresponding local currents. We show that gauging the nonlocal symmetries is equivalent to filtering out the erratic observables. For one CFT, gauging the nonlocal symmetries at the quantum level removes all black hole states. Filtering the partition function of CFTs leads to an apparent ensemble averaging. For two CFTs, a Hilbert subspace describing wormholes survives after gauging global part of the nonlocal symmetries. The filtered partition function of the two CFTs is an ensemble average over quantum gates entangling the monodromy degrees of freedom of the two CFTs. The correlation between the erratic observables of the two CFTs is preserved, which contributes to the filtered partition function as a wormhole term.

comments
55 pages + appendices; typos corrected; convention unified; references added; added explanations to improve clarity
fields
Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2605.28748 ↗

We propose a Dynkin-type condition for smooth Riemannian manifolds with boundary. We show that this condition implies bi-Lipschitz equivalence with a Bakry-Émery weighted Riemannian manifold obtained via a time change. As a consequence, we obtain various results, including a local doubling property as well as lower bounds on the Neumann spectral gap and logarithmic Sobolev constant. The local doubling property also yields a new precompactness theorem for manifolds with boundary.

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

We couple the established time-dependent phase-space filter (TDPSF) with a slabwise physics-informed neural network (PINN) for open-domain wave propagation. The neural solver approximates the evolution on each time slab, and localized Fourier multipliers attenuate outgoing buffer components according to their group velocity. The resulting Microlocal PINN Filter (TDPSF-PINN) combines neural residual minimization, sequential buffer filtering, and transfer of the computed endpoint to the next slab. We present $3$ numerical tests: an anisotropic focusing nonlinear Schrödinger packet with a PML comparator, acoustic radiation with a CRBC comparator, and acoustic scattering by three rigid disks with a second-order Bayliss–Turkel comparator. At the reported budgets, TDPSF–PINN shows better accuracy and stability in all 3 tests in the long-time simulations.

fields
Numerical Analysis
pdf ↗ page arXiv:2606.06115 ↗

This paper develops a stochastic geometry framework for high-altitude platform station (HAP) networks in which platforms execute cyclic patrol trajectories anchored to designated service regions. We introduce two small-circle ring point-process models on the spherical Earth. In the small-circle ring Poisson Cox process (SCR-PCP), platforms form one-dimensional Poisson point processes on localized patrol rings, whereas in the small-circle ring binomial cluster process (SCR-BCP), each ring contains a fixed number of uniformly distributed platforms. We establish the isotropy of both models and derive spatial statistics, including the distributions of the nearest-anchor, nearest-ring, and nearest-HAP distances, together with the serving-ring angle distribution. Building on these results, we derive coverage probability expressions under nearest-visible-HAP association by decomposing aggregate interference into same-ring and other-ring components and characterizing their conditional Laplace transforms. To account for the flight dynamics of patrol-based HAPs, we integrate a steady circular flight propulsion model with the communication analysis and introduce a coverage energy efficiency (CEE) metric. This yields a necessary optimality condition for an interior energy-optimal patrol radius that balances coverage performance against the propulsion cost of circular flight. Numerical results reveal fundamental differences between intensity-driven (SCR-PCP) and finite-fleet (SCR-BCP) deployments and demonstrate that patrol geometry, platform density, and cruising velocity should be jointly considered to achieve energy-efficient HAP operation.

fields
Information Theory
pdf ↗ page arXiv:2606.06307 ↗

When a learned representation is reused for a new task, which of its structure should survive? A task is a small category, a change of task is a functor $J$, and the invariants of a trained representation form a functor $F$. The left Kan extension $\operatorname{Lan}_JF$ is the invariant that the source and the change of task force on the target: by its universal property, every comparison of the source with an observed target invariant factors through it. The transfer discrepancy is the largest distance, over the target objects, between this extension and the observed invariant. For persistent homology the extension is a cokernel over comma categories, and a functorial version of the discrepancy, which also compares the maps between target objects, is $1$-Lipschitz under interleavings. On finite samples the discrepancy is a bottleneck distance, computed without approximation. For data glued from two pieces whose exclusive parts lie farther apart than the filtration scale, a Mayer-Vietoris sequence identifies what extending homology loses, while extending chains loses nothing. For a merge of labelled point clouds, the degree-zero discrepancy vanishes if and only if some $1$-Lipschitz classifier has a margin above the filtration scale at every sample point. In experiments on sampled manifolds, trained encoders and pretrained image models, every exact prediction holds on every sample. The discrepancy of truncated invariants recovers a hidden merge of separated parts far above chance and tells the intended target of a merge from a permuted control, but across pretrained models it does not track the accuracy of a linear probe.

fields
Algebraic Topology, Category Theory
pdf ↗ page arXiv:2606.07627 ↗

In this paper, we develop a finite transposition method for the numerical approximation of backward stochastic differential equations (BSDEs). Starting from the transposition formulation of BSDEs, we construct appropriate finite-dimensional transposition spaces and establish the existence and uniqueness of the corresponding finite transposition solutions. We prove the convergence of the proposed method under standard assumptions and derive convergence rates under additional Malliavin regularity assumptions. The proposed approach provides a variational approximation framework for BSDEs and may be viewed as a stochastic counterpart of the classical finite element method for partial differential equations. In addition, the conditional expectations arising in the resulting scheme can be evaluated explicitly, thereby facilitating its numerical implementation.

comments
45 pp
fields
Probability, Numerical Analysis
pdf ↗ page arXiv:2606.08731 ↗

This paper uses theoretical results previously established in the literature to design search algorithms to find new linear codes over $\mathbb{Z}_4$ from cyclic and negacyclic codes of even length. As a result of these searches, we have found 2500 new cyclic codes and 730 negacyclic codes. These new codes exhibit improved parameters compared to previously known codes. Additionally, we have obtained binary quantum codes with good parameters from such $\mathbb{Z}_4$ codes.

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

We propose LEAF, a learning-enabled ADMM framework for accelerated convex optimization. The key idea is to approximate the Moreau envelope of the objective function using an Input Convex Neural Network (ICNN), resulting in a learned model that preserves convexity and smoothness. This leads to the proposed Moreau Envelope Learning ADMM (MEL-ADMM) and its splitting variant sMEL-ADMM. Unlike existing approaches that learn high-dimensional operators directly, LEAF learns a scalar-valued Moreau envelope, significantly reducing model complexity and improving data efficiency. The framework accommodates a broad class of convex problems with smooth and non-smooth objectives. By embedding convexity explicitly through the ICNN architecture, the proposed approach maintains high approximation accuracy while preserving key structural properties of the optimization problem. Both MEL-ADMM and sMEL-ADMM are developed with theoretical guarantees of convergence and feasibility under the learned model. Rigorous analysis shows that the proposed methods achieve convergence rates comparable to classical ADMM while reducing per-iteration computational cost. Numerical experiments demonstrate up to an order-of-magnitude speedup over state-of-the-art solvers while maintaining low optimality gaps

fields
Optimization and Control
pdf ↗ page arXiv:2606.08993 ↗

We establish a unified operator-theoretic framework for understanding the results on the Weil quadratic form obtained by Yoshida (1992), Bombieri (2001, 2003), Connes–Consani (2023), and Connes–Consani–Moscovici (2025+) from the perspective of the screw function introduced in Suzuki (2023). An advantage of the approach via the screw function is that it provides a method to study the Weil quadratic form, which is originally defined in terms of distributions, by means of continuous functions and brings the theory of de Branges spaces into the analysis of the Weil quadratic form via the Fourier transform. Based on this framework, we formulate a conjecture stating that a self-adjoint operator whose eigenvalues are the imaginary parts of the nontrivial zeros of the Riemann zeta function can be obtained as the limit, as $a \to \infty$, of self-adjoint operators arising from nonlocal realizations of the first-order differential operator on the finite interval $[-a,a]$. All these results are obtained without assuming the Riemann Hypothesis. This conjecture may be compared with the limit formula for the Riemann zeta function expressed in terms of zeta-regularized products proposed by Connes, Consani, and Moscovici, and it sheds new light on the spectral-theoretic interpretation of the nontrivial zeros of the Riemann zeta function.

comments
35 pages
fields
Number Theory, Functional Analysis
pdf ↗ page arXiv:2606.09096 ↗

For an $\aleph_0$-saturated weakly o-minimal expansion of an ordered group $\mathcal{M}$, it is shown that $\mathcal{M}^{\text{eq}}$ has uniform finiteness if and only if the collection of definable convex subgroups of $\mathcal{M}$ has uniform finiteness. If $\mathcal{M}$ expands an ordered field, then considering definable convex valuation subrings is sufficient. The results use a criterion of Johnson for uniform finiteness in $\mathcal{M}^{\text{eq}}$, [8]. In addition, it is shown that uniform finiteness in $\mathcal{M}^{\text{eq}}$ may fail for weakly o-minimal expansions of fields.

fields
Logic
pdf ↗ page arXiv:2606.12982 ↗

The class-breadth conjecture of Leedham-Green, Neumann and Wiegold states that the nilpotency class of any $p$-group is at most $b(G) + 1$, where $\displaystyle{b(G) = \max_{g\in G}\log_p[G:Z_G(g)]}$ denotes the breadth of a group $G$. While several counter-examples to this conjecture have been found for $p = 2$, it is still open in general for $p > 2$. This article is dedicated to the general case $p > 2$ of the conjecture.

fields
Group Theory
pdf ↗ page arXiv:2606.13423 ↗

Construction of physically realistic theories admitting regular black hole solutions remains an important open problem in gravitational physics. While theories with electromagnetic fields minimally coupled to gravity have been extensively studied over the past two decades, theories with nonminimal couplings remain comparatively unexplored. We investigate theories containing the interaction terms $R F_{ab}F^{ab}$, $R_{ab} F^a_{\ \, c} \, F^{bc}$ and $R_{abcd} F^{ab} F^{cd}$, which generically arise in low-energy effective Lagrangians. We prove that magnetically charged regular black holes are excluded, except possibly for a special choice of coupling constants, and argue that a similar conclusion applies to electrically charged regular black holes. We further show that similar conclusions hold for Lagrangian terms of the form $f(R,F_{ab}{\star F}^{ab})$.

comments
20 pages (ver. 3: published version; several comments and references added)
journal
J. High Energ. Phys. 2026, 145 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2606.13773 ↗

Convex-concave saddle point problems with nonlinear coupling term have wide applications in signal processing, machine learning, robust optimization, and generative models, among others. Primal-dual algorithms are widely used for convex-concave saddle point problems. However, when handling nonlinear coupling term in convex-concave saddle point problems, primal-dual algorithms usually encounter geometric mismatches between variable and mapping spaces, delayed gradient information, and strong dependence on linesearch, resulting in less stable performance and complex convergence analysis. To address these issues, we propose a new primal-dual algorithm named PDAce by combining convex combination and extrapolation strategies. More specifically, in the update of the primal variable, we construct a convex combination point to replace the current iterative point and compute the Jacobian matrix of the vector function in the nonlinear coupling term at the convex combination point. Besides, we use the latest information of convex combination points to extend extrapolation to the mapping space in the update of the dual variable. The core innovations lie in performing linearization of the vector function in the nonlinear coupling term at convex combination points and shifting extrapolation from the variable space to the nonlinear mapping space. This design completely eliminates nonlinear residual terms and allows for rigorous convergence analysis without linesearch. Under mild convex assumptions, we construct a new Lyapunov potential function to prove that PDAce is globally convergent with an ergodic convergence rate of $\mathcal{O}(1/N)$. Moreover, we develop an accelerated version of PDAce, termed aPDAce, which achieves $\mathcal{O}(1/N^2)$ rate under strong convexity of the primal function, and linear convergence when both the primal and dual functions are strongly convex.

fields
Optimization and Control
pdf ↗ page arXiv:2606.14220 ↗

We present an equivariant K-theoretic construction of affine quantum Schur algebras of type C with three parameters by taking advantage of Kato's exotic framework. This enables the derivation of an equivariant K-theoretic realization of affine iquantum groups of type AIII with three parameters. Additionally, in Appendix A, we provide an equivariant K-theoretic construction of affine quantum Schur algebras of types B/C/F/G with two parameters, following Antor's recent work on affine Hecke algebras with two parameters.

comments
40 pages
fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2606.15722 ↗

Inspired by work of Altmann and Christophersen, we study the graded pieces of the cotangent cohomology $T^i_{S_{\mathcal{K}}}$, $i\geq 3$ of the Stanley-Reisner ring $S_{\mathcal{K}}$ associated to a simplicial complex $\mathcal{K}$. We prove a localization formula allowing one to reduce to the case of negative weights. Our results give a complete description of $T^3$ and $T^4$ in terms of the topology of $\mathcal{K}$ whenever $\mathcal{K}$ is a flag complex. As an application, we give a sufficient criterion for the vanishing of $T^3$ for simplicial spheres, classify two-spheres that have vanishing $T^3$, and show that the boundary complex of the dual associahedron has vanishing $T^3$. Our results make use of the arborescent resolutions considered by Hancharuk, Laurent-Gengoux, and Strobl. We give an alternative and self-contained treatment of these resolutions that may be of independent interest.

comments
v2: minor changes
fields
Algebraic Geometry, Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2606.16829 ↗

We study observability and controllability for constant-coefficient first-order hyperbolic systems on the real line when only part of the state is observed or controlled. Even when the Kalman rank condition holds, the usual \(L^2(\mathbb R)^N\)-observability estimate may fail because some components are detected only through the dynamics. We show that the Kalman structure determines the appropriate observability estimate. A component that becomes visible after \(k\) algebraic steps is measured at low Fourier frequencies with a weight of order \(|ξ|^{2k}\) in the Fourier variable. This yields a natural Kalman-adapted observation space for the system. Assuming that the transport matrix \(A\) is diagonalizable over \(\mathbb R\), we prove whole-line observability in this space for every positive time and derive exact controllability in the corresponding dual space. If, in addition, \(A\) has no zero eigenvalue and the observation set satisfies the one-dimensional bounded-gap condition, we establish localized observability whenever the observation time exceeds the natural characteristic travel-time threshold. Separately, in the whole-line setting, we extend the construction to transport matrices \(A\) with real spectrum and possible nontrivial Jordan blocks.

fields
Optimization and Control
pdf ↗ page arXiv:2606.17814 ↗

We study the angle between the null space and the range of elementary operators of length one or two acting on $\mathcal{B}(\mathscr{X})$, the Banach algebra of all bounded linear operators on a complex Banach space $\mathscr{X}$. For the multiplication operator $μ_{A,B}(X) = AXB$, we characterize positivity of this angle in terms of the corresponding angles for $A$ and $B^*$. For elementary operators of length two $Δ_{\boldsymbol{A},\boldsymbol{B}} = μ_{A_1,B_1} - μ_{A_2,B_2}$, we establish conditions under which the angle is positive, and the ascent of $Δ_{\boldsymbol{A},\boldsymbol{B}}$ equals one. Finally, for a generalized derivation $δ_{A,B}$ and an injective holomorphic function $f$ on a neighborhood of $σ(A)\cupσ(B)$, we show that the angle between the null space and the range of $δ_{f(A),f(B)}$ is positive whenever the angle between the null space and the range of $δ_{A,B}$ is positive.

fields
Functional Analysis
pdf ↗ page arXiv:2606.18930 ↗

Miura-ori is an origami grid of parallelogram faces whose creases carry mountain or valley folds. Its flip graph joins locally flat-foldable assignments differing by a legal face flip. Local flat-foldability does not require the whole sheet to fold flat. Earlier two-row formulas and small-flip counts left a uniform rectangular counting law unresolved, while the known maximum shortest-path distance left its attaining pairs unclassified. Integer face functions with adjacent values differing by one identify legal flips with local extrema and determine shortest-path distances through their differences. For a fixed number $d\ge3$ of legal flips, the assignment count on an $m\times n$ face grid with $m,n\ge2$ is a symmetric polynomial once $m,n\ge d-1$. Its degree is $d-2$ in each variable and in total, with leading part proportional to $m^{d-2}+n^{d-2}$ except at $d=4$. Exact computation identifies formulas through ten flips. For fixed $2\le m\le d-2$ and $n\ge d-1$, a finite construction gives correction polynomials of degree at most $d-3$ in $n$. At $m=d-2$, an exact linear correction involving Baxter permutations proves the threshold sharp for $d\ge4$. Computer assistance enters the four-flip total-degree proof and a cubic correction-degree bound. A sharper uniform correction-degree bound remains open. Interior-face flips first become possible with five legal flips on grids at least $3\times3$. Classifying face-function differences that maximize their minimum total absolute deviation from a constant and reconstructing every realizing assignment pair gives all farthest pairs. Outside $2\times2$, these lie among four minimum-flip assignments with two legal flips each, with four unordered pairs when one dimension is two and the other even, and two otherwise. The counts and pair classification describe available moves and maximal separation without enumerating the full flip graph.

comments
89 pages, 5 figures. Consolidates arXiv:2606.22614 and arXiv:2607.05567
fields
Combinatorics
pdf ↗ page arXiv:2606.22614 ↗

Median bias reduction of maximum likelihood estimators can substantially improve estimation and inference. Existing generally applicable methods are, however, implicit, requiring the solution of nonlinear systems of estimating equations for a specified parameterization. Their application to parameter transformations often involves tedious algebra and bespoke implementations. We develop an explicit median bias-corrected estimator for focus parameters defined as smooth scalar transformations of the parameter. The estimator results from solving an equation derived from the Cornish-Fisher expansion of the centred and scaled maximum likelihood estimator of the focus parameter, and requires only the maximum likelihood or an asymptotically equivalent estimator of the model parameter, the gradient and Hessian of the transformation, and expectations of products of log-likelihood derivatives. These expectations are available for many models in the bias reduction literature and can also be estimated by Monte Carlo simulation. The resulting estimators are third-order median unbiased and provide one-step approximations to estimators from implicit median bias reduction when the focus is a component of the parameter. The method can improve standard asymptotic inference and enables hull-based confidence procedures to produce intervals with near nominal finite-sample coverage. We illustrate the framework with examples involving Mahalanobis distances, quantiles, focus parameters in regression, stratified, circular, and multiple-mediator models, and model selection settings using the Focused Information Criterion.

fields
Statistics Theory
pdf ↗ page arXiv:2606.28597 ↗

Financial resilience concerns whether, and how rapidly, a risky position recovers or deteriorates at a future time $t$, given the information available at time $s\leq t$. As a first step, the resilience rate was introduced as the expected instantaneous rate of change of a price or risk-assessment process. Because this quantity captures only the conditional mean of future increments, it cannot distinguish between positions with the same expected recovery but different conditional risk profiles. We obtain a richer characterization by evaluating such increments through a possibly nonlinear dynamic risk measure $ρ$. For an Itô process $π$ and a normalized, cash-additive $ρ$, we define the resilience evaluation as the $L^1$-limit of $\varepsilon^{-1}ρ_s(π_{t+\varepsilon}-π_t)$, as $\varepsilon\to 0^+$, whenever it exists. For a convex $ρ$ induced by BSDEs with Lipschitz or quadratic drivers, we prove existence and a dual representation: it is the worst-case conditional expectation, over zero-penalty measure changes, of an effective drift that combines the physical drift of $π$ with the risk adjustment assigned by $ρ$ to the volatility of $π$. We establish attainment of the optimal scenario and illustrate the scope of the construction and the role of the required assumptions through examples and counterexamples.

comments
47 pages
fields
Probability
pdf ↗ page arXiv:2606.30070 ↗

Differential equation models are widely used to describe, interpret, and predict dynamical phenomena across science and engineering. In practice, however, the governing dynamics are rarely fully known and must be inferred from observational data. Traditionally, inverse problems in differential equation modelling have focused on estimating unknown parameter values. In this setting, structural identifiability determines whether parameter values can, in principle, be uniquely recovered from ideal observations and is, therefore, a prerequisite for meaningful inference. More recently, the integration of machine learning with mechanistic modelling has enabled the discovery of unknown equations, functions, and constitutive relationships, substantially expanding the space of admissible models. This raises a fundamental question: under what conditions can unknown functional components be uniquely recovered from data? In this paper, we generalise the classical notion of structural parameter identifiability to functional identifiability. We first identify broad classes of models for which unique functional recovery is impossible. We then show how functional identifiability can be assessed for differential equation models using differential algebra-based techniques which are well-established as a means of assessing structural identifiability for ordinary differential equation models. Our framework reveals new phenomena that arise in the transition from parametric to function inference and have no analogue in the classical setting. Finally, we characterise functional identifiability in several common model classes. Taken together, our results demonstrate that functional identifiability provides a theoretical foundation for modern inverse problems in differential equation modelling, particularly those that use machine learning representations of unknown system components.

fields
Statistics Theory, Dynamical Systems
pdf ↗ page arXiv:2606.30289 ↗

We study null Cartan curves in Minkowski space-time $\E$ that are normal helices with respect to C-constant normal fields $V=λT+μN+νB_2$, whose components in the Cartan frame are constant. If $κ_3$ has no zeros, the constant vectors $W$ for which $\ip{V}{W}$ is constant correspond to common solutions of two linear differential equations, of orders four and at most two. Hence they form a space of dimension at most two, $B_2$ is never an axis field, and the normal helices with any other axis field $V$ and prescribed $κ_3$ are obtained by two quadratures, explicitly for $V=λT\pm B_2$. For null Cartan helices, $V$ admits an axis if and only if one of three explicit linear conditions on $(λ,μ,ν)$ holds; then $\ip{V}{W}=0$, and the axes are spanned by the invariant null lines and spacelike plane of the boost–rotation group generating the helix. For fields with $μν\neq0$ we obtain a Riccati criterion and determine all fields moving in a fixed plane; for fields $λT+N$ we find non-helical curves with two linearly independent axes, unlike in dimension three. Finally, we introduce a normalized Darboux frame for null curves on timelike hypersurfaces and characterize the isophotic and silhouette curves with C-constant normal.

fields
General Mathematics
pdf ↗ page arXiv:2607.01262 ↗

We consider a general bond percolation on an infinite locally finite tree, where the edge retention probabilities $p_e$ are replaced by $\min\{1,q_{|e|}p_e\}$, where $\{q_n\}_{n\ge 1}$ is a sequence of positive perturbation factors and $|e|$ denotes the distance between the edge $e$ and the root. If the original percolation model admits infinite clusters, it is of interest to investigate under which perturbations $0<q_n\le 1$ this connectivity property is preserved. Conversely, if the original percolation does not admit infinite clusters, we are led to study the stability of such a property under perturbations satisfying $q_n\ge 1$. In both cases, under minimal assumptions on the original model, we show that the percolative behaviour is stable against certain quantitative non-trivial perturbations. We also discuss an application of our results to the Erdős similarity conjecture for Cantor sets.

comments
Accepted version, to appear in Electronic Communications in Probability
fields
Probability, Mathematical Physics, Classical Analysis and ODEs, Metric Geometry
pdf ↗ page arXiv:2607.01291 ↗

We introduce $L_{\infty}$-Kuranishi spaces by associating, to each chart, $L_{\infty}[1]$-algebras defined on open neighborhoods of points in the zero locus of the Kuranishi section. We show that these objects collectively form a category into which the category of smooth manifolds naturally embeds. Some notions in \cite{FOOO1} are modified to achieve the desired categorical structures; for instance, the tangent bundle condition for chart embeddings is replaced by a quasi-isomorphism condition for the $L_{\infty}[1]$-structures.

comments
v2: 60 pages. Fixed errors in the proof of Theorem 2.30 and the statement of Theorem 3.18; updated references
fields
Symplectic Geometry, Algebraic Topology
pdf ↗ page arXiv:2607.01371 ↗

We study timestep allocation for score-based diffusion sampling, where the learned reverse-time dynamics is discretized on a finite grid. Uniform and hand-crafted schedules are standard, but their fixed, ad hoc prescriptions can be suboptimal. We propose Adaptive Reparameterized Time (ART), a continuous-time control formulation that learns a time change by treating sampling-clock speed as the control, so a uniform grid on the learned clock induces adaptive timesteps in diffusion time and a leading-order Euler error surrogate defines the allocation objective. To solve the resulting high-dimensional deterministic control problem, we introduce ART-RL, an auxiliary randomized Gaussian-policy formulation that turns schedule learning into continuous-time reinforcement learning. We prove ART-RL is equivalent to ART at optimality: the mean of the optimal Gaussian policy solves ART. We further establish policy evaluation and policy improvement characterizations and derive trajectory-based moment identities that yield implementable actor-critic updates. Experiments ranging from controlled low-dimensional settings to image generation show that ART-learned schedules, when plugged into existing samplers by changing only the timestep grid, consistently improve sample quality over strong baselines at matched budgets. The learned schedules also exhibit broad generalizability, transferring without retraining across sampling budgets, data sets, solvers, pipelines, and representation spaces.

comments
40 pages. Accepted for publication in the Journal of Machine Learning Research (JMLR). Updated to the final accepted manuscript
fields
Optimization and Control
pdf ↗ page arXiv:2607.02137 ↗

Let $Λ$ denote the von Mangoldt function; we prove that for each $r > 2$, there exist constants \[ r' < \mathbf{c}(r) < 2 < \mathbf{C}(r), \qquad \lim_{r \to \infty} \mathbf{c}(r) = 1, \ \lim_{r \to \infty} \mathbf{C}(r) = \infty \] so that the discrete variational Carleson operator along the primes \begin{align} \mathcal{V}^r \Big( \sum_{n \neq 0} f(x-n) Λ(|n|) \frac{e^{2πi λn}}{n} : λ\in \mathbb{T} \Big) \end{align} is bounded on $\ell^p$ for all $\mathbf{c}(r) < p < \mathbf{C}(r)$, while the variation is unbounded when $p \leq r'$. At the non-variational endpoint, the same argument gives the sharp maximal result: the prime Carleson operator \[ \sup_{λ\in\mathbb T} \Big|\sum_{n\neq0} f(x-n)Λ(|n|)\frac{e^{2πiλn}}{n}\Big| \] is bounded on $\ell^p(\mathbb Z)$ for the full expected range $1<p<\infty$. The proof gives a new mechanism for treating modulation-invariant singular integrals after arithmetic sparsification. It combines higher-order Fourier uniformity, a variable-coefficient multi-frequency principle in the spirit of Bourgain, and an additive-combinatorial inverse argument. A key step is a reduction to finite periodic models, where the Ramanujan structure of the major arcs is converted into a sharp estimate for structured atoms by elementary number theory.

code
github.com/anastasiosfragkosmath/Variation-Norm-Carleson-Along-the-Primes-Palomar-Submission ∎ Lean project (lakefile.toml, lean-toolchain) builds with 2 sorry warnings at 6753794, checked 2026-11-17 build details
fields
Classical Analysis and ODEs, Number Theory
pdf ↗ page arXiv:2607.05560 ↗

Primal-dual first-order methods are widely used for large-scale semidefinite programming (SDP), but their ability to compute highly accurate solutions is not explained by global convergence theory alone. We study the local convergence of the primal–dual hybrid gradient (PDHG) method for SDP. We first show that PDHG converges linearly, uniformly for all starting points near a KKT point, if and only if the KKT mapping is metrically subregular at that point. We then show that PDHG eventually converges linearly whenever the limit KKT point is strictly complementary, even with multiple solutions. The asymptotic rate admits a bound computable from the eigenvalues of the linearized PDHG map and matching the observed rates in our experiments. As a byproduct of the analysis, strict complementarity implies metric subregularity. Finally, we prove that PDHG can converge sublinearly even when started arbitrarily close to a solution, which cannot happen for linear programming. Numerical experiments support the theory and exhibit SDP instances on which PDHG struggles to reach high accuracy.

fields
Optimization and Control
pdf ↗ page arXiv:2607.08035 ↗

We algebraically construct exterior power operations on higher relative algebraic K-groups and prove their desired properties such as the expected behaviour with respect to (tensor) products and composition. This builds on Grayson's description of relative K-groups in terms of explicit generators and relations and on work by Harris, the first author and Taelman for (absolute) K-groups. Among the new features in our approach is the observation that the product axiom in the classical notion of a lambda-ring is redundant.

comments
26 pages; minor changes; to appear in Int. Math. Res. Not
fields
K-Theory and Homology, Algebraic Geometry
pdf ↗ page arXiv:2607.09538 ↗

For an edge-weighted graph $G=(V,E)$ and a stretch parameter $t\geq 1$, a $t$-spanner is a subgraph $H\subseteq G$ such that the shortest path distances in $G$ and $H$ satisfy $δ_H(u,v)\leq t\, δ_G(u,v)$ for all $u,v\in V$. In metric spanners, $V$ is a finite metric space, and $G$ is the complete graph with edge weights corresponding to the distances between the endpoints. When $G$ is the complete graph on $n$ points in the plane, $O(n)$-size $t$-spanners are possible for any $t>1$: For every $\varepsilon>0$, there is a $(1+\varepsilon)$-spanner with $O(n/\varepsilon)$ edges (i.e., the stretch can be arbitrarily close to 1). When $G=K(R,B)$ is the complete bipartite graph on $n$ bichromatic points in the plane, in general, no spanner construction can guarantee stretch $t<3$ with $o(n^2)$ edges. Bose et al.~(SICOMP 2009) constructed a $(3+\varepsilon)$-spanner with $O(n\log n)$ edges for any constant $\varepsilon>0$. Our main result is a new construction for a $(3+\varepsilon)$-spanner with $O(\sqrt{1/\varepsilon}\cdot n)$ edges. Eliminating the $O(\log n)$ factor resolves a problem left open for more than 17 years, and raises a new research problem about optimizing the dependence on $\varepsilon$. When off-metric Steiner points are allowed, no Steiner spanner construction can guarantee stretch $t<2$ with $o(n^2)$ edges, and we construct a bipartite Steiner $(2+\varepsilon)$-spanner for $K(R,B)$ with $O(\sqrt{1/\varepsilon}\cdot n)$ edges. We also study (non-Steiner) spanners for $G=K(R,B)$ on $n$ bichromatic points on the real line: In this case, we show that the MST of $K(R,B)$ is a 7-spanner, and we construct a 3-spanner with at most $2n-3$ edges.

comments
32 pages, 12 figures. A preliminary version of this paper appeared in the proceedings of the 29th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2026)
fields
Combinatorics
pdf ↗ page arXiv:2607.10062 ↗

In noisy derivative-free optimization (DFO), methods based on the matrix adaptation evolution strategy (MAES) often mistakenly identify points with spuriously good function values, undermining selection and leading to unreliable search directions. To address this, we develop a novel direction adaptation evolution strategy (DAES) that targets the algorithmic phases prone to noise propagation, combining selected-population search with complexity analysis. Fixing the transformation matrix to the identity, DAES employs a structured direction-generation mechanism consisting of symmetric sampling, joint sorting–selection of noisy values, partitioning of all sampled directions into three ranked groups, and construction of a heuristic search direction. Along this direction, a noisy derivative-free sufficient descent condition with extrapolation is applied. Using a probabilistic angle condition preserved through our proposed framework, we obtain, to the best of our knowledge, the first high-probability evaluation-complexity bounds for a noisy MAES-type method across nonconvex, convex, and strongly convex objectives, under bounded noise. Finally, experiments on 230 BARON BCP problems across eight noise levels compare DAES with five DFO solvers, notably MADFO, showing greater robustness at intermediate-to-small budgets.

comments
40 pages; 5 figures
fields
Optimization and Control
pdf ↗ page arXiv:2607.10416 ↗

This paper introduces numerical optimizations for maximizing throughput on GPU when solving large batches (10,000 to over 100,000) of sequential quadratic programming (SQP) iterations, where all problems have the same structure. The optimizations are implemented in a toolbox WarpMPC for model-predictive control (MPC) in JAX and Warp. Based on the insight that all MPC problem instances in a batch share the same sparsity in time, cost, and constraints, we propose unrolling sparse linear factorizations and solves, which dominate alternating direction method of multipliers (ADMM) solver runtime. We avoid memory access bottlenecks and wasting computations via optimized memory layout, padding-reducing segmentation of the unrolled factorization, and dependency level scheduled backsolves, additionally accelerating sensitivity computation. We achieve throughputs of 8,000 to 250,000 SQP iterations per second on nonlinear cartpole, quadrotor, and humanoid robot benchmarks, outperforming baselines by 3$\times$ to 25$\times$. We illustrate practical usefulness by synthesizing a dataset and training a neural network approximation of an MPC in under 5 minutes that stabilizes a nano quadrotor in hardware experiments.

fields
Optimization and Control
pdf ↗ page arXiv:2607.11603 ↗

We classify all polynomial representations of $K(u)=(1-13u+26u^2)^3+(6+182u^2)^3$ as a sum of two cubes over $\overline{\mathbb Q}$, without an a priori degree bound. The displayed representation is unique up to interchange and independent multiplication by cube roots of unity. On the elliptic K3 surface $y^2=x^3-432K(u)^2$, the resulting eighteen sections are exactly those of minimum positive Shioda height $4/3$. The proof combines an exact root-pairing calculation with the degree-height relation on the genus-four cover $w^3=K(u)$; it does not require the full Mordell-Weil rank. For the rational representations arising from multiples of the displayed section, we determine the reduced degrees and prove strong divisibility of their common denominators, including an exact formula for each primitive part. We also prove nontorsion at every rational parameter and explain the Pell origin of the sextic. The associated integral lattices and symplectic quotient are treated in appendices. All proofs are in characteristic zero.

comments
24 page, Substantially revised around polynomial and minimum-height classifications. Earlier Prym-simplicity, exact-rank and complete rational-function classification claims removed; dependent lattice conclusions qualified. Lattice details moved to appendices. All proofs in characteristic zero
fields
General Mathematics
pdf ↗ page arXiv:2607.11925 ↗

Snooker folklore holds that no single stroke can pocket all twenty-one object balls. We examine the claim in an explicit model: twenty-two equal disks on a rectangle with six pocket points, under constant rolling deceleration, frictionless collisions with normal restitution, and lossy specular cushions. We exhibit a configuration and a stroke, and prove in interval arithmetic that every stroke in an explicit box around it pockets all twenty-one object balls, so the set of successful strokes has positive measure. That set is a ribbon: every speed from 9.3214 to 12 m/s works, while the certified window of directions is 9.481e-43 radians wide, a number explained by a first-order analysis of twenty near-grazing collisions. A second configuration, a near-frozen cluster, has a certified window 9.4e-4 radians wide, thirty-nine orders of magnitude wider; its certificate uses Taylor models of degree six. The strokes with a given list of events form a semialgebraic set, and the endpoints of the windows are algebraic points of the circle. For the regulation opening position we state the corresponding conjecture, and show that if it holds with a regular witness then a finite certified search establishes it.

comments
27 pages, 3 figures, 3 tables. v3: the certificates of Theorems B to E are regenerated after a correction to the precision handling of the certifiers; the cluster's window is certified over an interval of speeds; several definitions and statements are made precise. Code, data and certificates: https://github.com/avnerkantor/one-shot-twenty-one-balls (doi:10.5281/zenodo.24246108)
fields
Dynamical Systems
pdf ↗ page arXiv:2607.12995 ↗

Motivated by the bifurcation formula for the Milnor number of pairs of holomorphic function germs, we introduce, via foliation theory, the Tjurina number of such pairs. We define it as the generic value of the Tjurina number of the foliation associated with the pair, with respect to a specified family of balanced divisors of separatrices. We prove that this value is well defined and that it is an analytic invariant, we derive an explicit formula for it, and we establish a bifurcation formula. As an application, we characterize semitame pairs in terms of this invariant. We also prove a version of Teissier's lemma for pairs and an upper bound for the Milnor number of a pair, and we apply these results to generic pencils of algebraic curves.

comments
26 pages
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2607.13717 ↗

We prove that, for a given $C^{r,β}$-regular Riemann metric posed on a $d$-dimensional domain, every short immersion into the Euclidean space $\mathbb{R}^{d+k}$, can be uniformly approximated by exact isometric immersions of regularity $C^{1,α}$ for any $α<α_0=\min\{\frac{r+β}{2}, \frac{1}{1+d(d+1)/k}\}$. Our theorem recovers several previously known results as special cases. The novelty thereof lies in providing a unified flexibility statement for arbitrary dimensions $d$ and codimensions $k$, while also treating the so far uncharted range $k\in (1, \frac{d(d+1)}{2}-d+1)\setminus \{d\}$, where no corresponding general result was previously available. Our threshold flexibility exponent $α_0$ agrees with that previously obtained for the closely related Monge-Ampère system. As an application, we prove a new estimate in the quantitative immersability of thin prestrained films, setting the scaling exponent of the infimum of non-Euclidean energies in presence of an arbitrary prestrain metric, and in the limit of the film's vanishing thickness, at $\frac{4α_0}{α_0+1}$.

comments
32 pages. The paper is now self-contained, whereas previously it relied on an external result concerning bounds for the normal frame which was partially erroneous, as it claimed that the constant in Corollary 2.7 was independent of the immersion. New version: we now added Example 2.8 providing an explicit construction showing that this constant cannot, in general, be independent of the immersion
fields
Analysis of PDEs
pdf ↗ page arXiv:2607.15838 ↗

Over-the-air (OTA) computation has recently gained significant attentions as an effective approach to enhance the communication efficiency of wireless federated learning (FL). By enabling simultaneous transmission and aggregation of local model updates, OTA-FL can substantially reduce both latency and bandwidth consumption. However, a key challenge lies in the imperfect aggregation of global models caused by channel state information (CSI) uncertainty, which introduces distortion to the final learning performance. To address this issue, we study the long-term mean squared error (MSE) minimization problem for OTA-FL under imperfect CSI conditions. Through convergence analysis, we establish an upper bound for the time-averaged MSE, thereby revealing the effect of aggregation errors accumulated throughout multiple communication rounds on the overall training performances. Based on this analysis, an optimization framework is developed to minimize the long-term MSE via the joint design of (i) transmit coefficients at the local devices and (ii) receive combining vectors at the parameter server (PS). Since this alternating optimization approach requires non-causal CSI, a Lyapunov-based optimization method is further introduced to handle causal CSI scenarios. By incorporating virtual queues to characterize long-term energy consumption, the proposed method effectively decouples temporal dependencies and allows transmit coefficients to be optimized based on the causal CSI of each aggregation round. Comprehensive evaluations on Fashion-MNIST, CIFAR-10 and CIFAR-100 datasets have demonstrated that the proposed algorithms can significantly reduce the degradation of test accuracy caused by imperfect CSI. Comparisons with other benchmark schemes further verify the superiority of our proposed algorithms.

fields
Information Theory
pdf ↗ page arXiv:2607.16983 ↗

We study the Liouville equation $-Δ_g u = e^u$ on a complete, connected, non-compact, boundaryless Riemannian surface $(M, g)$ with non-negative Ricci curvature. Assuming only some asymptotic lower bound on the solution, we establish classification results for both the solutions and the ambient manifold, discussing also their optimality. Our results reveal a close connection between the volume growth of the manifold and the classification of both the solutions and the underlying manifold.

comments
Comments are welcome. Final version
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2607.19838 ↗

We investigate the dispersion of a passive, neutral solute in a compliant slit, in which electroosmotic flow drives a viscoelastic electrolyte against an outlet pressure load. The electrolyte is modelled using the simplified Phan-Thien-Tanner model with an inviscid Newtonian solvent. Combining lubrication theory, Debye Huckel linearisation and a local elastic-foundation model, we determine the loaded flow and quantify solute dispersion. A central finding is that hydraulic loading fundamentally alters the thin-electric-double-layer limit of shear dispersion. It was observed that shear dispersion vanishes under free-flow conditions, but an adverse pressure gradient continues to support core shear under load, resulting in a finite dispersion plateau even without flow reversal. This plateau increases with hydraulic loading and is further enhanced by viscoelasticity at a fixed throughput fraction. For Newtonian flow, wall expansion leaves the plateau unchanged under constant-current conditions but increases it under constant-voltage conditions. At finite EDL thicknesses, opposing electroosmotic and pressure-driven shear can partially cancel, improving the plate number despite reduced throughput. The combined effects of shear dispersion, molecular diffusion and transit time produce an optimal EDL thickness at prescribed throughput. Joint optimisation shifts the optimum towards free-flow conditions and thinner EDLs for the range of parameters considered. The predicted plate numbers agree closely with Brownian-dynamics simulations for six benchmark cases. These results establish the role of hydraulic loading and wall compliance in controlling the trade-off between pressure delivery and band broadening in compliant electroosmotic pumps.

fields
Mathematical Physics
pdf ↗ page arXiv:2607.21791 ↗

We construct an explicit infinite family of minimally nonperfectly divisible graphs $G_t$, each with a bisimplicial vertex $v_t$ of degree four and a cutvertex. Thus the same family disproves Hoàng's conjectures excluding bisimplicial vertices and clique cutsets from such graphs. For every integer $t\geq1$, the graph $G_t$ has clique number three and satisfies \[ |V(G_t)|=93+30(t-1),\qquad |E(G_t)|=320+104(t-1). \] Deleting $v_t$ gives a perfectly divisible graph $H_t$ with an edge whose endpoints both lie outside the perfect part of every perfect division. This gives a negative answer to the prescribed-vertex question of Hu, Xu and Zhuang. The same graphs answer their second question affirmatively: each $H_t$ is perfectly divisible but not perfectly weight divisible. The cutvertex and weighted consequences were pointed out by Hu, Xu and Zhuang, who also observed that replacing one endpoint of the edge by two adjacent twins gives a minimally nonperfectly divisible graph with a homogeneous set.

comments
11 pages, 1 figure. New proof of Lemma 2.2 using a recolouring argument and explicit partitions. Discussion revised in light of Hu--Xu--Zhuang (arXiv:2603.01967v3). Verification code and graph data: https://doi.org/10.5281/zenodo.24211586
fields
Combinatorics
pdf ↗ page arXiv:2607.25412 ↗

Singular Value Decomposition (SVD) underlies matrix factorisation tasks across many fields, with imaging applications demanding cost-efficient processing. Yet SVD algorithms are inherently sequential, constraining GPU throughput and limiting online deployment in imaging pipelines. This study introduces a fully parallelized matrix factorization framework for GPUs by enforcing matrix orthogonality on left singular vectors via Lie-parametrised algebra and recovering the remaining components through soft constraints. This asymmetric constraint design enables an efficient parallel decomposition with an orthogonal left factor, achieves high reconstruction fidelity and substantially accelerates computation relative to the exact SVD, with high throughput exceeding standard video frame rates. Performance is evaluated on multiple imaging tasks spanning complementary computational regimes: (1) an MNIST denoising benchmark at an intermediate scale with known ground truth, (2) Mueller matrix polarimetry for neurosurgical tissue characterisation, requiring massive batch processing of small matrices, and (3) spatio-temporal background subtraction for ultrasound localisation microscopy, requiring high-dimensional matrix separation. Across regimes and instruments, the proposed framework demonstrates robust domain transfer at various matrix scales and 2.6–67$\times$ speed-ups over the exact GPU SVD, and, unlike randomised SVD, accelerates large batches of small full-rank matrices. By prioritising downstream reconstruction fidelity over exact spectral recovery, the proposed SVD framework enables GPU-friendly matrix factorisation.

fields
Numerical Analysis
pdf ↗ page arXiv:2607.25967 ↗

WOW-284 is a Graffiti conjecture asserting that every connected graph of order at least three and girth at least five has minimum dual degree at most $-λ_{\min}(D)$, where $D$ is the distance matrix and the dual degree of a vertex is the average degree of its neighbors. We refute it with exact counterexamples on $38$, $39$, $40$, $42$ and $50$ vertices and study the structure of regular counterexamples. For a connected $k$-regular graph $G$ of girth at least five and diameter three, we prove that $δ^*(G)+λ_{\min}(D)=2k-2-\max_θ(θ+1)^2$, the maximum being over the nonprincipal adjacency eigenvalues, so strict failure is a spectral window condition. The closed window $|θ+1|\le\sqrt{2k-2}$ alone, without any diameter assumption, forces $|V(G)|<(k+2)(k^2+3)/6$ when $k\ge4$, and an integral excess matrix derived from the optimal polynomial sharpens this bound for diameter-three counterexamples. Every regular strict counterexample has degree at least six and diameter at most four, and in degree six it has at most $50$ vertices. Under vertex deletion, the Hoffman-Singleton graph remains a strict counterexample after the removal of any five vertices, while an explicit six-vertex deletion destroys strictness. A degree-$57$ Moore graph, if one exists, remains a connected strict counterexample after the removal of any $56$ vertices. Every strict counterexample has at least $15$ vertices, and an exhaustive search excludes orders up to $19$. The strict induced subgraphs of the Hoffman-Singleton graph of orders $36$ to $50$ are classified up to automorphism; among them are three further irregular counterexamples of order $40$.

comments
44 pages. Exact computations and Lean 4.31 certificates
fields
Combinatorics, Spectral Theory
pdf ↗ page arXiv:2607.27452 ↗

For $q=e^{-\varepsilon}\to1^-$, we obtain an Airy expansion for Ramanujan's entire function $A_q(\sqrt q\,x)$, uniformly for $x$ in a sufficiently small fixed complex neighborhood of $1/4$. After an explicit exponential normalization, the expansion has analytic coefficients and a nonlinear Airy argument. We calculate the first corrections and bound the remainder by $\varepsilon^2$ times an Airy envelope. The estimate is valid at Airy zeros and retains exponential decay on the real interval below $1/4$. The proof uses a Gaussian integral representation and an odd analytic change of variable that reduces the phase to cubic form. The compact turning-point expansion follows as a corollary. For each fixed positive zero $ρ_n(q)$, we obtain an expansion of $\log(4ρ_n(q))$ through order $\varepsilon^2$, with remainder $O_n(\varepsilon^{8/3})$. A zero-free interval identifies the zeros by their global indices. We also calculate the $\varepsilon^{2/3}$ correction to the known Airy limit of the Stieltjes–Wigert edge kernel, with an $O(\varepsilon^{4/3})$ remainder uniformly on compact sets, including the diagonal.

comments
v2: Substantially revised; includes uniform fixed-neighborhood expansions and the Stieltjes--Wigert edge-kernel correction. 17 pages, 3 tables. Numerical code and data included as ancillary files
fields
Classical Analysis and ODEs, Complex Variables
pdf ↗ page arXiv:2607.27504 ↗

Randomly initialized first-order iterative algorithms are simple, widely used, and empirically effective across many high-dimensional inference problems, yet their theoretical behavior remains far less understood than that of algorithms started from more elaborate, problem-specific initializations such as spectral initialization. This paper takes a step toward closing this gap by studying randomly initialized approximate message passing (AMP) for noiseless phase retrieval, a canonical nonconvex inference problem. We give a non-asymptotic, growing-horizon characterization of the AMP trajectory from random initialization, and show that it achieves both the information-theoretic weak recovery threshold $δ_{\rm weak}=1/2$ and the AMP strong recovery threshold $δ_{\rm str}\approx1.13$, matching the recovery thresholds established for spectrally initialized AMP. The key technical ingredients are twofold: (i) a non-asymptotic coupling that decomposes the AMP iterates as a signal component, a linear combination of independent Gaussian vectors, and an approximation error, and (ii) a second-order analysis of the Onsager correction error built around a non-asymptotic version of Bolthausen's condition. These allow us to analyze the $O_δ(\log n)$ steps required for weak recovery, and to faithfully track the asymptotic state evolution up to $n^{1/3}/\operatorname{polylog}(n)$ steps in the intermediate recovery regime $δ\in(δ_{\rm weak},δ_{\rm str})$, both beyond the $O(1)$-iteration horizon of classical AMP theory. Above the strong recovery threshold, AMP reaches any prescribed fixed recovery accuracy within $O_{δ,\varepsilon}(\log n)$ iterations. Both the coupling and the error analysis are developed for a broad class of generalized AMP dynamics and may be of independent interest for general single-index models.

fields
Statistics Theory
pdf ↗ page arXiv:2608.01654 ↗

We construct an autonomous Lipschitz fast dynamo on the flat three-torus whose particle flow has zero topological entropy and whose ideal induction equation has no exponential growth. We perform a multiscale construction starting from the Ponomarenko flow. For every sufficiently small positive magnetic diffusivity, the induction operator on $\mathbb{T}^3$ has an eigenvalue with real part bounded below by a positive constant independent of the diffusivity. A corresponding non-zero real-valued magnetic field satisfies an exact exponential growth law in $\mathrm{L}^2$. For the same velocity field, every solution of the ideal problem grows at most linearly in $\mathrm{L}^2$. Moreover, the particle flow and its inverse have Lipschitz constants growing at most linearly in time and thus zero topological entropy. The velocity field is real-valued, divergence-free, differentiable everywhere and smooth away from one circle, but is not $\mathrm{C}^1$.

code
github.com/lukasniebel/fast_dynamo_lean ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at f2e17cd, checked 2026-11-17 build details
comments
Minor changes to the exposition; results and proofs unchanged. Lean formalisation available on https://github.com/lukasniebel/fast_dynamo_lean
fields
Analysis of PDEs, Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2608.02586 ↗

Polar codes achieve channel capacity as block length increases, but this asymptotic advantage comes at the cost of decoding speed: the conventional \ac{SC} algorithm is inherently sequential, which limits its practicality for high-throughput applications. This work addresses that limitation by introducing the \emph{\ac{Spec-SC}} framework, which incorporates speculative execution into the \ac{SC} decoding process. While \ac{sp-node}-based decoders enable partial parallelism for specific, predefined structures, \ac{Spec-SC} extends this capability by permitting parallel execution in general nodes that do not match any \acs{sp-node} pattern. A built-in verification mechanism ensures that this speculation does not compromise decoding correctness. Simulation results show that \ac{Spec-SC} achieves the same \acs{BER} and \acs{FER} performance as conventional \ac{SC} decoding, while reducing the average number of sequentially traversed nodes by up to $69\%$ for a polar code of length $N=4096$. A cycle-level analysis further shows that, for $\Pc(4096,3584)$ at $5\,\mathrm{dB}$, a heterogeneous four-core configuration achieves a $1.57\times$ decoding speedup using a total of $2944$ processing lanes, representing a $43.75\%$ increase over the $N_{\mathrm{lane}}=2048$ one-core \ac{SC} baseline. The speedup increases to $2.5\times$ at $7\,\mathrm{dB}$, demonstrating the increasing effectiveness of speculation at higher $\EbNo$. These results demonstrate that \ac{Spec-SC} enables additional algorithm-level parallelism beyond conventional \ac{sp-node}-based decoding, motivating its further investigation for high-throughput and high-reliability communication systems. achieve, paving the way for speculative hardware decoder implementations.

comments
12 pages, 10 figures, submitted to IEEE for possible publication
fields
Information Theory
pdf ↗ page arXiv:2608.02760 ↗

Environmental DNA (eDNA) has emerged as a novel tool for quantifying the seasonal abundance of aquatic species in water bodies; however, its mathematical modeling is still at a germinating stage because of its mechanistic uncertainties. We propose a first-step mathematical and computational framework for the eDNA dynamics of migratory fish based on a novel stochastic partial differential equation model with a delayed source input. The model governs spatiotemporal eDNA concentration in rivers where the source comes from a stochastic differential equation for the migration dynamics of the fish. The affine nature of the model facilitates its theoretical analysis, including the guarantee of well-posedness and the closed-form derivation of the Laplace functional despite the proportionality coefficient of the multiplicative noise term being non-Lipschitz. We also propose a discretization scheme for the model that theoretically generates nonnegative numerical solutions. We finally apply the proposed model to eDNA concentration data sampled from midstream reaches of a river system and perform sensitivity analysis.

comments
Updated on November 16, 2026
fields
Probability
pdf ↗ page arXiv:2608.03364 ↗

We consider a quantum system on the real line obeying a deformed Heisenberg algebra. This deformation was originally proposed by E.P. Wigner in 1950 when establishing the non-uniqueness of the canonical commutation relations implied by the equations of motion. An explicit coordinate representation was subsequently provided by L.M. Yang in 1951 and in essence is identical in form with Dunkl's difference-differential operator introduced in 1989 in connection with root systems of reflection groups when limited to the group $Z_2$ acting on the real line. Under certain conditions such quantum systems exhibit a supersymmetric (SUSY) structure where the reflection operator acts as the grading operator. We present a generalisation of Yang's representation by first considering only one of the two equations of motion in phase space. The corresponding non-interacting system is found to represent Witten's model of SUSY quantum mechanics. Imposing also the second equation of motion the original result of Wigner and Yang is reconsidered by extending their discussion to general symmetric potentials on the real line. As explicit example we discuss the harmonic oscillator and an attractive Coulomb-like potential $V(x) = - γ/ |x|$. We also establish a Hooke-Newton duality between this Coulomb-like system and the original Wigner-Yang harmonic oscillator system.

comments
Dedicated to Asim Orhan Barut (1926-1994) on the occasion of his $100^{\rm th}$ birthday. Talk presented at the GROUP36, Valladolid, Spain, July 13-17, 2026. 14 pages. Accepted for publication at SciPost Physics Proceedings
fields
Mathematical Physics
pdf ↗ page arXiv:2608.04503 ↗

This paper is concerned with the time-periodic solutions of the Vlasov-Poisson-Boltzmann (VPB) system with a given time-periodic external force in the whole space $\mathbb{R}^3$, where the force is allowed to be non-potential. For the purpose, we first study the Cauchy problem around global Maxwellians, proving the global existence of small-amplitude solutions in a hybrid function space that combines the low-frequency Besov framework for the forced Boltzmann equation with a corresponding control of the self-consistent electric field. One key point occurs to the nonlinear Vlasov force $-\nabla_{x}φ\cdot \nabla_{v}f + \frac{1}{2}v \cdot \nabla_{x}φf$ at low frequencies. Rather than treating it as a generic source term, we exploit the Poisson equation and macroscopic balance laws to recover the structural cancellation required for the VPB semi-group estimates, which combined with high-frequency energy estimates and weighted microscopic propagation, yields a closed global well-posedness theory. We further prove uniform stability of the difference of two small-amplitude solutions driven by the same force with respect to distinct initial data. As a consequence of those results, for the time-periodic problem where the external force is time-periodic, we are able to make use of Serrin's method to establish the existence of a unique time-periodic solution of the same period together with its large time asymptotic stability. Our result also gives the existence and stability of stationary solutions when the external force is time-independent.

comments
46 pages. Typos corrected. All comments are welcome
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2608.05637 ↗

Two-phase phase-type ($PH_2$) distributions are among the service-time models used most often in applied queueing, because they capture coefficients of variation above and below one with few parameters. This note collects, in one place and in ready-to-use form, the stationary queue-length distribution $p_n = A_1 r_1^n + A_2 r_2^n$ and the sojourn-time density $f_{W_s}(t) = c_1 e^{α_1 t} + c_2 e^{α_2 t}$ for the $M/E_2/1$, $M/Hypo_2/1$, $M/Hyper_2/1$ and $M/Coxian_2/1$ queues, with every coefficient written in the parameters that a fitting procedure returns. None of these results is new in substance; however, obtaining them from the general theory takes work that each user would otherwise have to repeat. The formulas are obtained from the Pollaczek-Khinchine transforms, related to the matrix-geometric and phase-type representations of the same queues, and verified numerically in 40-digit arithmetic. The note also gives the matrices needed to reproduce the results in standard software, a comparison with the matrix-analytic library BuTools, formulas for tail and threshold quantities and their derivatives, and a worked example calibrated to published surgical-time data.

comments
18 pages, 10 figures, 5 tables. v3: revised and restructured as a reference; title changed. Verification scripts included as ancillary files
fields
Probability
pdf ↗ page arXiv:2608.06414 ↗

We prove that the surface of second-type lines on a general cubic fourfold has fundamental group of order two. Its universal cover, constructed by Huybrechts, is obtained by considering the two ramification points of the Gauss map along each second-type line.

comments
Minor changes and improvements. To appear in Manuscripta Math
fields
Algebraic Geometry
pdf ↗ page arXiv:2608.08909 ↗

Bicycle (two-block circulant) quantum low-density parity-check (LDPC)codes include some of the best known small quantum codes, yet their design has relied on group-algebra formulations in which the dimension and distance are accessible only through matrix computation. We show that in the cyclic case the construction collapses into the polynomial ring $\F_2[x]/(x^{l}-1)$: self-orthogonality is automatic, the quantum dimension is read off from a polynomial gcd, and the minimum distance is certified exactly through the Calderbank correspondence to additive codes over $\F_4$, turning code search into an algebraically pre-filtered enumeration that reaches parameter regimes poorly covered by existing tables. A computer search based on this framework recovers the short codes $[[42,12,4]]_2$ and $[[62,12,4]]_2$ and produces a family of codes with competitive figure of merit $kd^2/n$, including $[[66,20,7]]_2$ with $kd^2/n=14.85$, above the bivariate bicycle code $[[144,12,12]]_2$ ($kd^2/n=12$) at less than half the block length, together with $[[46,2,8]]_2$, $[[66,2,9]]_2$, $[[66,4,8]]_2$, $[[66,6,8]]_2$ and, at $n=90$, $[[90,16,7]]_2$, $[[90,18,6]]_2$, $[[90,20,6]]_2$. An exhaustive census at $n=48$ delineates the boundary of this picture: we exhibit a $[[48,10,6]]_2$ code from a minimal $48$-element group (the Aydin–Tamo–Barg realization uses $72$ elements), and prove that distance $5$ forces a stabilizer-rank loss, which excludes $[[48,10,5]]_2$ from the weight-$8$ symmetric coset family. The framework thus opens a systematic route to bicycle-type quantum LDPC codes beyond the reach of group-theoretic searches, and identifies exactly where genuinely coset-theoretic phenomena begin.

comments
v3: corrected the entry for the code [[90,16,7]] in Table I and added one line to the Acknowledgment
fields
Information Theory
pdf ↗ page arXiv:2608.09115 ↗

We extend the Kim–Koberda obstruction arguments for embeddings of right-angled Artin groups (RAAGs) to a class of hierarchically hyperbolic groups (HHGs). To this end, we isolate algebraic conditions on HHGs relating domain orthogonality to the decomposition and commutation of group elements. Under these conditions, we obtain a clique-graph obstruction to RAAG embeddings into such HHGs using the \emph{expanded core graph}, which we introduce as a counterpart of both the extension graphs of RAAGs and the disjointness graphs of curves on surfaces. When the HHG structure has rank at most two, the expanded core graph itself gives a complete embedding criterion.

comments
v3: Revised version with clarified structural assumptions, expanded proofs, and improved exposition. Comments are welcome!
fields
Group Theory
pdf ↗ page arXiv:2608.09535 ↗

We develop an $\infty$-categorical framework for internal homotopy theory (truncations, homotopy groups, and Eilenberg-MacLane objects) of an accessible localization of an $\infty$-topos. For the motivic localization over a perfect field $k$, we show that a motivic space has trivial motivic $n$-truncation iff it has trivial Nisnevich $n$-truncation ($n\geq-2$), identifying internal $n$-Eilenberg-MacLane objects with strongly $\mathbb{A}^1$-invariant sheaves of groups when $n=1$ and strictly $\mathbb{A}^1$-invariant sheaves of abelian groups when $n\geq2$. We further prove that a generically free Nisnevich group sheaf is strongly $\mathbb{A}^1$-invariant iff it is birational (which for the free group sheaf $L_{nis}F_{grp}A$ holds iff $A$ is birational), whereas for an étale-weakly unramified sheaf of sets $A$, $L_{nis}F_{grp}A$ is $\mathbb{A}^1$-invariant iff $A$ is itself $\mathbb{A}^1$-invariant. Non-birational, étale-weakly unramified motivic sheaves of sets (such as $\mathbb{G}_m$) thus generate (non-abelian) $\mathbb{A}^1$-invariant group sheaves that are not strongly $\mathbb{A}^1$-invariant. Combining this obstruction with essentially smooth base change, we prove that for a qcqs scheme $S$, $\mathcal{H}^{mot}(S)$ is an $\infty$-topos iff $S=\emptyset$. We also study relative truncation and connectivity under a localization. Over a qcqs scheme $S$, this identifies external $\mathbb{A}^1$-$n$-coverings with internal motivic $n$-coverings via pullback along the localization unit, yielding a motivic $n$-Galois correspondence over $k$. For connective morphisms over $k$, we establish a higher $\mathbb{A}^1$-Van Kampen theorem and a Nisnevich-local-to-global $\mathbb{A}^1$-$n$-connectivity criterion; in particular, a $k$-scheme is $\mathbb{A}^1$-connected iff it admits a Nisnevich cover by $\mathbb{A}^1$-connected schemes whose pairwise fiber products have $k$-points.

comments
v2: 57 pages. The birational topos theorem has been moved to a separate paper ("Birational Algebraic Topology"). Several theorems have been strengthened
fields
Algebraic Geometry, Algebraic Topology, Category Theory
pdf ↗ page arXiv:2608.09592 ↗

We record several elementary relations between spectral and isoperimetric parameters of a flat torus $\mathbb{T}_Λ= \mathbb{R}^n/Λ$ and the covariance structure of a fundamental domain $K$ for the lattice $Λ\subset \mathbb{R}^n$. For every measurable fundamental domain $K$ and nonzero vector $ξ$ in the dual lattice $Λ^*$, we observe the sharp directional variance estimate \[ \left\langle \operatorname{Cov}_K ξ,ξ\right\rangle \geq \frac{1}{12}. \] This yields a lower bound on the torus spectral gap $λ_{\mathrm{SG}}(\mathbb{T}_Λ)$ (equivalently, the length of the shortest nonzero dual vector $λ_1(Λ^*)$) in terms of the maximal covariance of $K$: \[ λ_{\mathrm{SG}}(\mathbb{T}_Λ) = 4π^2 λ_1(Λ^*)^2 \geq \frac{π^2}{3\left\|\operatorname{Cov}_K\right\|_{\mathrm{op}}}. \] Analogous sharp results are obtained for the isoperimetric profile and the Cheeger constant $D_{\mathrm{Che}}(\mathbb{T}_Λ)$ using an old argument of Hadwiger. In particular, when the Voronoi cell $K_Λ$ of a lattice with $\det Λ= 1$ is isotropic, the recent resolution of the Slicing Problem by Klartag and Lehec implies that \[ D_{\mathrm{Che}}(\mathbb{T}_Λ),\quad λ_{\mathrm{SG}}(\mathbb{T}_Λ),\quad λ_1(Λ^*) \geq c > 0, \] where $c > 0$ is a universal constant independent of dimension $n$; this may be thought of as a positive resolution of the Kannan–Lovász–Simonovits conjecture for all flat tori. While there are lattices $Λ$ and corresponding Voronoi cells $K = K_Λ$ for which no dimension-independent converse inequality to the spectral-gap bound above can hold, we show that under a certain sectional tiling hypothesis, this inequality is in fact an equivalence (up to numerical constants).

comments
11 pages. Final version, to appear in GAFA Seminar Notes
fields
Spectral Theory, Functional Analysis, Number Theory
pdf ↗ page arXiv:2608.13052 ↗

We construct irreducible smooth SU(2)-monopoles on asymptotically cylindrical 3-manifolds with vanishing first and second Betti numbers, using a gluing construction. Their Higgs fields grow linearly along the end, and their Yang-Mills-Higgs energy is infinite. We also construct singular U(1)-Dirac monopoles on arbitrary asymptotically cylindrical 3-manifolds whenever a topological obstruction determined by the singularities and the charges vanishes; this is automatic if the first or second Betti number vanishes.

comments
We correct the proof in this paper
fields
Differential Geometry
pdf ↗ page arXiv:2608.17881 ↗

In this paper we consider nonlinear biharmonic equations with $p$-Laplacian ($p\ge2$) of the form $$ \left\{ \begin{array}{l} Δ^2 u - Δ_p u + V (x) u = f (x, u) \text{,} u \in H^2 (\mathbb{R}^N) \text{,} \end{array} \right. $$ where the potential $V(x)$ may be indefinite. Using local linking and Morse theory, nontrivial solutions are obtained. In case the nonlinearity $f(x,\cdot)$ is odd, we obtain a sequence of large energy solutions. In the second part of the paper, for bounded positive potential, we get multiple solutions for the case that $$f(x,u)=λg (x) | u |^{q - 2} u + | u |^{m - 2} u$$ with exponent $m$ critical or subcritical.

fields
Analysis of PDEs
pdf ↗ page arXiv:2608.18154 ↗

We study landscapes for complex-parameterized networks. Our approach is motivated with an information-theoretic manifold perspective of the parameter and via classical optimization guarantees although of complex geometric variety such as through Dolbeault asymptotics. The descent path admits a Kähler information metric under a cross-entropy via the Wirtinger Hessian on the log-likelihood potential. We descend according to a differentiated loss scaled by the inverse metric, so the descent path remains in the holomorphic tangent bundle. We emphasize information manifolds which profane theoretical guarantees via ill-curvature-conditioned, or lack thereof, landscapes. We focus on Calabi-Yau metrics specifically in a non-compact setting with a global potential, so defined geometrically rather than invoking the topological requirements of the Calabi conjecture. In non-compact settings, we can write the metric determinant with respect to a background in terms of a function, pluriharmonic or real. Using Yau's Liouville theorem, we get a small eigenvalue blow-up effect under nontrivial background interaction, geometric invariance of the endomorphism constant, and almost low rank assumptions. In an empirical setting, a Ricci-flat metric will not form, but large eigenvalues can be a local condition and hold empirically on open sets even in generalized Kähler cases due to lower bounds on the Ricci potential. Moreover, it has been discovered that negative curvature subverts the loss landscape, specifically sectional curvature, so we expand on this and draw interconnections to negative-definite Ricci curvature. Our arguments primarily exist via geometric modality, although we establish roots in deep learning theory such as through asymptotics at initialization and connections through failure modes of neural network guarantees under vanishing and negative Ricci curvature.

fields
Differential Geometry
pdf ↗ page arXiv:2608.19584 ↗

This paper explores the algebraic invariants and ergodic behavior of the finite-index inclusions forming commuting squares of $\text{II}_1$ factors. We begin by establishing how regularity, intermediate-subfactor lattices, and Weyl groups transfer across the commuting square under relative commutant and irreducibility conditions. Furthermore, we provide a complete characterization, via a novel factorization theorem, of the unitary normalizers of the upper inclusion when the lower inclusion is regular. Applying these findings to crossed-product inclusions induced by discrete groups, we introduce a relative eigenbasis property that preserves regular inclusions. Finally, we contrast this by proving that a relative weak mixing condition on the group action forces the crossed-product inclusion to be singular.

comments
16 pages, minor changes
fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2608.23125 ↗

We give a full characterization of the fixed points of Branching Brownian motion with critical and supercritical drifts under no additional assumptions besides it being locally finite almost surely. In particular, we do not assume finite intensity (Kabluchko, 2012) or the finite top particle (Chen-Garban-Shekhar, 2023) conditions. We also give a full characterization of the domain of attraction of the fixed points of BBM.

comments
36 pages
fields
Probability
pdf ↗ page arXiv:2608.23202 ↗

Large language model providers are compute constrained, and a common response to congestion is to degrade service: route queries to smaller models, cut reasoning budgets, or shorten context windows. A user who receives an unsatisfactory answer either retries, adding load while the system is busy, or abandons, possibly as churn. We model inference serving as a control problem in which service quality is the provider's decision. A two-regime fluid approximation with retries folded into the service rate gives closed-form trajectories and crossing times, so the dynamic program over quality tiers needs no simulation. We characterize a region in which a weaker tier uses less energy per task but more capacity per task, and show that in the fluid model reactive throttling to such a tier can keep the queue from draining. With heterogeneous customers the problem is a transportation problem with retry-inflated capacity coefficients; optimal routing follows a $cμ$-type index, and the dual of the capacity constraint gives the marginal cost of one more query by class and time. We illustrate the method on five instances calibrated to public benchmark data.

comments
28 pages, 12 figures. Numerical instances calibrated to public benchmark data for five LLM providers
fields
Optimization and Control
pdf ↗ page arXiv:2608.23986 ↗

In this paper, motivated by discrete-time McKean-Vlasov optimal control problems with law-delay, a class of forward-backward stochastic difference equations is investigated. The main difficulties come from the absence of Ito's formula in the discrete-time setting, as well as the fully coupled structure in which the coefficients depend on both law-delayed and law-anticipated terms. Under suitable monotonicity conditions, the existence and uniqueness of solutions are established. Furthermore, a new monotonicity condition is introduced to address the associated optimal control problem. As an application, the unique optimal control for linear quadratic systems with law-delay is derived.

fields
Probability
pdf ↗ page arXiv:2608.26424 ↗

Biological reaction networks exhibit transient changes that cannot be understood from steady states or long-term persistence alone. We extend Chemical Organization Theory to transitions between species subsets, using stoichiometry and feasible reaction fluxes to characterize structurally admissible changes without specifying kinetic parameters. The framework distinguishes algebraic admissibility from feasibility constrained by reactant availability. We relate these transitions to reaction-based ordinary differential equations and identify an asymmetry: closure-building transitions are determined by network structure, whereas subsequent reductions can depend on the realized trajectory. Transitions to terminal organizations are characterized when the relevant species sets occur along that trajectory. An HIV-immune response model illustrates how a shared closure-building phase can precede different long-term outcomes. The framework connects continuous dynamics with discrete changes in species composition and supports structural analysis of transient pathways and organization formation in systems biology, while distinguishing structural admissibility from realization under particular kinetics.

comments
17 pages, 3 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2608.27201 ↗

Let $\mathsf k$ be a field, $S=\mathsf k[x,y,z]$, and $R=S/I$ be a standard graded Artinian Gorenstein $\mathsf k$-algebra of codimension three. The $h$-vector of such an algebra is known to be symmetric and unimodal. Miró-Roig proved that if $\mathsf k$ is algebraically closed of characteristic zero and the $h$-vector of $R$ has at least three peaks, then $R$ has the weak Lefschetz property. We first observe that this statement holds over any infinite field of arbitrary characteristic, and that it follows from a theorem of Iarrobino–Kanev by an argument which is already used in special cases in the literature. We then give a second, characteristic-free proof, following the strategy of Migliore–Zanello, which is elementary and does not use the theorem of Iarrobino–Kanev, and hence does not use the Buchsbaum–Eisenbud structure theorem.

comments
Revised version, 10 pages. A short second proof of the main theorem has been added. Theorem 5.4 of the previous version is now attributed to existing work and its proof has been removed
fields
Commutative Algebra
pdf ↗ page arXiv:2608.27232 ↗

Efficiently and robustly analyzing shape data is critical across many scientific disciplines. While chirality is a fundamental property in numerous applications - most notably in molecular science - existing shape analysis metrics either fail to distinguish enantiomers, or rely on costly alignment. To address this gap, we introduce a multilinear generalization of the Gromov-Wasserstein objective, which yields an alignment-free distance between shapes, represented as probability distributions quotiented by a Lie group $G$. In particular, for $G = SO(d)$, we introduce the Chiral Gromov-Wasserstein ($\mathrm{CGW}$) distance, sensitive to chirality. We establish robustness and sample complexity properties for the multilinear Gromov-Wasserstein distances and develop efficient algorithms to compute them, reformulating the underlying optimization problem by projecting couplings onto a low-dimensional space. We derive algorithms for both local and approximate global solutions, yielding an approximation scheme, which is polynomial in the sample size and precision. We validate the framework through numerical experiments that demonstrate the effectiveness of $\mathrm{CGW}$ as a shape metric for chiral objects.

comments
60 pages, 7 figures
fields
Optimization and Control
pdf ↗ page arXiv:2608.27774 ↗

Low-altitude wireless networks (LAWNs) integrate terrestrial and aerial platforms to provide ubiquitous communication, sensing, and localization services for unmanned aerial vehicles (UAVs) and electric vertical takeoff and landing (eVTOL) aircraft. However, dynamic air-ground and air-air channels, abrupt blockages, and heterogeneous interference hinder the realization of this goal. Nevertheless, fluid antenna (FA), a cutting-edge multiple-input multiple-output (MIMO) technique, overcomes these challenges by reconfiguring antenna positions to unlock additional spatial degrees-of-freedom. In this paper, towards bringing low-altitude FA networks into reality, we study the fast and high-performance FA reconfiguration for low-altitude FA networks with multi-agent reinforcement learning (MARL). Specifically, we present an electromagnetic digital twin (EM-DT)-assisted MARL framework. To fill the sim-to-real gap, we introduce a two-stage transfer learning framework. Our case study shows that joint FA positions and beamforming optimization can enhance the system sum-rate by 118.5%, compared to the fixed position baseline. This gain comes from the dynamic millisecond timescale reconfiguration of FA arrays and the adaptive steering of beams toward aerial users with mobility.

comments
Accepted by IEEE Communications Magazine
fields
Information Theory
pdf ↗ page arXiv:2608.27909 ↗

This paper presents a macroscopic, or continuum, theory aimed at describing when, where, and why cracks nucleate and propagate in nominally elastic brittle materials under monotonic, quasi-static, but otherwise arbitrary mechanical loads. Motivated by recent insights, the proposed sharp theory posits that: \emph{cracks nucleate and propagate exclusively in regions where the strength surface of the material is exceeded, with their evolution dictated by the minimization of the sum of the potential --- the elastic energy minus the work done by the externally applied forces --- and surface energies.} While the theory applies to materials with any elasticity (linear or nonlinear) and any material symmetry (isotropic or anisotropic), attention is restricted here to the most basic case of isotropic elastic brittle materials. For demonstration purposes, the theory is confronted with a set of nine tests that span the entire range of well-settled experimental knowledge on fracture nucleation and propagation --- the so-called ``Nine Circles of Elastic Brittle Fracture'' --- on both a hard material (a silicate glass) and a soft material (a synthetic rubber).

fields
Mathematical Physics
pdf ↗ page arXiv:2608.28326 ↗

A digraph is \textbf{supereulerian} if it contains a spanning closed trail. Let $α_2(D)$ denote the maximum cardinality of a vertex set inducing no 2-cycle. In this paper, we study the supereulerianity of digraphs with arc-strong connectivity at least 2. We identify a family $\mathcal H$ of nonsupereulerian 2-arc-strong digraphs and prove that every 2-arc-strong digraph $D$ with $α_2(D)\leq 4$ is supereulerian if and only if $D\notin\mathcal H$. In particular, every digraph $D$ satisfying $α_2(D) \le 4$ and $λ(D) \ge 3$ is supereulerian.

comments
16 pages, 5 figures
fields
Combinatorics
pdf ↗ page arXiv:2608.29101 ↗

The cochromatic number $ζ(G)$ of a graph $G$ is the least number of parts in a partition of $V(G)$ into cliques and independent sets, so $ζ(G)\leχ(G)$. Erdős and Gimbel asked whether $χ(G_n)-ζ(G_n)\to\infty$ with high probability for $G_n\sim G(n,1/2)$. Heckel answered this affirmatively for about $95\%$ of all integers $n$ and conjectured that the natural order of the difference along the full sequence is $n/(\ln n)^3$. We prove that, as $n\to\infty$ through all integers, $χ(G_n)-ζ(G_n)\ge0.063\,n/(\ln n)^3$ with high probability. The failure probabilities are summable, so under any coupling of the graphs $G_n$ the bound holds almost surely for all sufficiently large $n$. The proof counts partitions of the vertex set into classes of five consecutive sizes, each class declared independent or complete. The two choices per class outweigh the entropy lost by restricting the class sizes, so the expected number of such partitions is large already at a number of classes that lies order $n/(\ln n)^3$ below the first-moment lower bound for the chromatic number, uniformly in the rounding phase. A second-moment argument, which controls all overlaps between two such partitions, including whole shared classes and large intersections of unequal classes, bounds the probability that such a partition exists from below. Vertex-exposure concentration, together with a coloring of the leftover vertices, then raises this to high probability at a cost of $o(n/(\ln n)^3)$ extra classes.

comments
53 pages, 3 figures. Companion Lean 4 formalization and reproducibility record at the cited exact software revision
fields
Combinatorics, Probability
pdf ↗ page arXiv:2608.30604 ↗

The Kneser graphs $\text{KG}(n,k)$ are a classically studied family of graphs. One known invariant of graphs is gonality (also called divisorial gonality), which is the minimum degree of a rank 1 divisor on the graph. Using known bounds on gonality of simple, connected graphs, one may obtain that the gonality of $\text{KG}(n,k)$ is bounded above by $\binom{n-1}{k}$. In 2014, Harvey and Wood showed that the treewidth (a lower bound on gonality) for $\text{KG}(n,k)$ is $\binom{n-1}{k}-1$ for $n\geq 4k^2-3k+2$. In this paper, using scramble number, another lower bound on gonality, we improve this polynomial bound and show that the gonality of $\text{KG}(n,k)$ is exactly $\binom{n-1}{k}$ for $n\geq \frac{3k^2+k+2}{2}$, and conjecture an even stricter polynomial bound using the uniform edge scramble. We then extend our argument to the family of generalized Kneser Graphs, computing the scramble number and gonality using the same polynomial bound.

comments
24 pages, 8 figures
fields
Combinatorics
pdf ↗ page arXiv:2609.00258 ↗

We introduce an operator-valued maximal $f$-divergence for completely positive (CP) maps between von Neumann algebras, associated with an operator convex function $f$ on $(0,+\infty)$. The construction takes values in the extended lower-semibounded self-adjoint part of the codomain von Neumann algebra. We prove independence of the common CP upper bound used in its computation, joint subadditivity, monotonicity under unital precomposition and normal postcomposition, a martingale convergence theorem for normal CP maps, and joint lower semicontinuity in the point-$σ$-weak topology. For normal positive functionals, our construction recovers Hiai's maximal $f$-divergence. As a consequence, we establish its joint weak lower semicontinuity for arbitrary von Neumann algebras, answering a question left open by Hiai. For $η(t)=t log t$, we obtain an operator-valued Belavkin–Staszewski (BS) relative entropy. Moreover, for normal channels with $σ$-finite codomain, we prove that the BS channel divergence of Hollands and Ranallo coincides with the extended norm of our operator-valued divergence. Finally, we give finite-dimensional examples and obtain an explicit formula for a finite-index conditional expectation. In the BS case, this formula reduces to the logarithm of the Jones–Kosaki index.

fields
Operator Algebras, Mathematical Physics, Functional Analysis
pdf ↗ page arXiv:2609.00554 ↗

In the application of incomplete Cholesky preconditioning to the incomplete Cholesky-conjugate gradient (ICCG) method, forward and backward substitutions exhibit sequential dependencies that constitute a major bottleneck for parallelization in multicore environments. To alleviate this bottleneck, the algebraic block multi-coloring (ABMC) method achieves both parallelism and data locality through block-wise coloring. However, ABMC requires the number of blocks to be specified as an input parameter in advance. This study evaluates the Leiden method as an alternative blocking approach for parallel preconditioning in the ICCG method. As a community detection technique that maximizes a quality function for graph partitioning, the Leiden method automatically generates blocks that reflect the matrix structure without requiring the number of blocks a priori. We partition the adjacency graphs of sparse matrices using the Leiden method and utilize the resulting blocks for parallel preconditioning. We implement the Leiden method using modularity and the constant Potts model as quality functions and compare its performance with that of the ABMC method in terms of the number of iterations, execution time, and L2 cache efficiency across eight symmetric positive definite matrices. The experimental results demonstrate that the Leiden method with the constant Potts model achieves performance comparable to that of the ABMC method configured with an optimized number of blocks.

comments
Revised version incorporating peer-review comments. Accepted for publication in IEEE Access
fields
Numerical Analysis
pdf ↗ page arXiv:2609.00561 ↗

We study the variation of Fourier–Mukai equivalences in proper flat families of Noetherian algebraic spaces. For bounded pseudocoherent kernels, we prove that the equivalence locus is open and commutes with arbitrary Noetherian base change. To do so, we develop a theory of relative perfectness and relative quasi-perfectness for algebraic spaces. This includes a fiberwise criteria for integral transforms with nonperfect kernels. As an application, we construct an explicit autoequivalence for elliptic fibrations.

comments
added a nonenhanced counit in Appendix C; title change; sharpened exposition/text; removed smoothness and Gorenstein invariance (to appear in a forthcoming note)
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2609.01298 ↗

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 ↗

In this paper, we develop the method of moving planes entirely in the weak formulation for the fractional $p$-Laplacian in the singular range $1<p\leq2$. We first establish a small region principle for antisymmetric functions and apply it to prove radial symmetry and monotonicity of nonnegative weak solutions of fractional $p$-Laplacian equations in a bounded domain. We also consider the nonlocal quasilinear Lane–Emden equation $(-Δ)^s_pu=u^q$ in $\mathbb R^n$. In the Sobolev critical case, we establish radial symmetry, monotonicity, and precise asymptotic behavior at infinity for finite-energy weak solutions. Under a suitable decay condition, we also obtain radial symmetry for the full range $q>p-1$. Our proofs rely on integral estimates derived directly from the weak formulation, thereby extending the moving plane approach of Chen and Li (Adv. Math. 2018: 735-758) from the pointwise $C^{1,1}_{\mathrm{loc}}$ setting to weak solutions.

comments
27 pages. Revised version
fields
Analysis of PDEs
pdf ↗ page arXiv:2609.02225 ↗

In this paper, we study the combinatorial object $\bar{b}^k_{r,s}(n)$ which counts the colored overpartition $k$-tuples wherein both even and odd parts occurs with $r$ and $s$ colors, respectively. We establish several congruences which extends the results of Chacon and Sellers for infinite families of $r,s$ and $k$. In particular, we prove divisibility properties for $\bar{b}^k_{r,s}(n)$ modulo prime $p$ and derive new congruences modulo powers of $2$. The techniques involved to obtain our results rely on theta function identities and modular forms.

fields
Number Theory
pdf ↗ page arXiv:2609.03926 ↗

Families of sequences with low mutual aperiodic crosscorrelation assist the design of systems for multi-user asynchronous communications and multiple-input multiple-output radar. The crosscorrelation demerit factor of a pair of sequences is the sum of the squared magnitudes of their crosscorrelation values at every shift when the sequences are normalized to unit Euclidean norm, and the merit factor is the reciprocal of the demerit factor. For each positive integer $\ell$, we endow the $2^{2 \ell}$ pairs of binary sequences of length $\ell$ with uniform probability measure and study the distribution of their crosscorrelation demerit factors. Sarwate showed that the mean value is always $1$ regardless of length $\ell$. We develop a method for finding an exact formula for the $p$th central moment (for any positive integer $p$) as a function of $\ell$. Formulae for the variance and third central moment ($p=2$ and $3$) are then obtained by hand calculations, while the fourth through sixth central moments are obtained by computer-assisted calculations. Our theory also shows that all the central moments must be strictly positive for $p\geq 2$ and $\ell \geq 3$.

comments
32 pages
fields
Information Theory, Combinatorics, Probability
pdf ↗ page arXiv:2609.05771 ↗

The three-dimensional parabolic-elliptic Keller-Segel equation admits infinitely many radial self-similar blow-up profiles. Earlier work established radial and nonradial stability for one explicit profile. We study the non-explicit profiles constructed by inner-outer matching and allow perturbations without any symmetry assumption. For each sufficiently large profile index, we prove that the corresponding blow-up dynamics are asymptotically stable along a Lipschitz manifold of initial data. When the blow-up center and scale are allowed to vary, the codimension of this manifold equals the number of intrinsic unstable radial modes. We derive refined inner-outer asymptotics and two-scale estimates for the profiles and analyze the nonlocal, non-self-adjoint linearized operator in each spherical harmonic sector. In the radial sector, a reduced-mass transformation leads to a local Sturm-Liouville problem and gives the exact number of negative eigenvalues. In the $l=1$ sector, we identify the translation modes and exclude any additional unstable spectrum. For every $l\ge 2$, the sharp lower bound on the real part of the spectrum is $1/4$. We then combine the spectral decomposition with modulation equations, higher-order energy estimates, and a finite-dimensional Brouwer argument to obtain the nonlinear stability result.

fields
Analysis of PDEs
pdf ↗ page arXiv:2609.06479 ↗

Let $\La$ be a finite-dimensional Koszul algebra with Koszul dual $\Ld$. Using the Koszul functors and the homological perturbation lemma, we describe the minimal projective resolution of every object of the bounded derived category of finite-dimensional graded $\La$-modules in terms of the cohomology of the corresponding complex of coperfect graded $\Ld$-modules. In particular, the linear part of the minimal graded projective resolution of a finite-dimensional graded $\La$-module is a direct sum of Koszul complexes of these cohomology modules. We deduce that $\La$ is absolutely Koszul if and only if $\Ld$ is graded left co-coherent, if and only if the category of coperfect graded $\Ld$-modules is abelian. As applications, we show that absolutely Koszul algebras of finite global linearity defect have finite graded finitistic dimension; we refine the graded and ungraded Koszul dualities and construct nonstandard $t$-structures on the bounded derived and singularity categories. Finally, we apply these results to finite-dimensional quadratic monomial algebras.

comments
25 pages. This paper continues A Non-graded Koszul Duality and Its Applications and merges two preprints. Most results date from 2018 to 2020, extending Bautista and Liu's work to quadratic monomial algebras. Recently, we used the homological perturbation lemma to extract homological information about Koszul dual algebras. All results are the author's own; no AI tools were used in the research
fields
Representation Theory
pdf ↗ page arXiv:2609.06768 ↗

We prove that labeled edge probabilities can be recovered uniformly from complete aggregated relational data (ARD) at a given community composition if and only if the sum of trait alignment and partition resolution diverges. We study a two-community logistic network with fixed known weak signal and $K$ trait groups of size $m$. If $b_k$ is the difference between the two community counts in group $k$, alignment $Λ=\|b\|_2^2/m$ measures separation in the mean counts. Resolution $ρ=K/m^2$ measures the information that accumulates across groups through joint count fluctuations. Without knowing $b$, the full count likelihood gives a mean squared error bounded by $Ce^{-c(Λ+ρ)}+O((Km)^{-2})$ under bounded-energy activity perturbations. At exact group balance and zero activity, the minimax risk is $\exp\{-Θ(ρ)\}$ as $ρ\to\infty$. Uniform recovery over all globally balanced community assignments holds exactly when $ρ\to\infty$. At zero activity, when the community assignment is uniform over all balanced assignments, the optimal mean squared error averaged over assignments and networks vanishes exactly when $K\to\infty$. The population count law identifies every edge probability, and full adjacency permits uniform recovery throughout the model.

comments
13 pages; 38-page supplement in anc/supplement.pdf. Retitled and substantially expanded. The two-group impossibility result for labeled edge probabilities is the $K=2$ case of Corollary 2.4. New: a necessary and sufficient criterion for uniform recovery at a given group composition, exponential risk bounds, and a recovery criterion for uniformly random balanced labels. Submitted to Bernoulli
fields
Statistics Theory
pdf ↗ page arXiv:2609.07077 ↗

We consider $\nabla\varphi$ height functions with even and convex interaction energy $W$ on the lattice $\mathbb{Z}^d$, which are restricted to take values in the set $\{-S, \ldots, S\}$ for some integer $S \ge 1$. We study the effect of entropic repulsion, which tends to push the spin values to the middle layer. We prove that the model has a unique Gibbs measure, with exponential decay of correlations, in the cases: (a) Dimension $d=2$ at all temperatures. (b) Dimensions $d\ge3$ at all temperatures, for a wide class of $W$ with non-increasing second derivative, including the family $W(x)=|x|^p$ for $p\in[1,2]$. (c) Dimensions $d\ge 3$ at both low and high temperatures, $T\in (0,\frac{W(1)d}{4(\ln d+\ln 8)})\cup(d W(2S),\infty]$, with the normalization $W(0)=0$. At low temperatures, our proof provides an alternative to Pirogov–Sinai methods. Conversely, we exhibit a class of even and convex interaction energies $W$ which, in high dimensions and suitable temperature regimes, have multiple Gibbs measures. Though uniqueness may fail, we show that the magnetization of every Gibbs measure lies in $(-\frac{1}{2},\frac{1}{2})$. This implies the delocalization of the model restricted to take values in $\{0,1,\ldots\}$ (i.e., conditioned to lie above a floor) for all dimensions, any even and convex $W$, and all temperatures. Our methods extend to additional setups: We prove that height functions taking values in the real interval $[-1,1]$ always have a unique Gibbs measure, a result previously proved only for the quadratic interaction. For height functions taking values in $\{-S+\frac{1}{2}, \ldots, S-\frac{1}{2}\}$, $S \ge1 $ integer, we prove that the magnetization of every Gibbs measure lies in $(-\frac12, \frac12)$. The special case $W(x)=x^2$ of our results addresses questions left open in the work of Bricmont–El Mellouki–Fröhlich (1986).

comments
59 pages. Improved the bound on the magnetization of Gibbs measures with an even number of states from 1 to 1/2 (Theorem 1.10). Added additional references. Minor errors and typos fixed throughout
fields
Mathematical Physics
pdf ↗ page arXiv:2609.07578 ↗

In this paper, we construct an explicitly one-parameter family of Riemannian metrics with positive biorthogonal curvature on $S^2\times T^2$, answering a question raised by Bettiol. The method also yields metrics of positive biorthogonal curvature on every smooth oriented $S^2$-bundle over a closed oriented surface. Since $π_1(S^2\times T^2)=\mathbb Z^2$ is not virtually free, these examples separate positive biorthogonal curvature from positive isotropic curvature at the level of fundamental groups.

fields
Differential Geometry
pdf ↗ page arXiv:2609.08119 ↗

This paper studies a time-inconsistent mixed regular-singular control problem in continuous time with non-exponential discount. We seek time-consistent equilibria in an intrapersonal game framework and propose two novel definitions of regular-singular equilibrium where both regular and singular controls are unified via control laws. The standard equilibrium definition allows simultaneous perturbations of both controls, while a mild definition restricts perturbations to one control at a time. Verification theorems providing sufficient conditions are established for both definitions. We illustrate the applicability of the theory through an effort and dividend problem. First, a mild equilibrium is constructed, yet not a standard equilibrium, highlighting the distinction between the two definitions. Moreover, we derive semi-explicit threshold-type equilibria under both a mixture of exponential discount functions and a pseudo-exponential discount function. In both cases, the convexity of the value function is rigorously established, the equilibrium conditions are verified, and the existence of the effort and dividend thresholds is proved. Numerical results reveal the impacts of exogenous parameters on the effort and dividend thresholds and the equilibrium value function, along with their economic implications.

fields
Optimization and Control
pdf ↗ page arXiv:2609.08877 ↗

In this paper, we consider the conformal boundary rigidity problem for Finsler metrics on a bounded domain. We establish stability estimates for determining the conformal factors of simple Finsler metrics in the same conformal class from their boundary distance functions. Our results provide the Finslerian version of the well-known stability estimates for Riemannian metrics.

comments
16 pages
fields
Differential Geometry, Mathematical Physics
pdf ↗ page arXiv:2609.09527 ↗

In this paper, we establish the decomposition and product theory of $Γ$-symmetric spaces, where $Γ$ is isomorphic to $\mathbb{Z}_2\times\mathbb{Z}_2$. These results lead to the local classification of semisimple Riemannian $\mathbb{Z}_2\times\mathbb{Z}_2$-symmetric spaces of nontrivial type. Furthermore, we identify notable phenomena specific to $\mathbb{Z}_2\times\mathbb{Z}_2$-symmetric spaces: the existence of distinct product structures and that of an example with the trivial infinitesimal isotropy representation.

comments
29 pages. v2: Corrected the example 3.5 and its verification. The main results remain unchanged
fields
Differential Geometry
pdf ↗ page arXiv:2609.09750 ↗

We solve the local embedding problem for Hardy spaces of Dirichlet series. For every $2<p<\infty$, the global $\mathscr{H}^p$-norm controls the $L^p$-norm of a Dirichlet polynomial on every unit interval of the line $\operatorname{Re}s=1/2$: $\sup_{θ\in\mathbb{R}}\int_θ^{θ+1}\left|P\left(\frac12+\mathrm{i}t\right)\right|^p\mathrm{d}t\le C_p\left\lVert P\right\rVert_{\mathscr{H}^p}^{p}$, where $C_p$ depends only on $p$, not on the interval or on the number and choice of primes occurring in $P$. The inequality was previously known at $p=2$ and, by taking powers, at every even exponent; it had been conjectured that these were the only positive cases above $2$. Together with the known counterexamples for $0<p<2$, our theorem shows that the embedding holds for finite $p$ exactly when $p\ge2$. The proof uses duality to control many critical-line evaluations together. A frequency decomposition isolates the contribution for which the relevant frequencies can nearly coincide. We estimate it by replacing the leading terms in the logarithms of the Euler factors with Gaussian variables, using the same variable for each prime at all evaluation points; the accumulated errors remain bounded. Comparison with a critical branching random walk and estimates for a finite-cyclic square function then give a bound independent of the number of prime variables. For $1\le p<\infty$, known equivalences also give the sharp range for the conformally invariant half-plane embedding, the reverse transfer of local Carleson-measure estimates, and boundedness of all characteristic-zero Gordon–Hedenmalm composition operators.

comments
This is an expository version and has been substantially revised with additional proof details and navigational aids. 110 pages
fields
Functional Analysis
pdf ↗ page arXiv:2609.11560 ↗

Direct evaluation of the defining product of the Cayley-Dickson algebra $A_n$ of rank $N:=2^n$ over a unital commutative ring $R$ requires a quadratic number of arithmetic operations. This paper gives a uniform bilinear algorithm for multiplication in this algebra when $2 \in R^\times$, 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, the algorithm applies to every Cayley-Dickson tower over $\mathbb{R}$ and finite fields $\mathbb{F}_q$ of odd characteristic, and the tensor rank of multiplication in $A_n$ over these fields is at most $(36n-69)2^{n-3}+10$ when $n\ge4$. To the author's knowledge, the algorithm presented in this paper is the first uniform subquadratic algorithm for multiplication in $A_n$. An implementation for the standard tower over $\mathbb{R}$, $\mathbb{C}$, and $\mathbb{F}_q$ for $q = p^k$ with $p \le 2^{31}-1$ an odd prime and $k \le 12$ is available in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface pyfastcd, available on PyPI. In single-core benchmarks against direct multiplication and the uniform Cariow-Cariowa method over $\mathbb{R}$, 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.

comments
45 pages, 7 tables. v3: Added appendix for octonion base case used in fastCD and the tensor rank bound; extended Section 5 with results for the complex numbers and finite fields; added floating-point error measurements to Section 5; updated disclosures in Section 7. Code: https://git.tanuki-cd.com/algebraity/fastCD
fields
Rings and Algebras, Numerical Analysis
pdf ↗ page arXiv:2609.11588 ↗

Every bijective gyrometric isometry between nonempty connected open subsets of simply connected generalized gyrovector spaces (GGVs) with real value-line structure extends uniquely to a global bijective isometry. The extension is a left gyrotranslation composed with an isometry preserving the identity, gyroaddition, and scalar multiplication. Gyromidpoints and point reflections give continuation of local isometry germs. Without assuming simple connectedness, a global bijective isometric extension exists exactly when the germs of the map and its inverse are fixed by their respective monodromy actions. Continuity of each fixed-scalar multiplication map implies contractibility and hence simple connectedness. We construct standard-norm GGVs for $t>0$ on positive invertible cones of nonzero unital JB-algebras and, in dimension greater than one, on their projective cones. Power maps relate their gyrometrics to Thompson's and Hilbert's metrics, respectively, with equality at $t=1$. Thus for both metrics, bijective isometries between nonempty connected open subsets extend uniquely to global bijective isometries. We give proofs of the known Thompson and Hilbert isometry classifications, together with their power-coordinate forms for every $t>0$, using the GGV Mazur–Ulam theorem and recovering the Jordan structures from infinitesimal gyrations. Applications include a new proof of Mankiewicz's theorem on connected open subsets of real normed spaces and a local extension theorem for hyperbolic balls in real inner product spaces, including incomplete and infinite-dimensional spaces. We also give constructions for products and function spaces.

fields
Functional Analysis
pdf ↗ page arXiv:2609.13620 ↗

We prove that every Igusa–Todorov Artin algebra satisfies the Auslander–Reiten conjecture. More precisely, let $V$ be an $n$-Igusa–Todorov witness, and let $t$ be the number of isomorphism classes of nonprojective indecomposable summands of $V$. If a finitely generated module $M$ satisfies $\Ext_A^i(M,A)=0$ for every $i>0$ and $\Ext_A^q(M,M)=0$ for $1\leq q\leq 2t+1$, then $M$ is projective. As applications, algebras of representation dimension at most three and algebras satisfying $J^{2m+1}=0$ for which $A/J^m$ has finite representation type satisfy the Auslander–Reiten conjecture.

comments
11pages, comments are welcome. Updated the introduction and references
fields
Representation Theory, Rings and Algebras
pdf ↗ page arXiv:2609.14453 ↗

The spherical maximal operator of order $μ$ was introduced by El Kohen in the setting of real hyperbolic spaces, where its $L^p$-boundedness properties were investigated. In this paper, we extend this operator to rank-one Riemannian symmetric spaces of noncompact type and establish sufficient conditions on $μ$ for its boundedness on $L^p$, $1<p\leq\infty$. We also obtain a necessary condition for $L^p$-boundedness when $μ$ is real and $1<p<\infty$. For $1<p\leq 2$, the necessary and sufficient conditions coincide, yielding the sharp range of real $μ$ in this regime. Finally, we establish sufficient conditions for the $L^p$-boundedness of the corresponding lacunary spherical maximal operator for $1<p\leq\infty$.

comments
Comments on the paper are welcome
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2609.15514 ↗

Let $0<s<1$ and $A$ be a constant symmetric positive definite matrix. Given the quadratic form $$ Q_A(u)=\int_{\R^N} A\nabla^s u(x)\cdot \nabla^s u(x)\,dx, $$ where $\nabla^s$ denotes the Riesz fractional gradient, we establish necessary and sufficient conditions such that $Q_A$ defines a Dirichlet form. In strike contrast with the local case $s=1$, positive definiteness of a constant matrix is not sufficient for the Markov property when $0<s<1$. We also describe the associated symmetric Markov semigroup and its $L^p$ realizations, prove the existence of a smooth nonnegative heat kernel and establish a bounded $H^\infty$ functional calculus.

comments
19 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2609.15809 ↗

We show that for any positive operator monotone function $f$ the inequality $\int_{[0,\infty)} f(t) \, \mathrm{d} \left\lVert E^{Δ_{\varphi,ψ}}(t) ξ_ψ\right\rVert^2 + f'_\infty \varphi(1-s(ψ)) \geq \frac{f(1)}{2} \Bigl( \varphi(1) + ψ(1) - \lVert \varphi - ψ\rVert \Bigr)$ holds, where $\varphi, ψ\in \mathcal{M}_{*,+}$ are two normal positive linear functionals on a von Neumann algebra $\mathcal{M}$, and $Δ_{\varphi,ψ}$ is the associated relative modular operator. Choosing $f(t) = t^s$ with $s \in [0,1]$, the Powers-Størmer-Ogata inequality is recovered.

comments
5 pages, small changes
fields
Operator Algebras, Mathematical Physics
pdf ↗ page arXiv:2609.16184 ↗

On a connected closed smooth Riemannian manifold, the algebraic structure of the Laplace eigenfunctions, as described by eigenfunction triple products, uniquely determines the geometry. We refine this correspondence by introducing the notion of an $N$-product eigenbasis, which consists of eigenfunctions whose pairwise products may be written as linear combinations of at most $N$ basis elements. We prove that a manifold admits a $2$-product eigenbasis if and only if it is a flat torus. We also prove an analogous result for Laplace eigenvectors of bounded-degree graphs.

fields
Spectral Theory, Combinatorics
pdf ↗ page arXiv:2609.16399 ↗

We study a nonlinear Fokker–Planck equation with diffusion and nonlocal interactions generated by squared simplex volumes. The associated free energy is not isplacement semiconvex when the simplex dimension $n$ is at least two. For $1\leq n<d$, the stationary states are isotropic Gaussian measures, and every solution converges to the equilibrium determined by its conserved mean. At $n=d$, the free energy fixes only the covariance determinant, allowing a noncompact continuum of anisotropic Gaussian equilibria when $d\geq2$. The limit is then selected by the initial covariance, whose eigenvectors and eigenvalue gaps are preserved by the flow. We establish global well-posedness for arbitrary initial probability measures with finite second moment, identify stationary states with the global minimizers of the free energy, and prove convergence in quadratic Wasserstein distance with explicit exponential rates. For compactly supported initial data with nonstationary covariance, the sharp rate is the smaller of the covariance relaxation rate and three times the slowest transport rate, provided that the third moments do not vanish along the directions of slowest transport. The skewness of the initial datum, rather than its covariance, may therefore dictate the long-time behavior.

fields
Analysis of PDEs
pdf ↗ page arXiv:2609.16978 ↗

We study the numerical geography and tangent geometry of very amply polarized Calabi-Yau threefolds $(X,H)$ through the positivity of the first jet bundle $J^1(H)$. Let $d=\int_X H^3$, $c=\int_Xc_2(X) H$, and $e=\int_X c_3(X)$. We obtain $e\ge-5d-c-c^2/(4d)$ by mixed intersections on $\mathbb{P}(J^1(H)^*)$, and $e\ge40d\left[(1-\frac{c}{10d})^{3/2}-1\right]$ by a volume estimate for a perturbed tautological class. In particular, the latter inequality shows $e+6c\ge0$, improving Sun's inequality $e+10c\ge0$. As consequences, we show (1) the uniform Hodge bounds $-4d-80\le h^{1,1}(X)-h^{2,1}(X)\le173d/66$, (2) the lower bound $\mathrm{deg} X^\vee\ge78$ for the dual hypersurface, and (3) the upper bound $d\le34$ in the critical case $X\subset\mathbb{P}^6$.

comments
Removed Sections 7-9 (to be published separately), corrected typos and errors, and improved exposition
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2609.17513 ↗

We study the ε-capacity regions of mixed multiple-access channels (MACs) with general mixture and cost constraints by the information spectrum method. The starting point is a general formula for the ε-capacity region of general MACs with cost constraint, together with the random-coding and converse lemmas from which it is derived. For the quasi-static fading Gaussian MAC, with random fading coefficients and noise variance, we show that the ε-capacity region is the ε-outage capacity region, which gives the latter a Shannon-theoretic operational meaning. The direct part follows from the general formula, and the converse part from the strong converse property of the Gaussian MAC, which is stronger than the ε-strong converse, applied to each component. The ε-capacity regions coincide in all four scenarios of availability of channel state information (CSI), and the results extend to K users. With CSI at both terminals, variable-rate coding enlarges the 0-capacity region to the polymatroid whose rank function is the average of those of the components. For mixed MACs with general components and a countable parameter space, CSI at the receiver alone never enlarges the ε-capacity region, and the region with CSI at the transmitters is given by an information spectrum formula; unlike the Gaussian case, the regions with and without CSI at the transmitters may differ. For uncountable parameter spaces, only the formula for the region with CSI at both terminals survives in general. Parts II and III treat finite-alphabet mixed MACs and the strong converse for the K-user Gaussian MAC, respectively.

comments
30 pages, 3 figures
fields
Information Theory
pdf ↗ page arXiv:2609.18352 ↗

We study higher-order differential equations corresponding to integrals of the Dotsenko–Fateev type and associated with four-point correlation functions with degenerate fields $Φ_{n,1}$. We determine the general structure and coefficients of the equations in terms of the integral parameters $ \{ A,B,C,g \} $. In particular, special cases of these equations in CFT are used for verification. In addition, the relationship between higher-order differential equations and hypergeometric operators is established.

fields
Mathematical Physics
pdf ↗ page arXiv:2609.18410 ↗

We prove that any embedded minimal Lagrangian torus in the complex projective plane is congruent to the Clifford torus. This settles the orientable case of Oh's classification conjecture. The proof uses a new two-point function constructed from Hermitian products of normalized horizontal lifts.

comments
13 pages
fields
Differential Geometry
pdf ↗ page arXiv:2609.18749 ↗

We study Percolation Markov Decision Processes (PMDPs), where the decision maker repeatedly moves a token through the d-dimensional integer lattice with deterministic transitions and random payoffs assigned to the edges. Payoffs are revealed before the beginning of the decision process and the decision maker aims to maximize the average accumulated payoff over a fixed horizon. First, we address general asymptotic control-theoretic questions by proving the existence of the uniform value and 0-optimal strategies. Furthermore, we examine the structural properties of optimal strategies: we establish the existence of stationary 0-optimal strategies for a class where the token moves in a fixed direction independent of the player's actions, and we provide low-dimensional examples to illustrate their complexity. Moreover, we introduce a dimensional lifting property that allows PMDPs to be approximated by lower-dimensional PMDPs, offering a representation of the approximation of critical probability thresholds in percolation theory via PMDPs.

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

Let $F$ be the unramified quadratic extension of $\mathbb{Q}_p$, and let $P_n(X)$ denote the Lubin–Tate analogues of the binomial polynomials arising in the $p$-adic Fourier theory of Schneider and Teitelbaum. For a particular choice of Lubin–Tate logarithm, we determine explicitly the norms of the functions $P_n(xΩ)$ on the Banach spaces of locally $F$-analytic functions of fixed order, where $Ω$ is a Lubin–Tate period. Our computation is based on a recent valuation formula of Ardakov and Berger for the values $P_n(Ω)$. As an application, we improve the Bannai–Kobayashi normalization of these polynomials. Each element of the resulting basis has norm one.

comments
12 pages
fields
Number Theory
pdf ↗ page arXiv:2609.20002 ↗

Let $B$ be a standard Brownian motion, $x\ge 0,\, ν<1$, and $b:[0,\infty)\to\mathbb R$ be a continuous function locally of finite variation starting from 0. We define the perturbed Brownian motion reflected at the boundary $b$ by establishing strong existence and pathwise uniqueness of a solution to the equation \[ W_t=(1-ν)x+B_t+νM_t(W)+\frac12 L_t^0(W-b), \qquad W_t\ge b(t), \] where $M_t(W):=\sup_{0\le s\le t} W_s$ and the process $L^0(W-b)$ is the semimartingale local time at 0 of the process $W-b$. We give a positive result under condition (PB) on the boundary $b$ : for every $T>0$, the upward increment $\sup_{0\le s<t\le T,\,t-s\le h}(b(t)-b(s))^+ = o(\sqrt{h})$ as $h\downarrow 0$. The proof splits into two regimes: the case $ν<1/2$ is a consequence of the Skorokhod problem in an orthant proved by [Williams 1995], while the case $ν\ge 1/2$ combines a deterministic comparison estimate and a logarithmic upper bound on the number of completed round-trips, following the strategy of [Chaumont and Doney 1999]. For $α\in(0,1/2)$, we also construct an increasing $α$-Hölder boundary for which no continuous adapted solution starting from zero exists for any $ν<1$.

comments
20 pages; minor changes
fields
Probability
pdf ↗ page arXiv:2609.20491 ↗

In a statistical factor model, principal components (or eigenvectors) of a sample covariance matrix serve as estimates of principal directions, the true drivers of co-movement of a collection of observed variables. We write the often substantial error in these estimates as a sum of two interpretable terms, which we show have almost sure asymptotic limits as the number of variables grows with sample size bounded. This scenario is commonplace in financial economics, genomics, machine learning and signal processing. Out-of-subspace error measures the distance from an estimate to the subspace spanned by population factor exposures. It can be expressed in terms of data, providing an estimable floor for asymptotic error. In-subspace error is driven by a rotation error within that subspace, which arises from the fixed sample size of the latent factor returns and cannot be estimated from data alone. We illustrate our error analysis with a three-factor simulation of the US public equity market, showing the dependence of the magnitude of the error and its components on dimension and sample size. In that simulation, out-of-subspace error dominates. Researchers who rely on principal component analysis to estimate factor models can use our results to quantify errors in model-based predictions and attributions.

comments
50 compiled pages (without table of contents), 4 figures
fields
Statistics Theory
pdf ↗ page arXiv:2609.20550 ↗

We study exact sign recovery for PCA connectivity analysis in mixture models with $K$ components, using the projection onto the first $(K-1)$ principal components. For any fixed number of components with affinely independent means, we derive the oracle signal projection explicitly. Under anisotropic sub-Gaussian noise, with a random number of observations in each component, a rowwise eigenspace bound yields a sufficient condition, governed by the weakest signal direction, for recovering all connectivity signs without requiring a bounded condition number of the nonzero signal spectrum. Under isotropic Gaussian noise, when the configuration of the component means is fixed up to scaling and orthogonal transformations, we identify an asymptotically sharp threshold for the signal strength: exact sign recovery succeeds above the threshold and fails below the threshold, with probability tending to one when the signal strength stays a fixed relative distance from the threshold. For an equally weighted regular simplex, we give an explicit sharp cutoff coefficient and show that optimizing the common entrywise threshold improves the coefficient's dependence on the number of components from linear growth to inverse proportionality.

comments
51 pages
fields
Statistics Theory
pdf ↗ page arXiv:2609.23468 ↗

We show that for closed negatively curved Riemannian manifolds whose length spectrum is exponentially separated, the length spectrum is a local isometry invariant. The main tool used in the proof is a finitary version of the Livshits theorem with an exponential tail that improves with the regularity.

comments
46 pages
fields
Dynamical Systems, Differential Geometry
pdf ↗ page arXiv:2609.23762 ↗

We prove an asymptotic formula for smoothed correlations of divisor sums with independently shifted quadratic cutoff functions. With $Y$ denoting the averaging scale, $R$ the divisor cutoff, and $g$ a fixed smooth averaging weight, the error is $O_g(Y/(\log Y)^2)$, uniformly for $Y^{1/5}\leq R\leq Y^{1/3}$ and shifts $s,u\in[0,1/2]$, including coincident shifts. The main term is an explicit bilinear form in the first and second derivatives of the cutoff functions. The proof uses a fixed zero-free half-plane for the Riemann zeta-function to evaluate the relevant Mellin integrals by successive contour shifts and residue calculations. We also obtain a mean-square estimate for differences of shifted divisor sums, which is used in Part II to control small prime factors in the study of sign changes of Kloosterman sums.

comments
13 pages; revised proof and exposition
fields
Number Theory
pdf ↗ page arXiv:2609.24248 ↗

Let $\operatorname{Kl}(1;q)$ denote the normalized Kloosterman sum modulo $q$. We prove that, for each sign, there are $\gg X/\log X$ square-free moduli $q\in(X,2X]$ with at most four prime factors for which $\operatorname{Kl}(1;q)$ has that sign. The proof combines the Selberg sieve with equidistribution and mean-square estimates for Kloosterman sums; the uniform estimate for shifted sieve weights established in Part I controls the contribution of moduli having small prime factors.

comments
27 pages
fields
Number Theory
pdf ↗ page arXiv:2609.24255 ↗

This paper presents a method for performing time-domain simulations of a sound field interacting with a wall having a locally-reacting impedance. The linearized Euler equations are solved using a high-order finite difference method. To impose the impedance condition on a wall that is not aligned with the Cartesian grid, an immersed boundary method (IBM) is employed. It relies on a ghost-point approach with a normal-stencil-based reconstruction, where the impedance is accounted for via auxiliary differential equations (ADEs), which are integrated using the same Runge-Kutta scheme as the governing equations. The method is validated against semi-analytical solutions for a pressure pulse reflecting off a flat or cylindrical wall with an impedance corresponding to a mass-spring-damper system. The cylindrical case solution is derived in the appendix. The measured convergence order is approximately 4 for a flat wall and just slighlty smaller for a curved wall. Long-term stability is verified by the diffraction of a monopole by a cylinder.

comments
19 pages, 9 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2609.24785 ↗

We study asymptotic spectral synthesis on $\mathbb Z_N^d$ using the Fourier ratio, the quotient of the counting-measure $\ell^1$ and $\ell^2$ norms of the unitary Fourier transform. For supports of cardinality $N^{α+o(1)}$, the Fourier-ratio concentration exponent satisfies $0\leqκ\leq\fracα{2}$. We prove a finite-scale synthesis estimate that uses either the Fourier ratio of a function or that of its support indicator. In particular, the indicator condition applies uniformly to arbitrary weights on the support. Uniform $\ell^p$ bounds imply decay of the largest Fourier coefficient when $2\leq p<\frac{2(d-2κ)}{α-2κ}$, with every finite $p\geq2$ allowed at maximal concentration. Random unions of cosets show that the finite critical exponent is sharp for every admissible pair in each prescribed ambient dimension, along prime-power moduli. We also determine the exact synthesis constant for sets with a transitive group of affine symmetries. For paraboloids this constant is an explicit divisor sum. The formula proves endpoint synthesis along powers of a fixed odd prime, although the endpoint fails along primes. Along products of distinct small primes, synthesis extends to a larger exponent. These families have the same Fourier-ratio exponent. Finally, we relate Fourier concentration to generalized Salem estimates, additive energy, Fourier algebra norms, and necessary conditions for extension estimates.

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

In their studies of pathologies in recursion categories, Montagna (1989) and Di Paola–Montagna (1991) introduce the algebraic systems $S'$ and $S'_T$, respectively, and claim that they are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two unary programs whose partial functions are provably equal in $T$, separately at each standard input. Composing each after a program that searches for a $T$-proof of contradiction and returns its code yields programs that are not equivalent in this sense. An alternative proof uses the productivity of the complement of the diagonal halting set. Montagna's $S'$ is the case $T=\mathrm{PA}$. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

comments
11 pages. Minor expository revisions: removed repetition and clarified invariance of domain partial identities and R-totality under pointwise provable equality. Results, existing proofs, and Lean formalization unchanged. Registered Lean formalization: https://palomar-registry.org/entry?id=PALOMAR-2026-10-01-000013&version=1
fields
Logic
pdf ↗ page arXiv:2609.25556 ↗

We implement a program of constructing a reflectionless measure on a Widom set with a nontrivial singular continuous component of Nazarov-Volberg and Yuditskii. The construction is an induction that based on two types of operations: splitting point mass and inserting bands. Each operation is realized by multiplying the Cauchy transform of the measure by some explicit multipliers. We provide necessary estimates on measures and the Green functions after each operation.

comments
One reference and Yuditskii's example were added to intro. The scales of Proposition 4.1 were adjusted. Accuracy of arguments were improved
fields
Functional Analysis, Spectral Theory
pdf ↗ page arXiv:2609.27133 ↗

We study global convergence guarantees of third-order Langevin dynamics for non-convex optimization via simulated annealing with fixed friction and decreasing noise. An explicit three-block distorted entropy transfers dissipation from the noisy auxiliary variable to the full state. Under dissipativity, regularity, and low-temperature functional-inequality assumptions, logarithmic cooling drives the objective values to the global minimum in probability at the barrier-controlled kinetic rate. For the exact-force-integral and midpoint three-stage discretizations, polynomially decreasing steps preserve this rate on the physical time scale. The cubic local endpoint estimate gives a less restrictive sufficient step-size condition than the available frozen-force kinetic result. A comparison with the one-gradient UBU integrator shows how its centered stochastic local error leads, under the same strong-coupling analysis, to a smaller sufficient iteration exponent. Numerical experiments are conducted to illustrate our theory. For a double well objective, third-order Langevin terminal-success point estimates are higher than UBU at both a common horizon and an equal gradient budget. For a high-dimensional nonconvex neural-network objective using synthetic data, independently tuned UBU and third-order Langevin schemes both outperform overdamped Langevin dynamics; the third-order Langevin point estimate is higher. For the same neural-network objective on real data, we show the same point-estimate ordering for best-basin probability and post-quench test accuracy. Numerical code and associated experiment results are publicly available at https://github.com/gagawjbytw/simulated-annealing-third-order-langevin

comments
71 pages, 4 figures
fields
Numerical Analysis, Optimization and Control, Probability
pdf ↗ page arXiv:2609.28611 ↗

We determine the Martin boundary of the Hoffman graph on unlabelled non-plane rooted trees and classify the central measures on its path space. Every boundary point is minimal, and the boundary is parametrized by deterministic recursive paintboxes up to equality of their finite sampling laws. The probabilities of sampling trees whose root has a single child determine the root branch masses and their associated boundary points, and characterize convergence on the boundary. Under any central measure, the successive tree shapes converge almost surely to a random boundary point whose law is the unique mixing measure in the extremal decomposition. For recursive Ewens trees, this limit is represented by a random paintbox with independent Poisson–Dirichlet splits at its vertices, and the mixing measure has no atoms. This applies in particular to the uniform recursive-tree law and Fulman's rooted-tree Plancherel law.

comments
35 pages, 4 figures. Revised and shortened, with a simpler proof of the boundary classification
fields
Probability, Combinatorics
pdf ↗ page arXiv:2609.30135 ↗

We classify the common invariant probabilities of two beta-transformations in two families. In the first, the bases satisfy $γ=aβ+c>1$ with $β>1$ irrational, $a,c\in\mathbb Q$ and $a+c\ne1$. In the second, they are an irrational $β>1$ and its square. In both families every common singular invariant probability is the point mass at zero; combining this with the classification of coincident Rényi–Parry measures gives all common invariant probabilities, with no entropy, ergodicity or multiplicative-independence hypothesis.

comments
v2: 8 pages; title revised. Adds a new theorem: for every irrational base, every common singular invariant measure of the base and its square is supported at zero
fields
Dynamical Systems
pdf ↗ page arXiv:2609.31156 ↗

When should a human take control from an autonomous AI agent, how much checking is worthwhile, and when should autonomy resume? These decisions become harder when incidents cluster and recent errors signal elevated risk. Exploratory analyses of AgentLogs coding-agent traces and ODCV-Bench task runs show higher held-out log likelihood for Hawkes incident-history models than matched no-history baselines, with positive gains whose conditional $90\%$ intervals exclude zero. AgentLogs evaluates continuous-time incident timing and type; ODCV evaluates failure occurrence at discrete decisions. Motivated by this predictive evidence, we formulate a continuous-time delegation problem that jointly chooses productive action, verification effort, and switching rates between human-directed, AI-assisted operation and autonomous AI operation. The model assumes that verification weakens incident propagation and balances project benefits against operating, supervision, risk, and handoff costs. Our Hawkes-PPO method summarizes observed incidents with exponential memory filters and learns these decisions from rewards. In synthetic experiments, it achieves a higher evaluated objective than either fixed regime and PPO without history filters, and approaches an approximate full-information benchmark. Further experiments show how incident excitation and supervision costs shape delegation.

fields
Optimization and Control
pdf ↗ page arXiv:2609.32083 ↗

In recent work, authors defined $\bar{b}^k_{r,s}(n)$ to be the number of overcolored partition $k$-tuples wherein both even and odd parts are colored with $r$ and $s$ colors, respectively. This function generalizes the overcubic partition $k$-tuples studied by Chacon and Sellers. The present work gives a uniform framework for studying congruences for $\bar{b}^k_{r,s}(n)$ modulo odd primes. For example, we prove that, for $n\ge 1$, \begin{align*} \bar{b}_{4,2}^4(5n)\equiv 0\pmod{5}. \end{align*}

comments
The preprint contains a wrong result and the paper's content will be completely changed from the current form and will be merged with another replaced paper. Not to be replaced in the current paper
fields
Number Theory
pdf ↗ page arXiv:2609.32614 ↗

In the planar $n$-body problem, Moeckel and Montgomery \cite{MM25} showed that there is no infinite spin for total collision solutions, when the reduced and normalized configuration converges to an isolated central configuration. Following their approach, generalizations have been obtained for partial collision solutions and parabolic solutions in the planar case, and for total collision solutions in the spatial cases by various authors, all under the same assumption that the reduced and normalized configuration converges to an isolated central configuration. Here we prove there is no infinite spin for any collision or parabolic solution in all dimensions without such an assumption.

comments
Additional typos fixed and reference updated
fields
Dynamical Systems
pdf ↗ page arXiv:2609.33250 ↗

Formalizing research-level stochastic optimization in Lean requires both an algorithm model and domain theory connecting foundational libraries to convergence proofs. Revising a model to restore provability can change the mathematical claim. We introduce ProofLoom, a fully automated LLM-agent system for Proof-Obligation-Driven Theory Construction. Given a published algorithm, target theorem, and source proof, ProofLoom autonomously constructs the Lean model and supporting theory. Open proof obligations drive the development of definitions, interfaces, lemmas, and proof plans. Signature contracts record evidence and obligations for model revisions; an independent Judge rejects unsupported assumptions and weakened conclusions. Planner expands the published argument into intermediate claims, and Audit checks whether the Lean proof follows it. Across tasks, SOptLib accumulates verified mathematics and construction experience: reusable results are extracted, generalized, and verified, while modeling decisions and failed proof routes are recorded. Later tasks retrieve these results and records and contribute new developments, forming a cycle of construction, accumulation, and reuse. On fifteen textbook and research-paper tasks, ProofLoom obtains mean human ratings of 6.3/7 and 6.4/7, compared with 4.9/7 and 5.0/7 for the strongest of six baselines. Across 33 developments, it produces 490,693 lines of algorithm-local Lean code with no sorry. The formalizations also expose 28 incorrect formulas, proof gaps, and algorithm-analysis mismatches in published sources across 22 developments, each with checked evidence.

code
github.com/Trace231/ProofLoom ∎ Lean project (formalizations/ADMM/lakefile.lean, formalizations/ADMM/lean-toolchain) builds, no sorry at f1aef20, checked 2026-11-17 build details
comments
38 pages, 4 figures. Code and supplementary materials: https://github.com/Trace231/ProofLoom
fields
Optimization and Control
pdf ↗ page arXiv:2609.34960 ↗

The dichromatic number of a digraph is the minimum number of induced acyclic sets into which its vertex set can be partitioned. The fractional dichromatic number is its fractional relaxation. Bourneuf, Charbit and Thomassé showed that the domination number of a tournament can be bounded as an (exponential) function of its fractional dichromatic number. This naturally leads to the question of finding a polynomial bound. We show that this bound is linear. To do this, we show a connection between undominated sets in elections and dominating sets in tournaments with bounded fractional dichromatic number. Within this framework, we also connect the well-known question of the existence of small Condorcet winning sets in elections to domination problems in digraphs with fractional dichromatic number less than 2. Thus, we open a new path to investigating these popular open problems in social choice from the perspective of graph theory.

fields
Combinatorics
pdf ↗ page arXiv:2609.35186 ↗

In this paper we deal with a nonlinear elliptic problem in the whole space $\mathbb{R}^N$ involving the $p$-Laplacian operator with $p>N$. Under suitable assumptions on the potential term and on the nonlinearity, we establish the existence of at least three distinct weak solutions. Our approach is variational and relies on two different three critical points theorems. The results extend to higher dimensions some recent multiplicity theorems for one-dimensional $p$-Laplacian equations on the real line, and provide explicit ranges for the parameter $λ> 0$ ensuring the existence of multiple solutions, which are nonnegative under additional sign conditions. The nontriviality of the solutions is also discussed. Finally, applications to problems whose nonlinearities have separated variables are presented.

fields
Analysis of PDEs
pdf ↗ page arXiv:2609.37274 ↗

We investigate Miller's bias conjecture for general one-parameter families of elliptic curves over $\mathbb{Q}$ with non-constant $j$-invariants. Utilizing methods developed by Michel, we view the second moment as the sum of distinct cohomological components: a main $p^2$ term, a $p^{3/2}$ term arising from the first cohomology over the projective line, and terms of order $p$ or lower corresponding to singular fibers. By assuming the generalized Sato-Tate conjecture, we employ representation and motive theory to demonstrate that the coefficient of the $p^{3/2}$ term averages to zero in the limit. We then independently analyze the lower-order contributions without assuming Sato-Tate. By applying the Chebotarev density theorem and analyzing Galois representations, we show that the contributions to the order $p$ term from additive singular fibers average to a non-positive value. Consequently, the only remaining average contribution to the $p$ term is $-B_pp$, where $B_p$ denotes the number of ``bad'' points where the discriminant vanishes. Because $B_p$ averages to a strictly positive value, the overall coefficient of the $p$ term averages to a strictly negative value in the limit, thereby establishing the bias conjecture for these families.

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

Closed-loop stability concerns all initial states, whereas an LQR cost evaluates only the directions excited by a prescribed initial-state distribution. We study how this distinction affects Euclidean policy-gradient flows. For every nonzero deficient covariance rank, we construct relatively open families of controllable data and open sets of stabilizing initial gains whose exact gradient trajectories reach the stability boundary in finite optimization time. The state Gramian can remain positive definite at every time before collision. By separating the cost contribution of a critical mode, we obtain a local collision criterion based on direction attraction and motion toward the stability boundary. Adding excitation of strength $\varepsilon$ yields matching $Θ(\sqrt\varepsilon)$ bounds on the local minimum stability margin for trajectories that would otherwise collide. For a class of single-input, corank-one systems, these bounds hold over the entire trajectory without a common compact-set assumption. Numerical examples further illustrate the dynamics and scaling laws.

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

Consider a subcritical functional $Q$ associated with a $p$-Schrödinger operator defined on a domain $Ω$ in a noncompact Riemannian manifold. Employing the supersolution construction, we obtain a family of strictly positive-critical Hardy weights for $Q$. The construction is based on the Green potential $G_f$, with a strictly positive charge $f$ such that $G_f$ vanishes at infinity. An interesting new feature of this family, depending on a parameter $0\leq \varepsilon\leq 1$, is the transition from positive-criticality to null-criticality at $\varepsilon=0$. Furthermore, we prove an analogous result on graphs.

comments
31 pages, argument for Theorem 6.10-(a) has been corrected
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.02365 ↗

We study how spectral averaging interacts with the logarithm in large-dimensional rank-one Harish-Chandra–Itzykson–Zuber (HCIZ) integrals. For independent bi-unitarily invariant matrices $A,B$ with uniformly bounded deterministic singular values and weakly convergent empirical spectral measures of their Gram matrices, the integral for $(BA)^*(BA)\otimes\mathbf{1}_N$ has two limiting descriptions at speed $N^2$ for small real parameters: averaging its logarithm gives free multiplicative convolution, whereas taking the logarithm after averaging gives classical multiplicative convolution. We also prove an exact finite-dimensional equality between this annealed integral and the one for $(A^*A)\otimes(B^*B)$. For any fixed $k\ge3$ factors under the hypotheses stated for $A,B$, the annealed limits at speed $N^k$ generally differ for small positive parameters, and we characterize the equality cases. For tensor products with any fixed number $k$ of factors, global Haar vectors at speed $N^k$ and product-state vectors at speed $N$ yield classical and free multiplicative convolution, respectively, for small real parameters under the corresponding hypotheses. We also derive the known multiplicativity of the $S$-transform.

comments
26 pages
fields
Probability, Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2610.02892 ↗

We study the focusing inhomogeneous nonlinear Schrödinger equation with an inverse-square potential, in the mass-supercritical and energy-subcritical regime and in every dimension $N\ge3$. Two lines of research on this model have so far developed separately, namely the scattering theory below the ground state and the variational theory of solutions with prescribed mass. We connect them. We compute explicitly the minimax level $m_a(c)$ of the energy on the Pohozaev manifold of mass $c$ in terms of the sharp constant of the associated Gagliardo–Nirenberg inequality. We prove that the minimizers of $m_a(c)$ are exactly the optimizers of this inequality lying on the Pohozaev manifold, and that they are ground states of the stationary problem. This answers a question left open in the literature. We then show that $m_a(c)$ is a sharp dynamical threshold. Below it, the sign of the Pohozaev functional is preserved by the flow. If this sign is positive, the solution is global. If it is negative and the datum has finite variance, the solution blows up in finite time. For the three-dimensional cubic model, the global solutions also scatter, by a known scattering criterion read in its scale-invariant form. As consequences, we obtain the strong instability of all normalized ground states, with destabilizing data on the same mass sphere, the strict monotonicity of the threshold with respect to the coupling constant, and a positive lower bound for $m_a(c)$ which is uniform up to the critical Hardy coupling.

comments
The presentation has been further enhanced and improved
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.02933 ↗

We study a constrained basis-selection problem for an ordered block matrix $B=[ B_1\mid\cdots\mid B_n ].$ The successive tail matrices determine a nested family of column spaces, and we consider bases of representatives which are compatible with this induced flag. Our main linear-algebraic result shows that, among bases of representatives, compatibility with the entire flag is characterized by the intrinsic block quotas $r_k=w_k-w_{k+1}$, where $w_k$ is the rank of the $k$-th tail matrix. We then show that the same structure arises naturally in finite-horizon linear control. For the reachability matrix $[A^{N-1}G\mid \cdots\mid G]$, requiring every actuator to be used exactly once turns an actuator schedule into a representative system. Preservation of the complete reachability profile is then equivalent to compatibility with the tail-space flag. This correspondence leads to an exact depth-first search with a future-rank pruning criterion. For an explicit structured family and a fixed search ordering, the baseline search visits $3\cdot2^m+m-2$ nodes before the first solution, whereas future-rank pruning reduces this number to $3m+1$. Exact-arithmetic experiments reproduce these formulas for all tested instances.

comments
18 pages
fields
Optimization and Control
pdf ↗ page arXiv:2610.03353 ↗

We present a method for the data-driven inference of Hamiltonian and Lie-Poisson dynamical systems from vector-field samples, in which the Hamiltonian and the underlying Poisson tensor are estimated jointly rather than assuming the structure is known. The Hamiltonian is represented as a linear combination of random feature maps with fixed random internal weights, so its estimation is a linear regression problem for any given Poisson structure. We treat three cases of increasing generality: a known Poisson tensor, an unknown constant invertible (symplectic) structure matrix, and Lie-Poisson and affine Poisson structures, with structure matrix linear in the state. In the constant case, the Hamiltonian and structure matrix are recovered jointly from an eigenvalue problem that avoids the trivial zero solution due to the scaling symmetry of Hamiltonian systems. For Lie-Poisson and affine Poisson systems we alternate between an initial Hamiltonian estimate from a generalized eigenvalue problem for an approximate first integral, and a constrained nonlinear least-squares fit of the structure constants that enforces the Jacobi identity and, for affine structures, the cocycle condition, via continuation in a penalty parameter. Orthogonal matching pursuit selects a compact, well-conditioned subset of random features. Because the learned Hamiltonian is a sum of single-feature terms, the model admits an explicit Poisson/symplectic splitting integrator, which we use to validate the learned systems via long-time Poincare sections. We demonstrate the approach on the four- and five-dimensional Lorenz-86 model and a six-dimensional Kirchhoff rigid-body system, recovering Hamiltonians, structure constants and Casimir invariants to high accuracy, and showing the inferred Poincare sections converge to the correct invariant-tori topology as the number of random features increases.

fields
Numerical Analysis, Dynamical Systems, Symplectic Geometry
pdf ↗ page arXiv:2610.04350 ↗

We give affirmative answers to two questions posed by Bourin and Lee concerning positive block matrices and numerical ranges. We prove that the elliptical width of a fixed off-diagonal block \(X\) is exactly the best correction term in their norm inequality. As a consequence, the corresponding inequality without a correction term holds for every positive completion of \(X\) if and only if \(X\) is essentially Hermitian, proving their Conjecture 3.3. We also show that the radius term in their eigenvalue inequality for normal off-diagonal blocks is best possible at every prescribed eigenvalue level.

fields
Functional Analysis
pdf ↗ page arXiv:2610.04377 ↗

We obtain presentations of Borel subgroups of certain Chevalley groups and Kac-Moody groups of simply laced type. More precisely, we show that Borel subgroups of simply laced Chevalley groups over a commutative, unital ring (satisfying a minor technical condition), are the amalgamated product of their rank 2 subgroups, generalising a result of Tits over fields (different from $\mathbb{F}_2$). We moreover show that Borel subgroups of Kac-Moody groups over local Bézout domains also have a presentation as an amalgamated product of their rank 2 subgroups as soon as this holds for their rank 3 subgroups. In particular we deduce that Borel subgroups of simply laced Kac-Moody groups over a local Bézout domain (with residue field different from $\mathbb{F}_2$) have such a presentation if and only if they are of 3-spherical type.

comments
Minor improvements; 25 pages
fields
Group Theory
pdf ↗ page arXiv:2610.05224 ↗

This paper proves propagation of energy moments for the three-dimensional plasma–charge model, namely, the repulsive Vlasov–Poisson system with a moving point charge. For every $K>2$, an initially finite $K$th energy moment remains finite on every bounded time interval, without requiring any initial moment of order greater than $K$, a smallness condition on the plasma mass, or positive initial separation from the point charge. The constructed global weak solution conserves total energy for almost every time. The proof relies on a critical space–time density estimate and a direct control of the electric field along the moving charge.

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

I present a short approach to discretizing continuous unitary evolution in finite dimensions. For a time-dependent Hamiltonian $H(s)$ with $s\in[0,1]$ and an integer $T\ge1$, let $U(T)$ be the evolution of $H(t/T)$ over time $T$, and let $W_T=e^{-iH((T-1)/T)}\cdots e^{-iH(0)}$ be the product of the unitaries generated by its samples. With a half-step phase at each end, $V(T)=e^{-iH(1)/2}W_Te^{iH(0)/2}$ is the evolution generated by $H(\lfloor t+1/2\rfloor/T)$, where $\lfloor t+1/2\rfloor$ is a rounded clock, time at finite precision. Whereas Duhamel's formula only bounds $\|V(T)-U(T)\|$ by a constant, I show that $\|V(T)-U(T)\|=O(1/T)$ in operator norm, with explicit constants, whenever $H'$ is Lipschitz and every sample has eigenvalue differences at most a fixed width below $2π$. The gain comes from cancellation within and between time steps. This general transfer theorem assumes neither adiabaticity nor a spectral gap, and any operator-norm bound for $U(T)$ transfers to $V(T)$ with an added $O(1/T)$. Nonetheless, discrete adiabatic theorems for $W_T$ follow from continuous ones, because the end phases commute with the spectral projectors of $H(0)$ and $H(1)$. For a product of samples of a $C^2$ unitary family, a continuously moving arc of fixed length $\vartheta$ that avoids the spectrum determines a Hermitian logarithm meeting the width condition, and the $O(1/T)$ bound has coefficients $O(\vartheta^{-3})$. In the easier direction, Duhamel's formula shows that rounding the clock to midpoints and truncating the entries of a regulated time-dependent Hamiltonian at a fixed binary place gives a product within $T$ times the error of the rounded, truncated Hamiltonian.

code
github.com/mjarret/products-of-unitaries-lean ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at e466af3, checked 2026-11-17 build details
comments
35 pages. v2: retitled and substantially revised, with simplified theorems and proofs; the QLSP application is removed. Corrects errors in v1 (one proof step, several remarks); no numbered result of v1 was false. Main claims are checked in Lean 4: github.com/mjarret/products-of-unitaries-lean
fields
Mathematical Physics
pdf ↗ page arXiv:2610.06541 ↗

Descriptive set theorists often refer to elements of the Baire space, $\mathcal{N} = {}^ωω$, as ``reals.'' In this expository article, we present mathematical justification for this practice and highlight the advantages of working with $\mathcal{N}$ over $\mathbb{R}$ in the context of descriptive set theory.

comments
19 pages
fields
Logic, General Topology
pdf ↗ page arXiv:2610.06802 ↗

In recent years, there has been a growing interest in comparing the reliability of systems with dependent components. Most of the recent works consider Archimedean copulas to define the dependency structure of systems and examine specific familiy of distributions. In this work, we provide distribution-free results to compare, in the usual stochastic order under some majorization conditions, coherent systems with heterogeneous and dependent components where the dependency structure can be defined by any copula. Applications of our main results for specific copulas and different families of marginal distributions are also given.

comments
36 pages, 10 figures
journal
Quality Technology & Quantitative Management 18 (2021), no. 6, 740-770
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2610.06869 ↗

We obtain topological obstructions to the existence of a complete Riemannian metric with uniformly positive scalar curvature on the interiors of certain 4-manifolds using Seiberg–Witten theory. In particular, no punctured blowups of a homotopy K3 manifold admit complete metrics of uniformly positive scalar curvature. Further, let $X$ be a compact oriented smooth manifold of dimension $n$. We show that if $n=6,7$ and $\operatorname{Int}X$ admits a complete metric of uniformly positive scalar curvature, then $X$ admits a positive scalar curvature metric which is a product near the boundary. In dimension 5, an analogous result holds under additional hypotheses and after possibly changing the smooth structure on $X$. If $n=5,6,7$ and $\operatorname{Int}X$ admits a complete metric of positive scalar curvature, then $X$ admits a positive scalar curvature metric with minimal boundary. One ingredient is a new PSC deformation result.

comments
28 pages, 3 figures. Add new results about complete PSC metrics. As a result the abstract is updated and Section 2 is added
fields
Differential Geometry
pdf ↗ page arXiv:2610.07608 ↗

We consider the interaction of a viscous incompressible fluid with a flexible elastic shell occupying the boundary of the fluid's domain in two space dimensions. The shell is modelled by a visco-elastic linearised beam equation. It is an open problem in fluid-structure interaction, if a self-intersection of the structure can be excluded in the long run. We show that by adding a physically well-motived and sufficiently strong transport noise in the structure equation, the self-intersection does not occur before any given end-time with any prescribed probability smaller than 1.

comments
We are using now a truly infinite dimensional noise which is not energy-conservative. This fixes a flaw from the previous version
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2610.09811 ↗

We construct chiral extensions of the cotangent Yangian using vertex algebroids. At zero level, the construction yields a vertex algebra with a compatible coproduct, whose Zhu reduction recovers the cotangent Yangian of Abedin and Niu. We also construct vertex algebra extensions at non-zero levels and study level-additive coproducts. The zero-level vertex algebra admits two natural quasi-conformal structures. We compute the corresponding sphere one-point conformal blocks and equip each block space with an associative product induced by the coproduct. For the first quasi-conformal structure, the blocks space can be identified with the dual of a certain Lie algebroid homology; for the second, we describe the block algebra and its classical limit in terms of mini-twistor geometry.

comments
63 pages. Comments are welcome! v2 add twisted families of quasi-conformal structures
fields
Quantum Algebra, Mathematical Physics
pdf ↗ page arXiv:2610.10202 ↗

Fluid antenna systems (FASs) offer significant spatial flexibility, yet securing them against eavesdropping is critical for practical FAS deployment in military, satellite, and internet-of-things networks. Although large language model (LLM)-assisted genetic algorithms (LLM-GAs) can address this secure FAS port selection problem, whether further algorithmic improvement is possible warrants deeper investigation. To this end, we propose a memetic algorithm based on reflective evolution (ReEvo). Unlike the state-of-the-art LLM-GAs, which design only crossover or mutation operators with an LLM, our algorithm leverages an LLM to evolve dedicated crossover, mutation, and local-search operators offline. These operators are then embedded into a memetic search framework, thereby obviating any online LLM queries during execution. Simulation results at equal generation counts demonstrate that our proposed algorithm achieves a higher secure sum-rate than the conventional GA and the state-of-the-art LLM-GAs.

comments
Accepted by WCSP 2026
fields
Information Theory
pdf ↗ page arXiv:2610.10235 ↗

We determine the hundredths digit of the real Grothendieck constant by proving $1.773 \leq K_G \leq 1.7799$. Furthermore, numerical heuristics suggest the estimate $K_G \approx 1.779$. We start by simplifying the Gaussian duality theory of $K_G$, based on Hermite projection games and Krivine rounding schemes. The bounds are obtained by a heuristic primal/dual search for these objects, followed by rigorous {\em certification} of their values. The search and certification are performed using AI tools, and in particular the rigorous certificates are very large (analytical reductions to thousands of numerical inequalities).

fields
Functional Analysis
pdf ↗ page arXiv:2610.10477 ↗

Understanding why deep neural networks make a given prediction is of great importance for their safe deployment. In computer vision, saliency maps, which highlight the image region most influential for a prediction, remain a widely-used form of explanation. An empirical observation is the apparent sparsity of gradient saliency maps of adversarially-trained neural networks. In this paper, we propose a theoretical explanation of this phenomenon for two-layer ReLU networks. We build on the established equivalence of adversarial training to the minimization of the empirical risk with weight-decay penalization and an added adversarial total variation term -- valid for certain loss functions. As the number of data points and neurons grows and the regularization parameters are sent to zero at appropriate rates, we prove that minimizers converge to a Bayes classifier with minimal gradient and Barron norm. Sparsity appears since for adversarial training with $\ell_\infty$-attacks the gradient norm is anisotropic and favors axis-aligned / sparse gradients. We illustrate our theoretical findings experimentally by evaluating the gradient $\ell_1$-norm and thresholded sparsity of naturally versus adversarially trained models.

fields
Optimization and Control
pdf ↗ page arXiv:2610.10666 ↗

We establish a nonasymptotic Gaussian approximation bound over centered Euclidean balls for sums of independent mean zero random vectors in $\mathbb R^p$ that need not be identically distributed. Let $S_n$ denote the sum, $Σ=\operatorname{Var}(S_n)\ne0$, and let $G\sim N(0,Σ)$. Define the effective rank and the normalized squared spectral mass by \[ r(Σ)=\frac{\operatorname{tr}Σ}{\|Σ\|}, \qquad v(Σ)=\frac{\operatorname{tr}(Σ^2)}{\|Σ\|^2}. \] Under a uniform directional fourth-moment condition, covariance-balance assumptions, and the spectral conditions $r(Σ)\le C_Σv(Σ)$ and $v(Σ)\ge6$, we prove \[ \sup_{z\ge0} \left| \mathbb P\{\|S_n\|^2\le z\} - \mathbb P\{\|G\|^2\le z\} \right| \le C\,\frac{r(Σ)}{n}. \] The constant depends only on the parameters in the assumptions and is independent of the ambient dimension and individual small eigenvalues of the covariance matrix. The approximation error thus tends to zero when $r(Σ)=o(n)$, even if $p$ grows faster than $n$. We also provide an example showing that the order $r(Σ)/n$ is sharp in general. The same estimate extends to random elements of a separable Hilbert space with trace class covariance. The proof combines Esseen smoothing, truncation, covariance partitioning, moment matching, frame/lattice estimates, a second-order endpoint expansion and comparison estimates expressed in terms of the covariance matrices.

comments
56 pages; We improved the dependence on the effective dimension to optimal
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2610.12722 ↗

The precorrected-FFT has been used to rapidly evaluate $N$-body sums arising in electromagnetics and acoustics settings. It has, however, been historically limited to kernels that satisfy a Green's identity. In this work, we demonstrate that, using an improved version of the method of proxy points, the precorrected-FFT can be used to efficiently compute $N$-body sums with a wide variety of kernels. This algorithm requires no analytic information beyond pointwise access to the kernel. Our examples include kernels from non-local PDEs, Matern kernels, anisotropic kernels, and the Green's functions of high order PDEs. We also provide a detailed algorithm for choosing the proxy points and spreading grid, as implemented in the new pcfft package. We show these algorithmic choices result in favorable scaling when compared to other kernel-independent fast summation methods. Finally, we use the algorithm to accelerate a wide variety of integral equations solvers involving non-standard kernels, with applications in surface scattering, geophysics, and microbial community formation.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.12821 ↗

Recent results [arXiv:2602.04378, arXiv:2602.22608] establish lower bounds for optimization over strongly convex sets, covering specified Frank-Wolfe updates and unrestricted deterministic first-order linear minimization oracle (LMO) methods, respectively. Neither establishes a lower bound for unrestricted randomized methods. We close this gap by proving an $Ω(L\operatorname{diam}(S)^2/T^2)$ distributional lower bound after $T$ oracle calls for randomized first-order LMO methods over strongly convex sets, with final outputs required to be feasible on every instance and seed. While our construction reuses the family of [arXiv:2602.22608], our proof characterizes the conditional distribution of the hidden permutation after adaptive queries and bounds the expected decrease of a combinatorial statistic controlling optimizer variance. We also show that the same error threshold holds with probability at least $3/4$ and yields a stopping-time tail bound. Our construction uses the same curvature-diameter coupling as [arXiv:2602.22608]. Comparisons with the upper bound [arXiv:1406.1305] must account for this coupling. Separately, we show that prescribed slow exact-line-search Frank-Wolfe trajectories can locally amplify sufficiently small initialization errors, corresponding to roughly one extra bit of initialization accuracy per iteration, and that initializations satisfying a particular eventual slow envelope have planar measure zero.

fields
Optimization and Control
pdf ↗ page arXiv:2610.13590 ↗

We develop and analyze symmetric two-level preconditioners for the method of reflections for Laplace and Stokes problems in three-dimensional perforated domains. Both models admit quadratic constrained minimization formulations, with the Stokes velocity restricted to divergence-free functions. We combine parallel reflection corrections with a coarse correction based on constant boundary modes to obtain symmetric positive definite preconditioners for the conjugate gradient method. Under a geometric separation condition, we prove condition number bounds independent of the number and sizes of the holes and the diameter of the ambient domain, with explicit dependence on the separation parameter. The coarse problem has one unknown per hole for Laplace problems and three for Stokes problems. We also derive convergence estimates for the one-level methods.

comments
23 pages, 2 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.14447 ↗

We compute cohomology spaces of the ortosymplectic Lie superalgebra $\mathfrak{osp}(1|2)$ on the (1,1)-dimensional real superspace with coefficients in the superspace $\frak{D}_{λ,μ}$ of $n$-ary differential operators acting on weighted densities ($λ\in\mathbb{R}^n$ and $μ\in\mathbb{R}$). Furthermore, we provide explicit expressions for cocycles generating these spaces.

fields
Differential Geometry
pdf ↗ page arXiv:2610.14820 ↗

We extend the packing results of Etayo, Hedenmalm, and Ortega-Cerda for complex tori to arbitrary compact Riemann surfaces. The construction uses two different approaches, one based on complex geometry of line bundles, and the other on spetral designs. Both approaches give the same basic existence of close-to-optimal point configurations on the given surface. This version was written with some assistance from ChatGPT.

comments
45 pages
fields
Complex Variables
pdf ↗ page arXiv:2610.14990 ↗

We study the exponential Green energies associated with a finite point configuration on a Riemann surface. We focus on studying optimal or close-to-optimal configurations, and show that they must be well-spread out on the surface. We study in particular the round sphere and obtain values for the minimal Green energy of a configuration. The first version of this paper was written with some assistance from ChatGPT.

comments
39 pages
fields
Complex Variables, Differential Geometry
pdf ↗ page arXiv:2610.15004 ↗

We derive a quantitative central limit theorem under sublinear expectations from a spatial endpoint regularity estimate for the one-dimensional \(G\)-heat equation. For bounded Lipschitz initial data, the second spatial derivative and the time derivative of its solution are Lipschitz in space and \(1/2\)-Hölder in time away from the initial time. In particular, \([u_{xx}(t,\cdot)]_{\mathrm{Lip}}\le C_G\Lip(φ)/t\). Combining this estimate with the nonlinear Stein identity established by Song \cite{Song2020} and a replacement argument yields a bound of order \((1+\log n)/\sqrt n\) for bounded Lipschitz tests when the third absolute moment is finite and the lower variance is positive. The final replacement step is estimated directly, avoiding the nonintegrable singularity at time zero.

comments
In this version, we improve the estimate in Lemma 2.1 and the convergence rate for Peng's CLT, and provide an alternative reflection coupling proof of Lemma 2.1
fields
Probability
pdf ↗ page arXiv:2610.15419 ↗

We study equilibration of a fixed subsystem coupled to an initially maximally mixed bath. We show that the worst-input mean-square error, maximised over observation windows of length $T$, is bounded from above and below by the mean square of a complete local autocorrelation on $[0,T]$. The constants depend only on the subsystem dimension, and no assumption on degeneracies of energies or energy gaps is required. Subtracting the stationary part of the correlation gives equilibration to the temporal state; retaining it gives thermalisation to the maximally mixed state. We then obtain explicit bounds for two static Hamiltonian families. A periodic spin-clock model thermalises on $O(n\log n)$ windows at fixed accuracy despite an exponentially small positive energy. A randomly dressed commuting model, with interaction range $O(\log N)$, has expected error $O(N^{-b}+T^{-1})$ while retaining an extensive family of conserved observables. We explain how the locally weighted spectrum determines these bounds.

comments
comments welcome; 13 pages main plus supplementary, 2 figures, v2: substantially rewritten version with new results, v3: updated version with clearer presentation
fields
Mathematical Physics
pdf ↗ page arXiv:2610.16351 ↗

For p, q >= 3 with gcd(p,q) = 1 we show that the symmetry group of the Turk's head knot Th(p,q), the closure of the braid (sigma_1 sigma_2^{-1} sigma_3 sigma_4^{-1} ... sigma_{p-1}^{+-1})^q, is the dihedral group of order 4q. This proves Conjecture R of Di Prisa and Şavk for q >= 3; the case p = 3 is due to Sakuma and Weeks. The argument is diagrammatic: by the flyping theorem of Menasco and Thistlethwaite and Borel's theorem, the symmetries of the hyperbolic knot Th(p,q) are the symmetries of its standard diagram once that diagram has no non-trivial flypes (we write out a proof for the diagrams at hand), and the standard diagram of Th(p,q) has no non-trivial flypes in the sense made precise in the paper (a closely related statement is due to Shimizu, Gill and Joshi) and exactly 4q symmetries. The chirality of Th(p,q) for even p, which also follows from a theorem of Murasugi, is visible in the group. We compare the argument with the geometric one of Sakuma and Weeks for p = 3.

comments
19 pages; v3: a false general sentence in the abstract and in the Method part is corrected (now stated for Th(p,q)); prior work by Shimizu-Gill-Joshi, Owad, Boyle and Saurabh is cited; Lemma 3.2 gives an explicit polytope realisation; Section 5 separates pair and exterior. All changes: README of https://doi.org/10.5281/zenodo.23234787
fields
Geometric Topology
pdf ↗ page arXiv:2610.16600 ↗

We prove that, on any compact Riemann surface, there are only finitely many meromorphic projective connections with prescribed singular points and real exponent differences whose projective monodromy is unitarizable. We also establish properness and growth estimates for holonomy, including a relative version for smooth marked families, and derive finiteness results for spherical conical metrics and ramification divisors of stable extensions.

comments
v2: 39 pages
fields
Classical Analysis and ODEs, Complex Variables, Differential Geometry
pdf ↗ page arXiv:2610.17116 ↗

We study the recovery of a three-dimensional volume in single-particle cryo-electron microscopy (cryo-EM) from noisy tomographic projections acquired at unknown viewing rotations, drawn independently and uniformly from $\mathrm{SO}(3)$. We show that, in a spherical-shell representation satisfying an explicit shell-separation condition, the first three moments generically determine the underlying real volume up to its intrinsic global $\mathrm{O}(3)$ ambiguity. The proof is constructive and yields a frequency-marching procedure that successively recovers the volume. Consequently, consistent recovery in the high-noise regime has sample complexity $n=ω(σ^6)$, where $n$ is the number of observations and $σ^2$ is the noise variance. Numerical experiments validate the constructive recovery scheme under finite sampling and additive noise, and indicate that direct third-moment optimization can succeed beyond the structural assumptions required by the constructive proof.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.17892 ↗

We continue the study of beautiful pairs of henselian valued fields, initiated in joint work of the second author with Cubides Kovacsics and Ye. As our main result, we show that separably closed non-trivially valued fields of arbitrary imperfection degree admit beautiful pairs associated to natural subclasses of all bounded definable types, most notably for all definable types orthogonal to the value group and for all bounded definable types. These beautiful pairs are elementary pairs satisfying certain natural axioms. They satisfy beauty transfer, i.e., saturated models of their theory are again beautiful. This yields strict pro-definability of the space of the definable types from any of these classes, in the theory SCVF of separably closed non-trivially valued fields. We also show a separable analog of a classical result of Keisler's, namely that the first order theory of an infinite separable extension $L/K$ of fields -- considered in the pairs language and where the large field $L$ is separably closed, is determined by the theory of the small field $K$ together with the imperfection degree of $L$.

comments
The proof of 6.2 contains a flaw. It is only correct under an extra assumption, and our main results for beautiful pairs of SCVF only hold for bounded definable types. Another mistake affects several results in sections 5-8, which take a different form. This version is still the original one. We are currently rewriting the paper, but prefer to make these issues known already now
fields
Logic
pdf ↗ page arXiv:2610.18753 ↗

We study reversible Higgs bundles on a compact Riemann surface $Σ$ of genus $g\geq 2$, that is, $G$-Higgs bundles $(E,Φ)$ with $(E,Φ)\cong(E,-Φ)$. Using the non-abelian Hodge correspondence, we show that the moduli space of reversible Higgs bundles carries the structure of a real affine algebraic set. We then describe reversibility through spectral data: in even rank, for a smooth spectral curve, reversible Higgs bundles correspond to line bundles invariant under the involution $η\mapsto-η$; in odd rank, under natural genericity assumptions for which the spectral curve is nodal, we give a gluing criterion together with an explicit polystability condition. Finally, for $SL(2n,\mathbb{C})$ we construct a relative Fourier–Mukai transform over the regular locus of the Hitchin base and prove that it maps the structure sheaf of the reversible locus to an object whose support is exactly the regular degree-zero $PSp(2n,\mathbb{C})$-locus in the Langlands dual $PGL(2n,\mathbb{C})$-moduli space. This support is of type $(B,B,B)$.

comments
Part of introduction revised, relation with earlier work explained
fields
Algebraic Geometry, Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2610.19037 ↗

For ordered sets $X$ and $Y$, let $Y^X$ denote the ordered set of order-preserving maps from $X$ to $Y$, ordered pointwise. In 1984, D. Duffus asked whether $A^A\cong B^B$ forces $A\cong B$ when $A$ and $B$ are finite ordered sets. We prove that it does. The proof combines direct decompositions with an auxiliary ordering of connected ordered sets and a careful choice of intervals of maximum height. We then extend the reconstruction result to several forms of repeated exponentiation.

comments
17 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.20817 ↗

We establish Brezis–Nirenberg-type existence results for elliptic systems with symmetric linear coupling, a radial critical nonlinearity and a subcritical potential. For any dimension $N\ge3$, the potential may change sign, with its negative part bounded by a subquadratic power for some exponent $q_1\in(1,2)$ and no smallness restriction on the coefficient. Under coercivity and suitable near-zero and subcritical growth assumptions, we obtain a nontrivial weak solution if the largest eigenvalue of the coupling matrix is positive when $N\ge4$, or exceeds a positive constant depending on the domain when $N=3$. No homogeneity, convexity or monotonicity along rays is required of the perturbation potential, and either sign of the linear coupling is allowed. The proof combines a variational criterion below the critical Sobolev energy level with estimates showing that the negative part of the potential contributes less than the linear energy decrease. On star-shaped domains, we also obtain a Pohozaev nonexistence criterion.

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

We study the stochastic first-order oracle (SFO) complexity of finding $ε$-stationary points of $(L_0,L_1)$-smooth nonconvex functions. Under bounded-variance noise, existing analyses of normalized and clipped stochastic gradient descent (SGD) establish optimal dependence on $ε$ and $L_0$, but the jointly optimal dependence on $L_0$, $L_1$, and $ε$ remains unclear. We resolve this question for an unbiased SFO whose gradient noise has a $p$th central moment bounded by $σ^p$ for some $σ\geq 0$, where $p\in(1,2]$.Specifically, we establish an SFO lower bound of $Ω\big(\big(σ^{\frac{p}{p-1}}ε^{-\frac{p}{p-1}}+1\big) (L_0 Δε^{-2}+L_1Δε^{-1})\big)$, where $Δ>0$ is the initial optimality gap.This bound identifies an unavoidable contribution proportional to $L_1ε^{-1}Δ$. We also prove that mini-batch (smoothed) normalized SGD can attain a matching upper bound, thereby establishing the optimal SFO complexity.

comments
Strengthened the SFO lower bound under a less restrictive accuracy condition. Added an impossibility result for finite-sum optimization under individual $(L_0,L_1)$-smoothness. Revised proofs and improved presentation
fields
Optimization and Control
pdf ↗ page arXiv:2610.21692 ↗

In this paper, we study the ground states of attractive Bose-Einstein condensates in a bounded domain $Ω\subset \mathbb R^2$ under the ring-shaped trapping potential $$ V(x)=(|x|-1)^2. $$ Letting $Γ=\{x\in\mathbb R^2:|x|=1\}$ be the ring of global minima of $V(x)$, we focus on a unified geometric setting $Γ\cap Ω\not=\emptyset$, which allows $Γ\subset Ω$ or $Γ\cap\partialΩ\neq\emptyset$. In this setting, we determine the precise location of mass concentration for ground states as the interaction strength approaches the critical value. More precisely, we prove that the mass concentrates at a point $x_0\inΓ\cap Ω$ that has maximal distance from $\partialΩ$. Our method relies on exponential upper and lower bounds on the difference between the minimal energies in the bounded domain and whole space. The essential lower bound follows from a uniform quadratic-growth estimate near the ground state manifold of the whole space problem, which is established by combining the nondegeneracy of the optimizer for the Gagliardo-Nirenberg inequality with a Lyapunov-Schmidt reduction.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.21994 ↗

A colouring of the vertices of a graph is conflict-free with respect to closed neighbourhoods if every closed neighbourhood contains a colour that appears on exactly one of its vertices. The colouring need not be proper. Every planar graph has such a colouring with four colours. Fabrici, Lužar, Rindošová and Soták [Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods, \emph{Discrete Appl.\ Math.}\ \textbf{324} (2023) 80–92] conjectured that three colours always suffice. We disprove this conjecture. We give a simple gadget construction that turns every planar graph of chromatic number four into a planar graph with no conflict-free colouring with three colours. This also shows that it is NP-complete to decide whether three colours suffice for a planar graph. We also give a critical planar graph on $25$ vertices and $51$ edges that needs four colours, with a proof that can be checked by hand. Finally, we give an infinite family of plane triangulations that need four colours, and an infinite family of critical examples.

comments
16 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.22559 ↗

This paper discusses the algebra of symmetric tensors for ruled surfaces defined by rank 2 stable vector bundles on curves of genus 2. The algebra is computed for special bundles $E$ when $S^2 E$ is destabilized by a line bundle and when $S^3 E$ is destabilized by a bundle of rank 2. A strategy for computation is discussed in regards to the other special bundles $E$. This paper also discusses the generalization of these strategies to higher genus and gives a computation when $E$ is not stable and may be written as a direct sum of line bundles.

comments
32 pages, 3 figures, preprint
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.22573 ↗

Let $X$ be a Riemann surface, $K_X \rightarrow X$ the canonical bundle, and $T_X\coloneqq K_X^{-1}\rightarrow X$ the dual bundle of the canonical bundle. For each integer $r \geq 2$, each $q \in H^0(K_X^r)$, and each choice of the square root $K_X^{1/2}$ of the canonical bundle, we canonically obtain a Higgs bundle $(\K_r,Φ(q))\rightarrow X$, which is called a cyclic Higgs bundle. A diagonal solution $h = (h_1, \dots, h_r)$ to the Hitchin equation on a cyclic Higgs bundle yields $r-1$ Hermitian metrics $H_1, \dots, H_{r-1}$ on $T_X\rightarrow X$, defined as $H_j \coloneqq h_j^{-1} \otimes h_{j+1}$ for each $j=1,\dots, r-1$, while $h_1$, $h_r$, and $q$ yield a Hermitian metric $H_r$ on $T_X \rightarrow X$ which is degenerate at the zero set of $q$. A diagonal solution is said to be complete if the Kähler metrics induced by $H_1,\dots, H_{r-1}$ are all complete. Li–Mochizuki established a theorem stating that, for any Riemann surface $X$ and any $q$ that is non-zero unless $X$ is hyperbolic, there exists a unique complete solution $h$ to the Hitchin equation for the cyclic Higgs bundle $(\K_r,Φ(q))$ with $\det(h)=1$. The holomorphic section $q$ induces a subharmonic weight function $φ_q=\frac{1}{r}\log|q|^2$ on $K_X\rightarrow X$, and the Hitchin equation depends on $q$ only through this weight function. In previous work, the author introduced a variant of the Hitchin equation associated with an arbitrary subharmonic weight function $\varphi$. In this paper, we extend the Li–Mochizuki theorem to complete solutions of the extended Hitchin equation associated to any subharmonic weight function $\varphi$ that is not identically $-\infty$ unless $X$ is hyperbolic.

comments
v2:This version combines arXiv:2508.12848 and arXiv:2610.23441v1, with the addition of an appendix. The title has been changed to reflect the merger. 59 pages
fields
Differential Geometry, Analysis of PDEs, Complex Variables
pdf ↗ page arXiv:2610.23441 ↗

We consider the theory of commutative exact algebras in braided finite tensor categories to superalgebras, motivated by extensions of vertex operator (super)algebras. For a braided category $\C$ let $\B=\C^{\gr}$ be the category of $\mathbb Z/2$-graded objects with the Koszul-signed braiding. Its even-morphism part is the underlying category of the supercategory of Creutzig-Kanade-McRae. A supercommutative superalgebra $A=A_0\oplus A_1$ in $\C$ is the same as a commutative algebra $\bA$ in $\B$, and super-local modules are the local $\bA$-modules. Hence, rigidity, pivotality and ribbon statements are instances of the ordinary theorems of Shimizu-Yadav, with the ribbon condition $θ_{A_0}=\id$, $θ_{A_1}=\varepsilon\,\id$, where $\varepsilon=\pm1$ is fixed by the statistics of the odd part. For $\C$ non-degenerate and $\bA$ haploid and exact we prove that the category of super-local modules is a braided finite tensor category whose Müger center is $\mathsf{sVect}$. It is the centralizer of a fermion in a non-degenerate category obtained by condensing in $\C\boxtimes(\text{toric code})$. If $\C$ is ribbon and $\bA$ is symmetric Frobenius it is ribbon. We give a self-contained treatment of graded simple current algebras and of the free fermion (Ising) example. We compare our formulation with Creutzig-Kanade-McRae and Creutzig-McRae-Shimizu-Yadav.

fields
Functional Analysis
pdf ↗ page arXiv:2610.24568 ↗

We prove local rigidity near every fixed noncircular ellipse from integrable rational caustics in an arbitrary nonempty open interval $I\subset(0,1/2)$ of rotation numbers. For each fixed $r>11/2$ and bound on the $H^r$ norm of the elliptic graph displacement, every sufficiently $C^1$-small positively curved perturbation admitting such caustics at all rational rotation numbers in $I$ is an ellipse. It suffices to assume these caustics at a suitably chosen family of rotation numbers in $I$ with any prescribed rational point of $I$ as its unique accumulation point. The key linear result classifies real $L^2$ displacements with phase-independent orbit sums at every rational rotation number in $I$ as infinitesimal ellipse deformations.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.24848 ↗

Foraging recruitment is modeled as a contagion: an agent finding a resource triggers a linear-threshold cascade on the group's communication network. Because activation is degree-normalized, crowding shuts the cascade off, causing the swarm to aggregate on a resource and then disperse to explore again. Acting on the cascade moves agents in space, rewiring the network; recruitment and exploration are thus one coupled process, and removing this coupling alone abolishes self-limitation. Recruitment spreads only within a connectivity window bounded below by percolation onset and above by degree-blocking. The swarm self-organizes to the near-critical edge of this window–self-organized quasi-criticality–hovering near but below the critical point without settling onto a size-invariant critical state, with a finite-correlation-time activity spectrum (Lorentzian-like, not 1/f) consistent with local criticality. Recruitment raises harvest up to 2.7x over solitary search on sparse, clustered fields and loses (down to 0.37x) on abundant or uniform ones; because resources generically aggregate, the favourable regime is the common one. The Levy search and resource field are both least-committal: a maximum-caliber walk coupled to a maximum-entropy point process whose generic sign is clustered, with the optimal search exponent tracking the field's fractal dimension. Heavy-tailed Levy exploration crosses sparse voids while recruitment cascades exploit clusters by switching agents to short local steps, binding exploration and recruitment into a single self-organizing cycle.

comments
15 pages, 19 figures (7 main + 12 SI), 1 tables, Code and data: https://github.com/galenwilkerson/collective-foraging-cascades
fields
Mathematical Physics
pdf ↗ page arXiv:2610.24865 ↗

Let $X$ be a smooth projective Calabi-Yau variety of dimension $3$, with Picard number one. Let $n$ be the self-intersection of the ample generator of the Néron-Severi group of $X$. Let $\mathsf{GV}_{g,d}$ be the Gopakumar-Vafa invariant of $X$ of genus $g$ and degree $d$. It is conjectured that {\it if $g>\frac{d^{2}}{2n}+\frac{d}{2}+1$, then $\mathsf{GV}_{g,d}=0$}. In this paper, we prove the implication when $d\gg n$ and $X\subset \mathbb P^r$ is a complete intersection in projective space. The vanishing follows by proving that if $C$ is a closed subscheme of $X$ of dimension $1$, arithmetic genus $p_a(C)$, and degree $d\gg n$, then $p_a(C) \leq \frac{d^2}{2n}+\frac{d}{2}+1$. Actually, we prove a somewhat more general result. In particular, we prove that $C$ is an extremal curve if and only if $C$ is the complete intersection on $X$ with a hyperplane $H$ and a hypersurface $F$, namely $C=X\cap H\cap F$. When $X\subset\mathbb P^r$ is not necessarily a complete intersection, assuming that the Picard group of $X$ is generated by the hyperplane section class, we obtain the coarse bound $p_a(C)\leq \frac{d^2}{2n}+\frac{d}{2}+\left(\frac{11}{24}n+4\right)$ for $d\gg n$.

comments
v3: We have added a new result, namely Corollary 1.6. Consequently, we have added a few lines at the end of the abstract and at the end of the introduction, included a new section, i.e. Section 6, and updated the bibliography
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.25065 ↗

Shifted quantum affine symmetric pair algebras were recently introduced as a trigonometric analogue of shifted twisted Yangians, whose truncations are expected to quantize fixed point loci in generalized affine Grassmannian slices. They are defined via a loop presentation with infinitely many generators and relations. In this paper, we consider anti-dominantly shifted quantum affine symmetric pair algebras of simply-laced split type. Our main result is a construction of a finite presentation à la Levendorskii. We apply it in type $\mathsf{A}$ to construct an embedding of a shifted quantum symmetric pair algebra into the corresponding shifted quantum affine algebra, yielding a graded coideal structure.

fields
Representation Theory, Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2610.25597 ↗

We prove the Manin constant conjecture for every optimal elliptic curve over $\mathbb{Q}$ and Stevens' Conjectures I and II. Our method adapts Hongbo Yin's congruence argument for cubic roots of modular functions to lifts of modular parametrizations through isogenies, using the unbounded denominators theorem of Calegari, Dimitrov and Tang.

comments
V2:28 pages including an appendix of details of AI usage and an alternative proof for Section 5, we also simplified the proof in Section 5
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2610.25672 ↗

One-dimensional Euler-Poisson-type systems with interaction potentials that are attractive at long ranges serve as simplified models that describe aggregation phenomena. We prove uniform bounds on the positions and velocities of discrete sticky-particle solutions to such a system where the potential satisfies certain coercivity growth conditions, requiring the potential be only $C^{0, 1}_{\mathrm{loc}}$. When the potential is semiconvex, these bounds yield compactness of time-translated trajectories, which converge to a solution on all of $\mathbb{R} \times \mathbb{R}$ of a simpler equation. Often, these limiting solutions possess substantial rigidity that determines the asymptotic behavior of the original solution, which we explore in a few applications. This method is robust with respect to the choice of potential, and in contrast to previous work does not require the solution operator to have a closed-form expression. As a corollary of our uniform bounds, we also obtain existence of solutions for non-semiconvex potentials, although such solutions may not retain stickiness.

comments
32 pages, 2 figures; re-organized paper
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.25754 ↗

Run to exhaustion, Peres's iteration of von Neumann's procedure yields a bijection of {0,1}^N that splits every string into fair bits and a residual. The residual is self-delimiting and determines the number of ones, so the fair bits are exactly uniform given the residual under every exchangeable law. Each residual one accounts for a power of two of the weight of the input, and the residual of every input of length N has fewer than sqrt(3) N^0.793 ones. This sparsity gives a short proof, with an explicit remainder, that the fair bits per symbol tend almost surely to the entropy for Bernoulli sources and every finite alphabet. The Bernoulli likelihood factorises along the recursion, and code B, which codes the residual at plug-in biases, has the length of the two-part code. Code G gamma-codes the gaps of the residual, with no estimate and no arithmetic coder: on every string its length is at most the logarithm of the type class plus O(N^0.793 log N). What is more, a concatenation of J pieces costs its piecewise empirical entropy plus a term that is sublinear when J = o(N), without the cuts being sent. After a Burrows-Wheeler transform of the reversed string, both codes are universal for stationary ergodic sources: code B through a context tree of growing depth, with regret O(2^k log N) against Markov sources of order k, and code G with no tree, competing on every individual sequence with the empirical conditional entropy of every order. For laws invariant under permutations inside the pieces of a partition, the fair bits not mixed across the pieces are exactly uniform given everything else; after the BWT, the fair bits of every stationary source fall short of their length by o(N) bits of entropy, with an exponential tail for Markov sources. Experiments measure the finite-length price of these guarantees.

fields
Information Theory
pdf ↗ page arXiv:2610.26396 ↗

We study an inverse problem for the variable coefficient Moore Gibson Thompson (MGT) equation in a bounded domain, where the objective is to recover an unknown initial acceleration from boundary measurements of the acoustic field. We establish both injectivity and stability of the associated measurement operator. Injectivity is established through a unique continuation property by applying a theorem of Tataru for analytically principally normal operators. The argument relies on a factorization of the third order operator into wave type components, combined with Carleman estimates and propagation techniques in the spirit of Tataru. Stability is derived through a microlocal analysis of the forward operator, based on the construction of geometric optics approximate solutions and the identification of an elliptic pseudodifferential operator arising from microlocal back propagation of the data. These results connect the MGT inverse problem with the classical theory of hyperbolic inverse problems, such as photoacoustic tomography, while highlighting new features induced by the third order dynamics and damping.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.26760 ↗

We give a computer-assisted proof that at most seven congruent infinite circular cylinders in $\mathbb{R}^3$ can touch pairwise. This answers a question of Littlewood from 1968. For cylinders of arbitrary radii we prove the upper bound ten. Whether ten can be attained remains open.

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

This paper analyzes graphexon mean field games (GXMFG) on large network limits. By considering edge distributions of a sequence of finite graphs, we define the empirical graphexon measures and study their subsequential weak limits in a graphexon space consisting of all symmetric probability measures on $[0,1]^{2d}$. This concept of network limits extends graphon theory to general, not necessarily dense, networks. To formulate the game using the graphexon limit, we exploit a useful property that a probability measure on a product space is the product of a probability kernel and a marginal distribution. Based on such graph limits and the probability kernel of the associated graphexon measure, we derive the GXMFG equations, and present a detailed analysis for the linear-quadratic case. For linear-quadratic models with finite populations residing over large networks, we use the GXMFG equations to construct decentralized strategies, for which an $ε$-Nash equilibrium property is established.

comments
To appear in Journal of Systems Science and Complexity
fields
Optimization and Control
pdf ↗ page arXiv:2610.27292 ↗

We study quantum cat maps on multidimensional tori and prove an optimal lower bound for the Kolmogorov-Sinai entropy of their semiclassical measures under the hypothesis that the dynamics splits over the rationals. This is the first instance of such a bound for a dynamical system with multiple positive Lyapunov exponents. The proof is based on a new notion of conditional quantum dynamical entropy and a careful study of the multiple Ehrenfest time adapted to the dynamics.

comments
61 pages. Comments are welcome. A log was missing in a hypothesis of theorem 5.1 and in the proof of corollary 5.1
fields
Mathematical Physics, Analysis of PDEs, Dynamical Systems, Spectral Theory
pdf ↗ page arXiv:2610.28026 ↗

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 first 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. A series of numerical experiments has been performed to confirm the theoretical results of this paper.

comments
95 pages, 14 figures
fields
Probability
pdf ↗ page arXiv:2610.29206 ↗

For Bernstein–Gelfand–Gelfand (BGG) complexes, we develop the first sparse-grid finite element discretizations, for dramatically reducing the number of degrees of freedom used in tensor-product finite elements. Alpert wavelets and their first and second primitives yield compatible hierarchies of discontinuous, continuous, and continuously differentiable piecewise polynomials, that serve as one-dimensional ingredients of BGG sparse-grid finite elements. For the three-dimensional Hessian, elasticity, and div-div complexes, we construct a bounded commuting sparse-grid projection that yields stable discrete potentials, exactness and uniform inf-sup stability of associated mixed methods. Under mixed Sobolev regularity, we also prove sparse-grid approximation estimates with dimension-independent algebraic convergence rates in the number of degrees of freedom. Experiments for a three-dimensional incompatibility problem and a two-dimensional biharmonic problem on an annulus illustrate the efficiency of sparse grids relative to tensor-product finite elements.

comments
22 pages, 4 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.29516 ↗

We give a short and self-contained proof that the category of all finite dimensional representations of quantum sl2 is not braided. Moreover, we show that it is a braided module category over a suitable monoidal subcategory.

fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2610.29748 ↗

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

fields
Numerical Analysis
pdf ↗ page arXiv:2610.31375 ↗

For $n,r\in\mathbb{N}$ with $r\geq 3$ and an $r$-graph (i.e., an $r$-uniform hypergraph) $H$, the Ramsey number $R(H,n)$ is the smallest $N\in\mathbb{N}$ such that every red/blue coloring of the hyperedges of the $N$-vertex complete $r$-graph $K_N^{(r)}$ contains either a red copy of $H$ or a blue copy of $K_n^{(r)}$. For every integer $r\geq 3$, we characterize all $r$-graphs $H$ for which $R(H,n)$ is polynomial in $n$. Explicitly, we prove a conjecture of Conlon, Fox, Gunby, He, Mubayi, Suk, Verstraëte, and Yu, that $R(H,n)$ is polynomial in $n$ if and only if $H$ is isomorphic to a subgraph of a lexicographic power of $K_r^{(r)}$. This concludes an extensive line of work initiated by Erdős and Hajnal in 1972 on characterizing the polynomial growth of off-diagonal hypergraph Ramsey numbers.

fields
Combinatorics
pdf ↗ page arXiv:2610.32644 ↗

The regularity of solutions to the two-dimensional radiation transport equation plays a central role in understanding the behavior of scalar flux near geometric corners. In a previous study of Kaper's corner singularity problem, the physical transport kernel was decomposed into its principal inverse-distance singularity and a lower-order remainder, reducing the corner asymptotic analysis to the question of whether the scalar flux possesses sufficient continuity to justify differentiation of the associated singular potential. The required regularity, however, remained unresolved. In this paper, we establish a sharp modulus-of-continuity estimate for the scalar flux generated by the physical transport kernel and prove the estimate $ω_φ(h)=O\!\left(h\log(D/h)\right)$, which implies Dini continuity. This estimate yields absolute convergence of the fluctuation term arising in the differentiated principal potential and permits a rigorous differentiation formula for transport solutions. Using this regularity framework, we derive the fixed-angle asymptotic behavior of the scalar flux and its first derivatives near a rectangular corner. For every fixed interior ray, the gradient exhibits logarithmic growth, while the scalar flux admits an $r\log(1/r)$ correction with an explicitly identified coefficient determined by the corner values of the flux and source. The analysis shows that a rectangular corner does not generate a singularity stronger than the logarithmic first-derivative singularity already present in smooth-boundary transport theory. Numerical calculations on benchmark problems are consistent with the theoretical predictions. These results provide a rigorous resolution of the regularity issue underlying Kaper's corner singularity problem and establish a mathematical framework for corner asymptotics in two-dimensional radiation transport.

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

We consider an attractor $Λ$ of a $C^1$ diffeomorphism of $\mathbf M^d$ with a trapping neighborhood $U$ and an extendable continuous invariant splitting $T_{\overline U}\mathbf M^d=E\oplus F$. Under quantitative asymptotic hyperbolicity assumptions, we prove the existence of hyperbolic ergodic invariant probability measures on $Λ$ that satisfy Pesin's entropy formula and have negative Lyapunov exponents on $E$ and positive exponents on $F$. No dominated splitting is required on the attractor. Our results apply to mostly expanding partially hyperbolic systems and to systems with separated Lyapunov exponents under suitable statistical assumptions. For $C^{1+α}$ diffeomorphisms, the resulting measures are SRB measures, and the corresponding sets of asymptotically hyperbolic points are covered, modulo Lebesgue null sets, by the basins of at most countably many such measures. We give necessary and sufficient criteria for the existence of ergodic SRB measures with these exponent signs in terms of derivative growth and orbit statistics, and characterize the relationship between physical measures, strongly observable measures, physical-like measures and such SRB measures. We also construct examples with unique hyperbolic SRB measures of full support on attractors admitting no nontrivial dominated splitting, demonstrating the applicability of our criteria beyond results that require domination.

comments
Added a countable basin coverage theorem for hyperbolic SRB measures and examples showing that finite coverage can fail. Strengthened Theorem D and added Corollaries A and B on necessary and sufficient conditions for SRB existence and their relation to observability
fields
Dynamical Systems
pdf ↗ page arXiv:2610.32820 ↗

We prove the existence of maximizing measures for subadditive and almost-additive families of upper semicontinuous, bounded-above potentials $\mathcal F=\{f_n\}_{n\geq1}$ on closed subshifts over countable alphabets. Under a coercivity condition on $f_1$, we prove that every maximizing sequence, that is, $\{μ_k\}_{k\geq1}\subset\mathcal M_σ(X)$ satisfying $\bar{\mathcal F}(μ_k)\toβ(\mathcal F)$, is uniformly tight, preventing mass from escaping to arbitrarily large symbols. As a consequence, a maximizing measure exists. We apply these results to matrix cocycles, establishing the existence of invariant measures that realize the joint spectral radius for countable families of matrices.

comments
Small fixes and a great revision of the introduction, which is rather expanded now. Submitted
fields
Dynamical Systems
pdf ↗ page arXiv:2610.33218 ↗

We study Birkhoff magnetic billiards inside convex planar domains for a constant weak magnetic field. We prove that there exists a functional family of centrally-symmetric convex billiard tables satisfying the so-called magnetic Radon property. These are tables which have a rotational invariant curves consisting of $4$-periodic orbits with the rotation numbers either $1/4$ or $3/4$. These billiard tables can be constructed in a neighborhood of circles. However in our construction we do not use perturbation methods but rather some topological argument for the system of ODEs governing the magnetic Radon property. In contrast with this result we consider the magnetic billiard tables having discrete rotational symmetry for the angle $2π/k, k\in\mathbb{Z}$. We prove that in this case a rotational invariant curve consisting of $k$-periodic orbits exists, if and only if the billiard table is circular. We develop several tools, which, we believe, are important for other aspects of magnetic billiards. The first is the "magnetic duality" which enables to work with the dual object—the outer magnetic billiard. Secondly, we find the generating functions of outer magnetic billiard, both the ''standard" and the "non-standard" ones.

comments
26 p
fields
Dynamical Systems, Mathematical Physics
pdf ↗ page arXiv:2610.33782 ↗

We propose a parametrization-free method that estimates the principal curvatures and principal directions of a submanifold of $\mathbb{R}^d$ from the closest point projections of a few random rays, without coordinate charts or local fitting. The projection of a ray induces a curve on the submanifold, which is a geodesic only in special cases, so its curvature is in general not a curvature of the submanifold. The velocities of these curves, however, relate to the derivative of the closest point projection, whose eigenpairs carry the information of the principal curvatures and directions. Finite differences along $d$ rays can estimate them without relying on the normal information at a cost of $\mathcal{O}(d^3)$ besides the projections, and we provide error bounds. The method extends to submanifolds of any codimension and to point clouds, and experiments confirm the predicted rates in up to $128$ dimensions.

comments
33 pages, 7 figures, refined and polished based upon the previous version
fields
Differential Geometry
pdf ↗ page arXiv:2610.33943 ↗

For a Hermitian line bundle $E\to Y$ over a Riemannian manifold $(Y^n,g)$, the self-dual Abelian-Higgs energy is defined by $\mathcal{E}^Y_{\varepsilon,g}(u,a)=\frac{1}{2π}\int_Y \left(|\nabla_a u|_g^2+\varepsilon^2|F_a|_g^2+ \frac{(1-|u|^2)^2}{4\varepsilon^2}\right)dV_g$, where $u$ is a smooth section of $E$, $a$ is a unitary connection, and $F_a$ is its curvature. Pigati and Stern studied the energy as a codimension-two analogue of the Allen-Cahn energy to study minimal submanifolds in a Riemannian manifold. In this paper, we use this functional to define a nondecreasing sequence of symplectic capacities $\{c_k^{\mathrm{AH}}\}_{k\ge1}$ in dimension four by a min-max construction. In particular, we prove that $c_1^{\mathrm{AH}}$ is normalized on the ball and the cylinder. For the upper bound on the cylinder, we combine Gromov's theory of families of $J$-holomorphic spheres with Taubes's planar vortex. For the lower bound on the ball, we use the properties of the Abelian-Higgs theory developed by Pigati-Stern, together with a geometric estimate on smooth approximations to the double of the ball and an equivariant deformation of low energy sublevels. These estimates give the normalization without Seiberg-Witten theory. We then use Seiberg-Witten moduli spaces on $\mathbb{CP}^2$ and $S^2\times S^2$ to prove an upper bound on the higher capacities of balls and the formula $c_k^{\mathrm{AH}}(Z^4(a),ω_0)=ka$. We also prove Weyl laws for domains in $\mathbb{R}^4$, both for the capacity sequence and for the min-max sequence with the standard Euclidean metric. For these results, we construct AH sweepouts from moduli spaces of the solutions to the perturbed Seiberg-Witten equations.

comments
48pages. Minor wording revisions. expanded discussion of the motivation
fields
Symplectic Geometry, Differential Geometry
pdf ↗ page arXiv:2610.34062 ↗

This paper addresses a central problem in the factorization theory of Krull domains in which every class contains a prime divisor. It is well-known that the system of length sets depends on the class group only and the question is whether this system carries enough information to recover the underlying class group. We give an affirmative answer for all homocyclic class groups $C_n^r$. More precisely, let $D$ be a Krull domain with class group $C_n^r$, with $n, r \in \mathbb N$, and suppose that each class contains a prime divisor. If the system of length sets $\mathcal L (C_n^r)$ is equal to a system of length sets $\mathcal L (G)$, for any finite abelian group $G$ with $\mathsf D (G) \ge 4$, then $G \cong C_n^r$. The central tools are cross numbers of (minimal) zero-sum sequences over the class group.

fields
Number Theory, Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2610.34288 ↗

We study the minimum extension degree of Reed-Solomon codes admitting exact linear repair of every failed coordinate from any $d$ surviving coordinates at the cut-set bound. Write $s=d-k+1$, and let $Q_s(n)$ be the minimum product of $n$ pairwise coprime integers, each at least $s$. We locate the transition for the formula $sQ_s(n)$ near $n=d^2$: for every fixed $0<\varepsilon<1$ and sufficiently large $d$, the formula is exact up to $(1-\varepsilon)d^2$, whereas strict improvement is possible at every length at least $(1+\varepsilon)d^2$, uniformly over the base field and code dimension. The lower bound follows from an inequality for the cost of residual prime powers; the upper bound follows from an existing affine-plane construction. We also show that the full-helper coordinate-count bound is attained over sufficiently large base fields. Finally, nonlinear repair at cut-set equality induces linear repair over the prime field. Thus the degree bounds over that field remain valid, and the same transition holds when the repair base field is prime.

comments
34 pages
fields
Information Theory
pdf ↗ page arXiv:2610.34377 ↗

We prove that if the smallest modulus of a covering system is a prime $q \ge 11$, then the sum of the reciprocals of the moduli is at least $1+10^{-33}$. This improves on a previous more general bound of the first two authors in this particular case. We also show that it is impossible to construct a covering system using distinct multiples of $q$ as moduli. Finally, we show as a corollary that it is impossible to construct $10$ distinct covering systems with the property that no modulus is used in more than one of the covering systems.

comments
15 pages
fields
Number Theory
pdf ↗ page arXiv:2610.34541 ↗

In this paper, we present and analyze an interior penalty discontinuous Galerkin method for Dirichlet boundary control problems governed by the biharmonic equation, with the control imposed through the normal derivative. The method is based on a reconstructed discontinuous approximation that admits an arbitrarily high-order approximation space with only one unknown per element. We construct a discretization that approximates the state and adjoint state in this space and derive a priori error estimates in the energy and $L^2$ norms. The analysis is carried out under the limited regularity available on polygonal domains by means of a medius argument. Numerical experiments are provided to support the predicted convergence rates.

comments
22 pages, 18 tables
fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2610.34669 ↗

In this article, we prove that every split simple Chevalley Lie algebra over a finite field of characteristic $p\neq 2$ of classical types $B_n$, $C_n$, and $D_n$, and exceptional types $G_2$, $F_4$, $E_6$, $E_7$, and $E_8$, is $2$-generated. Combined with the result of Cantor, Jezernik, and Zozaya for the classical type $A_n$ [Two-generation of traceless matrices over finite fields, Linear Algebra Appl. (2025)], this establishes $2$-generation for all split simple Chevalley Lie algebras over finite fields of characteristic $p\neq 2$.

fields
Rings and Algebras, Group Theory
pdf ↗ page arXiv:2610.35537 ↗

This article takes place in the extension and generalization proposed by Corredor, Deloro and Wiscons of the works of Dickson and Wagner regarding the Classification of minimal $\text{Sym}(n)$- and $\text{Alt}(n)$-modules. In particular, we classify the minimal faithful $\text{Alt}(6)$-modules with an additive dimension in characteristic not 3. We also highlight the remaining work needed to complete the classification of minimal faithful $\text{Alt}(n)$- and $\text{Sym}(n)$-modules with an additive dimension.

fields
Group Theory
pdf ↗ page arXiv:2610.35941 ↗

This paper analyses infinite-server queues driven by a Cox process whose stochastic arrival intensity follows a squared Bessel (BESQ) process. Exploiting the affine structure of the model and previously derived transform representations for infinite-server queue variables, we derive the joint moment-generating function (MGF) of the arrival intensity, the number of customers in the system, and the time integral of the queue length at two or more dates. This enables a detailed analysis of the temporal evolution of infinite-server queues driven by a Cox-BESQ process. The availability of these explicit MGFs enables the development of risk measures for these variables, such as the joint moments of the arrival intensity, the number of customers in the system, and the integral of the number of customers in the system over a time interval, conditional on one of these variables exceeding a critical threshold. These risk measures can be determined at one or two dates. They rely essentially on the explicit form of the MGF of the state variables and on Fourier representations of the risk measures. Numerical experiments demonstrate the practical implementation of the proposed methodology and highlight the relevance of the theoretical results.

comments
28 pages, 6 figures
fields
Probability
pdf ↗ page arXiv:2610.36473 ↗

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 ↗

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
26 pages, 7 figures, 1 table. Companion to arXiv:2610.41555. Code and data: doi:10.5281/zenodo.23730750. v3: in Section 10.2 the codominant case of Conjecture 10.2 is now argued for all n (previously stated on the basis of a check for n <= 6), and the remark on interior vertices is made explicit; no other changes, numbering unchanged
fields
Combinatorics, Representation Theory
pdf ↗ page arXiv:2610.39021 ↗

Given a set of states $S$ and a nonempty proper subset $A\subset S$, an avoid-or-compress word either omits a state of $A$ from the image of $S$ or reduces the size of that image. We determine the largest possible length of a shortest such word when $S$ is a reachable image missing four or five states. For strongly connected synchronizing automata, the answers are $\min(n-|A|,11)$ and $\min(n-|A|,14)$, respectively, and both are attained over a binary alphabet. The lower bounds follow from uniform constructions. For the upper bounds, short-pair graphs and the linear span of short images reduce the problem to finitely many configurations. A computer-assisted classification eliminates these configurations except for one complete bipartite graph, which is excluded by a combinatorial argument.

comments
37 pages, 2 figures, 1 table. Expanded proofs, revised exposition, and detailed computational verification
fields
Combinatorics
pdf ↗ page arXiv:2610.39833 ↗

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.

comments
Added figure 3 and figure 12, improved clarity in the proof of Theorem 3.2, and minor corrections
fields
Dynamical Systems
pdf ↗ page arXiv:2610.39907 ↗

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
13 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.39957 ↗

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 Lattès phenomena, we show that all families of maps and subvarieties that bifurcate are maximally bifurcating; that is, we show that a positive bifurcation (1,1)-current implies positivity of the associated bifurcation measure on the parameter space. 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
Minor edits, added references. 80 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.40147 ↗

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 ↗

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
27 pages, 8 Figures, 2 tables
fields
Mathematical Physics
pdf ↗ page arXiv:2610.40317 ↗

We prove that every set $S = \bigcup_{n = 0}^{\infty} [ t_{2 n + 1} , t_{2 n} )$, where $t_0 > t_1 > \cdots > 0$ and $\lim_{n \rightarrow \infty} t_n = 0$, admits no Riesz spectrum, that is, no system of exponentials is a Riesz basis for $L^2 ( S )$. Up to a reflection and a null set, this class contains the example of Kozma, Nitzan, and Olevskii (2023). Moreover, combining with the result of Kozma and Nitzan (2015), we show that a bounded countable union of pairwise disjoint intervals of positive length whose endpoints have exactly one accumulation point admits a Riesz spectrum if and only if it is a finite union of intervals up to a null set.

comments
16 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.40400 ↗

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 ↗

Hibi and Li conjectured that the order polytope $\mathcal{O}(P)$ of a finite poset $P$ has at most as many faces of each dimension as its chain polytope $\mathcal{C}(P)$, and that equality in some dimension $k$ with $1\leq k\leq|P|-1$ forces the two polytopes to be unimodularly equivalent. Fourier proved the inequality in a 2026 preprint. Let $X$ be the five-element poset in which an element lies above two incomparable elements and below two other incomparable elements. Using two results from Fourier's preprint, we show that if an $n$-element poset contains $X$ as an induced subposet, then, for every $k$ with $2\leq k\leq n-1$, its chain polytope has at least $\binom{n-3}{k-2}$ more $k$-dimensional faces than its order polytope, and that for every $n\geq5$ some $n$-element poset containing $X$ attains all these bounds at once. Since Hibi and Li showed that $\mathcal{O}(P)$ and $\mathcal{C}(P)$ are unimodularly equivalent exactly when $P$ does not contain $X$, this proves the equality statement for these values of $k$. The second version of Fourier's preprint gives an independent proof of this statement. For $k=1$, the equality statement is false: the polytopes $\mathcal{O}(X)$ and $\mathcal{C}(X)$ have the same number of edges (Hibi, Li, Sahara and Shikama) but are not unimodularly equivalent. Together with Fourier's inequality, these results settle the conjecture. Our results are formalized in Lean 4, with one result of Fourier's preprint and three published results taken as hypotheses.

code
github.com/david44hello/papers_supporting_materials/tree/hibi-li-2016-conjecture-v4.60/hibi-li-2016-conjecture ∎ Lean project (cranston-li-su-wang-xu-2026-conjecture/lean/lakefile.toml, cranston-li-su-wang-xu-2026-conjecture/lean/lean-toolchain) builds, no sorry at 15495bd, checked 2026-11-13 build details
comments
17 pages, 3 figures, 1 table. The expanded version was first posted on October 24, 2026, at https://doi.org/10.5281/zenodo.23601976 and its newest version is at https://doi.org/10.5281/zenodo.23601975 and the Lean 4 formalization is at https://github.com/david44hello/papers_supporting_materials/tree/hibi-li-2016-conjecture-v4.60/hibi-li-2016-conjecture
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2610.40703 ↗

We prove that a von Neumann algebra $N$ is injective if and only if $\|T\|_{\mathrm{dec}}=\|T\|_{\mathrm{cb}}$ for every linear map $T:\ell^\infty_3\to N$, answering a problem of Haagerup (1985).

fields
Operator Algebras
pdf ↗ page arXiv:2610.41746 ↗

We propose a program to classify tensor categories generated by prescribed seed tensor categories. We carry out this program for finitely many marked copies of the positive Fibonacci category with pairwise nonisomorphic generating simple objects, in the setting of split locally finite semisimple rigid $\mathbb{C}$-linear tensor categories with simple unit. We show that the Fibonacci fusion relation forces the fusion rules to be those of a specialized Coxeter–Hecke ring. The systems admitting categorification have Coxeter exponents $2,3,\infty$. For every such system we construct a tensor category and prove uniqueness up to marked tensor equivalence. Its simple objects are indexed by the Coxeter group, which may be infinite. Finite rank occurs precisely for disjoint unions of finite ADE diagrams, giving the ADE classification of Fibonacci-generated fusion categories. These categories are unitarizable, with no unitary structure assumed on the candidate. In finite ADE type, allowing Yang–Lee seeds gives one independent tensor-branch choice on each connected component.

comments
48 pages. Clarified the definition of marked equivalence and expanded the proofs of braid naturality, rigidity, and the unitary realization. Added an explicit formula for the pure braid polygon scalar under edge rescaling and clarified the Coxeter cell structure of the Davis complex. The main classification results are unchanged
fields
Quantum Algebra
pdf ↗ page arXiv:2610.41811 ↗

For stochastic matrices of order $n$, the Karpelevič region is the set of all possible eigenvalues. We study matrices whose first and last $m$ rows are arbitrary probability vectors, while the remaining rows have a Toeplitz pattern. As $m$ increases, their eigenvalue regions expand, first reaching the full Karpelevič region at $m=\lceil(n-1)/4\rceil$ for $n\ge3$. Reproducing every complete stochastic spectrum, with multiplicities, requires $m=\lfloor n/2\rfloor$. For a boundary arc whose endpoints have orders $q<s$ as roots of unity, the least $m$ needed to attain the whole arc is $0$ for $q=1$ and $\left\lceil\frac12\left\lfloor n/q\right\rfloor\right\rceil$ for $q\ge2$. For a Karpelevič boundary arc whose nonreal points between the endpoints first occur as stochastic eigenvalues at order $n\ge4$, fixing any one of these eigenvalues fixes the characteristic polynomial of every stochastic matrix of order $n$ with that eigenvalue. For these arcs and $m\ge1$, our family attains either the whole arc or only its endpoints. Further results describe the smaller eigenvalue regions and the angles at which their boundaries approach roots of unity.

comments
46 pages, 4 figures, 16 references; revised abstract and expanded exposition, including clarifications of constructions and proofs; added funding acknowledgement
fields
Probability, Rings and Algebras
pdf ↗ page arXiv:2610.42072 ↗

The 2-switch operation for reducing the number of short cycles in Tanner graphs of LDPC codes has been utilized in some works. If this operation is appropriately applied to a 2-induced matching in a bipartite graph, then it surely preserves the bipartiteness of the graph. With a 2-induced matching, we have only one choice for applying this type of change to the graph. Using 3-induced matchings creates more potential and flexibility to apply certain changes to the Tanner graph. We present a necessary and sufficient condition for the existence of a 3-induced matching in bipartite graphs with girth at least 6. A 3-induced matching helps us to have more choices for applying a change to a bipartite graph while surely preserving the bipartiteness of the graph and keeping the degree sequences unchanged. Among all changes that we consider, we select the best change for reducing the number of cycles of length 6. The eigenvalues of subgraphs are used to reach a 3-induced matching, and a condition in some steps can be checked to ensure that the subgraph has at least one 3-induced matching. We present some numerical results regarding the steps at which the condition that guarantees the existence of a 3-induced matching is checked.

comments
Minor revisions and an additional figure
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2611.00082 ↗

We develop Stein's method, with explicit constants throughout, for the discrete Bessel distribution: the law of a Poisson variable given its difference from an independent Poisson variable. The Bessel family is characterized by a birth-death operator with quadratic death rate $n(n+k)$ and as the exact fixed-point set of a centered quadratic-bias transform, and we prove a dependency expansion of Arratia-Goldstein-Gordon type: two joint moments of a column array control the total-variation distance from the conditioned row sum to a matched Bessel law. Applied to the row-constrained Fisher-Yates ensemble on $2\times c$ contingency tables -- independent Bernoulli or capped-Poisson entries conditioned on the row-sum difference, column sums free -- this yields a limit theorem -- which upgrades to the entire conditioned table at the same two-moment error -- a completely explicit enumeration estimate, and an exact divide-and-conquer sampler with certified acceptance. The entire apparatus -- operator, expansion, enumeration, sampler -- generalizes to $r\times c$ tables, where conditioning on all successive row differences produces a hyper-Bessel law. Verification scripts are included as ancillary files.

comments
47 pages. Numerical verification code included as ancillary files. v2: cites the companion paper arXiv:2611.00275; the Gamma clause of Open Problem 8.2 is corrected (a counterexample, posted in public discussion in response to v1, is recorded with credit and independent verification)
fields
Probability, Combinatorics
pdf ↗ page arXiv:2611.00263 ↗

We prove that for any valuation $\varphi$ of lattice polytopes in ${\mathbb R}^m$, which is quasi-polynomial with respect to ${\mathbb Z}^m$-translations, and any lattice polytope $P$, the function $\varphi(nP)$ is quasi-polynomial in $n$.

comments
17 pages
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2611.00313 ↗

Sequential subspace optimization (SESOP) minimizes the objective exactly over a few directions built from past iterates. It needs no problem constants, is accelerated on smooth convex functions and in practice behaves like an accelerated method. This led to the conjecture that it is uniformly accelerated on strongly convex functions as well. The conjecture is false. Consider exact subspace methods whose memory is a window of recent gradients and steps plus finitely many fixed cumulative sums. Uniform acceleration then requires either a window whose length grows as the square root of the condition number or a sum that forgets at a rate of at least the order of the inverse square root. For one filter pair with a fixed factor and a bounded window this scale of forgetting is necessary and sufficient up to constants. SESOP remembers too much and the plane form of conjugate gradients too little: neither is uniformly accelerated, even on infinitely differentiable functions that are quadratic near the minimizer. A short window, in contrast, converges locally quadratically over blocks of steps when the Hessian is Lipschitz near the minimizer and equals a multiple of the identity plus a low-rank term there. Pairs of geometric filters created at fixed times give a uniformly accelerated method with logarithmic memory and no problem constants, also with inexact subproblems. A single pair with a smoothly adapted factor needs two vectors and is accelerated up to a prefactor polynomial in the condition number.

fields
Optimization and Control
pdf ↗ page arXiv:2611.00727 ↗

Lieb-Robinson bounds formulate emergent causality in quantum many-body dynamics. In this Letter, we study interacting bosonic systems with long-range interactions, in which both the standard assumptions of short-range interactions and uniformly bounded local energy scales are absent. We derive upper and lower bounds whose light-cone exponents depend jointly on the spatial decay $α$ and bosonic interaction order $p$. The key physical mechanism balances enhancement by local boson concentration with coherent amplification of long-range interactions. Our state-transfer protocol realizes this balance by concentrating bosons within mesoscopic blocks while preserving a spatial array of occupied sites. For integer $p\ge4$ and $2d<α\le2d+1$, the leading exponents coincide, determining the optimal light cone under controlled-density assumptions, up to arbitrarily small upper-bound exponent losses. Our results identify a new mechanism for accelerating information propagation through the combined effects of bosonic particle accumulation and long-range interactions.

comments
10 pages, 1 figure; Supplementary Material: 75 pages, 6 figures, 1 table
fields
Mathematical Physics
pdf ↗ page arXiv:2611.00776 ↗

Let $\varphi=(1+\sqrt5)/2$. The set $\{0,\varphi,\varphi^2,\varphi^3\}$ is classical (Euclid, Elements XIII.8): by $\varphi^2=\varphi+1$ its six pairwise differences take the values $1,\varphi,\varphi^2,\varphi^3$, with multiplicities $1,2,2,1$. We write it as the golden quadruple $S=(F, F-a, F-b, F-a-b)$, $a=\varphi u$, $b=\varphi^2u$, $F>a+b$, and study its extremal and rigidity properties. No five distinct reals have all their positive differences in $\{u\varphi^n:n\in\mathbb{Z}\}$; this follows from a result of Lenstra (1977), and we give a self-contained proof. We give an elementary proof of uniqueness: every four-element set with this property is a translate of $u\varphi^m\{0,\varphi,\varphi^2,\varphi^3\}$ for some $m\in\mathbb{Z}$, and if all its differences lie in $\{u,\varphi u,\varphi^2u,\varphi^3u\}$ it is a translate of $S$. Among all $x>1$, only $x=\varphi$ admits a four-point set of reals whose set of distinct differences is $\{c,cx,cx^2,cx^3\}$. For the analogous quadruple with base $x\neq\varphi$ the failure is measured by two closure residues, which along Fibonacci quotients equal $\pm u/\mathrm{Fib}_n^2$ and $\pm \mathrm{Fib}_{n+1}u/\mathrm{Fib}_n^3$. The cosine sum $C_S(t)=\sum\cos(2πd t)$ over the six differences equals $8\cos^2(πa t)\cos^2(πb t)-2$; it is not periodic but is Bohr almost periodic, with explicit almost periods $τ_n=\mathrm{Fib}_n/u$, and we determine the two-term asymptotics $\sup_t|C_S(t+τ_n)-C_S(t)|=6\sqrt3 π\varphi^{-n}-2\sqrt3 π^3\varphi^{-3n}+O(\varphi^{-5n})$, with optimal constants; the inclusion length of the $\varepsilon$-almost periods is of order $1/\varepsilon$. For a scale $K>0$ the golden ladder $ν_n=K\varphi^{-n}$ realises the construction with differences $ν_{200},\dots,ν_{203}$; we evaluate it for $K=\sqrt{c^5/(Gh)}$. All proofs are elementary and self-contained.

comments
32 pages. v3: added reference to Leutbeuchter-Martinet (1982) for N(phi)=4 and N(rho)=5; DOIs added to the bibliography; sampling remark in Section 7 clarified; see section "Changes in version 3". Polish version and Lean 4 formalization: https://doi.org/10.5281/zenodo.23798808
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.00973 ↗

We study separation points for the nonstationary Stokes system in a half-space with zero initial data and boundary data compactly supported in space and time. We call a space-time point on the boundary and outside the spatial support of the data a separation point of a velocity component if the component takes both signs on sets of positive measure in every sufficiently small adjacent neighborhood. The main ingredient of the analysis is the explicit representation of the velocity and pressure in terms of the boundary data using the confluent hypergeometric functions. For normal boundary data, under the regularity and unimodality assumptions, log-concavity of the temporal profile yields a unique separation time for the tangential component at every boundary point with \(|x_i|>1\), while the normal component has exactly two separation times for sufficiently large \(|x'|\). For every nonzero nonnegative temporal profile satisfying the regularity assumption, \(\partial_{x_n}^2w_n(x',0,\cdot)\) has a unique simple zero for \(t>1\) when \(|x'|\) is sufficiently large. We also obtain monotonicity and asymptotic behavior of the separation times and quantitative rates at which the corresponding normal derivatives vanish. For tangential data in \(n\geq3\), a separation time for the parallel component exists precisely when \(\partial_{x_1}R_1'ψ(x')>0\), with \(R_1'\) the first Riesz transform; log-concavity makes the separation time unique. For the remaining components, we also prove existence and uniqueness. In both cases, we derive asymptotic formulas involving spatial moments and the geometry of \(\suppψ\). We determine signs of tangential pressure derivatives and, for radial \(ψ\), establish uniqueness and asymptotics of their zeros.

comments
108 pages, 13 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.00998 ↗

We present an account of the classification of Fano contact manifolds based on the proof of OpenAI and the solution of LeBrun-Salamon conjecture by Hu, Liu and Wan. The proof combines their constructions with earlier results on contact lines, with some simplifications.

comments
This paper grew out from my attempts to understand [OpenAI] and [HLW] through extensive discussions with ChatGPT. My contribution is mainly editorial: the rewriting, reformulation and reorganization of claims and proofs; the explanation and illustration of the proof via adjoint varieties (which is the essential part of my contribution in this paper); attributions of previous works etc
fields
Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2611.01423 ↗

We study the tracking of fractional Brownian motion by adapted controls of finite variation, with quadratic loss and proportional adjustment costs. Let $B^H$ be standard fractional Brownian motion with Hurst parameter $H\in(0,1)$. We write $V_λ(T;a,b,σ)$ for the optimal expected cost of tracking $σB^H$ over a horizon $T>0$, where $σ>0$ is the target amplitude, $a>0$ weights the quadratic loss, and $λb$ is the cost per unit of adjustment, with $λ,b>0$. We prove \[V_λ(T;a,b,σ)\underset{λ\to0}{\sim}κ_HT a^{(1-H)/(1+H)}(λb)^{2H/(1+H)}σ^{2/(1+H)}. \] Here $κ_H>0$ is the long-run optimal cost per unit time in the normalized problem $a=b=σ=λ=1$. Observing the entire past does not change $κ_H$. For the normalized problem with full past information, a horizon $L>0$ and a terminal adjustment to the target, the difference between its value and $κ_H L$ is bounded uniformly in $L$. This estimate also yields continuity of $κ_H$ in $H$. In the Brownian case, $κ_{1/2}=\frac12(\frac32)^{2/3}$. We extend the asymptotic formula to nonstationary targets under a coupling condition on local paths and their observation filtrations. We verify this condition for Gaussian Volterra targets under Brownian observation. All asymptotically optimal controls have the same leading-order split between tracking and adjustment costs. We also give primal and dual bounds on $κ_H$. For $H<1/2$, we construct approximations based on exponential sums with positive weights and quantify their error as the horizon grows.

comments
48 pages, 2 figures
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2611.01727 ↗

We consider irreducible reversible Markov chains whose nonzero off-diagonal transition probabilities are bounded below by $\varepsilon>0$ and whose reversible measure satisfies $m_-\le m(x)\leκm_-$. Under the Bakry–Émery curvature condition $\mathrm{CD}(K,\infty)$, with $K\in\mathbb{R}$, we establish Wang's log-Harnack inequality $$ P_t(\log f)(x)\le\log P_tf(y) +\frac{C\mathrm{dist}(x,y)^2}{\int_0^t e^{2Ks}\mathrm{d} s}, $$ for bounded positive $f$ bounded away from zero and all $x,y\in V$, where $C$ is a constant dependent only on $\varepsilon$. Building upon this inequality, we prove volume doubling property, which extends the work of Guo-Huang-Huang to general weighted setting. We further prove a sharp volume growth and Li-Yau gradient estimates under $\mathrm{CD}(0,\infty)$ .

comments
49 pages, 2 figures, 1 appendix
fields
Probability, Combinatorics, Differential Geometry
pdf ↗ page arXiv:2611.02010 ↗

Let $(\mathcal{M},τ)$ be a tracial von Neumann algebra, $T:L_1(\mathcal{M},τ)\to L_1(\mathcal{M},τ)$ be induced by a normal $τ$-preserving $*$-automorphism of $\mathcal{M}$, and $x\in L_1(\mathcal{M},τ)$. We will prove the bilaterally almost uniform convergence of averages of the form $$\frac{1}{n}\sum_{k=0}^{n-1}T^k(x_k),$$ generalizing an ergodic theorem proven by Breiman in \cite{Breiman57}, where $(x_k)_{k=0}^{\infty}$ is an element of the noncommutative vector-valued $L_p$-space $L_p(\mathcal{M},τ;\ell_\infty)$ such that there exists $x\in L_p(\mathcal{M},τ)$ with $(x_k-x)_{k=0}^{\infty}\in L_p(\mathcal{M},τ;c_0)$. A generalization to semifinite $(\mathcal{M},τ)$ and general positive Dunford-Schwartz operators $T\in DS^+(\mathcal{M},τ)$ is shown as well when $1<p<\infty$. In addition to these, we also prove a number of generalizations of the results to weighted, subsequential, and other types of averages.

comments
32 pages, v2: Identified limit operator in Theorem 4.5 in the case of finite trace
fields
Operator Algebras, Dynamical Systems, Functional Analysis
pdf ↗ page arXiv:2611.02535 ↗

In this paper, we obtain the sharp constants for Hausdorff–Young inequalities on simply connected, completely solvable Lie groups, and connected real semisimple Lie groups with finite center.

fields
Functional Analysis
pdf ↗ page arXiv:2611.02597 ↗

Let $K$ be a nonempty compact semialgebraic subset of the real line, and let $S$ be a saturated scalar description of $K$. We prove that every hermitian polynomial $F\in\mathcal B(\mathcal H)[x]$ positive semidefinite on $K$ admits a certificate in the operator quadratic module generated by $S$, with weighted degree at most $\operatorname{deg} F+c_S$. Here, $c_S$ depends only on $S$ and is independent of both $F$ and the coefficient Hilbert space $\mathcal H$, which may be infinite-dimensional. In contrast to the scalar case, natural matrix preorderings admit no uniform degree bound over compact semialgebraic subsets of the real line. We construct positive semidefinite quadratic $2\times2$ matrix polynomials on unions of two intervals whose minimum certificate degrees tend to infinity as one interval shrinks to a point, while the gap remains bounded below. Conversely, uniform degree bounds hold for interval unions in a fixed compact interval when the component and gap lengths are bounded below by positive constants. Our proofs develop two techniques. The first is a quadratic reduction principle that reduces the problem of obtaining degree bounds for arbitrary-degree operator polynomials to the quadratic case, with a fixed additive increase in degree. The second uses a rank-one symmetric matrix pencil to transfer positivity on unions of intervals to $[0,1]$, where the operator Fejér-Riesz theorem provides certificates. We also obtain operator-valued Fejér-Riesz factorizations on unions of circular arcs, rational certificates with a fixed denominator on unbounded semialgebraic sets, and a characterization of the sets whose natural operator preorderings admit degree-preserving certificates.

comments
38 pages; Three new corollaries have been added
fields
Functional Analysis, Algebraic Geometry
pdf ↗ page arXiv:2611.02967 ↗

We calculate zeta functions of quasi-split reductive algebraic groups over local fields using the classification of Tits and prove a functional equation. We give explicit exam- ples of these zeta functions for non-split unitary and orthogonal groups.

comments
15 pages
fields
Number Theory, Representation Theory
pdf ↗ page arXiv:2611.03470 ↗

We prove that the number of maximal complex totally geodesic submanifolds of a smooth finite-volume non-arithmetic ball quotient is bounded linearly by its volume, with a constant depending only on the complex dimension. This gives a quantitative strengthening of the finiteness theorems of Bader–Fisher–Miller–Stover (Invent. Math., 2023) and Baldi–Ullmo (Ann. of Math., 2023).

comments
v2: 35 pages, some references added, comments are very welcome; v1:34 pages
fields
Algebraic Geometry, Differential Geometry, Dynamical Systems
pdf ↗ page arXiv:2611.03514 ↗

We study orthonormal Strichartz estimates at the critical coefficient exponent $q/2$ for fractional Schrödinger propagators. The proof for $d\geq3$ combines annular Schatten estimates with a frequency summation argument based on potential duality and Littlewood–Paley theory. In dimension two, a trace computation supplies the annular estimate needed for the global estimate. We also construct a counterexample to the global estimate with spatial $L^\infty$ norm and coefficients in $\ell^{q/2}$, even with a weak time norm.

comments
Version 3 fixes some English and notation issues, with the help from 'Gemini 4 Hydrogen Thinking". No changes for math contents
fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2611.03527 ↗

Higher-order many-sorted categorial algebras are many-sorted algebras whose carriers are strict higher-order categories and whose operations are higher-order functors. They admit a homogeneous and a heterogeneous presentation, both by partial algebras whose operation domains are given by existence equations. To relate these presentations and their dimensions, we introduce generalized hep-derivors between hierarchical equationally partial signatures. A generalized hep-derivor selects carriers by existence equations in one variable and interprets operation symbols by terms, with operation domains evaluated recursively in the transformed algebra. Every generalized hep-derivor induces a functor between categories of many-sorted partial algebras. The values of this functor satisfy the domain conditions wherever their operations are defined, and we characterize when the operations are defined exactly where these conditions hold. The functor induced by a composite receives a natural inclusion from the composite of the induced functors; this inclusion, which can be strict, makes the induced functors a normal lax indexed category. In finite dimensions, generalized hep-derivors realize graduation and unification as an equivalence between the homogeneous and heterogeneous presentations, and discretization as a left adjoint to truncation. In dimension $ω$, we reconstruct the categories of $ω$-categorial algebras as projective limits of their finite-dimensional truncations and obtain unification by a quotient construction; we also establish algebraic squares and compatibility with change of signature. Finally, for nonempty sets of sorts, we show that the finite-dimension condition in the homogeneous $ω$-presentation is not axiomatizable by quasi-existence equations on its fixed signature.

comments
138 pages, 1 figure
fields
Category Theory
pdf ↗ page arXiv:2611.03553 ↗

In completely randomized experiments with heavy-tailed outcomes, a few units can carry a share of the residual variation that does not vanish as the number of units grows. In this setting, we study the studentized difference in means and Lin's regression-adjusted estimator under a design-based framework. The studentized statistic has a nonnormal limit in general. Populations with the same marginal distributions of potential outcomes can have different limits, as the limit depends on how the two potential outcomes of each dominant unit are paired. When the outcome errors are drawn from a heavy-tailed law, the limit is random and, outside a degenerate case, varies with the population. Under balanced allocation, the conventional Wald interval has an explicit asymptotic coverage floor. At the nominal level of $0.95$, the floor is about $0.42$ for every population and about $0.84$ when the two potential residuals of each unit are equal. Both floors are close to the best possible, and without balanced allocation, the coverage can fall to the smaller of the proportions of treated and control units.

fields
Statistics Theory
pdf ↗ page arXiv:2611.03561 ↗

We study the behaviour of the conjugate radius under the Ricci flow on complete noncompact manifolds. We show that if $(M^n,g(t))_{t\in[0,T]}$ is a complete Ricci flow with nonnegative scalar curvature at $t=0$, the initial metric is parabolic and not scalar-flat, and the Einstein tensor $\mathrm{Ric}-\tfrac12 Rg$ is bounded above, then parabolicity is preserved along the flow and the conjugate radius of $g(t)$ is finite for every $t\in[0,T]$. As an application, we prove that a complete noncompact gradient shrinking Ricci soliton whose volume growth is subquadratic, in the sense that $\liminf_{r\to\infty}\Vol(B(p,r))/r^2=0$, has finite conjugate radius.

comments
8 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.03823 ↗

The Onsager–Machlup functional of a probability measure is a generalisation of the negative logarithm of the probability density function, defined precisely using the ratios of masses of balls in the limit of vanishing radius. It plays an important role in several areas of applied mathematics because its minimisers can be understood as modes of the measure. We show that the Onsager–Machlup functional of the angular central Gaussian measure on the unit sphere $\mathcal{S}$ of an infinite-dimensional Hilbert space—i.e., the radial projection of a centred Gaussian measure with covariance operator $C$---is constant on the finite-dimensional subsphere of $\mathcal{S}$ spanned by the eigenvectors of leading eigenvalue under $C$, and takes the value $+\infty$ elsewhere. We discuss the consequences of this extreme concentration of mass for maximum a posteriori estimation in Bayesian inverse problems with an angular central Gaussian prior.

comments
15 pages
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2611.04781 ↗

We study the least pole order of a rational function whose nonzero evaluations scale a prescribed code to a Euclidean LCD code. A residue-one differential yields an obstruction for odd-dimensional one-point AG codes in characteristic two: for $C=C_L(D,aQ)$ with $0\le a<n$ and odd dimension, the threshold is at least $n+2g-a-1$. The obstruction uses alternating Gram matrices and does not require the scaled code to be self-orthogonal. For the dimension-three codes $C_L(D,(r+1)Q)$ on Hermitian curves over $\F_{r^2}$, $r=2^e\ge4$, we obtain \[ n+2g-r-2\leτ_D(C;Q)\le n+2g-3. \] Consequently the leading genus contribution is asymptotically sharp even in dimension three. On the elliptic curve $y^2+y=x^3$ over $\F_4$, we prove the exact dimension-three threshold $6$ by an explicit multiplier. For repetition codes on the Hermitian family, the threshold equals the general interpolation bound $n+2g-1$. The upper bounds use information sets and hold for $q>3k$, and for $q>2k$ in characteristic two.

comments
All comments are welcome
fields
Algebraic Geometry, Information Theory
pdf ↗ page arXiv:2611.04863 ↗

Distribution shifts, including covariate shifts, are ubiquitous in real-world applications of machine learning. Empirical evidence suggests that, across a variety of models with and without downstream adaptation, ensembles tend to be more robust to covariate shift than single models. We extend the theory of covariate shift severity from single models to ensembles, providing theoretical justification for the empirical trends. We introduce new discrepancy measures of covariate shift severity to control the risk of partition-based kernel estimators. We then show that with sufficient ensemble size, these models can achieve minimax-optimal risk convergence rates under covariate shift. Our results suggest that modelers can expect to need larger ensemble sizes for more severe covariate shifts.

comments
29 pages, 3 figures
fields
Statistics Theory
pdf ↗ page arXiv:2611.05195 ↗

In this note we prove a simple generalization of cohomology and base-change which seems to be missing from standard sources. We illustrate its usefulness by providing an alternative proof of a result of Ishimura on descent of vector bundles along blowups at a smooth center.

comments
7 pages, mistake corrected and some references added
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.05209 ↗

Dantzig–Wolfe reformulation strengthens the linear relaxation of a mixed-integer program by convexifying constraint families, and each candidate costs a column generation run. The choice is hard when families strengthen the bound only together, as in classical lot-sizing, network-design, and facility-location formulations. We prove that when an evaluation convexifies at most $s$ of $k$ families, methods that observe only bounds need of order $k^w$ evaluations to find a hidden group of $w$ families in the worst case. A prediction missing $e$ members reduces this to $Θ(k^e)$ through a staged search that need not know $e$. The orders extend to several groups, prices, and growing evaluation costs. We study two predictors: a lookahead at an optimal LP dual, which vanishes on groups whose families share no variable, and language models reading the model, verified by the staged search in JointDW. Such groups appear in three of ten MIPLIB-NL models whose bound can be improved and in all 59 benchmark instances. Given the coefficients of constructed models with up to 16 families, one language model names a true group first in 249 of 252 answers. On the benchmark instances, decompositions chosen by language models from the text solve faster than those of GCG's detector.

comments
69 pages, 5 figures, 31 tables. Code and data: https://github.com/junbolian/JointDW
fields
Optimization and Control
pdf ↗ page arXiv:2611.05726 ↗

Let $d_1,\dots,d_m$ be directions in $\mathbb{R}^k$, where $k\ge 2$. A multiset $X$ of $n$ points of $\mathbb{R}^k$ projects to the $m$ multisets of numbers $\{\{x\cdot d_j : x\in X\}\}$, or equivalently to the $m$ sorted lists of these numbers. How many directions are needed for these projections to determine every multiset of $n$ points? Two simple bounds are known in every dimension: more than $(k-1)\log_2 n$ directions are always needed, and $(k-1)n+1$ directions in general position always suffice. In the plane much more is known: Matousek, Privetivy and Skovron showed that almost every choice of $O(\log n \log\log n)$ directions suffices. Whether anything similar holds in higher dimensions was left open by Dym, Wellershoff, Tsoukanis, Levy and Balan. We observe that two lemmas of Hair and Sahai, proved for list recovery of random linear codes, answer that question, and by tightening their argument we show that in every dimension almost every choice of $(4k-2)\ln(2n)\ln(k\log_2 2n)+k+1$ directions suffices. For $k\le 10$ this beats the linear bound once $n$ is larger than about 100: for example, 144 directions suffice for multisets of 1000 points in the plane, and an exact computation lowers this to 133. Letting some of the random blocks in their argument fail removes a factor $\log k$: almost every choice of $O(k\log n\log\log n)$ directions suffices, uniformly in $k$ and $n$. We also show that $2k-1$ directions never determine three points, so that the logarithmic lower bound is not tight; that every $m$ directions in the plane fail on some pair of multisets of size $O(1.65^m)$, improving the bound $O(1.80^m)$ of Matousek, Privetivy and Skovron; and that for each $k$, $m$ and $n$, either almost every choice of $m$ directions works or almost none does.

comments
30 pages, 5 figures. v2: added word "any" to title, improved a bound following comment from ZM26, added three small special cases, removed unicode from an anc file, and added a statement about deep sets
fields
Combinatorics, Information Theory
pdf ↗ page arXiv:2611.06470 ↗

We present LeanVOA, a Lean 4 library for the theory of vertex operator algebras (VOAs), together with a companion book that sets each formalized result next to its textbook statement. The library constructs the Moonshine module $V^\natural$ and proves, with no hypotheses, the Conway-Norton moonshine conjecture for every automorphism of $V^\natural$ (Borcherds' theorem), along Borcherds' route through the Monster Lie algebra. It identifies $\mathrm{Aut}\,V^\natural$ with a formal model of the Monster taken from the AxiomMath library for the classification of finite simple groups. A companion project on Lean v4.35 imports that library's generation theorem for the model and proves, with no hypotheses, that $\mathrm{Aut}\,V^\natural$ is isomorphic to the model, compatibly with the Griess algebras, and that moonshine holds for every element of the Monster. It also formalizes Zhu's modular invariance, Huang's tensor categories with the Verlinde formula, the Gannon-Rayhaun classification of $c=1$ VOAs, and classical freeness of the boundary admissible $L_k(\mathfrak{sl}_2)$ (Arakawa-Dai) and of the minimal models $M(2,2m+3)$ (van Ekeren-Heluani). It also contains new results: graded first-order rigidity of all Virasoro minimal models and of $L_k(\mathfrak{sl}_2)$ at every admissible level; classical freeness of $L_{-3/2}(\mathfrak{sl}_3)$, and of the other members of the Deligne series under stated assumptions; and a proof that graded unitarity of the boundary admissible $L_k(\mathfrak{sl}_2)$ implies that of the minimal models $M(2,2n+1)$. The library declares no axiom of its own. This note announces release v1.06.

code
github.com/Fedor-Popov/Lean_VOA ∎ Lean project (lakefile.toml, lean-toolchain) is too large to build within the check's time limit at 013a799, checked 2026-11-12 build details
comments
5 pages. Code and short version: https://github.com/Fedor-Popov/Lean_VOA (v1.06); book: https://fedor-popov.github.io/Lean_VOA-book/. v1.06: moonshine proved unconditionally
fields
Quantum Algebra
pdf ↗ page arXiv:2611.06616 ↗

We consider the deterministic oracle complexity of finding a $(δ,ε)$-Goldstein stationary point of a Lipschitz function under constraints. Our main result concerns products of convex bodies. Each block contains an inner ball and lies in a concentric outer ball. The inner radii have a common positive lower bound, and each outer radius is at most a fixed multiple of the corresponding inner radius. This class includes common constraints such as balls and boxes. On each prescribed feasible set of dimension $d$ in this class, every deterministic algorithm using a local oracle needs $\exp(Ω(d))$ objective-oracle calls in the worst case at fixed, sufficiently small accuracies $δ$ and $ε$. The objective Lipschitz and initial objective-value gap bounds are fixed, and each constructed function has a global minimizer in the interior of the feasible set. For broader classes of constraints, supplementary results show that every deterministic algorithm needs $Ω(ε^{-2})$ objective-oracle calls in the worst case when $d\gtrsimε^{-2}$ and $δ\lesssimε$. The constants depend on the interior-ball radius and, for inequalities, the local Lipschitz and Slater bounds. These supplementary results cover closed sets that are star-shaped with respect to a ball and convex coercive inequalities with a Slater point, and hold even for convex objectives.

comments
29 pages, no figures. Substantially revised, with a new exponential lower bound for set-constrained Goldstein stationarity, revised results for inequality constraints, and comparisons of constrained stationarity criteria. References updated
fields
Optimization and Control
pdf ↗ page arXiv:2611.06739 ↗

Mahjong is a traditional tile-based game popular in East and Southeast Asia. Combinatorial study of Mahjong hands has been a topic of interest in recreational mathematics, with the Nine Gates hand being a well-known example. This single-suit Mahjong hand $\{1,1,1,2,3,4,5,6,7,8,9,9,9\}$ consists of $13$ tiles of a single suit ranked $1$ through $9$, arranged such that drawing any tile from that suit completes a winning hand of a pair and $4$ melds, regardless of the tile's rank. Folklore has circulated that Nine Gates is the unique single-suit hand with this $9$-sided-wait property. While prior works have verified this uniqueness by exhaustive computer enumeration across different finite configurations, we present a general classification of full-sided waits for Mahjong variants with $3n$ ranks and $n+1$ melds. For every $n\geq2$, we report exactly $8$ full-sided waits, of which Nine Gates is the unique live one that respects the $4$-copy bound. Notably, our proof requires no exhaustive enumeration or any prior knowledge of the classification result. To address the problem in its right generality, a comprehensive combinatorial framework is developed, allowing the number of ranks, the number of melds, and the upper bound on tile multiplicities to vary independently. The reliability of our results is partially supported by a manually curated ongoing formalization in Lean 4.

code
github.com/sun123zxy/ninegates-lean4 ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at e45fd51, checked 2026-11-17 build details
comments
19 pages, 5 tables. Lean 4 formalization: https://github.com/sun123zxy/ninegates-lean4 . Interactive visualization: https://sun123zxy.github.io/ninegates-viz/ . Typos corrected, references added
fields
General Mathematics
pdf ↗ page arXiv:2611.06944 ↗

We introduce the notion of an oriented $\vee$-system which gives a class of solutions of the oriented associativity equations generalising Veselov's $\vee$-system solutions of WDVV equations. An oriented $\vee$-system is a special configuration of pairs of a vector and a covector in a linear space. We show that the class of oriented $\vee$-systems is closed under taking subsystems and restrictions. We provide examples which include a multiparameter family related to imprimitive complex reflection groups.

comments
24 pages, minor changes
fields
Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2611.08326 ↗

We determine the dimension of the space of $\mathfrak{sl}(2)$-invariant (n)-ary differential operators on weighted densities for arbitrary weights, including the singular cases in which the usual elimination procedure breaks down. The proof relies on the strong Lefschetz property established by Stanley \cite{s} and Watanabe \cite{w}. We also investigate the corresponding problem in the super case.

fields
Differential Geometry
pdf ↗ page arXiv:2611.08418 ↗

We consider polar foliations of codimension two on compact simply connected irreducible symmetric spaces. In rank at least two, we prove that these foliations are hyperpolar, settling the remaining case of the hyperpolarity problem discussed by Lytchak. We show that, for irreducible spherical Coxeter quotients, the horizontal universal cover fails to be a spherical building precisely on the Cayley plane, where every such foliation is congruent to one of the two known homogeneous models.

comments
22 pages. Revised and expanded version. Improved exposition and clarified proofs, with updated references and a discussion of related independent work
fields
Differential Geometry
pdf ↗ page arXiv:2611.08480 ↗

We study the Hausdorff dimension of proximal planar self-affine sets whose defining maps have diagonal or anti-diagonal linear parts, with both types present. Such systems are irreducible but not strongly irreducible. Under a projective exponential separation condition, we show that the Hausdorff dimension equals the minimum of $2$ and the affinity dimension, thereby extending the dimension formula of Hochman–Rapaport to all proximal irreducible planar systems. When the affinity dimension is at most an explicit threshold determined by the Lyapunov exponents, the formula holds assuming only that there are no exact overlaps. Above the threshold, it holds under the strong open set condition. These dimension formulae are proved by approximation with finite diagonal subsystems. Assuming projective exponential separation, we also determine the pointwise dimensions of the coordinate projections of the equilibrium state. Below the threshold, the projections are not exact-dimensional: the pointwise dimension of each exists almost everywhere and takes exactly two values, each on a set of positive measure. At or above the threshold, both projections are exact-dimensional with dimension one.

comments
58 pages, 2 figures, v2: Included reference to Palomar upload
fields
Dynamical Systems
pdf ↗ page arXiv:2611.09066 ↗

We establish strong convergence rates for a fully discrete approximation of the one-dimensional stochastic Burgers equation driven by additive rough noise $(-A)^αdW$, $0\leα<1/4$, below the critical roughness threshold $α=1/4$. Through the Cole–Hopf transformation, the nonlinear equation is converted into a linear stochastic heat equation with spatially correlated multiplicative noise, which is discretized by a spectral Galerkin method in space and an accelerated exponential Euler method in time. A numerical approximation of the original solution is then reconstructed through a scale-invariant regularized inverse Cole–Hopf transformation. The convergence analysis combines strong Sobolev error estimates with strict positivity and uniform inverse-moment bounds for the exact transformed solution. Under an initial approximation condition and a weak-$L^4$ tail assumption on the transformed initial datum, we obtain the spatial strong convergence rates arbitrarily close to $1/2-2α$ and a temporal rate of order $1/2$, up to a logarithmic correction. For $0\leα<1/4$, the spatial rate is essentially sharp within the spectral Galerkin framework, the temporal rate is independent of the roughness parameter $α$, and we prove a converse estimate showing both the necessity of the initial approximation condition and the weak-$L^4$ tail of the initial datum.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.09135 ↗

In this paper, we investigate both two-sided and one-sided \(2\)-nice recurrence within the framework of weakly mixing measure-preserving systems. As our principal result, we establish an exact spectral characterization for the failure of two-sided \(2\)-nice recurrence: namely, a subset \(R\subseteq\mathbb N\) fails to possess this property if and only if there exist a continuous symmetric probability measure \(σ\) on \(\mathbb T\) and a constant \(\varepsilon>0\) satisfying \[ 2\widehatσ(n)+\widehatσ(2n)\leq-\varepsilon \qquad(n\in R). \] Our proof of the necessity relies upon a complement-symmetrized correlation identity, whereas the converse is achieved through a construction involving a stationary Gaussian system, a bounded odd observable, Hermite expansions, and an independent Bernoulli extension. Furthermore, we extend this characterization to three-point polynomial configurations as well as to actions of countable abelian groups. In addition, we derive an unconditional analogue in which arbitrary symmetric probability measures take the place of continuous ones, thereby demonstrating a strict separation between the ergodic and weakly mixing classes of recurrence. Subsequently, we turn our attention to the distinction between two-sided and ordinary one-sided \(2\)-nice recurrence. It is shown that a suitable negative spectral condition compels the failure of one-sided recurrence. More remarkably, we construct an explicit weakly mixing system wherein the quadratic spectral expression remains uniformly positive, yet the presence of a negative cubic correlation still induces a one-sided recurrence deficit. Consequently, it follows that two-point spectral data alone are insufficient to govern one-sided \(2\)-nice recurrence.

comments
It is an updated version of previus submission
fields
Dynamical Systems
pdf ↗ page arXiv:2611.09143 ↗

We investigate the large-time behavior of nonnegative solutions to the time-fractional nonlinear diffusion equation $\partial_t^α(u-u_0) = Δu^m$, $0<α<1$, $m>0$, in a bounded domain with the homogeneous Dirichlet boundary condition. We prove that the rescaled solution $t^{\fracα{m}}u$ converges as $t\to\infty$ to an asymptotic profile $S$ characterized by $-ΔS^m = u_0/Γ(1-α)$. Moreover, we show that $t^αu^m$ converges to $S^m$, which admits an explicit representation in terms of the Green function and the initial datum. In contrast to the classical case $α=1$, the asymptotic profile depends explicitly on the initial datum.

comments
30 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.09858 ↗

We study the standard form Integer Programming problem (IP) parametrized by the imbalanced circuit packing number. This number is $0$ if and only if $A$ can be transformed to a totally unimodular matrix by row operations, in which case (IP) is solvable in polynomial time. We show that if the constraint matrix represents a graphic matroid, (IP) is fixed-parameter tractable when parametrized by the imbalanced circuit packing number of the matrix. The proof combines an Erdős-Pósa property for edge-colored non-monochromatic cycles with a reduction to mixed-integer programming using few integer variables. In contrast, by a reduction from the parity potential problem, we show NP-completeness of feasibility of (IP) when the constraint matrix represents a cographic matroid, even if kernel of the constraint matrix is $2$-regular and imbalanced circuits pairwise intersect.

fields
Optimization and Control
pdf ↗ page arXiv:2611.11046 ↗

We give a framework for transporting vectors along Markov processes that may have jumps, without assuming a manifold or other specific geometric structure. We prove existence and uniqueness of the resulting transport. In doing so, we develop a theory of vector bundles defined quasi-everywhere, in which the vectors live, and an axiomatic framework for energy forms that determine the bundle and the transport.

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

Pressure mass preconditioners for the incompressible Stokes equations can deteriorate on domains with narrow gaps. We develop a pressure preconditioner that uses the distance to the boundary to account for spatially varying geometric scales. Its application consists of a pressure mass solve and a weighted pressure Poisson solve, with the squared boundary distance as the diffusion coefficient. The theoretical basis is a distance-weighted pressure norm defined by splitting the pressure into an $L^2$ component and a component controlled by its weighted gradient. We prove that this norm is bounded by the negative norm of the pressure gradient on every bounded connected open set, with a constant depending only on the dimension. A reverse bound follows from the boundary Hardy inequality, giving norm equivalence uniformly over families with bounded Hardy constants. Two-dimensional finite element experiments on slender, perforated, and composite domains demonstrate stable performance across the tested geometric parameters and mesh refinements. The smallest eigenvalues of the preconditioned pressure Schur complement remain close to $0.54$, and block preconditioning with algebraic multigrid auxiliary solves requires about 20–30 FGMRES iterations across the geometric sweeps.

comments
20 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2611.11442 ↗

We prove that every finite soluble group whose Sylow subgroups have nilpotency class at most two is an involutive Yang–Baxter group ($\IYB$-group). This answers a question of Cedó and Okniński \cite{CedoOkninski2025}. The main method of the $\IYB$-structures has been reflected in \cite{MengBallesterJimenez2026}.

comments
10 pages
fields
Group Theory
pdf ↗ page arXiv:2611.11451 ↗

It is well-known that one can recover a function $f$ bandlimited to $[-δ,δ]$ ($0<δ<π$) from its finite oversampling data $f(j),-n+1\le j\le n$, with an approximation error exponentially decaying to zero as $n$ tends to infinity. Various regularized Shannon sampling formulas have been proposed to achieve such exponential approximation. A recent sinh regularized formula achieved so far the best rate $$ O(\frac1{\sqrt{n}}\exp(-(π-δ)n)). $$ We establish that the optimal recovery algorithm in the worst-case scenario achieves an approximation error $ρ_{n,δ}$ satisfying $$ \frac{c_*}{\sqrt{n}}(\tan\fracδ4)^{2n+1/2}\le ρ_{n,δ}\le \frac{C_*}{\sqrt{n}}(\tan\fracδ4)^{2n+1/2}, 0<δ\leqπ, n\geq1, $$ where $c_*,C_*$ are explicit positive constants independent of $n$ and $δ$. This result identifies the best possible exponential rate to reconstruct bandlimited functions from two-sided finite oversampling data. In other words, $$ ρ_{n,δ} \asymp \frac{\sqrt{\tan\fracδ4}}{\sqrt{n}}\exp(-c_δ(π-δ)n), $$ where $c_δ$ is strictly decreasing on $(0,π]$ and $$ \lim_{δ\toπ^-}c_δ=1,\ \lim_{δ\to 0^+}c_δ=+\infty. $$ For one-sided sample data $f(j)$, $-n+1\le j\le 0$, we also obtain the sharp approximation order of optimally recovering function values on $[0,1]$: $$ ρ_{n,δ}^-\asymp \sqrt{δ/π}\sin^n(δ/2),\ 0<δ<π,\ n\ge1, $$ which improves the celebrated result of H. J. Landau on extrapolation of bandlimited functions.

comments
26 pages, 2 figures. Expanded discussion of earlier work on one-sided recovery; added an extrapolation remark and contour figures; corrected the abstract and notation and streamlined proofs. The main sharp recovery estimates are unchanged
fields
Information Theory, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.11461 ↗

We study product-one invariants of finite metacyclic groups, with particular attention to metacyclic $p$-groups. For semidirect products $C_n\rtimes C_m$ such that $\operatorname{ord}_n(\ell)=m$ and $\operatorname{ord}_q(\ell)=m$ for every prime divisor $q$ of $n$, we give a short proof of the known formula for the small Davenport constant and determine the exact value of the $η$-constant. When $n=p$ is prime, we use Vosper's theorem to obtain a growth result for products of non-trivial conjugacy classes contained in $C_p$, from which we derive a block-saturation principle for product-one sequences. For split metacyclic $p$-groups, we determine the small Davenport constant in terms of the order and the exponent, and obtain bounds for the $η$-constant and the Erdős–Ginzburg–Ziv constant. The Davenport bound is also extended to finite nilpotent split metacyclic groups. Our approach relies in part on a general quotient-lifting principle for the three invariants $\mathsf d$, $η$, and $\mathsf s$. For non-cyclic metacyclic $p$-groups, this principle applies through the Frattini quotient, which is isomorphic to $C_p^2$. We further establish upper and lower bounds for the Erdős–Ginzburg–Ziv constant of arbitrary metacyclic $p$-groups, and show that both bounds are best possible within this class. The lifting method also provides a short proof of a known theorem of Han and Zhang for groups $C_m\ltimes C_n$ with $m\mid n$. Finally, we determine the Olson constant of the dihedral group $D_{2p}$, for every prime $p>3$, in terms of the Olson constant of $C_p$.

fields
Combinatorics
pdf ↗ page arXiv:2611.11628 ↗

Let $Φ:D^b(X)\to D^b(Y)$ be a derived equivalence between smooth projective complex varieties, and let $h=c_1(L)$ for an ample line bundle $L$ on $X$. For $z\in\mathbb C$, transporting the cup-product action and evaluating at $e^{zh}$ gives a homomorphism of graded algebras $Θ^\bullet_{F,z}:H^\bullet(Y,\mathcal O_Y)\to H^\bullet(X,\mathcal O_X)$, where $F$ is the cohomological transform of $Φ$. We prove that $Θ^\bullet_{F,i}$ is an isomorphism in degrees one and two. In particular, $X$ and $Y$ have the same number of holomorphic two-forms. The proof in degree two uses the Hodge-Riemann bilinear relations on $X$ and on $X\times X$. We also prove that being stably holomorphically symplectic is a derived invariant, where a smooth projective variety is called stably holomorphically symplectic if it is a direct factor of a smooth projective holomorphic symplectic variety. For derived-equivalent varieties in this class, we construct an isomorphism of rational homological motives as unital algebra objects. In particular, their graded rational cohomology algebras are isomorphic compatibly with the Hodge structures.

comments
V2 : revised and expanded version. Added a theorem on derived invariance of rational homological motives as unital algebra objects for stably holomorphically symplectic varieties. Proofs simplified and exposition improved
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.11708 ↗

When heat and solute both destabilise a rapidly rotating fluid, do their buoyancies add? Codensity models assume so, giving a straight onset diagonal; spherical shells show curved and kinked thresholds. We study the Busse-Simitev rotating annulus, whose normal modes obey an exact complex cubic dispersion relation. Combining the Bilharz criterion with the neutral-curve envelope yields, in the rapid-rotation limit, an explicit swallowtail wave front, in Arnold's sense, that bends the codensity diagonal into smooth and then kinked thresholds as the diffusivity ratio decreases. Its cusp edges lie inside the unstable domain and its exposed kink ends at the swallowtail singularity; these are singularities of wave-number selection, without coalescence of temporal eigenvalues, and the swallowtail diffusivity ratio has analytical small- and large-Prandtl-number limits. At a kink, broad, fast thermal and narrow, slow compositional Rossby waves become neutral together; hidden arcs mark the birth and merger of unstable wave-number bands. The same geometry enters nonlinear selection: mean-scalar feedback factors through neutral-arc normals and scalar responses, so the mean-profile coexistence margin is positive at every corner of the leading front and vanishes quadratically with the kink angle as the waves merge. Complete cubic coefficients predict robust coexistence at a reference corner and a narrow bistable interval near merger. Periodic-cell simulations away from merger confirm the coexisting waves and their invasion thresholds.

comments
29 pages, 8 figures. Expanded version incorporating the former supplementary derivations into the main text and appendices. Adds an explicit formula for the mean-profile coexistence margin and derives how it vanishes near the swallowtail. References updated
fields
Mathematical Physics
pdf ↗ page arXiv:2611.11719 ↗

Log-optimal e-variables at fixed horizons, also called numéraires, have been conjectured to ``almost'' form an e-process for exponential-family null hypotheses. A related open question is whether an e-process can attain the optimal e-power at every horizon up to a bounded loss. Given a final horizon, we study the minimax regret of e-processes relative to the numéraires at all times up to it. For the Gaussian location null and the composite alternative of Gaussian distributions with a smaller variance and an unknown location, we show that the minimax regret in the worst case over the location grows like the iterated logarithm of the final horizon. A single e-process attains this rate at every horizon. This growth answers the question negatively. It also refutes the conjecture if ``almost'' means a regret bounded uniformly over horizons. For this Gaussian location problem, we thus exhibit the frontier precisely: the minimax regret is bounded if and only if the alternatives have at least the variance of the null.

comments
Main difference vs version 1 is the construction of the optimal e-process: it is now invariant under permutations of the data, thanks to Peter Grünwald for prompting this improvement
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2611.11874 ↗

We introduce Forelli–Rudin-type integral operators on the open unit ball of \(\ell^2\). We completely characterize the boundedness of these operators between weighted \(L^p\) and \(L^q\) spaces for all \(p,q\in[1,\infty]\), as well as their membership in every Schatten class of operators between the corresponding weighted \(L^2\) spaces. We also establish trace formulas for these operators that cannot be obtained from their finite-dimensional counterparts by a formal passage to the limit as the dimension tends to infinity. Our results are not merely infinite-dimensional extensions of those obtained by Cheng, Fang, Wang, and the second author (2017), Zhao and Zhou (2022), and Ding (2022). Rather, they reveal new phenomena that are unique to infinite dimensions and arise from the fundamental geometric and measure-theoretic differences between finite- and infinite-dimensional spaces. A key ingredient in our proofs is the establishment of new Forelli–Rudin-type asymptotic estimates in infinite dimensions. These estimates also provide new insights into the development of function theory on the infinite-dimensional unit ball.

fields
Functional Analysis
pdf ↗ page arXiv:2611.11984 ↗

Direct-product spacetimes offer a tractable route to exact solutions in gravity theories beyond general relativity. We study $n$-dimensional direct-product spacetimes of $(m_1+m_2)$, $(2+m)$, and $(2+\ldots+2)$ type in linear gravity and general pure quadratic-curvature gravity, allowing the two-dimensional subspaces to have nonconstant curvature. We classify the resulting solution spaces and determine how the allowed geometries depend on the gravitational theory, the dimension, and the curvature couplings. Metrics containing two-dimensional part(s) of nonconstant curvature are governed either by algebraic conditions on a curvature profile, or, in one special class of quadratic gravity, by a differential equation. Relations governing metrics with only constant-curvature $m$ dimensional subspaces are purely algebraic. We compare the two considered theories and study relations between their solution sets. We further examine conformal relations, generalized Petrov types, and compatibility with electromagnetic sources. Four- and six-dimensional cases are analyzed in detail, and so is the Weyl squared action (that reduces to Weyl conformal gravity in $n=4$), as a particular example of quadratic gravity couplings. Explicit analytic solutions illustrating the resulting structure are presented whenever possible.

comments
26 pages, 11 tables, RevTeX4
fields
Mathematical Physics
pdf ↗ page arXiv:2611.12483 ↗

We establish the holomorphic dependence of the Calderón projector for the Helmholtz operator upon shape boundary deformations of a family of bounded Lipschitz domains in two and three spatial dimensions, with bounds explicit in the wavenumber and the size of the holomorphic extension. More precisely, after transporting the four boundary integral operators contained in the Calderón projector to a fixed reference boundary, we prove that the resulting parameter-to-operator maps admit bounded holomorphic extensions in their natural fractional Sobolev spaces. Unlike approaches that require boundary regularity of class $\mathscr C^{1,1}$ or higher, our argument traces the holomorphic dependence on the shape by transferring elliptic estimates to the boundary through the fundamental solution and the Dirichlet and conormal trace operators. This construction is the key step that allows us to treat Lipschitz-regular boundary deformations. Furthermore, we show that the domain of holomorphy can be chosen independently of the wavenumber $κ$, while the operator bounds in the corresponding fractional Sobolev spaces contain algebraic factors in $κ$ multiplied by $\exp(Cκδ)$. In particular, for real domains, corresponding to $δ=0$, our single layer estimate recovers, to our knowledge, the best available frequency dependence on general Lipschitz boundaries. For the double layer, adjoint double layer, and hypersingular operators, we obtain novel frequency-explicit bounds. The results proved in this work provide the analytic foundation for frequency-explicit uncertainty quantification, model order reduction, and high-dimensional approximation of boundary integral operators, their Galerkin discretizations, and the resulting boundary densities and quantities of interest on families of parametrically varying boundaries.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.12659 ↗

This paper solves a problem (SP) attributed to Solovay in the 1960s, which is to add an unbounded sequence to a singular cardinal $κ$ without adding bounded subsets to $κ$, while preserving $κ^+$. The solution applies to any cofinality of the singular cardinal, with the assumption that $κ$ is a strong limit needed for the case of uncountable cofinality. Unsuccessful attempts to solve (SP), mostly for the countable cofinality, have appeared in published papers by various authors.

comments
After a helpful comment by Mohamammad Golshani, we were able to change and simplify the proof of Lemma 3.5, improving the theorem. The previous version of this lemma had a mistake which made it appear as if we needed to use ultrafilters, where only filters are needed (and the singleton filter suffices)
fields
Logic
pdf ↗ page arXiv:2611.12848 ↗

Localized interfaces, layers, and shocks can require high spatial resolution even when most of a partial differential equation (PDE) solution remains smooth. In global spectral methods, resolving these features requires increasing the approximation order across the entire domain. LegONet builds PDE solvers from reusable mechanism blocks, but its global coefficient representation faces the same limitation. We introduce Patch LegONet, which reuses pretrained mechanism blocks on smaller physical patches to resolve localized fine scales. The solution consists of a global background and local corrections. Mapping a fixed reference representation onto smaller patches increases local resolution without enlarging the blocks. The corrections join smoothly to the global background at patch boundaries. Differential operators are rescaled analytically to account for each patch's physical size. Nonlinear mechanisms are evaluated on the combined solution to include interactions between the background and local corrections. Patches can move, merge, or be removed during rollout while the pretrained patch blocks remain frozen. Six experiments on Allen-Cahn and viscous Burgers equations assess static, multiple, and moving patches in one to three dimensions. At comparable numbers of degrees of freedom, Patch LegONet consistently lowers the final relative solution error compared with global refinement. The reduction is approximately one order of magnitude in most tests. These results extend mechanism reuse across spatial scales and provide a practical route to local refinement in learned PDE solvers.

comments
29 pages, 7 figures. * Equal contribution: Jiahao Zhang and Junyi Wu contributed equally to this work
fields
Numerical Analysis
pdf ↗ page arXiv:2611.13205 ↗

Understanding when gravitational collapse produces a black hole remains a central challenge in general relativity. Black-hole uniqueness results characterize the stationary endpoint under suitable assumptions, while singularity theorems establish geodesic incompleteness in the presence of trapped surfaces and appropriate energy and global conditions. Neither, however, provides a general criterion for horizon formation. The hoop conjecture offers such a criterion by relating the enclosed mass to the compactness of a matter distribution in every direction. We construct axisymmetric families of initial data describing rotating dust and test a formulation of the conjecture adapted to this setting. We explore highly prolate and oblate configurations with both constant and differential rescaled angular-velocity profiles, including configurations near the threshold for apparent-horizon formation. We find that the conjecture holds for rotating configurations, with a coefficient within 14% of unity as in the nonrotating case, provided the quasilocal mass includes the rotational energy. If the irreducible mass of the apparent horizon is used instead, the deviations grow with spin, as they do for Kerr black holes. For horizonless configurations, the conjecture likewise holds when the mass is restricted to the energy enclosed by the matter surface, whereas using the ADM mass, which also includes rotational field energy outside the matter, leads to apparent violations of up to $\approx$25%. We also discuss the possible evolution of compact configurations without apparent horizons, their relation to weak cosmic censorship, and their implications for horizonless compact objects.

comments
50 pages, 12 figures, 10 tables; v2: References added and discussion expanded
fields
Mathematical Physics
pdf ↗ page arXiv:2611.13266 ↗

With single-copy measurements, every mixed fermionic Gaussian state on $m$ modes, pure modes included, is learned to trace distance $ε$ from $Θ(m^3/ε^2)$ copies, with no logarithmic factor, against the known $Θ(m^2/ε^2)$ for collective measurements. We prove the upper bound, resolving Conjecture 10.1 of arXiv:2609.23189 (lower bound for $ε\le1/3600$), and fill most open entries of the sample-complexity table of fermionic and bosonic Gaussian states, for single-copy, $k$-copy and collective measurements. With blocks of $k$ copies, the covariant highest-weight measurement of arXiv:2611.07271, read out through the Weyl-shift estimator, is exactly unbiased for every state; it gives $Θ(\max\{m^3/k,m^2\}/ε^2)$ in Frobenius norm on all states and in trace distance on every class at a fixed distance from the pure boundary. The gain $1/k$ ($k\le m$) away from the pure boundary, against $1/\sqrt k$ on cold number-conserving states, is therefore attained. Learning a quadratic fermionic Hamiltonian in Frobenius norm from its Gibbs state at bounded $β\|h\|$ has the same rate. For bosonic Gaussian states with bounded covariance, any displacement and squeezing, and occupations $n_1\le\dots\le n_m$, $O((m^2+r^3+\sum_{i,j>r}1/(n_i+n_j))/ε^2)$ single-copy measurements suffice, $r$ the largest index with $r\,n_r\le2$; this is the minimax rate on dyadic-interval classes, with no spectral gap or cold-mode count assumed, and holds with no covariance bound for displaced passive states. With no bound on energy or squeezing, non-Gaussian measurements learn centred one-mode states, mixed included, from $O(ε^{-2})$ and centred pure $m$-mode states from $O(m^2/ε^2)$ single copies, free of the $\log\log E$ term of Gaussian measurements, and $m$-mode states from $O(m^3/ε^2)$ copies, entangled only in a first round on blocks of $4m+6$.

comments
140 pages, 2 figures, 2 tables. v2: adds Corollary 9.1 (learning a quadratic fermionic Hamiltonian from its Gibbs state, with single-copy, k-copy and collective rates), a reading of the cold bosonic rows for arrays of cold sensors, and citations; theorem numbering unchanged
fields
Mathematical Physics
pdf ↗ page arXiv:2611.13428 ↗

For any real number $x$, let $\|x\|$ denote the distance from $x$ to the nearest integer, and let $α$ be any irrational number. We prove that there exist infinitely many $X$ such that for $Y=X^γ/2$ with $7/12<γ\le 1$ and $0<θ<\min \{(12γ-7)/24, 1/9\}$, there is a prime $p$ satisfying $$ \|αp\|<X^{-θ},\quad X-Y<p<X. $$ Moreover, we obtain an asymptotic formula for the number of such primes. In particular, if $α$ has a continued fraction expansion with bounded partial quotients, then this asymptotic holds for all sufficiently large $X$. Our result extends the admissible range of short intervals in the corresponding theorem of Baier and Roy from $2/3<γ\le 1$ to $7/12<γ\le 1$, reaching Huxley's classical range for primes in short intervals, and also improves the exponent $θ$ for $2/3\le γ\le 3/4$. The improvement is obtained by adapting a recent result of Maynard, Pandey, and Radziwiłł on exponential sums over primes.

comments
17 pages; comments are welcome
fields
Number Theory
pdf ↗ page arXiv:2611.13767 ↗

Summers and Werner proved that Bell inequalities are violated maximally and generically in the vacuum of a relativistic quantum field theory in [S. J. Summers and R. Werner, Commun. Math. Phys. 110 (1987), 247-259]. Their criterion concerns two-party case, that is, there are two algebras of quantum observables: one algebra and its commutant. In this case, the maximal CHSH value is converged to in every normal state exactly when the algebra is strongly stable. In the paper, we study the corresponding question for three and more mutually commuting von Neumann algebras. We focus on the multipartite Mermin inequalities instead of CHSH ones. For the tripartite Mermin functional we show that maximal violation in every normal state is equivalent to the existence of a common sequence of asymptotic GHZ stabilizers. Strong stability of each local factor is an necessary condition for maximal violation, and a joint embedding of an infinite GHZ tensor product is sufficient. Counterexamples show that strong stability and type III_1 of the individual algebras, even together with tripartite duality, do not suffice to arrive at the maximal violation. The results are also extended to n>=3 parties.

comments
20 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.13981 ↗

The time to solution of an iterative solver depends on the number of iterations and the cost per iteration. This paper develops algorithms that reduce both for elliptic problems discretized with high-order continuous finite elements on distributed GPUs, implemented in a unified matrix-free code supporting CUDA, HIP and SYCL. A distributed direct fast-diagonalization (FD) Poisson solver provides exact solutions on tensor-product meshes with direction-wise grading and coefficients varying along one coordinate direction. Its tensor data remain distributed, moved between slab layouts using collective transposes or kept in place by a Schur-complement approach. A two-level hybrid Schwarz preconditioner with FD cell solves (HS-FD) is extended to 2:1 hanging-node octrees with exact local cell inverses, while a p-multigrid preconditioner with Chebyshev–Jacobi smoothing (CJ-pMG) resolves hanging-node constraints at every level within fused kernels. Both approaches exploit FP32, where cell shapes and coefficients allow, within an FP64 conjugate-gradient iteration, adaptively select replicated or distributed coarse levels, support block solves for multiple right-hand sides and determine all parameters from the operator without case-specific tuning. Comparisons with Jacobi-preconditioned conjugate gradients (Jacobi PCG), MFEM, nekRS and deal.II span uniform, graded and octree meshes, layered coefficients, and four applications across NVIDIA, AMD and Intel GPUs. The direct solver is two to three orders of magnitude faster than Jacobi PCG on uniform meshes. HS-FD converges in 11 iterations for the generalised Poisson problem on octree meshes across 8 to 1024 MI250X graphics compute dies. These results provide practical guidelines for solver selection based on mesh structure and coefficient characteristics.

comments
69 pages (26 pages main manuscript, 43 pages Supplementary information)
fields
Numerical Analysis
pdf ↗ page arXiv:2611.14041 ↗

We give a sufficient condition for an affine complex curve to have an algebraic complex LNE model.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.14071 ↗

For a graph $G$ and $m\ge2$ dividing $e(G)$, the zero-sum Ramsey number $R(G,\mathbb Z_m)$ is the least $N$ such that every $\mathbb Z_m$-labeling of $E(K_N)$ contains a copy of $G$ whose edge labels sum to zero. We disprove the Bialostocki–Dierker asymptotic conjecture for forests by constructing trees for every sufficiently large edge count whose ratio of zero-sum to two-color Ramsey numbers has lower limit at least $554/553>1$. For powers of two $q\ge2$, we characterize all $s,k\ge1$ satisfying $R(K_{s,kq},\mathbb Z_q)=s+kq$ and prove $R(mK_{q,q},\mathbb Z_m)=2qm+m/\gcd(m,q)-1$ for every $m\ge2$. The packing upper bound combines Caro's transfer inequality with our spanning result and sharpens earlier bounds when $\gcd(m,q)\ge4$. The formula also gives exact values for counterexamples to Caro's defect conjecture, whose failure was already implicit in earlier work of Caro and Caro–Provstgaard. For every integer $m\ge2$ and every multiple $\ell$ of $m$ with $\ell\ge100m^3$, we also prove $R(C_\ell,\mathbb Z_m)=\ell+m/\gcd(m,2)-1$ for the cycle $C_\ell$ on $\ell$ vertices, determining the eventual value left by the bounds of Chi and He for even moduli $m\ge4$.

comments
17 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.14160 ↗

A new approach to discretise and solve Richards equation based on the finite element method (FEM) is presented. The novelty of the approach, called the Neural Physics method, is that it expresses the discretisation as a convolution neural network (CNN) whose weights are predetermined by the integrals of the basis functions in the FEM. The Neural Physics method is physically consistent as it represents a discretisation of the governing equation and can run on CPUs, GPUs and the latest AI accelerators, resulting in an increase in computational speed. The Neural Physics method is demonstrated for two different discretisations of Richards equation, including a multigrid method that is realised through a U-Net architecture. The accuracy and speed of these methods is tested on a problem with a known analytical solution and compared to a standard FEM, and shows that the Neural Physics method is almost an order of magnitude faster than a comparable FEM. Finally, the Neural Physics method is applied to a real-world test case with integrated experimental data and simulates the infiltration of water through a rain garden. This new approach therefore provides a route to efficiently and accurately solve Richards equation for a wide array of hydrological applications.

comments
36 pages (including appendix), 7 figures, 3 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2611.14562 ↗

The binary Goldbach ring over a field $k$ is the quotient of $R=k[x_p:p\text{ an odd prime}]$ by the relations $x_px_q=x_{p'}x_{q'}$ whenever $p+q=p'+q'$, with $\mathrm{deg}( x_p )=(p,1)$. We prove that if $g$ is a map from the odd primes to an abelian group and $g(p)+g(q)$ depends only on $p+q$, then $g(p)=g(3)+\frac{p-3}{2}(g(5)-g(3))$ for every odd prime $p$. This settles Kátai and Phong's conjecture on shifted prime arguments and proves, for odd primes, the affine classification they conjectured for binary sums. The universal group of binary prime relations is free of rank two. We obtain a minimal bigraded free resolution from compatible resolutions of finite truncations and determine the growth of its linear Betti numbers in two regimes. For fixed monomial degree $d\ge3$, as the Goldbach degree $n\to\infty$ through $n\equiv d\pmod2$, we prove $β_{d-1,n,d}\sim(d-1)T_d(n)/d!$, where $T_d(n)$ counts ordered representations by $d$ odd primes. Explicit Koszul cycles from common prime shifts span a positive fraction of this strand. For finite supports $\mathcal{A}_m=\{p\le m:p\text{ an odd prime}\}$, fix the homological degree $i\ge1$ and sum over all Goldbach degrees. As $m\to\infty$, the linear-strand totals are asymptotic to $i|\mathcal{A}_m|^{i+1}/(i+1)!$ when all binary relations on $\mathcal{A}_m$ are retained, and to $(1-2^{-i})|\mathcal{A}_m|^{i+1}/(i+1)!$ when only relations of common weight at most $m$ are retained. These leading estimates are uniform over fields. The interpolation theorem gives eventual depth at most two for the variable truncations; both truncation families have asymptotically maximal projective dimension.

comments
56 pages, 6 figures. The ancillary files contain the computational supplement
fields
Commutative Algebra, Number Theory
pdf ↗ page arXiv:2611.14580 ↗

We reconstruct smooth cubic fourfolds with a symplectic involution through classical interpolation of smooth plane conics from five distinct points, or four with their cross-ratio. If the quadratic coefficient map has rank three and the fixed cubic surface has trivial automorphism group, five polarized anti-invariant Jacobian factors of smooth Eckardt sections suffice, or four with their parameters. Both bounds are optimal. By contrast, in rank two we construct two-dimensional families of equivariantly nonisomorphic fourfolds with the same entire unparametrized Prym image. The factor family also has an integral projective Lagrangian closure in an associated OG10 compactification.

comments
16 pages, corrected typos and improved exposition, comments are still welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.14747 ↗

Let $I$ be a proper ideal in a standard graded polynomial ring $P$ with homogeneous maximal ideal $\m$. We show that there exists $k_0\in \mathbb{N}$ such that $\m^kI$ is Golod for all $k\geq k_0$. The smallest such $k_0$ is denoted $\mathrm{gt}_{\m}(I)$, and we call it the Golod threshold for $I$ over $\m$. We give an explicit formula for $\mathrm{gt}_{\m}(I)$ in the case when $I$ is a monomial complete intersection and bounds for $\mathrm{gt}_{\m}(I)$ for other classes of ideals. We also show that when $I$ is homogeneous, under a suitable degree condition, $\m^k I$ is Golod if and only if $k\geq \mathrm{gt}_{\m}(I)$, i.e., once Golodness is achieved, it cannot be lost. In the last section, we work in the setting of a regular local ring of dimension 3, and show that the product of any two proper ideals is Golod; this resolves a question posed by Dao and De Stefani \cite[Question 4.5]{dao2022monomial} and VandeBogert \cite[Question 4.11]{vandebogert2022products}.

comments
18 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2611.14876 ↗

In this short note, we calculate the spectra of gcd-graphs defined over a matrix ring. Using character sums, we show that this calculation can be reduced to certain counting problems. In particular, when the underlying ring is a matrix ring with coefficients in a finite field, we calculate these spectra explicitly. We will also show that two gcd-graphs over the same matrix ring are isospectral if and only if they have the same generating set.

comments
Added a new section on So's conjecture
fields
Rings and Algebras
pdf ↗ page arXiv:2611.15026 ↗

We study Anderson t-modules whose positive-degree coefficient matrices admit a flag-jump basis and extend the t-reduction algorithm to this setting. We prove that these t-modules are abelian, with motive rank equal to the sum of their jump degrees. If $Φ$ has jump degrees $j_1,\ldots,j_d$ and $deg_τΨ<\min_s j_s$, we compute the t-module structure on ${\mathbf{Ext}}^1_τ(Φ,Ψ)$, its subgroup ${\mathbf{Ext}}_{0,τ}(Φ,Ψ)$, and the associated exact sequence. The construction allows nonzero nilpotent constant terms and includes the strictly pure case. When $Ψ$ is the Carlitz module, $N_Φ=0$, and all jump degrees are at least two, the construction yields a dual t-module. We give complexity bounds for the algorithms and implementations in SymPy and Mathematica.

comments
50 pages
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2611.15116 ↗

Reed-Solomon proximity gaps establish soundness guarantees for protocols that test received words through random combinations. For length-$n$ codes over $\mathbb{F}_q$, classical scalar combiners achieve error $O(n/q)$ in the unique-decoding regime, with larger known bounds near the Johnson radius. We prove smaller error bounds using affine combiners, which combine two received words $f,g$ as $f(x)+(α+βx)g(x)$, where $α,β$ are independent uniform elements of $\mathbb{F}_q$. For output degree bound $d=ρn$, fixed $ρ\in(0,1)$ and $0<η<1-\sqrtρ$, and sufficiently large block length $n$, we prove mutual correlated agreement (MCA) with one coordinate of agreement loss at threshold $A=\lceil(\sqrtρ+η)n\rceil$, with error $O_{ρ,η}\left(\frac{1}{q}+\frac{n^2}{q^2}\right)$. The result holds over arbitrary evaluation domains in every finite field, including prime and binary extension fields. The agreement threshold can approach the Johnson threshold, beyond unique decoding. For $q\ge n^2$, our error is $O_{ρ,η}(1/q)$, an asymptotic factor-$n$ separation from scalar combiners: we prove that their worst-case MCA error is $Ω_{ρ,η}(n/q)$ at the same agreement threshold and with the same one-coordinate loss. We also prove that affine combiners incur worst-case error $Ω_{ρ,η}(n/q)$ when no agreement loss is allowed. Thus one coordinate of agreement loss is necessary for our guarantee; this relaxation of standard MCA reduces the guaranteed common agreement fraction by at most $1/n$. We also extend the result to $k$-variate Reed-Muller codes on subfield grids, obtaining MCA error $O_{ρ,η,k}(q^{-k})$ for fixed $ρ,η,k$, sufficiently large $n$, and $q\ge n^{k+1}$, with agreement loss $n^{1-1/k}$.

fields
Information Theory
pdf ↗ page arXiv:2611.15128 ↗

Eisenbud and Schreyer proved that the cohomology table of a vector bundle $F$ on $\mathbb{P}^n$ is a unique positive combination of supernatural tables along a chain of root sequences. The slopes of the pieces, weighted by their ranks, form a concave polygon $Ψ_F$, the Boij-Söderberg polygon, with the same endpoints as the Harder-Narasimhan polygon $P_F$. We prove that $P_F\leqΨ_F$, in any characteristic, by testing subsheaves against sheaves with pure resolutions on thickened lines; the bound is optimal among bounds depending only on the ray of the table. The chain majorizes every other supernatural decomposition, and $Ψ$ is monotone under cancellations, hence upper semicontinuous in flat families. The comparison extends to coherent sheaves and, by linear projection, to sheaves of positive dimension. On $\mathbb{P}^2$ the defect is a sum of four cohomological terms; we characterize equality and show that the inequality survives the large volume limit of Bridgeland stability. For a smooth projective variety $X$ of dimension $n\geq2$ in characteristic zero, with $H$ ample and base-point-free, the mean normalized squared spread $G(\mathcal{E})$ of the roots in the cohomology table of every vector bundle $\mathcal{E}$ satisfies $G(\mathcal{E})\geq(K_X^2-2c_2(X))\cdot H^{n-2}/((n+1)H^n)$, a bound independent of $\mathcal{E}$. Since $G(\mathcal{E})=1$ exactly for arithmetically Cohen-Macaulay bundles, when this bound exceeds $1$ it is a uniform form of their absence.

comments
47 pages. v2: exposition reorganized and numbering changed with respect to v1; references added; Theorem E no longer assumes that beta is rational
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2611.15790 ↗

Let $h$ be the Hilbert norm on the real space $\ell_2(\mathbb{N})\oplus_2\ell_2(\mathbb{N})$, and put $q(u,v)=\sup_{i<j}|u_i+v_j|$. For each of Bollobás's additive norms $h+\varepsilon q$, $\varepsilon>0$, and for the quadratic norm $\sqrt{h^2+q^2}$, the norm formula $\lVert x+y\rVert$ is unstable on the renormed space and has no independence property in its complete theory. We approximate $q(x+y)$ uniformly on bounded Hilbert balls by truncating small coordinates. For $n$ fixed test vectors and thresholds, the number of threshold patterns of $q(x+y)$ as $y$ varies is bounded by a polynomial in $n$ when the support sizes of the test vectors and of $y$ are bounded. These estimates give finite fat-shattering dimension for the translates of $q$ at every positive scale. The norm formula on a space can be stable, unstable without the independence property, or have the independence property. We give an example in each of these three cases where the formula has the independence property in the complete theory, and an example in each of the first two cases where it lacks that property in the complete theory. All five spaces satisfy a common midpoint estimate for uniform convexity, and each admits an isomorphism to Hilbert space of distortion at most $\sqrt3$.

comments
Revised abstract and introduction, with citations to Lupini
fields
Logic, Functional Analysis
pdf ↗ page arXiv:2611.15930 ↗

We prove that the multiplicative complexity of the three-bit low-half multiplier is six, giving a structural, enumeration-free lower-bound proof valid against unrestricted nonlinear reuse in Boolean XOR-AND circuits. The value was first established by SAT searches of the first author and independently confirmed by the second author. An explicit six-AND circuit supplies the upper bound. The lower bound combines derivatives, quadratic products, complementary minors, and extraction modulo a Boolean ideal. Independent finite checks accompany the arguments. $\mathrm{MC}(M_3)=6$ is fully formalized in Lean 4, using only Lean's three standard axioms (propositional extensionality, choice and quotient soundness).

comments
21 pages, 1 table. The Lean 4 formalization and verification artifacts are linked in the paper (Appendix A)
fields
Combinatorics
pdf ↗ page arXiv:2611.15992 ↗

The goal of this paper is to start proving the Broué–Digne–Michel conjectures concerning the cohomology of Deligne–Lusztig varieties attached to roots of the full twist. The main result establishes that the $\mathrm{Ext}$-algebras of the cohomology complexes attached to roots of the full twist are concentrated in degree $0$. The main idea is to reduce the problem to a calculation in the Hecke category. The resulting argument is essentially topological and applies to all realizations of the Hecke category.

comments
28 pages, minor typos corrected
fields
Representation Theory
pdf ↗ page arXiv:2611.16017 ↗

We characterize the ideal theory of Buchholz for resolvent algebras in probabilistic terms. Regarding closed two-sided ideals as kernels of representations, we pass from representations to the Gelfand–Naimark–Segal representations of states, and describe the singular, trivially regular, and regular parts, which Buchholz gives through the one-particle space, by the behavior of the corresponding probability measures of the fields. On an isotropic subspace, the resolvent algebra is a commutative $C^{\ast}$-algebra whose states correspond to probability measures, and this correspondence carries the description further to sub-$σ$-algebras. Starting from Bose–Einstein condensation of the free Bose gas with its direct integral representation and from the treatment of the infrared singularity of the van Hove model, we connect the ideal-theoretic and the probabilistic arguments. Since the ideals carry physical information in these arguments, we show that the corresponding sub-$σ$-algebras and their inclusions carry this information in correspondence with the ideals.

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

We resolve Erdős Problem~521 by proving that the normalized real-root count $N_n/\log n$ of Rademacher polynomials almost surely has no limit. More generally, consider the Kac polynomials \[ P_n(x)=\sum_{j=0}^{n}ξ_jx^j \] with i.i.d.\ real coefficients of mean zero, variance one, and a finite absolute exponential moment. Let $N_n$ denote the number of distinct real roots of $P_n$. We prove that, almost surely, \[ \liminf_{n\to\infty}\frac{N_n}{\log n}=\frac1π, \qquad \limsup_{n\to\infty}\frac{N_n}{\log n}=\frac1π+C_*, \] and the set of subsequential limits is exactly \[ \left[\frac1π,\;\frac1π+C_*\right]. \] Here $C_*>1/π$ is a constant uniquely determined by an equation. The lower-limit identity remains valid under the weaker assumption that $\mathbb{E}|ξ_0|^{2+δ}<\infty$ for some $δ>0$.

comments
49 pages, no figure
fields
Probability
pdf ↗ page arXiv:2611.16157 ↗

Following Gábor Czédli, the \emph{congruence density} of a finite lattice $A$ is $\cd(A)=|\Con A|/2^{|A|-1}$, where $\Con A$ is its congruence lattice and $|A|$ is its number of elements. Czédli proved that density cannot increase under several kinds of sublattice extension and asked whether this holds for every sublattice inclusion. For a sublattice $S$ of $L$, we prove the stronger inequality $\cd(L)\leq2^{-d}\cd(S)$, where $d$ is the larger of the increases in the numbers of join-reducible and meet-reducible elements. The proof follows congruence labels along the chains into which prime intervals of $S$ split in $L$. We also prove that $\cd(L)=\cd(S)$ if and only if every element of $L-S$ is comparable with every element of $L$. The theorem of G. Czédli and L.~Szabó relating compatible quasiorders to pairs of congruences gives the corresponding quasiorder-density results.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.16165 ↗

We apply classical prime-power congruence criteria to two families of exponential series. For the Fibonacci numbers $F_n$, we characterize the polynomials $P\in\Z[T]$ for which $\exp(\sum_{n\ge1}P(F_n)x^n/n)$ has integer coefficients: this holds if and only if $P$ is even and $P(0)\equiv P(1)\equiv P(2)\pmod5$. In particular, $5$ is the least positive multiplier for each positive even power of $F_n$, and the series with weights $5F_n^{2k}$ has degree $5^{k-1}$ over $\Q(x)$ for $k\ge1$. For $R_n(y)\in\Z[y]$ satisfying $R_{pn}(y)\equiv R_n(y)\pmod p$ for every prime $p$ and every $n\ge1$, we prove that $H(x,y)=\exp(\sum_{n\ge1}R_n(y)^n x^n/n)$ belongs to $\Z[y][[x]]$ and that $A(x)=H(x,A(x))$ has a unique integral solution. For $q\in \Z$, taking $R_n(y)=q^n+y$ proves the conjecture in OEIS A163138; the Fibonacci result proves the conjecture in A207969 and A207970. For the implicit family with indeterminate $q$, the coefficient of $x^n$ has degree $n^2$, leading coefficient $1/n$, and nonnegative integer coefficients in the binomial basis, for every $n\ge1$.

fields
Number Theory
pdf ↗ page arXiv:2611.16283 ↗

In a nonergodic channel such as a slowly fading link, the channel law is drawn once and held fixed for the whole codeword, and the relevant performance measure is the $\varepsilon$-capacity. We study the $\varepsilon$-capacity regions of two-user mixed multiple-access channels (MACs) with finite alphabets, additive cost constraints and an arbitrary mixing measure. The direct parts are derived from a single information spectrum formula; the converse parts use, in addition, Fano's inequality and Ahlswede's strong converse applied to each component. Without knowledge of the realized component, we prove a single-letter inner bound for every $0\le\varepsilon<1$, in which one input serves all components; for $\varepsilon=0$ it is tight, and the capacity region is given by the essential infima of the component mutual informations. We prove a single-letter outer bound, the outage region, in which each component may use its own input; it holds with or without channel state information (CSI) at either terminal, and it is the $\varepsilon$-capacity region when the encoders know the component and the parameter space is countable. Both bounds coincide, in all four CSI scenarios, for well-ordered mixed MACs, which include degradedly ordered families and mixtures with a common optimal input, such as mixed additive MACs. Without CSI the outer bound can be strictly loose, and the no-CSI $\varepsilon$-capacity region for $0<\varepsilon<1$ remains open in general. Finally, we extend Ahlswede's strong converse to $K$ users with cost constraints and show that most of these results extend to $K$-user mixed MACs.

comments
27 pages, 2 figures
fields
Information Theory
pdf ↗ page arXiv:2611.16653 ↗

This paper, Part III of a series, treats $K$-user multiple-access channels (MACs). Its starting point is a pair of fundamental lemmas, a random-coding lemma of Feinstein type and a converse lemma of Verdú–Han type, which are the $K$-user extensions of the two lemmas underlying Han's information spectrum approach to the general two-user MAC. From them we derive the capacity region of the general $K$-user MAC with cost constraint and show that it contains the polymatroid capacity region of the $K$-user Gaussian MAC. We then prove, by an elementary information spectrum calculation that adapts a diffuse–exceptional subspace decomposition used in recent second-order converses for the Gaussian MAC, that for every subset $\cS$ of users and every independent input satisfying the power constraints, the conditional information spectral-sup rate of the $K$-user Gaussian MAC does not exceed $\frac12\log(1+P_\cS/N)$, where $P_\cS$ is the total power of the users in $\cS$, with a probability bound that does not depend on the input. Consequently, the strong converse for the $K$-user Gaussian MAC, in the sense that the error probability tends to one for every rate tuple outside the capacity region, follows directly from the converse lemma, without the wringing technique and without hypothesis-testing meta-converses. This strong converse was first established by Fong and Tan, whose per-blocklength bounds yield it, through wringing and quantization. It is the key ingredient in the converse parts of the coding theorems for mixed Gaussian MACs in Part I, where the $\varepsilon$-strong converse would not suffice.

comments
13 pages, 0 figures
fields
Information Theory
pdf ↗ page arXiv:2611.16664 ↗

Using quartic Gauss sums in place of the cubic Gauss sums in OpenAI's original proof, we prove that the Dedekind $ζ$-function $ζ_{\mathbb Q(i)}(s)$ of $\mathbb Q(i)$ has no zeros in the half-plane $\Re s>599/600$, thereby obtaining the same zero-free half-plane for the Riemann $ζ$-function.We obtain the upper bound for the smoothed sum by applying Poisson summation twice and using the functional equation of the quartic Kubota series of angular weight $1$.In the Mellin representation, a zero-density bound for the family of quartic characters controls the terms from nonprincipal characters,and a residue and a lattice average over fourth powers give the main term.

fields
Number Theory
pdf ↗ page arXiv:2611.16665 ↗

This paper was inspired by a post on Twitter and by the eight months the author spent at the AASS Centre at Orebro University in 2007. This phenomenon is interesting not only to a physicist, but also to someone like me working in control theory, because of its potential relevance to stabilizing drones and similar flying machines subject to random velocity fluctuations while hovering. A chain fountain can settle without an engineered controller, yet its natural height is selected by transport and boundary forces. We ask how an ideal boundary traction force can sustain a prescribed height or motion. Within an established three-state model, we connect feedback design to force and energy balances and derive sufficient conditions for nominal tracking that preserve the model's mechanical constraints. We also bound the deviations caused by bounded pickup uncertainty. The resulting framework explains how feedback can shape a naturally regulated process and identifies physical limits on the motions it can sustain: stabilizing a mathematical trajectory is useful only if the corresponding motion remains mechanically admissible. This is a preliminary step towards stabilization of the chain in three dimensions.

comments
61 pages, 16 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.16781 ↗

This paper investigates the global geometry of loxodromes and loxodromic curves on surfaces of revolution in $\mathbb{R}^3$. A loxodrome is a regular curve avoiding the poles and making a constant directed angle with the meridians. To allow curves to reach or pass through poles, we introduce loxodromic curves, whose pole-free interior portions are loxodromes. The directed azimuths of these portions agree modulo $π$. We classify surfaces of revolution into four types based on the number of poles and whether the profile curve is closed: cylinder-like, torus-like, paraboloid-like, and sphere-like. For cylinder-like surfaces, every maximal loxodromic curve other than a parallel is non-self-intersecting. For torus-like surfaces, nonparallel maximal loxodromic curves are closed or dense according to the rationality of their rotation numbers. For paraboloid-like and sphere-like surfaces, only maximal meridians can pass smoothly through poles, while nonmeridional, nonparallel maximal loxodromic curves have poles as endpoints. We derive the differential equations for arc-length-parametrized loxodromes and introduce coordinates in which they are represented by straight lines. We solve the direct and inverse problems for loxodromic segments on all four surface types and give criteria for maximal loxodromic curves to be geodesics. We show that diffeomorphisms preserving maximal loxodromic curves preserve surface type and that their inverses preserve such curves. These maps preserve maximal meridians and parallels on surfaces with poles, but need not do so on pole-free surfaces. We characterize azimuth-consistent diffeomorphisms and, for cylinder-like surfaces, establish criteria for conformality and isometry. In particular, azimuth-consistent diffeomorphisms are conformal when both surfaces have poles.

comments
43 pages, 5 figures, 4 tables
fields
Differential Geometry
pdf ↗ page arXiv:2611.16810 ↗

We obtain a criterion for the uniqueness of addition in Schrödinger Lie algebras, applicable to both bijections and injections. This allows us to construct the first example of a Lie algebra with unique addition and a non-trivial center over a field of characteristic zero. Furthermore, a necessary and sufficient condition is established for the Schrödinger algebras to have bracket width one.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.16812 ↗

A method is presented for margin-inducing optimal guidance and control with application to atmospheric entry. The method induces margin in state inequality path constraints during entry while simultaneously retaining a large portion of the non-margin-inducing performance. The margin in the guidance trajectory is based on a differentiable approximation of the maximum of a continuous function. This differentiable approximation is derived from the Kreisselmeier-Steinhauser (KS) function, where the KS function is defined for a function over sampled data. The KS function is first modified into a weighted form where the data points and weights are associated with a multiple-interval Legendre-Gauss-Radau quadrature. This weighted form is then shown to be an approximation of a logarithmic integral. This smooth approximation of the maximum function is then used to formulate a margin-inducing optimal control problem, and this margin-inducing optimal control problem is re-solved at specified guidance update times. The method is applied to a reusable launch vehicle atmospheric entry problem subject to heating rate and dynamic pressure constraints. It is found that the method of this paper produces a guidance trajectory that remains a significant distance from the path constraint limits while maintaining a large portion of the performance of the constrained optimal control problem.

comments
41 pages, 10 figures, 12 tables
fields
Optimization and Control
pdf ↗ page arXiv:2611.16891 ↗

In this paper, we study the properties of the real log canonical threshold $\text{rlct}(X,Y)$ associated with a pair $(X,Y)$ and the real log canonical thresholds with signs $\text{rlct}^{\pm}(f)$ associated with a polynomial function $f: \mathbb{R}^d \to \mathbb{R}$. In particular, we relate these invariants to other invariants arising from the theory of motivic integration. We also show how to compute these invariants in several particular cases, including the Newton non-degenerate case and the case of analytically irreducible plane curve germs.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.17004 ↗

Symmetry is a foundational principle of physics: the behavior of a PDE-governed system does not depend on the coordinate frame, unit system, or mesh used to write it down, and neither should a surrogate model. Yet today's leading neural surrogates lack these invariances and fail under simple transformations of the same problem: for models trained on PDEs of cars in one pose (i.e., translation and rotation), rotating the full PDE raises the surface-pressure error from 4% to more than 100%, and re-sampling its boundary raises it to about 30%. We introduce ISLA (Invariant Slice Attention), a slice-attention transformer for steady, boundary-driven PDEs. Because the boundary determines the interior solution, ISLA encodes the posed boundary once into learned slices and evaluates arbitrary interior points independently through a tree-accelerated learned boundary kernel. Inputs are nondimensionalized in scales computed from the boundary, sums over boundary cells are area-weighted quadratures that converge under mesh refinement, and geometry enters only as distances and relative angles to equivariant slice anchors, making the model equivariant to rigid motions and reflections up to optional token subsampling and tree clustering. On AeroZoo, 2,816 3D flows spanning diverse geometries, poses, physical scales, and boundary conditions, ISLA's mean reference-scaled velocity and pressure errors are at least 1.9 and 2.2 times lower than any baseline's. On full AirfRANS, ISLA is second only to an explicit boundary-integral network (GLOBE), with errors at least 1.6 times lower than Transolver's and GeoTransolver's in every field.

comments
49 pages, 14 figures, 27 tables. Companion paper to "AeroZoo: A Benchmark of Well-Posed Flow Problems for Foundation Models of Aerodynamics" (Sharpe et al., 2026, arXiv:2611.17152)
fields
Mathematical Physics
pdf ↗ page arXiv:2611.17141 ↗

A finite nonempty subset of the positive integers is first-order Schreier if the minimum element of that set is greater than or equal to the size of the set. We can generalize the first-order Schreier sets recursively to higher orders, and we specifically investigate the second-order Schreier sets. We show a combinatorial relationship between the count of second-order Schreier sets with minimum element $2$ and the index shift of a convolution of the Fibonacci numbers (given by Sequence A023610 in the OEIS).

comments
17 pages
fields
General Mathematics
pdf ↗ page arXiv:2611.17371 ↗

We show that a strong form of correlation decay in quantum Gibbs states has far-reaching dynamical consequences. For a smooth path of geometrically local commuting Hamiltonians whose Gibbs states satisfy strong decay of correlations, we construct $\mathrm{O}(1)$-time quasi-local Lindbladian evolutions exactly connecting these states in both directions, together with $\mathrm{O}(1)$-time quasi-local Hamiltonian evolutions exactly connecting their canonical purifications. These quasi-local connections strengthen previously known quantum-channel circuit constructions based on the decay of connected correlation functions [R. Ma, V. Khemani, and S. Sang, PRX Quantum 7, 033052 (2026)], which approximately connect states within the same phase but have depths that grow logarithmically with system size. Furthermore, if the Gibbs-state path contains a product state, we prove that the single-site Glauber dynamics has a $Ω(1)$ spectral gap independent of the system size throughout the path. This establishes Glauber-dynamics fast mixing for models that may violate the strong spatial mixing condition used in prior proofs, including (1) the $q$-state Potts model throughout the high-temperature phase for any $q$ and any finite dimension; (2) the Ising model with a longitudinal field at low temperature, with frustrating perturbations that destroy monotonicity of the dynamics; and (3) the three-dimensional $\mathbb{Z}_2$ lattice gauge theory at low temperatures comparing to a field perturbation, even though the model supports classical memories at intermediate temperatures. Intriguingly, we establish fast mixing of these classical Markov chains using tools from quantum physics like Lieb-Robinson bounds.

comments
35 pages, 6 figures. Minor corrections and clarifications; main results unchanged
fields
Mathematical Physics
pdf ↗ page arXiv:2611.17433 ↗

The aim of this note is to show that the existence of weak generators in the stable module category of a ring, or equivalently, of $p$-indigent modules in the terminology of Holston et al., depends on the underlying model of set theory.

comments
correction of Lemma 2.1; comments are welcome
fields
Rings and Algebras, Logic
pdf ↗ page arXiv:2611.17546 ↗

We prove an a priori obstruction to linear scattering for the massive Maxwell–Dirac system in three space dimensions. A global solution with nonzero charge cannot scatter linearly in $L^2$ if its full and homogeneous potentials are $O(t^{-1})$, and the homogeneous potential is $o(t^{-1})$ in compact timelike cones. No nonlinear asymptotic expansion is assumed in this non-scattering theorem. We also identify the exact leading interaction when the nonlinear current approaches a free Dirac current in $L^1$. Its coefficient is a positive quadratic form in the velocity density and is bounded below by the square of the charge divided by $4π$. The proof uses free Dirac asymptotics and an estimate for retarded source errors after pairing with a smooth free current.

comments
16 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.17595 ↗

In this paper, we propose an accelerated multiobjective gradient flow with implicit Hessian-driven damping for unconstrained convex multiobjective optimization problems in a real Hilbert space. The continuous flow is formulated as a system of two first-order equations involving only a single multiobjective projection operator and suitable time-scaling factors. Formally, it can also be expressed as a second-order system with explicit multiobjective Hessian-driven damping, which corresponds to the usual Hessian-driven damping introduced by Alvarez et al. [J. Math. Pures Appl., 81(8):747–779, 2002]. The first-order formulation, however, involves no Hessian term and can be regarded as an extension of the Hessian-driven Nesterov accelerated gradient flow by Chen and Luo [arXiv:1912.09276, 2019]. Assuming that the objective gradients are Lipschitz continuous on bounded sets and that the common lower level sets are bounded, we establish global existence in finite dimensions under suitable time-scaling conditions. An a priori energy estimate confines the solutions to a fixed bounded set, and a Lyapunov argument yields fast decay of a merit function and the KKT residual. Under an additional bound on the time-scaling factors, the trajectory of every global solution converges weakly to a weak Pareto point. Numerical tests illustrate the rapid residual decay and reduced oscillations.

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

We study the asymptotic behavior of the spherically averaged density $\widetilde ρ$ for fermionic bound states of the $N$-electron atomic Hamiltonian $H_{N,Z}$ with nuclear charge $Z$. For the density associated with an eigenfunction satisfying $H_{N,Z}ψ=Eψ$, we show that if the energy $E$ is below the bottom of the essential spectrum $Σ:=\inf\mathop{\rm ess. spec} (H_{N,Z})$, then $\lim_{r\to\infty}\frac{\ln \widetilde ρ(r)}{r} =\lim_{r\to\infty}\frac{d}{dr}{\ln \widetildeρ(r)} =-2α_0$, with $α_0=\sup\{α\ge 0\colon e^{2αr}\widetilde ρ\in L^1(\mathbb{R}_+,r^2dr)\}$. The same is true at threshold in certain cases. Moreover, we prove $α_0^2=Σ-E$ for the ground states of $H_{3,Z}$ with sufficiently large $Z$.

comments
19 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.17969 ↗

We study a capillary Orlicz–Christoffel–Minkowski flow on a non-obtuse spherical cap for $1\le k\le n-1$: \[ \partial_t h= \frac{h^2\varphi(\ell/h)}{f}\, \barσ_k(\nabla^2h+hσ)-h, \qquad \nabla_μh=\cotθ\,h. \] In the supercritical regime \[ a_\varphi(s)=\frac{s\varphi'(s)}{\varphi(s)} \ge k+1+δ, \qquad s a_\varphi'(s)\ge0, \] we obtain time-uniform $C^0$ and $C^1$ estimates and a closed scalar equation for the speed ratio. A dynamic Orlicz square-completion identity, combined with inverse-concavity, yields a viscosity estimate for the minimum principal radius. Under a strict dynamic Orlicz-convexity condition and \[ \frac{f_μ}{f}\ge\frac{n-k}{n}\cotθ, \] we prove time-uniform two-sided principal-radius bounds on every smooth existence interval for $0<θ\leπ/2$ and deduce long-time existence and smooth convergence to a stationary solution. The boundary regularity step uses a quantitative interior concave estimate through Neumann reflection and a concave uniformly elliptic extension. Under the weaker condition $(f\ell^{k-1})_μ\ge0$, strict convexity is preserved on every smooth existence interval. For $k=1$, the transformed scalar equation is uniformly parabolic for every $0<θ<π$. Classical parabolic estimates then give an all-angle scalar flow theorem, without asserting geometric convexity preservation in the obtuse range.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.18265 ↗

We study a capillary dual Orlicz–Christoffel–Minkowski problem on a spherical cap. For $2\le k\le n$, $1<p<k+1$, and $0<θ<π/2$, we consider \[ σ_k(\nabla^2h+hσ) = f(ξ)h^{p-1}\frac{ρ^{k+1}}{\varphi(ρ)}, \qquad ρ=(h^2+|\nabla h|^2)^{1/2}, \] with the capillary Robin condition $\nabla_μh=\cotθ\,h$. Assuming that $f$ is positive, smooth and horizontally even, $g=f^{-1/(p+k-1)}$ satisfies the capillary spherical-convexity and boundary compatibility conditions, and $H(r)=\varphi(r)/r^p$ is strictly increasing and proper with $Q_\varphi(r)\le k+1$, we prove the existence of a smooth, positive, horizontally even solution that is strictly capillary convex. The proof uses an Orlicz homotopy, uniform a priori estimates, a viscosity constant-rank argument when $k<n$, global oblique regularity, and degree theory.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.18287 ↗

We study the Capillary Orlicz–Christoffel–Minkowski Problem on an acute spherical cap. For $1\le k\le n-1$, the equation is \[ h\,\varphi(\ell/h)\,\barσ_k(\nabla^2h+hσ)=f, \qquad \nabla_μh=\cotθ\,h, \] where $\ell$ is the support function of the unit capillary spherical cap. For $1\le k\le n-1$, this includes the capillary Christoffel–Minkowski and capillary $L_p$ Christoffel–Minkowski problems; the same density formally recovers the capillary Orlicz–Minkowski endpoint when $k=n$. We organize the theory in five parts. After recalling the elementary symmetric functions and the capillary support-function formalism, we review the capillary Orlicz–Brunn–Minkowski framework and introduce the intermediate-order Orlicz $k$-mixed functional and its Euler–Lagrange equation. In the supercritical regime \[ a_\varphi(t):=\frac{t\varphi'(t)}{\varphi(t)}\ge k+1+δ, \] we derive uniform $C^0$, $C^1$ and $C^2$ estimates for positive $k$-admissible solutions. The same supercritical index produces a strictly coercive second variation and a spectral gap for the linearized Neumann operator. These facts lead to existence and uniqueness by a continuity method, quantitative stability of the solution map in both the datum and the Orlicz weight, and an open perturbative class of strictly convex non-power solutions. Under an additional capillary Orlicz-convexity condition on the datum, a full-rank argument upgrades the global admissible solution to a strictly convex capillary support function.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.18299 ↗

Over a finite-dimensional string algebra, higher extension dimensions may eventually vanish, become periodic, or grow without bound. We show how their behaviour can be read from a finite directed graph. Second syzygies split into uniserial modules from a finite family; their syzygies define a nonnegative integer matrix, so higher extension dimensions become weighted counts of walks. Only the part of the graph relevant to the chosen pair of modules contributes. This gives four growth regimes: eventual vanishing, periodicity, quasi-polynomial growth, and exponential growth. We derive the construction from projective covers, give explicit extension formulas over truncated cycles, and illustrate the growth regimes with examples.

comments
17 pages, 5 figures
fields
Representation Theory
pdf ↗ page arXiv:2611.18308 ↗

Get each issue by email →