Paperlane

no. 8 · from the archive← Tue 3 Nov archive Thu 5 Nov →

Wednesday, 4 November 2026

709 papers in 32 fields

Analysis of PDEs63

In this paper, we study the following critical fractional Schrödinger equation: \begin{equation} (-Δ)^s u+V(|y'|,y'')u=K(|y'|,y'')u^{\frac{n+2s}{n-2s}},\quad u>0,\quad y =(y',y'') \in \mathbb{R}^3\times\mathbb{R}^{n-3}, \qquad(0.1)\end{equation} where $n\geq 3$, $s\in(0,1)$, $V(|y'|,y'')$ and $K(|y'|,y'')$ are two bounded nonnegative potential functions. Under the conditions that $K(r,y'')$ has a stable critical point $(r_0,y_0'')$ with $r_0>0$, $K(r_0,y_0'')>0$ and $V(r_0,y_0'')>0$, we prove that equation (0.1) has a new type of infinitely many solutions that concentrate at points lying on the top and the bottom of a cylinder. In particular, the bubble solutions can concentrate at a pair of symmetric points with respect to the origin. Our proofs make use of a modified finite-dimensional reduction method and local Pohozaev identities.

comments
arXiv admin note: substantial text overlap with arXiv:2307.02272 by other authors
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2410.05271 ↗

In this paper, we establish the nonlinear stability of the Schwarzschild exterior for the spherically symmetric Einstein-massless Dirac system. More precisely, we consider sufficiently small perturbations of Schwarzschild characteristic initial data and prove that the corresponding maximal development remains globally controlled in the exterior region (orbital stability), and converges, in a suitable teleological double-null gauge, to a Schwarzschild spacetime with a final mass (asymptotic stability). In particular, the maximal future development contains a complete future null infinity and a regular event horizon, with a nonempty black hole region in its interior. The main difficulties in the proof arise from the delicate coupling between the Dirac operator and the geometry, compared with the scalar wave counterpart, as well as from the failure of the Dirac stress-energy tensor to satisfy a positive energy condition. To overcome these difficulties, we rely on a bootstrap argument coupling the geometry and the Dirac field. Working in suitable teleological double-null gauges adapted to the asymptotic null boundaries, we establish weighted energy estimates combining integrated local energy decay, red-shift estimates near the event horizon, and an rp-estimates towards null infinity. A core ingredient is the use of suitable reweightings of the spinor components, which allow us to close these estimates despite the nonlinear coupling to the geometry.

comments
79 pages, 10 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03708 ↗

We study the asymptotic stability and quantitative time-decay rates of rarefaction waves for one-dimensional $n\times n$ strictly hyperbolic systems of viscous conservation laws. While the nonlinear stability of rarefaction waves for $2\times 2$ systems was established by Xin \cite{Xin1988,Xin1989}, extending such results to general $n\times n$ systems presents additional difficulties arising from the possible coexistence of positive and negative transverse relative characteristic speeds and nonlinear interactions between distinct characteristic families. Moreover, establishing standalone $L^p$ energy estimates and explicit algebraic decay rates for general viscous systems without $L^1$ localization remains a significant challenge. In this paper, we establish both the global $H^2(\R)$ asymptotic stability and, for the first time, standalone physical-space $L^p$ energy estimates and explicit algebraic $L^p$ time-decay rates for weak rarefaction waves. Specifically, for every integer $p\ge 3$, we prove that the perturbation $U(t)-\bar{U}(t)$ around the smooth Burgers rarefaction profile $\bar{U}$ decays in $L^p(\R)$ at the rate \[ \|U(t)-\bar{U}(t)\|_{L^p}\le C_p\bigl(\|U_0-\bar{U}(0)\|_{H^2}^2+δ^3\bigr)^{1/2}(1+t)^{-\frac{1}{2}(\frac{1}{2}-\frac{1}{p})}, \] where $δ$ denotes the wave strength. Our proof combines a diagonal characteristic weight matrix that yields coercive rarefaction damping in all characteristic modes with directed wave-interaction functionals that exploit the strict separation of characteristic speeds to control nonlinear coupling between distinct characteristic families. These estimates lead to a closed $L^p$ Lyapunov inequality, from which the algebraic time-decay rates follow by the one-dimensional Nash inequality.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03732 ↗

With the aim of extending to parabolic equations the framework developed by the first three authors in [Dipierro, Savin, and Valdinoci, Rev. Mat. Iberoam. (2019)], we introduce a notion of (viscosity) solutions for the space-fractional heat equation modulo $k$. In turn, we are able to define $s$-caloric functions with polynomial growth at infinity, showing also related Schauder estimates, a Liouville-type result, and a stability property with respect to the $L^\infty_{\rm{loc}}$-convergence.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03840 ↗

We give new sufficient conditions for uniqueness of probability solutions to one-dimensional Fokker-Planck-Kolmogorov equations in the case where the drift coefficient depends on time.

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

We prove a sharp magnetic improvement of the family of weighted inequalities on the upper half-space $\mathbb{R}^{N+1}_+$ that interpolate between the Hardy inequality and the trace Hardy inequality. The magnetic potentials are of Aharonov-Bohm type, $\mathbf{A}(x)=|x|^{-1}\boldsymbol{a}(x/|x|)$, where the tangential field $\boldsymbol{a}$ may be singular on a closed subset of the sphere. We compute the sharp constant explicitly: it is given by the constant of the corresponding nonmagnetic inequality, evaluated in a virtual dimension that depends on the first eigenvalue of the magnetic Laplacian on the sphere. In particular, the magnetic trace Hardy constant strictly exceeds its Euclidean value whenever this eigenvalue is positive. The proof rests on a ground state representation of the deficit, which also shows that the sharp constant is not attained in the energy space. As a consequence, we obtain the sharp Hardy inequality for the fractional powers $(-Δ_{\mathbf{A}})^σ$, $0<σ<1$, of the magnetic Laplacian: the constant is the same on smooth functions supported away from the singular set and on the form domain of $(-Δ_{\mathbf{A}})^σ$, and it is not attained. Examples include the planar Aharonov-Bohm potential with nonintegral flux and, in dimension three, the Aharonov-Bohm potential and the Dirac monopole.

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

Self-propelled particles such as swimming micro-organisms often accumulate at boundaries. Active Brownian particles (ABPs), that is, particles moving at constant speed with an orientation undergoing rotational diffusion, provide a simple model. ABPs have a finite probability to be on the boundary. Their probability density therefore includes both regular bulk and singular boundary components. Exchanges between these represent capture at the boundary and re-entry into the bulk. We examine the distribution of ABPs in the stationary regime. We first obtain a similarity solution that describes the probability density near the turning points, where orientation is tangential to the boundary and particles re-enter the bulk. This shows that the bulk density is singular and the boundary density is non-differentiable. We then add spatial diffusion to the ABP model and investigate the limit $\eps \to 0$ of small spatial diffusivity. We use matched asymptotics to describe the regularising effect of a finite $\eps$, focusing on the vicinity of the turning points. We assess our predictions against numerical simulations using both lattice Markov chain and finite-element discretisations.

comments
23 pages, 8 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03865 ↗

We study the concentration of logarithmically interacting defects, such as Ginzburg–Landau vortices and screw dislocations, on closed curves in two dimensions, subject to a confining field. We prove that a measure supported on a smooth closed curve solves the mean-field transport equation exactly when, in Lagrangian labels, the curve moves with the negative induced velocity and each label keeps its mass. This contour law is a gradient flow of the mean-field energy. We prove that the gradient of the energy on a curve has a leading term proportional to the operator $|D|$ with Fourier symbol $|k|$, which prevents every smooth equilibrium curve from being a local minimizer, in a gradient-flow analogue of the Kelvin–Helmholtz instability of vortex sheets. In a radially symmetric case with quadratic confinement, we find an explicit circular equilibrium whose linearization is diagonal in Fourier modes, and we show that, as $N\rightarrow \infty $, the linear spectrum of the regular $N$-gon converges, mode by mode, to that of the circle. Finally, we compute a critical point on two concentric circles with lower energy than the single circle, indicating a rich family of multi-circle equilibria.

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

We prove a new, holomorphic version of the Lie-Trotter product formula for nonlinear local semigroups with a parameter. We show that the product converges to the solutions of a nonlinear evolutions equation with a parameter. The solution is holomorphic in time on a centered at zero conic set in the complex plane and depends continuously on the parameter, and analytically on the initial data.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03883 ↗

The large time dynamics of the weakly damped non-autonomous Korteweg-de Vries-Burgers equation \begin{equation*} u_t + u_{xxx}+ uu_x + λu - μu_{xx} = g(x,t) \end{equation*} in the phase space $L^2(\mathbb R)$ is investigated. Due to the low regularity of the initial data, the framework of Bourgain spaces is employed. We first obtain the existence of a unique pullback attractor $\{\mathcal A_μ(t)\}_{t\in\mathbb R}$ in $L^2(\mathbb R)$ for each $μ\ge 0$. Then we show an optimal asymptotic smoothing effect of the equation, namely the pullback attractor is compact in $H^3(\mathbb R)$. These results are proved by using an energy equation method, splitting solutions into parts with low and high frequencies and exploiting a dispersive regularization. Furthermore, the attractors are shown to be upper semicontinuous as $μ\to 0$ and have finite fractal dimensions in $H^1(\mathbb R)$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03905 ↗

We develop a new approach to studying discontinuity sets of measure-preserving convex gradient maps between nonconvex domains. Such maps optimize the Euclidean distance squared. Our idea is to introduce a new `phantom' optimal transport problem, that transports the missing mass from the convex hull of the target to the `excess' Monge–Ampère measure of the minimal convex extension of the Brenier potential. We show that the closure of the discontinuity set of the original map contains the support of this phantom target. Moreover, inside a planar source domain these two sets actually coincide; on $n$-dimensional domains they coincide $\mathcal{H}^{n-1}$-a.e. The Hausdorff exponent $n-1$ is sharp in every dimension $n\geq3$. For planar polygonal targets, we establish a quantitative global length bound for the closure of the discontinuity set depending only on the target geometry, valid for bounded positive densities.

comments
19 pages, 1 figure. Comments are welcome!
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.03950 ↗

Let $Ω\subset\mathbb{R}^N$ be a bounded open connected set, and let $q\in(1,2)$. We consider the sublinear $q$-eigenvalue problem for the Dirichlet Laplacian $-Δu=λ\|u\|_{L^q(Ω)}^{2-q}|u|^{q-2}u$, $u\in H^1_0(Ω)\setminus\{0\}$, whose first eigenvalue $λ_1(Ω)$ is simple, with eigenfunctions of constant sign. The definition of a second eigenvalue is not unique. Following the approach introduced by Molle and Passaseo for the linear Laplacian, we construct the first non-trivial curve of the corresponding Fučík spectrum, and show that it has a unique diagonal point $(γ(Ω),γ(Ω))$. The Fučík-selected second value $λ_2^F(Ω)=2^{1-\frac{2}{q}}γ(Ω)$ is strictly larger than $λ_1(Ω)$, admits a two-phase variational characterisation, and satisfies a sharp Hong-Krahn-Szegő inequality: among sets of given measure it is minimised by the union of two equal balls. The selected solution at the diagonal point is a classical $(2,q)$-eigenfunction exactly when its nodal $L^q$-masses are balanced. We finally show that on balls in dimensions $N\geq2$ every Fučík-selected solution is foliated Schwarz symmetric.

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

We study overdetermined boundary problems for the maximal surface equation with zero Dirichlet data and constant nonzero Neumann data . For the exterior of a bounded domain with connected boundary in $\mathbb{R}^n$, $n\geq2$, we prove that such domain must be the complement of a ball and the solution is radial. In dimension two, we also show that a positive solution on a domain bounded by a properly embedded noncompact connected curve forces the domain to be a half-plane and the solution to be affine. The proofs combine the divergence structure of the equation with the induced geometry of maximal graphs.

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

In this paper, we construct Feynman propagators on exponentially decaying perturbations of stationary spacetime with compact Cauchy surface. The propagators are defined as parametrices of the wave operator on exponentially weighted Sobolev spaces defined by complex contours $Γ$. We then apply this theory to the computation of indexes of Dirac operators using a continuous Wick-like rotation to relate it to the Riemannian case.

fields
Analysis of PDEs, Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2611.04133 ↗

We consider the Kuramoto-Sivashinsky equation $u_t+uu_x+u_{xx}+u_{xxxx}=0$ with $L$-periodic boundary conditions and zero spatial mean. We prove that every smooth solution satisfies $\|u(t)\|_{L^2}\leq CL^{5/6}+CL^{3/2}/t$ for $t>0$, where $C$ is a universal constant. In particular, $\|u(t)\|_{L^2}\leq CL^{5/6}$ for all $t\geq L^{2/3}$, independently of the initial norm.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04134 ↗

We develop a decomposition technique to investigate maps from the Dbar data to the derivative NLS potentials. We define a new integral operator which is equivalent to a modified Dbar problem relevant to the derivative NLS spectral problem, including the Kaup-Newell spectral problem, the Chen-Lee-Liu spectral problem and the Gerdjikov-Ivanov spectral problem. The well-posedness for the integral operator with the kernel $\mathrm{e}^{ik^2xσ_3}$ is discussed via the decomposition technique. Under different constraint conditions, the derivative NLS potentials are reconstructed via the Dbar data. We discuss the symmetry condition of the Dbar data as well as the compatibility of the derivative NLS spectral problem with the modified Dbar problem. We show that the maps from the Dbar data to the derivative NLS potentials are Lipschitz continuous.

comments
30 pages, 1 figure
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04135 ↗

A gas giant Riemannian metric $g$ on a compact $n$-dimensional manifold-with-boundary $M$ blows up at the boundary $\partial M$ at the rate $1/x^α$, for $α\in (0,2)$, where $x \in C^\infty(M)$ is a boundary-defining function. Such metrics arise in the modeling of acoustic waves in gaseous planets. De Hoop-Ilmavirta-Kykkänen-Mazzeo [arXiv:2403.05475] showed that, if $α> 2/n$, the Laplace-Beltrami operator $Δ_g$ is essentially self-adjoint and has discrete spectrum. Moreover, its spectrum is stable under truncations of $M$. The proof leverages the 0-calculus of Mazzeo-Melrose. We extend this theory by introducing a 0-transition calculus for studying families of 0-operators. We demonstrate a parametrix construction for $Δ_g$ that is stable under truncations. Using this, we study the behavior of the resolvent of $Δ_g$ under truncation and extend the characterization of the spectrum obtained by de Hoop-Ilmavirta-Kykkänen-Mazzeo. In particular, we prove that (on appropriate functional-analytic domains) simple eigenvalues admit asymptotic expansions in the truncation parameter $ε$ and that the corresponding eigenfunctions admit joint asymptotic expansions in $(ε, x)$.

comments
63 pages, 21 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04191 ↗

We prove local existence and uniqueness, propagation of Sobolev regularity, and continuation criteria results for the characteristic initial value problem for the 3D compressible Euler equations. This is the Cauchy problem with initial data given on a pair of transversally intersecting (acoustically) null hypersurfaces. The region of existence in our main theorem is a future-neighborhood of the union of the data null hypersurfaces, where the size of the neighborhood depends on various norms of the data as well as the structure of the data null hypersurfaces. We allow for any equation of state with positive sound speed, and we do not make any symmetry, irrotationality, or isentropicity assumptions. Our analysis relies on the geometric formulation of the flow derived in [Speck19], which decomposes the equations into a "wave-part" coupled to a "transport-div-curl" part. Compared to Rendall's celebrated solution of the characteristic initial value problem for wave equations [Rendall90], substantial new ideas are needed to handle the fact that the compressible Euler equations are more complicated than pure wave equations.

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

In this paper, we first establish a weighted bilinear fractional commutator estimate involving the spatial weight $\langle x \rangle^{2m}$. This estimate provides a powerful tool to resolve the difficulties arising from the nonlocality of the fractional Laplacian $(-Δ)^{σ/2}$ and the interaction between the unbounded weights and the nonlocal operator at infinity. We then apply this result to investigate the Cauchy problem for the fractional wave equation with time-dependent damping and source nonlinearity: $$ \begin{cases} \partial_t^2 u(t,x) + (-Δ)^{σ/2} u(t,x) + b(t) \partial_t u(t,x) = |u(t,x)|^p, & (t,x) \in (0,T) \times \mathbb{R}^N, \\ u(0,x) = \varepsilon u_0(x), \quad \partial_t u(0,x) = \varepsilon u_1(x), & x \in \mathbb{R}^N, \end{cases} $$ where $σ\in (0,2)$, the initial data scale with a small parameter $\varepsilon > 0$, and the time-dependent damping coefficient $b(t)$ satisfies $b(t) \approx (1+t)^{-β}$ for $β\in [-1, 1)$. Utilizing scaling variables and constructing a weighted energy framework based on Theorem 1.1, we derive a priori differential inequalities for the total energy. For the supercritical case $p > p_c := 1 + \fracσ{N}$, we prove the small-data global existence and uniqueness of strong solutions in weighted Sobolev spaces $H^{σ/2,m}(\mathbb{R}^N) \times H^{0,m}(\mathbb{R}^N)$ by closing a bootstrap argument. For the subcritical ($1 < p < p_c$) and critical ($p = p_c$) cases, we establish precise lower bounds for the lifespan $T_\varepsilon$ of blow-up solutions via delicate ODE analysis. Together with the corresponding upper estimates, our results fully determine the sharp lifespan estimates for all $β\in [-1, 1)$, confirming that $p_c = 1 + \fracσ{N}$ is indeed the critical exponent for the fractional wave equation with time-dependent damping.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04247 ↗

We establish the \(L^p\)-boundedness, \(1<p<\infty\), of the non-centered Hardy–Littlewood maximal operator associated with \(\ell^q\) balls, \(1<q<\infty\), for the non-radial exponential measure \[ dμ(x)=e^{-|x_1|-\cdots-|x_d|}\,dx \] in every dimension \(d\ge1\). This settles the higher-dimensional Euclidean case left open by Nowak, Sasso, Sjögren and Stempak, and extends their results to the full range \(1<q<\infty\). We also prove that these operators are not of weak type \((1,1)\) when \(d\ge2\). Together with the known results for \(q=1\) and \(q=\infty\) for the exponential measure, this gives a complete description of the \(L^p\)-boundedness and weak type \((1,1)\) behavior for all \(1\le q\le\infty\). {We also extend the strong \(L^p\)-boundedness to the Laguerre-type measures \(dμ_α(x)=\prod_{j=1}^d|x_j|^{α_j}e^{-|x_1|-\cdots-|x_d|}\,dx\) for all \(α_j\ge0\) and \(1\le q\le\infty\), and for the full range \(α_j>-1\) when \(q=\infty\).} {The main arguments rely} on geometric estimates for sections of \(\ell^q\) balls and a slicing argument.

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

We consider a two-well problem within geometrically linear elasticity, on a bounded Lipschitz set in dimension $n\ge 2$. We assume that the two wells are compatible through a symmetrized rank-one connection and that the displacement matches their average on the boundary, and we include a regularization based on the total surface energy. We show that there are two distinct regimes, with the energy scaling differently in terms of the surface-energy coefficient $\eps$: it is proportional to $\eps^{2/3}$ if there are two distinct compatible twin-normal directions, and to $\eps^{4/5}$ if there is only one. This matches previous findings in rectangles and other special geometries, mostly in two dimensions, and the lower bounds obtained by a Fourier method by Raiţă, Rüland, Tissot and Tribuzio (2024). Our results are obtained by explicit constructions, which contain a self-similar refinement of oscillations close to the boundary, and by a short real-space proof of the matching lower bounds.

fields
Analysis of PDEs, Mathematical Physics, Optimization and Control
pdf ↗ page arXiv:2611.04329 ↗

For every finite-dimensional simple Euclidean Jordan algebra $V$ of rank at least three, we realize the function $\operatorname{tr}(x^3)/|x|$ on its traceless subspace $V_0$ as a $C^{1,1}\setminus C^2$ viscosity solution of a uniformly elliptic equation $F(D^2 u)=0$ in $\mathbb{R}^{\operatorname{dim}V_0}$. This unifies and extends earlier constructions from Cartan isoparametric cubics, Hsiang minimal cubics, and traceless real symmetric matrices.

fields
Analysis of PDEs, Rings and Algebras
pdf ↗ page arXiv:2611.04378 ↗

We investigate the Steklov–Dirichlet eigenvalues on shell-type domains in $\mathbb{R}^n$, $n\geq 2$, where the Steklov and Dirichlet conditions are imposed on the outer and the inner boundaries, respectively. We introduce the Green function associated with the problem, which is well-defined for spectral parameters outside the spectrum and exhibits blow-up behavior at eigenvalues, and establish its spectral representation. We also examine its differentiability and derive its shape derivative under translations of the inner boundary. Using these results and a layer potential approach, we propose a computational framework for optimizing the eigenvalue with respect to the position of the inner boundary, incorporating an eigenvalue estimator for which a local error bound is established. Numerical experiments for various inner and outer boundary shapes demonstrate the effectiveness of the proposed approach in identifying configurations that maximize the first eigenvalue.

comments
28 pages, 7 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04410 ↗

For a bounded domain $Ω\subset\mathbb R^d$, the spherical average $E_Ω(R)=\int_{\mathbb S^{d-1}}|\widehat{\mathbb{1}_Ω}(Rω)|^2dω$ is never $O(R^{-a})$ with $a>d+1$, and for smooth boundaries it is $O(R^{-d-1})$, as it is for the ball, whether or not the boundary is curved. In 2003, Brandolini, Hofmann and Iosevich extended this to every convex domain and to every domain with $C^{1,\frac{1}{2}}$ boundary, and this regularity condition has not been improved since. How much regularity does the decay $R^{-d-1}$ require? We show that among Hölder classes the answer is $C^{1,\frac{1}{4}}$. Every bounded domain with $C^{1,\frac{1}{4}}$ boundary satisfies $E_Ω(R)\leq C_ΩR^{-d-1}$, while for every $0<s<\frac{1}{4}$ any smooth domain can be altered near a single boundary point to produce a $C^{1,s}$ domain for which this bound fails along a sequence of radii. More generally, when the boundary has fractional Sobolev regularity $W^{1+s,p}$, we determine the optimal decay exponent under a Dini condition on the normal, and in a large range of $s$ and $p$ without it. The upper bounds follow from $L^2$ estimates for nondegenerate oscillatory integral operators whose phases are distances between points of two graphs with Dini or fractional Sobolev gradients, and hence barely better than $C^1$. These are far too rough for the integrations by parts techniques from the smooth theory. We replace derivatives by finite differences adapted to the phase, a device that we expect to be useful in a variety of related problems.

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

In dimension $n\ge2$, a homeomorphism of $R^n$ preserving BMO space therein was proved to be quasiconformal, up to an orientation reversing reflection.

fields
Analysis of PDEs, Complex Variables
pdf ↗ page arXiv:2611.04451 ↗

Let $Ω$ be a bounded $C^1$ domain in $\mathbb{R}^d$, $d\geq2$. We establish vector-valued resolvent estimates for the Dirichlet Stokes system in $L^q(Ω;\ell^2)$ for every $1<q<\infty$. The estimates are uniform in the number and choice of spectral parameters in any fixed sector avoiding the negative real axis. These estimates imply that the Stokes operator is $\mathcal R$-sectorial of angle zero and has maximal $L^r$-regularity for every $1<r<\infty$. Our proof builds on the perturbation approach of Geng and Shen, with a different half-space argument to handle independently varying spectral parameters.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04464 ↗

In this paper we consider balance laws with measure-valued sources modeling commuters traveling along a road from residential to workplace locations. We introduce a notion of $(m_I, m_F)$-entropy solution, prove a compactness result for this class, and establish existence of solutions with prescribed spatial marginals for the sources representing the lodging and workplace distributions. Moreover, adopting a Lagrangian viewpoint, we describe commuting strategies as measures on Lipschitz curves with assigned entry and exit times, compatible with a given transport plan. Using the compactness result and a semi-discrete micro-macro scheme with source, based on the celebrated Follow-the-Leader model, we prove existence of admissible commuting strategies. Finally we prove the existence of optimal solutions for classical traffic cost functionals.

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

We study the spectral instability of small-amplitude Stokes waves in finite-depth flows with constant vorticity. A center-manifold reduction and the periodic Evans function give two explicit indices, one for long-wave instability near the origin and the other for an order-two resonance away from the origin. We prove instability when the low-frequency index is positive or the high-frequency index is nonzero, and obtain the leading expansions of the unstable spectral points. At low frequency, first- and second-order monodromy coefficients determine the leading figure-eight curve. At high frequency, we prove that the resonance exists uniquely and derive a limiting ellipse. An algebraic identity expresses the high-frequency index as a positive factor times the square of a real coupling coefficient. Thus every parameter pair with nonzero coupling gives high-frequency instability. The explicit formulas also permit a comparison of the two criteria in the parameter plane.

comments
44 pages, 2 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04509 ↗

In the context of heat conduction, the equations of Maxwell-Cattaneo is a successful alternative to the Fourier's law. In 2009, Christov proposed a frame-independent (or objective) generalization of Maxwell-Cattaneo equation. For a more general class of objective heat conduction Maxwell-Cattaneo-Christov equations proposed by Angeles, a uniqueness result is proved, applied to an incompressible fluid.

journal
Kinza Arshad, Martina Nunziata & Vincenzo Tibullo (15 Apr 2025): Uniqueness in an incompressible fluid with objective heat conduction model, Journal of Thermal Stresses
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2611.04516 ↗

We study positive radial singular solutions of $-Δu=f(u)$ in two space dimensions. Fujishima, Ioku, Ruf, and Terraneo constructed such solutions under asymptotic assumptions on $f$ and an additional convergence-rate condition, denoted by $(f_3)$. We prove their local existence result, with the same approximate solution and remainder estimate, under the original assumptions $(f_1)$ and $(f_2)$ alone. The proof combines a contraction on finite intervals with a nonlinear energy estimate uniform in the terminal point and requires only $C^2$ regularity of $f$ near infinity. We also obtain derivative asymptotics and, under additional global assumptions, a singular Dirichlet solution which solves the equation distributionally across the origin. An analytic oscillatory example satisfies our hypotheses but violates both $(f_3)$ and the derivative assumptions of Kikuchi and Kumagai. For every fixed finite iterate of the exponential of order at least two, we verify the hypotheses and quantify the remainder; condition $(f_3)$ fails for all iterates of order at least three.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04520 ↗

We study the spectral stability of small-amplitude Stokes waves with constant vorticity in infinite depth. We describe the spectrum near the origin and near the first nonzero double eigenvalue. For nonzero vorticity $ω<2\sqrt{g/3}$, where $g$ is the gravitational constant, the eigenvalues near the origin form a figure eight, whereas for $ω>2\sqrt{g/3}$ the local spectrum remains purely imaginary. Away from the origin, the interaction of two Fourier modes whose indices differ by two produces an unstable isola when $ω>-\sqrt{g/6}$, $ω\ne0$, and the resonant wave numbers are noninteger. This curve is a real analytic oval with an explicit leading ellipse and maximal growth of quadratic order in the amplitude. We also prove instability at the integer resonances needed to cover the remaining vorticities. Together with the classical irrotational result, these two mechanisms show that sufficiently small nonzero Stokes waves are spectrally unstable for every fixed constant vorticity. The proof uses finite-dimensional spectral reductions of the full Euler linearization. Near the origin, the finite-dimensional linearized operator has a one-sided limit as the Floquet exponent vanishes, which differs from the periodic linearization. We use the Kato transformation to construct a three-dimensional reduction with biorthogonal bases and use all three eigenvectors of the reference operator to calculate the Benjamin–Feir coefficient. At the nonzero collision, a real two-dimensional reduction and an explicit second-order calculation determine the unstable curve.

comments
50 pages, 1 figure
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04528 ↗

Starting from a fully three dimensional model of finite viscoelasticity in the Kelvin-Voigt rheology, we derive a bending model for thin, viscoelastic rods. For this, we utilize a formulation of the model as a time-dependent metric gradient flow and pass to the limit by establishing convergence of curves of maximal slope using $Γ$-convergence. A posteriori, we relate the metric gradient flow limits to gradient flows in Hilbert spaces and discuss their properties. In contrast to previous results, where limit deformations are infinitesimal, in the bending regime, we deal with large rotations. This prevents us from using an additive ansatz for the construction of recovery sequences. Instead, we adapt from a previous result by the authors a multiplicative ansatz for elastoplastic Cosserat rods to the viscoelastic setting. For regularization purposes, we consider strain gradient terms in the three dimensional model that vanish in the limit.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04584 ↗

We study the periodic homogenization of a stationary generalized Navier–Stokes system in a periodically perforated domain $Ω\subset\mathbb R^N$, $N\in\{2,3\}$, with a heterogeneous bulk stress of general Orlicz growth and an oscillating nonlinear Navier friction law on the pore walls, both at the Darcy scale. If the lower growth exponent at infinity satisfies $p^-_\infty>3N/(N+2)$ and the inertial exponent exceeds $κ_c:=1+N(2/p^-_\infty-1)_+$, inertia vanishes and, under strict monotonicity of the bulk stress, the whole family converges to the nonlinear Darcy law $U=\mathcal K(f-\nabla p_0)$, $\operatorname{div}U=0$, $U\cdotν=0$. The permeability map $\mathcal K$ is continuous, strictly monotone, obeys two-sided Orlicz bounds and incorporates the wall slip through a nonlinear cell problem, and the extended microscopic pressure converges strongly to $p_0$. The proof relies on a uniform Orlicz–Korn inequality, a Darcy-scaled two-scale trace theorem and a coupled bulk–surface Minty argument.

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

We study the sharp-interface limit of the two-dimensional incompressible Navier–Stokes/Allen–Cahn system with constant mobility and prove the existence of global integral varifold solutions to the coupled Navier–Stokes/mean curvature flow system. The limiting interface measure satisfies Brakke's inequality, and its normal velocity equals the sum of its mean curvature and the normal projection of the fluid velocity.

comments
any comment is welcome
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04631 ↗

A two-species aggregation-diffusion system on the one-dimensional torus with antisymmetric cross-interactions modeling pursuit-evasion dynamics is studied. The self-interaction strength is used as a bifurcation parameter, and the linear stability of the homogeneous state is characterized by Fourier analysis. It is shown that non-reciprocal coupling enlarges the stability region. In a symmetric diffusion setting, exponential convergence to the homogeneous state is established for sufficiently weak self-interactions by means of an entropy argument, with a decay condition independent of the cross-interaction strength. Under suitable nondegeneracy and spectral assumptions, the first loss of stability is shown to occur through a Hopf bifurcation associated with a single spatial Fourier mode. A branch of time-periodic patterns is thereby obtained, along which the two species oscillate with a fixed phase difference. An explicit formula for the cubic Hopf coefficient is derived, and an essential dependence of the direction and stability of the bifurcating branch on the second spatial harmonic is identified. In the case of matching diffusion coefficients and interaction kernels, sufficiently strong non-reciprocity is shown to transform a subcritical stationary instability of the corresponding reciprocal system into a supercritical Hopf bifurcation with stable periodic solutions. An exchange-of-stability result is proved, and the theory is illustrated for Kuramoto, two-mode cosine, and top-hat interaction kernels.

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

We study boundary observability for Dirichlet wave equations with symmetric, periodic coefficients in bounded $C^{2,1}$ domains of dimension $d\ge2$. We establish two-sided observability estimates, uniform in the oscillation scale $\varepsilon$, for initial data generated by eigenfunctions with eigenvalues at most $δ\varepsilon^{-4/3}$ with some small factor $δ$. The proof reduces wave observability to boundary gradient estimates for narrow spectral clusters. These estimates are obtained using a second-order expansion and a uniform commutator estimate for harmonic extension in boundary layers.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04661 ↗

We establish that any nontrivial anharmonic Fourier series with exponents quadratically close to the positive integers changes sign on each interval of length 2$π$.

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

The aim of this article is to derive a stochastic interpretation of the Water Waves equations, based on the location uncertainty principle (LU). Next, these equations are used to infer simpler models from scaling limits, such as the Saint-Venant, Boussinesq and Serre-Green-Naghdi ones. Once adapted to the stochastic setting, these models have been successfully implemented numerically, and we show several experiments to assess their properties -- for example the breaking of the wave symmetry, and the influence of time correlated noises.

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

This paper investigates the analytical properties of the principal eigenpair for the clamped transmission eigenvalue problem, which arises in the context of biharmonic (i.e. flexural wave) scattering by a clamped planar obstacle. By deriving a suitable Rayleigh quotient, we provide rigorous proofs for several fundamental properties that were previously only observed through numerical experiments. One of the results we have shown here is that the first eigenvalue is monotone decreasing with respect to the domain. Furthermore, we prove that the corresponding eigenfunction is of a single sign, a property analogous to the principal eigenfunction of the Dirichlet eigenvalues of the Laplacian. Another key result is a Faber–Krahn type inequality, establishing that the disk minimizes the principal eigenvalue among all domains of a given measure. The theoretical results are supported by a comprehensive numerical investigation.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04741 ↗

This paper is concerned with the inverse potential scattering problem for the three-dimensional fractional Helmholtz equation. For every $0<α<1$, we establish an increasing stability of determining the potential function from multifrequency exterior measurements of the scattered field. The stability consists of a Lipschitz data discrepancy and a logarithmic remainder that decreases when the upper measured wavenumber increases. The key ingredient in the analysis is to construct appropriate geometric optics solutions, which relate the X-ray transform of the potential to the measured fields. As a consequence, the stability is derived by applying analytic continuation. Two-dimensional numerical examples with noisy near-field data illustrate the benefit of enlarging the measured frequency band for three representative fractional orders.

comments
36 pages,4 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04749 ↗

We study forward and inverse problems for weakly viscous nonlocal wave equations with elastic term $(-Δ)^s u$ and dissipative term $(-Δ)^r\partial_tu$, where $0\leq r<s$. For time-dependent potentials in suitable $L^\infty(0,T;L^p(Ω))$ classes, we establish finite energy well-posedness, strong continuity in time, and an energy identity by parabolic regularization and time-regularization arguments. Under explicit nonlocality and nonresonance assumptions on the fractional orders, we prove Runge approximation in $L^2(0,T;\widetilde H^r(Ω))$ and hence in $L^2(Ω\times(0,T))$. As an application, partial exterior Dirichlet-to-Neumann measurements uniquely determine the potential in all three exponent regimes of the Runge theorem, including integer elastic orders with noninteger dissipative orders. The recovery argument combines equality of solutions with the same exterior input, unique continuation or the entanglement principle, and a single Lebesgue-space Runge approximation. It applies to the full admissible potential class, without spatial boundedness, sign, or smallness assumptions.

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

We study very weak solutions and Runge approximation for weakly viscous nonlocal wave equations with elastic term $(-Δ)^su$ and dissipative term $(-Δ)^r\partial_tu$, where $0\leq r<s$. For time-dependent potentials satisfying a smallness condition, we establish a transposition theory for sources in the dual of the natural space–time energy space. Under explicit nonlocality and nonresonance assumptions, we prove Runge approximation in $L^2(0,T;\widetilde H^s(Ω))$ and in $L^2(0,T;\widetilde H^s(Ω)) \cap H^1_0(0,T;\widetilde H^r(Ω))$. As an application, partial exterior Dirichlet-to-Neumann measurements uniquely determine a bounded, nonnegative, time-dependent coefficient in the nonlinear velocity damping term $q|\partial_tu|^{p-2}\partial_tu$ for $0<r<s$ and $2<p\leq 2+4r/n$. The proof establishes the small-amplitude response by energy estimates, weighted $L^p$ monotonicity convergence, and a linear Green identity, then applies adjoint Runge approximation followed by a forward velocity approximation in $L^2$. No smallness or positive lower bound is imposed on the nonlinear damping coefficient.

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

We prove a space-time analogue of the HWI inequality of Otto-Villani for controlled kinetic equations with a semiconvex confining potential. It bounds the time-averaged relative entropy by spatial and conditional velocity transport distances, the velocity Fisher information, an intrinsic action of the path, and a boundary term given by the time endpoint values of the Wasserstein current. The key step is a differential comparison inequality for the Wasserstein current, which captures the transfer of dissipation from velocity to position. Along the Langevin semigroup, this inequality yields a kinetic evolution variational inequality involving the second time derivative of the squared spatial Wasserstein distance and a damping term. Under a compatible spatial Talagrand's transport inequality, we obtain a boundary-free space-time logarithmic Sobolev inequality on every interval $[0,T]$, $T>0$, with the optimal $T^{-2}$ short-time scaling of the constant. As a consequence, we also establish entropy decay for every friction coefficient and every initial density of finite entropy, with optimal cubic order at short times and exponential decay at long times.

comments
36 pages
fields
Analysis of PDEs, Functional Analysis, Probability
pdf ↗ page arXiv:2611.04831 ↗

We show that the Dirichlet-to-Neumann map of the elastic wave equation determines the density and the anisotropic stiffness tensor on the boundary for generic density and stiffness tensor fields. The proof builds on an interplay between microlocal analysis and algebraic geometry. Microlocal analysis yields a construction of special solutions, valid for many real principal type systems, that concentrate near a boundary point. Generic conditions ensure that this construction holds and allow for extraction of information about stiffness tensor and density at the boundary. We also describe the generic sets through algebraic conditions.

fields
Analysis of PDEs, Algebraic Geometry
pdf ↗ page arXiv:2611.04856 ↗

We study the behaviour of the solution to the Navier-Stokes equations with vanishing viscosity and a no-slip condition in a periodically perforated domain. The behaviour depends on the particle size and the viscosity of the fluid. We prove convergence to a measure-valued solution, provided that the local Reynolds number is small, in the subcritical and critical regime. In the first case, the limit solves the Euler equations, whereas in the second case it solves the Euler-Brinkman equations. This extends the results of https://doi.org/10.1088/1361-6544/acfe56 for less regular limit functions. In particular, we also prove existence of measure-valued solutions to the Euler-Brinkman equations, along with weak-strong uniqueness.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04881 ↗

We give a penalization argument for splitting a continuous viscosity solution of two-sided Pucci inequalities into a solution of the same inequalities with zero boundary values and a function satisfying the homogeneous Pucci inequalities and with the same boundary data, settling an open question raised by Silvestre-Sirakov.

comments
8 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04882 ↗

We investigate the Bloch spectrum for transverse electric (TE) modes in a 2D high-contrast dielectric metamaterial. Our analysis focuses on the high-frequency regime where the propagating wavelength is commensurate with the microstructural period $d$, and the permittivity within the inclusions scales as $d^{-2}$. Using operator factorization and Sobolev space decomposition, we demonstrate that Bloch eigenvalues $ω^2$ can be analytically continued and represented as a power series in $d^2$. We establish a rigorous upper bound on the microstructural length scale $d$, defined by the inclusion geometry, under which this expansion remains valid. Furthermore, we provide a definitive proof for the opening of band gaps in the frequency spectrum for all periods below a critical length scale, i.e., for all $d < \overline{d}$. The threshold is explicitly characterized as a geometric function determined by the interaction between Dirichlet eigenvalues and the spectrum of the associated Neumann-Poincaré operator.

comments
21 pages, 3 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.04925 ↗

In this paper, we establish a universal approximation theorem for solution operators of semilinear stochastic heat equations in spatial dimension \(d\ge2\), extending deep neural operator approximation results to SPDEs with distribution-valued Gaussian forcing. A smooth Fourier cutoff reduces the forcing to finitely many measurements, while Besov and Schauder estimates control the resulting solution error. The finite-dimensional solution map is then approximated by ReLU branch networks together with grid-based trunk functions, yielding explicit bounds on the numbers of forcing measurements and trunk functions and approximation in every finite stochastic moment. For linear equations, the reduction coincides with truncation of the first Wiener chaos. Lastly, as an application, we prove a high-probability local-in-time approximation theorem for stochastic Navier–Stokes equations, with finite measurements of both the initial condition and forcing and an explicit sensing rate.

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

We study the obstacle problem for the evolution equation $\partial_t^αu+(-Δ)^s u=0$ in the whole space $\mathbb{R}^d$, where $\partial_t^α$ with $α\in(0,1)$ is the Caputo derivative in time and $(-Δ)^s$ with $s\in(0,1]$ is the fractional Laplacian in space ($s<1$) or the classical Laplacian ($s=1$). We prove that the problem has at most one bounded viscosity solution, and we obtain existence as the limit of an explicit monotone finite-difference scheme, which combines the L1 discretization of the Caputo derivative with powers of the discrete Laplacian. The scheme is also used to establish regularity estimates in space and time. We then study the large-time behaviour: solutions converge, along subsequences, to stationary solutions, and we identify the limit when the initial datum coincides with the obstacle (the minimal stationary solution) or has a limit $c_*$ at infinity. In the latter case the dimension plays a role, as a consequence of the recurrence of the underlying process: the limit is the unique stationary solution with limit $c_*$ at infinity if $d>2s$, and a constant (the maximum between $c_*$ and the supremum of the obstacle) if $d\le2s$. Numerical experiments in one dimension, based on an explicit stationary solution, illustrate the convergence of the scheme and the relaxation towards the stationary profile.

comments
46 pages, 2 figures
fields
Analysis of PDEs, Numerical Analysis
pdf ↗ page arXiv:2611.04971 ↗

Motivated by the analysis of recent models of dislocation motion in crystalline materials, this work introduces space-time varicurrents, a form of Young measures over integral currents, to describe their evolutions with rate-dependent dissipation potentials. This addresses the problem that rate-dependent versions of the (rate-independent) space-time variation suffer from a lack of lower semicontinuity with respect to the natural weak topology. This causes a dynamical relaxation to occur by means of infinitely fine oscillations. Varicurrents retain a description of this ``microstructure'' (in space-time) and, based on this theory, we are able to establish the existence of solutions to a rate-dependent gradient flow. This is in contrast to the classical formulation using integral currents, which does not have a solution in general.

comments
62 pages, 5 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.05005 ↗

Let $M$ be a closed star-shaped hypersurface in $\mathbb{R}^{n+1}$ and let $η=Hg-h$ be the first Newton transformation of its second fundamental form. For a fixed constant $α>0$ and $2\le k\le n-1$, we study the prescribed sum Hessian curvature equation \[ σ_k(λ(η))+ασ_{k-1}(λ(η))=f(X,ν). \] Under the natural admissibility condition \[ λ(η)\inΓ_{k-1}\cap \{λ:σ_k(λ)+ασ_{k-1}(λ)>0\}, \] we establish a global curvature estimate for closed star-shaped solutions with a general positive right-hand side depending on the position vector and the unit normal. A key point is that the sum Hessian operator is nonhomogeneous; the resulting lower-order term in the maximum-principle calculation is controlled by a partial curvature estimate. We also use the augmented-variable identity \[ σ_k(λ)+ασ_{k-1}(λ) =σ_k(λ_1,\ldots,λ_n,α) \] to recover the relevant ellipticity and concavity properties. As an application of the a priori estimates, we prove existence and uniqueness for the corresponding prescribed curvature problem under suitable spherical barrier and radial monotonicity assumptions.

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

We study homogeneous Dirichlet heat flows for real symmetric, uniformly elliptic divergence-form operators. We establish quantitative stability of singular sets near homogeneous harmonic polynomials and eigenfunctions. Based on these, in the smooth coefficient case, we prove the spatial singular set at sufficiently large time is codimension-two and has a uniform measure upper bound independent of time. However, this codimension-two property fails in the Lipschitz coefficient case. On a three-dimensional ball, we construct a fixed self-adjoint operator and a heat flow consisting of two eigenmodes whose singular sets contain two-dimensional disks at a sequence of times tending to infinity.

comments
30 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.05053 ↗

Modeling the nonlinear acoustic wave propagation in biological tissues needs accuracy, especially in ultrasound imaging and therapeutic applications. The 1D Westervelt equation, \( p_{xx} - p_{tt} + γ\, p_{ttt} + η\,(p^{2})_{tt}=0, \) could be used to describe a finite-amplitude ultrasound propagation in these tissues. This equation accounts for nonlinearity, \(η\), and attenuation, \(γ\). To solve this equation, we observe that traditional solvers may struggle to do so correctly. This is due to the difficulties arising from the nonlinear nature of the equation. We solve the equation by defining three synthetic cases - linear (\(η=0.001\), \(γ=10^{-6}\)), shock-dominated (\(η=0.02\), \(γ=10^{-6}\)), and dissipation-dominated (\(η=0.01\), \(γ=5\times10^{-4}\)) - and using Physics-Informed Neural Networks (PINNs) to showcase the solution. A sinusoidal activation function is used to capture the oscillatory behavior of the problem. The results of our study, with PDE residual converging to at least \(10^{-6}\), boundary condition loss to \(10^{-5}\), and the PINN loss converging to \(10^{-5}\) for each case at \(30,000\) epochs, show that \(γ\) scales the rate of amplitude decay, while \(η\) governs frequency-dependent phase speeds.

comments
17 pages, 21 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2611.05130 ↗

We study the symmetry, uniqueness, and nondegeneracy of positive solutions to the Choquard equation $-Δu+u=(I_α*u^p)u^{p-1}$ in $\mathbb{R}^N$, which have long remained open problems. For $N\geq3$, $α\in(0,N)$, and $\frac{N+α}{N}<p<\frac{N+α}{N-2}$,we prove that every positive $H^1$-solution is radially symmetric and strictly decreasing in the radial variable. The symmetry proof relies on the moving-plane method, where the sublinear singularity is controlled by analyzing the far-field behavior of the nonlocal term. Uniqueness and nondegeneracy are established through a functional framework hinging on a nonnegative joint form and a Schur complement argument.Radial nondegeneracy and Morse index one are obtained by ruling out the spectral interval $(0,p-1]$ via a strict cumulative Riesz identity, which leads to uniqueness through a Nehari two-well argument. Nondegeneracy in the full space $H^1(\mathbb{R}^N)$ follows from the spherical-harmonic decomposition of the linearized form. These results hold for the full range of $p$ when $α=2$, and for $p\geq2$ when $α\in(2,N)$. The cases $α\in(0,2)$ and $α\in(2,N)$ with $p<2$ remain open.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.05138 ↗

For the two-dimensional incompressible Navier-Stokes equations with Navier friction on a smooth, bounded, simply connected domain, we establish strong vorticity convergence along a subsequence in the vanishing viscosity limit for initial vorticity in $L^p$ with $p>1$. The friction coefficients may grow as viscosity vanishes under an explicit growth restriction depending on $p$, which includes regimes of vanishing slip length. The main challenge, even for viscosity-independent friction, is to control the vorticity generated at the boundary. We split the vorticity into contributions from the initial data and the boundary. By combining renormalization and estimates for the normal velocity near the boundary, we show that the boundary contribution vanishes in the inviscid limit. As a consequence, the limiting Euler solutions conserve kinetic energy.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.05212 ↗

We consider the inhomogeneous Landau equation and focus on solutions whose density and temperature evolve in time but remain spatially homogeneous. Such solutions are called homoenergetic. We identify one class of initial data for which homoenergetic solutions exist globally in time, and another class for which they develop finite-time hydrodynamic singularities. The initial data are spatially inhomogeneous, neither close to vacuum nor close to equilibrium; both the well-posedness and the finite-time blow-up results hold for all soft and hard potentials.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.05236 ↗

We investigate the effect of constant vorticity on the modulational spectral stability of small-amplitude periodic gravity waves for the two-dimensional finite-depth water-wave system. We derive an explicit stability criterion that agrees with the prediction obtained by Thomas, Kharif and Manna [43] through a nonlinear Schrödinger approximation. For waves propagating to the right, we identify a sharp range of dimensionless positive (counterclockwise) vorticity, for which modulational instability is suppressed at every depth, while at any fixed depth sufficiently strong negative (clockwise) vorticity also restores modulational stability. We give a complete description of the spectrum near the origin and identify a figure-eight spectral curve in the unstable regime. A key distinction from the irrotational case is that the usual Hamiltonian factorization of the linearized operator fails at zero Floquet exponent on the full periodic Sobolev space. We therefore carry out a spectral reduction based on reversibility, without relying on Hamiltonian factorization.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.05237 ↗

We study anisotropic Minkowski-type curvature flows associated with a perimeter defined through oscillations on Wulff neighbourhoods. The anisotropy may be non-smooth, and in particular crystalline, while the mobility may differ from the anisotropy, provided a natural compatibility condition is satisfied. We compute the first variation of the perimeter and introduce a weak formulation in terms of distance functions and measure-valued nonlocal Cahn-Hoffman fields. By means of a nonlocal minimising movement scheme and suitable estimates for the evolution of Wulff shapes, we prove existence of weak superflows and subflows starting from arbitrary closed sets. Under the additional assumption that the initial level sets have compact boundary, a comparison principle yields existence and uniqueness of the level set flow. Finally, we prove that variational weak flows converge, up to fattening, as $r\searrow 0$ to the weak flow of the local anisotropic, possibly crystalline, curvature motion. The main step in the proof consists in averaging the nonlocal Cahn-Hoffman measures to obtain vector fields converging to a local Cahn-Hoffman field.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.05245 ↗

We study a coupled elliptic-parabolic system modelling electrical discharge in a micro-electro-mechanical (MEMS) capacitor: a Poisson equation for the electrostatic potential, coupled to drift-diffusion equations for the ion and electron densities with a Townsend ionization source whose rate per electron grows linearly in the electric field. Gimperlein, He and Lacey proved local well-posedness and left open whether the densities blow up in finite time. We first prove a continuation criterion in a weak norm: a finite-time singularity forces the space charge to be unbounded in H^1_D, the dual of the space of H^1 functions vanishing on the electrodes, so blow-up cannot be quasi-neutral. We then exclude it altogether when the two diffusivities coincide and the vacuum field is bounded: the weak solution is then global in time. To our knowledge this is the first global existence result without smallness assumptions for a drift-diffusion-Poisson model of gas discharge whose ionization rate is unbounded in the field. The proof uses the electrostatic energy and the number of carriers in place of the usual free energy: the ionization source cancels in the energy balance, the Joule heating is dissipative, and the two quantities close through a linear Gronwall inequality. Numerical experiments on a discharge in a micrometre gap, with the Townsend constants and the mobilities of air, provide evidence for the extension to unequal diffusivities and bear on the existence of a breakdown threshold.

fields
Analysis of PDEs
pdf ↗ page arXiv:2611.05262 ↗

We study the hard-core variant of the Simplified Approach to the ground state of the dilute Bose gas. The hard-core potential has been the subject of renewed attention, and is physically relevant to realistic atomic Bose gases. The hard-core Simple Equation is an integro-differential equation, and we construct its solution via a monotone iteration scheme and prove existence and uniqueness (in a restricted sense) of the solution. The energy per particle $e$ and the density $ρ$ of the solution are shown to satisfy the Lee-Huang-Yang formula $e = 2πρ(1 + \frac{128}{15\sqrtπ}\sqrtρ + o(\sqrtρ))$ as $ρ\to 0$, and the condensate fraction $η$ predicted by the hard-core Simple Equation is shown to satisfy $η= 1 - \frac{8}{3\sqrtπ}\sqrtρ + o(\sqrtρ)$ as $ρ\to 0$, in agreement with Bogolyubov's theory. We thus extend results of Carlen, Jauslin, Lieb to the hard-core case. The hard-core equation is defined on its own terms, and the proofs proceed by approximating the hard-core potential with the soft-core potentials $m\,χ_{\{|x| \le 1\}}$ of increasing height $m$: at fixed energy, we establish the $L^1$ convergence of the corresponding solutions and the convergence of their densities at an $O(m^{-1/2})$ rate, and we show that the Lee-Huang-Yang expansions of the energy and of the condensate fraction for the soft-core equations hold with errors uniform in $m$, so that they survive the hard-core limit.

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

Harrop-Griffiths, Killip, Ntekoume and Vişan proved that the derivative nonlinear Schrödinger equation (DNLS) is globally well-posed in $L^2(\mathbb{R})$. A key ingredient of their proof is a local smoothing estimate. It holds on $L^2$-equicontinuous sets of initial data, but it cannot hold on $L^2$-balls, because rescaled stationary solitons, all of mass $2π$, violate it. This raises a natural question: for which masses $m$ does local smoothing hold uniformly on the ball $\{M(q_0)\le m\}$? We prove three results. First, we give a quantitative version of the local smoothing estimate in which the data enter only through the mass and an explicit frequency scale $κ(q_0)$. On time intervals of length $2T$ the bound grows like $1+κ(q_0)^2T$, and the stationary soliton shows that the power of $κ$ cannot be lowered below one. Second, we prove uniform local smoothing on balls of small mass, together with a scale-invariant Morrey-type form and a localized $L^4_{t,x}$ bound. Third, we analyse the soliton family from both sides. The uniform constant must blow up at least like $(2π-m)^{-1}$ as $m\uparrow 2π$, while every soliton of mass $m<2π$ satisfies local smoothing with a constant $O((2π-m)^{-1})$. These facts single out the stationary-soliton mass $2π$, which is also the Hayashi–Ozawa coercivity threshold, as the natural candidate for the sharp threshold. We formulate this as a conjecture, give a spectral reformulation in terms of the Kaup–Newell scattering data, and discuss the obstacles to a proof.

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

We study linear variational problems on bounded domains $Ω\subset \mathbb R^d$ involving the Dirichlet biharmonic operator $Δ^{2}$ and the Rellich potential $|x|^{-4}$, under the assumption $0\in\overlineΩ$. The case $0\in\partialΩ$ is particularly noteworthy and subtle.

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

We study the classical Skyrme model. Under corotational symmetry, we prove that (i) stationary solutions, or Skyrmions, are unique in every topological degree; (ii) the Cauchy problem is globally well-posed in a nonlinear energy space; and (iii) stable soliton resolution holds: every finite-energy solution scatters to the Skyrmion of the same degree. Our key observation is that subcritical equivariant Yang–Mills dynamics emerge near the origin and suppress concentration.

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

Combinatorics39

We study an analogue of the permutohedron for the dihedral group, which we call the dihedral permutohedron. We determine the facet structure of the dihedral permutohedron, use the facet structure to construct a triangulation, and determine a nice combinatorial formula for the volume of the dihedral permutohedron. Lastly, we find a family of interesting unimodular affine symmetries of the odd dihedral permutohedron.

comments
21 pages, 4 figures
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2610.28672 ↗

A $d$-graph is a complete graph whose edges are colored with colors from $[d]$. It is Gallai if it contains no triangle whose three edges have distinct colors. We prove that every Gallai $d$-circulant is an iterated lexicographic product of circulants using at most two colors. The proof uses the compatibility of the known canonical modular decomposition with the cyclic action. For $d$-graphs avoiding both a rainbow triangle $Δ$ and the two-colored four-vertex graph $Π$ whose chromatic components are paths, we give a more explicit classification. Color-preserving vertex transitivity is equivalent to circular symmetry and to a reduced positional game tree whose branching numbers and labels depend only on depth. The edge colors in the given cyclic labeling are determined by a chain of divisors of the order. This description yields a complete isomorphism invariant and a linear-time recognition procedure in the difference-word representation. The characterization of CIS $d$-circulants reduces to CIS two-colored factors. Finally, we extend the numerical CIS criterion to $d$-graphs whose chromatic components are vertex-transitive.

fields
Combinatorics
pdf ↗ page arXiv:2611.03695 ↗

Jaeger conjectured that, for every positive integer $p$, every $4p$-edge-connected graph admits an orientation with congruent indegree and outdegree modulo $2p+1$. We prove a stronger probabilistic counterpart: a uniformly random simple $(4p+1)$-regular graph has a strongly connected orientation with all outdegrees in $\{p,3p+1\}$ with probability tending to one as its even order grows. More generally, for every fixed odd $d\ge9$, there is $\varepsilon_d>0$ such that its circular flow number is less than $2+4/(d-1)-\varepsilon_d$ with probability tending to one. We give explicit margins at the small degrees and prove the bound $91/33$ at degree seven, answering a fixed-upper-bound question of Li and Li. Gaps below $3$ at degree five and below $8/3$ at degree seven remain open. A uniform estimate for dense bisections also gives short intervals above the Li–Li maximum-bisection lower bound. Finally, we prove the one-unit bisection-gap conjecture of Greenhill, Isaev and Lewis: at every fixed degree $d\ge3$, the typical minimum parameter for orientations with outdegrees in $\{p,d-p\}$ exceeds the threshold forced by the maximum bisection by at most one.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.03763 ↗

A tournament is an orientation of a complete graph. A vertex $v$ controls a vertex $u\neq v$ if there is a directed path of length at most two from $v$ to $u$, and a $δ$-king is one that controls at least $δ(n-1)$ vertices. In the query complexity model, each query reveals the orientation of an edge. Shen, Sheng and Wu [SICOMP'03] established an $Ω(n^{4/3})$ lower bound on the deterministic query complexity of finding a $1$-king, and a non-matching upper bound of $O(n^{3/2})$. Neither bound has been improved in over two decades, despite substantial progress on variants of the problem. For $δ$-kings with $δ< 1$, Biswas, Jayapaul, Raman and Satti [Discrete Applied Mathematics'22] showed that $O(n^{4/3})$ queries suffice to find a $\frac12$-king. Lachish, Reidl and Trehan [FSTTCS'22] improved this guarantee to $\frac12+\frac{2}{17}$ using $\widetilde{O}(n^{4/3})$ queries, and asked whether a larger fraction could be achieved within the same query bound. We answer this question affirmatively for every fixed fraction below one: for every fixed $\varepsilon\in(0,1)$, we give a deterministic algorithm that finds a $(1-\varepsilon)$-king using $O(n^{4/3})$ queries. The design of our algorithm is informed by a structural analysis combining a sparse regularity lemma due to Allen, Kohayakawa, Mota and Parente [Electronic Journal of Combinatorics'14] with a new sampling argument based on a reachability theorem of Afek, Gafni and Linial [arXiv'19].

comments
13 pages, 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2611.03838 ↗

Transitivity in social and other complex networks describes the tendency for two nodes with a common neighbor to become adjacent. We propose a new model for complex networks based on transitivity, called the Iterated Local Transitivity Model for Oriented Graphs (ILTO). The model generalizes the Iterated Local Model for Tournaments (ILMT). As in ILMT, oriented graphs are generated iteratively by cloning nodes and their adjacencies, with arcs between clones oriented either as the corresponding arcs between their parents or in the reverse direction. This process produces dense oriented graphs and, under suitable conditions, graphs with high connectivity and small diameter. We analyze the universality properties of ILTO, showing that, for generating sequences with infinite support, the base oriented graph determines which oriented graphs appear as induced subgraphs, unlike in ILMT. We study motifs in ILTO and show that when the base graph is a tournament and the generating sequence has infinite support, the model generates quasirandom tournament sequences. Finally, we study domination numbers, the cop number, and the dichromatic number. We bound the cop number in terms of the independence number of the base graph and show that, for each fixed base graph, the dichromatic number is $Θ(2^t)$ after $2t$ consecutive 0-steps.

fields
Combinatorics
pdf ↗ page arXiv:2611.03843 ↗

In this paper we study a relatively new Ramsey type graph parameter introduced by my Bachelor's thesis supervisor Nóra Almási, and her Master's thesis supervisor Maria Axenovich. The parameter $ξ(G)$ denotes the largest natural number $n$, such that there is a red-blue-green edge coloring of $K_n$, such that in the edge coloring all copies of $G$ represent all three colors. After a brief recap on Ramsey numbers, we precisely define $ξ(G)$, and take a look at its relations to the Ramsey numbers. In the third chapter we establish lower bounds on $ξ(G)$, in the cases $G=K_5$ and $G=K_6$, namely $ξ(K_5)\ge 19$ and $ξ(K_6)\ge 31$.

fields
Combinatorics
pdf ↗ page arXiv:2611.03878 ↗

The corpus of Elie Duhamel and Tristan Cazenave~\cite{dc} contains $305{,}755$ automatically generated conjectures relating spectral and metric invariants of connected graphs. A pipeline generated with Claude Code (numerical refutation, proof by the SMT solver \textsf{z3} from a library of lemmas, discovery of new lemmas, formalisation in \lean~4/Mathlib) refuted $162{,}964$ conjectures and proved $117{,}390$ without any unproved hypothesis, of which $79{,}505$ are verified end to end in \lean{} for every connected graph. This document collects, with proofs written for mathematicians, the most interesting lemmas that were discovered and proved, the ten most useful lemmas, the ten hardest theorems, simpler proofs of known results (Bollobás–Erdős, Yang–Lu), and the unrefuted conjectures that we find most interesting. All the proofs are gathered in an archive

fields
Combinatorics
pdf ↗ page arXiv:2611.03879 ↗

A proper conflict-free coloring is a proper vertex coloring in which every non-isolated vertex has a neighbor whose color appears exactly once in its open neighborhood. We study this coloring on chordal and ordered bipartite graph classes. For well-partitioned chordal graphs, we prove the tight bound $ω(G)\leq\pcf(G)\leqω(G)+1$ and give an $O(n^2)$ construction from a partition tree. Every assignment of lists of at least $ω(G)+1$ colors also admits a PCF coloring that respects the lists. Deciding whether $ω(G)$ colors suffice is NP-complete, even when the partition tree is a star. This also proves NP-completeness on chordal graphs when the number of colors is part of the input. For interval graphs, we prove that lists of size $ω(G)+1$ always suffice, improving the previous ordinary-coloring bound of $ω(G)+2$. We use matchings to characterize when $ω(G)$ colors suffice and give an endpoint algorithm taking $2^{O(ω(G)^2)}n^{O(1)}$ time. We also characterize the exact value when the clique number is at most three and give a linear-time algorithm from sorted interval endpoints. For biconvex graphs, we prove a tight five-color bound and give a direct exact algorithm taking $O(n^{33})$ time. For bipartite permutation graphs, a smaller dynamic program gives an exact $O(n^{17})$ algorithm. Finally, if a bipartite graph is convex over an ordered shore $X$, we prove the sharp bound $\pcf(G)\leq\lceil\log_2(|X|+1)\rceil+3$ and construct a coloring in linear time from the order.

fields
Combinatorics
pdf ↗ page arXiv:2611.03906 ↗

We study graphs whose powers are well-covered, with an emphasis on Cartesian products and Cayley graphs. We first establish necessary conditions and sufficient criteria for Cartesian products, provide examples showing that a factor need not be well-covered and that two noncomplete factors can have the well-covered powers property, and classify several structured product families. In particular, we construct graphs satisfying the well-covered powers property for arbitrarily large diameters. We then show that the Cartesian square of a connected abelian Cayley graph is well-covered exactly when the graph is complete. We classify the well-covered-power graphs among connected circulant graphs of degree at most four. For Cartesian products of any number of complete graphs, we also prove that the recursive alphabet-size inequalities in the final conjecture are sufficient for all powers to be well-covered, prove partial converses for arbitrarily many factors, and give explicit obstructions for every binary prefix followed by one complete factor.

fields
Combinatorics
pdf ↗ page arXiv:2611.03956 ↗

We encode certain sets of partitions by regular languages of boundary words, so that their generating functions become rational series in the quantum plane $RU=qUR$. An equality between two partition counts is certified by writing the difference of their series as $(1-U)a+b(1-R)$, with $a,b$ converging $q$-adically. We show that $a,b$ may be chosen as solutions of finite holonomic systems of $q$-difference equations computed from the automata, and describe finite certificates of their convergence, together with bounded searches for such certificates; the searches need not succeed, but a false identity is always detected. As an application, we prove the three-row, level-two case of Primc's conjecture, which equates counts of coloured partitions subject to local multiplicity conditions with counts of coloured partitions whose parts lie in prescribed residue classes modulo eight.

fields
Combinatorics, Quantum Algebra
pdf ↗ page arXiv:2611.04020 ↗

For a permutation pi in Sk, a pi-wave is an increasing sequence of integers whose consecutive gaps have relative order pi. Let g(pi, n) be the maximum cardinality of a pi-wave-free subset of [n], and let P(pi, r) be the least integer N such that every r-coloring of [N] contains a monochromatic pi-wave. We determine the asymptotic orders of both functions for every permutation of length at most five. Existing upper bounds and weak-wave constructions provide sharp bounds for all but eight length-five patterns in S_5. For these eight exceptional alternating patterns, we establish g(pi, n) = Theta((log n)squared) and P(pi, r) = Theta(r(log r)squared).

comments
20 pages, 6 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.04184 ↗

A tester decides whether a graph has a property or is far from having it. A distance estimator asks for more: it must approximately determine how many edges need to be changed. A property is said to be testable if there is a tester with a number of queries bounded independently of the graph's order for each conceivable distance. Similarly, if a property admits an estimator with a number of queries bounded independently of the graph's order, it is said to be estimable. Fischer and Newman proved that, in the dense graph model, every testable property is also estimable. We show that the passage from testing to estimation requires only a polynomial increase in query complexity. This resolves a long-standing open problem in property testing, previously tackled by Fiat and Ron, by Hoppen, Kohayakawa, Lang, Lefmann, and Stagni, and by Gishboliner, Kushnir, and Shapira.

fields
Combinatorics
pdf ↗ page arXiv:2611.04276 ↗

We study fractional coloring with local demands, a framework introduced by Kelly and Postle in which one seeks a probability distribution on the independent sets of a graph such that each vertex $v$ is included with probability at least a prescribed target $φ(v)$. For $K_r$-free graphs, Kelly and Postle conjectured that such a distribution exists provided $φ(v)\le c_r\frac{\log d(v)}{d(v)}$ for a fixed \(c_r>0\), where $d(v)$ is the degree of $v$, and they established this up to a factor of $(\log\log d(v))^2$. In this paper, we prove their conjecture, showing that \[ φ(v)\le\frac{c}{r}\frac{\log(d(v)+2)}{d(v)+1} \] suffices for an absolute constant $c>0$. As a corollary, we obtain a lower bound on the independence number of $K_r$-free graphs in terms of their degree sequence. This strengthens the bound that OpenAI proved in resolving the Ajtai-Erdős-Komlós-Szemerédi conjecture. Moreover, our argument yields a deterministic algorithm that produces the desired probability distribution in time $2^{O(r^2)}n^{O(1)}$, where \(n\) is the number of vertices and the implied constants are absolute.

comments
60 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.04297 ↗

Qualitative independence is a property associated with the column vectors of well-known combinatorial designs known as covering arrays and qualitative independence hypergraphs characterize the existence of covering arrays on hypergraphs. The core of a hypergraph $H$ is an interesting structural characteristic to study, as it is the unique (up to isomorphism), minimal subhypergraph $H^\bullet \subseteq H$ which is homomorphically equivalent to $H$. We use the vertex transitivity and strong independence number of almost-uniform $3$-qualitative independence hypergraphs, $3\text{-}AUQI(2n+1,2)$, to show that $3\text{-}AUQI(2n+1,2)$ are cores for infinitely many $n$. Consequently, we establish that $3\text{-}QI(9,2)$ is a core and also obtain a lower bound on the strong chromatic number of $3$-qualitative independence hypergraphs $3\text{-}QI(2n+1,2)$.

fields
Combinatorics
pdf ↗ page arXiv:2611.04384 ↗

The maximum size of a t-intersecting code in the set of words of length n over an alphabet of size m, a problem posed by Frankl and Füredi, was determined independently by Ahlswede and Khachatrian and by Frankl and Tokushige. Extending this result to the forbidden-intersection setting, Keevash, Lifshitz, Long and Minzer proved that, for m greater than two and n sufficiently large in terms of t, (t minus one)-avoiding codes have the same maximum size and the same extremal ball constructions as t-intersecting codes. They also raised the binary case. Here, t-intersecting requires every two distinct words to agree in at least t coordinates, while (t minus one)-avoiding forbids agreement in exactly t minus one coordinates. We solve the binary case for all t at least three and n at least the square of the sum of t and one. If the forbidden Hamming distance n minus t plus one is odd, the maximum size of a (t minus one)-avoiding code strictly exceeds the maximum t-intersecting size. If it is even, the two maxima coincide, but their extremal families differ: some maximum (t minus one)-avoiding codes are not t-intersecting. We also determine all maximum avoiding codes in the even case. For odd forbidden distances, weight parity and a fixed-point-free pairing determine the maximum, while the diameter theorem gives the comparison with t-intersecting codes. For even forbidden distances, parity splitting and coordinate deletion reduce the problem to avoiding two consecutive distances. Connected components, disjoint neighbourhoods, and Harper's vertex-isoperimetric theorem yield the upper bound, which is attained by a t-intersecting construction. The diameter theorem then determines the extremal structure, and elementary binomial estimates give the stated parameter range.

comments
10 pages, 0 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.04523 ↗

For $n\ge2$, a good slope of a permutation $f$ of $\mathbb{Z}_n=\mathbb{Z}/n\mathbb{Z}$ is an element $m\in\mathbb{Z}_n$ for which $x\mapsto f(x)+mx$ is a permutation. We call $f$ congruence-preserving if it preserves congruences modulo every divisor of $n$. For odd prime powers $n$, we classify all permutations with more than $n/2$ good slopes. Among permutations that are not congruence-preserving, we determine the maximum number of good slopes for $n=3^e$ with $e\ge2$, and for $n=25$, $125$ and $625$. Every permutation of $\mathbb{Z}_n$ has at most $\varphi(n)$ good slopes, where $\varphi$ is Euler's totient function. For several families of moduli with at least two distinct prime divisors, we prove a sharp upper bound for the number of good slopes of the permutations with fewer than $\varphi(n)$ good slopes. These families include $9q$ and $3q^e$ for every prime $q\ge5$ and every $e\ge1$. Together with a companion paper, this settles the bound for every odd composite modulus below $105$.

comments
Companion paper to arXiv:2611.01465
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.04551 ↗

For every \(c>1\) sufficiently close to \(1\), we prove that there is \(κ>0\) such that every sufficiently large \(A\subset[N]\) of density at least \((\log N)^{-κ}\) contains \[ x,\ x+(p-1),\ x+(p-1)^2,\ldots,\ x+(p-1)^k, \qquad p=\lfloor n^c\rfloor\in\mathbb P. \] We also prove pointwise almost-everywhere convergence of the corresponding multiple ergodic averages.

code
github.com/HamedMousaviMath/Lean-Formalization-Polynomial-Configurations-and-Pointwise-Averages-Along-Piatetski--Shapiro-Primes ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at ab2c7e6, checked 2026-11-10 build details
comments
15 pages. An AI-assisted Lean development formalizes the deductions in the paper, conditional on eight explicitly documented families of external results. The development is available at https://github.com/HamedMousaviMath/Lean-Formalization-Polynomial-Configurations-and-Pointwise-Averages-Along-Piatetski--Shapiro-Primes
fields
Combinatorics, Dynamical Systems, Number Theory
pdf ↗ page arXiv:2611.04575 ↗

In the hat guessing game on a graph $G$, each vertex is occupied by a player wearing a hat whose color is chosen from a set of $q$ colors. Each player knows the graph and their position in it and sees only the hat colors of their neighbors. The players may agree on a strategy beforehand but must simultaneously try to guess their own hat colors without communicating. They win if at least one player guesses their own hat color correctly. The hat guessing number of $G$, denoted by $\textrm{HG}(G)$, is the largest integer $q$ for which the players have a strategy that guarantees a win for every assignment of hat colors. A direct application of the symmetric Lovász Local Lemma shows that $\textrm{HG}(G) < eΔ$ for every graph $G$ of maximum degree at most $Δ\ge 1$. We prove that this bound is asymptotically sharp: for every $\varepsilon > 0$ and every sufficiently large $Δ$, there exists a graph $G$ of maximum degree at most $Δ$ with $\textrm{HG}(G) \ge (e - \varepsilon)Δ$. This answers a question of Alon et al., disproves the conjecture $\textrm{HG}(G) \le 2Δ(G)$ of Bosek et al., and improves on the construction of Latyshev and Kokhas, which achieves $\textrm{HG}(G) = 4Δ(G)/3$. The hat guessing number thus provides a natural combinatorial problem in which the Lovász Local Lemma is asymptotically tight.

fields
Combinatorics
pdf ↗ page arXiv:2611.04577 ↗

Let $d \in \mathbb{N}$ and let $A \subseteq \mathbb{R}^d$ be a finite, non-empty set not contained in any translate of a hyperplane. We show that there exists a subset $S \subseteq A$ such that $d \ll |S| \ll d$ and \[E(A,S) := |\{(a_1,a_2,s_1,s_2)\in A\times A\times S\times S:a_1+s_1=a_2+s_2\}|\ll\lvert A\rvert\lvert S\rvert.\] This can be interpreted as a robust, analytic generalisation of the classical Freiman's lemma, and recovers Freiman's lemma up to a constant multiplicative factor. In the process of proving this result, we also show that for any integer $1 \leq m \leq d$ and any set $A \subset \mathbb{R}^d$ with $|A| \leq \binom{d}{m}$, one has \[ E(A, B) \leq 4(m + 1/m) |A||B|,\] where $B$ is the canonical basis of $\mathbb{Z}^d$. This gives new estimates for multiplicative energies between finite sets of primes and arbitrary subsets of positive integers, improving a previous result of Shkredov. Using related ideas, we also prove new bounds for an edge-isoperimetric problem for certain graphs on the boolean cube, improving an earlier result of Kirshner and Samorodnitsky. We give two different proofs of the first result described in this abstract and three different proofs of the second one.

comments
29 pages
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.04644 ↗

Tree decompositions describe large graphs as gluings of smaller component parts. Here we study their categorical duals, tree co-decompositions, which construct large graphs via fibered products of small constituent parts. Co-decompositions are compressed representations of graphs or relational structures: the decomposed object can be exponentially larger than the space required to specify the co-decomposition. Our main contribution is an algorithmic meta-theorem for first order logic: given only a co-decomposition of a $σ$-structure $G$ with $b$ bags, each of size at most $w$ and an FO sentence $φ$, there is an algorithm which, without ever constructing or inspecting $G$, operates on the co-decomposition and determines whether $G \models φ$ in time $f_σ(w,|\varphi|)\cdot b$. We pair this algorithm with structural results on tree co-width, including its relationship to tree-width and a separation from twin-width. Furthermore, we characterize bounded path co-width using a graph grammar. In contrast to our logical meta-theorem, we prove that $(s,t)$-Path becomes NP-hard on co-decomposition inputs. These results demonstrate how categorical constructions can enable efficient computation on exponentially compressed structures.

comments
63 pages, 12 figures
fields
Combinatorics, Category Theory
pdf ↗ page arXiv:2611.04658 ↗

For every $n\ge4$, arbitrary trees of orders $n,n-1,n-2$ can be packed into $K_n$ online, in decreasing order of size: each tree must be embedded before the next is revealed, and earlier embeddings cannot be changed. This strengthens the classical three-tree packing theorem of Hobbs, Bourgeois and Kasiraj (1987). In particular, the second tree is embedded without knowing the third, and the resulting pair of copies can be extended to accommodate every possible third tree. Our strategy is to embed the first two trees so that their union is $2$-degenerate. We prove that the complement of every $2$-degenerate graph on $n$ vertices contains every tree of order $n-2$, which guarantees the final move. The main ingredient is an embedding lemma for spiders whose center must occupy a prescribed vertex having degree at most two in the forbidden graph. We then extend this lemma to arbitrary trees by induction.

fields
Combinatorics
pdf ↗ page arXiv:2611.04674 ↗

Stein conjectured that for every positive integer $k$, every oriented graph with minimum semi-degree greater than $k/2$ contains every oriented path of length $k$ [Springer Optim.Appl. 165 (2020), 459–486]. For directed paths this is a classical result of Jackson (1981). The two-block case of the conjecture was established by Chen, Hou and Zhou (2025). In this paper we prove the two-block analogue of Jackson's theorem. For all positive integers $s$ and $r$, let $P(s,r)$ be the oriented path consisting of two directed paths of lengths $s$ and $r$ with a common terminal vertex, and let $Q(s,r)$ be its reverse. We show that for all $K\ge3$ and all $s,r\ge1$ with $s+r\le K$, every oriented graph $D$ with $δ(D)\ge K$ and $d_D^+(u)+d_D^-(v)\ge K-1$ for every ordered pair of distinct vertices $(u,v)\notin A(D)$ contains both $P(s,r)$ and $Q(s,r)$. Our result is the two-block analogue of Jackson's theorem, and it extends the two-block result of Chen, Hou and Zhou. The proof iterates a shift of the terminal vertex of a longest path.

fields
Combinatorics
pdf ↗ page arXiv:2611.04691 ↗

We show that for every $γ>0$ and every sufficiently large $Δ$, the Glauber dynamics for proper $q$-colorings of any $n$-vertex graph of maximum degree $Δ$ has spectral gap $Ω_γ(1/n)$, and hence mixing time $O_γ(n^2\log q)$, whenever $q\ge(1+1/\mathrm{e}+γ)Δ$. Our proof establishes a Bochner-type inequality by exploiting the spectral gaps of hard-core models hidden in the color classes. The constant $1+1/\mathrm{e}\approx1.368$ comes from the uniqueness threshold $\approx\mathrm{e}/Δ$ of the hard-core model on the infinite $Δ$-regular tree.

comments
33 pages
fields
Combinatorics, Probability
pdf ↗ page arXiv:2611.04699 ↗

We study structural defects in fixed points of block substitutions, building on arXiv:2604.12637 and providing its technical supplement. We develop an automata-based framework to characterize their occurrence and derive verifiable combinatorial criteria. We also introduce simplifications for the construction and analysis of these automata, including tensor-product decompositions, that clarify the mechanisms underlying structural defects and their emergence.

comments
24 pages, 35 figures. Comments welcome
fields
Combinatorics, Dynamical Systems
pdf ↗ page arXiv:2611.04880 ↗

A \emph{rainbow cycle} in a list-edge-colored graph is a cycle where no color appears more than once. We give a short and simple proof of a result of [ABSZZ] showing that a properly edge-colored $n$-vertex graph with average degree $Ω(\log n\log\log n)$ always contains a rainbow cycle, and generalize it to weighted graphs with edges list colored with list size at most $\ell$ and where the total weight of all edges containing a given color $i$ incident to a vertex is at most $Δ$, showing that $Ω_\ell(Δ\log n\log\log n)$ average degree guarantees a rainbow cycle. Using the reduction of [AG26] and the new generalized rainbow cycle theorem, we prove that for $r\geq 3$, every binary linear $r$-query locally correctable code $E:\mathbb{F}_2^k\rightarrow \mathbb{F}_2^n$ satisfies $k\leq \tilde{O}(n^{1-2/(r-1)})$ by showing a rainbow analogue of the odd $r$-LDC lower bounds of [BHKL25,JM25], closing the gap between the best known lower bounds for odd- and even-query binary linear $r$-LCCs.

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

The Nash-Williams–Tutte theorem characterizes the existence of $k$ edge-disjoint spanning trees by a condition on every vertex partition. We prove that, for simple graphs, the same condition guarantees $k$ edge-disjoint spanning trees, each of diameter $O(n/δ)$ and with $O((n/δ)\log(δ+1))$ internal vertices, where $n$ is the number of vertices and $δ$ is the minimum degree. Both bounds hold simultaneously for every tree, with absolute implicit constants independent of $k$, and each is asymptotically optimal in general. Our proof is constructive and yields a randomized algorithm with expected running time $\tilde{O}(n^5)$. We derive applications to short edge-disjoint routes and weak linkages, small Steiner trees, and survivable networks with short paths. The joint bounds also yield low-diameter spanning Eulerian subgraphs and short tours for postman and general routing problems.

fields
Combinatorics
pdf ↗ page arXiv:2611.05043 ↗

The second Zagreb matrix of a graph $G$ is $Z(G)=D(G)A(G)D(G)$, where $D(G)$ and $A(G)$ are the degree matrix and the adjacency matrix of $G$. For many degree-based weighted adjacency matrices, the trees, unicyclic graphs and bicyclic graphs with the largest spectral radius have a vertex adjacent to all others, and Mei et al. conjectured this for every such matrix on unicyclic graphs. Jiang et al. showed that $Z(G)$ is a counterexample. We prove that, for $q\in\{0,1,2\}$ and every $n\ge4$, the connected graph of order $n$ and cyclomatic number $q$ maximizing the spectral radius of $Z(G)$ is unique, and is obtained from two adjacent vertices with $q$ common neighbours by attaching $n-q-2$ pendent vertices to them as evenly as possible. The only exceptions are the star for $q=0$ and $n\le7$, and the triangle with one pendent vertex at each vertex for $q=1$ and $n=6$. This confirms a conjecture of Jiang et al.\ and all three parts of a conjecture of Shen and Shan for this matrix, with best possible thresholds on $n$. For $n\ge8$, the maximum value is $\lfloor (n+q)^2/4\rfloor+(n+q)/2+7q-2+O(1/n)$, whereas the star gives only $(n-1)^{3/2}$. A key tool is a determinant criterion that reduces spectral comparisons to sign conditions on explicit polynomials.

fields
Combinatorics
pdf ↗ page arXiv:2611.05057 ↗

Erdős and Gyárfás conjectured that every graph with minimum degree at least three contains a power-of-two-length cycle. We prove every Cayley graph of odd order satisfies the conjecture. As a corollary, we find that Cayley graphs of finite nilpotent groups satisfy the conjecture as well.

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

We introduce the face polynomial of a ribbon graph, a generating function for face numbers under the ribbon group action. It addresses the face-count case of the Ellis–Monaghan–Moffatt question on twisted duality. We derive deletion–contraction recursions and prove that this polynomial coincides with the vertex polynomial for \(\langleδ\rangle\), \(\langleδτ\rangle\), and \(\langleδ,τ\rangle\). We characterize monomial cases and obtain formulas and recursions for Euler-genus partial-twuality polynomials. For orientable graphs, we show that the partial-dual face polynomial has both parities whenever an edge exists, so the partial-dual Euler-genus polynomial has only even exponents.

fields
Combinatorics
pdf ↗ page arXiv:2611.05090 ↗

Using the bisection bound of Monien and Preis, Fomin and Høie proved in 2006 that every graph of maximum degree 3 on $n$ vertices has pathwidth at most $n/6+o(n)$. We prove that the pathwidth, bisection width and cutwidth of these graphs are at most $c_3 n+o(n)$, where $c_3=\frac{3}{4π}\arccos\frac56\approx0.1398$. For bisection width this improves the bound $n/6+o(n)$ of Monien and Preis (2006) and extends to all such graphs the bound that Lichev and Mitsche (2023) obtained for random cubic graphs. For maximum degree 4, we prove that bisection width and cutwidth are at most $n/3+o(n)$, improving the bound $2n/5+o(n)$ of Monien and Preis for 4-regular graphs, and that pathwidth is at most $0.2458n$, improving the bound $n/3$ of Fomin, Gaspers, Saurabh and Stepanov (2009). We show that every graph with $m$ edges has pathwidth at most $7m/48+o(n)$, improving the bound $13m/75$ of Scott and Sorkin (2007), and we give further bounds of the form $\sum_{d\ge3}a_d n_d+o(n)$ with $a_d<1$, where $n_d$ is the number of vertices of degree $d$. The path decompositions, and linear orderings of the stated cutwidth, can be computed in polynomial time. Instead of deriving pathwidth bounds from bisection width, we give each vertex a Gaussian label, a weighted sum of independent standard normal variables over a ball around it, and sweep a threshold through the labels; the bags are frontiers, the vertices above the threshold with a neighbor below it. We bound the probability that a vertex lies in a frontier by comparison with an explicit Gaussian model of a vertex and its neighbors. Faster exact algorithms follow: for feedback vertex set and the traveling salesperson problem on graphs of bounded maximum or average degree, and on general graphs for minimum weight dominating set (by branching until the instance is sparse), Max 2-CSP and counting subgraphs with $k$ edges (by the bound in $m$).

comments
Code, computer certificates and Lean 4 formal proofs: https://serggasp.github.io/pathwidth-site/ and https://doi.org/10.5281/zenodo.23883489
fields
Combinatorics
pdf ↗ page arXiv:2611.05146 ↗

Two distinct $r$-element sets are adjacent if their intersection has size $r-1$. The Kleitman-West problem, equivalently formulated as the edge-isoperimetric problem on the Johnson graph $J(n,r)$, asks for the maximum number $M_r(n,m)$ of unordered adjacent pairs in a family of $m$ $r$-element subsets of an $n$-element set, and for the families attaining this maximum. For every fixed integer $r\ge2$, we determine this maximum asymptotically as $n\to\infty$, uniformly over the entire range of family sizes. Specifically, for each integer $1\le j\le r$, define $F_j(p)=\max\{p^{1+1/j},\,2p-1+(1-p)^{1+1/j}\}$ for $0\le p\le1$, and $G_j(x)=\lfloor x\rfloor+F_j(x-\lfloor x\rfloor)$ for $x\ge0$. With \[ P_r(n,m)=\sum_{j=1}^r\frac{n^{j+1}}{2(j-1)!}G_j\!\left(\frac{j!m}{n^j}\right)-\frac{r(r-1)}4mn-\frac m2, \] we prove that \[ \lim_{n\to\infty}\max_{2\le m\le\binom nr}\left|\frac{M_r(n,m)}{P_r(n,m)}-1\right|=0. \] The remaining cases satisfy $M_r(n,0)=M_r(n,1)=0$. The proof first establishes the asymptotic formula for dense families using a sharp inequality for bounded random variables, with equality attained by a random variable taking at most two values. To extend the result uniformly to all family sizes, we extract groups of sets sharing a fixed subset, apply the dense estimates after deleting that subset, and control the adjacent pairs not contained in any one group.

comments
40 pages. Comments are welcome!
fields
Combinatorics
pdf ↗ page arXiv:2611.05162 ↗

For a graph $G$ with nonnegative edge weights, let $\operatorname{mc}(G,w)$ denote the maximum total weight of a cut and let $w(G)$ denote the total edge weight. We prove that every edge-weighted triangle-free subcubic graph satisfies $\operatorname{mc}(G,w)\geq \frac{15}{19}w(G)$, improving the bound of $\frac{8}{11}$ due to Gutin and Yeo. For subcubic graphs of odd girth at least seven and nine, we strengthen this bound to $\frac{47}{59}w(G)$ and $\frac45w(G)$, respectively, establishing the conjecture of Gutin and Yeo for graphs of odd girth at least nine. Our proofs combine structural properties of vertex partitions with randomized cut constructions and convex combinations of the resulting bounds.

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

We give an example of a tiling of the $m=4$ amplituhedron that has fewer cells than that of the magic number conjecture. The tiling uses an injective degree two cell.

comments
8 pages
fields
Combinatorics, Algebraic Geometry
pdf ↗ page arXiv:2611.05216 ↗

The concept of the Friends and Strangers graph $FS(G,H)$ associated with two graphs $G$ and $H$ was recently introduced by Defant and Kravitz and has generated significant interest. In a companion article, joint with Alon, they consider the behaviour of $FS(G,H)$ in the case where $G$ and $H$ are Erdős-Rényi random graphs, and prove that the threshold for connectivity is of the form $n^{-1/2+o(1)}$. In this paper we prove that the threshold is $n^{-1/2}\sqrt{\log{n}}$, up to a multiplicative constant, answering a question from Alon, Defant and Kravitz.

comments
23 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.05254 ↗

Let $f_3(n,e+3,e)$ denote the maximum number of edges in an $n$-vertex $3$-uniform hypergraph containing no $e$ distinct edges spanning at most $e+3$ vertices. It has long been conjectured that $f_3(n,e+3,e)\ge n^{2-o(1)}$ for every fixed $e\ge3$. We prove that $f_3(n,9,6)\ge n^2\exp(-O((\log n)^{2/3}))$, settling the first unsolved case of the conjecture.

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

We study the problem of reconfiguring plane, straight-line spanning trees on point sets in the plane. A flip is a reconfiguration step in which one edge of a tree is replaced with another, yielding again a plane spanning tree. For a given point set $P$, the flip graph has a vertex for each plane spanning tree on $P$, and an edge between any two trees that differ by a single flip. The folklore happy edge conjecture suggests that any edge shared by both the initial and the target tree (a happy edge) is never flipped in a shortest flip sequence. This conjecture was computationally verified for up to 10 points in convex position. In this paper, we disprove this conjecture both on general point sets and on point sets in convex position by providing two counterexamples on $16$ and $30$ points, respectively. The counterexample for point sets in general position also holds for compatible flips, while the happy edge property holds for compatible flips in convex point sets as shown by Aichholzer, Dorfer, and Vogtenhuber [GD 2025].

comments
17 pages, 5 figures, 5 tables
fields
Combinatorics
pdf ↗ page arXiv:2611.05300 ↗

Let $\mathcal{T}(n,d)$ denote the set of subsets of $[n]^d$ that tile $\mathbb Z^d$ by translations, and write $T(n,d)=|\mathcal{T}(n,d)|$. We show that almost every tile in $\mathcal{T}(n,1)$ tiles $\mathbb{Z}$ by an arithmetic progression, thus determining $T(n,1)$ asymptotically. In higher dimensions, we prove that $T(n,d)=O_d\!\left(n^{C_d}3^{n^d/3}\right)$, confirming a conjecture of Benjamini, Kozma and Tzalik. In the other direction, we prove that $T(n,d)\geq (1-o(1))n^{\binom d2}3^{n^d/3}$ when $3\mid n$. This shows one cannot take $C_d=d-1$ for $d\geq 3$, answering a question due to the same authors negatively. Finally, we also obtain nearly tight bounds in dimension two. Our upper bounds rely on a new observation realising tiles as maximal independent sets in truncated Cayley graphs.

comments
18 pages, 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2611.05321 ↗

We present a proper 12-colouring for all associahedra. This gives the first constant upper bound on chromatic number for this family, and disproves a conjecture of Fabila-Monroy et al. from 2009.

comments
5 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.05323 ↗

The Weisfeiler-Leman algorithms WL(k) for $k\ge1$ form a hierarchy of increasingly powerful tests for graph isomorphism. We study how the equivalence relations they induce on graphs transfer through a graph operation $Φ$: for a given $k$, what level of WL-equivalence between graphs $H_1$ and $H_2$ guarantees WL(k)-equivalence of graphs $Φ(H_1)$ and $Φ(H_2)$? We call the least such level the transfer parameter $τ_Φ(k)$ and determine it exactly for the line graph operation $Φ= L$: $τ_L(k)=2k+1$ for $k\ge2$, while $τ_L(1)=1$. We also extend these results to the $(r,S)$-line graphs, which generalize the line graph from edges to $r$-cliques by connecting two cliques when their intersection size lies in a prescribed set $S$. For these operations we prove that $τ_{r,S}(1)=r-1$ for every $S$ and, for certain choices of $S$, that $τ_{r,S}(k)=rk+r-1$ for $k\ge r$, and we bound the transfer parameter in the remaining range. Our upper bounds on transfer parameters follow from a treewidth analysis of diagrammatic expansions of homomorphism counts into $Φ(H)$ as linear combinations of homomorphism counts into $H$. The matching lower bounds combine explicit constructions of witness graphs with the homomorphism-distinguishing closedness of graphs of bounded treewidth.

fields
Combinatorics
pdf ↗ page arXiv:2611.05366 ↗

Optimization and Control31

The paper considers a nonsmooth semi-infinite optimization problem in which the constraints are reformulated through a value function. Stationary points of the cutting surface approximations are studied, showing that stationarity is preserved in the limit under boundedness of the associated sequence of multipliers. Building on these results, an algorithm that combines the cutting surface approximations with a penalty scheme is devised, together with some proximal variants. An exact penalty result is established under suitable global conditions, and numerical results are reported to compare the methods with existing exact penalty and cutting surface algorithms.

fields
Optimization and Control
pdf ↗ page arXiv:2611.03920 ↗

Computing a Karush-Kuhn-Tucker (KKT) point of a quadratic polynomial over the unit hypercube is known to be $CLS$-complete, when the coefficients of the polynomial are encoded in binary. We prove that the problem remains $CLS$-complete even when the coefficients are encoded in unary. This is the first problem proven to remain $CLS$-hard when the input is given in unary.

fields
Optimization and Control
pdf ↗ page arXiv:2611.03945 ↗

Max-Pressure (MP) has emerged as a widely studied decentralized traffic signal control framework, thanks to its desirable theoretical properties and strong control performance. Early research on MP focused on improving control performance by exploring different variables of the traffic state for the definition of pressure. Subsequent studies expanded MP to incorporate the complexity of real-world transportation systems and emerging technologies. This paper provides a comprehensive review of these developments. The review first introduces the theoretical foundations of MP and examines early developments in movement weight definition. It then synthesizes major extensions for multimodal and multiscale network control, followed by recent developments in connected and automated vehicle (CAV) environments and the integration of MP with artificial intelligence (AI) and data-driven methods. Beyond summarizing existing approaches, this review examines their underlying assumptions, data requirements, implementation considerations, and practical limitations. Based on this comprehensive review, key research gaps and future directions are identified, including remaining limitations in the theoretical foundations of MP and the underexplored integration of autonomous vehicle control with the MP framework. Overall, this review provides a structured perspective on the evolution and current state of MP control and highlights opportunities for developing more proactive, robust, and practically deployable MP-based traffic control methods.

comments
49 pages, 7 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.04029 ↗

Capacity expansion models often dramatically simplify the physics of how power flows through a transmission network in order to preserve computational tractability. However, with the rapid growth of electrification, large loads, renewables, and storage, increased realism in planning future grids is imperative. We extend the open-source capacity expansion model GenX with AC optimal power flow physics, and analyze generation, storage, and transmission investment decisions for 20-zone, hourly models of Germany and Texas. We compare our results against those using two common approximations, the transport model and DC optimal power flow. We find that total costs and emissions largely agree across all formulations. However, we find substantial differences in outputs related to transmission, generation siting, storage, and reactive-power support between the approximate formulations and the true AC physics formulation. We identify where AC physics changes planning decisions and discuss how to potentially capture these effects without the full computational cost.

comments
35 pages, 5 figures, 3 tables; plus 16 pages of supplemental information (8 figures, 6 tables). Submitted to Joule
fields
Optimization and Control
pdf ↗ page arXiv:2611.04088 ↗

In this paper, we investigate a class of decoupled infinite-horizon forward–backward stochastic differential equations (FBSDEs) with time-dependent coefficients and jumps. Under suitable time-integrability conditions on the coefficient growth and stochastic Lipschitz moduli, we establish an $L^p$ theory ($p\ge 2$) for these systems, including well-posedness, moment estimates, conditional stability, and tail estimates, without imposing dissipativity of the forward dynamics or monotonicity of the backward generator in its value variable. In particular, the forward state converges in $L^p$ and almost surely to a limiting random variable $X_\infty$, while the backward solution converges to the generally nonzero terminal value $Φ(X_\infty)$. Within this framework, we study infinite-horizon two-player zero-sum stochastic recursive differential games. We prove that the lower and upper value functions are deterministic and establish the dynamic programming principle (DPP) using backward stochastic semigroups and nonanticipative strategies. Both value functions converge locally uniformly to $Φ$ as the initial time tends to infinity and are characterized as viscosity solutions of the corresponding non-autonomous, nonlocal Hamilton–Jacobi–Bellman–Isaacs (HJBI) equations. Under an additional integrable Lyapunov-barrier condition, we establish a comparison principle for continuous viscosity subsolutions and supersolutions of uniform linear growth, provided that at least one is uniformly Lipschitz in space. This yields uniqueness for both HJBI equations in the linear-growth class. Finally, we establish a weaker, contact-wise Isaacs criterion ensuring that the lower and upper value functions coincide and hence that the game has a value.

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

The geometry of constraints in variational inequalities (VIs) plays a central role in applications ranging from resource allocation and equilibrium computation to constrained optimization. Yet, its effect on computational complexity has received surprisingly little attention beyond special cases. We examine this question when the constraint set is an $\ell_p$ ball. This family of problems encompasses two of the most extensively studied classes of problems in algorithmic game theory: symmetric bimatrix games for $p = 1$ and multi-player polymatrix games for $p = \infty$. Both of these problems are known to be PPAD-complete even for affine operators. We establish a comprehensive complexity landscape for VIs over $\ell_p$ balls across the full range $p\in[1,\infty]$. First, for any $p\neq 2$, we show that finding an inverse-polynomial approximate VI solution is PPAD-complete even for affine operators. In contrast, for $p=2$, we give a polynomial-time algorithm for affine VIs, extending a classic result of Ye (1992) beyond symmetric operators. On the other hand, once the operator becomes quadratic, we establish PPAD-completeness even at inverse polynomial precision. From a technical standpoint, we develop a new toolkit for exploiting the geometry of the constraint set and the structure of the operator to characterize the complexity of equilibrium and optimization problems, which is of independent interest.

fields
Optimization and Control
pdf ↗ page arXiv:2611.04151 ↗

We study the minimization of the average of $n$ convex $(L_0,L_1)$-smooth functions: the Hessian norm of each function is bounded by an affine function of its gradient norm. We assume known upper bounds $R$ on the distance from the starting point to a minimizer and $δ$ on the difference between the minimum of the average and the average of the infima of the components. We derive upper and lower bounds on the oracle complexity of reaching accuracy $\varepsilon$ in function value in expectation. Up to logarithmic factors, both bounds are of order $n(1+(L_1R)^{2/3}) +\sqrt{\frac{n(L_0+L_1^2δ)R^2}{\varepsilon}+n(L_1R)^2}$. The upper bound is attained by the proposed method YETI. The method combines ideas of accelerated proximal methods and variance reduction methods with a heuristic for choosing additional points. The number of oracle calls made by the heuristic is bounded, which preserves the upper bound on the total number of queries needed to reach the target accuracy. In the experiments, YETI is compared with first-order methods on synthetic problems and Poisson regression problems. We also examine the stopping criterion and the effect of the heuristic separately. The lower bound is obtained by an explicit construction of families of instances that are hard for any first-order method.

comments
57 pages, 4 figures, 5 tables, 5 algorithms. Second paper in the Descending Everest series; Part I: arXiv:2610.21461
fields
Optimization and Control
pdf ↗ page arXiv:2611.04171 ↗

We study the optimal design of investment subsidies across heterogeneous monopolistic markets subject to a common expected discounted budget. Each producer faces a regular one-dimensional demand diffusion and chooses irreversible capacity expansion through a singular stochastic control problem. The regulator values weighted consumer surplus, producer profits, and an additional benefit from installed capacity, while accounting for the excess cost of raising public funds. We characterize producers' optimal investment responses through free boundaries and reformulate the regulator's stochastic optimization problem as a deterministic optimization over investment boundaries. An integral representation then recovers the optimal subsidy schedules that implement the resulting capacity policies. Under mild conditions on the diffusions, we establish existence of optimal schedules and uniqueness of the induced investment policies. Finally, we characterize the subsidy schedule and provide numerical illustrations.

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

Motivated by the expressive power of neural ordinary differential equations in flow-based generative modeling, we study the approximation of probability measures by pushforwards generated by parameterized families of Lipschitz vector fields. For Wasserstein distances, we establish a quantitative relationship between finite-sample point interpolation and distributional approximation, and derive universality criteria based on $L^p$-approximation of transport maps. In particular, affine-invariant families containing a non-affine vector field are universal from compactly supported absolutely continuous base measures. For total variation, we show that coordinate-wise dynamics are insufficient in dimensions $d\geq 2$ and establish sufficient conditions based on one-dimensional Sobolev approximation and shear-type mixing. We further examine the role of point interpolation, establishing when different regimes relate to one another and when approximate interpolation can be made exact.

comments
45 pages, 3 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.04207 ↗

Data-driven algorithms are ubiquitous across industries, and there is an extensive literature on analyzing their \emph{average} performance. The risk profile of such algorithms, while critical, is much less understood. This paper quantifies the risk of data-driven policies and isolates its sources. We evaluate a policy through the conditional value-at-risk (CVaR) of its loss over the training sample, any policy randomization, and the future outcome, at a fixed unknown distribution. Regret against an oracle that knows the distribution decomposes into expected post-sample regret (PS), the average outcome-only CVaR gap of the selected action, and a sample-risk premium (SR), the additional tail risk omitted by averaging those evaluations. The analogous premium vanishes under expected loss. We characterize when the premium vanishes and how large it is relative to post-sample regret. For losses with a continuous density near the tail cutoff, we identify conditions under which both components decay at the same rate, yet the limiting ratio of the premium to post-sample regret can reach the thousands. When a probability mass at the cutoff moves with the action, the premium can decay more slowly and dominate post-sample regret. We establish conditions under which sample average approximation learns the oracle action at rate $n^{-1/2}$ in both settings, but its combined-risk regret is of order $n^{-1}$ in the first and $n^{-1/2}$ in the second. In finite-sample numerical examples of SAA in both settings, the premium accounts for approximately $74\%$--$97\%$ of regret.

fields
Optimization and Control
pdf ↗ page arXiv:2611.04292 ↗

We study how risk aversion changes learning and the value of data in the classical newsvendor problem. We evaluate data-driven policies through the Conditional Value-at-Risk (CVaR) of realized loss on the combined draw of an i.i.d.\ historical sample and an independent future demand from the same distribution. We measure worst-case regret over demand distributions on a bounded interval relative to an oracle that knows the distribution. We show that, for every fixed positive risk level, Sample Average Approximation (SAA) can retain regret bounded away from zero as the sample size \(n\) grows, even at a fixed demand distribution, and characterize its asymptotic worst-case regret. We trace this failure to persistent variability in the learned order, which contributes to tail risk under this combined-risk evaluation. We establish that risk aversion also slows the minimax learning rate over all data-driven policies from \(Θ(n^{-1/2})\) under expectation to \(Θ(n^{-1/4})\). We construct policies that average nearby order statistics and attain this optimal rate. For finite samples, we reduce worst-case analysis for mixtures of convex combinations of order statistics to Bernoulli demand on the endpoints of the interval. We use this reduction to formulate a linear program for computing minimax policies within this class to any accuracy. In numerical experiments, we find that minimizing this objective alone can leave substantial average CVaR regret when each learned order is evaluated over future demand alone. We therefore develop a two-stage linear program that minimizes the worst-case value of this average regret while allowing a prescribed increase in the original objective. This yields improvements across a broad range of scenarios. Our results show that risk aversion changes both the rate at which data improve decisions and the policies needed to realize that improvement.

fields
Optimization and Control
pdf ↗ page arXiv:2611.04310 ↗

Funnels, time-varying invariant sets around nominal trajectories, certify that a closed-loop system tracks its plan, and can be composed into verified motion plans. Their computation by sum-of-squares (SOS) programming is well established in formulation but not in practice: the result depends on implementation choices such as the initial guess, Lyapunov function normalization, and termination rule, which the literature documents only briefly. This paper presents a self-contained treatment of SOS-based funnel computation, implemented in the open-source package computeSOSFunnels. We propose a minimum-volume formulation with inlet and outlet constraints under which funnels with coinciding nominal endpoints compose by construction. Numerical experiments on a unicycle, with timing studies on a cart-pole and a 12-state quadrotor, characterize the pipeline: infeasible initial guesses are partly decidable before solving, the certificate shows no violations among 39,000 boundary samples per funnel under the true dynamics, and constructing the semidefinite program, not solving it, dominates computation time.

comments
8 pages, 3 figures, 3 tables. Submitted to IEEE Transactions on Control Systems Technology. Code: github.com/khalid2696/computeSOSFunnels
fields
Optimization and Control
pdf ↗ page arXiv:2611.04325 ↗

In this paper, we propose a variance-reduced stochastic quasi-Newton sequential quadratic constrained quadratic programming method (VR-QN-SQCQP) for finite-sum nonlinear optimization with equality and inequality constraints. Exact nonlinear-constraint Hessians are replaced entirely by safeguarded symmetric rank-one (SR1) curvature models built from first-order constraint gradients, while PAGE estimates the objective gradient and an exact \(L_1\) merit function provides globalization. Under explicit regularity, boundedness, relative QCQP-accuracy, and step-length assumptions, the analysis establishes almost-sure subsequential convergence to Karush–Kuhn–Tucker (KKT) points and, under stronger uniform step-length and error-control conditions, an expected \(O(\varepsilon^{-2})\) outer-iteration bound for the squared KKT residual. A conditional local stability result also compares learned-curvature directions with their exact-Hessian counterparts. Numerical experiments compare VR-QN-SQCQP against Exact-SQCQP-PAGE on Sparse PCA using 253,680 CDC BRFSS 2015 observations and on a dense nonlinear benchmark. Over ten seeds, both methods converge in all Sparse PCA runs, while on the dense benchmark the proposed method converges in 10/10 runs versus 9/10 for the exact-Hessian variant. The proposed method performs zero exact constraint-Hessian evaluations and reduces median curvature-construction time on the dense benchmark from 0.1230 s to 0.0111 s. Overall runtime benefits remain problem-dependent.

comments
26 pages, 2 figures (16 subfigures)
fields
Optimization and Control
pdf ↗ page arXiv:2611.04403 ↗

We propose a Multi-technology AdopTion-opinion co-Evolution (MATE) model to describe the diffusion of $m \geq 2$ competing alternatives within a networked population whose opinions evolve under social influence and the feedback generated by adoption. Communities interact through two layers: a physical network governing exposure to adoption, and a social network shaping opinion evolution through social imitation. Individuals can adopt a technology, eventually becoming dissatisfied at a rate reflecting the quality of the technology, and switch to an alternative at a rate driven by their opinion of that alternative. For an arbitrary number of competing technologies $m \geq 2$, we characterize the equilibria and establish the existence of an adoption-diffused equilibrium in which all technologies coexist. For $m > 2$, the equilibrium configuration depends on the broader competitive environment: unlike the two-technology case, within-community relative adoption generally depends also on equilibrium opinions and on the other alternatives. Finally, we formulate finite-horizon opinion-shaping control problems, derive necessary optimality conditions via the discrete-time Pontryagin maximum principle, and compute numerical extremals using a forward-backward sweep method.

comments
14 pages, 7 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.04407 ↗

We study how to compute valid dual bounds for mixed-integer linear programs (MILPs) with finite variable bounds under data perturbations. In an offline-online setting, a nominal instance is solved once and its information is reused to evaluate perturbations. We develop a framework for linear programs under simultaneous perturbations to the objective coefficients, right-hand side, and constraint matrix. Our construction is based on a bounded Lagrangian dual evaluated at nominal optimal dual multipliers. We prove that its gap to the perturbed LP optimal value grows at most linearly with perturbation magnitude under suitable conditions. We extend this construction to MILPs by reusing the nominal branch-and-bound tree and node-level dual information, generalizing the sensitivity analysis framework of Schrage and Wolsey (1985) to all problem data. To strengthen the dual bounds, we adapt their subtree-selection dynamic program. The online computations support GPU acceleration and highly parallel evaluation of dual bounds, which can also certify optimal variable fixings and accelerate reoptimization. Experiments on generalized independent set, combinatorial auction, capacitated facility location, and unit commitment instances produce tight dual bounds at low computational cost. For single-parameter ``what-if'' perturbations, gaps are typically a small fraction of a percent, with GPU evaluation times below a millisecond per perturbation. Relative to the time Gurobi needs to obtain bounds of the same quality, GPU evaluation is approximately 2,000–240,000 times faster for single-parameter perturbations and 120–50,000 times faster for multi-parameter perturbations. Using exact perturbed optima as supplied primal cutoffs, variable fixing accelerates exact reoptimization by up to a factor of 10 for generalized independent set instances, with little or no improvement for unit commitment.

fields
Optimization and Control
pdf ↗ page arXiv:2611.04415 ↗

We consider deterministic composite federated optimization, in which distributed smooth client objectives are combined with a shared, possibly nonsmooth, regularizer. We propose Relative-Error Composite FedDyn (REC-FedDyn), an inexact method that supports partial participation, with one server-side proximal evaluation per communication round. REC-FedDyn employs a directly testable relative-error criterion that allows each client to independently control the accuracy of its local subproblem, without a server-side acceptance test. We establish almost-sure iterate convergence for strongly convex and convex problems, almost-sure asymptotic stationarity for nonconvex problems, and communication and parallel gradient-evaluation complexity bounds, all under partial participation and without assuming bounded data heterogeneity. Experiments on image inpainting, fMRI prediction, and neural-network classification with structured regularization demonstrate efficiency and robustness across levels of data heterogeneity and client participation.

fields
Optimization and Control
pdf ↗ page arXiv:2611.04448 ↗

Integral quadratic constraints (IQCs) and scaled relative graphs (SRGs) are two prominent frameworks for analyzing feedback systems. Although both frameworks are rooted in the same graph separation principle, a general characterization of their relationship has remained unavailable. This paper establishes conditions under which the IQC- and SRG frameworks are equivalent. To this end, we introduce two new classes of systems, termed disjunctive and conjunctive systems, which are respectively characterized by unions and intersections of quadratic input-output constraints. Under structural assumptions, we prove equivalence between the IQC and SRG frameworks for these system classes. By exploiting this equivalence, we develop novel IQC- and SRG-based converse stability results for linear and nonlinear systems. Our results accommodate multiple quadratic constraints, extending well-known converse results in robust control beyond the single-constraint setting.

comments
15 pages, 6 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.04593 ↗

We study decentralized minimization of a smooth network average that is globally quasar-convex with respect to a fixed minimizer; the node functions may be nonconvex and need not share a minimizer. A unit-rate Poisson clock drives an exactly simulable continuized process: between events the state follows a closed-form accelerated flow, and each event uses one oracle vector. One master theorem covers oracles with a predictable bias and a state-dependent variance and keeps the inverse-quadratic term $\mathcal{O}(LR_0^2/(γ^2T^2))$; one selected-row lemma supplies the oracle moments of three network implementations. CQA-Net keeps a common state, mixes local rows for finitely many rounds, and disseminates one uniformly selected row; its oracle is unbiased at every mixing depth, so incomplete averaging affects only the variance. A walking token removes dissemination, the shared clock, and the shared root, and an importance weight keeps it unbiased on fixed graphs. D-CQA keeps local states and mixes them; under bounded heterogeneity it needs $\widetilde{\mathcal{O}}(\sqrtχ\sqrt{L}R_0/(γθ\sqrt{\varepsilon}))$ communication rounds and no dissemination. Changing graphs enter through certified operator norms. Experiments on a certified nonconvex regression on static and changing graphs compare the three implementations.

fields
Optimization and Control
pdf ↗ page arXiv:2611.04597 ↗

Large language model (LLM) inference, the process by which a pre-trained model receives an input prompt and generates output tokens sequentially, has become increasingly important with the widespread deployment of LLM-based applications. As inference workloads continue to scale, GPU memory has emerged as a critical bottleneck: the long input prompts and generation sequences common in agentic and reasoning workloads lead to substantial key-value (KV) cache usage. In this paper, we study the resulting online scheduling problem from a queueing perspective. Requests arrive stochastically with heterogeneous prompt and output lengths, undergo prefill and autoregressive decode, and compete for a finite KV-cache capacity. Unlike classical queueing models, the duration of a processing step depends on both prefill computation and KV-cache I/O, so service capacity is jointly determined by computation, memory access, and memory occupancy. We develop a fluid model that reduces the system to a multiclass single-server queue with effective service rates capturing computation, memory access, and memory capacity. This fluid analysis yields a $cμ$ priority rule, where the effective service rate $μ$ is jointly determined by computational speed, memory bandwidth, and memory capacity. We prove that this rule minimizes cumulative holding cost in the fluid model and, for a finite workload, also minimizes completion time and maximizes full-run output-token throughput. We then construct a feasible scheduling policy for the original finite system and prove that its scaled dynamics converge to the optimal fluid policy. Finally, experiments on a real LLM serving engine using an NVIDIA H800 show that practical implementations of the proposed priority rule substantially reduce average latency while maintaining high throughput relative to existing scheduling policies.

fields
Optimization and Control
pdf ↗ page arXiv:2611.04807 ↗

This manuscript studies a constraint dissolving method for solving optimization problems with general constraints, comprising an abstract constraint G(x) \in C and a potentially nonconvex geometric constraint x \in D, which, to the best of our knowledge, is the first constraint dissolving type method applicable to this general setting. More specifically, we introduce an auxiliary variable s to decouple G(x) \in C into G(x) = s and s \in C, and construct the constraint dissolving mapping acting jointly on both variables. We then propose a penalty-based constraint dissolving method, in which the penalty parameter is updated adaptively according to the feasibility error. Under mild conditions, every accumulation point is Mordukhovich-stationary. By a specific choice of the constraint dissolving mapping, every accumulation point is guaranteed to be feasible, which stands in contrast to standard penalty-type methods in nonconvex settings. Numerical experiments on Rosenbrock, portfolio, and MAXCUT problems demonstrate the effectiveness of the proposed method against the augmented Lagrangian and the penalty decomposition methods.

fields
Optimization and Control
pdf ↗ page arXiv:2611.04954 ↗

Problem definition: We study dynamic inventory control for battery-swapping stations that combine central replenishment with automatic local recovery. Central replenishment improves immediate battery availability but reduces the depleted-battery pool available for subsequent recovery, creating an intertemporal trade-off. Managing this trade-off is particularly challenging when historical demand data are limited and future demand is uncertain and temporally dependent. Methodology/results: We develop a time-consistent distributionally robust dynamic program under martingale demand ambiguity, using the latest observed demand as the next conditional mean without requiring a fully specified demand distribution. We establish an optimal order-up-to policy for every finite horizon and identify two critical recovery rates governing replenishment decisions. Under a regular penalty condition, we derive explicit finite-horizon policies and worst-case demand distributions, showing that sufficiently strong automatic recovery makes central replenishment unnecessary in nonterminal periods. Extensions to submartingale and supermartingale demand reveal contrasting behaviors, including eventual full-capacity replenishment under upward ambiguity and recovery-induced positive replenishment under downward ambiguity. Managerial implications: Numerical experiments demonstrate that the robust policy is particularly competitive when demand is highly dispersed and historical information is limited, whereas its advantage diminishes when demand becomes more predictable or the conditional-mean assumption becomes less reliable. Our findings also reveal that greater reliance on local recovery may compromise service availability, highlighting the importance of jointly considering demand information, recovery capability, and service requirements when making replenishment decisions.

fields
Optimization and Control
pdf ↗ page arXiv:2611.04961 ↗

In this paper, we formulate a two-player zero-sum game under dynamic constraints defined in terms of a hybrid inclusion. The game consists of a min-max problem involving a cost functional that depends on the actions and corresponding (potentially non-unique) solutions, defined as functions of hybrid time and, hence, can flow or jump. We present sufficient conditions given in terms of Hamilton-Jacobi-Isaacs-like equations to establish a bound and to exactly evaluate the worst-case cost under the optimal strategy. Under additional conditions, we show that the proposed optimal state-feedback laws render a set of interest pre-asymptotically stable for the resulting hybrid closed-loop system. The results are illustrated in an application with sporadic jumps and linear quadratic hybrid dynamics.

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

Matrix factorization provides a simple model for studying the training dynamics of neural networks. Recent studies of gradient flow under small initialization have analyzed how trajectories escape from a neighborhood of the origin and approach their first nonzero stationary point. In this paper, we study continuous-time dynamics that applies a finite number of Newton-Schulz iterations to the normalized matrix gradient (Muon). We show that the number of Newton-Schulz steps can change the rank selected during the early stages of training and allow the resulting trajectory to bypass the first nonzero stationary point approached by gradient flow. Under an additional residual-inertia condition, we prove that bypass occurs for all sufficiently large finite Newton-Schulz depths and provide an explicit sufficient threshold. We also construct an example in which the bypass threshold is four.

comments
83 pages,1 figure
fields
Optimization and Control
pdf ↗ page arXiv:2611.05022 ↗

Stochastic variance-reduced gradient (SVRG) uses a full gradient at a snapshot point to correct inexpensive component gradients. This fourth expository note on variance reduction explains that control variate and gives a self-contained proof of linear convergence for the classical strongly convex finite-sum setting. Each component is assumed convex and smooth, while only their average must be strongly convex. A second-moment bound links the estimator to the objective gaps at the current iterate and the snapshot. Summing a distance recursion over an epoch then yields a geometric decrease and an oracle complexity of order $(n+L/μ)\log(1/τ)$ for objective accuracy $τ$, with the initial gap fixed. The result uses a random snapshot update and counts all full-gradient computations. No new algorithm or rate is claimed.

fields
Optimization and Control
pdf ↗ page arXiv:2611.05075 ↗

Practitioners of linear programming widely believe that reformulating a linear program (LP) offers little benefit to interior-point methods: their iteration counts are famously insensitive to the formulation, so the payoff of reformulation beyond automatic presolve and customized linear solve is modest. This paper presents evidence that the same is not true of first-order solvers built on the primal-dual hybrid gradient method (PDHG), such as PDLP. Unlike interior-point methods, PDHG-type methods have per-iteration costs governed by the matrix representation of the formulation and iteration counts governed by its geometry, and both change under equivalent reformulations. We describe a general reformulation recipe: constraints drawn from a catalogue of projection-friendly polyhedra can be absorbed into the projection step of PDHG. We analyze what absorption does to the four constants that govern restarted PDHG: the coupling norm, the termination certificate, the distance scale, and the sharpness modulus. We perform the reformulation on two case studies. On the LP relaxation of quadratic unconstrained binary optimization (QUBO), absorption makes any step size below $1$ admissible on every instance, and yields a fully explicit linear rate. On the LP relaxation of the joint replenishment problem (JRP), whose optimum certifies a $2$-approximation for an NP-hard inventory problem, absorption improves the coupling norm and eliminates every matrix-vector product. Both reformulations run on GPUs with custom kernels in place of sparse matrix-vector products. We benchmark both against the GPU LP solver cuPDLPx applied to the original formulations. By solve time, the reformulated solvers are $6.4$-$9.6\times$ faster on QUBO and $6.1$-$28.9\times$ faster on the JRP. They take $1.7$-$4.3\times$ and $13.6$-$52.3\times$ fewer iterations respectively.

comments
30 pages, 0 figures
fields
Optimization and Control
pdf ↗ page arXiv:2611.05076 ↗

Risk and reliability analysis are fundamental to the design, assessment, and operation of safety-critical complex systems; however, their integration into next-generation computational tools is constrained by the cost of uncertainty quantification with expensive computational models. The computational challenge is particularly prohibitive for tail-sensitive quantities, such as probabilities of failure, conditional values-at-risk, and buffered probabilities of failure, where accurate estimation can require a large number of model evaluations. Multifidelity methods provide a framework for addressing this computational bottleneck by combining information from models of varying accuracy and cost while retaining the predictive accuracy of the high-fidelity model. This review summarizes the state of the art in methods that enable scalable risk and reliability analysis using multifidelity control variates, multifidelity importance sampling, and multifidelity active learning.

comments
Review article
fields
Optimization and Control
pdf ↗ page arXiv:2611.05087 ↗

This paper introduces the Location-Routing Problem with Delivery Preferences, a last-mile delivery problem with service flexibility that integrates collection-point activation and routing decisions while accounting for customer choice. The company determines which collection points to activate, which customers to offer home delivery, and the corresponding delivery route. Customers subsequently decide whether to accept the proposed home-delivery service or collect their parcels from an activated collection point according to ranked preferences over delivery time intervals and collection points. This hierarchical interaction is modeled through a bilevel optimization framework, which can be formulated as a mixed-integer bilevel program that incorporates compensation mechanisms for service inconvenience. Two equivalent single-level reformulations that exploit the structure of the customers' problems are developed. In addition, a two-phase heuristic is proposed to generate feasible solutions that can be used as warm starts for the formulations. The computational experiments run to compare the performance of the formulations, show that the warm-start strategy becomes particularly effective as the instance size increases. The comparison with a benchmark model that ignores customer preferences indicates that explicitly accounting for customer choice alters the resulting location-routing configuration while improving customer preference satisfaction at a small increase in the company's overall cost. These findings highlight the importance of jointly considering operational efficiency, service flexibility, and customer autonomy in last-mile delivery planning.

fields
Optimization and Control
pdf ↗ page arXiv:2611.05230 ↗

This work considers stepsize schedules for gradient descent on smooth strongly convex objectives. We develop a curvature-dependent concatenation framework for constructing stepsize schedules of arbitrary length with sharp worst-case guarantees. Within this framework, we introduce two families of schedules for the function-value gap and gradient norm of the last iterate, respectively. For each fixed condition number $κ=L/μ>1$, both families attain iteration complexity $Θ(κ^ρ\log(1/ε))$ for sufficiently small $ε$, where $ρ=\log_{\sqrt2+1}2\approx0.7864$. This complexity is optimal up to a subpolynomial factor in $κ$ among predetermined nonnegative stepsize schedules. The framework also recovers the strongly convex silver schedule at power-of-two iteration budgets and applies to smooth convex and smooth weakly convex functions.

fields
Optimization and Control
pdf ↗ page arXiv:2611.05242 ↗

Alternating online mirror descent (AltOMD) is a simple learning rule for zero-sum games, which improves upon simultaneous OMD numerically and theoretically. Previous work obtained $O(T^{1/3})$ and $O(T^{1/5})$ regret bounds for AltOMD, by leveraging modified-energy-function-based analyses. However, settling whether AltOMD achieves near-constant regret has remained an open question. In this paper we resolve the question of whether AltOMD achieves near-constant regret in the affirmative. In particular, we show an $O(log(T))$ regret bound on the sum of the players' external regrets for any two-player zero-sum bilinear game with compact convex strategy sets, under mild regularity assumptions on the regularizers. We verify that our assumptions hold for the negative entropy regularizer, thereby obtaining logarithmic regret for the alternating multiplicative weights updates algorithm. The regret bound also yields an $O(log(T)/T)$ duality gap bound for the averaged strategies.

fields
Optimization and Control
pdf ↗ page arXiv:2611.05243 ↗

Efficient preconditioning plays an important role in large-scale first-order optimization. In this paper, we propose an adaptive accelerated optimistic dual averaging ($\text{A}^2$ODA) method for unconstrained convex optimization that adopts low-cost preconditioning based on $p$-norm geometry for $p\in[2,\infty]$. The method is line-search-free and employs a new stepsize selection technique based on an aggregated affine lower model. Its update structure is simple and unified across $p\in[2,\infty]$, with the case $p>2$ requiring no more elaborate updates than the Euclidean case $p=2$. Under a generalized local smoothness condition, we derive a convergence bound that separates the effects of constant and gap-dependent curvature, with the latter potentially yielding faster-decaying terms. In the special case of local smoothness, this bound recovers a nearly optimal convergence rate.

fields
Optimization and Control
pdf ↗ page arXiv:2611.05334 ↗

Minimum shipment quota regulations ensure that socially critical commodities are not excluded from capacity-constrained freight markets by profit-driven allocation. Existing models of such regulation are deterministic and static, assuming perfect market knowledge and instantaneous convergence to a rational equilibrium. This paper relaxes both assumptions through a framework combining adaptive robust optimization, multi-objective optimization, and evolutionary game theory. A robust optimization model first characterizes the regulator's quota-setting problem under uncertain commodity availability, trading social welfare against enforcement cost to generate a Pareto frontier of quota policies. This frontier then defines the regulator's strategy space in a three-population evolutionary game in which the regulator, suppliers, and carrier co-evolve under replicator dynamics, so that the prevailing policy emerges from the interaction of the three players. The framework is calibrated to a Canadian rail freight case study that covers crude oil, corn, barley, and oat. Quota regulation raises social welfare from 65.0 to 288.2 million CAD, at an enforcement cost of about 2% of the gain. Two findings carry particular policy weight: capacity shortfalls fall entirely on unprotected commodities the carrier ships voluntarily, sparing both the highest-margin and the protected products; and a fall in transport cost can end the regulation while the exclusion it was designed to correct persists, because the margin observable before bidding diverges from the margin prevailing once suppliers adapt.

fields
Optimization and Control
pdf ↗ page arXiv:2611.05364 ↗

Probability29

Bubeck and Sellke's universal law of robustness says that fitting $n$ noisy samples below the noise level with a class of $p$ real parameters forces a Lipschitz constant of order $\sqrt{nd/p}$, when the covariate distribution on $\mathbb{R}^d$ is isoperimetric: smooth interpolation costs a factor $d$ of overparametrization. Its hypotheses are Gaussian-type concentration, a homogeneous covariate law, scalar outputs, and independent samples; we relax each one. Exponential concentration suffices, at the unchanged rate and absolute constant and at the price of a capacity burn-in, some form of which we show is necessary; this gives the law for normalized log-concave covariates, with a $\log d$ loss from the current KLS bound. For heterogeneous mixtures the worst component constant is replaced by the weighted average of the component constants, under a typicality condition on the mixture composition. For vector-valued predictors the bound at the Frobenius Lipschitz scale is free of the output dimension $K$, and the Euclidean bound loses only $K^{-1/2}$, a loss that covariate-independent noise removes. Stationary Markov covariates retain the i.i.d. rate, the pseudo-spectral gap entering only the sample-size conditions. One master theorem carries the shared argument, and constants are explicit throughout.

comments
62 pages
fields
Probability
pdf ↗ page arXiv:2611.03653 ↗

Aggregate lexical frequencies reflect both what speakers do and how a corpus records it. We develop a stochastic framework for lexical adoption, abandonment and reactivation on a temporal multilayer network, together with a count observation model separating speaker prevalence, use intensity and detectability, and ask what such data identify. We give a necessary and sufficient condition for the never-active and dormant states to be merged exactly, collapsing the three-state chain to two, and show that the condition constrains the exposures a given network can deliver, not the response function as a whole. No count design can distinguish use intensity from detectability, an exact invariance distinct from the merely practical loss of information in sparse series. And we prove that in a low-prevalence community approximation the rates enter only through the net growth $β-μ$ and the coupling product $βκ$, so that a one-parameter family of triples has identical trajectories, the only separating information lying in a term quadratic in prevalence whose size depends on the emission scale. Simulations characterise recovery, prediction and sensitivity to misspecification. An exploratory analysis of 144 candidate forms in CREA and CORPES XXI press subcorpora illustrates the consequences: under the chosen emission scale and a symmetric contact graph, very different rate triples give nearly identical fitted trajectories, and in leave-one-country-out comparison with training-only proxies and seeds on a retrospectively selected cohort, a constant-rate count baseline beats the evaluated dynamic specifications on 84 to 94% of forms. These findings neither establish nor refute contact-driven diffusion. They delimit what this model and panel can support, and name the calibration, geographical contrast and repeated speaker observations that would make the question answerable.

fields
Probability
pdf ↗ page arXiv:2611.03664 ↗

Many researchers believe that human lifetime on the interval (30,80) years is described by the Gompertz-Makeham distribution. In this work, the task is set to test this hypothesis. We consider a number of distributions: Gompertz-Makeham, Gompertz-Weibull, Logistic Kannisto-Makeham, Logistic Beard-Makeham and Logistic Beard-Weibull, some of which are partially known, for which comparative calculations on real mortality data are performed using the $χ^2$ criterion. The data were selected for three countries: England \& Wales, Norway and Sweden, cohorts born in 1900. As it turned out, on the interval (30,80) years the Gompertz-Makeham distribution is far from being the best among those listed above. In addition, for the same data, a similar problem was studied for the interval (80,120) years.

fields
Probability
pdf ↗ page arXiv:2611.03666 ↗

We extend the categorical treatment of Bayesian filters to models with feedback, whose transitions and observations may depend on the past observations. We work in the stochastic category, whose objects are measurable spaces and whose morphisms are Markov kernels, which we refer to as stochastic morphisms. We systematically parameterize stochastic morphisms by a measurable space, and develop the calculus of conditioning in a notation intuitively compatible with classical probability theory, requiring neither string diagrams nor densities. A stochastic morphism into a product space is regarded as a parameterized family of joint laws, and its conditional law is again a stochastic morphism, so that the rules of conditioning become equalities of stochastic morphisms. We define the Bayesian inverse with respect to a parameterized prior and prove Bayesian coherence. A model with feedback is then a model whose parameter space grows with the observations, and we derive the Bayesian filter, prediction and smoothing for such models, with standard Borel hidden states and countably generated observation spaces. The affine Gaussian stochastic morphisms parameterized by a measurable space form a family strictly larger than the Markov category $\mathbf{Gauss}$, closed under composition and Bayesian inversion, in which we obtain the Kalman filter and the Rauch-Tung-Striebel smoother with feedback.

comments
36 pages
fields
Probability, Category Theory, Statistics Theory
pdf ↗ page arXiv:2611.03830 ↗

We study convergence in Rényi divergence of order two for underdamped Langevin dynamics, the bouncy particle sampler, and the Zigzag sampler, for a target $e^{-U}$ on $\mathbb R^d$ that satisfies a logarithmic Sobolev inequality, with $\nabla^2U$ bounded below by a possibly negative constant and, for the Zigzag sampler, also bounded above. For initial laws whose Rényi divergence from equilibrium is at most $R$, we show that it decays exponentially, at a rate that depends on $R$. With the friction or refreshment rate chosen according to $R$, the time needed to reach a fixed accuracy in total variation or in Rényi divergence is of order $\sqrt{R\log R}$ at fixed dimension and target parameters, improving the linear dependence obtained by directly converting exponential $L^2$ decay. The key idea is to use the logarithmic Sobolev inequality for the position target in place of the usual spatial spectral-gap estimate in the $L^2$ hypocoercivity argument. For the bouncy particle and Zigzag samplers, this order is sharp for the Rényi divergence on a one-dimensional Gaussian target, uniformly in the refreshment rate. For the Zigzag sampler in dimension at least two, Gaussian examples show that the mixing-time bound is sharp up to logarithmic factors in the worst case over strongly convex targets, in both the initial divergence and the upper Hessian bound; in particular, strong convexity alone does not give a uniform mixing bound.

comments
32 pages. The authors take full responsibility for the mathematical content. Although we do not intend to submit this manuscript for publication in a journal, we believe that the approach to establish Rényi-2 convergence via $L^2$ hypocoercivity may be of general interest, and have therefore made it available on arXiv
fields
Probability
pdf ↗ page arXiv:2611.03921 ↗

We construct a Hilbert-space Markovian lift of weighted sub-fractional Brownian motion for $0<b<2$, including the logarithmic case $b=1$. A Laplace factorization represents the process as the boundary value of a forward curve. In the weighted Sobolev space with derivative weight $r^γ/(1+r)^2$, $0<γ<1$, right translation is strongly continuous and the noise operator is Hilbert–Schmidt if and only if $b+γ>1$. The state norm bounds the total variation of initial curves on compact intervals. For locally bounded deterministic temporal weights, this bound allows the driven scalar equation to be restarted from every lifted state. Under spatial Lipschitz assumptions, with additional time and derivative regularity in the Young case, the solution and forward curve form a time-inhomogeneous Markov process with $C_b$-Feller transitions; both coefficients may have linear growth. Discretization of the Laplace variable gives independent Ornstein–Uhlenbeck factors coupled to the original process through the same Gaussian noise. The nonlinear approximations converge uniformly in time in every finite $L^p$. For uniform spectral partitions with balanced cutoffs, the solution rate is $M^{-(b-1)/3}$ for $1<b<2$, while the uniform driver rate is $M^{-b/4}\sqrt{\log(2+M)}$ for $0<b\le1$. Under stronger coefficient assumptions, we derive error bounds for Young solutions and for the fully discrete scheme, retaining the dependence on the spectral cutoff and specifying joint mesh conditions.

comments
52 pages
fields
Probability
pdf ↗ page arXiv:2611.03926 ↗

In the random-pair Monte shuffle on $n$ cards, each step chooses two positions independently and uniformly and exchanges their cards with probability $1/2$. The chosen positions are public; the decisions to exchange cards remain hidden. We prove that the mixing time in expected conditional total variation distance is $2n\log n+O(n)$, with an exact leading constant and an $O(n)$ cutoff window. To our knowledge, this is the first public-schedule Monte shuffle whose full-permutation mixing time has been determined up to an additive $O(n)$ term. The upper bound follows by comparing two executions with the same public schedule to a classical random-transposition walk. For the lower bound, we construct a schedule-dependent test function and estimate its variance using a matrix-averaging operator. Combined with the depth bound of Czumaj and Lingas, the mixing estimate gives public switching networks with at most $2n\log n+O(n)$ switches and $O(\log n)$ depth for fixed error and failure probabilities. The author obtained this result through interaction with GPT-6 Astra.

fields
Probability
pdf ↗ page arXiv:2611.03959 ↗

The Lee-Yang circle theorem places every zero of a ferromagnetic Ising partition polynomial on the unit circle. The arc condition, that every zero lie in the closed left half-plane, turns the circle theorem into a product formula for the characteristic function of the occupation count and makes it usable for local limit theorems. For the two-row periodic Ising torus we give the exact reflection factorization of the row transfer matrix, reduce the crossing at zeta = i to a real cubic, and identify the critical coupling a_c* = 0.8637850566870... as the unique root in (0,1) of an explicit octic. We prove that every a > a_c* satisfies the arc condition simultaneously for all circumferences, that no smaller coupling does, and that the finite thresholds approach a_c* at the rate C/n^2 with an explicit algebraic constant C. The factorization and the 2x2 threshold are formalized in Lean 4 against Mathlib; the zeta = i reduction, uniformity and rate are analysis-level.

comments
28 pages, 4 figures. Lean 4 formal core; the analytic uniformity and rate arguments are paper-level
fields
Probability
pdf ↗ page arXiv:2611.04165 ↗

The binary perceptron is a random constraint satisfaction problem that asks for a sign vector satisfying a system of random linear inequalities. Its solution space has a strikingly extreme geometry: at every positive constraint density, all but a vanishing fraction of the solutions are isolated. Yet polynomial-time algorithms find solutions at small enough constraint density, which raises the question of how efficient algorithms navigate such a landscape. Linear programming is a natural algorithm to study here, but its analysis has so far been limited to a single round. Li, Schramm, and Zhou (STOC 2025) analyzed one linear program followed by iterative rounding. In this work, we overcome this limitation and give a precise analysis of iterated linear programming for the binary perceptron. (1) For Gaussian matrices and any fixed number of rounds, we characterize the iterated linear programs exactly through a deterministic state-evolution recursion. (2) Adding a final rounding step, we obtain a randomized polynomial-time algorithm for the binary perceptron. Numerical evaluations of the recursion provide evidence that it succeeds at constraint density $α=0.60$ with zero margin, well beyond the range $α\le0.1$ guaranteed by the single-LP analysis and $α\approx0.327$ (Jo and Lee, 2026), the best guarantee so far. (3) We establish universality, showing that the same characterization holds for matrices with i.i.d. entries drawn from any centered, unit-variance subgaussian law. The key idea of our proof is that, although conditioning on earlier rounds makes the matrix non-Gaussian, its conditional law can be computed explicitly and remains close to a Gaussian law, so the convex Gaussian min-max theorem applies in every round. For universality, we compare Gaussian and subgaussian matrices through the Lindeberg principle, using a regularized version of each linear program.

comments
81 pages, 4 figures
fields
Probability
pdf ↗ page arXiv:2611.04294 ↗

This article investigates the stability of a class of multidimensional stochastic systems driven by a symmetric $α$-stable process with $1<α<2$. These driving processes have infinite second moments, which prevents the direct application of standard second-moment methods and may lead to divergent jump integrals in the generators of quadratic Lyapunov functions. We establish criteria for $p$th-moment exponential stability and almost sure exponential stability. A numerical example illustrates the theoretical results.

fields
Probability
pdf ↗ page arXiv:2611.04308 ↗

An ordered deck of $n$ cards is subjected to $k$ independent Gilbert–Shannon–Reeds riffle shuffles. A player then guesses each card without feedback, with repeated guesses allowed. For every fixed $k\ge1$, we prove that, once $n$ is sufficiently large, an optimal guess at position $i$ in the top half of the deck is $\lfloor i/2^k\rfloor+1$; the bottom-half strategy is obtained by reflection. We also show that the optimal expected number of correct guesses is $2\sqrt{n/((2^k-1)π)}+O_k(1)$. Our starting point is the result of our earlier work that the label at each position is distributed as an equally weighted mixture of $2^k$ components, each a shifted sum of two independent binomial random variables (a Poisson-binomial distribution). The proof of the optimal strategy combines three ingredients: a uniform concentration estimate that separates the mixture components, exact binomial inequalities that control the gaps between competing peaks, and a coefficient comparison that resolves modal ties. The expected-score asymptotic is proved independently of the strategy, using only the peak heights of the mixture components.

fields
Probability, Combinatorics
pdf ↗ page arXiv:2611.04339 ↗

Given an unstable linear scalar differential equation $dx(t)=θx(t)dt$, $θ>0$, we show that it can be almost surely exponentially stabilized by a discrete-time feedback control driven by a general $α$-stable process. More precisely, consider the stochastically controlled system $dx(t)=θx(t)dt+bx(\lfloor t/τ\rfloorτ)dZ(t)$, where $Z(t)$ is a general $α$-stable process with $α\in(1,2)$, and $\lfloor t/τ\rfloor$ denotes the integer part of $t/τ$. Unlike the extensively studied driven Brownian-driven case, the $α$-stable process has no finite second moment, so high-order moment methods are no longer applicable. By using fractional moments, characteristic functions, and moment inequalities for $α$-stable stochastic integrals, we prove that the stochastically controlled system is almost surely exponentially stable provided that the inequality $|bσ|^α\left(1-β\operatorname{sgn}(b)\tan^2\frac{πα}{2}\right)>(θ+bμ) \frac{-1}{Γ(α)\cos\frac{απ}{2}}$ holds, and that $τ>0$ is sufficiently small.

fields
Probability
pdf ↗ page arXiv:2611.04340 ↗

A classical Brownian-bridge representation of Riemann's xi function defines an even, rapidly confining probability density and a reversible Langevin model. Our principal physical observable is the transient variance after a quadratic-potential quench; we also analyze a tilted bridge-range response and a sixth-order cumulant gap. For a specified passive harmonic trap with bounded delayed residual feedback, we derive a non-vacuous finite-time variance-increase bound under explicit calibration and sampling assumptions. An elementary global curvature estimate and de Bruijn's strip-contraction theorem give a direct proof of a strict susceptibility bound for every nonnegative quadratic tilt, without assuming the Riemann hypothesis. The inequality itself is a classical GHS consequence, valid more generally for every real quadratic tilt. Reversibility then gives explicit finite-time response and deterministic-control action bounds (not thermodynamic energy). The same curvature estimate gives monotone variance relaxation after an outward quadratic quench, with an exponential deficit bound. At the undeformed density, all alternating zero-field cumulant signs and the displayed low-order cumulant gap are also unconditional; neither is an RH test. The genuinely stronger RH-conditional structure is a positive Stieltjes representation and positive semidefiniteness of divided-difference matrices of every size. At the undeformed density that entire matrix hierarchy is equivalent to RH. We separate these exact statements from finite-sample confidence bounds, numerical discretization evidence, and theoretical physical implementations. The work supplies neither a proof of RH nor a laboratory realization.

fields
Probability
pdf ↗ page arXiv:2611.04359 ↗

We study the self-consistent common-noise equation associated with the Weil–Petersson response differential of the rotationally marked SLE welding probability. For $0<κ\leq4$, we prove joint weak uniqueness among continuous adapted weak solutions whose law at each deterministic time is the welding probability, and obtain the Markov property in the original filtration. A conditional Gaussian lift and capacity localization give the required $L^1$ generator-range density. Identification with the canonical law gives stationarity and reversibility. We also construct autonomous Fejér and Poisson regularizations with pathwise-unique global strong solutions. Their joint state-noise laws converge to the canonical law for every initial probability absolutely continuous with respect to the welding probability.

fields
Probability, Mathematical Physics, Functional Analysis
pdf ↗ page arXiv:2611.04417 ↗

We deal with the following two pick-up sticks problems: given an integer n greater than or equal to 3, we choose n sticks with independent random lengths from an exponential distribution or Pareto type I distribution, and we are interested in the probability that no three of them can be the sides of a triangle. In case of exponential distribution, this problem has been solved by other authors: the probability in question is equal to $n!/\big((F_3-1)(F_4-1)\cdots(F_{n+2}-1)\big)$, where $(F_i)_{i=1}^\infty$ is the sequence of Fibonacci numbers. We give a new, self-contained and detailed proof for this formula, which uses a different method compared to the earlier ones. In case of Pareto type I distribution, we derive new formulae for the corresponding probability.

comments
23 pages
fields
Probability, Metric Geometry
pdf ↗ page arXiv:2611.04436 ↗

While the mean field limit of the Brownian particles with 3D Coulomb interaction has been resolved starting from the Liouville equation, the justification directly from the random trajectories is not fully resolved. In our previous work (J. Math. Phys., 60, 111501, 2019), it has been shown that the time marginals of any limit point of the empirical measure form a weak solution to the mean field nonlinear Fokker-Planck equation. However, the identification to the strong solution is not established due to the lack of regularity. In this short note, we first make use of the variational formulation of the quadratic function to establish the desired space-time $L^2$ bound mentioned already in J. Math. Phys., 60, 111501, 2019. This fills gap and shows that the time marginals must be the must be the strong solution. Moreover, making use of the virial type estimates and the force dissipation, we also establish the propagation of chaos in path space directly from the random trajectories of the particle systems.

fields
Probability
pdf ↗ page arXiv:2611.04495 ↗

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 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 sphere 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
14 pages
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2611.04781 ↗

For one-dimensional diffusion processes with arbitrary diffusion coefficient $D(x)$ and Ito force $F_I(x)$, we analyze the statistical properties of the renormalized trajectories at scale $Γ$, where one keeps only the alternating sequence of local minima and local maxima that are separated by drawups and drawdowns of amplitude bigger than $Γ$. The elementary RG-step between $Γ$ and $Γ+d Γ$ thus amounts to eliminate the drawups and drawdowns of amplitude $Γ$, a real-space-RG-procedure that is well-known for Brownian trajectories in the context of the Strong-Disorder-RG approach applied to the disorder landscape of random models. The main result is that the universality classes are determined by the scale function $s(x)$ satisfying $D(x) s''(x)+F_I(x) s'(x)=0$ that governs the exit probabilities from an interval : all the diffusions sharing the same scale function $s(x)$ have the same statistics of renormalized trajectories, even if their initial microscopic trajectories are completely different. The simplest universality classes for diffusions on the whole line $x \in ]-\infty,+\infty[$ and on the half-line $x \in ]0,+\infty[$ are illustrated with several examples of processes, with or without steady states: Cauchy, Student, Bessel, Fisher-Snedecor, Geometric Brownian. This framework concerning diffusion processes is then adapted to discrete-time and to continuous-time random walks on the one-dimensional lattice with arbitrary nearest-neighbor jump probabilities or rates.

comments
45 pages
fields
Probability
pdf ↗ page arXiv:2611.04853 ↗

In this work, we prove exponential decay for the spin correlation of the spin $O(\mathsf{N})$ model for $\mathsf{N}\geq3$ at every inverse temperature $ β>0 $. In particular, our work confirms Polyakov's prediction in 1975 on the Heisenberg model, i.e., the case of $\mathsf{N}=3$. To this end, we investigate a generalized $O(\mathsf{N})$ model where $ \mathsf{N} $ is a positive \emph{real number}, as follows: we sample a loop soup on the metric graph (say of a box) with intensity $ \tfrac{\mathsf{N}}{2} $ subject to the conditioning that the local time at each lattice vertex is $β$, and then for each loop we independently assign it to copies $1\leq \mathsf{i}\leq \lceil\mathsf{N}\rceil$ such that it is assigned to copy $\mathsf{i}$ with probability $ \tfrac{1}{\mathsf{N}} $ for $ 1\leq \mathsf{i}\leq \lfloor\mathsf{N}\rfloor $. Then, by Lupu's isomorphism theorem, we can construct a spin field by assigning a random sign to each loop soup cluster in each copy independently, such that the field coincides with the spin $O(\mathsf{N})$ model when $\mathsf{N}$ is an integer. We then establish exponential decay for every real-valued $\mathsf{N}>2$. Our result reveals an underlying mechanism for exponential decay, which emerges as soon as $\mathsf{N}>2$ (i.e., as soon as beyond the range of the XY model) and does not necessarily rely on the rotation symmetry in the sphere $ \mathbb{S}^{2} $.

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

We consider the incompressible Navier–Stokes equations in a smooth bounded domain in dimension two or three, with Dirichlet boundary conditions, when the velocity is advected by a rapidly varying stationary Markov process $\eps^{-1}m(t/\eps^2)$. The fast field may be spatially inhomogeneous. We prove that, when $\eps\to0$, the laws of the large-scale velocities are tight and that their limit points are martingale solutions of the stochastic Navier–Stokes equations with transport noise in the form of the location uncertainty framework. The limiting equation contains in particular a noise which is described in terms of the covariance of the fast advection. Under a symmetry assumption on the temporal correlations of the fast field, the noise is Stratonovich and an advection by the Itô–Stokes drift appears. The proof relies on perturbed test functions, which we use both for the uniform energy bounds and for the identification of the limit. We have to adapt this method and add the Stokes operator to the Poisson equation associated to the fast advection in order to use fewer regularity assumptions and obtain correctors which satisfy the boundary conditions.

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

We establish the well-posedness of strong solutions for a class of degenerate mean-field stochastic differential equations with coefficients satisfying non-Lipschitz conditions. The diffusion coefficient is not required to be non-degenerate. Both the diffusion and the drift coefficients may depend on the law through the Kantorovich-Rubinstein metric with an arbitrary modulus of continuity. The drift and the diffusion satisfy a dimension-dependent Osgood-type condition, that becomes particularly sharp in dimension one. The proof combines the classical Yamada–Watanabe argument with Schauder's fixed-point theorem and does not rely on Gaussian estimates, allowing us to cover degenerate diffusions where such estimates are not available. This fills a gap in the existing literature.

fields
Probability
pdf ↗ page arXiv:2611.05091 ↗

We determine the monochromatic three-arm exponent for critical planar percolation through the exact spectral threshold of an explicit positive integral operator family with elementary kernels, obtaining $ξ_3=0.76928375\cdots$. Unlike the monochromatic two-arm (backbone) event, the three-arm event can be obstructed by two distinct white clusters, so a Markovian exploration must retain the past connections. We introduce a two-point boundary observable that records these connections. Using the coupling between conformal loop ensemble (CLE) and Liouville quantum gravity (LQG), this observable satisfies a renewal equation in terms of quantum boundary lengths, and yields the explicit operator whose spectral information determines $ξ_3$. Our approach also gives an explicit spectral characterization of monochromatic $n$-arm exponents for all $n\ge4$.

comments
41 pages, 5 figures
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.05101 ↗

We study the superhedging of American claims with an irregular optional payoff process $ξ$ over the full set $\mathcal{M}(X)$ of equivalent local martingale measures of a locally bounded market. We show that a process which is a strong optional supermartingale of class (D) under every $Q\in\mathcal{M}(X)$, with no bound from either side, decomposes as $S=S_0+\int H\,dX-A-C_-$, with a common integrand $H$, a right-continuous increasing process $A$ and a purely discontinuous increasing process $C$ given explicitly by the right jumps of $S$. For the robust Snell envelope this yields the superhedging duality $p_0(ξ)=\sup_{Q}\sup_τE^Q[ξ_τ]$ with an explicit optimal strategy and no regularity of $ξ$ in time. Unbounded payoffs are covered when $\{ξ_τ\}$ is uniformly integrable jointly over measures and stopping times, or when $|ξ|$ is dominated by a traded uniformly integrable martingale. For payoffs bounded below, the price is attained by wealth bounded below by a constant. For payoffs unbounded below this can fail, already in a complete market, and the price is attained once the constant bound is replaced by $-M$, with $M$ a traded martingale dominating $|ξ|$. In an incomplete Brownian market we study the associated reflected BSDE with an optional obstacle and a Lipschitz driver depending on the value. We prove existence and uniqueness of the minimal supersolution, a representation at stopping times, comparison and an equivalent dynamic minimality condition, for bounded data and for data dominated by a traded martingale. For a European-type obstacle, the Skorokhod conditions on the total regulator hold for some supersolution if and only if the terminal claim is attainable by a bounded wealth process; so in an incomplete market some data admit no supersolution satisfying them, while the right-jump regulator always satisfies its contact condition.

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

We study a fundamental problem in machine learning: partial recovery of a planted signal $\boldsymbol{v} \in \mathbb{S}^{n-1}$ from a spiked tensor $\boldsymbol{\mathsf{X}} = λ\, \boldsymbol{v}^{\otimes p} + \boldsymbol{\mathsf{Z}}$, where $\boldsymbol{\mathsf{Z}}$ has symmetric Gaussian entries of variance $\asymp n^{-1}$. While previous works replace $\boldsymbol{\mathsf{Z}}$ by an i.i.d. standard Gaussian tensor to circumvent technical difficulties caused by dependencies, this paper directly analyzes the symmetric model via random matrix theory. We show that the square unfolding algorithm is subject to a sharp phase transition for partial recovery at $λ\asymp n^{(p-2) / 4}$, validating an open conjecture from Montanari and Richard (2014). We get precise expressions for the limiting spectral distribution, deterministic equivalent, phase transition threshold and overlap. The main message is that unfolded symmetric tensors spectrally behave like standard Wigner matrices, up to simple transformations accounting for high-order symmetries. We consider extensions to multiple orthogonal spikes, recursive unfolding and non-square unfolding via disproportionate random matrix theory, leading to an interesting conjectured statistical-computational tradeoff regarding the choice of unfolding: square versus long.

fields
Probability
pdf ↗ page arXiv:2611.05137 ↗

We establish weak existence for McKean–Vlasov stochastic differential equations associated with granular medium equations with porous medium diffusion, for m>1 in arbitrary dimension. The result covers a class of nonconvex potentials with locally Lipschitz gradients of polynomial growth. Our particle approximation generates nonlinear diffusion through density-dependent noise and allows initial densities with finite Boltzmann entropy but infinite internal energy.

fields
Probability
pdf ↗ page arXiv:2611.05256 ↗

We study critical Gibbs partitions whose component law is in the domain of attraction of a spectrally positive stable law of index one. In the dense phase, we prove a local limit theorem for the number of components and functional limits for their sizes. We also describe convergent and divergent condensation regimes, and a phase transition at a boundary in which the dense and condensation contributions compete.

fields
Probability
pdf ↗ page arXiv:2611.05285 ↗

We continue the study of bond percolation on finite graphs induced by the level-sets of the zero-average Gaussian free field on the associated metric graph. In our previous work Goswami and Pal (2026), we analyzed the critical and near-critical behavior of this model on uniform expanders, focusing on the volume of the largest cluster. In the present paper, we investigate the size of the second largest cluster in the supercritical regime --- the phase where one expects a unique giant component. We prove that the second largest cluster is at most of logarithmic order with high probability. The estimates hold uniformly over deterministic graphs with a bounded maximum degree and a spectral gap bounded away from zero. In particular, we do not require any assumption regarding regularity, girth or local geometry. This picture is substantially different from Bernoulli percolation, where the second largest supercritical cluster can have polynomial volume under identical hypotheses. The proof relies on expansion properties of the underlying graph and the Dirichlet martingale framework developed in Goswami and Pal (2026).

comments
14 pages, comments are welcome
fields
Probability, Combinatorics
pdf ↗ page arXiv:2611.05299 ↗

We establish quantitative non-Gaussian and Gaussian approximations for edge-count fluctuations in dense exponential random graphs at single-phase criticality of any fixed even order $2m_*\ge 4$. The Hamiltonians use injective homomorphism counts of fixed simple graphs, with nonnegative leading coefficients for the higher-order terms. In bounded calibrated windows, edge-density fluctuations on the scale $n^{-1/m_*}$ admit an explicit non-Gaussian approximation with error $O(n^{-1/m_*})$. For parameter perturbations by fixed multiples of $n^{-1}$ with a nonzero first-order drift correction at the critical density, the deterministically centered edge count admits a Gaussian approximation on the scale $n^{(3m_*-2)/(2m_*-1)}$, with error $O(n^{-1/(2m_*-1)})$. Both rates hold in Wasserstein and Kolmogorov distances. The key step is to construct auxiliary kernels for exterior graphs outside an event of exponentially small probability. These kernels contract uniformly on the full row state space and agree with the conditional Gibbs updates on typical row configurations, yielding the conditional cumulant estimates used in Stein's method.

fields
Probability
pdf ↗ page arXiv:2611.05318 ↗

We consider the sign clusters of the Gaussian free field on the cable system of a transient weighted graph with volume growth exponent $α$ and Green function decay exponent $ν$. We prove that the probability that the cluster of a vertex reaches distance $R$ is of order $R^{-β}$ when $2α<3ν$, where $β=α-ν$ is the walk dimension, and that the same holds up to a logarithmic factor in the upper bound when $2α=3ν$. On $\mathbb Z^d$ these conditions read $d>6$ and $d=6$. The upper bound combines a general entropic bound, which compares the law of the cluster under the critical loop soup and under a massive one, with a Simon-Lieb-type inequality for the massive field derived from its Markov property. The arguments are robust and require no transitivity. The lower bound follows from a competition between the capacity and the volume of the cluster. In both bounds, the key quantity is the expected exit time of the random walk from balls, which links the volume of the cluster to its radius.

comments
17 pages
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2611.05357 ↗

Information Theory24

The construction of optimal binary linear complementary pair (LCP) has recently attracted considerable attention in coding theory. Based on the Belov codes, this paper proposes a novel construction of optimal binary LCPs with $θ=4$, extending our previous work on $θ=3$. Our results not only yield abundant new optimal binary LCPs with flexible parameters, but also enable more optimal binary LCPs with smaller minimum distances.

comments
31 pages, accepted by SETA 2026
fields
Information Theory
pdf ↗ page arXiv:2611.03733 ↗

The surge in global mobile traffic, driven by 5G adoption and emerging applications, necessitates new spectrum allocations for 6G systems. With most major swaths of spectrum below 15 GHz already allocated to other services, co-existence between cellular and incumbent services such as satellite or radar systems is critical to make such spectrum accessible for 6G. At the same time, the advent of artificial intelligence offers a new opportunity for designing more efficient spectrum sharing techniques. This paper presents four novel data-driven spectrum access techniques to enable efficient use of spectrum for the 6G era: 1) co-existence technique for efficient protection of fixed incumbent receivers within an established protection area; 2) data-driven approach for protecting satellite receivers via control of radiated power above the horizon; 3) spectrum sensing-based fast-time-scale physical resource block blanking; and 4) base station-based spectrum occupancy detection to enable fast-time-scale spectrum sharing with satellite and non-terrestrial network incumbents. These techniques leverage artificial intelligence and extreme multiple-input multiple-output capabilities to enable efficient spectrum co-existence/sharing while maintaining cellular network performance.

comments
Accepted for publication in the IEEE Communications Magazine
fields
Information Theory
pdf ↗ page arXiv:2611.03816 ↗

This paper investigates whether low-order packet-loss statistics suffice to assess survival-time risk under bursty packet losses, i.e., the probability that no update succeeds for a prescribed number of consecutive slots. Conventional models, such as the Gilbert model, characterize packet losses using the loss rate and mean burst length, but channels sharing these statistics may exhibit substantially different failure risks. We characterize the Markov channels one order above a given low-order fit that share its statistics and analyze their risks under acknowledgment-based scheduling with transmission budgets. We show that, with dense transmission attempts, risk is primarily governed by loss persistence beyond the modeled memory, and the worst-case channel need not be the most persistent one. Under limited budgets, retry spacing makes loss relapse probabilities important and can reverse the risk ordering of compatible channels. Numerical and measurement results show that low-order models can substantially underestimate the risk, highlighting the need for scheduling-dependent channel statistics.

comments
6pages, 4 figures
fields
Information Theory
pdf ↗ page arXiv:2611.03871 ↗

We consider a UAV-assisted status-update system in which a rotary-wing unmanned aerial vehicle (UAV) collects updates from multiple sensors, stores the newest update of each sensor, and forwards selected buffered updates to a ground station (GS). We minimize a weighted sum of the time-average GS-side age of information (AoI) and UAV energy consumption over a finite horizon. The optimization is subject to half-duplex operation, sensor and UAV energy-causality constraints, transmission-rate and power limits, and a terminal-location constraint. Because collection changes the information age at the UAV but does not reduce the GS-side AoI until the buffered update is forwarded, mobility, collection, and forwarding decisions are coupled over time. We use a hierarchical AoI-energy actor-critic (HAE-AC) controller in which a coarse-timescale actor selects return-feasible UAV movements, while a deterministic per-slot scheduler constructs feasible collection or forwarding sets and assigns the minimum transmit power required for each scheduled transmission. In a 100-sensor deployment, HAE-AC reduces the average GS-side AoI by about 22% relative to an adaptive staleness-gated benchmark. Compared with forward-upon-collection, selective buffered forwarding reduces the number of downlink bursts by roughly 30% while increasing the number of collections per sensor by more than 23%.

comments
5 pages, 3 figures. Author's accepted manuscript. Accepted for publication in the proceedings of the 2026 Asilomar Conference on Signals, Systems, and Computers
fields
Information Theory
pdf ↗ page arXiv:2611.03884 ↗

We study statistical inference and function evaluation problems in which the input binary vector is available only through a binary linear sketch, i.e., a fixed number of parity measurements. We show that under a certain monotonicity condition, simply truncating the input by retaining a subset of its coordinates is optimal among all linear sketches of the same size. In particular, this applies to distributed testing of correlations of binary vectors when they are of opposite signs and evaluating unate Boolean functions on uniformly random inputs. Additionally, given that truncation is optimal, we immediately have lower bounds for arbitrary binary linear sketches. To illustrate this application, we consider the one-way communication complexity of a distributional graph connectivity problem on $n$ vertices and show that truncation, and hence all binary linear sketches, requires $Θ(n \log n)$ bits to achieve constant error, while a nonlinear protocol only requires $O(\log n)$ bits.

comments
20 pages. Submitted to STOC 2027
fields
Information Theory
pdf ↗ page arXiv:2611.03979 ↗

We construct binary codes that attain the classical Gilbert-Varshamov redundancy guarantee for a fixed number of edit errors, with deterministic polynomial-time construction, encoding, and decoding. For every fixed integer $t\ge 1$ and all sufficiently large block lengths $n$, our codes correct any combination of at most $t$ insertions, deletions, and substitutions in total, with redundancy at most $2t\log_2 n+O_t(1)$. All algorithms run in polynomial time in $n$ for fixed $t$, and decoding recovers the original information message. This realizes the classical counting guarantee algorithmically without enumerating the exponentially large space of binary words.

fields
Information Theory
pdf ↗ page arXiv:2611.04023 ↗

Quantum low-density parity-check (QLDPC) codes are promising for fault-tolerant quantum computing, but their decoding algorithms present significant hardware implementation challenges. Reinforcement-learned sequential belief propagation (RL-S) improves the error-correction performance of conventional belief propagation (BP) through adaptive variable-node scheduling. However, its heap-based priority management introduces substantial hardware overhead. This paper presents hardware implementations of BP, RL-S, and bucket-based reinforcement-learned BP (BRL-S) for the [[288,12,18]] bivariate bicycle QLDPC code. The BRL-S architectures employ quantized priorities and first-in, first-out (FIFO) buckets to simplify scheduling. Three configurations with two, four, and eight priority levels are evaluated. FPGA synthesis results demonstrate that BRL-S reduces lookup-table utilization by approximately 68–72% compared with RL-S. ASIC synthesis further shows reductions of 63–67% in area and 64–69% in estimated power consumption. These results demonstrate that bucket-based scheduling substantially improves the hardware efficiency of reinforcement-learned QLDPC decoders.

fields
Information Theory
pdf ↗ page arXiv:2611.04179 ↗

Histogram estimation is a fundamental primitive in distributed data analysis, with applications in counting queries and federated learning. In many settings, the universe of categories is enormous, yet each user's data involves only a small subset, yielding sparse local histograms. This raises a natural question: To what extent can local sparsity reduce the communication needed to estimate the global histogram? We answer this question by characterizing the communication complexity of distributed sparse histogram estimation under prescribed $\ell_1$ distortion and failure probability constraints. Our upper bound is achieved by a randomized covering scheme that optimizes how accurately each user represents its local histogram to reduce communication. By exploiting the distortion budget directly rather than imposing unbiasedness, the scheme achieves lower communication costs than standard unbiased sampling and hashing constructions. We establish the scheme's first-order optimality through a lower bound based on local support identification. The key step is to relate communication cost directly to the number of active coordinates revealed by each user's message, rather than to bound information about the aggregate via distance-based Fano's inequalities. This characterization further quantifies how the communication advantage of heterogeneous over homogeneous encoders varies across parameter regimes.

fields
Information Theory
pdf ↗ page arXiv:2611.04285 ↗

Quantifying the dimensionality of data is a fundamental need in machine learning and signal processing applications such as representation learning, data compression, and inverse problems, where the extrinsic dimension in which the data is presented can be very different from the intrinsic dimension that determines the operational performance. Various concepts, such as Rényi information dimension, rate-distortion dimension, and quantization dimension are useful here. Despite their theoretical significance, estimating these measures are challenging given their asymptotic definitions. Recent research has shown that analyzing the pairwise distortion distribution (PDD) of a data source can provide a tractable lower bound on the distortion of random codebook quantization, from which a tractable notion of intrinsic dimension can be derived. In this paper we extend this line of research in three main ways. First, we develop a related upper bound on distortion of random codebook quantization. Second, we improve the computability of both the lower and upper bounds, using a graph-based adaptive importance sampling approach. Third, we leverage the bounds to define new notions of intrinsic dimension which form upper and lower bounds on the Rényi information dimension, rate-distortion dimension, and quantization dimension, and which can be empirically estimated from unknown data sources. We illustrate the concepts by analyzing several artificial and empirical distributions.

comments
22 pages, 5 figures
fields
Information Theory
pdf ↗ page arXiv:2611.04341 ↗

We establish a conditional quantum Kac-Bernstein theorem for mixing of two independent, finite-mode bosonic inputs with quantum memories. We characterize exactly when the outputs are conditionally independent given both memories. Each input then decomposes into orthogonal memory sectors sharing a common Gaussian state on the physical system and a bosonic memory factor, up to sector-dependent physical displacements. In particular, triviality of the common bosonic factor implies separability of the inputs, as occurs whenever either memory has finite-dimensional support.

fields
Information Theory, Mathematical Physics
pdf ↗ page arXiv:2611.04363 ↗

Binary prefix coding assigns prefix-free binary words to symbols to minimize their frequency-weighted cost. Huffman solved the equal-letter-cost case in polynomial time in 1952 [Proc. IRE'52]. For unequal letter costs, Karp gave an integer-programming formulation in 1961 [IRE Trans. Inf. Theory'61]. Exact polynomial-time algorithms for fixed integer costs were given by Golin and Rote [IEEE Trans. Inf. Theory'98] and Bradford, Golin, Larmore, and Rytter [J. Algorithms'02]. For input-dependent costs, Golin, Mathieu, and Young gave a polynomial-time approximation scheme [SICOMP'12]. The exact complexity when letter costs are part of the input had remained unresolved. We resolve this $65$-year-old problem by proving that deciding whether there exists a binary prefix-free code of frequency-weighted cost at most a given threshold is NP-complete, even when the letter costs are consecutive positive integers $(M,M+1)$ supplied as part of the input. All frequencies, letter costs, and thresholds are encoded in binary. Consequently, finding an optimal code is NP-hard. Our proof uses two polynomial-time reductions, starting from Planar Independent Set. The intermediate problem prescribes the number of leaves at each depth of a full ordered binary tree and minimizes a signed linear score on their sorted right-edge counts. The first reduction represents an independent-set verification program by a tree growing level by level. A fixed-profile identity converts narrow coordinate restrictions into linear penalties that enforce the computation. The second reduction adds large dyadic terms to the symbol frequencies to force prescribed depths. These terms contribute a constant to the weighted number of ones, leaving smaller signed perturbations to reproduce the tree score.

comments
51 pages
fields
Information Theory
pdf ↗ page arXiv:2611.04444 ↗

The achievable precision in estimating the spectrum of a time-series signal that is promised to be sparse in Fourier space deteriorates rapidly as the spectral peaks get closer together, as soon as we introduce noise. Here, we study the related task of generator estimation: estimating the generator of a matrix exponential time-series and its eigenvalues. We obtain rigorous non-asymptotic precision guarantees on genESPRIT, a practical algorithm solving generator estimation, and show that this task can be solved with precision independent of the spectral spacing. The guarantees are complemented by a Cramér–Rao analysis of a relaxation of the problem. In particular, in the case of unitary data with bounded additive noise with effective entrywise variance $σ^2$, we show that genESPRIT estimates the associated propagator matrix in Frobenius norm with precision scaling as $\tilde{\mathcal{O}}(σNL^{-\frac12})$ in the length of the time-series $L$ and matrix dimension $N$, matching the corresponding spectrum-independent Cramér–Rao standard deviation scaling up to logarithmic factors. We prove that the matching distance error in the spectrum estimated by genESPRIT scales as $\tilde{\mathcal{O}} (σ^2 N^3 L^{-1} + σN^{\frac32} L^{-\frac32} )$, which we compare to the lower bound on the corresponding Cramér–Rao bound with the asymptotic standard deviation scaling $\mathcal{O}(σL^{-\frac32})$. These guarantees provide the first rigorous bounds on solving the generator estimation problem. As the matrix exponential time-series can be obtained from linearly independent vector time-series by concatenation, this work opens up a new direction in spectral estimation, which circumvents the problem of crowded spectra, under the additional assumption of linear independence.

comments
11 pages + 4 page Appendix, 3 figures. Comments welcome!
fields
Information Theory
pdf ↗ page arXiv:2611.04521 ↗

Movable antennas (MAs) improve wireless communications by adapting antenna positions to the propagation environment. However, antenna movement also changes the mutual coupling (MC) among elements of the transmit and receive arrays, which affects the performance of MA-enabled systems. In this paper, we investigate MC-aware joint precoding and antenna positioning for a downlink multiuser multiple-input multiple-output (MU-MIMO) system with MAs at both the base station and users. We establish an MC-aware system model by combining field-response propagation with a circuit-based representation of the transmit and receive arrays. Based on this model, we formulate a weighted sum-rate (WSR) maximization problem that jointly optimizes multi-stream precoders and antenna positions. The problem is challenging because the precoders and positions are coupled through the propagation channels and position-dependent MC matrices. To address this challenge, we reformulate the problem in the antenna-current domain to to efficiently handle the MC matrices and develop a current-domain weighted minimum mean square error (WMMSE) framework for alternating optimization. Furthermore, we handle the nonconvex position updates within the framework by using majorization–minimization (MM) and solve the resulting convex subproblems with a dedicated conic alternating direction method of multipliers (ADMM) algorithm. Simulation results demonstrate that the proposed design improves the WSR over both an MC-aware fixed array and a movable-array design that ignores MC during optimization.

comments
13 pages, 6 figures, submitted to an IEEE Journal for possible publication
fields
Information Theory
pdf ↗ page arXiv:2611.04552 ↗

We propose a dynamic stochastic geometry framework to model and evaluate large-scale integrated sensing and communication (ISAC) networks. Base stations are distributed according to a homogeneous Poisson point process, while user equipments and sensing objects undergo localised random motion around their serving base station. Full spectrum reuse with a common waveform generates mutual interference that couples the two functionalities. Communication performance is characterised through downlink queues whose service rates are governed by the signal-to-interference-plus-noise ratio (SINR) via the Shannon capacity. Sensing performance is captured by a Kalman filter (KF) whose measurement noise covariance depends on the sensing SINR, yielding a non-classical state-dependent filtering problem. We define system-level performance metrics under the Palm distribution of the base station process and prove the consistency of their empirical estimators. We then prove that, for a typical base station, communication and sensing metrics are associated, so that operating regimes favourable to one functionality tend to benefit the other. The proof combines the monotonicity of the queue and filter recursions in the configuration of interferers with the Harris–FKG inequality for Poisson functionals. We also show that the excess association ratio of the two interference levels decays as the inverse of the network density. Simulations based on a ray-tracing channel model corroborate the analysis.

fields
Information Theory
pdf ↗ page arXiv:2611.04592 ↗

This paper investigates non-asymptotic achievable rate regions of Gaussian multiple-access channels (MACs) and broadcast channels (BCs) in the finite-blocklength regime. By employing a proposed volume-uniform random coding (VURC) codebook that distributes codewords uniformly within an $n$-dimensional power sphere, together with successive interference cancellation (SIC) decoding, we derive a closed-form achievability bound, a scheme-specific lower bound on the average error probability, and a fourth-order asymptotic characterization. The proposed SIC achievability bound admits a simple and analytically interpretable closed-form expression, enabling direct performance evaluation without iterative computation. The structure of the proposed SIC asymptotic bound offers a highly extensible framework, allowing advances in single-user finite-blocklength theory to be systematically incorporated into the multiuser setting. Futhermore, to characterize the performance benefit of joint decoding, we further derive numerical and closed-form achievability bounds for the two-user Gaussian MAC under joint nearest-neighbor (JNN) decoding. Numerical results illustrate the performance differences among the proposed SIC and JNN bounds and existing benchmarks.

comments
51 pages, 6 figures
fields
Information Theory
pdf ↗ page arXiv:2611.04647 ↗

We prove a nearly optimal lower bound on the blocklength of general relaxed locally decodable codes (RLDCs), extending the result of [GGS26] to nonlinear encodings and adaptive decoders with two-sided error. Namely, we show that any $q$-query RLDC $C\colon \{0,1\}^k \to \{0,1\}^n$ must satisfy $n = k^{1+Ω(1/q)}$, closely matching the upper bound of $n = k^{1+O(1/q)}$ by Ben-Sasson, Goldreich, Harsha, Sudan, and Vadhan (STOC 2004). Our proof reduces showing RLDC lower bounds to estimating the output distribution of adaptive decoders. To this end, we introduce a capped Horvitz–Thompson estimator with uniformly bounded discrete derivatives on the $p$-biased cube. We establish its concentration of measure via self-bounding inequalities and control the downward bias induced by capping through a spreadness argument.

fields
Information Theory
pdf ↗ page arXiv:2611.04678 ↗

The distortion-rate-common randomness-perception (DRCP) theory characterizes how limited common randomness (CR) improves reconstruction fidelity under perceptual constraints, thereby providing an information-theoretic foundation for generative compression. In this paper, we characterize the DRCP tradeoff for vector Gaussian sources with limited CR under the squared-error distortion measure and the squared Wasserstein-2 perception measure. Specifically, we first establish a generalized reverse waterfilling characterization of globally optimal allocations. Second, we derive an analytical upper bound on the DRCP function through sequential greedy allocation of rate and CR. For fixed rate and CR budgets, the resulting representation is independent of the perception threshold. Finally, we establish its approximate universality through uniform performance guarantees: the achievable distortion exceeds the optimal distortion by at most $2ρ^*\approx0.2897$ times the total source variance, whereas the optimal-to-greedy distortion ratio is at least $η^*\approx0.7517$.

fields
Information Theory
pdf ↗ page arXiv:2611.04693 ↗

Complete complementary code (CCC) is a crucial component in the design and optimization of modern wireless communication systems, particularly in addressing challenges related to interference, spectral efficiency, and signal quality. The design of CCCs is an active area of research, as it directly impacts the number of users that can be supported interference-free in the system. In the literature, CCC constructions are restricted by a set size smaller than the sequence length. In this paper, we introduce a novel construction method for CCCs based on the extended Boolean functions (EBF) that overcome existing restrictions by including a set size bigger than the sequence length. Further, the proposed construction uses functions which are new in literature and provide us with new CCCs. This is also the very first construction where row PMEPR is also bounded by $n$ for a set size in the form of power of $n$.

fields
Information Theory
pdf ↗ page arXiv:2611.04796 ↗

We determine the linear-equivalence classes within the two families of full weight spectrum one-orbit cyclic subspace codes. This solves the second open problem posed by Castello, Polverino and Zullo [J. Combin. Theory Ser. A 212 (2025) 106005]. For the first family, the criterion is a fractional linear transformation over $\F_q$ followed by a power of $q$-Frobenius. For the second family, it is an affine transformation over $\F_{q^2}$ together with a power of $q$-Frobenius. We use polynomial spaces over finite fields, the linear-isometry theorem for cyclic orbit codes, and trace duality. The arguments include parameters belonging to proper subfields of the ambient field.

comments
12 pages
fields
Information Theory
pdf ↗ page arXiv:2611.04947 ↗

Let $m\geq5$ be odd with $3\nmid m$. Helleseth, Ichanska, and Kaleyski \cite{HIK} conjectured that two norm-perturbed Budaghyan–Helleseth–Kaleyski functions $F_2,F_3$ over $\F_{2^{2m}}$ are APN. In this paper, we prove this conjecture. First, by using the basis $(1,β)$ of $\F_{2^{2m}}$ over $\F_{2^m}$, we show that $F_2$ and $F_3$ are EA-equivalent to two functions $\mathcal G_1$ and $\mathcal G_0$, respectively. Their derivatives can be written as two trace equations for a matrix $P\in\mathrm{GL}(2,\F_{2^m})$. We then prove that these two equations have no solution. The proof uses only identities over finite fields, the characteristic polynomial of a $2\times2$ matrix, and elementary properties of Frobenius automorphisms. The repeated-root case and all parity cases are considered separately. It follows that the derivative of each function has kernel of size two in every nonzero direction, and hence both $F_2$ and $F_3$ are APN for every admissible $m$.

fields
Information Theory
pdf ↗ page arXiv:2611.05014 ↗

Intersecting codes are codes in which any two nonzero codewords share a common nonzero coordinate, and they have been extensively studied due to their applications in communication theory, cryptography, and combinatorics. Recently, geometric interpretations have provided new insights into intersecting codes, both in the Hamming metric and, more recently, in the rank metric for linear codes. In this paper, we introduce and study matrix rank-metric intersecting codes. By defining the support of a matrix as its row space, we extend the notion of intersecting codes to the matrix rank-metric setting. Using the slice space associated with the generator tensor of a rank-metric code, we derive a geometric characterization that is equivalent to the intersecting property. This characterization generalizes the known results for linear rank-metric intersecting codes and highlights both analogies and differences with the linear case. In particular, it yields bounds on the parameters of intersecting codes, one of which is sharp and differs from the one in the linear case, together with first constructions. We then consider codes that are closed under multiplication, i.e. matrix algebras. In this setting, the intersecting property can be read off from the algebraic structure, namely the Jacobson radical and the socle. This provides a simple and flexible way to construct many intersecting codes, including codes that do not satisfy the classical sufficient condition on the minimum distance.

comments
18 pages
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2611.05059 ↗

Channel estimators at a newly deployed base station usually start from 3GPP stochastic channel models, which describe no particular street. We ask whether a channel prior pooled from many ray-traced cities serves an unseen site better than the 3GPP CDL models, and whether learned estimators make the difference. With Sionna RT on 14 city scenes, LMMSE estimation from covariance priors, leave-one-city-out evaluation, and pass/fail bars written down before each main experiment, we find in simulation that the pooled prior sits about 0.6 dB from a site-trained estimator with no site measurements, about what CDL reaches after 50 measurements. Learned models added little: at most 0.65 dB in estimation, and in channel prediction a simple classical method beat CNN predictors by 1.8-12 dB from 2 ms ahead. On measured channels from the DICHASUS outdoor dataset (1.272 GHz, three 2x8 arrays on one building) the result reversed: the pooled ray-traced prior was 3.2-4.1 dB worse than CDL. The simulated channels were too clean; with users at the real distances, even a scattering level tuned from 50 site measurements left the prior about 2 dB behind CDL. A pre-registered follow-on on two more measured environments found the generic CDL prior 2.1-4.7 dB from a site-trained one: no further in a factory hall than on the street, furthest in a small lab room. Finally, a hallway model calibrated to measurements by differentiable ray tracing reproduced delay spread, but as a prior in an unmeasured part of the hallway it was 4.5 dB worse than CDL on the full array. All measured results come from one sounder.

comments
11 pages, 3 figures, 3 tables
fields
Information Theory
pdf ↗ page arXiv:2611.05128 ↗

A policy can earn its performance by where it locates on average or by reacting to information. For any Markov policy $π$ in a finite-horizon MDP, let $ν$ be its open-loop marginal, which plays $π$'s average action distribution at each step. We show that $J(π)-J(ν)$ equals $\sum_t tr Cov(Q^ν_t,π_t)$ under endogenous dynamics. Audits based on immediate costs alone can have the wrong sign. Writing the covariance as a joint-versus-product gap gives the bound $|J(π)-J(ν)|\le\sum_t span_t\sqrt{I(s_t;a_t)/2}$, with a sharp constant. Hence, an MDP's adaptivity gap is bounded by the information that its optimal policy uses. Estimating $J(π)-J(ν)$ from $π$'s own bandit-feedback logs takes $Θ(\barχ^2 \log(1/η)/δ^2)$ rounds, where $\barχ^2$ is an average $χ^2$-divergence. At the same time, deterministic non-constant policies cannot be audited at all. We also provide an importance-sampling auditor for episodic MDPs.

comments
13 pages
fields
Information Theory
pdf ↗ page arXiv:2611.05227 ↗

Quantum locally recoverable codes (qLRCs) are a class of quantum error-correcting codes that can recover an erased qudit by accessing only a few other qudits. This paper develops a general framework for constructing optimal pure qLRCs that attain the Plotkin-like bound, referred to as Plotkin-optimal pure qLRCs, from Hermitian dual-containing near maximum-distance separable (NMDS) codes. Focusing on a special class of NMDS codes called extended subcodes of generalized Reed-Solomon (ESGRS) codes, we determine their localities by analyzing certain subset sum problems over finite fields. By further exploiting the algebraic structures of ESGRS codes and related codes, we construct four families of Plotkin-optimal pure qLRCs with large lengths and more flexible minimum distances than existing constructions. These constructions provide strong global error-correction capability while retaining local recovery. To the best of our knowledge, they give the first families of qLRCs attaining the pure Plotkin-like bound. In addition, by using the resulting locality property, we resolve in the negative a related problem on ESGRS codes supporting combinatorial designs.

fields
Information Theory
pdf ↗ page arXiv:2611.05335 ↗

Algebraic Geometry23

Let ${\mathcal L}$ be an arrangement of $d$ lines in the complex projective plane and let $Z={\operatorname{Sing}}({\mathcal L})$. A question of Pokora asks whether the multipoint Seshadri constant of ${\mathcal O}_{\mathbb{P}^2}(1)$ at $Z$ is always computed by a line of the arrangement containing the largest number of points of $Z$. We prove that the answer is affirmative for every arrangement of at most twelve lines. The proof uses a Bézout-type covering criterion, elementary restrictions on the intersection lattice, and a detailed analysis of the two extremal combinatorial types that can occur for twelve lines. One type is the Hesse arrangement; it is handled using a net of quartics through its twelve double points. The other type would yield a uniquely determined incidence structure on thirteen lines. We show that this incidence structure is not realizable over any field.

comments
14 pages
fields
Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2611.03797 ↗

We study min-plus Bruhat cells $B_{trop}^{(n)} \odot p\odot B_{trop}^{(n)}$, where $B_{trop}^{(n)}$ denotes the set of all upper-triangular matrices over $\RR \cup \{\infty\}$, and $p$ is a permutation. It is proved that $\dim (B_{trop}^{(n)} \odot p \odot B_{trop}^{(n)})= \frac{n(n+1)}{2} + l(p)$, where $l(p)$ is the length of $p$ in Coxeter generators. Also we provide an explicit description of the cell $B_{trop}^{(n)}(\RR) \odot p_0\odot B_{trop}^{(n)}(\RR)$ (up to a subset of dimension less than $n^2$) for the highest in Bruhat order permutation $p_0$. Finally, it is shown that for a tropically non-singular matrix $A$ for at most one permutation $p_A$ it can hold $A\in B_{trop}^{(n)}\odot p_A\odot B_{trop}^{(n)}$.

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

We show that birationally equivalent hyperkähler varieties of generalized Kummer type are derived equivalent, confirming the D-equivalence conjecture in this case. Combined with recent results of other authors, this settles the conjecture for all known deformation types of hyperkähler varieties. The kernel is built from an equivariant Fourier-Mukai kernel on the sum-zero loci of powers of an abelian surface. We deform it along diagonal twistor paths, using the hyperholomorphic endomorphism algebra. Comparing wall hyperplanes gives a common twisted derived category for two adjacent birational models, and a finite sequence of wall crossings then gives the equivalence.

comments
21 pages; Comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.04118 ↗

For a connected regular semisimple Hessenberg variety other than the full flag variety, we prove that the identity component of its automorphism group is an algebraic torus. The argument uses equivariant local coordinates and weight-homogeneous coefficient functions of vector fields.

comments
10 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.04130 ↗

We develop an anticanonical minimal model program for projective $\mathbb{Q}$-factorial klt pairs $(X,Δ)$ such that $-(K_{X}+Δ)$ is pseudoeffective. We first prove the cone and contraction theorems for potentially klt triples and establish the existence of flips for such triples. Using these results, we introduce the notion of admissible extremal rays and show that $(K_{X}+Δ)$-positive admissible extremal rays are precisely the rays that are to be contracted by $-(K_{X}+Δ)$-MMP. The elementary MMP steps associated to such admissible rays preserve klt singularities. For potentially klt pairs $(X,Δ)$ with $\mathbb{Q}$-divisors $Δ$, we prove that every $(K_{X}+Δ)$-positive extremal ray is admissible and obtain a cone theorem for the $(K_{X}+Δ)$-positive part of the Mori cone. Assuming termination of the anticanonical minimal model program, we establish a dichotomy: potentially klt pairs admit anticanonical minimal models, whereas non-potentially klt pairs admit non-admissible models.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.04145 ↗

We construct a bubble-tree enhancement of the KSBA moduli space of surfaces of general type using index-one-cover Deligne–Mumford stacks. The construction is inspired by bubbling phenomena for Kähler–Einstein metrics. Non-klt semi-log-canonical singularities are replaced by admissible simple-normal-crossing configurations: the cusp and degenerate-cusp components are rational, while the simple-elliptic case also contains elliptic ruled components. A key feature is that the construction avoids lci covers. We construct the moduli stack of polarized bubble-tree index-one-cover Deligne-Mumford stacks. The stack is in general not separated, and we construct its underlying separated algebraic space. We also construct the moduli stack of bubble-tree index-one-cover Deligne-Mumford stacks with labeled sections that record algebraic bubbling centers and compare it with the pointed metric bubble tree. The labeled sections determine a numerical class whose stability proves the separatedness of the moduli stack. We establish a perfect obstruction theory and a virtual fundamental class on the bubble-tree moduli stacks. This provides a novel and geometric pathway to prove the existence of a virtual fundamental class on the original KSBA moduli space, thus offering a new approach to a conjecture of Donaldson. We expect that parts of the construction extend to higher dimensions.

comments
52 pages, comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.04154 ↗

We prove Conjecture B of Akhtar–Coates–Corti–Heuberger–Kasprzyk–Oneto–Petracci–Prince–Tveiten unconditionally for the normalized family of maximally mutable Laurent polynomials with prescribed $T$-binomial edge coefficients associated with the degree-10 orbifold del Pezzo hypersurface $X_{10}\subset\mathbb{P}(1,2,3,5)$. An explicit $S$-extended quantum-period calculation determines the affine mirror map $λ=a-346$ and proves that the regularized quantum period equals the classical period as a formal power series throughout the family.

comments
25 pages, 4 figures
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.04293 ↗

We construct a canonical projectivization of every smooth proper algebraic variety $X$ in characteristic zero. Once a principalization procedure is fixed, the construction gives a finite sequence of blowups in smooth centers with smooth projective endpoint, natural under semilinear isomorphisms and preserving the quasi-projective core, the intersection of all maximal quasi-projective open subsets. At each stage we select finitely many ideals near the generic points of the image in $X$ of the boundary of a maximal quasi-projective open. Principalizing their product strictly lowers the dimension of that image. The selection is defined intrinsically, without a polarization or a chosen projective modification; a Hilbert scheme argument proves its finiteness. Naturality embeds the automorphism group in that of a smooth projective variety of the same dimension. We then extend the construction to smooth proper integral algebraic spaces, obtaining canonical projectivizations of all compact connected Moishezon manifolds.

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

We prove the algebraicity of period images in arithmetic quotients without using o-minimality. The proof uses infinitesimal neighborhoods and formal algebraization to recover the images and the maps from their algebraic sources. Hodge positivity and an algebraic ampleness criterion yield the Griffiths polarization and quasi-projectivity. For lifted images, we construct Stein neighborhoods and holomorphic matrix realizations of the Hodge filtration. On closed horizontal subspaces, we bound canonical Bergman density below by the Hodge volume form. We compare the Bergman and Griffiths–Schmid metrics near one-parameter boundaries with nontrivial unipotent monodromy and nondegenerate graded period maps, and in all directions near general one- and two-node quintic threefolds. A period surface arising from abelian threefolds shows that the upper metric comparison fails in general.

comments
53 pages. An alternative proof of the algebraicity of period images without o-minimality
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.04471 ↗

We study hypersurfaces of degree $d+k$ containing a prescribed zero-dimensional fat point scheme $Z\subset\mathbb{P}^n$ and having multiplicity at least $d$ along a general codimension-two linear subspace. We associate with this interpolation problem a vector bundle on $\mathbb{P}^1$ whose splitting type determines the dimensions of all linear systems of type $(d+k,d)$. For a fat point of multiplicity $m$, we determine the exact number of conditions detected by this bundle and introduce the corresponding effective length. This leads to an excess formula separating the contributions of the splitting type, the part of the fat structure invisible to degree-$k$ fibrewise sections, and the Hilbert-function defect of the fixed scheme. We also prove a truncation theorem showing that multiplicities larger than $k$ contribute only a uniform twist of the bundle and, geometrically, fixed hyperplane components. Finally, we exhibit explicit planar and three-dimensional examples showing that genuinely unexpected phenomena persist for nonreduced fixed base schemes, including geometrically irreducible unexpected hypersurfaces.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.04564 ↗

Let $M=X_6^σ$ be a smooth Debarre-Voisin hyperkähler fourfold and $X=X_3^σ$ the associated smooth hyperplane section of $\operatorname{Gr}(3,10)$. Using the incidence correspondence between $X$ and $M$, we construct a family $\mathcal E$ of objects in the Kuznetsov component $\operatorname{Ku}(X)$. We write $v$ for the common Mukai vector of its fibers. We prove that the associated Mukai homomorphism \[ Θ_{\mathcal E}|_{v^\perp}\colon v^\perp\xrightarrow{\sim}H^2(M,\mathbb Z) \] is an integral Hodge isometry and explicitly determine the inverse image of the Plücker polarization. For a very general point of the trivector divisor corresponding to discriminant $24$, we also construct an integral Hodge isometry between the full Mukai lattices of $\operatorname{Ku}(X)$ and the associated twisted K3 surface.

comments
24 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.04602 ↗

We give a proof that an isolated algebraic symplectic singularity of dimension $2n\ge 4$ admitting a projective symplectic resolution is analytically isomorphic to the minimal nilpotent orbit closure in $\mathfrak{sl}_{n+1}$ at the origin.

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

Logarithmic Fitting ideals encode the complexity of the corresponding morphisms in a natural and intrinsic way, and their principalisation offers a new perspective on problems such as the resolution of cotangent sheaves and the monomialisation of morphisms. In this paper, we give a local resolution theorem for log-rank adapted morphisms: after finite sequences of smooth local blow-ups, the first two log-Fitting ideals \mathcal{F}\_{n–1}(σ) and \mathcal{F}\_{n–2}(σ) become principal monomial ideals.

fields
Algebraic Geometry
pdf ↗ page arXiv:2611.04723 ↗

Let $f$ be a morphism from a log canonical pair $(X,Δ)$ to an abelian variety $A$ and $D\sim_{\mathbb Q}m(K_X+Δ)$ a Cartier divisor on $X$ with $m>1$ a rational number. We prove that $f_*\mathcal{O}_X(D)$ is globally generated after pullback by an isogeny. Our methods involve birational geometry, mixed Hodge modules and singular Hermitian metrics with the minimal extension property. Moreover, we provide simple counterexamples where the above result fails for plt pairs when $m=1$ and where the existence of Chen–Jiang decompositions fails for plt pairs for any $m\ge1$.

comments
28 pages, comments welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.04801 ↗

We compare genus zero degree two Gromov–Witten invariants with the number of embedded conics on general projective complete intersections whose conic space has expected dimension zero. Their difference comes from double covers of lines. We compute this contribution as an integral of Chern classes over the Fano scheme of lines, using an explicit obstruction bundle on the compactified space of double covers.

comments
33 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.04837 ↗

Inspired by the quadratic involutions of Corti-Pukhlikov-Reid and Gavin Brown's description of hypersurface flips via toric GIT, we apply similar symmetries to local covering models of terminal threefold flops. We recover the derived equivalence of their canonical stacks by pullback and pushforward along the fibre product over the canonical stack of the contraction target, revisiting the local picture in Kawamata's work.

fields
Algebraic Geometry, History and Overview
pdf ↗ page arXiv:2611.04844 ↗

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 ↗

An important ingredient in fault-tolerant quantum computation is asymptotically good codes with fully addressable transversal non-Clifford gates. Existing constructions, however, provide only small explicit guarantees for rate and relative distance. Here, we substantially improve these guarantees for fully addressable transversal phase gates at every fixed level $h\ge3$ of the Clifford hierarchy, using a cyclic encoding beyond the binary CSS framework. The encoding separates logical phase control from the joint design of rate and distance, enabling two constructions with different computational costs. A deterministic polynomial-time algebraic-geometric construction gives a common asymptotic lower bound of $52/(675h)$ on both quantities. A counting argument gives an exponential-time construction with exact verification, improving this bound by a factor of approximately $2.86$. We further establish a universal upper bound for codes supporting fully addressable transversal single-qubit phase gates. Within our cyclic encoding framework, we obtain a stronger upper bound that is approximately $1.28$ times the lower bound achieved by our exponential-time construction. As concrete examples, we construct codes with $48$ and $90$ physical qubits supporting fully addressable transversal $T$ gates. These results narrow the gap between achievable code parameters and addressability bounds, providing quantitative targets for further improvements in efficient code constructions.

comments
34 pages, 1 figure; includes Supplemental Material
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.04964 ↗

We show that every smooth complex double cover of $(\mathbf P^1)^3$ branched along a smooth divisor of tridegree $(2,2,2)$ is algebraically Gromov elliptic. These irrational Fano threefolds form Mori–Mukai family 3-1 and have anticanonical genus seven and Picard rank three. Their three coordinate projections define degree-four del Pezzo fibrations. Each threefold also admits a dominant rational map of degree two from $\mathbf P^3$.

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

Let $k$ be an algebraically closed field of odd characteristic $p$, and let $\varphi_d$ be the monic Chebyshev polynomial defined by $\varphi_d(t+t^{-1})=t^d+t^{-d}$. For $d>4$ with $p\nmid d$, let $H_d\le\text{PGL}_2(k)$ be the stabilizer of the zero set of $\varphi_d$. We show that \[ H_d\cong \begin{cases} D_d,&\text{if }2d=p^r+1\;\text{ for some integer }\;r\geq 1,\\ S_3,&\text{if }4d=p^r+1\;\text{ for some integer }\; r\geq 1,\\ C_2,&\text{otherwise}. \end{cases} \]

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

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
6 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.05209 ↗

Using adelic intersection theory and following the method envisioned by Parshin and Moret-Bailly, we prove a conjecture of Vojta for curves of genus two and a weak form of the $abc$ conjecture

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

We construct numerical Bridgeland stability conditions on the category of graded matrix factorizations of every smooth complex projective hypersurface of degree $d\ge2$. These conditions are of Gepner type $(τ,2/d)$, where $τ$ is the grading shift autoequivalence. By Orlov's theorem, this gives stability conditions of Gepner type on all Calabi–Yau hypersurfaces and on Kuznetsov components of all Fano hypersurfaces. These conditions satisfy a mass-Hom bound and the support property on the full numerical Grothendieck group. Semistable objects of fixed numerical class and phase admit proper good moduli spaces.

comments
36 pages, 8 figures. Comments welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2611.05350 ↗

Numerical Analysis22

We present a preconditioning pipeline that accelerates Tensor Train (TT) linear solvers for symmetric positive-definite problems. Extending the Factorized Sparse Approximate Inverse framework to tensor networks, we construct a preconditioner as the product of a TT operator and its transpose. This formulation is positive semidefinite for any bond dimension and truncation, and definite whenever the factor is non-singular, satisfying the mathematical requirements of the Conjugate Gradient method. We detail the construction of this preconditioner and its integration into Density Matrix Renormalization Group (DMRG)-like linear solvers. Performance evaluations show consistent iteration reductions for anisotropic diffusion and Poisson problems across various configurations, leading to net speedups of up to 25% in ill-conditioned settings of time stepping schemes that can reuse the approximate inverses. These benchmarks were performed with the open-source Julia library DifferenTT.jl, which we also introduce in this work to provide out-of-the-box access to these preconditioned pipelines.

comments
50 pages, 11 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.03859 ↗

In this paper, we introduce a generalized weighted randomized Kaczmarz framework to approximate solutions to overdetermined linear systems whose measurements are perturbed by sparse, additive corruptions. The proposed framework samples equations with probabilities proportional to a user-defined weighting function of their corresponding residual magnitudes. Our work focuses on weighting functions that will reduce the influence of potentially corrupted equations, and provides analyses for a general class of non-increasing weighting functions. We derive one-step expected squared error bounds that separate progress on uncorrupted equations from the contribution of corrupted equations, and provide sufficient conditions for geometric convergence under one specific family of weighting functions -- threshold weighting. We also investigate adaptive exponential weights scaled by the median or median absolute deviation of residual magnitudes, requiring no prior knowledge of the corruption fraction or magnitudes. Lastly, we consider a family of inverse residual weighting functions. Numerical experiments demonstrate the benefit of such a generalized framework in its flexibility in developing approaches for settings in which information about the corruptions is known or unknown.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.03889 ↗

Score-learning methods generally lack pointwise supervision, which affects the training accuracy, particularly in regions where SDE trajectories are rare. To address this challenge, we introduce a novel method called \emph{BEL anchors}, which uses Monte Carlo score estimates at user-selected space-time query points. By combining a Feynman–Kac representation of the Fokker–Planck equation with the Bismut–Elworthy–Li formula, our estimator requires neither closed-form transition densities, spatial discretization, nor derivatives of the initial density. We derive its asymptotic variance and use the anchors as sparse supervised targets for existing score-learning objectives. Experiments show that BEL anchors improve implicit score matching in poorly sampled regions, prevent score-PINN collapse, and enable accurate sample regeneration in several numerical examples.

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

Coarse finite-volume information does not automatically define an exact pathwise closure for the restricted evolution of a fine-grid realization. We study two one-step information boundaries that are distinct from recursive predictive memory. First, we show that parent averages together with complete initial parent-interface trace pairs are sufficient for one forward-Euler finite-volume transition with a deterministic two-state numerical flux, but they do not generally determine a completed second-order strong-stability-preserving Runge-Kutta, equivalently Heun, transition. An explicit scalar upwind collision shows that hidden interior data can affect later stage traces and hence the completed parent update, even when initial traces and parent averages agree. Second, we show that exact conservative one-step closure is not the same as entropy-accounting closure. A parent entropy balance obtained from a cellwise numerical entropy balance contains a subcell Jensen gap, a realized entropy-flux difference, and residual dissipation. For a declared Burgers-Rusanov conservative flux and a declared Rusanov-type numerical entropy flux, we construct a sign-indexed finite family in which all branches have identical parent averages, identical conservative interface registers, and identical next parent averages, while the entropy-interface register distinguishes every branch. Under the uniform branch law, the conservative channel leaves nonzero deterministic squared-error floors for both the raw entropy register and its cyclic divergence. The results give a concise finite-volume information-sufficiency test for multistage interface data and entropy-side accounting.

comments
10 pages. Code, data, and executable certificates: https://github.com/UniversityOfNicosia/certified-simulation (release initial-trace-entropy-separation-v1, DOI 10.5281/zenodo.23271075)
fields
Numerical Analysis
pdf ↗ page arXiv:2611.04001 ↗

The Landau transformation xi = x/s(t) is the usual way to hold a moving boundary in place. It fails for fractional time derivatives because they have no chain rule: the transformed operator gains a nonlocal integral with a closed form only for self-similar fronts. We develop a sharp-interface finite-difference scheme for the conservation-consistent memory-flux fractional Stefan problem on a fixed grid, storing the memory limit h(x) = s^-1(x) as the time each node melts. The front is advanced using an integrated energy balance, with the singular source timed to the sub-step crossing instant. Against a known self-similar solution, the front constant is accurate to 0.02 to 0.11%, whereas competing formulations differ by 17 to 27% at alpha = 0.6. A remaining positivity violation follows from dt/t0 ~ s0^(1 - 2/alpha) and disappears on a front-locked time grid. We also derive two exact solutions with non-power-law fronts: a source-dominated solution and a Mittag-Leffler traveling wave, and verify the scheme against both. Neural-network solvers for moving boundaries are often trained in normalized coordinates; for alpha < 1, this silently changes the problem, while the change vanishes at alpha = 1, where checks are commonly performed. In the classical limit, our scheme is more accurate in 12 ms than a reimplemented moving-boundary network in 177 s.

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

Port-Hamiltonian (pH) systems provide a general framework for modeling a broad class of physical dynamical systems, including systems with dissipation. Constructing accurate and robust data-driven reduced-order models for general pH systems is challenging. In this work, we focus on an important subclass of pH systems satisfying reciprocity, a property arising naturally in a variety of models. Rather than seeking to preserve the full pH structure, we exploit the additional symmetry provided by reciprocity to develop an efficient data-driven reduced-order modeling approach. We show that every minimal realization of a reciprocal system is self-adjoint with respect to a generally indefinite inner product and can, up to a similarity transformation preserving the pH structure, be represented in a Krein space with a signature inner product. This observation motivates a Galerkin projection onto a tangential rational Krylov subspace with respect to the corresponding indefinite inner product. Although the resulting projection involves full-order state solutions and the unknown inner product, we show that its reduced mass and stiffness matrices can be constructed directly from transfer-function data through a Loewner formulation. We then propose a greedy data-driven procedure that adaptively selects both interpolation frequencies and tangential directions. At every iteration, the frequency is chosen according to the largest transfer-function approximation error, while the tangential direction is selected from a dominant singular direction of the corresponding matrix-valued residual. Numerical experiments for wave propagation in lossy media demonstrate improved approximation efficiency compared with block adaptive interpolation. We further apply the method to spectral mass gauging of a three-dimensional propellant tank to provide an accurate estimate of the tank volume through Weyl's law.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.04065 ↗

TriCG and TriMR are two short-recurrence iterative methods introduced by Montoison and Orban [SIAM J.\ Sci.\ Comput., 43 (2021), pp.\ A2502–A2525] for solving symmetric quasi-definite linear systems. Extensive numerical experiments have demonstrated the efficiency of these two methods, but a systematic convergence analysis is still lacking. In this paper, we derive convergence bounds for the TriCG error norm and the TriMR residual norm. Numerical experiments support the theoretical results.

comments
18 pages, 3 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.04189 ↗

We develop a hybrid tensor-train/quantized tensor-train (TT/QTT) upwind discontinuous Galerkin method for three-dimensional transient multigroup neutron transport. The central contribution is a fixed-matrix upwind construction: two spatial DG matrices serve all directions and energy groups, with signed and absolute direction-cosine factors preserving Kronecker structure. For homogeneous materials on uniform Cartesian grids, operator rank bounds are independent of mesh size, group count and direction count at fixed scattering order. We derive a conditional global step-defect bound and enforce group-integrated balance of the compressed system. Crank-Nicolson tests show second-order convergence on a separable manufactured solution whose finest final state occupies 13 kB instead of 35 TB, a compression factor of $2.7\times10^9$. A modified rank-adaptive basis-update and Galerkin integrator (TT-BUG) advances passive and active bursts with approximately half a billion unknowns. Selected runs are 15-20 times faster than AMEn at comparable verified scalar-flux errors. In the reported anisotropic active-burst configurations, TT-BUG takes 14.3 s on one processor versus 716 s for OpenSn on 24 processors: approximately 50 times less wall time and 1200 times less allocated processor-time cost. This compares reported configurations rather than matched physical errors. OpenSn provides an independent discretization check. The modified TT-BUG source-onset and saturation treatment is tested numerically; its order, convergence and general tolerance-to-error relation remain unproved.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.04360 ↗

This paper proposes and examines a completely discrete discontinuous Galerkin finite element scheme to approximate the solution of a class of strongly damped wave equations with uniform exponential decay property. In the first part, a semidiscrete discontinuous Galerkin approximation is employed in the spatial variable, while keeping time variable continuous and optimal error estimates are established while preserving the exponential decay property of the original system. Subsequently, a fully discrete scheme is developed and analyzed. Using suitable energy techniques, the consistency between the decay properties of the continuous and discrete systems is demonstrated. In particular, the constants appearing in various estimates remain uniformly bounded even as the damping parameters approach zero. Moreover, error estimates that preserve the uniform decay property are highlights of this paper. Further extension of our analysis includes a class of strongly damped fourth order evolution equations using SIPG as well as $C^0$-IP methods. Finally, several numerical experiments are performed to confirm the theoretical convergence results, verify the predicted decay behavior, and investigate the influence of model parameters on stability and computational accuracy.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.04601 ↗

We develop a numerical framework to efficiently simulate the cyclic voltammetry models based on discontinuous Galerkin (DG) spatial discretization combined with linearly implicit Euler time integration. The method is applied to two electrochemical mechanisms: a heterogeneous electron-transfer (ET) reaction and an electron-transfer reaction coupled with a catalytic chemical step (EC'). The governing time-dependent reaction-diffusion equations are expressed in dimensionless form and discretized in space using locally defined orthonormal Legendre polynomial basis functions. This discretization leads to a system of ordinary differential equations that is subsequently advanced in time using the linearly implicit Euler method. The resulting solver, denoted $\text{DG}_{\text{Impl}}$, is evaluated through numerical experiments and compared with MATLAB's $pdepe$ solver in terms of accuracy and computational efficiency. The numerical results demonstrate the convergence of $\text{DG}_{\text{Impl}}$ with respect to spatial and temporal discretizations and show that the method accurately reproduces the voltammetric responses of both ET and EC' mechanisms. For a prescribed relative error, $\text{DG}_{\text{Impl}}$ requires less computational time than $pdepe$ in the numerical experiments considered. These results demonstrate the effectiveness of the proposed DG formulation for the forward simulation of cyclic voltammetry models and provide a numerical foundation for subsequent adjoint-based parameter-estimation and inverse-problem formulations.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.04718 ↗

We present an algorithm for approximating a given matrix polynomial of degree $d$ by a matrix polynomial of prescribed rank and degree at most $d$. The method builds on recent advances in the theory of generic eigenstructures and factorizations of matrix polynomials with bounded rank and degree. We also give a specialized treatment of the case of matrix pencils (degree one matrix polynomials), motivated by its particular theoretical and practical importance. Lastly, numerical experiments are reported to assess the performance of the proposed approach and to compare it with existing methods.

comments
30 pages, 7 figures
fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2611.04799 ↗

We present a theoretical and numerical analysis of novel IMEX Active Flux schemes for a hyperbolic approximation of the Korteweg-de Vries (KdV) equation. For this approximation, it is important that the numerical schemes recover the limit equations (asymptotic preserving) and retain their order of accuracy in the limit (asymptotically accurate). Using formal asymptotic analysis and numerical experiments, we show that an Active Flux spatial discretisation (closely related to the standard semi-discrete Active Flux scheme), combined with an implicit-explicit Runge-Kutta scheme, is asymptotic preserving but not asymptotically accurate. We therefore propose alternative spatial discretisations that differ in the update equations of the point values. First, we derive a scheme by rescaling and eliminating terms in the upwind matrices. Second, we develop a second-order scheme by using central discretisation for the terms treated implicitly in time and present two modifications of it to third-order. Finally, we formulate a scheme with predefined upwind directions that are not chosen based on characteristics. We show that the alternative schemes are not only asymptotic preserving but also asymptotically accurate, and compare their accuracy, stability, and energy conservation numerically.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.04832 ↗

Separable nonlinear least squares problems arise in inverse problems such as semi-blind image deblurring, where the image enters the forward model linearly, and the blur parameters enter nonlinearly. Even when the image is regularized, joint estimation of the image and blur parameters can favor a degenerate no-blur solution, in which the blur operator tends to the identity and the reconstruction merely denoises the data without removing the blur. We address this by regularizing the blur parameters. Motivated by the determinant term arising from Gaussian marginalization, we construct a family of blur-parameter priors whose weight and auxiliary operators can be chosen independently of the image prior. The resulting log-determinant penalty is incorporated into regularized variable projection, which eliminates the image variables by minimization. Under periodic boundary conditions and assuming the matrices involved admit a joint spectral decomposition, we show that a sufficiently large determinant weight rules out the no-blur solution as a local minimizer. We also characterize the regularizer's behavior as the auxiliary regularization scale tends to zero or infinity. We solve the reduced problem with a quasi-Newton method that evaluates the objective and its derivatives in the Fourier domain. In experiments with Gaussian, defocus, and motion blur, the proposed prior improves image and blur recovery over Gaussian marginalization across several settings, with determinant weights computed from the true image. A single-sample experiment illustrates how to automatically choose parameters from the data using a conditional generalized cross-validation criterion.

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

We generalize the compact residual-screened local reduced-order model (CL-ROM) from Brinkman-penalized flow to shape optimization with the diffuse domain method (DDM). As with Brinkman penalization, DDM extends evolving-domain problems to a fixed rectangular domain, allowing one grid for discretization and directly compatible snapshots from different designs. Unlike Brinkman penalization, DDM uses a phase field to weight operators and sources and treats Dirichlet, Neumann and Robin conditions through diffuse boundary terms. The CL-ROM mechanism carries over: recent full-order and corrected solutions determine local reduced spaces, while residual screening, correction with retained factors and objective verification decide when a full-order solve is needed. We derive reduced operators, residuals and sensitivities for each diffuse model, using Galerkin projection for the symmetric problems and least-squares Petrov–Galerkin projection for nonlinear flow. For the symmetric problems we prove a local approximation estimate that admits inexact, corrected snapshots. In numerical tests of shape identification, drag minimization in Navier–Stokes channel flow and compliance minimization of a cantilever, CL-ROM uses reduced solutions for nearly all design updates, reproduces the full-order objectives with relative differences below $5\times10^{-6}$, and is $3.85$ to $7.65$ times faster than a full-order baseline that reuses factorizations as preconditioners.

comments
17 pages, 8 figures, 8 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2611.04864 ↗

Accurate streamflow estimation requires a consistent representation of model and observation uncertainty. Such consistency is difficult to obtain when rainfall information is unavailable, or not temporally aligned with the discharge observations. We develop an adaptive Kalman filter for Generalized Shot Noise streamflow models, with recursive estimation of the measurement and process-noise covariances. The process-noise update includes a correction for the covariance propagated through the state dynamics, without which the recursion has no finite stationary point. With the correction, the expected increment vanishes when the mean normalized innovation squared reaches one. The filter is assessed using 37 years of daily inflow observations from the Camastra Basin in southern Italy, under two rainfall configurations. The first supplies a synthetic effective-rainfall realization as a deterministic input, whereas the second represents the unresolved forcing through the adaptive process noise. The second configuration yields the more accurate estimates, since the synthetic rainfall events, although statistically calibrated, do not coincide in time with those that generated the observed discharge. Over the full record, it attains a Nash–Sutcliffe efficiency of 0.95 and a median relative error of about 1%. Regime-conditional consistency diagnostics are reported and discussed for the second configuration.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.04922 ↗

Summation-by-parts (SBP) operators in combination with simultaneous-approximation-terms (SATs) for boundary conditions provides a recipe that can be applied to well posed linear initial boundary value problems.The SBP-SAT frame work guarantees semi-discrete energy stability and can be applied to most numerical discretization methods. High order accuracy comes without additional difficulty. The extension of SBP-SAT to nonlinear initial boundary value problems has so far been somewhat unclear. However, recent developments have shown how to construct stable nonlinear SAT terms. In this note we develop nonlinear SBP operators. These combined developments provide an SBP-SAT based recipe for stable approximations of nonlinear skew-symmetric hyperbolic initial boundary value problems.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.04930 ↗

We develop a unified isoparametric moving mesh partial differential equation (MMPDE) method for $P_1$ simplicial and $Q_1$ tensor-product elements, including elements on embedded surfaces. Mesh movement follows a prescribed symmetric positive-definite metric through equidistribution and alignment. For $Q_1$ elements, we prove that bounded, exactly integrated adaptation energy prevents local Jacobian rank loss on a fixed finite mesh at sharp critical exponents. The result also gives local full-rank preservation for embedded bilinear surface elements. A complete physical-coordinate gradient accounts for metric variation at moving quadrature points. For the discrete MMPDE, we use whole-element validity tests and develop sufficient Bernstein certificates for trilinear hexahedra. An explicit positive-margin bound on each fixed stage is provided by an optional certificate barrier. Numerical examples illustrate metric-driven movement on one-dimensional, planar, volume, and graph-surface meshes. Limitations of pointwise hexahedral Jacobian sampling are also presented.

comments
46 pages, 9 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.05026 ↗

Model reduction via the Mori-Zwanzig (MZ) formalism is well understood for coarse-grained representations constructed from standard basis functions such as Fourier functions. We show that the same formalism can be used to build reduced-order models in bases discovered by physics-informed machine learning. The fluctuation-dissipation theorem (FDT) is used to close the resulting non-Markovian evolution equations for the expansion coefficients of the learned basis. We further introduce a complementary, generative closure model. Relative to the Markovian dynamics alone, both the MZ and generative closures substantially improve predictions of the filtered states.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.05211 ↗

In this paper, we consider three-dimensional exterior wave propagation problems with non-homogeneous Neumann boundary conditions. We reformulate the problem as a space-time boundary integral equation involving a hypersingular operator. To solve the resulting formulation, we combine Lubich's convolution quadrature with a shifted collocation boundary element discretization and investigate numerically the efficiency, stability, and convergence of the resulting numerical scheme. Numerical tests show that the proposed approach achieves an accuracy comparable to that of Lubich's convolution quadrature combined with a Galerkin boundary element method, and provide numerical evidence of the unconditional stability of the collocation scheme.

comments
26 pages, Accepted for publication in Computers & Mathematics with Applications
fields
Numerical Analysis
pdf ↗ page arXiv:2611.05226 ↗

We attempt to alleviate failure modes of classical physics-informed neural networks (PINNs) in scenarios of topological pathologies corresponding to punctures, holes, poles, and voids by introducing de Rham cohomological augmentations, or Hodge-de Rham PINNs. Vanilla PINNs often encounter pitfalls in hole-based settings due to discontinuous interfaces, nonzero closed path integration, path dependence, correspondence to exact forms via the exterior derivative, etc., therefore we absolve traditional failures via parameterizing a 1-form by the Hodge-Morrey-Friedrichs (HMF) decomposition for manifolds with boundary, drawing a connection to de Rham cohomology such as through the HMF isomorphism theorem. 1-forms can act as representations of scalar-valued PDE solutions through integral operator mappings. We propose performing a PINN-based loss on the parameterized 1-form through an associated PDE, which subsequently solves the potential-based PINN problem and moreover remedies the failures of vanilla PINNs via the Sobolev-regular operator under a Fréchet differentiation interconnection. The operator relationship often has a nontrivial closed-form and often requires integration or a case-by-case analysis, which we address thoroughly in our experiments. When an integrability condition is not met on our losses, we can equip exhaustion functions to train the networks. We demonstrate our methods on the Aharonov-Bohm effect, which, to our understanding, is largely nonexistent in PINN literature. We develop theoretical guarantees of our methods and demonstrate our pathological safeguards on a broad selection of topologically-adverse problems, including scenarios of inexact forms, and those of nontrivial harmonics and coexact terms.

comments
First version
fields
Numerical Analysis
pdf ↗ page arXiv:2611.05276 ↗

This work presents an optimization-based remap approach for arbitrary Lagrangian-Eulerian (ALE) hydrodynamics that preserves sharp features and physical bounds while conserving global quantities such as volume, mass, momentum, and total energy. Achieving these properties is the main challenge in remap methods. The presented approach is well-suited for high-order finite element (FE) discretizations and ALE methods that allow for large, purely Lagrangian displacements between successive remeshing and remapping steps. Recent advances in parallel, GPU-capable interpolation routines enable the initial transfer of all fields via direct physical-space interpolation, avoiding computationally costly and diffusive pseudo-transient PDE-based advection. The interpolation produces bounded fields with minimal numerical diffusion. However, it may violate the desired conservation of global properties. Thus, a subsequent optimization step restores conservation while preserving physical bounds. The presented method provides minimally diffusive remapping of finite element fields of arbitrary order. Moreover, it directly remaps quantities defined at integration points, eliminating the need for projection onto finite element spaces. The approach also mitigates typical challenges associated with synchronizing primal variables and conserved quantities in advection-based remap methods. The proposed optimization-based remap method is evaluated using standard two- and three-dimensional remap benchmarks and full ALE hydrodynamics simulations.

comments
13 pages, 7 figures, 4 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2611.05327 ↗

Single precision (FP32) halves the memory and data movement of double precision (FP64), and on accelerators is often several times faster. Its rounding errors are harmless except in the stored state. A modified equation for Runge-Kutta methods in Shu-Osher form and linear multistep methods separates the rounding of the stored state, a forcing proportional to $1/Δt$, from truncation and from right-hand-side rounding, which sets a $Δt$-independent floor. We bound this forcing for strong-stability-preserving schemes and identify two mechanisms that keep its sign fixed, so it accumulates as a bias: past a turnaround step, refining the step increases the error, in FP64 as in FP32. For a model oscillator the analysis predicts the floor and the FP32-to-FP64 ratios of turnaround step and minimum error within 30%. Our remedy needs no FP64 arithmetic: each state variable is stored as the unevaluated sum of two FP32 numbers, updated with error-free transformations, while every right-hand-side evaluation stays in FP32. Unlike compensated summation, it needs no rewriting of the scheme. In model problems from geophysical flow, mechanical dynamics and celestial mechanics, with five Runge-Kutta and multistep schemes, it restores design-order convergence to the floor. In large-eddy simulations of a high-lift airplane wing on three refined grids, up to 544 million cells, with time steps $Δt$, $Δt/2$ and $Δt/4$, FP32 overpredicts the lift by 2.1, 4.5 and 7.7%, while the two-float lift agrees with FP64 within 0.3% on every grid, and on graphics processing units the production solver runs 1.6 to 2.7 times faster than FP64.

comments
43 pages, 7 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2611.05365 ↗

Mathematical Physics19

Uncertainty quantification in PDE inverse problems is essential in many applications. Scientific machine learning and AI enable data-driven learning of model components while preserving physical structure, and provide the scalability and adaptability needed for emerging imaging technologies and clinical insights. We develop a Bilevel Local Operator Learning framework for Bayesian inference in PDEs (B-BiLO). At the upper level, we sample parameters from the posterior via Hamiltonian Monte Carlo, while at the lower level we fine-tune a neural network via low-rank adaptation (LoRA) to approximate the solution operator locally. B-BiLO enables efficient gradient-based sampling without synthetic data or adjoint equations and avoids sampling in high-dimensional weight space, as in Bayesian neural networks, by optimizing weights deterministically. We analyze errors from approximate lower-level optimization and establish their impact on posterior accuracy. Numerical experiments across PDE models, including tumor growth, demonstrate that B-BiLO achieves accurate and efficient uncertainty quantification.

fields
Mathematical Physics
pdf ↗ page arXiv:2507.17019 ↗

The Thermodynamic Bethe Ansatz (TBA) procedure developed by Yang-Yang provides the free energy functional to be minimized via a variational problem. Their result not only gives the correct thermodynamics, but it also sets the framework for Generalized Hydrodynamics. Originally developed for quantum systems, this procedure has been recently successfully applied to (integrable) classical particle systems. However, this has never been done for classical field theories: no classical derivation has consistently accounted for solitons, breathers, radiation (dispersive modes), and their mutual interactions. We here derive the TBA equations for the Toda chain directly from its inverse scattering transform. This results in solitonic modes interacting with radiation, extending the soliton gas picture. We provide numerical verification of our equations against well established TBA equations in terms of particle modes. We expect the same procedure should apply to KdV, and pure radiative models as defocusing NLS and Sinh-Gordon, while we discuss current limitations in other models such as focusing NLS (and Ablowitz-Ladik) and Sine-Gordon.

comments
32 pages, 4 figures, 1 appendix
fields
Mathematical Physics
pdf ↗ page arXiv:2611.03857 ↗

In this paper, we present the spinor structure associated with the Hyperbolic Clifford algebra of a real $n$-dimensional vector space $V$, which is denoted by $\mathcal{C}l\left(H_{V}\right)$. Unlike the standard Clifford algebra, the Hyperbolic Clifford algebra $\mathcal{C}l(H_V)$ simultaneously accommodates both multiforms and multivectors in a single algebraic structure, making it the natural framework—known as the ``mother algebra''---for the study of superfields in theoretical physics and for generalizing the Clifford bundle formalism to hyperbolic structures arising in gravitational theories. The orthogonal groups and orthogonal transformations associated to the hyperbolic space $H_{V}$ are presented. The Clifford–Lipschitz group and the Pin and Spin groups associated with $\mathcal{C}l\left(H_{V}\right)$ are defined. Then, the frame bundle and spinor structure associated to Hyperbolic Clifford algebra is derived.

comments
17 pages
journal
Axioms 15(4), 286 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2611.03886 ↗

Nonlinear lattice kinetic simulation requires each updated distribution to supply the velocity and gradients that determine the next step. In a quantum-classical solver, reading out the full distribution incurs work proportional to the lattice size. We construct a tensor-train (TT) interface that retains reusable classical cores at the physical amplitude scale for a full-relaxation lattice kinetic scheme. The cores supply nonlinear coefficients and prepare each quantum input. Energy-scaled propagation and coordinate recovery encode the updated distribution, and alternating least-squares reconstruction converts signed Hadamard-test overlaps into output cores by restoring a known normalization factor. The next step starts from accepted cores without replaying previous quantum evolution. Under positive, unit-sum reference coefficients, positive lower and finite upper density bounds, and Lipschitz equilibrium sensitivity, perturbation bounds relate local defects to feedback errors. Resource bounds account for classical operations, circuit execution, sampling, and verification. Classical diagnostics expose why distribution accuracy alone is insufficient: in 80-step feedback on a $16\times16$ grid, rank cap 4 nearly eliminates the vortex despite a final distribution error below $1\%$, whereas rank cap 12 gives relative velocity error $1.03\times10^{-3}$. Four-step binomial readout simulations show that tightening core sampling tolerance threefold raises the prescribed sufficient budget from $5.97\times10^{12}$ to $5.37\times10^{13}$ shots as the result approaches the fixed-rank, fixed-sweep exact-overlap trajectory. The interface therefore provides a way to connect quantum propagation to nonlinear feedback and to assess the separate demands of compression, velocity accuracy, and readout precision.

comments
42 pages, 4 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.04500 ↗

Following some recent results, we consider here a particular class of states on a $O^\ast$-algebra $\M$ which we call {\em eigenstates of an element} $A\in\M$, and we deduce some of their properties. Then, we apply our definition to a family of ladder elements, i.e. elements of $\M$ obeying certain algebraic (commutation) relations which are physically motivated, and we discuss several results for these states

fields
Mathematical Physics
pdf ↗ page arXiv:2611.04550 ↗

We revisit the classical spectral problem for the Laplace-Beltrami and Laplace-Bochner operators on complex Grassmannians. After reviewing the standard approach based on non-commutative harmonic analysis, we develop two complementary methods originating from the quantization of the corresponding one-dimensional sigma model, both with and without a magnetic monopole field. The first is based on $\mathbf{SU}(n)$-equivariant first-order GLSM formulation and gives explicit eigenfunctions in terms of projectors and Plücker coordinates. The second uses a spin-chain realization of free particles on manifolds and describes the space of square-integrable functions, or sections in the magnetic case, through limiting tensor products of long rectangular $\mathbf{SU}(n)$ representations. Together, these approaches provide a more explicit picture of the spectral geometry of Grassmannians and clarify the relation between harmonics, Young diagrams, magnetic bundles, and Laplacian spectra.

comments
40 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2611.04613 ↗

We construct a measure on continuous paths in the future cone of two-dimensional space that is invariant under the orthochronous Lorentz group and quasi-invariant under the action of the diffeomorphism group. We use the proposed measure to obtain the fundamental solution of the heat equation. The result agrees with the expression obtained by other methods.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.04669 ↗

Self-similar solutions play an important role in the formation of singularities in the Yang–Mills equations. In five space dimensions, these equations admit infinitely many self-similar solutions with an increasing number of unstable modes. It was observed numerically that all excited profiles share the least unstable eigenvalue $λ=5$. We explain this remarkable spectral property by an elementary construction of the corresponding eigenfunction in terms of the profile.

comments
6 pages
fields
Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2611.04861 ↗

Twilight clouds are small, optically faint warm clouds whose droplets fluctuate between haze and activated growth. We develop a nonequilibrium statistical field theory linking this regime to cloud-field organization through Köhler microphysics, supersaturation transport, and turbulent mixing. At parcel level, supersaturation rapidly tracks slow droplet growth with a finite lag. Mixing-induced supersaturation removal drives a saddle-node bifurcation, shifting the activation threshold and supporting intermittent hovering under turbulent fluctuations. Starting from turbulent transport of supersaturation coupled to droplet growth, we derive a droplet-supersaturation field system and formulate it within the Martin-Siggia-Rose framework. A Gurari-type variational reduction inspired by polaron theory eliminates the fast bath. Turbulence dresses the slow droplet field, shrinks the forbidden zone below the equilibrium curve, and raises the mixing threshold required to suppress activation. Each droplet population induces a screened supersaturation halo that couples neighboring cloud elements; its delayed adjustment generates dynamic inertia and temporally correlated noise. The resulting nonlinear, non-Markovian pseudoparabolic stochastic equation has a bounded frozen-background response at short wavelengths. Its long-wave coupling amplifies contrasts where the dressed slow manifold turns downward. Comparisons with the parent two-field system show that a spatially correlated Markovian closure preserves droplet-radius distributions and cloudlet organization. Near the activation fold, restoring residual-bath fluctuation memory improves recurrent-hovering frequency and patch extent without recalibrating the drift or fitting a correlation time. More broadly, the framework identifies how slow fields acquire interactions and inertia through the relaxing, diffusive environments they modify.

comments
55 pages, 22 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.04924 ↗

Hirota's three-soliton condition is the standard test for the integrability of a bilinear equation $P(D)f\cdot f=0$, and the folklore implication ``three-soliton condition $\Rightarrow$ $N$-soliton solutions for all $N$'' underlies the classifications of Hietarinta. We study this implication in two directions. The first is the family $L\,(D_x^3+Λ)^{2n+1}f\cdot f=0$ with $L$, $Λ$ linear forms in the Hirota operators, which for $n=0$ contains the Korteweg–de Vries, Ito and Boiti–Leon–Manna–Pempinelli equations and for $L=D_x$ is the family of Gürses and Pekcan. On the principal component of the dispersion variety the $N$-soliton condition reduces to a sign sum of two bialternants; counting odd exponents shows that for $n=0$ the class is Hirota integrable and that for $n\ge1$ the three-soliton condition holds for every $L$, and an explicit formula for the four-soliton residual proves the Gürses–Pekcan conjecture that the four-soliton condition fails for every $n\ge1$. The formula yields sum-of-squares certificates excluding four-soliton solutions at every real configuration for the Gürses–Pekcan and Ito equations, classifies the real members of the class, and determines maximal numbers of nondegenerate solitons: exactly four or five for $n=1$ according as $L$ lies in the span of $D_x,Λ$ or not, five for $n=2$ and $L=D_x$, and finite for every $n\ge1$ and every $L$. The second direction is a reformulation of the implication for a single non-hyperplane component of multiplicity one, which we prove, with complete classifications, for all graph-type dispersions $L(q(D)+D_t)$, for every irreducible even quadric component in any dimension and with an arbitrary cofactor, for parabolic components, for the dispersions $F(\ell)+Q$ containing the Kadomtsev–Petviashvili surface, and, with a prescribed one-parameter phase family, for the cubic graph.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.04953 ↗

In our previous article CMP 407 (2026) 131, we explored the rich algebraic structures arising from a specific quantum many-body Hamiltonian quartic in the bosonic creation-annihilation operators. This Hamiltonian originated from the works of Gérard and Grellier on classical turbulent energy transfer in a Lax-integrable setting, and its quantum version respects hierarchies of polynomial conservation laws all of which possess purely integer spectra, as does the Hamiltonian itself. The latter feature, known from numerical studies, has previously remained unproved. Here, we present an elementary solution of the quantum Gérard-Grellier Hamiltonian. The eigenstates are labelled by partitions and the corresponding eigenvalues admit simple explicit expressions in terms of the principal hook lengths. The key ingredient in this construction is a specific basis we introduce, inspired by the classical multisoliton coherent states, in which the Hamiltonian is upper-triangular. The expressions for the eigenvalues then immediately follow, while the full eigenbasis can be recovered via a Gram-Schmidt procedure.

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

In this paper, a compact high-order gas-kinetic scheme (HGKS) is developed for compressible arbitrary Lagrangian-Eulerian (ALE) computations on three-dimensional unstructured meshes. To achieve high-order spatial accuracy, a large number of matrix inversions are required for spatial reconstruction. In ALE computations, the mesh moves and the geometric information must be recalculated at each time step, which reduces computational efficiency. To improve efficiency, a memory-reduction reconstruction strategy is employed to construct a quadratic polynomial on unstructured meshes. By differentiating the candidate polynomial, the quadratic terms are obtained by the least-squares method using the average gradient values of the cell itself and its neighboring cells. The linear terms of the polynomial are also determined by the least-squares method. On three-dimensional unstructured meshes, a $3\times3$ coefficient matrix must be stored, and four least-squares procedures are required to construct a quadratic polynomial. To suppress numerical oscillations in flows with discontinuities, generalized essentially non-oscillatory (GENO) reconstruction and a gradient compression factor are adopted. To accelerate the computation, a multi-GPU accelerated code is implemented using Compute Unified Device Architecture (CUDA) and Message Passing Interface (MPI). The current scheme is fully explicit, and the acceleration framework can be developed based on cell-level parallelism. Numerical examples are presented to evaluate the accuracy and robustness of the scheme, including flows with strong discontinuities, pitching wings, and helicopter rotors. Numerical results confirm the excellent performance of the compact ALE scheme on unstructured meshes.

comments
26 pages, 16 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.05095 ↗

In this paper, we propose a method based on rasterization in computer graphics for the integration of discontinuous functions accurately and efficiently on the GPU. The proposed method takes advantage of the massively parallel architecture of GPUs via a modified graphics pipeline, where discontinuities are encoded through geometric primitives and processed in the rasterization stage, and multisample anti-aliasing (MSAA) is used to improve integration accuracy across subdomain interfaces. We present both hardware- and software-based pipelines and compare their performance in terms of accuracy as well as computational effort on modern GPU hardware with adaptive quadrature on the CPU. For the tested hardware, at approximately comparable median relative error, the hardware pipeline is up to around $100\text{x}$ faster than adaptive quadrature, while the single- and double-precision software pipelines achieve up to $840\text{x}$ and $1200\text{x}$ speedups compared to their adaptive quadrature counterparts. We use the finite cell method as model problem, where cutcells represent discontinuous integrands at the interface of the physical and fictitious domains and demonstrate the performance of the proposed method using numerical benchmarks. The end-to-end finite cell solution runtime is reduced by a factor of $8.3$ to $9.5$ in the single-precision pipeline and by a factor of $62$ to $72$ in the double-precision pipeline at the prescribed integration settings. Therefore, results indicate that the rasterization-based integration method is a promising alternative for the accurate and efficient integration of discontinuous functions in demanding applications on the GPU.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.05186 ↗

We consider the one-dimensional Dirac operator $D_{A,c}$ with a general, not necessarily self-adjoint, point interaction at the origin, whose strength is described by an arbitrary complex $2\times 2$ matrix $A$ and suitably rescaled by the speed of light $c$, together with its non-local approximations $D_{A,c}^ε$ obtained by replacing the Dirac distribution by a rank-one projection onto a scaled function $v_ε$. It is known that $D_{A,c}^ε\to D_{A,c}$ as $ε\to 0+$ and that $D_{A,c}-c^2/2$ converges, as $c\to+\infty$, to the Schrödinger operator $H_A$ with the general point interaction, both in the norm resolvent sense. We prove that the first convergence is uniform with respect to $c$ in a neighbourhood of $+\infty$, and we provide explicit rates of convergence. Combining this with an explicit computation of the non-relativistic limit of $D_{A,c}^ε$ for fixed $ε$, we show that the two limits can be interchanged and that the corresponding double limit exists. As a by-product we obtain a family of non-local, rank-two approximations $H_A^ε$ of $H_A$ that converge to $H_A$ in the norm resolvent sense. Contrary to the relativistic setting, the coupling constants of $H_A^ε$ are renormalized; we give an explicit formula for this renormalization.

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

Let $μ$ be a probability distribution on a spin system with $n$ sites and possibly infinite spin spaces. We prove local-to-global spectral-gap bounds for block Glauber dynamics. Given a symmetric, entrywise nonnegative matrix $A$ with zero diagonal and $λ_{\max}(A)<1$ encoding local spectral bounds for a spin system, we derive global spectral-gap bounds for block dynamics on its marginal distributions. These bounds are sharp: the Gaussian system with covariance $(I-A)^{-1}$ attains equality for every choice of disjoint blocks. Our proof extends the Bochner method through an abstract inequality for orthogonal projections on Hilbert spaces. As an application, we prove that Glauber dynamics for the $O(N)$ model, with $N\geq 2$, arbitrary external fields, and couplings of either sign, has spectral gap at least $(1-\|J_{\mathrm{abs}}\|_{\mathrm{op}}/N)/n$, where $J$ is the interaction matrix and $J_{\mathrm{abs}}=(|J_{ij}|)$. We also obtain spectral bounds for swap walks and local spectral expansion of partite simplicial complexes. For complexes formed from disjoint groups of ranks in random flags of subspaces over $\mathbb F_q$, we obtain a one-sided local spectral expansion bound of $2\sqrt q/(q+1)$. This bound is independent of the number and sizes of each group, and is nontrivial for every prime power $q$. Finally, for random forests $F$ of any finite graph with arbitrary positive edge weights, we prove that \[ \Pr(e,f\in F)\le \frac{4}{3} \Pr(e\in F)\Pr(f\in F) \] for distinct edges $e,f$, improving the factor 2 supplied by general log-concavity bounds for matroid independent sets. The argument combines our extended Bochner method with the analysis of an auxiliary real stable polynomial.

comments
42 pages
fields
Mathematical Physics, Combinatorics, Probability
pdf ↗ page arXiv:2611.05228 ↗

Minimal model and its linear stability analysis (LSA) for Plateau-Rayleigh (PR) instability of an intermixed, solid binary alloy nanowire is presented. Model accounts only for the surface diffusions of the alloy components without anisotropies of a surface energies, and for a classical thermodynamic surface segregation. Model allows to assess a deviation of a longwave instability cutoff wavelength $λ_c$ from the classical value $2πr_0$ (a wire circumference) as a function of a surface composition deviation from its equilibrium value, a wire radius, and a bulk concentration of a minority component. Results of LSA are presented for AuNi, PtNi, and CoNi nanowires, where an important distinction is that a surface segregation curve for CoNi is qualitatively different from the one for AuNi and PtNi. For each nanowire there is a sizable region of a parameter space where $λ_c<2πr_0$ and correspondingly, a fastest growing perturbation wavelength $λ_{max}$ is also less than a wire circumference. This is in stark contrast to PR instability of a single-component nanowire transporting mass by surface diffusion - in this case $λ_c$ and $λ_{max}$ are larger than a wire circumference. Strong surface segregation is primarily responsible for unusually small $λ_c$ and $λ_{max}$. Results suggest that a large number of small and closely spaced nanoparticles may emerge upon disintegration via annealing of a binary alloy nanowire.

fields
Mathematical Physics
pdf ↗ page arXiv:2611.05283 ↗

This article studies the dynamical properties of the multiple elastic pendulum formed by an arbitrary number of point masses connected in a chain by elastic springs. First, using the Lagrangian formulation, the equations of motion governing the system's behavior, accounting for both large-angle displacements and elastic deformations, are derived. It is shown that well-established, low-dimensional systems, such as the classical double elastic pendulum, can be systematically recovered as particular cases directly from the general equations of motion after applying the appropriates particular conditions. The behavior of the system under small oscillations near its stable equilibrium is also investigated. For this case, the linearized equations allow the solution of the eigenvalue problem, demonstrating that in this case uncoupled behavior between the angular displacements and the spring elongations.

comments
13 pages, 3 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2611.05312 ↗

We construct an exact map between continuum fermion fields and lattice fields in 1+1 dimensions. This map rewrites a continuum Hamiltonian as a lattice Hamiltonian with nearest-neighbor couplings and an infinite-dimensional local Hilbert space. The resulting lattice model reproduces exactly the energy spectrum, global operator algebra, chiral symmetries, and anomalies of the continuum QFT on any finite lattice. Unlike domain wall fermions, truncating the local Hilbert space introduces no extra massless modes, and the entanglement entropy of an interval converges as the truncation is removed. The lattice local algebras are of type I and lie between the type III continuum algebras of nested spatial regions, in accordance with the split property. We demonstrate this construction explicitly for $N$ Majorana fermions, realizing the $\mathrm{O}(N)_\mathrm{L}\times\mathrm{O}(N)_\mathrm{R}$ lattice chiral symmetry. We also construct an exact lattice model for the Schwinger model and numerically reproduce the mass gap $e/\sqrtπ$.

comments
13 pages, 7 figures, 1 table
fields
Mathematical Physics
pdf ↗ page arXiv:2611.05329 ↗

We construct boundary Liouville conformal field theory at central charge $c\leq1$ with FZZT-type boundary conditions and show that it satisfies the Cardy–Lewellen sewing constraints on the disk and the annulus. Using the analytic bootstrap we derive the so far missing boundary three-point and bulk-to-boundary structure constants and a consistent disk one-point function as explicit meromorphic functions of the Liouville momenta. In sharp contrast to $c\geq25$, the open-string spectrum between two ``timelike'' FZZT boundaries is \emph{discrete}, yet non-trivially consistent through open-closed duality with the \emph{continuous} closed-string spectrum of Ribault and Santachiara.

comments
prl; 7 pgs supp material
fields
Mathematical Physics
pdf ↗ page arXiv:2611.05378 ↗

Differential Geometry18

We determine the positive scalar curvature Kähler cone of every minimal compact Kähler surface of Kodaira dimension $-\infty$. By the Enriques–Kodaira classification, every such surface is either $\mathbb P^2$ or a geometrically ruled surface $\mathbb P(E)\toΣ_g$, where $E$ is a rank-two holomorphic vector bundle over a compact Riemann surface of genus $g$. On $\mathbb P^2$, every Kähler class admits a Kähler metric of positive scalar curvature, whereas on $\mathbb P(E)$, every Kähler class of positive total scalar curvature admits a metric of positive scalar curvature if and only if $g\le1$ or $E$ is slope-semistable. We further prove that if a smooth compact Kähler surface admits a birational morphism onto a ruled surface $\mathbb P(E)\toΣ_g$, where $g\ge2$ and $E$ is slope-unstable, then it contains a Kähler class of positive total scalar curvature admitting no positive scalar curvature Kähler metric. Finally, for every smooth compact Kähler surface $X$ birational to $Y=\mathbb P^2$ or $Y=\mathbb P(E)$, we show that Kähler classes admitting positive scalar curvature metrics on $Y$ are exactly the pushforwards of classes admitting such metrics on $X$.

comments
25 pages; improved organization and notation; added Theorem 3
fields
Differential Geometry, Algebraic Geometry
pdf ↗ page arXiv:2609.27870 ↗

Deep neural networks extract powerful latent representations from images, enabling fast and efficient downstream analysis. However, these latent spaces lack explicit geometric structure, leading to possibly poor interpolation fidelity and misleading extrapolation. Latent interpolation techniques assume symmetric transition costs which are often not the case for real world data. Their symmetric nature cannot capture directional processes, such as disease progression, where certain transitions are impossible (e.g. tumor growth dynamics or cognitive improvement in Alzheimer's disease). Although Riemannian metrics extend Euclidean geometry by incorporating curvature, they remain symmetric. We show that understanding asymmetry and not curvature alone directly addresses these problems. To do so we propose a new Finsler-Randers metric learning framework. It incorporates direction-dependent distances, thus enabling the computation of trajectories respecting monotonic sequential constraints. We demonstrate its potential for interpolation and extrapolation on controlled cross-sectional datasets.

fields
Differential Geometry
pdf ↗ page arXiv:2611.03675 ↗

We study uniqueness of scalar-flat Kähler metrics in a fixed Kähler class on an asymptotically locally Euclidean (ALE) Kähler manifold, assuming only differentiated $o(1)$ decay to a fixed Euclidean metric on the end. In complex dimension $n\geq2$, under suitable polynomial decay of the reference metric, we prove that the relative Mabuchi functional is finite, continuous, and convex along weak geodesics whose endpoint potentials satisfy $u=O(r^{-γ})$, $γ>2n-4$, together with the corresponding derivative estimates. Combining this convexity with the analysis of the Lichnerowicz operator in weighted spaces, we obtain uniqueness by a perturbation argument. Decay improvement and comparison of the asymptotic charts produce a global potential with the required decay for the difference of the two cohomologous scalar-flat Kähler forms. The argument also extends to asymptotically conical Kähler metrics approaching a fixed Ricci-flat Kähler cone under prescribed decay assumptions.

comments
71 pages, 1 figure. Comments are welcome!
fields
Differential Geometry
pdf ↗ page arXiv:2611.03736 ↗

We show that the Belinski-Zakharov soliton construction factorizes into signed Pfaffian tau-functions, revealing a pure-spinor description of the metric and its regularity conditions. We derive analytic restrictions on the integral rod data, prove uniqueness for the asymptotically flat balance problem at fixed rod structure and periods, and give a conditional criterion for global existence. Combining these results with exhaustive enumeration of the admissible data and rigorous existence certificates, we construct a catalogue of regular asymptotically flat solutions representing 356 rod-word classes through twelve turning points, and 52 isolated regular asymptotically locally flat solutions through eight turning points. Analytic positivity and smooth-completion results establish regularity beyond the finite numerical solve. Based on this catalogue, we investigate two organizations of the solution space: generalized rank-two root systems and compositions of simpler endpoint geometries. The endpoint composition rules reproduce exactly all retained asymptotically flat words through twelve turning points.

comments
80 pages, 3 figures
fields
Differential Geometry
pdf ↗ page arXiv:2611.03750 ↗

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 Ricci-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 ↗

We prove that there are no proper biharmonic submanifolds with parallel normalized mean curvature vector field in a nonpositive space form, in arbitrary dimension and codimension. We also prove that every biharmonic surface with flat normal bundle in a four-dimensional nonpositive space form is minimal. These results provide substantial support for Chen's conjecture and the generalized Chen's conjecture for hyperbolic space in higher codimensions.

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

In this note, we begin with considering the simple one-dimensional field theory describing a single free particle on manifold, and apply the BRST formalism and BV quantization to this model following the standard procedures in physics. Through calculations that, while not fully rigorous, have a more transparent physical interpretation, then subsequent geometric identifications, we recover the deformation quantization and algebraic index theorem on symplectic manifold. This note thus elucidates the physical origins and mechanisms of these mathematical results.

comments
21 pages. AI is used for computations and English editing. Comments and suggestions are welcome!
fields
Differential Geometry, Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2611.04258 ↗

This article has two main parts. The first consists of a brief survey of $G_2$-structures with torsion, namely $G_2$-structures admitting a $G_2$-connection with totally skew-symmetric torsion. We focus primarily on the strong condition that the associated torsion $3$-form is closed. We review their basic properties and their connections with the heterotic $G_2$ system, generalized geometry, and six-dimensional geometry. In the second part, we construct two complete cohomogeneity-one strong $G_2T$-structures on $\mathbb{R}\times S^3\times S^3$ with non-zero closed and co-closed characteristic torsion, and non-vanishing characteristic Ricci tensor. Both have an asymptotically cylindrical end; at the other end, the first is asymptotically conical (AC), with a torsion-free $G_2$ cone as its asymptotic model, while the second is asymptotically locally conical (ALC), with a constant-length circle bundle over a Calabi–Yau cone as its asymptotic model. We investigate the induced $SU(3)$-structures on their circle quotients and show that they are globally conformally almost Kähler and globally conformally Kähler, respectively. To the best of our knowledge, these provide the first complete strong $G_2T$-structures whose underlying metrics are not locally Riemannian products.

comments
26 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.04460 ↗

Let $(S,V)$ be a marked 2-sphere with $|V|\ge3$, and fix a spherical discrete conformal class. Izmestiev-Prosanov-Wu proved existence and uniqueness for positive prescribed combinatorial curvature in the spherical discrete conformal class on $(S,V)$. In this paper, we identify a region of prescribed combinatorial curvature vectors, allowing some negative components, for which existence still holds.

fields
Differential Geometry
pdf ↗ page arXiv:2611.04478 ↗

Bär has shown that a fixed boundary metric and a scalar-curvature lower bound do not generally bound total mean curvature from above. We extend this unboundedness to every smooth compact connected manifold of dimension $n\ge3$ with nonempty boundary and every prescribed boundary metric, using scalar-flat metrics. While Bär's examples use warped products, our construction uses a nonzero cubic variation of total mean curvature near a flat product, followed by localization and conformal correction. We also construct arbitrarily $C^k$-small perturbations of the flat torical half-cylinder with nonnegative scalar curvature, unchanged boundary metric, an exact product end, and positive total boundary mean curvature.

fields
Differential Geometry
pdf ↗ page arXiv:2611.04762 ↗

We present a geometric derivation of the hidden symmetries of the Kepler problem, combining a duality for central-force systems, obtained by interchanging positions and velocities, with a generalized form of Jacobi's theorem. Applied to the dual Kepler problem, this theorem identifies Kepler hodographs of prescribed energy with geodesics of a metric of constant curvature. After adjoining one point at infinity, the resulting geometry is complete. Its Killing vector fields induce a finite-dimensional Lie algebra of infinitesimal symmetries on the corresponding energy hypersurface. The distinguished point at infinity determines a canonical decomposition of the Killing algebra into two vector subspaces, whose associated Noether invariants recover angular momentum and the Runge-Lenz vector.

fields
Differential Geometry, Mathematical Physics
pdf ↗ page arXiv:2611.04791 ↗

We study Jack Lee's conjecture that, for a compact strictly pseudoconvex CR manifold $M$, the condition $c_1(T^{1,0}M)=0$ in $H^2(M,\mathbb{R})$ implies the existence of a pseudo-Einstein structure. For links of isolated singularities, we construct counterexamples in every odd dimension at least three, with $c_1(T^{1,0}M)=0$ in $H^2(M,\mathbb{Z})$ and $b_1(M)=0$. For isolated algebraic singularities of log canonical type and complex dimension at least three, we prove that the real Chern class condition is equivalent to $\mathbb{Q}$-Cartierness of the canonical divisor, log canonicity, and the existence of a pseudo-Einstein structure. Finally, we construct a Du Bois threefold singularity whose link satisfies the real Chern class condition but admits no pseudo-Einstein structure. The initial versions of the proofs were generated with AI assistance and were subsequently revised and verified by the authors.

comments
25 pages
fields
Differential Geometry, Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2611.04851 ↗

Yan-Zhu (arXiv:2605.31477) showed the compactness of complete Riemannian manifolds with non-negative Ricci curvature and uniformly convex boundary. In this paper, we give an alternative proof of this compactness theorem.

comments
9 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.04866 ↗

Let $M$ be a smooth manifold of dimension $n\ge4$, and let $F$ be a smooth, strongly convex Landsberg metric, regular on the entire slit tangent bundle. We prove that $F$ is Berwald if, at each fixed base point, the Minkowski norm is real-analytic on the entire slit tangent space. The proof rests on two analytic rigidity theorems for a single Minkowski space. The first asserts that, in dimension at least $3$, a real-analytic Minkowski norm whose Hessian metric is flat is induced by an inner product. The second asserts that, in dimension at least $4$, the Hessian metric of a real-analytic Minkowski norm is flat if the entire indicatrix carries a nonzero smooth symmetric quartic form satisfying a twisted Codazzi equation. The quartic form need not be real-analytic, and the second theorem is proved independently of the first. Applying these results to the angular Berwald quartic form shows that the metric is Riemannian on the open set of base points on whose fibres the Berwald curvature is not identically zero. Since every Riemannian metric is Berwald, this set must be empty. No analytic structure, compactness or completeness of the base manifold is assumed, and the metric need not be reversible.

fields
Differential Geometry
pdf ↗ page arXiv:2611.05067 ↗

Our results are twofold. Inspired by recent work on weighted spheres, we extend the Lai–Wei construction from one to several independent isoparametric inputs, replacing its profile curve by a hypersurface profile to generate minimal hypersurfaces in spheres. Using a curvature criterion, we obtain new infinite families of area-minimizing hypercones from the original construction and its extensions.

fields
Differential Geometry
pdf ↗ page arXiv:2611.05149 ↗

K. Broder recently classified the closed Einstein 4-manifolds whose isometry groups have dimension at least three. The proof reduces the problem to the study of cohomogeneity-one Einstein metrics invariant under $SU(2)$, however a few cases are not treated. We reconcile the missing cases using Broder's techniques with minimal modifications.

comments
8 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.05288 ↗

In this article, we investigate inequalities involving the min-max width associated to the distance function and the area of two-dimensional Riemannian spheres. This geometric invariant naturally arises as min-max methods are applied for the distance function defined on the space of pairs of points. Our methods involve careful constructions of sweepouts that can be performed under the hypothesis that the Riemannian sphere does not contain stable closed geodesics. Improved bounds are obtained under further geometric assumptions (positive curvature, pinching condition, and antipodal symmetry). In the cases of a pinching condition or antipodal symmetry, our inequalities are optimal.

comments
15 pages, 2 figures
fields
Differential Geometry
pdf ↗ page arXiv:2611.05315 ↗

We classify the simply connected toric gravitational instantons whose torus action has four fixed points. They are the hyperkähler multi-Eguchi–Hanson and multi-Taub–NUT metrics with four collinear centres, the asymptotically flat instantons on Li and Sun's manifold $X_3$, up to scale one for each twist at infinity in $(0,1)$ for a fixed orientation of the torus, and, up to scale, a single further instanton with an ALF end, which is not hyperkähler. The last two are Hermitian for neither orientation. In particular, the toric asymptotically flat instanton on $X_3$ with a given twist is unique up to scale, as conjectured by Li and Sun. The proof combines the solitonic form of Geroch's conjecture, which turns smoothness into polynomial equations for the soliton data, with a convexity principle adapted from Aksteiner. At a fixed asymptotic parameter, the cone errors of the conical metrics with a given rod structure are the gradient of a strictly convex function of the rod lengths, and the strict convexity gives uniqueness. Existence follows from an explicit solution for the ALF end and, for the AF ends, from Li and Sun's existence theorem. We also outline how a chart of Aksteiner identifies these AF instantons with those found by Teo.

comments
47 pages
fields
Differential Geometry
pdf ↗ page arXiv:2611.05333 ↗

Number Theory17

We study quantitative density of orbits of the free semigroup $Γ$ generated by two maps of $(0,\infty)$. For the Möbius pair $x\mapsto 1/x$, $x\mapsto x+1$ we show that every orbit is $O(n^{-1})$-dense in $[0,\infty)$, that every irrational number $u$ is approached at a rate governed by the continued fraction of $u$ (at least $n^{-2}$, exponential when $u$ has bounded partial quotients, and $\exp(-cn/\log n)$ for almost every $u$), and that for rational $u$ and rational starting points the rate $n^{-1}$ is optimal. For the affine pair $T_0(x)=x/a$, $T_1(x)=bx+1$ with $a,b>1$, which was studied by Bergelson, Misiurewicz and Senti, we prove that for every $x>0$ and $u\ge 0$ there are infinitely many $γ\inΓ$ with \[ |γ(x)-u|<C\,λ^{-|γ|},\qquad λ=\exp\!\Big(\frac{\log a\,\log\frac{a}{a-1}}{\log\frac{a^2b}{a-1}}\Big)>1, \] where $|γ|$ is the word length of $γ$ and $C$ is independent of $γ$. This exponential rate holds whether or not $\log_a b$ is rational, and the exponential order cannot be improved for almost every $u$. We also give a corrected version of the Kronecker-type estimate $|γ(x)-u|<(u+1)(t^{1/|γ|}-1)$. Finally, we discuss the approximation of real numbers by ratios of primes and by ratios of logarithms of primes, updated in light of recent results on gaps between primes.

comments
This is a revised version of a published article
journal
M. Javaheri, A generalization of Dirichlet approximation theorem for the affine actions on real line, J. Number Theory 128 (2008), no. 5, 1146--1156
fields
Number Theory
pdf ↗ page arXiv:2611.03778 ↗

We determine all the groups that appear as the torsion group of an elliptic curve over a number field of degree $6$. Apart from the $44$ groups that occur infinitely often, which were determined by Derickx and Sutherland, exactly four groups occur: $\mathbb{Z}/25\mathbb{Z}$, $\mathbb{Z}/37\mathbb{Z}$, $\mathbb{Z}/4\mathbb{Z}\times\mathbb{Z}/12\mathbb{Z}$ and $\mathbb{Z}/2\mathbb{Z}\times\mathbb{Z}/24\mathbb{Z}$. The first three were known to occur, while the group $\mathbb{Z}/2\mathbb{Z}\times\mathbb{Z}/24\mathbb{Z}$ is new. We also show that, up to isomorphism, each of the groups $\mathbb{Z}/37\mathbb{Z}$ and $\mathbb{Z}/2\mathbb{Z}\times\mathbb{Z}/24\mathbb{Z}$ is the torsion group of a single elliptic curve over a single sextic field. The methods build on those developed by Derickx and Najman for quartic fields and by the author for quintic fields. Among the new ingredients are a formal immersion criterion at the prime $2$ which uses the Cartier operator, and arguments with several diamond operators and with cuspidal divisor classes on quotients of modular curves.

comments
36 pages. This paper will become part of a paper covering degrees 6 to 9 (degree 10 will be a separate paper) in the future, see the AI disclosure and future work in the paper
fields
Number Theory
pdf ↗ page arXiv:2611.03933 ↗

Let $F$ be a totally real field, abelian over $\Q$, in which an odd prime $p$ splits completely, and let $ρ:G_F\to\GL_2(\overline\Q_p)$ be an odd irreducible representation which is de Rham with distinct Hodge–Tate weights at the places above $p$ and whose residual representation is reducible. We consider the \emph{mixed} case of the Fontaine–Mazur conjecture, in which $ρ$ is reducible at some places above $p$ and irreducible at the others. This case is not covered by the work of Pan and Zhang. We prove some instances of modularity in this situation. Our main result is that $ρ$ is modular if it is non-split at every place above $p$ where it is reducible, by combining Zhang's pro-modularity theorem with a classicality criterion based on Emerton's ordinary parts. Together with a theorem of Zhao on local indecomposability, this gives the modularity of the $λ$-adic representations attached to abelian varieties of $\GL_2$-type in the mixed case, and, using a result of Snowden, of potentially modular representations of parallel weight two under a mild additional condition. It also gives the modularity of representations whose local type at every place above $p$ is of discrete series type, and, through a member of the compatible system with interchanged Hodge-Tate weights, of potentially modular representations of weight $(2,k)$ over real quadratic fields with Steinberg type at one place above $p$, under conditions on that member.

fields
Number Theory
pdf ↗ page arXiv:2611.04017 ↗

In a famous paper of Andrews, he defined and studied the smallest parts function $\operatorname{spt}(n)$. He showed that it satisfies the three Ramanujan-type congruences: \[ \operatorname{spt}(5n+4)\equiv0\pmod5,\qquad \operatorname{spt}(7n+5)\equiv0\pmod7,\qquad \operatorname{spt}(13n+6)\equiv0\pmod{13}. \] In a recent preprint, the author showed that these are the only "canonical'' congruences. Here, we complete the classification of Ramanujan-type congruences for $\operatorname{spt}$, showing that if $\operatorname{spt}(\ell n+b)\equiv0\pmod\ell$ for all $n\geq0$, where $\ell\geq5$ is prime, then $(\ell,b)\in\{(5,4),(7,5),(13,6)\}.$ That is, Andrews' congruences are the only Ramanujan-type congruences for $\operatorname{spt}(n)$. These results have been verified in Lean by AxiomProver.

comments
8 pages
fields
Number Theory
pdf ↗ page arXiv:2611.04178 ↗

We establish an analogue of the Hilbert irreducibility theorem for all K3 surfaces over number fields that admit an automorphism of positive entropy. Our method draws ingredients from both algebraic geometry and complex dynamics.

comments
24 pages, 1 figure
fields
Number Theory, Algebraic Geometry, Dynamical Systems
pdf ↗ page arXiv:2611.04210 ↗

For $α\in\mathbb{R}$ and $k\in\mathbb{N}$, let $S_{α,k}(x):=\#\{n\in\mathbb N:n\le x,\ \gcd(n,\lfloorαn^k\rfloor)=1\}$. Roth conjectured, and Watson proved, that $S_{α,1}(x)\sim 6x/π^2$ for every irrational $α$. Whether the same asymptotic holds for every fixed $k\ge2$ is a special case of a question of Bergelson and Richter, and was asked explicitly by Champagne. We answer this for $k=2$, with no Diophantine condition on $α$: for every irrational $α$, $S_{α,2}(x)\sim x/ζ(2)$ as $x\to\infty$. More precisely, for every fixed $A>0$ we obtain an error term $O_A(x/(\log q(x))^A)$, where $q(x)$ is the largest continued-fraction convergent denominator of $α$ not exceeding $x$. The proof sieves $S_{α,2}(x)$ over divisors, splitting at the parameter $R=q(x)^{1/8}$. Divisors larger than $R$ are handled by reducing the condition $d\mid\gcd(n,\lfloorαn^2\rfloor)$ to Möbius sums over arithmetic progressions and applying Zhan's uniform estimate for exponential sums twisted by $μ(n)$ over short intervals; divisors at most $R$ are handled instead through the Erdős-Turán inequality together with Weyl-type bounds for quadratic exponential sums of the form $\sum e(βn^2)$.

fields
Number Theory
pdf ↗ page arXiv:2611.04345 ↗

Recently, Ono established a new connection between partition congruences and the arithmetic of elliptic curves by expressing the partition function $p(n)$ as a CM trace on the modular curve $X_0(6)$. This approach yields new proofs of Ramanujan-type congruences for the partition function modulo powers of $5$, $7$, and $11$, revealing how the geometry of supersingular elliptic curves and the arithmetic of oriented optimal embeddings govern these congruence properties. Motivated by Ono's work, we develop an analogous passage from CM traces to congruences modulo $5$, $7$, and $13$ for the for Andrews's smallest-parts partition function $spt(n)$, employing the established theta-lift and modular-trace methods suited to this setting. With $P$ the Bruinier–Ono weight-zero weak Maass function and $f$ an explicit weakly holomorphic modular function on $Γ_0(6)$, the Ahlgren–Andersen formula expresses $spt(n)$ as one twelfth of the discriminant $1-24n$ CM trace of $f-P$. We explain the theta-lift normalization, the contribution of the two orientations, and the harmonic-Maass-form uniqueness argument. Following Garvan's work, we construct integral forms $G_\ell$ of weight $\ell+1$ on $Γ_0(\ell)$, compute their Fricke transformations, and prove the exact identities $$ \mathcal T_5(G_5)=-5E_6,\qquad \mathcal T_7(G_7)=-7E_8,\qquad \mathcal T_{13}(G_{13})=13E_{14}. $$ Their reductions yield the three congruences on the Andrews's smallest-parts partition function. We also give a supersingular specialization of the trace of $f$, with actual reduction multiplicities, and explain the role of imprimitive forms, the conductor restriction in CM reduction, and the distinction between the primes $11$ and $13$. These results have been verified in Lean using AxiomProver.

fields
Number Theory
pdf ↗ page arXiv:2611.04387 ↗

Let $f\in\mathbb Z[x]$ be a polynomial of degree $n$ with integer coefficients of absolute value less than $2^b$. Using Pan's approximate factorization theorem, we give a deterministic algorithm that finds all distinct integer roots of $f$ in $\widetilde O(nb)$ bit operations. This matches the bit size of the input up to logarithmic factors and does not require $f$ to be square-free. Since we were unable to verify parts of the running time analysis of Pan's theorem, we also give a self-contained deterministic algorithm with running time $\widetilde O(nb+\min(n,b)^3b^2)$, which is $\widetilde O(nb)$ whenever $b\leq n^{1/4}$. This answers a question of Harvey and Hittmeir (2022), who asked whether integer roots can be found deterministically in quasilinear time, conditionally on Pan's theorem, and unconditionally for $b\leq n^{1/4}$. The fastest previous deterministic algorithm, due to Nir, takes $\widetilde O(n^{3/2}b)$ bit operations and works only for square-free polynomials. Instead of $p$-adic lifting, we combine approximate complex root finding with exact polynomial evaluation. We first approximate the complex roots of the polynomial formed by the top $\min(n,b)+1$ coefficients of $f$. Every integer root $r$ of $f$ with $|r|\geq 2$ lies within distance $2$ of some complex root of this truncated polynomial. Rounding the real parts of the approximate roots therefore gives a list of $O(\min(n,b))$ candidate integers that is guaranteed to contain all integer roots of $f$. Although a single candidate can have up to $b$ bits, a bound via the Mahler measure shows that the bit lengths of all candidates sum to $O(b)$. This allows us to test all candidates by exact multipoint evaluation in $\widetilde O(nb)$ bit operations.

fields
Number Theory
pdf ↗ page arXiv:2611.04730 ↗

We give a counting formula for the coefficients $a\in\F_{p^h}$ for which $x^{2n}+ax^n+1$ is irreducible in $\F_{p^h}[x;σ]$, for arbitrary positive integers $n$ and $h$, where $σ(a)=a^p$ and $p$ is an arbitrary prime power. The proof reduces the problem to quadratic reduced norms, establishes a uniformity statement for every Frobenius generator, and counts the remaining coefficients by Möbius inversion.

comments
23 pages
fields
Number Theory
pdf ↗ page arXiv:2611.04767 ↗

In this paper, we study binary 3 x 3 matrices with determinant one that generate the Tribonacci recurrence. Starting from a specific generating matrix, we obtain explicit expressions for its powers and inverse powers in terms of the Tribonacci sequence T_n and two associated sequences B_n and R_n. This matrix framework yields identities involving traces, determinants, and products, including addition formulas and Cassini-type relations linking T_n, B_n, and Rn. Moreover, we derive new identities from the matrix representation of inverse powers and establish structural relations between these sequences. As an application, we investigate arithmetic properties of Tribonacci numbers and determine the exact 2-adic valuation of T_2^k for sufficiently large k. Finally, we provide a classification of 3 x 3 matrices associated with the Tribonacci recurrence via similarity over Q.

fields
Number Theory
pdf ↗ page arXiv:2611.04855 ↗

In a recent paper of the same title, we considered nondistinct partitions of integers over the Fibonacci sequence and related linearly recurrent sequences. In this paper, continuing this story, we apply the same method, but consider distinct partitions. In particular, let $q_F(m)$ denote the number of ways of writing $m$ as the sum of distinct Fibonacci numbers. It is well-known that, while $q_F(m)$ behaves wildly, its partial sums behave in a more structured way. In particular, Kempton showed that the function $N^{-\log 2/\log\varphi}\sum_{m\leqslant N}q_F(m)$ is asymptotically logarithmically-periodic. In this paper, we improve on this result by providing an explicit error term. Additionally, we prove the analogous result for a class of more general linear recurrent sequences.

comments
12 pages, 1 figure
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2611.04869 ↗

Let $C>3$ be an odd square-free integer, $q$ an odd prime not dividing the class number of $\mathbb Q(\sqrt{-C})$, and $p_1,\dots,p_k$ distinct odd primes not dividing $C$. We describe all solutions of $Cx^2+p_1^{2m_1}\cdots p_k^{2m_k}=y^q$ in positive integers with $\gcd(x,y)=1$ and $y$ odd. Writing $N=p_1^{m_1}\cdots p_k^{m_k}$, every solution comes from a unique factorization $x\sqrt C+N\sqrt{-1}=\pm(u\sqrt C\pm v\sqrt{-1})^q$, or from a half-integral analogue when $q=3$, in which each $p_i\ne q$ divides exactly one of $v$ and $N/v$. Using primitive divisors of Lehmer sequences, we show that for $q\ge5$ some $p_i$ satisfies $p_i\equiv\leg{-C}{p_i}\pmod q$; in particular, there is no solution when $q\ge\max(5,p_1+2,\dots,p_k+2)$. For $q=3$ the equation reduces to four explicit auxiliary equations.

fields
Number Theory
pdf ↗ page arXiv:2611.04923 ↗

We study the asymptotic behaviour of the mean square of long truncations of the Dirichlet series for $\bigl(ζ'/ζ\bigr)^{k}$ on the critical line; we establish the connection between this problem and the short-interval variance of the convoluted von Mangoldt function $Λ^{*k}$ in short intervals and in arithmetic progressions. Under a shifted moments conjecture and the Riemann Hypothesis (RH), we prove that the short-interval variance leading coefficient is the derivative of the mean-square leading coefficient. A unitary trace-sum average governs the variance of sums of $Λ^{*k}$ over monic polynomials in $\mathbb F_q[T]$; we denote its leading coefficient by $δ_k(c)$, where the total trace degree and matrix size grow with a fixed ratio $c$. Under a weaker shifted moments conjecture and RH, we recover this $δ_k(c)$ as the leading coefficient of the variance of short-interval sums of $Λ^{*k}$ over the integers. It is the counterpart of $γ_k(c)$, the piecewise polynomial from the variance of divisor sums, with the Dirichlet coefficients of $ζ(s)^k$ replaced by those of $\bigl(-ζ'/ζ\bigr)^k$.

fields
Number Theory, Mathematical Physics
pdf ↗ page arXiv:2611.05000 ↗

Hecke operators can be used to relate characters of rational conformal field theories with different central charges, but it has remained a mystery how to interpret these relations physically. We offer a simple explanation in terms of self-duality under asymmetric orbifolds. Self-dual orbifolds also give more general identities beyond the familiar Harvey-Wu construction, which we illustrate through examples.

comments
41 pages
fields
Number Theory, Representation Theory
pdf ↗ page arXiv:2611.05002 ↗

Andrews and El Bachraoui (\textit{RACSAM} \textbf{119}, \textit{Article Number 4 (2025)}) established identities relating $4$-regular partitions to partitions with distinct even parts whose largest part is odd. As an extension to their work, in this paper we define partitions of a positive integer $n$ with bounded multiplicity restriction on even parts and whose largest part is odd. We prove some identities relating our partition functions and $2r$-regular partition function, and show that identities due to Andrews and El Bachraoui follow as particular cases.

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

A cubic partition of a positive integer $n$ is a partition of $n$ in which even parts may appear in two distinct colors. The purpose of this paper is to study the arithmetic functions $COS(n)$ and $CES(n)$, which denote the sums of all odd and even parts, respectively, in all cubic partitions of $n$. We obtain their generating functions and divisor-sum formulas, and establish Ramanujan-type congruences modulo $3$, $4$, $5$, and $7$. To prove these congruences, we use Lambert series, classical theta-function identities, dissections, coefficient extraction, and weighted Euler identities.

fields
Number Theory
pdf ↗ page arXiv:2611.05196 ↗

We prove a power-saving form of the van der Corput property for cubes. As a consequence, we obtain a power-saving bound $|A|\ll_\varepsilon N^{59/60+\varepsilon}$ for sets $A\subseteq\{1,\ldots,N\}$ with no nonzero cube differences.

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

Statistics Theory15

We propose logit-based IV and augmented logit-based IV estimators that serve as alternatives to the traditionally used 2SLS estimator in the model where both the endogenous treatment variable and the corresponding instrument are binary. Our novel estimators are as easy to compute as the 2SLS estimator but have an advantage over the 2SLS estimator in terms of causal interpretability. In particular, in certain cases where the probability limits of both our estimators and the 2SLS estimator take the form of weighted-average treatment effects, our estimators are guaranteed to yield non-negative weights whereas the 2SLS estimator is not.

comments
40 pages
fields
Statistics Theory
pdf ↗ page arXiv:2312.10333 ↗

We study the multi-modal Laplace approximation, given by a weighted Gaussian mixture centred at the local minima of the negative log-density, for sampling from probability measures that concentrate around finitely many modes as an inverse-temperature parameter $n$ grows. Such distributions occur in Bayesian inference in the small noise or large data regime. We derive explicit, non-asymptotic bounds on the Hellinger distance between the multi-modal Laplace approximation and the concentrating posterior. The bound decays like $n^{-1/2}$ with $n$ and the constants depend only polynomially on the dimension $d$. Moreover, we analyse the Laplace mixture as a proposal distribution for self-normalised importance sampling and independent Metropolis–Hastings (IMH) targeting concentration multimodal distributions. We derive asymptotic results, as $n\to\infty$, on the effective sample size in case of importance sampling as well as on the average acceptance probability, lag-one autocorrelation, and spectral gap in case of IMH. Numerical experiments illustrate and verify our theoretical findings.

comments
40 pages, 8 Figures
fields
Statistics Theory, Numerical Analysis, Probability
pdf ↗ page arXiv:2611.03773 ↗

We introduce a one-parameter family of continuous distributions on the unit interval whose cumulative distribution functions are given by the odd-height power towers \(x\uparrow\uparrow n\) (\(n=1,3,5,\dots\)). The associated densities admit a simple recursive formula obtained by logarithmic differentiation. We prove that every such density is strictly positive on \((0,1)\) and integrates to one, thereby establishing that the construction yields a genuine probability distribution. Numerical investigation reveals a characteristic peak–dip–rise shape: a sharp mode lying just below \(e^{-e}\) for all examined heights, followed by a trough and a gradual recovery toward density value~1 at the right endpoint. We then identify the limiting distribution as the height tends to infinity through odd integers.

fields
Statistics Theory
pdf ↗ page arXiv:2611.03895 ↗

Learn-then-Test (LTT) provides a general framework for certifying deployment policies against a prescribed risk target, but its standard formulation targets a fixed population risk estimated from calibration losses. In sequential deployment, losses may instead be dependent and nonstationary, so the risk of a fixed policy can evolve with the observed history. We introduce StreamLTT, which replaces this fixed population risk with average predictable risk, defined by conditioning each decision's loss on the information available before its outcome is revealed. Conditional centering turns empirical deviations from this target into a martingale sum, enabling both a test that adapts to predictable variance and a finite-sample Hoeffding alternative. Combined with family-wise error rate control, StreamLTT yields a simultaneously certified policy region that supports subsequent deployment selection. Across seven forecasting datasets and seven deployment risks, StreamLTT places the certified frontier substantially closer to the prescribed risk target than IID, robust-variance, block-bootstrap, and concentration-based alternatives, while empirical family-wise error closely follows the prescribed level. A finite-sample ablation further shows that the predictable-risk formulation drives the tighter risk frontier, while adaptation to predictable variance makes more effective use of the available family-wise error budget. StreamLTT therefore extends risk-certified policy selection to dependent deployment streams by addressing both what risk should be certified and how it should be tested.

fields
Statistics Theory
pdf ↗ page arXiv:2611.04062 ↗

We establish minimax separation rates across sparsity levels for regression signal detection under $(ε, δ)$-central differential privacy, considering linear regression with an unknown error distribution and generalised linear models (GLMs) with an unknown intercept. Without sparsity restrictions, the separation rates for linear regression and GLMs with binary responses match the private Gaussian mean testing rate up to polylogarithmic factors. For GLMs with more than two possible response outcomes, additional information in the marginal response distribution permits faster detection of sufficiently small signals when the dimension exceeds the sample size $n$. Our upper bounds are based on a reduction to private mean testing, tests of dependence between the response and sparse covariate projections, and a response-only test that is adjusted for the unknown intercept. The resulting procedure adapts to unknown sparsity and matches our lower bounds up to polylogarithmic factors. We also construct polynomial-time tests that attain these rates when $ε\gtrsim n^{-1/2}$, and compare their numerical performance with existing private procedures.

fields
Statistics Theory
pdf ↗ page arXiv:2611.04064 ↗

We study nonparametric estimation and forecasting for GARCH-type processes and propose an iterated neural estimator that alternates between estimating the recursion map and updating the unobserved conditional variances. Under mild conditions, we establish finite-sample bounds for the time-averaged in-sample variance-path error and show that the estimator is minimax rate-optimal up to logarithmic factors. Under stationarity and mixing conditions, we establish the same rate for recursion-map estimation and derive finite-sample bounds for out-of-sample variance forecasts and expected excess Gaussian quasi-likelihood (QLIKE) loss. The convergence rates depend on the true lag orders and remain unchanged when the fitted orders are overspecified. Simulation studies illustrate the effectiveness of our estimators under nonlinear and time-varying volatility dynamics. Real-data applications suggest that our neural methods perform competitively and can incorporate option-price and high-frequency information.

fields
Statistics Theory
pdf ↗ page arXiv:2611.04157 ↗

Model-based Small Area Estimation (SAE) has seen rapid growth over the past 25 years or so due to the rapidly increasing demand for reliable small area estimators of totals, means and more complex area parameters. Direct area-specific estimators are either unreliable (due to small area-specific sample sizes) or not feasible (due to zero area-specific sample sizes). It is therefore necessary to borrow strength from related areas through implicit or explicit models linking related areas. We focus on explicit area-level and unit-level models. After a brief historical sketch of the evolution of SAE, we focus on selective recent developments (mostly after 2015). Developments before 2015 are mostly covered in the comprehensive Wiley book by Rao and Molina (2015). Under a basic area-level model, we consider semi-parametric and robust estimation of small area means under model misspecifications. Under a basic unit level model, methods for estimating complex parameters, such as poverty indicators, will be presented, including robust estimation in the presence of outliers. A comparison of area-level and unit-level models when unit level data are available will also be presented. Estimation methods studied include empirical best linear unbiased prediction (EBLUP), empirical best (EB) and hierarchical Bayes (HB).

comments
15 pages
fields
Statistics Theory
pdf ↗ page arXiv:2611.04281 ↗

The classical model-based optimal design criteria (D-, T-, L-, C-, and A-optimality) are usually motivated via the Cramér–Rao bound as optimizing scalar functions of the Fisher information matrix (FIM). This paper offers a complementary reading in which each criterion appears asymptotically as $N \to \infty$ as the leading-order term of an expected dissimilarity between prior and posterior, with the FIM entering through the Bernstein–von Mises limit. The Kullback–Leibler (KL) divergence of the posterior relative to the prior recovers D-optimality (classically known); a reverse KL of the prior relative to the posterior recovers T-optimality (here defined as maximization of the trace of the FIM, following one common convention) and its weighted-trace generalization; and a first-order approximation of the squared 2-Wasserstein distance recovers L-, C- and A-optimality. The five criteria emerge as instances of a common Bayesian-geometric template, indexed by three choices: the dissimilarity, the prior parametrization, and the approximation scheme used to evaluate it (e.g.\ Taylor expansions of the matrix square root). For the weighted criteria, the Gaussian prior covariance encodes the criterion's weight matrix, so any choice of weights corresponds to a specific prior in the family. The T-, L-, C-, and A-optimality derivations appear novel to the best of my knowledge. A sixth criterion, E-optimality, is recovered not as an independent expected-dissimilarity limit but as a min-max robustification of C-optimality against uncertainty in the modeler's prior direction. The framework is extended to distinguish between a designer's prior over unknown parameters at design time and a modeler's prior used for posterior inference, recovering the classical expected information gain objective as a special case.

fields
Statistics Theory, Information Theory, Optimization and Control, Probability
pdf ↗ page arXiv:2611.04450 ↗

A system contains an unknown number $N$ of units, each failing at an unknown common rate, each unit is removed once it fails. The failure-rate declines as units are removed, but after only a few failures the decline is too slight to distinguish from a constant rate, and the maximum-likelihood estimate of $N$ is infinite with substantial probability. This is a well-known feature of the model, but its probability has not been quantified. We show that about $N^{2/3}$ failures are needed before a finite population can be distinguished from an inexhaustible one, and that at this scale the profile log-likelihood ratio converges to that of a Gaussian shift experiment, in which an infinite estimate occurs with a calculable probability. The exponent is not a property of the model alone. Profiling annihilates the Taylor terms that the nuisance-parameters can reproduce, and detectability is governed by the first surviving term. For example, unknown drift in testing-effort reproduces the linear term, leaving a quadratic survivor and raising the requirement to $N^{4/5}$; in general the critical scale is $N^{2q/(2q+1)}$ for a survivor of order $q$. We obtain the limiting-law of the estimator, the null likelihood ratio distribution, and confidence sets that may be unbounded.

fields
Statistics Theory
pdf ↗ page arXiv:2611.04453 ↗

We propose a new estimator of low-frequency skewness (monthly) that exploits high-frequency data (5 min) through a direct functional mapping consisting of layers of Convolutional Neural Networks followed by Multi Layer Perceptrons. Monte Carlo experiments involving stochastic volatility models, with and without jumps, show that the estimator reduces finite-sample bias relative to existing realized-skewness estimators and remains accurate under model misspecification. Empirically, our estimator exhibits temporal stability and delivers cross-sectional performance in actual skewness-sorted portfolios. We characterize the finite-sample bias of conventional plug-in skewness estimators and establish risk consistency properties of the proposed NN estimator under standard regularity conditions.

comments
This paper first proves that bias exist given a fixed-horizon of high-frequency data to estimate the low-frequency skewness by using the plug-in method. Then it provides an innovation machine learning method to approximate the optimal estimator by fixing a temporal aggregation architecture for neural network before learning
fields
Statistics Theory
pdf ↗ page arXiv:2611.04598 ↗

Distributed statistical learning has recently attracted significant attention owing to its computational efficiency and scalability in large-scale systems. However, the non-smooth quantile loss poses substantial challenges to the development of efficient decentralized algorithms for quantile regression. Existing methods may either suffer from slow convergence or rely on smoothing-based approximations that require additional stringent assumptions, particularly in high-dimensional settings. To address these issues, we propose a decentralized framework that integrates gradient tracking with iterative hard thresholding for sparse quantile estimation. The proposed method avoids smoothing approximations and relaxes the initialization requirement. Theoretically, we show that the proposed algorithm achieves linear convergence under stated regularity conditions and that the resulting estimator attains the same order of statistical accuracy as its centralized counterpart. We further develop a decentralized information criterion for selecting the working sparsity level and establish support screening guarantees. Numerical experiments and a real-data study illustrate the finite-sample performance of the proposed method.

fields
Statistics Theory
pdf ↗ page arXiv:2611.04612 ↗

Complex data are increasingly represented as hypergraphs. We establish bounds for approximating joint vertex-degree distributions by independent multivariate Poisson and correlated normal distributions in hypergraph models with independent hyperedges. We discuss the approximation of the distribution under different density regimes which are further supported by simulation studies.

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

We give an algorithm for PAC learning intersections of $k$ degree-2 polynomial threshold functions over $R^d$ under a Gaussian distribution. Our algorithm achieves classification error $ε$ using $d^{O(k)}2^{O_k(\log^3(1/ε))}$ time and samples, improving over the $d^{O(k^2/ε^2)}$ running time of the polynomial regression approach. To our knowledge, our result is the first to obtain a dimension exponent independent of the accuracy parameter, even for $k=2$. We complement our algorithmic result with an SQ lower bound showing that the complexity dependence of $d^{Ω(k)}$ is unavoidable. Lifting the input to polynomial features turns the target into an intersection of $k$ halfspaces. This suggests using the first two labeled moments for subspace recovery. In the lifted space, however, these moments can reveal nothing. Our starting point is a Gaussian comparison theorem showing that, for sufficiently regular defining quadratics, the labeled moments needed for subspace recovery are approximately preserved. To handle arbitrary defining quadratics, we establish a new structural result showing that every direction with significant resampling influence can be detected through degree-$O(k)$ moments. These results yield an initial $d^{O(k)}2^{\mathrm{poly}_k(1/ε)}$-time learner using adaptive restrictions. To improve the exponential dependence on $1/ε$, we develop a two-stage dimension-reduction approach that avoids the costly adaptive partitioning. After identifying a subspace containing all directions with large influence, we use generalized regularity and Gaussian comparison to recover the remaining relevant quadratic features through a new derivative-based moment operator. The recovered features support an intersection close to the target. Combining them with robust hinge-loss minimization gives our quasipolynomial-time learner.

fields
Statistics Theory
pdf ↗ page arXiv:2611.05114 ↗

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 ↗

Conformal prediction gives finite-sample coverage when calibration and test points are exchangeable, but exchangeability can fail when deployment changes the data distribution. We study conformal prediction in performative settings, where the deployed predictor affects the data distribution, and seek prediction sets valid at performative equilibrium: coverage must hold under $D(f^\star)$ for a performatively stable predictor $f^\star$. Under total-variation $L$-sensitivity of the distribution map, we prove a phase transition at $L=1$. If $L \ge 1$, no finite-sample procedure can uniformly guarantee both equilibrium-valid coverage and nontrivial prediction sets. If $L<1$, the minimax excess miscoverage over informative procedures is $\widetildeΩ(1/((1-L)\sqrt{n}))$, implying a sample-complexity inflation of order $1/(1-L)^2$ for fixed excess miscoverage. Our main technical tool is a transfer theorem: any procedure returning a predictor within $\varepsilon$ of equilibrium yields equilibrium-valid coverage up to an additive $L\varepsilon$ term after split-conformal calibration. We instantiate the theorem with two retraining algorithms: a model-free method for discretizable classes and a parametric tail-averaged method that matches the $n$- and $L$-dependence of this rate up to logarithmic factors. Experiments, including semi-synthetic credit scoring, demonstrate the predicted threshold behavior and scaling laws.

comments
45 pages, including supplementary material
fields
Statistics Theory
pdf ↗ page arXiv:2611.05277 ↗

Geometric Topology14

Let $λ_L \approx 1.17628$ be Lehmer's number. We prove that no pseudo-Anosov homeomorphism of a closed orientable surface of genus six with orientable invariant foliations has stretch factor $λ_L$. This gives a negative answer to a question of Lanneau and Thiffeault on the minimal stretch factor in even genus. As a consequence, the minimal stretch factor $δ_6^{+}$ of such maps is the largest root of $x^{12}-x^{9}-x^{7}+x^{6}-x^{5}-x^{3}+1$, approximately $1.20189$. The proof combines the Lefschetz method of Lanneau and Thiffeault, the standardly embedded train tracks of Hironaka and Tsang, an elementary analysis of the transition digraph, and an obstruction from periodic conjugacy classes in the fundamental group.

comments
22 pages, 10 figures. Code at https://github.com/Lizi-Guo/lehmer-genus6
fields
Geometric Topology, Dynamical Systems
pdf ↗ page arXiv:2611.01350 ↗

The ensemble average of Narain conformal field theories over their moduli space is a real-analytic Eisenstein series, whose Poincaré expansion can be interpreted as a sum over lens spaces weighted by the partition functions of Abelian Chern-Simons theory. In this paper we extend this correspondence from lens spaces to Seifert manifolds, which gives an example of a restricted sum over topologies of the kind that arises in three-dimensional quantum gravity. A Seifert manifold is obtained from a fixed core, a punctured surface times a circle, by gluing solid tori to its boundary tori, and we place a copy of the Narain theory on each of these tori. The ensemble average supplies the sum over the solid tori, or more precisely over marked presentations with fixed base genus, number of fibers and integer Seifert invariant. The resulting sum converges absolutely and is a polynomial in the components of the vector-valued Eisenstein series. When all the boundary tori share a single modulus, the average acquires connected corrections, which we identify with wormholes gluing the core to itself; for two boundary tori, the terms with rational Lagrangian sublattices of the Siegel-Eisenstein series are realized by wormholes containing an exceptional fiber. After reduction along the fiber, the construction closely parallels the two-dimensional topological gravity of Marolf and Maxfield, with the base of the fibration playing the role of their spacetime. We also discuss Dehn fillings of 3-manifolds with torus boundary, non-orientable bases, and the surgery formula. Our results suggest that modularity could be an organizing principle in the summation of geometries in quantum gravity.

comments
48 pages, 4 figures
fields
Geometric Topology, Number Theory
pdf ↗ page arXiv:2611.02515 ↗

We give a combinatorial description of the Heegaard–Floer link-cobordism maps associated with pointed triple grid diagrams in the complement of three $4$-balls in complex projective plane with reverse orientation. Every contributing index-zero holomorphic triangle decomposes into Euclidean triangular sheets. We characterize the compatible collections of sheets that contribute by an explicit geometric separation criterion, expressed as a lattice-point test, and prove that each has mod-\(2\) count one. Individual sheets may wrap around the torus in the unblocked theory, whereas they are embedded in the blocked theory. In each fixed \(\SpinC\) structure, the map is determined by a finite enumeration. A difference number computed from the triangular regions determines the \(\SpinC\) structure of a Whitney triangle. Together with the topology of the associated surface, this gives an explicit formula for the absolute bigrading of each summand of the cobordism map. After basepoint reduction, the formula determines the Laurent monomial representing any nonzero map on the rank-one torsion-free two-variable knot Floer modules, yielding vanishing and ideal-containment criteria. We apply the construction to an affine family of grid links \(K(n;p,s)\), obtaining explicit cobordisms involving infinite families of torus knots and links, together with closed formulas for the bigradings of their distinguished grid states.

fields
Geometric Topology
pdf ↗ page arXiv:2611.03714 ↗

We study the Farrell–Jones conjecture for graph products of pairs and for fundamental groups of polyhedral products. We introduce a pair-deletion decomposition and a local notion of FJ-admissibility, and prove a vertexwise combination theorem for graph products of pairs. The criterion applies, in particular, to ordinary graph products, free-factor pairs, suitable normal pairs, and classes controlled by acylindrical Bass–Serre actions. For polyhedral products, we combine these results with their description by relative graph products and graph products of pairs. We also obtain bounds and exact computations for amenable category, together with applications to simplicial volume and Borel rigidity of closed aspherical polyhedral-product manifolds.

comments
39 pages
fields
Geometric Topology, Algebraic Topology
pdf ↗ page arXiv:2611.03847 ↗

We present discrete, faithful and purely loxodromic representations of a closed surface group of genus 431, and of a free group, into the group of isometries of a finite-dimensional real-hyperbolic space for which no Cannon–Thurston map exists. The construction combines three ingredients: the small-cancellation strategy employed by Baker–Riley to construct a subgroup of an ambient hyperbolic group with no Cannon–Thurston map, the realization of these groups by octagon complexes, and a theorem of Desgroseilliers–Haglund that supplies a convex cocompact faithful representation of the ambient hyperbolic group on a real-hyperbolic space. These examples admit ray Cannon–Thurston maps, as defined by Halder, Mahan Mj and Sardar.

comments
26 pages, 8 figures. Comments are welcome!
fields
Geometric Topology, Group Theory
pdf ↗ page arXiv:2611.03855 ↗

The geometric dimension of a nonempty compact PL manifold $N$ is the smallest nonnegative integer $d$ for which $N$ admits a handle decomposition with all handles of index at most $d$. A PL filling of a compact PL manifold is a decomposition into compact codimension $0$ PL submanifolds, called sectors, with pairwise disjoint interiors and intersections described by standard local models. We advance Singhof's program of simplifying the sectors of a filling and their intersections. Specifically, for integers $m, \ell\ge 1$ and nonnegative integers $a_1\le\cdots\le a_\ell$, we prove that every closed PL $m$-manifold admits a filling into $\ell$ sectors whose nonempty $r$-fold intersections have geometric dimension at most $a_r$ for each $1\le r\le \ell$ if and only if \[ a_{λ_1}+\cdots+a_{λ_q}\ge m-\ell+1 \] for every partition $λ_1+\cdots+λ_q=\ell$ into positive integers. Under the same inequalities, any prescribed $\ell$-sector filling of the boundary of a compact PL $m$-manifold extends to a filling with the corresponding relative handle index bounds. Necessity follows from the cup-product obstructions of Courte, Moussard, Ren, and Zhou. To prove sufficiency, we develop compatible handle trades that simplify intersections in increasing order of depth. For nondecreasing tuples of nonnegative integers, our theorem resolves the PL classification problem posed by Courte, Moussard, Ren, and Zhou. In particular, we obtain the bound $(2,2,4)$ for $3$-sector fillings in dimension $6$ and improve the $5$-sector bound $(1,2,3,3,4)$ of Rubinstein and Tillmann to $(1,2,2,3,4)$ in dimension $8$.

comments
29 pages
fields
Geometric Topology
pdf ↗ page arXiv:2611.04095 ↗

We compare linking-form bounds with the smooth and locally flat nonorientable 4-genera of low-crossing knots. For every prime knot with at most 13 crossings whose Witt-level linking-form bound is at least 2, this bound equals both genera. We also exhibit 41 prime knots with 12 or 13 crossings that bound locally flat Möbius bands but no smooth ones, and whose smooth nonorientable 4-genus is 2. Our methods combine linking forms, Heegaard Floer correction terms and definite-lattice obstructions with explicit band constructions. They determine 3,300 of the 3,525 values left unknown in KnotInfo on 2 November 2026; the remaining 225 knots have range $[1,2]$. We obtain new lower bounds of 2 for 2,102 knots with 14 crossings and correct previously reported values for three knots with 11 crossings.

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

For closed 4-manifolds $X_1, X_2$, we give a sufficient condition, in terms of the Seiberg-Witten invariants of $X_i$, for the Dehn twist on $X_1\#X_2$ along the neck to be smoothly nontrivial. This provides a broad generalization of the result of Kronheimer-Mrowka for $K3\#K3$. We also show that the boundary Dehn twists on the punctured connected sums of many pairs of elliptic surfaces are smoothly nontrivial. We also detect new examples of exotic Dehn twists along Seifert fibered 3-manifolds in elliptic surfaces. As a consequence, we exhibit a new phenomenon in which "exotic diffeomorphisms detect exotic smooth structures on 4-manifolds": the triviality of the boundary Dehn twist characterizes the standard nucleus $N(n)$ among the nuclei $N(n)_{p,q}$ homeomorphic to it, provided that $n\equiv0 \bmod 4$. These results are proved by computing the families Bauer-Furuta invariant for a new framing of the families Dirac index.

comments
30 pages
fields
Geometric Topology, Differential Geometry
pdf ↗ page arXiv:2611.04541 ↗

We define a Morse homology of the foliation which is defined by a general nonsingular Morse-Smale flow, applying the framework of the Conley index theory. In fact, we define a chain and a boundary homomorphism, therefore, a cochain and a cohomology are obtained as well. Furthermore, we prove a duality theorem on the homology and the cohomology.

comments
29 pages, no figures
fields
Geometric Topology
pdf ↗ page arXiv:2611.04560 ↗

We prove that a knot $K \subset S^3$ is the unknot if and only if the $\mathbb{Z}/2$-equivariant Seiberg–Witten Floer cohomology of the double cover branched along the $(2, 1)$-cable of $K$ has no $\mathbb{F}_2[Q]$-torsion. The proof combines the Thom–Gysin exact sequence, the Montesinos trick, and the genus bound for $L$-space surgeries.

comments
5 pages
fields
Geometric Topology
pdf ↗ page arXiv:2611.04823 ↗

A theorem from Wolpert bounds the Weil–Petersson distance from a hyperbolic surface to a maximally noded surface in terms of the lengths of the underlying pants decomposition. We prove analogues for punctured surfaces both in terms of the lambda-lengths and in terms of the shearing coordinates of an ideal triangulation.

comments
28 pages, 8 Figures
fields
Geometric Topology
pdf ↗ page arXiv:2611.05045 ↗

Let X be a closed oriented surface of genus at least 2 and P a finite subset of X. We bound the action of the mapping class group of (X,P) on the rational cohomology groups of the ordered configuration spaces F_n(X-P) of X-P. In particular, we show that, when #P < 2, the diagonal action of the mapping class group on the direct sum of the H^n(F_n(X-P)) is faithful, and determine its kernel when #P > 1.

comments
57 pages
fields
Geometric Topology, Algebraic Geometry
pdf ↗ page arXiv:2611.05126 ↗

This paper studies a subgroup of the mapping class group of an elliptically fibered $4$-manifold $π: M\to B$, inspired by number theory. The smooth Mordell-Weil group $\mathrm{MW}(π)$ is the group of isotopy classes of smooth sections of $π$. We construct a smooth analog of the Shioda-Tate isomorphism, identifying $\mathrm{MW(π)}$ with the quotient of $H^2(M;\mathbb{Z})$ by the trivial lattice of $π$. This shows that $\mathrm{MW}(π)$ can be computed explicitly from $H^2(M;\mathbb{Z})$. As an application, we show that the natural inclusion of the holomorphic Mordell-Weil group into the smooth one is an isomorphism if and only if $M$ is a rational elliptic surface. As another application, we show that $\mathrm{MW}(π)$ satisfies a strong version of Nielsen realization: any torsion element of $\mathrm{MW}(π)$ is represented by a holomorphic translation of $M$ of the same order.

comments
28 pages, 9 figures, 2 tables
fields
Geometric Topology
pdf ↗ page arXiv:2611.05177 ↗

We introduce a version of convex surface theory for immersed ribbon surfaces with Legendrian boundary. As an application, we establish a special case of K3: Problem 1.70 on sharpness in the slice-Bennequin inequality implying quasipositivity, and a special case of a conjecture of Cornwell, Ng, and Sivek on characterizing Lagrangian sliceness. Specifically, we prove that if $K$ is a knot that bounds a "star-shaped" ribbon disk and satisfies $\overline{\mathrm{sl}}(K) = -1$ (resp.\ $\overline{\mathrm{tb}}(K) = -1$), then $K$ is quasipositive (resp.\ Lagrangian slice). In fact, we prove these statements for any fixed transverse (resp.\ Legendrian) representative.

comments
33 pages + references, 36 figures. Comments welcome!
fields
Geometric Topology, Symplectic Geometry
pdf ↗ page arXiv:2611.05331 ↗

Dynamical Systems12

A naturalization, in the sense of Deprit, of Vinti's dynamical system makes the construction of a first order analytical satellite perturbation solution without critical divisors possible. The process gives hints on how to recast Brouwer's classical solution in a form that is free from small divisors too. The functionality of classical perturbation solutions is in this way extended to the close vicinity of the critical inclination. The new analytical solution bears terms that may grow unbounded, but their negative effects do not disclose in time intervals in which this kind of solution may be useful in practice.

comments
31 pages, 7 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.03701 ↗

We investigate connections between operator spectra, complex dynamics, and determinants for wreath product groups. For a nontrivial finite abelian group $G$, the natural action of $G\wr\mathbb Z$ on a rooted tree produces a family of operators with a recursive structure. Applying Schur complements to this family yields a rational map on complex projective space. We determine the projective spectrum–the parameter values for which the operator pencil fails to be invertible–as the union of the Julia set of this map and an explicitly described subset of its Fatou set. We also prove that the associated Koopman representation and the left regular representation are weakly equivalent and therefore give the same projective spectrum. We then compute Fuglede–Kadison determinants for a family of operators on more general wreath products. These formulas yield injective operators with zero determinant for wreath products $K\wr\mathbb Z$, where $K$ is a discrete group admitting a nontrivial projection $e\in\mathbb C[K]$. This answers negatively a question of Li and Thom about whether injectivity implies positive determinant for operators defined by matrices over complex group rings of amenable groups. For $G_{tf}\rtimes_σ\mathbb Z$, where $G_{tf}$ is any countable torsion-free abelian group and $σ\in\operatorname{Aut}(G_{tf})$, we prove that injectivity does imply positive determinant in every matrix size.

comments
42 pages, 4 figures
fields
Dynamical Systems, Operator Algebras
pdf ↗ page arXiv:2611.03711 ↗

Our main objective in this paper is to prove a large deviation result for the distribution of preimages of a point under the iteration of a holomorphic correspondence with respect to the unique equilibrium state associated to a Hölder continuous potential defined on the support of the Dinh-Sibony measure of the correspondence. As a consequence, we obtain a convergence result which generalises the result on equidistribution of preimages by Dinh and Sibony. We also study a situation where the Dinh-Sibony measure happens to be the unique measure of maximal entropy for an appropriate holomorphic correspondence and also record some comments that connect this work with some recent works in the literature.

comments
19 pages. Comments are welcome!
fields
Dynamical Systems
pdf ↗ page arXiv:2611.03745 ↗

We prove that if the entropy of generating forbidden words of a subshift over a finite alphabet is strictly smaller than its topological entropy, then the subshift has only finitely many ergodic measures of maximal entropy, each of which is Bernoulli up to a finite period, and admits a characteristic measure of maximal entropy. In particular, these conclusions hold when the entropy of minimal forbidden words is strictly smaller than the topological entropy, giving a negative answer to a question of Buzzi.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.03758 ↗

We study the dependence of canonical invariant probability measures of suspension semiflows on simultaneous perturbations of the invariant base density and the roof function. We compare two natural representations of the suspension measure: physical-height coordinates, in which the support depends on the roof function, and normalised-height coordinates, in which all measures are defined on a fixed cylinder. In physical-height coordinates, we obtain an exact fibrewise formula for the $L^1$ discrepancy between suspension densities and derive quantitative total-variation estimates. In normalised-height coordinates, we establish corresponding stability estimates through the product of the base density and the roof function. These results transfer quantitative statistical-stability estimates for the base densities to the associated suspension measures. For one-parameter families whose base densities are differentiable in $L^1$ and whose roof functions are differentiable in $L^\infty$, we derive an $L^1$ linear-response formula on the fixed cylinder and a bounded-Lipschitz first-variation formula in physical height. The latter contains a signed measure supported on the graph of the unperturbed roof. We further compute the exact first-order total-variation speed and prove that total-variation differentiability holds if and only if the first-order roof velocity vanishes almost everywhere with respect to the unperturbed fibre density. The results are measure-theoretic and do not require spectral or mixing assumptions on the suspension semiflow.

comments
19 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2611.03863 ↗

Although non-dimensionalisation is a fundamental step in modelling, it is rarely obvious, especially for large dynamical systems, how to systematically construct optimal non-dimensionalisations. In this work, we develop a general mathematical framework for non-dimensionalising polynomial ODEs by interpreting them as chemical reaction networks (CRNs) and characterise the space of admissible scalings. Within this viewpoint, admissible scalings of time and species are encoded by Laurent monomials, and we derive exact formulae for the minimal number of multiplicative dimensionless parameters required by the reaction-channel coefficients and by the full initial value problem, together with characterisations of the scale assignments that attain structural lower bounds. These counts are expressed in terms of structural properties of the underlying CRN, and we show that the full initial value problem requires no more parameters than the corresponding Buckingham count. These results lead to constructive algorithms which we analyse rigorously and implement in the open-source Python package CRNNondim, available at https://github.com/georgio-hawi/crnnondim . Given a polynomial system or CRN, CRNNondim determines species and time scalings that bring variables as close to unity as possible while minimising the number of free parameters, and among the admissible scalings it chooses free parameters that result in the corresponding dimensionless system being sparse and simple. We apply CRNNondim to numerous well-known biological and biochemical models, yielding simpler dimensionless systems with fewer free parameters, and interpreting the parameters that govern their dynamics.

comments
37 pages of main text, 36 pages of supporting information, and accompanying code at https://github.com/georgio-hawi/crnnondim
fields
Dynamical Systems, Rings and Algebras
pdf ↗ page arXiv:2611.04127 ↗

We describe an algorithm that, given a postcritically finite quadratic polynomial, outputs a finite state machine whose regular language is the set of external arguments for all points on the Hubbard tree, generalizing an example of Milnor. We do this by extracting orbit portraits from angled internal addresses, and constructing a suitable Markov partition of angle intervals. A main application is computing direct ray connections between Hubbard trees in matings of quadratic polynomials. We use this to understand ray connections in quadratic matings along veins of the Mandelbrot set, and prove that first ray connections between Hubbard trees are picked up at parabolic parameters or tips of veins.

comments
62 pages, 6 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.04190 ↗

In this paper we consider cycles of singular algebraic foliations on the real projective plane. Our first result shows that there exists a limit cycle of singular algebraic foliations such that the limit cycle cannot be realized in any affine chart, that is, it fails to appear in any affine plane via the usual dehomogenization. On the other hand, under an appropriate convexity assumption, we verify that a cycle becomes fully visible, lying entirely in some affine chart. We then analyze the accumulation behavior of limit cycles of singular algebraic foliations on the real projective plane. Last we prove that algebraic foliations of degree at most two on the real projective plane have only finitely many limit cycles, and the maximum number of limit cycle is zero, one and at least six for algebraic foliations of degree zero, one and two on the real projective plane, respectively. This result extends Bamon's finiteness theorem for quadratic affine vector fields in [Publ. Math. IHÉS, (64)1986, pp. 111–142].

fields
Dynamical Systems, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.04245 ↗

We investigate conditions and obstructions for the existence of ergodic full measures in the context of countable observables on compact spaces. Extending the theory in a unified way, we are able to show a complete picture via thermodynamic formalism for symbolic, uniformly hyperbolic and related systems. We prove conditional variational principles for the topological entropy, showing good approximations by ergodic full measures, and we give conditions where we precisely get ergodic full measures. In contrast with the case with a finite number of observables, new phenomena appear: we exhibit explicit examples of level sets with a null measure with respect to any invariant measure but having large entropy. On the other hand, based on induced ergodic systems in the sense of Kakutani-Rokhlin and heavily utilizing the formalism for countable Markov shifts, we go beyond the classical thermodynamic approach and show a different way of building ergodic full measures. Additionally, we study the regularity and shape of the entropy spectrum and, in the end, we also give some applications of the main conditional variational principles.

comments
34 pages, 2 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.04404 ↗

In this paper, we consider a planar system of nonlinear delay differential equations and prove the existence of the star-shaped periodic solutions conjectured by Hara (Nonlinear Analysis: Theory, Methods \& Applications, 30:4555–4563 (1997)) for seven parameter values. These solutions cannot be obtained by a direct application of the standard Fourier spectral method, since the corresponding linearized operator is degenerate. From numerical observations of the Fourier coefficients, we derive an ansatz that writes a star-shaped periodic solution as a periodic profile in a rotating frame. Restricting the profile to real Fourier coefficients, we show that the resonance between the delay and the period of the profile fixes the rotation frequency exactly. We then validate a zero of the resulting real system with the radii polynomial approach and interval arithmetic, with bounds that cover all Fourier modes. For each parameter value, we also determine the fundamental period and the winding number of the solution.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.04530 ↗

This paper is the second in a series about (relatively) free profinite semigroups and S-adic representations of minimal shifts. The first installment introduced the key notions of profinite images and saturating properties. The present paper examines the relationship between relative invertibility conditions (on a directive sequence) and charging properties (of a shift). The main result shows that the two properties are equivalent under mild conditions. Moreover, charging properties are shown to be equivalent to density of subgroups generated by return words in relatively free profinite groups. The main result can then be used to deduce purely discrete statements about subgroups generated by return words in relatively free groups. We also highlight applications of the main result to the study of maximal bifix decoding, following earlier work by the second author. Finally, we establish some results on the effect of direct images on charging properties and explain how to apply these results to the case of episturmian shifts.

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

The basic reproductive number, $\mathcal{R}_0$, is widely used to determine whether an infectious disease can persist in a population. However, its interpretation may become unclear when the underlying disease-free demographic dynamics exhibit multiple types of stable attractors. In this study, we investigate how demographic bistability between fixed points and periodic cycles affects the calculation and interpretation of $\mathcal{R}_0$. We consider two discrete-time host-parasite models with infection: a tick-host model motivated by Borrelia burgdorferi transmission and a Nicholson-Bailey host-parasitoid model with intraspecific competition and infection. For each model, we calculate reproductive numbers associated with different disease-free attractors using the next-generation operator method and compare their invasion thresholds. In the tick-host model, the reproduction number calculated on the stable demographic cycle differs from that calculated at the positive coexistence fixed point, resulting in parameter regions where infection can invade at one demographic attractor but not the other. In contrast, in the host-parasitoid model, the host-driven invasion threshold is necessarily the same at the positive coexistence fixed point and on the host-only periodic cycles. These contrasting results demonstrate that demographic bistability alone does not necessarily produce attractor-dependent invasion thresholds. Rather, the effect of demographic dynamics on invasion depends on the structure of pathogen transmission. In particular, a complete host–vector–host transmission pathway can allow differences between demographic attractors to alter the invasion threshold. Our results emphasize the importance of considering both demographic dynamics and transmission structure when interpreting $\mathcal{R}_0$ in populations with multiple stable disease-free states.

comments
70 pages, 6 tables, 3 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2611.04990 ↗

Functional Analysis12

We extend Brown's one-variable rigidity theorem to strictly convex functions of two variables under a regularity assumption. Let $K\subset\mathbb{R}^2$ be nonempty, compact, and convex, and let $f$ be real-valued, strictly convex on $K$, and of class $C^2$ on a neighbourhood of $K$. We prove that the generating set $\{x_1,x_2,f\}$ is hyperrigid in $C(K)$.

comments
This is a preliminary version
fields
Functional Analysis, Metric Geometry, Operator Algebras
pdf ↗ page arXiv:2611.03716 ↗

We characterize bounded small Hankel operators from $B_p(\om)$ to $\overline{B_q(\om)}$ on the polydisc for $0<p,q<\infty$, under explicit conditions relating the kernel parameter to the weight. When $q<p$, boundedness is equivalent to a weighted Besov condition on the symbol; when $p\le q$, it is equivalent to a weighted supremum condition on a shifted radial derivative. In particular, the diagonal case is characterized by the product Bloch space. The proof combines weighted Bergman duality and atomic factorization with local kernel estimates and randomized atomic tests.

fields
Functional Analysis
pdf ↗ page arXiv:2611.03901 ↗

By a theorem of Bagchi, the Riemann Hypothesis (RH) holds if and only if $E(s) = 1/s$ belongs to the closed linear span of $G_k(s) = (k^{-s} - k^{-1})ζ(s)/s$, $k \geq 2$, in the Hardy space $H^2(\mathbb{C}_{1/2})$, where $\mathbb{C}_α$ is the half-plane $\mathrm{Re}(s) > α$. The formal Möbius expansion $E = \sum_{k \geq 2} μ(k) G_k$ diverges on the critical line, by a theorem of Báez-Duarte. We study it in the scale of spaces $H^2(\mathbb{C}_α)$, where its convergence forces $ζ$ to be zero-free in $\mathbb{C}_α$. We prove that the partial sums $S_n$ converge to $E$ in $H^2(\mathbb{C}_α)$ for every $α> 1$, and that a single zero of $ζ$ in $\mathbb{C}_α$ keeps the best-approximation error $d_n(α)^2$ uniformly away from zero. We express the Möbius error $s_n(α) = \|S_n - E\|^2_α$ as a series with elementary terms, free of $ζ$, and compute it for $n \leq 10^6$: $s_n(1/2)$ oscillates without decaying, whereas for $α> 1/2$ it decays at a rate close to $n^{1-2α}$, much faster than the bound known under RH. On the critical line, $d_n(1/2)^2$ behaves like $0.046/\log n$ for $100 \leq n \leq 5120$, in agreement with earlier computations by Báez-Duarte, Balazard, Landreau and Saias.

fields
Functional Analysis
pdf ↗ page arXiv:2611.03924 ↗

Let $H$ be a complex Hilbert space. We prove that the class of pseudo-Fredholm operators on $H$ is a regularity in the sense of Kordula and Müller. We also prove that the classes of left and right generalized Drazin invertible operators are regularities on $H$. Consequently, the generalized Kato spectrum and the corresponding generalized Drazin spectra satisfy the spectral mapping theorem. We construct an operator $T$ on a separable complex Banach space such that $T^2$ is right generalized Drazin invertible whereas $T$ is not pseudo-Fredholm. In particular, the power axiom need not hold for pseudo-Fredholm operators on Banach spaces. Finally, we show that the accumulation sets of the approximate point and surjectivity spectra define regularities on Banach spaces, yielding another proof of the regularity of generalized Drazin invertible operators in $\B(X)$.

fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2611.04004 ↗

The upper bild of the quaternionic numerical range provides a convex representative of the generally nonconvex quaternionic numerical range. Although its convexity is known, the geometry of the upper bild is difficult to describe explicitly, even for 2-by-2 quaternionic matrices. In this paper, we revisit the upper bild of quaternionic numerical ranges from both algebraic and geometric viewpoints. We first point out gaps in Kumar's proof. We then investigate several special classes of 2-by-2 quaternionic matrices and describe their shapes and boundary structures in the closed upper complex half-plane directly in terms of the standard eigenvalues and the off-diagonal entry of the Schur form. For the general 2-by-2 case, we use a different canonical form. Following So and Thompson, we prove the concavity of the upper-boundary function through the associated complex representation. For the lower boundary, we obtain a distance-to-a-disk representation and use convex optimization to prove its convexity. We also treat the degenerate cases. Together with the connectedness of the vertical sections, these results give an alternative proof of the convexity of the upper bild for arbitrary quaternionic matrices.

fields
Functional Analysis
pdf ↗ page arXiv:2611.04044 ↗

We study subspaces of two-Lipschitz mappings using group actions and tensor preduals. We first show that the ambient spaces contain large classical sequence spaces. We then use similarity actions to select smaller subspaces. Character-equivariant mappings form weak$^*$-closed fixed-point spaces and admit quotient tensor preduals. We give two applications. For mappings on Banach spaces, we describe positive homogeneity in each variable and construct bounded projections. For mappings on finitely generated groups, we characterize harmonicity in each variable. We show that the harmonic predual is the projective tensor product of the corresponding one-variable quotient preduals.

comments
Any kinds of suggestions and comments are most welcome
fields
Functional Analysis
pdf ↗ page arXiv:2611.04562 ↗

We study $\mathcal{F}$-hypercyclicity of weighted orbits $λ_nT^nx$ for continuous linear operators $T$ on complex F-spaces, where $\mathcal{F}$ is a Furstenberg family with the cut–shift–and–paste (CuSP) property. We characterize the scalar sequences for which weighted hypercyclicity always implies ordinary hypercyclicity: their nonzero values must be bounded and bounded away from zero. The same condition removes weights for every such family. For the converse inclusion, we prove that a bounded scalar sequence preserves all $\mathcal{F}$-hypercyclic vectors if its backward-shift $ω$-limit system is distal and does not contain the zero sequence. For chaotic operators, minimality of this system suffices. In particular, every complex nilsequence which is not identically zero preserves $\mathcal{F}$-hypercyclicity, and equality holds when its nonzero values are bounded away from zero. We also obtain simultaneous weighted return results and stability under unimodular weights with asymptotically trivial multiplicative differences.

comments
23 pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.04629 ↗

The aim of this paper is to characterize the Fourier transform of functions taking values in a separable Hilbert space $\Hi$ and defined on locally compact abelian groups. Inspired by Krukowskis characterization of integral transforms on locally compact abelian groups, we establish characterizations of the Fourier, Laplace, and cosine transforms for separable Hilbert space-valued functions on locally compact abelian groups. Furthermore, we obtain a characterization of the group Fourier transform on the Heisenberg group.

comments
22 Pages
fields
Functional Analysis
pdf ↗ page arXiv:2611.04698 ↗

We use real-analytic functional calculus to show that the envelope of the algebra of $m$-variable polynomials with real coefficients, with respect to the class of strictly real Banach algebras, is isomorphic to the algebra of real-valued analytic functions on $\mathbb{R}^m$.

fields
Functional Analysis
pdf ↗ page arXiv:2611.04758 ↗

Let $α\in\mathbb R$, $0<p<\infty$, $0<q,r\le\infty$, and $W$ be a matrix $\mathcal A_p$ weight on ${\mathbb R}^n$. We introduce the matrix-weighted $Z$-spaces $Z^{p,q,r}_α(W)$ and tent spaces $T^{p,q,r}_α(W)$ on the upper half-space and establish their characterizations using reducing operators. We then characterize homogeneous matrix-weighted Besov and Triebel–Lizorkin spaces in terms of the corresponding $Z$-spaces and tent spaces, respectively, using Schwartz kernels satisfying Tauberian and finite moment conditions. Furthermore, we establish duality for the matrix-weighted $Z$-spaces and tent spaces and obtain real and complex interpolation results for these spaces and the associated homogeneous matrix-weighted Besov and Triebel–Lizorkin spaces.

comments
46 pages, 0 figure
fields
Functional Analysis, Classical Analysis and ODEs
pdf ↗ page arXiv:2611.04810 ↗

We investigate explicit and implicit dissipative Hamiltonian representations of generators of strongly continuous semigroups on real or complex Hilbert spaces. For a prescribed positive definite selfadjoint energy operator $H$ satisfying $\operatorname{dom}(A)\subset\operatorname{dom}(H)$, we show that the Lyapunov dissipation inequality is equivalent to an exact factorization $A=DH$, where $D$ can be chosen maximally dissipative. For bounded $H$, the criterion also yields an implicit representation. We further study energy constructions based on closed intertwiners and output trajectories, distinguishing contractive energy-space dynamics from operator factorizations on the original state space. Examples illustrate the roles of noncoercivity, unboundedness, and domain compatibility.

fields
Functional Analysis
pdf ↗ page arXiv:2611.05063 ↗

We prove two sufficient conditions for the frame property of Gabor systems $\mathcal{G}(g,a,b)=\{e^{2πi mb\,\cdot}g(\cdot-ak):k,m\in\mathbb{Z} \}$ generated by polynomial–Gaussian windows $g(t)=P(t)e^{-ct^2}$, where $c>0$ and $P$ is a nonzero complex polynomial of degree $n$. The conditions depend only on the product $ab$ of the lattice parameters and the degree of $P$. First, $\mathcal{G}(g,a,b)$ is a frame whenever $ab<1$ is irrational. Second, if $ab=p/q<1$, with $p,q\in\mathbb{N}$ coprime, then $\mathcal{G}(g,a,b)$ is a frame whenever $q-p>n$. Consequently, in the region $ab<1$, failure of the frame property can occur only on rational hyperbolas whose reduced denominator and numerator differ by at most $n$. The proof extends the translated-Wronskian method of Faulhuber and Petersen [\emph{The frame set of the first Hermite function}, arXiv:2609.02610] from the first Hermite function to arbitrary polynomial multiples of a Gaussian, combining a multiplicity estimate for Wronskians with Jensen's formula.

fields
Functional Analysis
pdf ↗ page arXiv:2611.05337 ↗

Representation Theory12

Let $Q$ be a finite quiver and let $Λ$ be the complete path algebra of $Q$ with respect to the arrow ideal. We study the mutation of silting objects in the bounded homotopy category of projective $Λ$-modules and characterise in which cases the mutation theories of silting complexes and 2-term silting complexes of $Λ$ are determined by those of a finite dimensional quotient $Λ/I$. This characterisation is closely related to a characterisation of 2-term silting finite quotient algebras.

comments
11 pages, comments welcome
fields
Representation Theory
pdf ↗ page arXiv:2611.03890 ↗

Let $\La_1$ and $\La_2$ be finite-dimensional $\ta_2$-finite complex algebras of global dimension at most two. We prove that, if they are cluster equivalent, then they admit $\bbZ$-gradings for which the bounded derived categories of graded modules are triangle equivalent. The equivalence is not required to commute with the internal grading shifts. The proof uses common multigraded dg models, relative gradings on two-term silting objects, and covering quotients. We also consider tilting lifts of cluster-tilting objects with endomorphism algebras of global dimension at most two. In acyclic cluster type, the existence of such a lift for every cluster-tilting object implies piecewise heredity. We construct a counterexample without this assumption using a surface algebra associated with a one-holed torus.

comments
All comments are welcome!
fields
Representation Theory, Category Theory
pdf ↗ page arXiv:2611.04328 ↗

Let $K/\mathbb{Q}_p$ be a finite extension of degree $n$ with $p\geq3$, and let $D$ be the non-split quaternion algebra over $K$. We prove that every infinite-dimensional admissible smooth representation of $\mathrm{GL}_2(K)$ or $D^\times$ with a central character and satisfying a Casimir annihilation condition has Gelfand–Kirillov dimension $n$. As a corollary, every infinite-dimensional admissible Banach representation whose locally analytic vectors have an infinitesimal character has dimension $n$, strengthening Sorgdrager's bound to an equality. An appendix by Yongquan Hu proves that, when $K\ne\mathbb{Q}_p$ and the coefficient field is algebraically closed, the canonical diagram of an admissible supersingular representation satisfying the same Casimir annihilation condition is $(π,π,\mathrm{id})$, as in the case of local fields of characteristic $p$.

comments
Appendix by Yongquan Hu
fields
Representation Theory
pdf ↗ page arXiv:2611.04350 ↗

We investigate the structure of locally analytic representations of $p$-adic groups, and establish a sufficient condition for the irreducibility of locally analytic vectors in certain Banach representations of $D^\times$, where $D$ is the quaternion division algebra over $\mathbb{Q}_p$. As an application, we prove that $\mathrm{JL}(ρ)^{\mathrm{an}}/\mathrm{JL}(ρ)^{1\text{-}\mathrm{alg}}$ is a topologically irreducible locally analytic representation of $D^\times$ under certain genericity conditions on $ρ$. Here $\mathrm{JL}(ρ)$ is the $ρ(-1)$-multiplicity space in the image of $Π(ρ)$ under Scholze's functor, and $Π(ρ)$ is the representation associated to $ρ$ by the $p$-adic local Langlands correspondence.

comments
39 pages, no figures
fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2611.04514 ↗

We study the extension groups between one $\rm K$-type representations of the graded Hecke algebra $\mathbb H$. A one $\rm K$-type representation is a Hermitian representation of $\mbb H$ whose restriction to the Weyl group is irreducible. Using a Koszul-type resolution of $\mathbb H$-modules, we reduce the computation of $\operatorname{Ext}_{\mathbb H}^j(X,Y)$ to a combinatorial count, yielding explicit formulas for the classical types and a computer computation for the exceptional types.

fields
Representation Theory
pdf ↗ page arXiv:2611.04535 ↗

We prove effective versions of several classical results in representation theory of reductive groups over non-Archimedean local fields of arbitrary characteristic. More specifically, we deal with the support of matrix coefficients of cuspidal representations and the recursions satisfied by matrix coefficients of representations of finite length. We provide effective generation results for irreducible representations. Finally, we study the effective smoothness of characters on the set of regular semi-simple elements.

fields
Representation Theory
pdf ↗ page arXiv:2611.04659 ↗

We describe an algorithm and a computer program computing the relative Tate-Shafarevich kernel $Sha^S(K,G)$ of a reductive group $G$ over a global field $K$ with respect to a finite set $S$ of places of $K$ containing no archimedean places. We assume that we know the algebraic fundamental group $Λ=π_1^{alg}(G)$, the Galois group $Θ=Gal(L/K)$ acting on $Λ$, where $L$ is a finite Galois extension of $K$ having no real places, the decomposition subgroups $Θ_v\subseteq Θ$ for all places $v$ in $S$, and all non-cyclic decomposition subgroups $Θ_v$ for $v$ outside $S$. We also compute $Sha^S(K,G)$ in some cases where $S$ contains archimedean places.

comments
28 pages including 16 pages of a Magma program
fields
Representation Theory, Group Theory, Number Theory
pdf ↗ page arXiv:2611.04773 ↗

We study derived Ringel duality for modular category $\mathcal O$ on downward-closed, quasi-bounded supports. We reconstruct global tilting objects and their morphisms from compatible images in finite highest-weight Serre subquotients, and realize the complete Ringel algebra as an inverse limit of finite-dimensional algebras. The duality identifies the bounded homotopy category of finitely generated projectives over the associated locally unital algebra with the bounded derived category of the Ringel dual category. We characterize tiltings recovered, together with their outgoing morphisms, by a single finite subquotient, and give a sharp criterion for equivalence under Frobenius restriction. For $SL_2$, we compute tilting endomorphism algebras and their quotient maps, and obtain sharp recovery bounds for finite tilting families.

comments
30 pages
fields
Representation Theory
pdf ↗ page arXiv:2611.04850 ↗

We prove Douglas' conjecture for $m$-Kronecker quivers for each $m \geq 3$ on the normalized logarithms of Euler characteristics of moduli spaces. Also, we state a log-concavity conjecture on Euler characteristics near slope one for the 3-Kronecker quiver.

code
github.com/so-okada/kronecker-euler-sources ∎ Lean project (lakefile.lean, lean-toolchain) builds, no sorry at 16bc3d5, checked 2026-11-04 build details
comments
147 pages, 4 figures. Preliminary version; comments welcome. TeX and Lean sources at https://github.com/so-okada/kronecker-euler-sources
fields
Representation Theory, Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2611.04862 ↗

For each pair of integers $m\ge 1$ and $n\ge 2$, we construct a finite inverse semigroup $S_{m,n}\subseteq M_m(\mathbb{C})$ and explicitly determine its marginal inverse subsemigroup $M_{x^n}(S_{m,n})$ associated with the word $x^n$. We prove that the three conditions $\sim_{x^n}=\equiv_{x^n}$ on $S_{m,n}$, $M_{x^n}(S_{m,n})\trianglelefteq S_{m,n}$, and $m\le n$ are equivalent. As a consequence, we answer Problem 11 of Araújo, Araújo and Kinyon in [1]. Moreover, for a word $ω$ in any inverse semigroup $S$, we prove that $\sim_ω=\equiv_ω$ if and only if $M_ω(S)\trianglelefteq S$ and $\sim_ω$ is invariant under inversion.

comments
12 pages
fields
Representation Theory
pdf ↗ page arXiv:2611.05078 ↗

Let $p$ be a prime. We classify homomorphisms $H:V_1\to V_2$ between abelian $p$-groups that are direct sums of cyclic groups, under the assumption $p^2V_2=0$. We prove that every such homomorphism is isomorphic to a direct sum of finite indecomposable representations and that this decomposition is unique up to isomorphism and reordering of the summands.

fields
Representation Theory, Group Theory
pdf ↗ page arXiv:2611.05156 ↗

Almost 30 years ago Littelmann conjectured that there is a unitriangular base change between the dual canonical basis and the path vector basis for all symmetrizable Kac-Moody Lie algebras. In this paper we give a positive answer to the conjecture for the case of classical Lie algebras and type $G_2$, when the path model is given by standard Young tableaux.

fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2611.05183 ↗

Classical Analysis and ODEs8

We study the boundedness of the right-sided Hardy–Littlewood maximal operator on variable Lebesgue spaces over the real line. Motivated by the $K_0$ condition for the classical Hardy–Littlewood maximal operator, we introduce a directional condition $K_0^+$ adapted to the geometry of the one-sided maximal operator. We characterize $K_0^+$ in terms of the uniform boundedness of a family of one-sided averaging operators and prove that it is a necessary condition for the boundedness of $M^+$ on $L^{p(\cdot)}(\mathbb{R})$. We also establish one-sided analogues of the modular and reverse Hölder estimates associated with the classical $K_0$ condition. These estimates constitute the main local ingredients in the proof of boundedness of $M^+$ under the combined assumptions $K_0^+$ and $N_\infty$.

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

For trigonometric and polynomial orthogonal expansions, we present coefficient bounds with an explicit numerator determined by the total variation of the function and the largest cumulative signed area of the weighted basis element. This area, denoted by $M_n$, is the sharp constant in the corresponding weighted integral estimate. We calculate or bound $M_n$ for several classical systems, thereby obtaining quantitative inequalities beyond an asymptotic statement of coefficient decay. Integration between consecutive zeros gives a geometric interpretation of the estimate. The comparison includes Chebyshev polynomials of the first three kinds, Legendre, Jacobi, Gegenbauer, and ordinary Laguerre polynomials, with normalization and boundary conditions stated explicitly. Classical estimates and their elementary consequences are organized as Fourier analysis in inequalities. In the controlled distortion application, ideal curves have selected coefficients absent, and restrictions on the variation, corridor width, and number of extrema of admissible departures give explicit guarantees for those coefficients.

comments
19 pages, 2 figures
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.04067 ↗

Let $M=\mathbb R^m\sharp(\mathbb R^n\times\mathbb S^{m-n})$, where $m>n\geq3$. The full-cone Poisson area and non-tangential maximal functions fail to be of weak type $(p,p)$ for $1<p<2$. Let $K$ be the compact part joining the two ends and put $ρ(x)=1+d(x,K)$. For fixed small $c>0$, we restrict the horizontal distance from the vertex to $cρ(x)$ and retain every positive time. The resulting maximal function is of weak type $(1,1)$ and bounded on $L^p$ for $1<p\leq\infty$. The corresponding area function uses the full spatial and time gradient. It satisfies a Fefferman–Stein distribution inequality. Its $L^p$ norm is equivalent to that of $f$ for $1<p\leq2$. This area function defines a global Hardy space. We prove its $Δ$-atomic description, its injective embedding into $L^1$, its characterization by the restricted maximal function, and its real interpolation identity with $L^2$. Direct estimates for spectral-band kernels then give a Mihlin multiplier theorem from this Hardy space to $L^1$. Interpolation and duality give $L^p$ boundedness for every $1<p<\infty$.

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

Let $η\geq 0$ and $δ>0$, and let $(r_j)_{j\geq 0}$ be a sequence of real numbers satisfying $η\leq r_0 < r_1 < r_2 < \cdots$ and $r_{j+1}-r_j \geq δ$ for every $j\geq 0$. We prove that, for $δ\leq 1$ and every $x>0$, \[ \sum_{j=0}^\infty \frac{x^{r_j}}{\G(1+r_j)} \leq \sum_{j=0}^\infty \frac{x^{η+jδ}}{\G(1+η+jδ)} = x^ηE_{δ,1+η}(x^δ), \] where $E_{δ,1+η}$ denotes the two-parameter Mittag-Leffler function. Moreover, equality holds for some $x>0$ if and only if $r_j = η+ jδ$ for every $j$. The proof combines a finite compression argument for unimodal functions with a shift inequality for the Mittag-Leffler function. The upper bound $δ\leq 1$ is sharp, since counterexamples exist for every $1 < δ< 2$.

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

We introduce the bilinear Korányi spherical means on the Heisenberg group $\mathbb{H}^n,$ and derive $L^{p_1}(\mathbb{H}^n) \times L^{p_2}(\mathbb{H}^n) \to L^{p}(\mathbb{H}^n)$ estimates for the associated bilinear Korányi spherical maximal function on $\mathbb{H}^n.$ We also address multilinear extensions of our results.

comments
Submitted to a journal on 29th July 2026
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.04549 ↗

We study phase retrieval for multi-window short-time Fourier transforms with windows given by complex linear combinations of the first two normalized Hermite functions. Assume that the family of window coefficient vectors does phase retrieval in $\bbC^2$. We prove that the multi-window magnitude samples uniquely determine every signal in $L^2(\bbR)$ up to a global phase whenever the sampling set is separated with lower Beurling density greater than $2$, or is a translated lattice with density at least $2$. Moreover, we show that the sampling density is the best possible, which improves a result in [P.~Grohs, L.~Liehr, and M.~Rathmair. Multi-window {STFT} phase retrieval: lattice uniqueness, J. Funct. Anal., 288(3): Paper No. 110733, 23, 2025].

comments
14 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.04877 ↗

Varjú and Yu have given a complete description of non-singleton self-similar sets of uniqueness on the real line $\mathbb R$. In this paper, we first prove an arithmetic product theorem for self-similar $U$-sets $E:$ if $F\subset\mathbb R$ is compact, then $F\cdot E$ is an $M_0$-set if and only if $F$ is uncountable. We next show that this conclusion remains valid for bounded integer-based homogeneous Moran sets. As an application, for every $s\in(0,1]$, there exists a bounded integer-based homogeneous Moran set of uniqueness $K$ such that $\dim_H K=s$ and the self-product $K\cdot K$ is an $M_0$-set. In sharp contrast, for every $s\in[0,1/2]$ we can construct an unbounded integer-based homogeneous Moran $U$-set $E$ with $\dim_H E=s$ such that both $E$ and $E\cdot E$ are $U$-sets, and $1/2$ is the optimal threshold for $U$-sets to be closed under the arithmetic self-product. Moreover, we show that if $E\subset[0,1]$ is a compact set whose self-product $E\cdot E$ is contained in an $H$-set, then $\underline\dim_B E\le1/2$.

comments
26 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.04956 ↗

This survey concerns Stein's analytic family of generalized spherical means and the associated maximal operator. We review Stein's original theorem, the sharp necessary conditions for boundedness, and the complete theory for radial functions. We then explain the connection between positive results and local smoothing estimates for the half-wave propagator and, more generally, for Fourier integral operators. This point of view yields the sharp two-dimensional result through the work of Guth, H. Wang, and R. Zhang and, when combined with the recent local smoothing theorems, an improved higher-dimensional range. As a byproduct, the maximal operator associated with the first radial derivative of spherical means is bounded on $L^p(\R^4)$ for $2<p<3$, a case left open in recent work of Kwaśnicki. We keep track of the relation between the local smoothing exponents and the resulting maximal estimates, and identify the region that remains open.

comments
Survey paper for the proceedings of the Bienal RSME 2026; 21 pages, 3 figures
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2611.05154 ↗

Rings and Algebras8

We prove that any variety of associative algebras over a Noetherian commutative ring with unity satisfying the identity x^3=0 is finitely based. This property has been known for the varieties satisfying the identity x^2=0. On the other hand, there are varieties satisfying the identity x^6=0 that are not finitely based.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.03923 ↗

We study rings over which every semiprime submodule of every module is an intersection of prime submodules. This holds if semiprime two-sided ideals satisfy ACC, if principal two-sided ideals are finitely generated as left ideals, or if the ring is PI. Over Jacobson PI rings, every finitely generated module is Jacobson: its prime submodules are intersections of maximal submodules. For affine PI algebras this extends the Amitsur-Procesi theorem to modules. In every ring with involution, real two-sided ideals are intersections of real prime two-sided ideals. The same holds for real submodules of modules over PI rings and hereditary Noetherian prime rings, but can fail for real left ideals in Noetherian domains. Formally real affine PI algebras need not be real Jacobson: their real prime two-sided ideals need not be intersections of real primitive ideals. We give a sufficient positivity criterion. Over real Jacobson PI rings, finitely generated modules are real Jacobson: their real prime submodules are intersections of real maximal submodules. Over finitely generated free associative algebras, every finitely generated semiprime submodule of a finite free module is a finite intersection of finitely generated prime submodules and an intersection of maximal submodules of finite codimension. Semiprime hulls of finitely generated submodules are finitely generated. Evaluation at finite-dimensional irreducible representations and nonzero vector tuples gives a Hilbert Nullstellensatz over arbitrary fields. For free algebras with involution, the corresponding real results are known over the real or complex numbers when the involution permutes the generators. We extend real prime decomposition to arbitrary fields and involutions, and give new algebraic proofs of the real Nullstellensatz and finite generation of real radicals, without the GNS construction or Groebner bases.

comments
38 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2611.03967 ↗

We study four-dimensional binomial Artin-Schelter regular algebras and their connection with twisted monoid algebras. Starting with $23$ examples up to permutation of generators, we investigate the associated monoids of I-type and the structure of their groups of fractions. We determine the corresponding finite permutation groups and compute the second group cohomology $H^2(G(M),k^\times)$. These computations allow us to construct explicit families of four-dimensional Koszul Artin-Schelter regular algebras through cocycle twists. We illustrate this construction for some of these algebras.

fields
Rings and Algebras, Algebraic Geometry
pdf ↗ page arXiv:2611.03989 ↗

We describe Hochschild cohomology of Temperley–Lieb algebras by explicit minimal-resolution coordinates and multilinear operations on Kauffman diagrams. For each doubled-line basic algebra, a finite four-term bimodule complex is verified by a signed-shuffle comparison and an augmented contracting homotopy. We compute cocycles and coboundaries and recover the known cup product and Gerstenhaber bracket in explicit representatives. Over $\mathbb C$, at nonzero root-of-unity loop parameters, we construct a tower-compatible derivation and the marked-circle two-cocycle. Their classes are nonzero on every nonsemisimple block; their cup products therefore represent all positive classes over the centre. Relative full twists give a compact expression for the derivation. Worked planar diagrams distinguish the cup product from insertion and strict cochain equalities from equalities of classes. A finite-lattice section interprets the marked-circle operation as loop-weight response, derives its planar Potts normalization, and exhibits a six-vertex realization. It also shows why passing to a deformable spin representation may annihilate the class with different coefficients. No thermodynamic conclusion is claimed, and the even-strand zero-parameter family remains separate.

fields
Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2611.04022 ↗

Given a finitely aligned higher-rank $k$-graph $Λ$, Farthing, Muhly and Yeend (Semigroup Forum 2005) constructed an inverse semigroup $S_Λ$ to provide a groupoid model for the $C^*$-algebra of $Λ$. In this paper, we extend some of the existing results related to the semigroup structure of a graph inverse semigroup to the more general setting of the inverse semigroup $S_Λ$. We obtain geometric descriptions of the Green's relations on $S_Λ$, which effectively generalize the existing characterization of Green's relations on a graph inverse semigroup. We provide a simple and useful description of the Cuntz-Krieger ideal of the Booleanization of $S_Λ$ and, based on this, identify a certain $X$-to-join Booleanization of $S_Λ$, where the abstract and concrete Cuntz-Krieger relations agree. Besides the natural partial order, $S_Λ$ is also ordered by set-inclusion. This helps us to realize $S_Λ$ as a semigroup \emph{graded-ordered} by $\mathbb{Z}^k$ and, subsequently, gives rise to a full inverse subsemigroup $S_Λ^h$ of $S_Λ$, which is graded by $\mathbb{Z}^k$ in the usual sense. We show that the Kumjian-Pask algebra of $Λ$ is graded isomorphic to the quotient of the contracted semigroup algebra of $S_Λ^h$ by the tight ideal. In the final part of the paper, we show that a $k$-graph morphism $p:Λ_1\longrightarrow Λ_2$ that is injective and satisfies a certain path lifting property induces, in a natural way, an injective $0$-preserving semigroup homomorphism from $S_{Λ_1}$ to $S_{Λ_2}$. In view of this, we build a suitable categorical setup to conclude that the isomorphism established between the Kumjian-Pask algebra of $Λ$ and the tight ideal quotient of the semigroup algebra of $S_Λ^h$ is natural.

comments
32 pages, Comments are welcome
fields
Rings and Algebras, Combinatorics, Category Theory, Group Theory
pdf ↗ page arXiv:2611.04398 ↗

For two third-order tensors over $\mathbb{R}$ or $\mathbb{C}$, we define the Strassen CP rank gap as the sum of their CP ranks minus the CP rank of their direct sum. For arbitrary third-order tensors, we derive explicit upper bounds on this gap in terms of CP rank excess and dimension. For symmetric third-order tensors, we similarly define the Strassen symmetric rank gap using symmetric rank and establish explicit upper bounds in terms of symmetric rank excess, CP rank excess, and dimension. These bounds also yield sufficient conditions for the respective gaps to vanish, ensuring additivity of CP rank or symmetric rank under direct sums.

comments
26 pages
fields
Rings and Algebras, Algebraic Geometry
pdf ↗ page arXiv:2611.04502 ↗

A Kelmans transformation increases or preserves the largest eigenvalue of a symmetric nonnegative matrix. We determine when this comparison holds for Hermitian block extensions with a fixed coupling and an arbitrary common complementary block. An orthogonal change of basis and Schur complementation give an exact formula for the compressed resolvent difference as a difference of two rank-one matrices. This formula characterizes admissible coupling subspaces by proportionality of projected resolvent vectors. Polynomial coefficient kernels describe all such subspaces, and cyclic subspaces give dimension bounds and a maximum-dimension result for a two-block family. We also prove a general block comparison theorem and give monotonicity and equality criteria for nonnegative rank-one couplings. Applications concern graph joins, complex attachments, and Hermitian adjacency matrices.

comments
25 pages
fields
Rings and Algebras, Combinatorics
pdf ↗ page arXiv:2611.04688 ↗

Using Mac Lane's PROPs, one can introduce multilinear polynomial identities that involve all the operations of a Hopf algebra: the (co)multiplication, the (co)unit and the antipode. We find bases for polynomial identities and calculate their codimensions for the Sweedler algebra, treating it first as an ordinary associative algebra over a field and second as a Hopf algebra.

comments
12 pages; the introduction may overlap with arXiv:2404.15868
fields
Rings and Algebras, Category Theory, Quantum Algebra
pdf ↗ page arXiv:2611.05187 ↗

Logic7

We study the equational theory and subvarieties of the variety $\mathcal V$ generated by $(\mathbb N_0,\min,+)$. We prove that a subvariety of $\mathcal V$ is proper if and only if it is locally finite, equivalently, if and only if it satisfies a power-stabilization identity. Every finite member generates a hereditarily finitely based variety with a finite subvariety lattice. In contrast, the periodic subvarieties defined by $x^m=x^{m+1}$ are nonfinitely based for $m\geq2$. We construct a strictly descending chain of nonfinitely based subvarieties and three varieties generated by explicit reduced products, each with a decidable equational theory. The smallest is a limit variety: it is nonfinitely based, and every proper subvariety has an absolute finite identity basis. The subvariety lattice of $\mathcal V$ has cardinality continuum. In fact, the interval between the first reduced-product variety and the subvariety defined by $x^2=x^3$ already has this cardinality, and all its members are nonfinitely based. We also give a hereditarily finitely based example with an infinite subvariety lattice. The constructions use finite convex models and recognition quotients.

comments
52 pages
fields
Logic
pdf ↗ page arXiv:2611.03715 ↗

Friedman and Stanley asked whether an invariant Borel class of countable structures must be Borel complete whenever every countable level of their hierarchy reduces to it. We construct a counterexample in one fixed countable language. The structural counterexample and its principal supporting results have been formalized in Lean~4 and it is available on github.

comments
26 pages
fields
Logic
pdf ↗ page arXiv:2611.04172 ↗

We introduce a combinatorial principle $\textsf{SC}(κ)$, for any regular cardinal $κ\ge ω_2$, which asserts the existence of a family $\mathcal{Y} \subseteq [H(κ)]^ω$ of elementary substructures of $H(κ)$ which is closed under finite intersections and satisfies that for stationarily many $N \in \mathcal{Y}$, if $M \in \mathcal{Y}$ and $M \cap ω_1 < N \cap ω_1$, then $M \cap N \cap κ\in N$. We explore the idea of defining forcings with side conditions consisting of finite subsets of such a family $\mathcal{Y}$. If $\textsf{SC}(ω_2)$ holds, then there exists a thin stationary subset of $[ω_2]^ω$, and consequently $\textsf{SC}(ω_2)$ is independent of ZFC. Assuming that $μ$ is a Mahlo cardinal, the Lévy collapse $\mathrm{Col}(ω,<μ)$ forces that $\textsf{SC}(κ)$ holds for all regular cardinals $κ\ge ω_2$. Local instances of $\textsf{SC}$ can be forced using matrices of models or derived as consequences of square principles. We apply the principle $\textsf{SC}$ to define two kinds of forcings: a streamlined version of a strongly proper collapse, and a forcing which is strongly proper on a stationary set and adds arbitrarily many Baumgartner clubs. Finally, we prove two consistency results using forcings derived from $\textsf{SC}$ related to Aronszajn trees, the guessing model principle, strong failures of club guessing, and the higher dominating number.

fields
Logic
pdf ↗ page arXiv:2611.04362 ↗

We prove that there is no sequence $\{ X_n \}_{n\inω}$ such that for all $n$, there is an injection from $\mathcal{P}(X_{n+1})$ to $X_n$ under a restricted set of axioms that conforms to the "working mathematician's" intuition (excluding Choice, Replacement, and Foundation). We also show such a sequence cannot be defined using a formula either. More precisely, it is inconsistent with Zermelo set theory minus Infinity to have a formula $Φ(\cdot,\cdot)$ such that for each $n\inω$ there are $X$ and $Y$ with $Φ(n,X)$, $Φ(n+1,Y)$, and $\mathcal{P}(Y)$ being injectable into $X$. We finally show that the theorem fails if we allow infinitely many definitions, one for each term of the sequence, by using Hamkins, Linetsky, and Reitz's pointwise definable extensions of countable models of ZFC.

comments
10 pages
fields
Logic
pdf ↗ page arXiv:2611.04963 ↗

We study the relationship between large cardinals and Blass' Small Violation of Choice ($\mathsf{SVC}$), which states that the Axiom of Choice holds in a set-generic extension of the universe. Our main theorem is that in the presence of a supercompact cardinal, either the Axiom of Choice fails significantly, or else $\mathsf{SVC}$ holds in $L(\mathcal P(\mathrm{Ord}))$. We show that a supercompact is not strong enough to reflect $\mathsf{SVC}$, while an extendible cardinal is. If we assume Usuba's Loś Property holds for the supercompact, then we can outright derive $\mathsf{SVC}$ in the universe.

comments
18 pages
fields
Logic
pdf ↗ page arXiv:2611.05140 ↗

We prove that the $\mathrm{P}$-ideal dichotomy implies the negation of the square principle $\square(λ, ω)$ for every regular cardinal $λ\geqω_2$.

fields
Logic
pdf ↗ page arXiv:2611.05198 ↗

In [Pil07], Pillay showed that every imaginary in a proper pair of algebraically closed fields is interalgebraic with an imaginary of a certain algebraic form. In this paper, we establish an analogue for lovely pairs of pseudofinite fields. After naming countably many constants, we prove that every imaginary in lovely pairs of pseudofinite fields is interalgebraic with an imaginary of the same algebraic form as [Pil07] in the corresponding pairs of finite extensions of pseudofinite fields.

fields
Logic
pdf ↗ page arXiv:2611.05248 ↗

Group Theory6

An invariant random subgroup of a discrete group is a conjugation-invariant probability measure on the space of its subgroups. We confirm a conjecture of Simon Thomas and classify the invariant random subgroups of the finitary special and general linear groups over a finite field. These are shown to be stabilizers of random tuples of vectors and functionals. The classification uses the character theory of the finitary special linear group established by Skudlarek and the theory of the invariant random subgroups of the finitary permutation group established by Vershik. In addition, we classify the invariant probability measures for several natural actions of these finitary groups.

comments
58 pages
fields
Group Theory, Dynamical Systems
pdf ↗ page arXiv:2611.03960 ↗

Let $F$ be a finitely generated free group. We prove that the centraliser of any element of $\mathrm{Out}(F)$ or $\mathrm{Aut}(F)$ is of type $\rm{VF}$. We also prove that the (outer) automorphism group of any free-by-cyclic group $M=F\rtimes_\varphi\mathbb{Z}$ is of type $\rm{VF}$, and so are the McCool subgroups of $\mathrm{Out}(M)$. This relies on the construction of a new $\mathrm{Out}(M)$-invariant splitting of $M$, that enables us to reduce the proof of the above statements to the case where the outer class of $\varphi$ has finite order.

comments
71 pages, 1 figure, comments welcome :)
fields
Group Theory, Geometric Topology
pdf ↗ page arXiv:2611.04581 ↗

Do Kaplansky's group-ring conjectures hold for torsion-free word-hyperbolic groups? We show that all four fail in positive characteristic. For every prime $p$ there is a finitely presented, torsion-free, word-hyperbolic group $G$ with a finite two-dimensional classifying space and $a,b\in\mathbb{F}_p[G]$ with $ab=1\neq ba$. So, over every field of characteristic $p$, the group algebra of $G$ is not directly finite and has a non-trivial idempotent, zero divisor and unit, and $G$ is neither sofic nor surjunctive. For $p=2$, $G$, $a$ and $b$ come from OpenAI's random construction, and we add that $G$ is hyperbolic with probability $1-o(1)$, as are OpenAI's zero-divisor groups. For odd $p$ the groups are new: they adapt OpenAI's direct-finiteness construction with a signed cancellation, found first by S. V. Ivanov and independently by us, via an exact solution of a colour-balance problem and a Perron certificate. As far as we know, they are the first torsion-free counterexamples to direct finiteness and to the idempotent conjecture in odd characteristic. Hyperbolicity comes from one deterministic criterion: if a labelled graph is pattern-free, the group obtained by coning off its components is aspherical and has a linear isoperimetric inequality. We prove it by running OpenAI's exclusion of reduced spheres on van Kampen discs, an accounting OpenAI used for another complex. For every prime $p$, the existence of $G$, $a$ and $b$ and the failure of all four conjectures are formalized in Lean 4, including existence forms of the random-graph estimates used. In characteristic zero, where the idempotent and direct-finiteness conjectures hold for torsion-free hyperbolic groups, we show that no cancellation built into the vertex types survives the decay estimate that makes the groups torsion-free. OpenAI's characteristic-two counterexample with torsion is a CAT(0) group.

code
github.com/Apsiape/kaplansky-conjectures-hyperbolic-groups/tree/v1.0.3/lean/KaplanskyLean ∎ Lean project (lean/KaplanskyLean/lakefile.lean, lean/KaplanskyLean/lean-toolchain) builds with 3 sorry warnings at 00ed620, checked 2026-11-04 build details
comments
52 pages, 1 figure, 3 tables. First released on Zenodo on 14 October 2026 (v1.0.0, doi:10.5281/zenodo.23374264); this is v1.0.3 (all versions: doi:10.5281/zenodo.23374263). Lean 4 formalization of the Main Theorem for every prime p: https://github.com/Apsiape/kaplansky-conjectures-hyperbolic-groups/tree/v1.0.3/lean/KaplanskyLean
fields
Group Theory, Rings and Algebras
pdf ↗ page arXiv:2611.04599 ↗

The \emph{enhanced power graph} $\PE(G)$ of a finite group $G$ has vertex set $G$, two elements being adjacent if and only if they generate a cyclic subgroup. We determine the finite simple groups $G$ for which $\PE(G)$ is chordal: they are the cyclic groups of prime order, $\Alt(7)$, $\PSL_2(q)$ ($q\ge4$), $\Sz(q)$ ($q=2^{2n+1}\ge8$) and $\PSL_3(4)$. This answers an open problem of Bubboloni, Fumagalli and Praeger \cite{BFP}. We also prove that for every finite group $G$, if the power graph $P(G)$ is a cograph (resp.\ chordal) then so is $\PE(G)$; the cograph case is a conjecture of Bubboloni, Fumagalli and Praeger \cite{BFP}.

fields
Group Theory
pdf ↗ page arXiv:2611.05068 ↗

We propose a new refinement of the (blockwise) Alperin weight conjecture taking dimensions of simple modules (or degrees of irreducible Brauer characters) into consideration. This is similar to Giannelli's refinement of the (Alperin--)McKay conjecture. We prove this new refinement for blocks with a cyclic or Klein four defect group, for inertial blocks (which include the Broué–Puig nilpotent blocks), and for $p$-blocks of $p$-solvable groups.

fields
Group Theory, Representation Theory
pdf ↗ page arXiv:2611.05271 ↗

In this paper we begin developing a theory of Morse hierarchies for finitely generated groups. Very roughly, a Morse hierarchy is a iterative splitting of a group over subgroups that do not contribute to the Morse boundary of the ambient group. We apply this theory to Coxeter groups, establishing new combinatorial criteria that distinguish certain Coxeter groups from other Coxeter groups as well as right-angled Artin groups up to quasi-isometry. We highlight the consequences for the right-angled case. To build the reader's intuition, the last section provides many examples of Morse hierarchies and their subtleties. Finally, there is an appendix by the second author and Vivian He that extends these ideas to the metrizable Cashen–Mackay topology on the Morse boundary.

fields
Group Theory, Geometric Topology
pdf ↗ page arXiv:2611.05332 ↗

Operator Algebras6

The algebraic and environmental characteristics of mixed unitary quantum operations are investigated. It is established that the composition of two uniformly n-mixed unitary channels is itself n-noisy, and this n-noisy property is shown to be an invariant under unitary equivalence. Furthermore, by utilizing majorization and the divisibility of Kraus rank-four unital qubit channels, we demonstrate that any unital qubit channel can be physically simulated using a three-dimensional maximally mixed environment. Together, these results advance the classification and physical realization of noisy quantum channels.

comments
5+ pages; comments/suggestions are most welcome!
fields
Operator Algebras
pdf ↗ page arXiv:2611.03894 ↗

How can noncommuting quantum observables retain the geometry of a classical phase space? Motivated by Mumford's question on approximately macroscopically unique (AMU) states and the work of Lin and Wang, we study synthetic spectra of position–momentum and angular-momentum systems. Under the hypotheses of their AMU theorems, nonempty synthetic spectra yield AMU states. For sufficiently small $\hbar$, the position–momentum spectrum fills the plane, while the angular-momentum spectrum contains any prescribed ball. The latter calculation leads to compact Lie groups: we prove that highest-weight coadjoint orbits lie in regional synthetic spectra under an explicit variance bound. Function-space representations of $SU(n)$, $SO(n)$, and $Sp(n)$ provide further examples.

comments
29 pages
fields
Operator Algebras
pdf ↗ page arXiv:2611.04306 ↗

We construct C*-diagonals in all UCT Kirchberg algebras. Together with known constructions of C*-diagonals in the stably finite setting by Xin Li, this shows that every classifiable C*-algebra (in the sense of the Elliott classification programme) has a C*-diagonal. In fact, we show that every UCT Kirchberg algebra admits an untwisted principal étale groupoid model with a finite-dimensional unit space.

comments
22 pages
fields
Operator Algebras
pdf ↗ page arXiv:2611.04648 ↗

In this paper, we prove that every super McDuff $\rm II_1$ factor is uniformly super McDuff. In particular, the classes of super McDuff and uniformly super McDuff $\rm II_1$ factors coincide. This answers \cite[Question D]{GJKEP} affirmatively. For factors with separable predual, super McDuffness is therefore equivalent to the Brown property and is preserved under elementary equivalence, also answering \cite[Question~6.2.1]{AGK22} affirmatively. We further show that every infinite tensor product of non-$Γ$ $\mathrm{II}_1$ factors is uniformly super McDuff. For a finite tensor product of separable $\mathrm{II}_1$ factors that is super McDuff, each tensor factor is either non-$Γ$ or uniformly super McDuff, and at least one is uniformly super McDuff.

fields
Operator Algebras
pdf ↗ page arXiv:2611.04842 ↗

Let $(\mathcal M_n)_{n\geqslant 1}$ be a sequence of type $\mathrm{II}_1$ factors with property $Γ$ and let $ω$ be a free ultrafilter on $\mathbb N$. We prove that every subfactor of the ultraproduct $\prod_ω\mathcal M_n$ of finite Jones index is not isomorphic to the group von Neumann algebra of any discrete group. In particular, the ultrapower $\mathcal R^ω$ of the hyperfinite type $\mathrm{II}_1$ factor $\mathcal R$ is not a group factor.

fields
Operator Algebras
pdf ↗ page arXiv:2611.04926 ↗

We determine the center and characterize factoriality for mixed $q$-Gaussian von Neumann algebras associated with real symmetric matrices $Q=(q_{ij})_{i,j\in I}$ satisfying $|q_{ij}|\le1$. We prove that every central element is supported on the singleton components of the strict graph of $Q$ and on its two-vertex components $\{a,b\}$ with $q_{aa}=q_{bb}=-1$ in terms of the graph-theoretic language. We also determine the spectral laws of some central elements.

comments
16 pages
fields
Operator Algebras
pdf ↗ page arXiv:2611.05064 ↗

Quantum Algebra6

The Askey-Wilson function $φ(x, γ)$ is a meromorphic continuation of the Askey-Wilson polynomials in their spectral variable off the lattice $γ= \tilde{a} q^m, m \in \mathbb{Z}_+$. We show that the analytic part of the Askey-Wilson function $φ^{an}(x, \tilde{a} q^γ)$ is the Laplace transform of a positive measure of total measure $φ^{an}(x, s_0) < \infty$, under certain conditions on the parameters governing the function. We deduce log-convexity of this function, as well as positive-definiteness and an integral formula for a certain intertwining operator associated with the Askey-Wilson operator $L$. This offers a $q$-analogue of several results, in the trigonometric limit due to Sahi-McSwiggen, and in the rational (i.e. Dunkl) limit due to Rösler.

comments
13 pages
fields
Quantum Algebra
pdf ↗ page arXiv:2611.03907 ↗

In this article we establish new obstructions to the categorification of near-group fusion rings by combining the values of irreducible characters of the Grothendieck ring with the Galois symmetry of the induced unit object $I(1)$ in the Drinfeld center. As a result, we show that a near-group ring of type $G+m$, where $G$ is an abelian group and both $|G|$ and $m$ are odd, can only categorify if $m=|G|$.

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

We construct a universal quantum computational encoding via braiding in Links–Gould fusion spaces associated to $U_q^H(\mathfrak{sl}(2|1))$ where $q$ is on the unit circle and is not a root of unity. The construction uses only neglectons and is realized in the morphism spaces $\mathrm{Hom}_{U_q^H}(V(0,α),V(0,-\frac{1}{2})^{\otimes 2N}\otimes V(0,α)).$ Under explicit positivity and arithmetic constraints these spaces admit a $2^N$-dimensional computational subspace with a positive definite Hermitian form. We prove single-qubit density in $\mathrm{U}(2,1)$ and approximate arbitrary unitary operators on $N$-qubit computational subspaces with arbitrarily small leakage. The calculations use explicit inclusions, projections, and Hermitian pairings without requiring $F$-matrices.

comments
22 pages
fields
Quantum Algebra
pdf ↗ page arXiv:2611.04290 ↗

The reflective algebra $(R_H(A),K_{\mathrm{ref}}(A))$, introduced by Laugwitz, Walton and Yakimov, is a quasitriangular left $H$-comodule algebra constructed from a quasitriangular Hopf algebra $(H,R)$ and a left $H$-comodule algebra $A$. We study the structure and factorizability of finite-dimensional reflective algebras. When $(H,R)$ is factorizable, we show that $(R_H(A),K_{\mathrm{ref}}(A))$ is isomorphic, as a quasitriangular left $H$-comodule algebra, to $A\otimes H$ equipped with the trivial left $H$-coaction on $A$ and the universal $K$-matrix induced by $R_{21}R$. In this case, we also classify all universal $K$-matrices on $R_H(A)$. Finally, we prove that $(R_H(A),K_{\mathrm{ref}}(A))$ is factorizable if and only if $(H,R)$ is factorizable and $A$ is simple as an algebra.

comments
27 pages
fields
Quantum Algebra
pdf ↗ page arXiv:2611.04326 ↗

Three constructions of vertex operator algebras realizing the Haagerup center were announced independently and almost simultaneously. The relations between these constructions are studied in this paper. The generators are expressed in a common lattice basis for $E_6\oplus A_2$. It is proved that the constructions of Riesen and Huang give isomorphic vertex operator algebras, and that this algebra and the algebra constructed by Jiao have isomorphic fixed point subalgebras under automorphisms of order two. The isomorphisms are given explicitly on generators. The common fixed point subalgebra contains the parafermion vertex operator algebras $K(\mathfrak{sl}_2,3)$ and $K(\mathfrak{sl}_2,13)$. A general rationality criterion for unitary vertex operator algebras is given in terms of positive linear combinations of conformal vectors and is applied to these constructions. The two vertex operator algebras are simple current extensions of the common fixed point subalgebra and have equivalent module categories as ribbon categories. The equivalence follows from decomposition with respect to a nondegenerate pointed subcategory with four simple objects in the module category of the common fixed point subalgebra. It is also proved that the conformal nets associated with these unitary vertex operator algebras are completely rational.

fields
Quantum Algebra, Category Theory, Representation Theory
pdf ↗ page arXiv:2611.04778 ↗

In a weakly integral braided fusion category, a prime divides none of the conjugacy-class dimensions if and only if it does not divide the Frobenius-Perron dimension of the adjoint subcategory. We prove that these conditions hold precisely when the corresponding Sylow subgroup of the group of invertible objects generates a braided Deligne factor whose dimension is the largest power of that prime dividing the Frobenius-Perron dimension of the category. We also prove that the prime graph of the conjugacy-class dimensions has at most two connected components. If the graph is disconnected, the category is solvable. The bound is attained by the representation category of the Drinfeld double of the symmetric group on three letters.

comments
62 pages. Comments are welcome!
fields
Quantum Algebra, Group Theory
pdf ↗ page arXiv:2611.04942 ↗

Complex Variables5

We study the numerical constructions of almost complex and complex structures on spheres and products of spheres up to real dimension six. Our general set-up parametrises almost complex structures via a global matrix field in an ambient Euclidean space, compressed by the tangent projector. The projector's algebraic residual measures the almost complex condition, while its Nijenhuis tensor is evaluated in the intrinsic norm of the round product metric. Polynomial features and neural networks are trained without prescribed targets to perform general searches for these structures. The almost complex search passes numerical admissibility checks on all nine examples that admit such structures and rejects $S^4$, where a topological obstruction is known. A matrix correction then enforces the almost complex identity, subject to a novel uniform admissibility condition. For integrability, a free polynomial representation with Levenberg-Marquardt optimisation learns the complex structures on $S^2\times S^2$, $S^3\times S^1$, $S^3\times S^3$ and $S^5\times S^1$, with the largest Nijenhuis norms found by adversarial search all below $10^{-9}$. These general searches were unsuccessful on $S^6$, $S^4\times S^2$ and $S^4\times T^2$. Therefore, for these three cases direct numerical reconstructions were built in torus-fibred coordinates. They are integrable by construction, satisfy their compatibility conditions to better than $10^{-11}$, and corroborate the recent constructions on $S^6$ and $S^4\times S^2$.

code
github.com/edhirst/learning-acs-cs repository not found
comments
v1. 23 pages, 5 figures, 7 tables. Code and data available at https://github.com/edhirst/learning-acs-cs
fields
Complex Variables
pdf ↗ page arXiv:2611.03872 ↗

Let $D\subset\mathbb{C}^n$, $n\ge2$, be a bounded domain that is biholomorphic to a finite-dimensional Teichmüller space. We prove that $\partial D$ has no locally convex boundary patch containing a complex $(n-1)$-dimensional manifold through each of its points. Note that in complex dimension two this excludes every locally convex boundary point, without any boundary regularity assumption. In every dimension, we also exclude locally convex $C^2$ boundary patches.

fields
Complex Variables
pdf ↗ page arXiv:2611.04653 ↗

In this note, we study the regularity of solutions to the geodesic equation in the space of plurisubharmonic functions in a general Reinhardt domain. Our findings resolve a problem left open from our previous note [AD26].

comments
5 pages, no AI used
fields
Complex Variables
pdf ↗ page arXiv:2611.04793 ↗

We study the distortion of the lower dimension and lower spectrum of sets under quasiconformal mappings. As an application, we verify weighted Hardy–Sobolev inequalities in Euclidean domains arising as quasiconformal images of domains with sufficiently regular boundaries. The regularity in question is phrased in terms of estimates for either the Assouad or the lower dimension of the complement. We also provide dilatation-dependent classification results for certain planar open sets.

comments
38 pages
fields
Complex Variables, Classical Analysis and ODEs, Metric Geometry
pdf ↗ page arXiv:2611.05118 ↗

Using a sharp bound for convolutions of non-negative trigonometric polynomials with the Fejér kernel resembling a pointwise variant of Bernstein's inequality for polynomials, we prove new properties of extremal functions for the Krzyż conjecture. In particular, we resolve a 1993 conjecture of Peretz by showing that if $f$ is extremal for some coefficient, then $|f(0)|\leq 1/e$. Furthermore, we show that if equality holds in this estimate for every extremal function, then the Krzyż conjecture is true.

comments
14 pages
fields
Complex Variables
pdf ↗ page arXiv:2611.05363 ↗

Commutative Algebra4

We characterize bipartite graphs whose edge rings are almost Gorenstein. Using this characterization, we recover known results for two families of graphs. In addition, we show that if the edge ring of a bipartite graph is almost Gorenstein and its $h$-polynomial has degree at least two, then the $h$-polynomial is palindromic except possibly for the linear and next-to-leading coefficients. Moreover, we construct two bipartite graphs whose edge rings have the same $h$-vector, although only one of the rings is almost Gorenstein.

comments
12 pages, 2 figures
fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2611.01032 ↗

Let $R$ be a commutative noetherian ring. We ask whether complexes with finitely generated cohomology and a fixed support can be generated by relatively compact objects, using coproducts which exist in the half-bounded derived category. We prove that $\mathbf D^+_{\mathrm{fg},W}(R)=\operatorname{Loc}_{\mathrm{ex}}(\mathbf D^b_{\mathrm{fg},W}(R))$ whenever $W\subseteq\operatorname{Spec} R$ is specialization closed and has finite dimension. The same equality holds for every specialization-closed subset of $\operatorname{Spec} B$ when $B$ is a finite-type algebra over a noetherian domain $A$ of finite character and either $A$ or $B$ is regular. These equalities classify the thick Hom-submodules closed under existing coproducts. We also prove the corresponding bounded-above statement from the support results of Matsui–Takahashi. For an arbitrary noetherian ring, the bounded-below generation conjecture reduces to torsion complexes over quotient domains, with their support unchanged. Finally, over a regular noetherian domain of infinite dimension, we give a bounded-below object which is generated by bounded objects with the same support but has no bounded-below representative by finitely generated modules. The comparison functor from the bounded-below derived category of finite modules is therefore neither full nor essentially surjective.

comments
23 pages
fields
Commutative Algebra, Category Theory, Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2611.04690 ↗

Let $V$ be a complete valuation domain of rank 1, and let $Γ$ be its value group. We investigate the power series ring $V[[t]]$, and finally answer the long standing question of when this ring is coherent. Specifically, we prove that it is coherent if and only if $V$ is almost maximal, and either $Γ= \mathbb{R}$ or $Γ$ is discrete. Furthermore, we demonstrate that the weak Hilbert-syzygy identity $w. dim V [[X]] = w. dim V + 1$ holds if and only if $V[[X]]$ is a coherent ring.

fields
Commutative Algebra
pdf ↗ page arXiv:2611.05246 ↗

Motivated by examples such as the local rings of projective integral schemes and the Zariski-Riemann space of a field, we develop a geometry for continuously indexed families of subrings of a commutative ring $R$. The indexing spaces are Stone spaces, and continuity is taken with respect to the Zariski topology on the space of subrings. To each such family we associate a subsheaf of the constant sheaf with value $R$ whose stalks are the indexed subrings. This gives a patch ringed space. Its global sections are locally constant $R$-valued functions whose value at each point belongs to the corresponding subring. The ring of global sections, with this representation, is the associated patch algebra. Our main result establishes an algebra-geometry correspondence between these continuously indexed families of subrings and patch ringed spaces that can be expressed as a category equivalence, with each of the two categories dually equivalent to the category of patch algebras. Thus the indexing space, its sheaf, and the indexed subrings can be recovered functorially from the associated patch algebra, which serves as a coordinate ring for this geometry. We describe kernels and factorizations of patch algebra morphisms in geometric terms and characterize their injectivity and surjectivity. We include applications to Pierce duality and Bhatt-Scholze $w$-localizations of integral separated quasi-compact schemes.

fields
Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2611.05370 ↗

General Topology4

We answer four questions on irreducible determined $T_0$-topologies and a related question on monotone determined topologies posed by Xu, Yang and Luo (Topology Appl.\ 382 (2026), 109762). For every $T_0$ topology $τ$, the family $τ_r$ used to define its irreducible-derived topology is already a topology and preserves all nonempty irreducible subsets and their closures. Consequently, the least irreducible determined refinement is obtained in one step: $τ_r=\rd(τ)=\Rd(τ)$. For an arbitrary poset $P$, we describe the weakest order-compatible irreducible determined topology $ρ(P)$ using Dedekind–MacNeille cuts and a finite-cover condition involving principal lower sets. The Scott space of the binary-prefix domain provides a common counterexample to saturated heredity for irreducible determined spaces and monotone determined spaces: its maximal-point subspace is Cantor space. We also describe $ρ(P)$-closure by iterating an irreducible-cut operator, characterize Scott continuity of this operator, and give an example requiring two applications of the cut operator. A finite-decomposition condition extends the topology and closure-preservation results to general subset systems. For the Rudin and well-filtered determined systems, we exhibit a common $T_1$ example whose first and second derived topologies are the co-countable and discrete topologies, respectively. Thus the first derived topology need not be determined by the same subset system.

comments
16 pages
fields
General Topology
pdf ↗ page arXiv:2611.04808 ↗

A space is feebly compact if every locally finite family of nonempty open subsets of it is finite; a Tychonoff space is feebly compact if and only if it is pseudocompact. M. Tkachenko asked whether a regular feebly compact semitopological group is a topological group provided that it is separable, has countable tightness, or is a $k$-space; for Tychonoff groups the answer is known to be positive. We answer this question in the separable case: every regular separable feebly compact semitopological group is a topological group. The proof is based on the following result: if $X$ is a separable Baire space, $Y$ is a feebly compact space and $Z$ is a regular space, then every separately continuous map $X\times Y\to Z$ is strongly quasicontinuous. Unlike the known approaches for Tychonoff spaces, the proof does not use real-valued functions. More generally, every regular separable semitopological group which is $Γ^{BM}_o$-nonmeager, a Baire-type property defined by a modification of the Banach-Mazur game, is a topological group. This class of groups contains all regular separable Baire groups which are feebly $p$-spaces; feebly $p$-spaces form a wider class of spaces, which contains all feebly compact spaces and all $p$-spaces. The results remain valid for spaces satisfying the assumptions locally. In particular, every regular locally separable locally feebly compact semitopological group is a topological group.

comments
13 pages
fields
General Topology, Group Theory
pdf ↗ page arXiv:2611.04891 ↗

A space is ESLC if it contains neither an $S$-space nor an $L$-space, and NFS is the class of spaces containing no free sequences of length $ω_1$. We prove that under $\mathrm{MA}(ω_1)$, if all finite powers of $X$ belong to NFS, then $C_p(X)^ω$ is ESLC; thus, for subspaces of $C_p(X)$, hereditary Lindelöfness, hereditary separability and countable spread coincide. This is derived from a dual form of a theorem of Todorčević. A Lindelöf $Σ$-space belongs to NFS if and only if its compact subspaces have countable tightness. Hence $C_p(X)$ contains no $L$-spaces if $X$ is a Lindelöf $Σ$-space of countable tightness and $\mathrm{MA}(ω_1)$ holds, or if $X$ is any Lindelöf $Σ$-space and PFA holds. Under $\mathrm{MA}(ω_1)$, all iterated function spaces of Corson compact spaces are ESLC, and in ZFC the space $C_p(X,\{0,1\})$ is ESLC for every zero-dimensional Corson compact space $X$.

comments
15 pages
fields
General Topology, Functional Analysis, Logic
pdf ↗ page arXiv:2611.04911 ↗

A $T_0$-space is called $ω$-sober if every irreducible closed subset having a countable dense subset is the closure of a unique point. This is precisely $H$-sobriety for the countable irreducible subset system $\mathcal R^ω$. We give two natural Hofmann–Mislove representations in the general $H$-sobriety framework: filters induced by $H$-sets of $X$ characterize $H$-sobriety, whereas filters induced by $H$-sets of the Smyth power space characterize super $H$-sobriety. Their relation is expressed by property $Q$. A minimal closed set argument with a countable selection proves that $\mathcal R^ω$ has property $Q$. Consequently, $X$ is $ω$-sober if and only if its Smyth power space is $ω$-sober, equivalently, every countable irreducible compact-family filter has a compact saturated representation. We also obtain equivalent recovery, compact-intersection and representation conditions for an enlarged class containing the proper Scott-open filters with countable open bases and the filters induced by countable irreducible subsets. A further equivalent formulation uses traces on countable subspaces. The filtered-family specializations recover well-filteredness and $ω$-well-filteredness. Explicit examples show that $ω$-sobriety strictly implies $ω$-well-filteredness, which strictly implies representation for countable open bases alone.

comments
14 pages
fields
General Topology
pdf ↗ page arXiv:2611.05214 ↗

Metric Geometry4

We show that the kissing numbers in dimensions 32, 33, 34, 35, 37, 38 and 39 are at least 352320, 370240, 390980, 415308, 499816, 605322 and 768916, improving the previous bounds 347584, 364736, 384836, 409676, 498024, 591900 and 763668. Except in dimension 38, the configurations are those of Edel, Rains and Sloane with new binary constant-weight codes of weight 8 and minimum distance 8 in the middle layer; each additional word adds 128 points. In dimension 38 we add 6855 antipodal pairs of vectors of the second shell of the Leech lattice to the empty equator of Kravatskiy's 591612-point configuration, where 144 pairs were known; this is an independent set problem in a regular graph of degree 11178 on 8386560 vertices. The codes and lines were found by local search, and all configurations were checked pair by pair in exact integer arithmetic.

comments
8 pages. Certificates and verification programs: https://github.com/QH-Lin/kissing-number-32 (doi:10.5281/zenodo.23527725) and https://github.com/QH-Lin/kissing-numbers-33-39 (doi:10.5281/zenodo.23554808)
fields
Metric Geometry, Information Theory, Combinatorics
pdf ↗ page arXiv:2611.03682 ↗

A planar crescent configuration consists of $n$ points, no three collinear and no four concyclic, whose distinct distances have multiplicities $1,2,\ldots,n-1$. We prove by exact computation that no such configuration exists for $n=9$. The three pairs carrying the two least frequent distances yield a six-point subset with at most six distances. Rational linear algebra on quartic polynomials separates the possible six-point distance patterns into those with certified finite lists of normalized distance tuples and a residual family. Compatibility of overlapping subsets forces at least one core into the first family, without classifying the residual realizations. The remaining three points are then obtained by rational constructions over the field of the squared core distances. The multiplication matrices used to enumerate the core distances have order at most twelve. Exhaustive label assignments and exact algebraic comparisons exclude all remaining extensions.

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

A magic square exemplifies balance in inequality: its $n^2$ entries $\{1,\dots,n^2\}$ are distinct, yet every row, column, and main diagonal sums to $μ_n=n(n^2+1)/2$. Lifting centred grid cells into $\mathbb{R}^3$ as radial vectors $\mathbf{p}_{ij}(λ)=(x_j,y_i,λz_{ij})$ and taking their convex hull—the Magic Gem $\mathcal{G}_λ(S)$---asks: when does line-sum equality suffice for equilibrium in 3D, and when a nonlinear realization breaks balance, how can an opposing inequality restore it? We test this across all $880$ order-$4$ magic squares in four regimes. For radial spokes from $O$, natural lengths balance identically, while unit spokes break equilibrium on all $832$ non-associative squares in 3D and on all squares in 2D, where the ring-radius ratio $r_2/r_1=\sqrt{5}$ bounds the resultant below by the Pell convergent $9/4\approx\sqrt{5}$. By length–weight duality, balance is restored via tip weights $\mathbf{w}^*>\mathbf{0}$ on $S^2$ or power-law spoke scaling ($r^{α^*}$ in 2D and $(\mathbf{V}_3)_z=0$ in 3D). In 3D rotation, equal point masses make every semi-magic square an axisymmetric top with spherical-top transition $λ_{\mathrm{iso}}=(n^2+1)^{-1/2}$, whereas entry masses $m_{ij}=s_{ij}$ expose the quadrupole $Q_{xy}=\sum z_{ij}x_jy_i$, triggering $180^\circ$ Dzhanibekov flips on $824$ squares. Passing to the uniform solid hull $\mathcal{G}_0(S)$ shifts the centroid off $O$ on $829$ squares; re-engaging the opposing core $\mathcal{G}_1(S)$ restores balance via two-density inclusions, nested wireframes, or the $K_{n^2}$ strut network, while all $880$ hulls unfold into non-overlapping nets with $f_0-1$ glue tabs. Finally, $λ=1/5$ stabilizes $74.5\%$ of facets on a table, and alternating $\mathcal{G}_λ(S)$ with its mirror twin $\mathcal{G}_λ(r^2\overline{S})=-\mathcal{G}_λ(S)$ locks chiral blocks into a vertical tower.

comments
23 pages, 7 figures, 5 tables. Ancillary files include exact rational verification script (anc/verify_paper_c.py) and complete order-4 census archive (anc/results_paper_c.json). Interactive 3D visual essay and STL/papercraft studio at https://kylemath.github.io/magicGem/ and https://kylemath.github.io/magicGem/3dModels/index.html
fields
Metric Geometry, Combinatorics
pdf ↗ page arXiv:2611.03991 ↗

We give an elementary proof of a tangent-cone identity which might be known to specialists in geometric measure theory. It concerns Lipschitz mappings $g$ from the closed unit ball $B\subset\mathbb{R}^2$ to $\mathbb{R}^2$. Let $x$ be an interior point of differentiability of $g$ at which $Dg(x)$ has rank one. If the upper one-dimensional Hausdorff density of $g(B)$ at $g(x)$ is at most one, then the tangent cone to $g(B)$ at $g(x)$ coincides with the image of $Dg(x)$. This property is used in the proof of rigidity for the four-gradient problem. We provide a detailed, self-contained proof based on differentiability, connectedness and elementary estimates for one-dimensional Hausdorff measure, without using advanced methods from geometric measure theory.

comments
15 pages, 5 figures
fields
Metric Geometry
pdf ↗ page arXiv:2611.05161 ↗

Category Theory3

We construct an endofunctor on (small) simplicial sets which freely adjoins a zero object to a (small) infinity-category, as the co-cone construction freely adjoins a terminal object. We then prove that this endofunctor induces a left adjoint to the inclusion of the infinity-category of (small) pointed infinity-categories and morphisms that preserve zero objects into the infinity-category of (small) infinity-categories. This adjunction, in turn, leads to the definition of a coherent choice of nullhomotopies on a pointed infinity-category. A coherent choice of nullhomotopies is a non-canonical, coherent choice of "higher zeroes" on a pointed infinity-category, mirroring the obvious definition of higher zeroes on the differential graded nerve of a differential graded category of chain complexes over an additive category. We then show that coherent choices of nullhomotopies give an alternate characterization of fiber sequences in pointed infinity-categories, generalizing the 1-categorical definition of kernels in terms of morphisms that compose to zero.

fields
Category Theory, Algebraic Topology
pdf ↗ page arXiv:2611.04167 ↗

We characterise the commutative rings of weak global dimension at most one whose derived categories can be stratified by the Balmer-Favi support theory. For such rings, this yields a bijective correspondence between the class of localising subcategories of the derived category, and the subsets of the Zariski spectrum. For a large class of rings of weak global dimension at most one including all valuation domains, this occurs if and only if the ring is locally strongly discrete, if and only if the Telescope conjecture holds, and if and only if the module category has Gabriel dimension. However, we also give an example of a valuation domain where all these conditions fail, and yet the residue fields generate its derived category and we can classify all the localising subcategories of $D(R)$. Additionally, in the same example, we show that the Balchin-Stevenson smashing support cannot stratify $D(R)$ either.

comments
19 pages, comments welcome!
fields
Category Theory, Commutative Algebra
pdf ↗ page arXiv:2611.05247 ↗

We study the tensor triangular geometry of derived categories of valuation domains, obtaining complete ring-theoretic characterizations of their main structural properties. In particular, although valuation domains are almost always non-noetherian, their derived categories always satisfy the local-to-global principle and hence the detection property. We establish precise criteria for homological detection, stratification, and homological stratification, revealing a clear hierarchy among these properties. Notably, we obtain examples of derived categories of commutative rings that are homologically stratified and satisfy the local-to-global principle, but are not stratified. We also determine when the category of modules over a valuation domain has Gabriel dimension, and use this to provide a negative answer to a question of Balchin, Gómez and Stevenson. Overall, valuation domains provide a rich class of non-noetherian rings whose derived categories can be understood in considerable depth.

comments
31 pages, all comments welcome
fields
Category Theory, Commutative Algebra, Algebraic Topology
pdf ↗ page arXiv:2611.05298 ↗

General Mathematics3

On a hereditarily precompact quasi-metric space, every bijective non-contractive self-map has the following structure: the quasi-metric splits as $d = λ^- + D_0$. The invariant limit register $λ^-$ is a quasi-pseudo-metric below $d$ for which the map is an isometry, with totally bounded symmetrization on every orbit, so that the map's rigid shadow is a rotation of a compact monothetic group; the asymmetric limit structure on it, a priori only paratopological, carries the compact topology. The defect $D_0$ lies in a band between a past fee difference and the fee of its source, the fee nondecreasing along orbits and vanishing in the deep past. The defect is zero precisely when the map is an isometry. Deep sources are thus almost rigid: in the deep past the map is an isometry to within any $\varepsilon$, against every target. Every such map that is not an isometry is a toll over its rigid shadow, levied on a forward-invariant zone that sheds into the past. Two further facts are forced: the orbit of the source of any strict pair is infinite and already strict, and the source pays its whole defect on its own backward returns, uniformly on a chain-closed set of displacements. The band is attained at both ends, and beyond it the shape of the defect is not forced: three spirals over the circle show that the toll can depend on the target, that a source carrying a fee can descend for free, and that an ascent can carry defect; no rate of shedding is forced either, and for zone tolls (two-valued descent tolls that are shift-monotone and subadditive along their own routes) the fee reaches zero already at a finite depth, by the ascending chain condition on submonoids of $\mathbb{N}$. The results are machine-checked in Lean, apart from a few statements listed at the end.

comments
15 pages. Lean 4 verification artifacts (five modules, toolchain pins, SHA-256 manifests; Lean 4.32.0, mathlib v4.32.0) included as ancillary files and archived with the paper at Zenodo, doi:10.5281/zenodo.23544811. Answers Question 7.6 of the toll-spiral paper (arXiv:2610.13973) structurally
fields
General Mathematics
pdf ↗ page arXiv:2611.03681 ↗

We study arc length on the first-quadrant unit curve $x^p+y^p=1$, $p>1$, when length is measured with respect to an $L^r$ norm. Denoting this length by $L(p,r)$, we prove the Hölder-duality identity $L(p,r)=L(r^*,p^*)$, where $p^*=p/(p-1)$ and $r^*=r/(r-1)$. The identity is interpreted as a special case of the symmetry of mixed area (equivalently, of the anisotropic perimeter pairing). For the distinguished dual metric $r=p^*$, the length element agrees with the areal angular element: $L(p,p^*)=\int_γ(x\,dy-y\,dx)=\frac1p B(1/p,1/p)$. Thus the familiar coincidence between arc length and angular parameter on the Euclidean unit circle is the self-dual case $p=2$ of a more general relation between $L^p$ geometry and its dual metric. As a consequence, the Euclidean arc length of the $L^p$ unit curve admits a dual trigonometric representation.

comments
5 pages, no figures
fields
General Mathematics
pdf ↗ page arXiv:2611.03693 ↗

We enumerate dissections of a 30-60-90 triangle into smaller triangles similar to itself, counting unlabeled arrangements up to similarity and reflection. There are 18 four-piece, 121 five-piece, and 844 six-piece arrangements, corresponding to 11, 47, and 235 distinct multisets of piece areas. We present illustrated catalogs organized by these area multisets and distinguish layouts obtained by subdivision and local rotations or reflections from independent layouts. A separately implemented computational search reproduces every arrangement up to nine pieces, finding 460404 arrangements. Counts through nine pieces for five other classes of triangles are included for comparison.

comments
9 pages, 7 figures
fields
General Mathematics
pdf ↗ page arXiv:2611.03719 ↗

Symplectic Geometry3

We survey the recent development of spinal open books and nearly Lefschetz fibrations. The focus is on explaining past and new results regarding the detection of symplectic fillability and classification of symplectic fillings of contact 3-manifolds in light of the new machinery. We give many examples and a list of open questions. This can be considered as an additional chapter to the lecture notes by Ozbacgi and Wendl.

comments
36 pages, 16 figures. To appear in the Proceedings of the 2025 Georgia International Topology conference
fields
Symplectic Geometry, Geometric Topology
pdf ↗ page arXiv:2611.04089 ↗

Let $W$ be a Weinstein manifold and let $f: W \to W$ be a compactly supported symplectic automorphism. Using Floer theories, one can define two different entropies of $f$, called "Floer-theoretic" entropy and "categorical" entropy. The current article compares these two entropies and show that the former bounds the latter from below. As an application of the comparison, using that these entropies are invariants up to the conjugate relation, we count conjugacy classes in symplectic mapping classes. Especially, we show an exponential abundance of conjugacy classes that are smoothly isotopic to the identity, when $W$ is a Weinstein manifold of dimension $4n \geq 6$, satisfying a local condition.

comments
27 pages with 1 figure. Comments are welcome
fields
Symplectic Geometry, Dynamical Systems
pdf ↗ page arXiv:2611.04161 ↗

Let $Y$ be a smooth cubic 3-fold. We show that $S^2 \times Y$ admits an infinite sequence of cohomologous symplectic forms which are all deformation equivalent but pairwise non-isotopic; McDuff showed the corresponding result on $(S^2)^2 \times T^2$, but these appear to be the first simply-connected and monotone examples. The results are obtained from McDuff's bordism-flavoured Gromov–Witten invariant, re-interpreted cohomologically in terms of an evaluation map valued in the space of maps from the 2-sphere to a symplectic target. The application then relies on classical properties of the Fano space of lines on $Y$. We also discuss higher-dimensional generalisations.

comments
16 pages; comments welcome
fields
Symplectic Geometry
pdf ↗ page arXiv:2611.05324 ↗

Algebraic Topology2

Fix an odd prime $p$ and let $A$ be the mod $p$ Steenrod algebra. There is a normal sub-Hopf algebra $D$ of $A$, and we show that the cohomology of $A$ is $F$-isomorphic to the subalgebra of the cohomology of $D$ which is invariant under the $A$-action. We also show that the sub-Hopf algebras of $A$ with bounded profile function detect nilpotence in cohomology.

comments
34 pages
fields
Algebraic Topology
pdf ↗ page arXiv:2611.04013 ↗

For any odd prime number $p$, we solve the topological period-index problem for a $p$-primary element of the Brauer group of a CW-complex of dimension not greater than $2p+2$.

comments
24 pages
fields
Algebraic Topology
pdf ↗ page arXiv:2611.04265 ↗

K-Theory and Homology2

We establish homotopy invariance for connective continuous K-theory of affinoid Tate adic spaces of good reduction with respect to the algebraic affine line, distinct from the adic affine line as analytic stacks. We approach this through an investigation of boundedness of t-structures on nuclear module categories, to which end we also study ultrasolid modules, a variant of solid modules, and their properties.

comments
55 pages; comments welcome
fields
K-Theory and Homology, Algebraic Geometry
pdf ↗ page arXiv:2611.05111 ↗

In this paper we classify the algebraic K-theory of sets equipped with an action by a finite abelian monoid. The main tool developed for this purpose is an Orbit-Stabilizer Theorem, which gives a decomposition of monoid sets analogous to the decomposition given by the Orbit-Stabilizer Theorem for G-sets.

fields
K-Theory and Homology, Representation Theory
pdf ↗ page arXiv:2611.05265 ↗

History and Overview1

The AI labs' vision is based on extraction (of data, wealth, and political power). Mathematicians must oppose it, moving past personal reflections and towards reforming mathematics' social contract.

comments
7 pages, 1 figure
fields
History and Overview
pdf ↗ page arXiv:2611.04213 ↗

Spectral Theory1

In this paper, we study Egorov's theorem for Laplacian eigenfunctions on compact hyperbolic surfaces in Zelditch's quantization. In this quantization, the remainder in Egorov's theorem for eigenfunctions is given explicitly by the second derivatives of the symbols along the weak stable foliation of the geodesic flow. Forward in time, we show that Egorov's theorem for eigenfunctions is valid to all logarithmic times, far beyond the Ehrenfest time T_E=|log h|/2, where h going to 0 is the semiclassical parameter. Backward in time, we introduce the Schrodinger group along the stable horocycles, which absorbs the exponentially growing part of the remainder. We show that Egorov's theorem for eigenfunctions is valid up to -T_E+T_h for any Th going to infinity with 0<=T_h<=T_E. Moreover, the limit of the remainder in Egorov's theorem at the Ehrenfest time -T_E is exactly the difference between the semiclassical measure and the Liouville measure, tested against the symbols propagated by the Schrodinger group. Consequently, Egorov's theorem for a sequence of eigenfunctions holds at -T_E (and in fact, at -T_E-T for any fixed T in R if and only if the sequence tends to be equidistributed in the phase space. Thus, the quantum unique ergodicity (QUE) conjecture is equivalent to this Egorov property holding for every eigenbasis. Furthermore, QUE holds with a polynomial rate if and only if Egorov's theorem holds at -T_E with a polynomial remainder. In this case, Egorov's theorem holds beyond -T_E with a polynomial remainder, and the stronger the rate is in QUE, the longer the time is in Egorov's theorem.

comments
54 pages, 4 figures
fields
Spectral Theory, Mathematical Physics, Analysis of PDEs, Dynamical Systems
pdf ↗ page arXiv:2611.04131 ↗

Revised papers286

Let $μ$ be a finite non-atomic measure on a set $X$. A \emph{segment} for $μ$ is an increasing family $u(t)$, $t\in[0,1]$, of measurable sets with $u(0)=\emptyset$, $u(1)=X$ and $μ(u(t))=t\,μ(X)$; by a theorem of Fryszkowski, finitely many measures $f\,dμ$ admit a common segment. We study \emph{open segments}, i.e.\ segments consisting of open sets, when $X$ carries a topology. We show that weak outer regularity of $μ$ is equivalent to the approximability of measurable sets by open sets, and that it holds for every finite Borel measure on a metrizable space. Our main result states that if $μ$ is finite, non-atomic and weakly outer regular, then for all $f,g\in L^1(μ)$ with $(\int f\,dμ,\int g\,dμ)\neq(0,0)$ there is a common open segment for $f\,dμ$ and $g\,dμ$; in particular, for every $f\in L^1(μ)$ there is an open segment for $μ$ which is simultaneously a segment for $f\,dμ$. Relative versions allow one to prescribe an initial set. We also characterize open segments as upper semicontinuous functions with uniform distribution and show that on separable metrizable spaces a single measure admits such a function which is continuous.

comments
Revised and extended version
fields
Functional Analysis
pdf ↗ page arXiv:0806.1247 ↗

Let $γ:[0,1]\to \mathbb{R}^2$ be a continuous curve with $γ(0)=(0,0)$ and $γ(1)=(1,1)$. We prove that if $γ(t)\in(0,1)^2$ for all $t\in(0,1)$, then for each $n\in \mathbb{N}$ there exist points $A_1,\dots,A_n$ on $γ$ such that, with $A_0=(0,0)$ and $A_{n+1}=(1,1)$, the horizontal increments $π_1(\overrightarrow{A_iA_{i+1}})$ and the vertical increments $π_2(\overrightarrow{A_iA_{i+1}})$, $0\le i\le n$, are positive and coincide up to order. More generally, the same conclusion holds as soon as $γ$ contains an arc that joins two points of the diagonal segment, lies on one side of the diagonal, and satisfies a mild one-sided boundary condition. This covers, for instance, the graph of every continuous function $f$ with $f(0)=0$ and $f(1)=1$, with no restriction on the range of $f$. In all cases the rearrangement can be taken to be a cyclic shift by one place of a block of consecutive increments. The main tool is a version of the mountain climbers' theorem in which one function is piecewise monotone and the other is an arbitrary continuous function. As an application, any two non-atomic probability measures on $[0,1]$ satisfying a mild condition admit, for each $n$, a partition of $[0,1]$ into $n+1$ consecutive intervals whose two lists of measures are rearrangements of each other.

comments
This is a revised version of a published article
journal
M. Javaheri, On a property of plane curves, J. Math. Anal. Appl. 361 (2010), 332--337
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:0905.1308 ↗

We study a finite Hubbard model coupled to a massless phonon field through a form factor common to all sites that satisfies the infrared singular condition. The Hamiltonian has no ground state in the Fock representation. With the unitary transformation of Arai and Hirokawa, the ground states with infrared cutoff define states on the Weyl algebra over the form domain of the inverse dispersion, and they converge to a ground state in a representation inequivalent to the Fock representation. In this representation the ground states are the products of the ground states of the Hubbard model and the phonon vacuum, so that the model has ferromagnetic or unique spin-singlet ground states according to the hopping matrix and the electron number.

comments
7 pages
fields
Mathematical Physics
pdf ↗ page arXiv:1008.2056 ↗

We study the grand canonical Gibbs states of a finite Hubbard model coupled to massless phonons with the dispersion relation $|k|^s$, $1\leq s<d$, at finite temperature. We keep the decoupling setting of the zero-temperature analysis, in which the electron-phonon form factor is common to all sites. An explicit unitary transformation factorizes the Gibbs state into the electron Gibbs state and the free phonon Gibbs state up to a phase, and the phonons exhibit Bose-Einstein condensation in the thermodynamic limit with the critical density of the free Bose gas. Assuming the convergence of this phase as the infrared cutoff is removed, the condensed state is the mixture of mutually disjoint component states with broken gauge symmetry, described by their expectations on the Weyl algebra. Physically, phonons are considered not to undergo Bose-Einstein condensation arxiv:1207.4621, and the study of a mechanism that suppresses this mathematical and formal condensation is left for future research.

comments
8 pages
fields
Mathematical Physics
pdf ↗ page arXiv:1308.5589 ↗

We present a quantization of a Lie coideal structure for twisted half-loop algebras of finite-dimensional simple complex Lie algebras. We obtain algebra closure relations of twisted Yangians in Drinfeld J presentation for all symmetric pairs of simple Lie algebras and for simple twisted even half-loop Lie algebras. We provide the explicit form of the closure relations for twisted Yangians in Drinfeld J presentation for the ${\mathfrak{sl}}_3$ Lie algebra.

comments
v4: Corrected and completed coefficient tensors in (5.14) and (5.21)
journal
SIGMA 13 (2017), 011, 35 pages
fields
Quantum Algebra, Mathematical Physics
pdf ↗ page arXiv:1401.2143 ↗

We establish sharp lower bounds for two geometric functionals which evaluate the global variation of the Gauss map on the boundary of bounded open sets $Ω\subset\mathbb{R}^d$. These functionals arise as the endpoint case $s=0$ of the Gagliardo seminorm in $W^{s,p}(\partialΩ)$ of the normal vector field, for $p\in\{1,2\}$. We also show that balls are the unique minimizers. In addition, some applications to the fractional setting $s>0$ are given.

comments
28 pages. The title has been modified, and new sections covering motivation and applications have been added. The results have been strengthened compared to previous versions
fields
Analysis of PDEs
pdf ↗ page arXiv:1805.03557 ↗

Given a measurable cocycle with values in $\mathrm{Homeo}^+(\mathbb{S}^1)$, we construct an $\mathrm{L}^\infty$-parametrized Euler class in bounded cohomology. We show that such a class vanishes if and only if the cocycle can be lifted to $\mathrm{Homeo}^+_{\mathbb{Z}}(\mathbb{R})$ and it admits an equivariant family of points. We recall the notion of semicohomologous cocycles and we show that two measurable cocycles are semicohomologous if and only if they induce the same parametrized Euler class. Since for minimal cocycles, semicohomology boils down to cohomology, the parametrized Euler classes of minimal cohomologous cocycles are equal. We conclude by studying the vanishing of the real parametrized Euler class and we obtain some results about elementary cocycles.

comments
30 pages, improved exposition, to appear on BBMS
fields
Geometric Topology
pdf ↗ page arXiv:2101.11971 ↗

We focus on the second part of Hilbert's 16th problem and provide an upper bound on the number of limit cycles that a polynomial, differential, planar system may have, depending exclusively on the degree $n$ of the system. Such a bound turns out to be a polynomial of degree $4$ in $n$. More specifically, if $H(n)$ indicates the maximum number of limit cycles among planar, differential, polynomial systems of degree $n$, then \begin{gather} H(n)\le \dfrac52 n^4-\dfrac{23}2 n^3+ \dfrac{43}2n^2-\dfrac{37}2n+7\,\,\,\, \mbox{if $n$ is even, and} \nonumber H(n)\le \dfrac52 n^4-\dfrac{23}2 n^3+ \dfrac{41}2n^2-\dfrac{33}2n+6\,\,\,\, \mbox{if $n$ is odd}.\nonumber \end{gather} For quadratic systems, we find $H(2)=4$. Our proof is entirely variational and utilizes in a fundamental way tools and facts from Morse theory, to the point that no particular expertise in dynamical systems is necessary or required. It is particularly interesting to compare our results with the ones for the same problem recently announced and made public by OpenAI as part of the solution of hundreds of important mathematical problems.

fields
Dynamical Systems
pdf ↗ page arXiv:2103.07193 ↗

We introduce a new type of norm for ordered vector spaces majorized by a proper (convex) cone that generalizes the notions of order unit norm and base norm. Then we give sufficient conditions to ensure its completeness. In the case of normed Riesz spaces, we also present necessary completeness conditions and describe the completed norm. Finally, we define a particular family of well-behaving sets. Spaces majorized by the cone generated by these sets display surprisingly interesting structural properties. In particular, we generalize two famous standard results in Banach lattice theory. Namely, every principal ideal in a Banach lattice is an AM-space and every Banach lattice having a generating cone with a compact base admits an equivalent L-norm.

comments
13 pages. v3 corrects several false statements of v2 (Lemma 14, Theorem 21, Corollaries 16, 22, 26, 37, 38, Example 5, Proposition 30): Theorem 21 is refuted by an explicit counterexample in c_0, Theorem 18 now has a direct proof, and the statements about coherent sets are revised accordingly. "`
fields
Functional Analysis
pdf ↗ page arXiv:2111.06758 ↗

In this paper we generalize and put in a new light part of ``Fouier analysis on Number fields and Hecke's zeta function''[14] by Tate. We express the relative Euler characteristic using purely adelic language. By using certain natural normalization of Haar measure on adeles we obtain the relative Riemann-Roch theorem. In particular we show that using our relative normalization of the Haar measure on adeles we can obtain the relative Riemann-Roch theorem from the adelic Poisson summation formulae. In addition, using our methods we define the relative 'size of cohomology' numbers, i.e. extract the $h^0$ and $h^1$ part of the relative Euler characteristic. Our theory not only covers both absolute and relative cases, but also the case of an arithmetic curve and a nonsingular, projective curve over a finite field.

comments
15 pages, corrections and adding new results
fields
Number Theory
pdf ↗ page arXiv:2208.10424 ↗

This paper gives an overview of $\left(p,q\right)$-adic Fourier theory - the Fourier theory of functions from the $p$-adic numbers to the $q$-adic numbers, where $p$ and $q$ are distinct primes - which we then use to prove a novel $\left(p,q\right)$-adic generalization of Norbert Wiener's celebrated Tauberian Theorem. Letting $K$ be a metrically complete, algebraically closed local field of residue characteristic $q$, letting $C\left(\mathbb{Z}_{p},K\right)$ be the Banach space of continuous functions $\mathbb{Z}_{p}\rightarrow K$, and letting $dμ$ be a $\left(p,q\right)$-adic measure (a continuous linear functional $C\left(\mathbb{Z}_{p},K\right)\rightarrow K)$, the $\left(p,q\right)$-adic Wiener Tauberian Theorem (WTT) we prove establishes that the density of the span of translates of $dμ$'s Fourier-Stieltjes Transform implies the non-vanishing of the Radon-Nikodym derivative of $dμ$ at all points in $\mathbb{Z}_{p}$ where the derivative exists in $K$.

comments
50 pages
journal
Ultrametric Analysis and Applications 17.2 (2025): 187-232
fields
General Mathematics
pdf ↗ page arXiv:2208.11082 ↗

Let $\mathcal{H}_2$ be the Lie algebra of polynomial Hamiltonian vector fields on the symplectic plane. Let $X$ be the moduli space of stable Higgs bundles of fixed relatively prime rank and degree, or more generally the moduli space of stable parabolic Higgs bundles of arbitrary rank and degree for a generic stability condition. Let $H^*(X)$ be the cohomology with rational coefficients. Using the operations of cup-product by tautological classes and Hecke correspondences we construct an action of $\mathcal{H}_2$ on $H^*(X)[x,y]$, where $x$ and $y$ are formal variables. We show that the perverse filtration on $H^*(X)$ coincides with the filtration canonically associated to $\mathfrak{sl}_2\subset \mathcal{H}_2$ and deduce the $P=W$ conjecture of de Cataldo-Hausel-Migliorini.

comments
v3: 56 pages. Final version, expanded introduction. v2: 54 pages. Improved exposition, added many details, W-algebra setup split into arXiv:2311.13415
fields
Algebraic Geometry, Differential Geometry, Representation Theory
pdf ↗ page arXiv:2209.05429 ↗

Matlis proved a lot of homological properties of the fraction field of an integral domain. In this paper, we simplify and extend some of them from 1-dimensional (resp. rank one) cases to the higher dimensional (resp. finite rank) cases. For example, we study the weakly co-torsion property of Ext$(-,\sim)$, and use it to present splitting criteria. These are equipped with several applications. For instance, we compute the projective dimension of $\widehat{R}$ and present some non-noetherian versions of Grothendieck's localization problem. We construct a new class of co-Hopfian modules and extend Matlis' decomposability problem to higher ranks. In particular, this paper deals with the basic properties of Matlis' quadric $(Q,Q/R, \widehat{R},\overset{\sim}R).$

fields
Commutative Algebra
pdf ↗ page arXiv:2212.10332 ↗

We introduce the notion of biexactness for general von Neumann algebras, naturally extending the notion from group theory. We show that biexactness implies solidity for von Neumann algebras, and that many of the examples of solid von Neumann algebras contained in the literature are, in fact, biexact. We also give examples of certain crossed products arising from Gaussian actions that are solid but not biexact, and we give examples of certain $q$-Gaussian von Neumann algebras that are strongly solid but not biexact. The techniques developed involve studying a certain weak form of nuclear embeddings, and we use this setting to give a new description of weak exactness for von Neumann algebras, which allows us to answer several open problems in the literature about weakly exact von Neumann algebras.

comments
Implements referee suggestions. Final version
fields
Operator Algebras
pdf ↗ page arXiv:2309.10161 ↗

A dominating set of a graph $G$ is \emph{connected} if it induces a connected graph in $G$. For planar triangulations, it has been known since 1990 that every $n$-vertex triangulation with $n\ge4$ admits a connected dominating set of size at most $n/2 - 1$, and no improvement to this bound was known for over three decades. We break this longstanding barrier by showing that every $n$-vertex triangulation has a connected dominating set of size at most $10n/21$. Equivalently, every triangulation admits a spanning tree with at least $11n/21$ leaves. This result has graph drawing applications, establishing a bound for one-bend free sets and improving the known bound for simultaneous planar embeddings. The connected dominating set results extend readily to show that an $n$-vertex triangulation of a surface of Euler genus $g$ has a connected dominating set of size at most $10n/21+O(\sqrt{gn})$.

comments
Updated version with several corrections and improvements. Most notably, the use of potential functions rather than linear programs to bound the sizes of dominating sets
fields
Combinatorics
pdf ↗ page arXiv:2312.03399 ↗

In this article, we study how the absolute coregularity of a projective log pair reflects on its fundamental group. More precisely, we conjecture that for a projective klt log pair $(X,D)$ of absolute coregularity $c$ (and arbitrary dimension) the fundamental group $π_1^{\rm reg}(X,D)$ admits a normal abelian subgroup of finite index and rank at most $2c$. We prove this conjecture in the cases $0 \leq c \leq 3$, building on the almost abelianity of the fundamental groups of klt Calabi-Yau pairs of dimension $\leq 3$. In the cases $c \in \{0,1,2\}$ and fixed dimension, we can furthermore bound the index of a solvable normal subgroup. In dimension three, we are able to prove almost abelianity of the fundamental group of the regular locus for projective klt Calabi-Yau pairs.

comments
This paper is superseded by arXiv:2610.21358 with substantial corrections and improvements, in particular we prove therein in all dimensions the virtual abelianity of orbifold fundamental groups of the smooth loci of projective klt pairs with trivial and nef log anticanonical divisor
fields
Algebraic Geometry
pdf ↗ page arXiv:2401.01315 ↗

In this paper, we investigate the Cauchy problem of the fractional wave equation with time-dependent damping and the source nonlinearity $f(u)\approx |u|^p$: $$ \begin{cases} \partial_t^2u(t,x)+(-Δ)^{σ/2} u(t,x)+b(t) \partial_t u(t,x) =f(u(t,x)),\ &(t,x)\ \in [0,T)\times \mathbb{R}^N,\\ u(0,x)=u_0(x),\ \partial_tu(0,x)=u_1(x),\ &x\ \in\ \mathbb{R}^N, \end{cases} $$ where the damping coefficient behaves as $b(t)\approx (1+t)^{-β}$. We first establish local existence and uniqueness of mild and strong solutions in weighted Sobolev spaces by deriving weighted Sobolev estimates for the linear propagators and overcoming the spatial-weight coupling in the nonlinearity through the Bessel potential estimates. Then, in the subcritical and critical cases $1<p\leq p_c:=1+\frac σN$, we derive the upper estimates of the lifespan for the fractional Laplacian with $0<σ<2$ and time-dependent damping $β\in [-1, 1)$ via the framework of ordinary differential inequalities. The blow-up results, together with the global existence in the supercritical case obtained in \cite{LI}, show that the critical exponent for the fractional wave equation is $p_c=1+\fracσ{N}$ for $0<σ<2$. Moreover, combining with the lower estimate of lifespan derived in \cite{LI}, we conclude that the estimate in this paper is sharp. Note that our result for the critical case is completely new even in the classical case $b(t)=1$. We also consider the case of $β=1$, and obtain the upper estimate of the lifespan.

fields
Analysis of PDEs
pdf ↗ page arXiv:2401.10552 ↗

The aim of this article is to construct specific Poisson transforms mapping differential forms on the sphere $S^{2n+1}$ endowed with its natural CR structure to forms on complex hyperbolic space. These transforms have co-closed harmonic values, descend to the BGG (Rumin) complex, and intertwine the differential operators in that complex with the exterior derivative. Passing to the Poincaré ball model, we analyze boundary asymptotics, proving that the values of our transforms admit a continuous extension to the boundary in degrees $\leq n$. Finally, we show that composing the exterior derivative with the transform in degree $n$, one obtains an isomorphism between the kernel of the Rumin operator in degree $n$ and a dense subspace of the $L^2$-harmonic forms on complex hyperbolic space. This provides a realization of the disc rete series representations of $SU(n+1,1)$ with trivial infinitesimal character in spaces of differential forms on the compact manifold $S^{2n+1}$. These developments are motivated by a program of the third author to prove some instances of the Baum-Connes conjecture. The first part of the article is valid in a much more general setting, in particular, it is relevant for cases in which the conjecture is still open.

comments
AMSLaTeX, 34 pages, v2: small corrections and additions to improve the presentation. Accepted for publication in J. Math. Inst. Jussieu, v3: small final corrections to match published version
fields
Differential Geometry, Representation Theory
pdf ↗ page arXiv:2402.08262 ↗

We establish the prime geodesic theorem for the modular orbifold with exponent $\frac{9}{13} = 0.692307 \cdots$ in the error term. By periodicity and Heath-Brown's quadratic large sieve, we estimate the sixth moment of the error term in an approximation to the Zagier $L$-series at $s = 1$. The smooth explicit formula of Soundararajan and Young then leads to the stated exponent without recourse to subconvexity for quadratic Dirichlet $L$-functions.

comments
8 pages
fields
Number Theory
pdf ↗ page arXiv:2402.12133 ↗

We consider interacting systems particle driven by i.i.d. fractional Brownian motions, subject to irregular, possibly distributional, pairwise interactions. We show propagation of chaos and mean field convergence to the law of the associated McKean–Vlasov equation, as the number of particles $N\to\infty$, with quantitative sharp rates of order $N^{-1/2}$. Our results hold for a wide class of possibly time-dependent interactions, which are only assumed to satisfy a Besov-type regularity, related to the Hurst parameter $H\in (0,+\infty)\setminus \mathbb{N}$ of the driving noises. In particular, as $H$ decreases to $0$, interaction kernels of arbitrary singularity can be considered, a phenomenon frequently observed in regularization by noise results. Our proofs rely on a combinations of Sznitman's direct comparison argument with stochastic sewing techniques.

comments
Final accepted version. To appear in Annals of Applied Probability
fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2403.05454 ↗

We present an algebraic study of projections of conics in space onto multiple images of pinhole cameras. We study the Zariski closures of the projection images, which we call conic multiview varieties. Extending previous work for point and line multiview varieties, we use back-projected cones to describe these varieties. For two views, we determine the defining ideals of conic multiview varieties and describe their singular loci. For any number of views, we characterize when the simplest possible set-theoretic description is achieved based on the geometry of the camera centers. Finally, we investigate the complexity of the associated triangulation problem and conjecture the Euclidean distance degree for the conic multiview variety for two cameras.

fields
Algebraic Geometry
pdf ↗ page arXiv:2404.03063 ↗

Tate cohomology has been generalised by several authors using different constructions that have applications in group theory, ring theory and homotopical algebra. Therefore, there is a need for a uniform account that explains why their underlying approaches all lead to the same conclusions. The key notion in such a uniform theory is a specific completion of cohomological functors that is constructed under mild assumptions. This completion takes Tate cohomology to settings where it has never been introduced such as in condensed mathematics. Through the latter, one can define Tate cohomology for any $T1$ topological group.

comments
55 pages
fields
Group Theory
pdf ↗ page arXiv:2405.03610 ↗

This work focuses on the analysis of fully connected feed forward ReLU neural networks as they approximate a given, smooth function. In contrast to conventionally studied universal approximation properties under increasing architectures, e.g., in terms of width or depth of the networks, we are concerned with the asymptotic growth of the parameters of approximating networks. Such results are of interest, e.g., for error analysis or consistency results for neural network training. The main result of our work is that, for a ReLU architecture with state of the art approximation error, the realizing parameters grow at most polynomially. The obtained rate with respect to a normalized network size is compared to existing results and is shown to be superior in most cases, in particular for high dimensional input.

fields
Numerical Analysis
pdf ↗ page arXiv:2406.14936 ↗

In this paper, we show that the one dimensional septic nonlinear Schrödinger equation is globally well-posed in $H^s (\mathbb{R})$ when $s > 39/89$ with accompanying polynomial bounds in time. We utilize bilinear estimates to obtain improved bounds on the modified energy increment and prove new $L^{p+3}_{t,x}$ almost Morawetz estimates for the defocusing $p$-NLS adapted to the low-regularity setting, before specializing to the septic case $p=7$. These tools together allow us to reach Sobolev regularities $s<1/2$, showing for the first time a global existence result in the mass supercritical regime for a class of unbounded, discontinuous data.

fields
Analysis of PDEs
pdf ↗ page arXiv:2407.07234 ↗

We develop a framework for power-law rates of convergence of random discrete curves to Schramm Loewner Evolution (SLE). We show that a power-law rate of convergence of a suitable martingale observable gives a power-law rate of convergence of the interface to SLE, provided the discrete curves satisfy the Kemppainen-Smirnov crossing condition; the proof uses known estimates on the derivative of the SLE map. We apply the framework to the exploration process of critical site percolation on the triangular lattice, obtaining a power-law rate of convergence to SLE$_6$.

comments
The exposition was corrected and expanded
fields
Probability, Mathematical Physics, Complex Variables
pdf ↗ page arXiv:2407.10243 ↗

In this paper we study certain families of motives, which arise as direct summands of the cohomology of the Dwork family. We computationally find examples of interesting families with the following three properties. Firstly, their geometric monodromy group is Zariski dense in $\operatorname{SL}_n$. Secondly, they realise many different unipotent operators as the monodromy operator at $t = \infty$. Thirdly, all their Hodge numbers are $\leq 1$. This has consequences for Galois representations. Namely, if a nilpotent operator $N$ appears as the monodromy at $t = \infty$ in one of our families, we can construct potentially automorphic representations with $\ell$-adic monodromy given by $N$ at a fixed prime $p$. As another application, we obtain a new proof of some cases of the recent local-global compatibility theorem of Matsumoto.

comments
42 pages, comments welcome! The new version fixes some errors in the tables of hypergeometric parameters and adds the missing hypothesis that p does not divide d in the main theorem
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2407.16481 ↗

We construct Nash equilibria in mean-field portfolio games of optimal investment and hedging under relative performance concerns with exponential (CARA) utility preferences. Common noise dynamics are modeled by integer-valued random measures, for instance Poisson random measures, in addition to Brownian motions. Agents differ in individual risk aversions, competition weights, and initial capital endowments, while their contingent claim liabilities depend on both common and idiosyncratic risk factors. Mean-field equilibria are characterized by solutions to McKean-Vlasov backward stochastic differential equations with jumps, for which we prove existence and uniqueness of solutions, without assuming mean-field interaction to be small. Moreover, we show how the equilibrium can be constructed from the optimal strategy of a single-agent optimization problem (without mean-field interaction) via an appropriate projection. Using successive changes of measure, our derivation provides a decomposition of the equilibrium strategy into three components with clear interpretations. Finally, we show how a limiting mean-field game of quadratic (instead of utility-based) hedging with relative performance concerns arises for vanishing risk aversion.

comments
Improved exposition. The first version (arXiv:2408.01175v1) of this preprint has been published under the slightly different title "Common Noise by Random Measures: Mean-Field Equilibria for Competitive Investment and Hedging''; subsequent versions (with the new title) feature several new results relative to v1
fields
Optimization and Control
pdf ↗ page arXiv:2408.01175 ↗

Consider the random matrix \(\bW_n = \bB_n + n^{-1}\bX_n^*\bA_n\bX_n\), where \(\bA_n\) and \(\bB_n\) are Hermitian matrices of dimensions \(p \times p\) and \(n \times n\), respectively, and \(\bX_n\) is a \(p \times n\) random matrix with independent and identically distributed entries of mean 0 and variance 1. Assume that \(p\) and \(n\) grow to infinity proportionally, and that the spectral measures of \(\bA_n\) and \(\bB_n\) converge as \(p, n \to \infty\) towards two probability measures \(\calA\) and \(\calB\). Building on the groundbreaking work of \cite{marchenko1967distribution}, which demonstrated that the empirical spectral distribution of \(\bW_n\) converges towards a probability measure \(F\) characterized by its Stieltjes transform, this paper investigates the properties of \(F\) when \(\calB\) is a general measure. We show that \(F\) has an analytic density at the region near where the Stieltjes transform of $\calB$ is bounded. The density closely resembles \(C\sqrt{|x - x_0|}\) near certain edge points \(x_0\) of its support for a wide class of \(\calA\) and \(\calB\). We provide a complete characterization of the support of \(F\). Moreover, we show that \(F\) can exhibit discontinuities at points where \(\calB\) is discontinuous.

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

Reservoir computing (RC) is an effective method for predicting chaotic systems by using a high-dimensional dynamic reservoir with fixed internal weights, while keeping the learning phase linear, which simplifies training and reduces computational complexity compared to fully trained recurrent neural networks (RNNs). Quantum reservoir computing (QRC) uses the exponential growth of Hilbert spaces in quantum systems, allowing for greater information processing, memory capacity, and computational power. However, the original QRC proposal requires coherent injection of inputs multiple times, complicating practical implementation. We present a hybrid quantum-classical approach that implements memory through classical post-processing of quantum measurements. This approach avoids the need for multiple coherent input injections and is evaluated on benchmark tasks, including the chaotic Mackey-Glass time series prediction. We tested our model on two physical platforms: a fully connected Ising model and a Rydberg atom array. The optimized model demonstrates promising predictive capabilities, achieving a higher number of steps compared to previously reported approaches.

comments
11 pages, 11 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2409.09886 ↗

Guarded recursion is a framework allowing for a formalisation of streams in classical (as opposed to concurrent, probabilistic, quantum) programming languages. The latter take their semantics in cartesian closed categories. However, some programming paradigms do not take their semantics in a cartesian setting; this is the case for concurrency, reversible and quantum programming for example. In this paper, we focus on reversible programming through its categorical model in dagger categories, which are categories that contain an involutive operator on morphisms. We show how to introduce the framework of guarded recursion into dagger categories with sufficient structure for data types, also called dagger rig categories. First, given an arbitrary category, we build another category shown to be suitable for guarded recursion in multiple ways, via enrichment and fixed point theorems. We then study the interaction between this construction and the structure of dagger rig categories, aiming for reversible programming. Finally, we show that our construction is suitable as a model of higher-order reversible programming languages, such as symmetric pattern matching, to which we add guarded recursion features.

comments
MFPS'26 Proceedings
fields
Category Theory
pdf ↗ page arXiv:2409.14591 ↗

We prove asymptotic results for the singular series associated to the distribution of three primes. Assuming a quantitative version of Hardy and Littlewood's conjecture on prime 3-tuples, we deduce an asymptotic formula related to the joint distribution of three primes. This improves recent results of Kuperberg and completes results by Montgomery and Soundararajan. Following the Montgomery and Soundararajan approach, we derive conjectural applications to the distribution of primes in short intervals.

comments
in French language. Some erros have been corrected. In particular, the factor in the main theorem is 9/4
fields
Number Theory
pdf ↗ page arXiv:2410.02480 ↗

We introduce contextads and the Ctx construction, unifying various structures and constructions in category theory dealing with context and contextful arrows—comonads and their Kleisli construction, actegories and their Para construction, adequate triples and their Span construction. Contextads are defined in terms of Lack–Street wreaths, suitably categorified for pseudomonads in a tricategory of spans in a 2-category with display maps. The associated wreath product provides the Ctx construction, and by its universal property we conclude trifunctoriality. This abstract approach lets us work up to structure, and thus swiftly prove that, under very mild assumptions, a contextad equipped colaxly with a 2-algebraic structure produces a similarly structured double category of contextful arrows. We also explore the role contextads might play qua dependently graded comonads in organizing contextful computation in functional programming. We show that many side-effects monads can be dually captured by dependently graded comonads, and gesture towards a general result on the `transposability' of parametric right adjoint monads to dependently graded comonads.

comments
120 pages, used to be titled "Contextads as Wreaths; Kleisli, Para, and Span Constructions as Wreath Products". The page count increased for formatting reasons, content is mostly the same up to some fixes and twiddles
fields
Category Theory
pdf ↗ page arXiv:2410.21889 ↗

We characterize varieties of Fano type in terms of potentially log canonical pairs and birational Zariski decompositions. We also prove the existence of anticanonical minimal models of a potentially lc pair $(X,Δ)$ under the assumptions that no potentially log canonical centers are contained in the augmented base locus of $-(K_X+Δ)$ and that $-(K_X+Δ)$ is a big $\mathbb{Q}$-Cartier divisor admitting a birational Zariski decomposition with NQC positive part. This can be considered as an anticanonical analogue of the results by Birkar–Hu.

comments
Several gaps in the previous versions have been fixed
fields
Algebraic Geometry
pdf ↗ page arXiv:2411.04628 ↗

We extend the theory of topological recursion by considering Airy structures whose partition functions are highest weight vectors of particular $\mathcal{W}$-algebra representations. Such highest weight vectors arise as partition functions of Airy structures only under certain conditions on the representations. In the spectral curve formulation of topological recursion, we show that this generalization amounts to adding specific terms to the correlators $ ω_{g,1}$, which leads to a ``shifted topological recursion'' formula. We then prove that the wave-functions constructed from this shifted version of topological recursion are WKB solutions of families of quantizations of the spectral curve with $ \hbar$-dependent terms. In the reverse direction, starting from an $\hbar$-connection, we find that it is of topological type if the exact same conditions that we found for the Airy structures are satisfied. When this happens, the resulting shifted loop equations can be solved by the shifted topological recursion obtained earlier.

comments
49 pages, 1 figure. Accepted manuscript
journal
Communications in Mathematical Physics, 406 (2025), no. 11, paper No. 274, 71 pp
fields
Mathematical Physics, Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2412.09120 ↗

We initiate the study of the $L^2$-Betti numbers of group-theoretic Dehn fillings. For a broad class of virtually special groups $G$, we prove that the $L^2$-Betti numbers of sufficiently deep Dehn fillings $\overline{G}$ are equal to those of $G$. As applications, we verify the Singer Conjecture for certain Einstein manifolds, establish a virtual fibering criterion for $\overline{G}$, obtain bounds on deficiency of $\overline{G}$, and provide new examples of hyperbolic groups with exotic subgroups that arise as Dehn fillings of any cusped arithmetic hyperbolic manifold of dimension at least four.

comments
60 pages, 1 figure. Minor revisions following referees' comments. To appear in Duke Math. J
fields
Group Theory, Algebraic Topology, Differential Geometry, Geometric Topology
pdf ↗ page arXiv:2412.16090 ↗

Aougab and Gaster [Math. Proc. Cambridge Philos. Soc. 174 (2023), 569-584] proved that any set of simple closed curves on the torus, where any two are non-homotopic and intersect at most k times, has a maximum size of $k+O(\sqrt{k}\log k)$. We determine the maximum size of such a set for every k. In particular, the maximum never exceeds k+6, and it does not exceed k+4 when k is large. As this quantity coincides with the maximal number of columns of a generic k-modular matrix with two rows, our result also settles the column number problem, a problem of interest in combinatorial optimization, for such matrices.

comments
Version 2 was a major update of the original version - we determined the maximum exactly for all k (instead of for sufficiently large k as in the original version). Version 4 added a discussion on the column number problem
fields
Combinatorics, Geometric Topology
pdf ↗ page arXiv:2412.18002 ↗

This article studies large solutions, for a class of quasi-linear equations involving p-Laplacian on the infinite cylindrical domains. We study the wellposedness of weak large solutions on infinite cylinders by the convergence of large solutions on finite cylinders and observe that any such solution coincides with the large solution on its cross-section. Finally, the results are generalized to a class of operators involving non-linearity in the gradient.

journal
Nonlinear Differ. Equ. Appl. 33, 41 (2026)
fields
Analysis of PDEs
pdf ↗ page arXiv:2412.18968 ↗

High-quality matches between patients and primary care providers improve downstream health outcomes, yet provider turnover breaks these matches and forces patients to be reassigned. Health systems facing this problem must decide not only which providers to recommend, but how much choice to offer. Direct assignment avoids competition for scarce provider capacity but relies on noisy estimates of patient preferences; broader choice allows patients to correct these estimates using private information but can create costly coordination failures. We study this tradeoff through the design of fixed, personalized menus from which patients choose providers. We show that constructing the optimal menu is NP-hard and establish an information-theoretic lower bound. We find that offering each patient a single provider matches this bound up to a constant factor, while unrestricted choice can perform arbitrarily poorly. However, we show that additional choice improves on single-provider assignment when the system cannot reliably distinguish among a patient's alternatives. We formalize this tradeoff through two forms of loss: menu loss, which arises when menus offer too few options, and coordination loss, which arises when scarce capacity is exposed to too much choice. Motivated by this decomposition, we develop the Scenario-Averaged Marginals (SAM) algorithm, which tailors menus based on provider shadow prices so choice is offered only when utility exceeds the capacity cost. We identify sufficient conditions which SAM's regret matches the lower bound, namely when patients have valuable alternatives and offered menus don't create competition for scarce capacity. In a semi-synthetic environment calibrated to a provider network using Medicare data, SAM improves total utility by up to 19% over single-provider assignment as preference uncertainty grows, while improving utility for the least-served ZIP codes.

fields
Optimization and Control
pdf ↗ page arXiv:2502.10353 ↗

We derive and rigorously prove the path-kernel formula for the linear response of stochastic differential equations, namely, the derivative of averaged statistics with respect to a model parameter. The parameter may affect the diffusion coefficient, as well as the drift coefficient and initial condition. No hyperbolicity assumption is required. The proof introduces a single change of variables for the state path that transfers part of the unstable path perturbation to differentiation of the probability kernel. We also derive a pathwise Monte Carlo algorithm for estimating the response and demonstrate it on the 40-dimensional noisy Lorenz–96 system.

comments
32 pages, 7 figures. Accepted for publication in Statistics and Computing
fields
Probability, Dynamical Systems, Numerical Analysis
pdf ↗ page arXiv:2503.00718 ↗

We introduce a novel kernel-based framework for learning differential equations and their solution maps. The framework is efficient in its data requirements in terms of the number of observed states and the amount of data available per state. Our formulation also allows us to employ efficient Gauss-Newton-type optimization algorithms in the training procedure to improve accuracy and speed of the training procedure. We also support our algorithm with rigorous theoretical guarantees in the form of quantitative worst-case error bounds for the learned equation that can be extended to the subsequent solution operators under smoothness assumptions. Numerical benchmarks demonstrate significant improvements in computational complexity and robustness while achieving one to two orders of magnitude improvements in terms of accuracy compared to certain state-of-the-art algorithms.

fields
Numerical Analysis
pdf ↗ page arXiv:2503.01036 ↗

Working in the setting of ideally exact categories, we investigate the representability of actions of unital non-associative algebras over a field. We show that, in general, such categories fail to be action representable: for instance, the category of all unital algebras is not even action accessible. We then consider this problem in the context of operadic, action accessible, unit-closed varieties. Using the construction of the external weak actor, we prove that for any algebra $X$ in such a variety $\mathcal{V}$, the canonical map into its external weak actor is an isomorphism if and only if $X$ is unital. Consequently, the ideally exact category $\mathcal{V}_1$ of unital algebras in $\mathcal{V}$ is action representable, and the actor of a unital algebra $X$ is $X$ itself. The action accessibility of $\mathcal{V}$ is not necessary for this conclusion: in characteristic zero, unital Jordan algebras form an action representable category, although the variety of all Jordan algebras is not action accessible. Finally, we prove action representability for the categories of unital Poisson algebras and unital commutative Poisson algebras.

comments
New result on unital Jordan algebras (Proposition 5.9); partial algebras now as in arXiv:2610.18302; corrected proof of Proposition 4.11; Section 6 now based on arXiv:2611.02097
fields
Category Theory, Rings and Algebras
pdf ↗ page arXiv:2503.04488 ↗

What one obtains when the min-max methods for the distance function are applied on the space of pairs of points of a Riemannian two-sphere? This question is studied in details in the present article. We show that the associated min-max width do not always coincide with half of the length of a simple closed geodesic which is the union of two minimizing geodesics with the same endpoints. Therefore, it is a new geometric invariant. We study the structure of the set of minimizing geodesics joining a pair of points realizing the width, and relationships between this invariant and the diameter. The extrinsic case of an embedded Riemannian sphere is also considered.

comments
43 pages, 5 figures. Further arguments provided or improved in several proofs and examples. The results of the article remain unchanged
fields
Differential Geometry
pdf ↗ page arXiv:2503.12477 ↗

In this paper, we introduce $\mathcal{D}^+_J$, a generalization of $\partial\bar{\partial}$ operator on higher dimensional almost Kähler manifolds. Using the $\mathcal{D}^+_J$ operator, we investigate the $\bar{\partial}$-problem in almost Kähler geometry and explore the generalized Monge-Ampère equation on almost Kähler manifolds. We establish uniqueness up to an additive constant. We also prove a local existence theorem for this equation on almost Kähler four-manifold. At last, we find an elliptical system for $\mathcal{D}^+_J$ operator. As an application, we reorganize the result of Tosatti-Weinkove-Yau in \cite{TWY}.

fields
Differential Geometry
pdf ↗ page arXiv:2503.14101 ↗

We prove the full Fock–Goncharov conjecture for the $\mathcal{A}_{SL_2,Σ_{g,p}}$-cluster variety associated with the moduli space of decorated twisted $SL_2$-local systems on triangulable surfaces $Σ_{g,p}$ with at least two punctures. Equivalently, we show that the tagged skein algebra $Sk^{ta}(Σ)$, identified with the middle cluster algebra $\mathrm{mid}(\mathcal{A})$, coincides with the upper cluster algebra $U(Σ)$. Inspired by the work of Shen–Sun–Weng, we introduce a localized cluster variety $\mathring{\mathcal{A}}$ whose positive real locus is the decorated Teichmüller space $\mathcal{T}^d(Σ)$. For $p\geq2$, its ring of global sections is the normalization of the classical Roger–Yang skein algebra $Sk^{RY}_{q\to1}(Σ)$ and equals that algebra except for the four-punctured sphere. In the equality cases, the quantum Roger–Yang skein algebra $Sk^{RY}_q(Σ)$ provides a quantization of this global-section ring. We prove normality of $Sk^{ta}(Σ)$ for $p\geq2$, complementing its known Gorenstein property, and normality of $Sk^{RY}_{q\to1}(Σ)$ for every triangulable $Σ_{g,p}$ other than $Σ_{0,4}$. We also prove finite generation of $U(Σ_{g,p})$ for every triangulable $Σ_{g,p}$, including the once-punctured case.

comments
28 pages, 7 figures; v5: mistakes corrected, references added
fields
Commutative Algebra, Algebraic Geometry, Geometric Topology, Representation Theory
pdf ↗ page arXiv:2503.15037 ↗

An independent transversal in a multipartite graph is an independent set that intersects each part in exactly one vertex. We show that for every even integer $r\ge 2$, there exist $c_r>0$ and $n_0$ such that every $r$-partite graph with parts of size $n\ge n_0$ and maximum degree at most $rn/(2r-2)-t$, where $t=o(n)$, contains at least $c_r t n^{r-1}$ independent transversals. This is best possible up to the value of $c_r$. Our result confirms a conjecture of Haxell and Szabó from 2006 and partially answers a question raised by Erdős in 1972 and studied by Bollobás, Erdős and Szemerédi in 1975. We also show that, given any integer $s\ge 2$ and even integer $r\ge 2$, there exist $c_{r,s}>0$ and $n_0$ such that every $r$-partite graph with parts of size $n\ge n_0$ and maximum degree at most $rn/(2r-2)- c_{r, s} n^{1-1/s}$ contains an independent set with exactly $s$ vertices in each part. This is best possible up to the value of $c_{r, s}$ if a widely believed conjecture for the Zarankiewicz number holds. Our result partially answers a question raised by Di Braccio and Illingworth recently.

comments
Accepted for publication in Forum of Mathematics, Sigma. 16 pages, 2 figures
fields
Combinatorics
pdf ↗ page arXiv:2504.03950 ↗

Differential Privacy (DP) is being increasingly adopted for non-Euclidean data that lie on complex, high-dimensional manifolds. Existing DP mechanisms for manifold data consider geometric properties when calibrating privacy perturbations, but they largely fail to capture variations in data density within datasets, leading to biased perturbations and suboptimal privacy-utility trade-offs due to heterogeneous data distributions. In this paper, we propose a novel density-aware differential privacy mechanism on Riemannian manifolds, referred to as Conformal-DP, that leverages conformal transformations to calibrate perturbations based on local densities and to induce a density-balanced geometry. We prove that our mechanism satisfies $ε$-differential privacy on any complete Riemannian manifold under mild regularity assumptions. In addition, we derive a closed-form expected geodesic error bound that depends only on the underlying data density ratio and is independent of global curvature. Our empirical results on synthetic and real-world datasets demonstrate that the proposed Conformal-DP mechanism substantially improves the privacy-utility trade-off in heterogeneous data distribution settings, with worst-case performance comparable to state-of-the-art manifold DP mechanisms that assume uniformly distributed data.

comments
Accepted on IEEE Transactions on Dependable and Secure Computing
journal
10.1109/TDSC.2026.3727588
fields
Differential Geometry
pdf ↗ page arXiv:2504.20941 ↗

We consider decentralized optimization over a compact Riemannian submanifold in a network of $n$ nodes, where each node $i$ owns a smooth nonconvex local objective $f_i$ defined by its private data, and the goal is to minimize the global objective $F(x)=\frac{1}{n}\sum_{i=1}^n f_i(x)$ using only local communications. A naive Riemannian extension of EXTRA leaves the auxiliary normal-space error uncontrolled and does not inherit the Euclidean convergence guarantees. We develop projection-based Riemannian EXTRA (REXTRA) and a retraction-based counterpart that incorporate a normal correction into both the communicated variable and the auxiliary update, while using only one local-variable-sized message per optimization iteration. By jointly controlling consensus, tangent, and normal errors, our analysis interprets the update as a network-based Riemannian inexact-gradient step. For projection-based REXTRA, a sufficiently small constant stepsize and a local initialization yield vanishing consensus, stationary accumulation points, and an $\mathcal O(1/k)$ best-iterate stationarity–consensus bound. For the retraction-based method, we prove that its difference from the projection update is uniformly second order and establish the same convergence properties and rate under a local initialization. Numerical experiments on representative manifold-valued learning tasks demonstrate the communication efficiency of the REXTRA updates.

comments
21 pages
fields
Optimization and Control
pdf ↗ page arXiv:2505.15537 ↗

Conformal Prediction (CP) is a popular framework for constructing prediction bands with valid coverage in finite samples, while being free of any distributional assumption. A well-known limitation of conformal prediction is the lack of adaptivity, although several works introduced practically efficient alternate procedures. In this work, we build upon recent ideas that rely on recasting the CP problem as a statistical learning problem, directly targeting coverage and adaptivity. This statistical learning problem is based on reproducible kernel Hilbert spaces (RKHS) and kernel sum-of-squares (SoS) methods. First, we extend previous results with a general representer theorem and exhibit the dual formulation of the learning problem. Crucially, such dual formulation can be solved efficiently by accelerated gradient methods with several hundreds or thousands of samples, unlike previous strategies based on off-the-shelf semidefinite programming algorithms. Second, we introduce a new hyperparameter tuning strategy tailored specifically to target adaptivity through bounds on test-conditional coverage. This strategy, based on the Hilbert-Schmidt Independence Criterion (HSIC), is introduced here to tune kernel lengthscales in our framework, but has broader applicability since it could be used in any CP algorithm where the score function is learned. Finally, extensive experiments are conducted to show how our method compares to related work. All figures can be reproduced with the accompanying code at \href{https://www.gitlab.com/drti/ksos-bands}{gitlab.com/drti/ksos-bands}.

journal
Advances in Neural Information Processing Systems 38 (NeurIPS 2025), Dec 2025, San Diego, United States
fields
Statistics Theory
pdf ↗ page arXiv:2505.21039 ↗

In 2010 Banderier and Nicodeme consider the height of bounded discrete bridges and conclude to a limiting Rayleigh distribution. This result is correct although their proof is partly erroneous. They make asymptotic simplifications based upon dominance properties of the roots of the kernel of the walk within a disk centered at the origin, but these dominance properties apply only upon a positive real segment. However the very good agreement of simulations with their asymptotic expansion of the probability distribution in case of Łukasiewicz bridges let us think that their proof could be corrected. This is the scope of the present article which provides a proof using the dominance property only in its domain of validity. We also consider the case of periodic walks, a topic not considered in Banderier-Nicodeme2010..

comments
43 pages, 6 figures including 11 PDF files (1 of them Maple worksheet) Introduction (4 pages) added, sections 5.2.1 and 5.2.2, remarks 6 and 7 pushed to appendix
fields
Probability
pdf ↗ page arXiv:2506.02982 ↗

Previously we found a unique quantum system with a positive gauge-invariant Weyl-Stratonovich quasi-probability density function which can be defined by the so-called «quadratic funnel» potential. In this work we have constructed a class of exact solutions to the 3D Schrödinger equation for a two-parameter «quadratic funnel» potential based on the $Ψ$ -model of micro and macro systems. It should be noted that the Aharonov-Bohm effect is inherent in the quantum $Ψ$ -model. Explicit expressions for the energy spectrum and the set of eigenfunctions have been found. Using gauge invariance for scalar and vector potentials, a solution to the electromagnetic Schrödinger equation has been obtained, with a magnetic field in the form of a «Dirac string» defined by a singular vortex probability flux field. Superpositions of eigenfunctions leading to various types of vortex and potential probability current fields have been investigated in detail. The analysis of the quantum system's properties has been carried out within the Wigner-Vlasov formalism.

comments
32 pages, 6 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2506.04725 ↗

We study the persistence and internal dynamics of invariant graphs for dissipative twist maps. Explicit $C^1$ persistence and parameter estimates allow every real rotation number to be realized by varying either translation parameter, while arbitrarily small zero-mean analytic perturbations at fixed irrational horizontal parameters can yield analytic graphs with dynamics conjugate to rational rotations. With a fixed Brjuno horizontal parameter and fixed-strip analyticity, normally attracting $C^r$ graphs persist under perturbations of size $(1-λ)^γ$, for any $γ>0$ and prescribed finite $r$, as $λ\to1^-$. At the critical Lipschitz bound, the invariant graphs can carry Denjoy dynamics and have countably many nondifferentiable points, with perturbations smooth outside a null Cantor set and tending to zero in every Hölder norm of order less than one.

fields
Dynamical Systems, Symplectic Geometry
pdf ↗ page arXiv:2506.04938 ↗

We develop categorical foundations of discrete dynamical systems, aimed at understanding how the structure of the system affects its dynamics. We introduce the notion of cycle sets to analyze attractors of a system, and use this to generalize multiple decomposition theorems of Kadelka, Veliz-Cuba, Murrugarra, and the last two authors from Boolean networks to arbitrary discrete dynamical systems.

comments
41 pages; comments still welcome
journal
Compositionality, Volume 8, Issue 6 (2026)
fields
Dynamical Systems, Category Theory
pdf ↗ page arXiv:2506.05190 ↗

The steady motion of a viscous incompressible fluid in distorted pipes, of finite length, is modeled through the Navier-Stokes equations with mixed boundary conditions: the inflow is given by an arbitrary member of the Lions-Magenes class with positive influx, and the fluid motion is subject to a directional do-nothing boundary condition on the outlet, together with the standard no-slip assumption on the remaining walls of the domain. Existence of a weak solution to such Navier-Stokes system is proved without any restriction on the data (that is, inlet velocity and external force) by means of the Leray-Schauder Principle, in which the required a priori estimate is obtained by a contradiction argument that employs Bernoulli's law for solutions of the stationary Euler equations, as well as some properties of harmonic divergence-free vector fields. Under a suitable smallness assumption on the data, we also prove the unique solvability of the boundary-value problem.

fields
Analysis of PDEs
pdf ↗ page arXiv:2506.07331 ↗

We generalize the Calderon-Zygmund methodology for operator analysis and the Rokhlin-Greengard fast multipole algorithms, in which the domain and range of an operator are jointly organized. Our methods analyze unstructured kernels by uncovering the joint hidden geometries of their domain and range. The main tool is the Questionnaire algorithm, an iterative procedure that constructs adaptive bi-hierarchical partition trees that reveal latent multiscale organization and local low-rank structure in the kernel. When the geometry is unknown, the iteration starts from any initial affinity, even a random one, and, with a stochastic flip perturbation and a spectral space-filling curve that fixes the left-right order of every tree, reorganizes the matrix into an image of the operator's "phase space": the joint space of its sources and sensors, in duality, as positions and frequencies are for the Fourier transform. This ordering gives the phase space an analytic structure on which any classical transform can be carried out; the resulting compression is direct evidence of that structure. Guided by these geometries, we obtain efficient factorizations and fast matrix-vector products in two ways: (1) the Butterfly algorithm, which exploits the learned bi-hierarchical localized low-rank structure; and (2) the adaptive eGHWT, which selects best tilings in space and sequency from all levels of generalized Haar-Walsh wavelet packets. We call the resulting algorithms the Questionnaire Factorization and Fast Transform (QFFT). Unlike classical approaches requiring prior knowledge of the geometry, QFFT is fully data-driven and applies to matrices from irregular or unknown distributions. We demonstrate it on heterogeneous oscillatory operators and on orthogonal eigenvector expansions with high multiplicity and random sampling, reducing storage from O(N^2) to O(N log N) and enabling fast, scalable computation.

fields
Numerical Analysis
pdf ↗ page arXiv:2506.11990 ↗

With the aim of defining robust losses for the neural network approximation of partial differential equations, we study, in a general setting, a posteriori estimates used in finite element analysis. We show that the error is equivalent to the sum of two residuals provided that the underlying variational formulation is well-posed. The first contribution is the projection of the residual to a finite-dimensional space and is therefore computable, while the second one can be reliably estimated by a computable upper bound in many practical scenarios. Two important applications can be considered during the neural network optimization (training) process: first, the computable lower bound is used as loss functional and both contributions are used to monitor the error at each solver step; or second, the two estimators are included in the loss functional, thereby providing total control over the error. As a model problem, we consider a second-order elliptic partial differential equation and discuss several variational formulations, including different approaches for incorporating boundary conditions into the estimators. Various numerical experiments are presented to validate our findings.

fields
Numerical Analysis
pdf ↗ page arXiv:2507.06017 ↗

We explore an analogy between, on one hand, the notions of integral closure of ideals and Rees valuations in commutative algebra and, on the other hand, the notions of spectral seminorm and Shilov boundary in nonarchimedean geometry. For any Tate ring $\mathcal{A}$ with a Noetherian ring of definition $\mathcal{A}_{0}$ and pseudo-uniformizer $\varpi\in\mathcal{A}_{0}$, we prove that the Shilov boundary for $\mathcal{A}$ naturally coincides with the set of Rees valuation rings of the principal ideal $(\varpi)_{\mathcal{A}_{0}}$ of $\mathcal{A}_{0}$. Furthermore, we characterize the Shilov boundary for a wide class of Tate rings by means of minimal open prime ideals in the subring of power-bounded elements. For affinoid algebras, in the sense of Tate, whose underlying rings are integral domains, this recovers a well-known result of Berkovich. Moreover, under some mild assumptions, we prove stability of our characterization of the Shilov boundary under (completed) integral extensions. In particular, for every mixed-characteristic Noetherian domain $R$, we obtain a description of the Shilov boundary for the Tate ring $\widehat{R^{+}}[p^{-1}]$, where $\widehat{R^{+}}$ is the $p$-adic completion of the absolute integral closure of the domain $R$.

comments
86 pages. Revised final version. To appear in the Journal of the London Mathematical Society
fields
Commutative Algebra, Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2507.07091 ↗

This article is the second in a series of works on the fuzzy Landau equation, which describes particles interacting through delocalised Coulomb-type collisions. The spatial interaction is modulated by a kernel. We establish the existence of global-in-time H-solutions for exponentially decaying spatial kernels on the whole space and for kernels bounded above and below by positive constants, including periodised kernels on the torus. For the latter class, we further study the propagation of velocity moments and $L^p$-bounds.

fields
Analysis of PDEs
pdf ↗ page arXiv:2507.10288 ↗

We study the structure of invariant measures for continuous automorphisms of compact metrizable abelian groups satisfying the descending chain condition. We show that the finitely supported invariant measures are weak-* dense in the space of all invariant probability measures, and that if the system is ergodic with respect to Haar measure, then the finitely supported ergodic invariant measures are also dense. A key ingredient in the proof is a variant of the specification property, which we establish for the ergodic systems in this class. Our results also yield the following two consequences: first, that every finitely generated group that is a semidirect product of $\mathbb{Z}$ with a countable abelian group $G$ is Hilbert-Schmidt stable; and second, a Livshitz-type theorem characterizing the uniform closure of coboundaries arising from continuous functions in terms of vanishing on periodic orbits. We also construct an example showing that, in general dynamical systems, the property of having dense finitely supported invariant measures does not pass to product systems.

comments
Accepted version
fields
Dynamical Systems, Group Theory
pdf ↗ page arXiv:2507.14113 ↗

We present a unified framework for multipartite entanglement characterization based on the conditional gradient (CG) method, incorporating both fast heuristic detection and rigorous witness construction with numerical error control. Our method enables entanglement certification in quantum systems of up to ten qubits and applies to arbitrary entanglement structures. We demonstrate its power by closing the gap between entanglement and separability bounds in white-noise robustness benchmarks for a class of bound entangled states. Furthermore, the framework extends to entanglement robustness under general quantum noise channels, providing accurate thresholds in cases beyond the reach of previous algorithmic methods. These results position CG methods as a powerful tool for practical and scalable entanglement analysis in realistic experimental settings.

comments
6+10 pages, 12 figures; close to the published version
journal
Phys. Rev. A 114, L050401 (2026)
fields
Optimization and Control
pdf ↗ page arXiv:2507.17435 ↗

This paper focus on the symmetry and symmetry breaking about the second order Hydrogen Uncertainty Principle. \emph{Firstly}, by choosing a suitable test function, we give a negative answer to the conjecture presented by Cazacu, Flynn and Lam in [\emph{J. Funct. Anal.} \textbf{283} (2022), Paper No. 109659, 37 pp] for $N\in\{2,3\}$, and emphasizing the symmetry breaking phenomenon. \emph{Secondly}, we obtain a family of sharp weighted second order Hydrogen Uncertainty Principle, and prove the extremal functions are radial, which extends the work of Duong and Nguyen [The sharp second order Caffareli-Kohn-Nirenberg inequality and stability estimates for the sharp second order uncertainty principle, arXiv:2102.01425].

fields
Analysis of PDEs
pdf ↗ page arXiv:2508.15221 ↗

The study of categories abstracting the structural properties of relations has been extensively developed over the years, resulting in a rich and diverse body of work. In a previous paper we offered a survey providing a modern presentation of these ``categories for relations'' as instances of gs-monoidal categories, showing how they arise as Kleisli categories of suitable symmetric monoidal monads. The end result was a taxonomy that organised numerous related concepts in the literature, including in particular Markov and restriction categories. This paper further enriches the taxonomy: it proposes two categories that are once more instances of gs-monoidal categories, yet more abstract than Markov and restriction categories. They are characterised by an axiomatic notion of mass and domain of an arrow, the latter one of the key ingredients of restriction categories, which generalises the domain of partial functions. The paper then introduces mass and domain preserving monads, proving that the associated Kleisli categories in fact preserve the corresponding equations and that these monads arise naturally for the categories of semiring-weighted relations.

comments
MFPS 2026 Proceedings version
fields
Category Theory
pdf ↗ page arXiv:2508.20054 ↗

We introduce RaNNDy, a randomized neural network framework for learning transfer operators and their spectral decompositions. By fixing the weights of the hidden layers and training only the output layer, RaNNDy achieves significant reductions in computational costs -- often by two orders of magnitude -- with similar accuracy compared to state-of-the-art deep learning methods. The method is less sensitive to hyperparameter tuning and provides a closed-form solution for the output layer weights that directly represent eigenfunctions of the learned operator. Moreover, it is possible to estimate uncertainties associated with the computed spectral properties via ensemble learning. We demonstrate the efficacy of the proposed approach using diverse benchmark problems, including stochastic dynamical systems and protein folding processes, highlighting the strengths but also weaknesses of RaNNDy.

fields
Dynamical Systems
pdf ↗ page arXiv:2509.19930 ↗

This paper develops a unified framework for studying the cohomology and constructing $L^2$-bounded commuting interpolation operators for finite element complexes, such as the Hessian, divdiv, elasticity and Stokes complexes. Compared with the standard de Rham complex, these complexes present additional challenges arising from algebraic constraints on tensor fields, such as symmetry and tracelessness, as well as additional smoothness requirements. The main ingredient of our framework is a direct sum decomposition of finite element complexes into skeletal and bubble parts. To establish this decomposition, we introduce two key structures: trace structures and generalized currents. In this decomposition, the bubble part is characterized by bubble complexes associated with subsimplices of different dimensions, including vertices, edges, and faces. We prove that the exactness of the resulting bubble complexes ensures that the finite element complex has the correct cohomology. Based on this decomposition, we further construct $L^2$-bounded interpolation operators for these finite element complexes.

fields
Numerical Analysis
pdf ↗ page arXiv:2509.23788 ↗

Let $A$ be a finite-dimensional algebra and $e$ a rigid presentation. We give an explicit formula for the left adjoint to the inclusion $\operatorname{rep}(e^\perp)\hookrightarrow \operatorname{rep}(A)$ and construct a bijection between presentations in $\operatorname{rep}(e^\perp)$ and presentations compatible with $e$. The induced bijection on weights preserves generic $\operatorname{E}$-invariants and canonical decompositions. If $A$ is Jacobian, the reduction algebra is Jacobian for every rigid $e$. We prove mutation formulas for the signed completions and for the dimension vectors of the simple objects of $\operatorname{rep}(e^\perp)$, enabling an algorithm to find the projected quiver with potential when $e$ is extended-reachable. Additionally, we introduce a modified projection for quivers with potentials that preserves general presentations. For applications to cluster algebras, we establish a connection to the stabilization functors.

comments
39 pages. Comments are welcome. Final version to appear ART
fields
Representation Theory, Rings and Algebras
pdf ↗ page arXiv:2510.01615 ↗

We study the moduli space of parabolic connections of rank two on the complex projective line $\mathbb{P}^1$ minus five points with fixed spectral data. We prove a cohomological vanishing theorem for tensor products of four natural vector bundles on the moduli stack of $ν$-${\mathfrak sl}_2$-parabolic connections. We also compute the cohomology of the structure sheaf and give an explicit geometric description of a compactification of this moduli space, using $ε$-connections and the birational geometry of $\mathbb{P}^2 \times (\mathbb{P}^2)^{\vee}$. As an application, we construct a universal family of twisted $D$-modules whose fibers satisfy an orthogonality property over a dense open subset. These results are motivated by Arinkin's approach to the tamely ramified geometric Langlands correspondence.

comments
I have revised both the statements and the proofs of Proposition 5.5 and Corollary 5.6. Since the proof of Proposition 5.7 is incomplete, I have also added the phrase 'Under the hypothesis of Proposition 5.5' to the statement of Theorem 1.4 in Section 1.2
fields
Algebraic Geometry
pdf ↗ page arXiv:2510.12578 ↗

Increasingly in recent years, probabilistic computation has been investigated through the lenses of categorical algebra, especially via string diagrammatic calculi. Whereas categories of discrete and Gaussian probabilistic processes have been thoroughly studied, with various axiomatisation results, more expressive classes of continuous probability are less understood, because of the intrinsic difficulty of describing infinite behaviour by algebraic means. In this work, we establish a universal construction that adjoins infinite tensor products, allowing continuous probability to be investigated from discrete settings. Our main result applies this construction to $\mathsf{FinStoch}$, the category of finite sets and stochastic matrices, obtaining a category of locally constant Markov kernels, where the objects are finite sets plus the Cantor space $2^{\mathbb{N}}$. Any probability measure on the reals can be reasoned about in this category. Furthermore, we show how to lift axiomatisation results through the infinite tensor product construction. This way we obtain an axiomatic presentation of continuous probability over countable powers of $2=\lbrace 0,1\rbrace$.

comments
20 pages. v2: The universal construction is presented in greater generality, and we compare it with the previous approach. Brief discussions of recent preprints have also been added. v3: Minor corrections and exposition improvements following reviewers' comments. v4: MFPS Proceedings version
fields
Category Theory
pdf ↗ page arXiv:2510.14716 ↗

Standard dropout applies a fixed, uniform noise rate to all units, ignoring available gradient information. We propose momentum adaptive gradient dropout (MAGDrop), a Bayesian linear layer that adapts per-unit weight noise by tracking an exponential moving average of gradient magnitudes. Units with large recent gradient magnitudes receive less noise to preserve learned features; units with below-average gradient magnitudes receive more noise to promote exploration. This adaptation transforms the classifier head into a data-dependent Bayesian predictor whose mean predictor has no additional inference cost. Our primary contribution is a certificate-aware low-rank posterior, MAGDrop-Subspace, that addresses the tension between strong accuracy and tight bounds from probably approximately correct (PAC)-Bayes theory. A full-head stochastic posterior incurs a Kullback–Leibler (KL) divergence of approximately 8,625 nats. By confining the posterior to an $r$-dimensional subspace constructed from an independent prior-construction sample $S_0$ and certifying on an independent sample $S$ with $S_0\perp S$, MAGDrop-Subspace reduces KL by approximately a factor of 800 while keeping accuracy close to the baseline. On CIFAR-10 with a 13-layer convolutional neural network and $r=50$, MAGDrop-Subspace achieves a PAC-Bayes Gibbs-risk bound of 0.1882 at 90\% confidence using binary KL inversion, compared with 0.4439 for the full-head baseline. Mean-predictor accuracy is 82.31\%, compared with 83.74\% for the baseline. Complementary accuracy experiments on ImageNet-1K show that MAGDrop reaches top-1 accuracy similar to the strong baseline: 78.57\% compared with 78.51\% on the base Vision Transformer with $16\times16$ patches, and 82.14\% compared with 82.23\% on ConvNeXt-Base.

comments
Revised version; submitted to IEEE TNNLS
fields
Statistics Theory
pdf ↗ page arXiv:2510.18410 ↗

In this paper, we present two constructions of degraded read friendly (DRF) MDS array codes with two parity nodes and a sub-packetization level of 2 over small finite fields, applicable for any arbitrary code length. The first construction achieves the smallest repair bandwidth among all existing constructions with the same parameters, and is asymptotically optimal with respect to the lower bound on the average repair bandwidth characterized by Zhang et al. The second construction supports two repair mechanisms, depending on whether computation within the helper nodes is permitted or not during the node repair process, thereby optimizing either the repair bandwidth or the rebuilding access.

comments
Accepted for publication in the IEEE Transactions on Information Theory
fields
Information Theory
pdf ↗ page arXiv:2510.23316 ↗

The excess growth rate, defined as the gap in Jensen's inequality for the logarithm, is a fundamental functional in portfolio theory. In this paper, we present a mathematical study motivated by information theory. We begin by establishing its properties and showing that it has rich connections with information-theoretic concepts such as the Helmholtz free energy, L. Campbell's measure of average code length and large deviations. Our main results consist of three axiomatic characterization theorems of the excess growth rate, in terms of (i) the relative entropy, (ii) the gap in Jensen's inequality, and (iii) the logarithmic divergence that generalizes the Bregman divergence. Furthermore, we study maximization of the excess growth rate and compare it with Kelly's growth optimal portfolio. Our results not only provide theoretical justifications of the significance of the excess growth rate, but also establish new connections between information theory and quantitative finance.

comments
56 pages, 2 figures
fields
Information Theory, Probability
pdf ↗ page arXiv:2510.25740 ↗

This manuscript presents an efficient boundary integral equation technique for solving two-dimensional Helmholtz problems defined in the half-plane bounded by an infinite, periodic curve with Neumann boundary conditions and with an aperiodic point source. The technique is designed for boundaries where one period does not require a large number of discretization points to achieve high accuracy. The inverse Floquet–Bloch transform turns the problem into evaluating a contour integral where the integrand is the solution of quasiperiodic boundary value problems. To approximate the integral, one must solve a collection of these problems. This manuscript uses a variant of the periodizing scheme by Cho and Barnett which avoids using the quasiperiodic Green's function in the integral representation and is amenable to a large amount of precomputation that can be reused for all the necessary solves. The solution technique is accelerated using low rank linear algebra and corner compression. The performance of the method is measured on a range of simple and complex boundary geometries, including in the presence of one or more corners with straight or curved edges present in the unit cell. The numerical results illustrate that the presented method is competitive with techniques using the quasiperiodic Green's function kernel for smooth boundaries, and up to 20–30 faster when corner compression and high accuracy is required.

fields
Numerical Analysis
pdf ↗ page arXiv:2511.04424 ↗

We verify the spiral minimal product structure through the Takahashi Theorem with full computational details which were omitted in [LZ].

comments
20260417 final version
fields
Differential Geometry
pdf ↗ page arXiv:2511.12189 ↗

Let $(M,d,μ)$ be a nice geodesic probability space (such as a manifold) and $X=\{x_i\}_{i\in [N]} \subset M$ a finite $μ$-i.i.d. sample. Suppose we observe noisy distance random variables $d'(x_i,x_j)$. When can the true distances be recovered to small additive error? This question has attracted interest in two disparate fields: latent-space graph models and boundary-value inverse problems. We first show that, taking $N \asymp ε^{-2d-2}|\logε|$ and using runtime $O(N^{2.5+o_d (1)})$, we can recover all distances in $X$ to additive error $O(ε|\logε|)$ with high probability, assuming $\mathbb{E} d'(x_i, x_j) = F(d(x_i,x_j))$ for an unknown, increasing bilipschitz $F$ and with the $d'(x_i,x_j)$ allowed to be arbitrarily heterogeneous in their distribution as long as they are bounded in subgaussian norm. This generalizes existing work, which required $F$ to be known and made strict assumptions on the distribution of $d'(x_i, x_j)$. Achieving this generalization required a novel ``ruler-building'' procedure to learn $F$. We extend our results to a missing data case where we randomly lose access to noisy distances. Our second result uses ideas from the first to tackle a partial observability case: $X = Y \cup Z$ with $Z$ sampled from $M$ and $Y$ sampled from an observer subset satisfying visibility conditions that model the assumptions made on the boundary in boundary-value inverse problems. In this setting, we recover all pairwise distances in $Z$ to additive error $O(ε)$ with $|Z| \asymp ε^{-2d-2}|\logε|$, $|Y| \asymp ε^{-\max\{d_ν,4\}}$ with $d_ν$ determined by the volume-growth properties of the probability measure on the observer set, and runtime $O(|Z|^3)$. This is, to our knowledge, the first quantitative guarantee for this observer/observed split under noise, which complements existing stability results for boundary data.

comments
36 pages; a few added and modified results. Submitted to STOC 2027
fields
Differential Geometry, Probability
pdf ↗ page arXiv:2511.13025 ↗

The ternary extended contact relation studied in (Ivanova, 2020) is a more expressive counterpart of the standard, well-known binary contact relation. Boolean algebras expanded with this relation are called Extended Contact Algebras (ECAs). In this work, we take an algebraic perspective on ECAs, interpreting the ternary relation as a form of entailment. To this end, we introduce the class of Pseudo-Inference Algebras, i.e., Boolean algebras equipped with a monotone ternary operator, additive in its first two coordinates, and satisfying additional equations that capture the logical character of the extended contact. We show that the subclass of relational Pseudo-Inference Algebras corresponds precisely to ECAs and generates the variety of strict PSI-Algebras, which is a discriminator variety. Furthermore, building on the duality developed in (Celani, 2009), we introduce descriptive PSI-frames and establish three interrelated dualities that differ in their morphisms while sharing the same class of topological objects. The resulting framework provides a relational semantics for PSI-Algebras, connecting spatial and logical notions within a categorical and topological setting.

fields
Logic, Category Theory
pdf ↗ page arXiv:2511.21396 ↗

We study asynchronous $\ell^p$-energy minimization on finite connected graphs with prescribed boundary values. At each step, a uniformly chosen interior vertex updates its value to minimize the local energy. For initial values in $[0,1]$, we bound the expected time to approach the $p$-harmonic extension within $ε$ in supremum norm, for $0<ε\le1/2$. On graphs with $n$ vertices, the bound is $C_p n^{β_p}ε^{-(2-p)/(p-1)}$ for $1<p<2$ and $C_p n^{β_p}\log(n/ε)$ for $p\ge2$, where $C_p$ depends only on $p$ and $β_p=\max\{2p/(p-1),3\}$. Bounds incorporating average degree are jointly sharp in graph size, degree, and accuracy for $1<p<2$; for $p\ge2$, lower bounds match the polynomial dependence on size and degree at fixed accuracy. We also establish corresponding synchronous bounds and graph-dependent estimates for $p=2$.

comments
49 pages, 1 figure
fields
Probability
pdf ↗ page arXiv:2512.05424 ↗

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 ↗

We study the 2-systole on compact Kähler surfaces of positive scalar curvature. For any such surface $(X,ω)$, we prove the sharp estimate $\min_X S(ω)\cdot\operatorname{sys}_2(ω)\le12π$, with equality if and only if $X=\mathbb P^2$ and $ω$ is the Fubini–Study metric. Using the classification of positive scalar curvature Kähler surfaces, we determine the optimal constant in the case that $X$ is rational or non-rational and describe the corresponding rigid models. When $X$ is a non-rational ruled surface, we also give an independent analytic proof, adapting Stern's level set method to the holomorphic fibration in the Kähler setting.

comments
18 pages. Reorganized and streamlined. Redundant material has been removed
fields
Differential Geometry
pdf ↗ page arXiv:2601.02901 ↗

Let phi(n) denote the Euler totient function. We study the analytic part associated with the summatory function of sigma_1(n) and obtain explicit bounds under the Riemann Hypothesis. In particular, we establish an upper bound of order x^{delta'} exp((log x)/(log log x)), where delta' = max(1/2, delta).

comments
13 pages. Revised version with new title and substantially revised introduction
fields
Number Theory
pdf ↗ page arXiv:2601.11052 ↗

The tail trimming strategy is widely adopted for robustness against outlier contamination in statistical learning and operations research. However, it generally lacks the thorough understanding that to what extent the tail-trimming technique is effective for nonlinear regression. In this paper, we address the robust nonlinear regression based on the so-called interval conditional value-at-risk (In-CVaR), which is introduced to guard against outliers by trimming extreme losses. We first analyze the trimming effect of the In-CVaR based estimator under distributional perturbation. Our first finding is that the In-CVaR based estimator is qualitatively robust under distributional perturbation in terms of the Prokhorov metric if and only if the largest portion of losses is trimmed. Furthermore, under sample contamination, we derive a probably approximately correct (PAC) bound for the In-CVaR based estimator, showing that the preliminary covariate filtering that is customary in the literature is not needed for In-CVaR based regression. The nonconvexity of the In-CVaR objective, together with unboundedness of covariates, responses and parameter space create the technical challenges for our developed theory, and thus necessitate the new treatment of the qualitative robustness and PAC analysis. Overall, this study rigorously analyzes robustness properties of In-CVaR based nonlinear regression models, which illustrates to what extent the right tail-trimming of the loss by In-CVaR risk measure is essential and effective for robust nonlinear regression. These theoretical findings are further supported by numerical experiments.

fields
Optimization and Control
pdf ↗ page arXiv:2601.11420 ↗

We study non-linear traces of Choquet type on unital AF algebras. Building on the matrix-algebra theory of Nagisa–Watatani and the UHF setting considered by Sogame, we first establish the corresponding description for finite direct sums of matrix algebras and then pass to arbitrary unital AF algebras. We prove that the cone of Choquet traces on an AF algebra $A$ is isomorphic, as an ordered cone, to the cone of increasing maps $α:Γ(A)\to[0,\infty)$ satisfying $α(0)=0$. On each finite-dimensional stage, the associated trace is given by an explicit Choquet formula involving spectral values and the classes of spectral projections.

comments
22 pages. Accepted for publication in Positivity
fields
Operator Algebras
pdf ↗ page arXiv:2601.14016 ↗

We prove a sharp quantitative extension of Llarull's theorem to complete noncompact spin manifolds. Let $Φ:M\to\mathbf S^m$ be an area-decreasing map of nonzero degree that is locally constant at infinity, and assume that $\operatorname{scal}_{g_M}\geq m(m-1)$ on $\operatorname{supp}(dΦ)$. If $λ_1(M,g_M)=0$, then $\inf_M\operatorname{scal}_{g_M}<0$; if $λ_1(M,g_M)>0$, then \[ \inf_M\operatorname{scal}_{g_M}\leq -\frac{4m}{m-1}λ_1(M,g_M). \] The coefficient is sharp in every dimension, as shown by an explicit family of warped metrics. We also prove a boundary analogue under the same support-localized scalar-curvature hypothesis, without requiring the strict scalar-curvature positivity condition near the boundary used in Liu–Liu's doubling argument. Applications include a Geroch-type obstruction for connected sums with compact area-enlargeable manifolds and a Ricci-flat splitting theorem for complete metrics with nonnegative scalar curvature and mean-convex boundary.

comments
27 pages
fields
Differential Geometry
pdf ↗ page arXiv:2601.15043 ↗

We investigate a classical extremal problem in combinatorics and topological graph theory: determining the maximum spectral radius $spex(n,γ)$ of all $n$-vertex graphs embeddable on a closed surface of Euler genus $γ$. Building on seminal contributions by Boots and Royle, Cao and Vince, and Hong in the 1990s; Ellingham and Zha in 2000; Dvořák and Mohar in 2010; Tait and Tobin in 2017; and Liu, Ning, and Wang in 2026, we provide a complete characterization of spectral extremal graphs for any fixed Euler genus $γ$ and all sufficiently large $n$. The extremal graph attaining $\operatorname{spex}(n,γ)$ is unique, necessarily edge-extremal, and, roughly speaking, is constructed from the join $K_2 \nabla P_{n-2}$ by adding exactly $3γ$ edges. As a consequence, we derive asymptotically tight estimates for $\operatorname{spex}(n,γ)$, strengthening a classical bound due to Ellingham and Zha [J. Combin. Theory B, 2000]. We further characterize the extremal structures for the projective plane and torus, sharpening earlier bounds of Hong [J. Combin. Theory B, 1995]. For the planar case, we establish an explicit vertex threshold of $4.5\times 10^6$ for the Tait–Tobin theorem. Our approach combines extremal constructions of cellular embeddings, topological edge-switching techniques, and walk-counting estimates for large-scale substructures, revealing a bridge between spectral extremality and surface topology.

fields
Combinatorics
pdf ↗ page arXiv:2601.16380 ↗

In convex geometry, the Shapley-Folkman Lemma asserts that the nonconvexity of a Minkowski sum of $n$ dimensional bounded nonconvex sets does not accumulate once the number of summands exceeds the dimension $n$, and thus the sum becomes approximately convex. Originally published by Starr in the context of quasi-equilibrium in nonconvex market models in economics, the lemma has since found widespread use in optimization, particularly for estimating the duality gap of the Lagrangian dual of separable nonconvex problems. Given its foundational nature, we pose the following geometric question: Is it possible for the nonconvexity of the Minkowski sum of $n$-dimensional nonconvex sets to even diminish instead of just not accumulating as the number of summands increases, under some general conditions? We answer this affirmatively. First, we provide an elementary geometric proof of the Shapley-Folkman Lemma based on the facial structure of the convex hull of each set. This leads to refinement of the classical error bound derived from the lemma. Building on this new geometric perspective, we further show that when most of the sets satisfy a certain local smoothness condition which naturally arises in the epigraphs of smooth functions, their Minkowski sum converges directly to a convex set, with a vanishing nonconvexity measure. In optimization, this implies that the Lagrangian dual of block-structured smooth nonconvex problems with potentially additional sparsity constraints is asymptotically tight under mild assumptions, which contracts nonvanishing duality gap obtained via classical Shapley-Folkman Lemma.

fields
Optimization and Control
pdf ↗ page arXiv:2601.19003 ↗

We study the problem of propagating the mean and covariance of a general multivariate Gaussian distribution through a deep (residual) neural network using layer-by-layer moment matching. We close a longstanding gap by deriving exact moment matching for the probit, GeLU, ReLU (as a limit of GeLU), Heaviside (as a limit of probit), and sine activation functions; for both feedforward and generalized residual layers. On large-variance random networks, median KL-divergence improvements over common baselines range from tens to thousands of times. On a variational Bayes neural network, we show that our method improves upon a state-of-the-art deterministic inference method by an order of magnitude in KL divergence from Monte Carlo ground truth. We also give a smooth-distance error bound showing that, under regularity assumptions, moment matching removes the leading low-variance errors and propagates higher-order local accuracy through the layers of a network.

comments
to appear at NeurIPS 2026, https://openreview.net/forum?id=1dsxDeHdpR
fields
Numerical Analysis
pdf ↗ page arXiv:2601.22307 ↗

Conformal prediction (CP) is a distribution-free method to construct reliable prediction intervals that has gained significant attention in recent years. Despite its success and various proposed extensions, a significant practical feature which has been overlooked in previous research is the potential skewed nature of the noise, or of the residuals when the predictive model exhibits bias. In this work, we leverage recent developments in CP to propose a new asymmetric procedure that bridges the gap between skewed and non-skewed noise distributions, while still maintaining adaptivity of the prediction intervals. We introduce a new statistical learning problem to construct adaptive and asymmetric prediction bands, with a unique feature based on a penalty which promotes symmetry: when its intensity varies, the intervals smoothly change from symmetric to asymmetric ones. This learning problem is based on reproducing kernel Hilbert spaces and the recently introduced kernel sum-of-squares framework. First, we establish representer theorems to make our problem tractable in practice, and derive dual formulations which are essential for scalability to larger datasets. Second, the intensity of the penalty is chosen using a novel data-driven method which automatically identifies the symmetric nature of the noise. We show that consenting to some asymmetry can let the learned prediction bands better adapt to small sample regimes or biased predictive models.

journal
Forty-Third International Conference on Machine Learning (ICML 2026), Jul 2026, S{é}oul, South Korea
fields
Statistics Theory
pdf ↗ page arXiv:2601.22834 ↗

We derive general sufficient conditions for the existence of càdlàg and continuous modifications of Lévy-driven mixed moving average processes. The conditions are explicit and easy to verify and applied to supOU, well-balanced supOU, trawl, and power-weighted supOU processes. In these examples, the conditions are shown to be close to optimal.

comments
26 pages
fields
Probability
pdf ↗ page arXiv:2602.01735 ↗

In this paper, we prove a higher integrability result for very weak solutions of higher-order elliptic systems involving a double phase operator as the principal part. As a model case, we consider \begin{equation} \int_Ω \left( |D^m u|^{p-2}D^m u + a(x)|D^m u|^{q-2}D^m u \right) \cdot D^m \varphi = 0 \quad \text{for any } \varphi \in C_c^{\infty}(Ω), \end{equation} where $n,\,m \in \mathbb{N},\ n\ge 2,\,1 < p \le q < \infty,\,Ω\subset \mathbb{R}^n$ is an open set and $a:Ω\rightarrow [0,\infty)$ is a measurable function. We extend the result of Baasandorj, Byun and Kim (Trans. Amer. Math. Soc., 2023) with respect to the derivative order, the coefficient class and the growth conditions. The proof is based on a construction of an appropriate test function by the Lipschitz truncation technique, a deduction of a reverse Hölder inequality and an application of Gehring's lemma. To this end, we establish estimates for weighted mean value polynomials and sharp Sobolev–Poincaré-type inequalities for the double phase operator.

comments
62 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2602.03044 ↗

In this paper, we present the reduction of a recently introduced generalized quantum scheme of Chodos and Cooper to Levinson-Smith and Liénard classes of nonlinear system that enable us to furnish a wider class of acceptable solutions. In particular, for the Levinson-Smith equations, we find their relevance to position-dependent mass quantum systems, with an interesting off-shoot that solitonic-like solutions emerge from the condition of the level surface in the system. On the other hand, for the Liénard type, which has coefficients of odd and odd symmetry in the present set up, we demonstrate that closed form solutions exist on carrying out conversion to the typical Abel form.

comments
Title and text modified; references updated; 11 pages, 2 figures. Version accepted in Journal of Theoretical, Experimental, and Applied Physics
journal
J Theor Exp Appl Phys, 2(4), 01-09 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2602.04747 ↗

We construct non-stationary normal coordinates in a neighborhood of Pesin stable manifolds \cite{Pesin}. This construction is a natural extension, via jets in the normal directions, of the non-stationary normal coordinates on stable manifolds introduced by Guysinsky and Katok. We emphasize that this extension provides a useful framework for describing the fractal geometric structures of stable and unstable foliations in smooth dynamical systems.

comments
15 pages, 2 figures; Minor revision: improved exposition, added a remark on template functions in Section 4, and corrected minor typographical errors
fields
Dynamical Systems
pdf ↗ page arXiv:2602.05188 ↗

We develop a quantum lattice Boltzmann method for linear advection–diffusion equations with prescribed space- and time-dependent velocities. Direct block-encoding can accumulate normalization factors that suppress success probability exponentially, even when the classical propagator remains bounded. We control this loss by scaling each distribution component by the inverse square root of its local equilibrium weight. For uniformly positive weights and dimensionless relaxation times $τ^*\geq 1/2$, this equilibrium energy scaling gives the Bhatnagar–Gross–Krook collision operator unit spectral norm while preserving the discrete dynamics. Streaming normalization depends on weight ratios at the departure and arrival positions and times of each step; these ratios equal one for uniform steady advection. For periodic streaming, cumulative normalization stays bounded under mesh refinement at fixed physical time if logarithmic derivatives of the weights along streaming trajectories are bounded uniformly in space, time, and mesh resolution. A single-step block-encoding with two flag qubits supports coherent propagation of the full kinetic distribution without intermediate measurements. We compare oracle query bounds for time marching with those for a history-state linear system built from the same scaled operator, under specified assumptions on initial-state preparation and coefficient access. Tests in one and two dimensions and noiseless circuit simulations verify the construction. In a controlled comparison after 50 steps, scaling increases the probability of preparing the quantum state encoding the terminal distribution by approximately $450\times$. Classical refinement diagnostics up to $N_t=16{,}384$ steps confirm bounded cumulative normalization. The scaling controls additional normalization losses while retaining physical diffusive attenuation.

comments
25 pages, 8 figures. Substantially revised: equilibrium energy scaling, coherent multistep construction, and expanded numerical and circuit verification; title and author list updated
fields
Mathematical Physics
pdf ↗ page arXiv:2602.09799 ↗

GAP measures (also known as Scrooge measures) are a natural class of probability distributions on the unit sphere of a Hilbert space that come up in quantum statistical mechanics; for each density matrix $ρ$ there is a unique measure GAP$_ρ$. We describe and prove a property of these measures that was not recognized so far: If a wave function $Ψ$ is GAP$_ρ$ distributed and a collapse occurs, then the collapsed wave function $Ψ'$ is again GAP distributed (relative to the appropriate $ρ'$). This fact applies to collapses due to a quantum measurement carried out by an observer, as well as to spontaneous collapse theories such as CSL or GRW. More precisely, it is the conditional distribution of $Ψ'$, given the measurement outcome (respectively, the noise in CSL or the collapse history in GRW), that is GAP$_{ρ'}$.

comments
12 pages LaTeX, no figures; changes in v2: Section 4 added and minor corrections and improvements throughout the paper
fields
Mathematical Physics
pdf ↗ page arXiv:2602.19993 ↗

We suggest a geometric approach to modeling biochemical processes, aiming at those processes that occur in humans with food sensitivities or chemical sensitivities.

comments
Minor changes in sections 1,2
fields
Differential Geometry
pdf ↗ page arXiv:2602.20274 ↗

The group stage of a sports tournament is often made more appealing by introducing additional constraints in the group draw that promote an attractive and balanced group composition. For example, the number of intra-regional group matches is minimised in several world championships. Under such constraints, the traditional draw procedure may become non-uniform, meaning that the feasible allocations of the teams into groups are not equally likely to occur. Our paper quantifies this non-uniformity of the 2026 FIFA World Cup draw for the official draw procedure, as well as for 47 reasonable alternatives implied by all permutations of the four pots and two group labelling policies. We show why simulating with a recursive backtracking algorithm is intractable, and propose a workable implementation using integer programming. The official draw mechanism is found to be optimal based on two of five non-uniformity measures, including the average distortion of the 771 non-zero assignment probabilities. Nonetheless, non-uniformity can be more than halved if the organiser aims to treat the best teams drawn from the first pot equally.

comments
26 pages, 2 figures, 7 tables
fields
Optimization and Control
pdf ↗ page arXiv:2602.21029 ↗

Let $d\in\mathbb{N}$ and $\varphi\colon(0,1)\to[0,d]$. We prove there exists a set $F\subset\mathbb{R}^d$ whose lower spectrum $\operatorname{dim}^θ_{\mathrm{L}} F$ satisfies $(1-θ)\operatorname{dim}^θ_{\mathrm{L}} F = \varphi(θ)$ for all $θ\in(0,1)$ if and only if for all $λ,θ\in(0,1)$, \begin{equation*} \varphi(θ) \leq \varphi(λθ) - θ\varphi(λ) \leq (1-θ) d. \end{equation*} We also obtain a similar classification result for $\underline{\operatorname{dim}}^θ_{\mathrm{L}} F$. In contrast to the case for Assouad spectra, it is insufficient to consider homogeneous (or uniform) sets. Instead, we follow the approach introduced by Orgoványi–Rutar in arXiv:2510.07013 and proceed via a more general classification result for appropriate two-scale branching functions.

comments
30 pages, 3 figures. v2: Fixed issues with a superadditivity lemma and added some simplifications to proofs; main results unchanged
fields
Classical Analysis and ODEs, Metric Geometry
pdf ↗ page arXiv:2603.03174 ↗

The Bayesian and Akaike information criteria aim at finding a good balance between under- and over-fitting. They are extensively used every day by practitioners. Yet we contend they suffer from at least two afflictions: their penalty parameters $λ=\log n$ and $λ=2$ are too small, leading to many false discoveries, and their inherent (best subset) discrete optimization is infeasible in high dimension. We alleviate these issues with the pivotal information criterion: PIC is defined as a continuous optimization problem, and the PIC penalty parameter $λ$ is selected at the detection boundary (under pure noise). PIC's choice of $λ$ is an upper quantile of a statistic that we prove to be (asymptotically) pivotal, provided the loss function is appropriately transformed. As a result, simulations show a phase transition in the probability of exact support recovery with PIC, a phenomenon studied with no noise in compressed sensing. Applied to real data, for similar predictive performances, PIC selects the least complex model among state-of-the-art learners.

fields
Statistics Theory, Information Theory
pdf ↗ page arXiv:2603.04172 ↗

Relative entropy is a fundamental class of distances between probability distributions, with widespread applications in probability theory, statistics, and machine learning. In this work, we study relative entropy from a categorical perspective, viewing it as a quantitative enrichment of categories of stochastic matrices. We consider two natural monoidal structures on stochastic matrices, given by the Kronecker product and the direct sum. Our main results are complete axiomatisations of Kullback-Leibler divergence and, more generally, of Rényi divergences of arbitrary order, for each such structure. Our axiomatic theories are formulated within the framework of quantitative monoidal algebra, using a graphical language of string diagrams enriched with quantitative equations.

comments
Final proceedings version for MFPS XLII
fields
Information Theory, Category Theory
pdf ↗ page arXiv:2603.04530 ↗

The Jacobi elliptic functions $\mathrm{sn}$, $\mathrm{cn}$, $\mathrm{dn}$ and their ratios are expressed by Weierstrass's functions $\mathrm{al}_a=\sqrt{x-b_a}$ of an elliptic curve. For a hyperelliptic curve of genus $g$, Weierstrass's $\mathrm{al}_a$ functions generalize $\mathrm{sn}$, $\mathrm{cn}$ and $\mathrm{dn}$, and the modified Korteweg-de Vries and sine-Gordon equations stand behind them. In this paper we study the $\mathrm{al}_{ab}$ functions, which are defined by the sigma function shifted by the sum of two half-periods and which, together with the ratios of the $\mathrm{al}_a$ functions, generalize the remaining Jacobi elliptic functions. We determine the exact lattice of periods of $\mathrm{al}_{12}$ and show that it is single-valued on the unramified double covering of the Jacobian corresponding to the double covering $\hat{w}^2=(x-b_1)(x-b_2)$ of the curve. We show that $\mathrm{al}_{12}$ is the Wronskian of the band-edge eigenfunctions $\mathrm{al}_1$ and $\mathrm{al}_2$, so that the half-period translations realize Darboux transformations. As the main result, $\mathrm{al}_{12}$, $\mathrm{al}_2/\mathrm{al}_1$ and $1/\mathrm{al}_{12}$ satisfy one and the same degenerate Krichever-Novikov equation, whose polynomial has the double roots $0$ and $\infty$, and the half-periods act on these solutions as the Möbius symmetries of the equation. Thus the Krichever-Novikov equation stands behind the $\mathrm{al}_{ab}$ functions. In genus one these functions reduce to $\mathrm{sn}$, $\mathrm{ns}$ and $\mathrm{dc}$.

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

Accessing the physical mechanisms behind non-Markovian phenomena in open quantum dynamics requires the study of the statistical properties of the joint system-environment dynamics. This is impossible at the level of the reduced dynamics of the open system alone as the latter is obtained by suitably eliminating the environment. The task is instead made possible by considering multi-time correlation functions involving observables of the open system, only: the open system-environment interactions turn them into global ones thus building up correlations between the two systems. Multi-time correlations form the basis of both the theory of quantum stochastic processes and of the Alicki-Lindblad-Fannes dynamical entropy (ALF entropy for short). This latter quantity provides for quantum systems a measure of the dynamical entropy production as the Kolmogorov-Sinai entropy does for classical systems. In the case of a collisional model whereby the dissipative dynamics of a finite-level system is obtained by its coupling to an infinite classical spin chain, the ALF entropy can be explicitly computed. It turns out to depend on the parameters characterizing the statistical properties of the environment and can be related to the activation and super-activation of memory effects in the open quantum system.

comments
31 pages, 3 figures; revised and expanded version. See also the companion Letter arXiv:2603.14025
journal
Phys. Rev. A 114, 052406 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2603.14015 ↗

The Alicki-Lindblad-Fannes dynamical (ALF) entropy measures the rate at which new information is gathered about a quantum system by inspecting its long-time evolution. We propose an extension of the ALF entropy to open quantum dynamics as a measure of back-flow of information from the environment. Such a proposal is stronger than the existing ones based only on the open system reduced dynamics. In the case of a qubit collisionally coupled to a classical spin chain, we obtain an exact expression for the $\textit{open-system ALF entropy}$ explicitly depending on the environment correlations. An extreme case shows how the information flow from environment to system corresponds to vanishing entropy production as for reversible finite quantum systems.

comments
6 pages, 2 figures; see also the companion paper arXiv:2603.14015
journal
APS Open Sci. 1, L000196 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2603.14025 ↗

A unified framework for chirp-domain waveforms, including orthogonal chirp division multiplexing (OCDM) and affine frequency division multiplexing (AFDM), is developed. Their continuous-time representations are shown to fall within the conventional Weyl-Heisenberg (WH) framework for multicarrier waveforms, with the root chirp as the prototype pulse. Since the root chirp has constant envelope and is transparent to subcarrier orthogonality, these waveforms can be further interpreted as pulse-shaped (PS) orthogonal frequency division multiplexing (OFDM) signals, whose power spectral density is derived analytically. The derived spectrum reveals that implementations based on the discrete affine Fourier transform rely on sub-Nyquist samples and exhibit frequency aliasing. We prove that the corresponding aliased chirps are only conditionally orthogonal, whereas sample-wise root-Nyquist pulse shaping of the discrete-time AFDM (DT-AFDM) sequence produces mutually orthogonal pulse-shaped chirps, resulting in the pulse-shaped AFDM (PS-AFDM) waveform. We then derive an exact waveform-level input-output (I/O) relation for PS-AFDM over delay-Doppler (DD) channels, showing that the effective channel at a practical receiver is generally not a superposition of pure path-wise DD components. Waveform simulations verify the derived relation to machine precision, while the conventional sequence-level I/O relation for DT-AFDM exhibits a substantial mismatch with waveform behavior for practical channels with continuous-valued delays.

comments
14 pages, 7 figures. Accepted for publication in IEEE Journal on Selected Areas in Communications. The supplementary materials for this paper are available at: https://oddm.io
fields
Information Theory
pdf ↗ page arXiv:2603.14358 ↗

In a recent work of Matteo Mio on compact quantitative equational theories (here compact means that all its consequences are derivable by means of finite proofs) convex algebras on the carrier set [0,1] whose operations are monotone and satisfy certain semicontinuity properties occurred. We fully classify those algebraic structures by giving an explicit construction of all possible convex operations on [0,1] possessing the mentioned properties. Our result thus describes exactly the range of theories to which Mio's theorem applies.

fields
Logic
pdf ↗ page arXiv:2603.14955 ↗

Inspired by Mubayi's work on the supersaturation of color-critical subgraphs, we investigate its edge-spectral counterpart: determining the minimum number of copies of a color-critical subgraph in a graph whose spectral radius exceeds the corresponding extremal threshold. While earlier breakthroughs by Bollobás and Nikiforov, Ning and Zhai, and Li, Liu, and Zhang provided edge-spectral supersaturation results for the complete graph, the general problem for color-critical graphs has remained open. In this paper, we strengthen existing results by studying all color-critical graphs \(F\) with \(χ(F)=r+1\geq 4\). Specifically, we prove that if $ρ(G)\!>\!\sqrt{(1\!-\!1/r)2m}$, then the number of copies of \(F\) in \(G\) satisfies $N_F(G) \geq \bigl(γ_F-o(1)\bigr)m^{(|F|-2)/2},$ where both the order of magnitude and the leading constant \(γ_F\) are optimal. The above supersaturation statement is derived from a more general edge-spectral supersaturation and stability framework. Classically, a theorem of Erdős and Simonovits [Combinatorica, 1983] asserts that any $n$-vertex graph with edge density strictly exceeding the Turán density of $F$ must contain $Ω(n^{|F|})$ copies of $F$. By applying the progressive induction method to spectral extremal problems, we establish a comprehensive edge-spectral analogue of the Erdős–Simonovits theorem. Beyond obtaining the asymptotic upper bounds on the spectral radius $ρ(G)$ under the condition $N_F(G) = o(m^{|F|/2})$, we further establish a sharp stability result. Our work strengthens both the classical Erdős–Stone–Simonovits theorem and Nikiforov's spectral stability theorem by extending the setting from $F$-free graphs to graphs containing only a limited number of copies of $F$. We conclude with several open problems in spectral supersaturation.

fields
Combinatorics
pdf ↗ page arXiv:2603.14964 ↗

We construct $46{,}992$ new families of Fano $4$-fold hypersurfaces $X_d\subset\mathbb(a_1,\ldots,a_6)$ of Fano index $1$ with $d>200$, whose general members have terminal singularities. Unlike the $11{,}617$ quasismooth families classified by Brown and Kasprzyk, these are nonquasismooth, for which determining terminality can require the analysis of hyperquotient singularities. An exhaustive search has classified all nonquasismooth families with $d\leq200$, but extending this classification to higher degrees becomes computationally prohibitive. We therefore exploit the sparsity and spatial clustering of terminal examples using two best-first searches over $\mathbb{Z}^6$: one with a fixed heuristic, and the other with a neural network trained online by deep reinforcement learning. Together, the searches reach degrees up to $3{,}234$. The neural network additionally discovers an average of $79$ hard-to-reach families per run. For the most isolated examples, our conservative distance-based model gives an estimated lower bound of nearly $40\%$ of the fixed search's total step budget to discover a single such family. An ablation study demonstrates that this advantage arises from the neural network rather than stochastic exploration alone. The complete list of families is publicly available.

comments
12 pages, 11 figures, 5 tables. v2: Certified the terminality of the discovered families, added an ablation study, and revised the experimental results
fields
Algebraic Geometry
pdf ↗ page arXiv:2603.15437 ↗

We extend methods of Fontaine, Abrashkin and Schoof to obtain criteria determining number fields K over which no non-zero abelian variety with everywhere good reduction exists. As an application, under the GRH, we find 26847 such fields of various degrees up to 16.

comments
Improved exposition
fields
Number Theory
pdf ↗ page arXiv:2603.17708 ↗

Neural networks are increasingly used as surrogates in optimization problems to replace computationally expensive models. However, embedding ReLU neural networks in mathematical programs introduces significant computational challenges, particularly for large networks. This work investigates how pruning techniques can accelerate the solution of optimization problems with embedded neural networks, focusing on the mechanisms underlying the computational gains. We show that, besides problem size reduction, both unstructured and structured pruning tightens preactivation bounds. We conduct a comprehensive empirical study spanning three morphologies and four complexity levels, comparing magnitude-based weight and node pruning with structured perspective regularization (SPR). We test on both an illustrative test function and a chemical process flowsheet surrogate, using a commercial and an open-source solver. Pruning consistently improves the accuracy-runtime trade-off, with speedups spanning one to four orders of magnitude depending on the complexity of the unpruned network. The gains are attributed to three factors: (i) reduction in problem size, (ii) decrease in the number of integer variables, and (iii) tightening of big-M bounds. Weight pruning and SPR occupy most of the accuracy-runtime Pareto frontier, the latter enabling faster convergence at the mildest sparsity considered. The mechanisms transfer from the test function to the engineering case study, although the preferred technique and sparsity level might vary with the case study, and should be selected as part of surrogate development.

fields
Optimization and Control
pdf ↗ page arXiv:2603.23299 ↗

We study estimation and detection of high-order cumulant tensors from $n$ i.i.d. observations of a $p$-dimensional random vector, with performance measured in the tensor spectral norm. Under sub-Gaussianity, we show that the minimax rate for estimating the order-$d$ cumulant tensor is $\sqrt{p/n}\wedge 1$. In contrast to covariance estimation, the natural plug-in estimator obtained by replacing population moments in the moment–cumulant formula with sample moments, which we call the sample cumulant tensor, is generally not rate-optimal for $d\ge 3$, and we construct an estimator that attains the minimax rate. On the computational side, we study testing whether the $d$-th order cumulant tensor vanishes after whitening. We provide evidence, under a model-specific low-degree conjecture, that detection is computationally hard when $n\ll p^{d/2}$. At the same time, we identify a regime in which an efficiently computable estimator achieves error smaller than the separation at which polynomial-time tests can reliably distinguish the null from the alternative under the same conjecture. This reveals an unusual reverse detection–estimation gap: computationally efficient detection can be harder than computationally efficient estimation. The underlying reason is that the relevant loss, tensor spectral norm, is itself NP-hard to compute, creating a new form of computational–statistical gap.

fields
Statistics Theory
pdf ↗ page arXiv:2603.26029 ↗

Despite hydrogen being central to Europe's decarbonisation strategy, only a small share of renewable hydrogen projects reached final investment decision. A key barrier is uncertainty about how future hydrogen markets will be designed and operated, particularly under Renewable Fuels of Non-Biological Origin requirements. This study investigates the extent to which future hydrogen market design can be adapted from existing natural gas markets, and the challenges it must address. The analysis was based on a survey on future hydrogen market design targeting European gas transmission system operators, the stakeholder group responsible for operating the network and implementing the Network Codes. The survey provided an assessment of mechanism transferability and identified challenges for the early development of the hydrogen market. Core market design principles and trading frameworks are broadly transferable from natural gas markets, as entry-exit systems and virtual trading points. Capacity allocation requires targeted adaptation to improve coupling with electricity markets. Tariffs require adaptation through intertemporal cost allocation, distributing infrastructure costs over time to protect early adopters. Balancing regimes should be revisited to reflect hydrogen's physical characteristics and different linepack flexibility usages. Key challenges for early hydrogen markets include: temporal mismatches between variable renewable supply and expected relatively stable industrial demand, limited operational flexibility due to scarce storage and reduced pipeline linepack, fragmented regional hydrogen clusters, and regulatory uncertainty affecting long-term investment decisions. These findings provide empirical input to the hydrogen Network Codes and offer guidance to policymakers designing hydrogen market frameworks.

comments
Accepted version to energy Policy
fields
Optimization and Control
pdf ↗ page arXiv:2603.26451 ↗

In Grochow and Qiao (\emph{SIAM J. Comput.}, 2023), the complexity class Tensor Isomorphism (TI) was introduced and isomorphism problems for groups, algebras, and polynomials were shown to be TI-complete. In this paper, we study average-case algorithms for several TI-complete problems over finite fields, including algebra isomorphism, matrix code conjugacy, and $4$-tensor isomorphism. Our main results reveal a rich landscape of average-case complexities of Tensor Isomorphism problems, despite their equivalence in the worst-case setting. Over the finite field of order $q$, we devise (1) average-case \emph{polynomial-time} algorithms for algebra isomorphism and matrix code conjugacy that succeed for $1/Θ(q)$ fraction of inputs; (2) an average-case \emph{polynomial-time} algorithm for the $4$-tensor isomorphism that succeeds for $1/q^{Θ(1)}$ fraction of inputs; and (3) an average-case \emph{polynomial-time} algorithm for the orthogonal $3$-tensor isomorphism that succeed for $1-1/\poly(n)$ fraction of $n\times n\times n$ tensors. Our main technical contribution is to introduce the spectral properties of random matrices into algorithms for TI-complete problems. This leads to not only new algorithms but also new questions in random matrix theory over finite fields. To settle these questions, we need to extend both the generating function approach as in Neumann and Praeger (\emph{J. London Math. Soc.}, 1998) and the character sum method of Gorodetsky and Rodgers (\emph{Trans. Amer. Math. Soc.}, 2021).

comments
60 pages, add average-case polynomial-time algorithm for orthogonal tensor isomorphism over finite field
fields
Probability
pdf ↗ page arXiv:2604.00591 ↗

We study the functoriality of the local theta correspondence for classical $p$-adic groups. This is realized via the adaptation of the Adams conjecture to ABV-packets. We provide evidence for the conjecture, especially in the case of general linear groups.

comments
Updated some references and fixed some errors
fields
Number Theory, Representation Theory
pdf ↗ page arXiv:2604.03095 ↗

This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case where the target tree grows with the size of the random tree. We consider three primary subtree counts: the number of fringe trees isomorphic to a specific growing tree, the number of fringe trees sharing a given growing degree statistic, and the number of fringe trees of a specific growing size. To establish our results, we employ and compare four distinct probabilistic frameworks: the method of moments with the Gao-Wormald theorem, Stein's method with coupling (to provide explicit error bounds in total variation distance), the Cai-Devroye method, and Stein's method with exchangeable pairs. Our findings provide conditions for Poisson and normal convergence for these subtree counts. Additionally, we provide a local limit theorem for sums of values obtained via sampling without replacement that may be of independent interest. Finally, our results and methods are also applied to conditioned critical Galton-Watson trees.

comments
36 pages
fields
Probability, Combinatorics
pdf ↗ page arXiv:2604.06012 ↗

We prove an analogue of Givental-Teleman reconstruction for F-cohomological field theories on the moduli space of compact type. We apply it to reconstruct the restriction of the extended $r$-spin classes to the extended direction and deduce relations between $κ$-classes (both in compact type).

comments
39 pages, 15 figures
fields
Algebraic Geometry, Mathematical Physics
pdf ↗ page arXiv:2604.07270 ↗

It is a well-known theorem of homotopy type theory, originally due to Voevodsky, that function extensionality holds inside any univalent universe. We consider a weaker variant of the univalence axiom, asserting that the wild category formed by the universe is univalent, which we call categorical univalence. We show that categorical univalence does not imply function extensionality by an analysis of Von Glehn's polynomial model construction, which produces models of Martin-Löf type theory that always refute function extensionality. We find in particular that when the base model has a univalent universe, its polynomial model has a universe that is categorically univalent but lacks function extensionality.

comments
21 pages
fields
Logic
pdf ↗ page arXiv:2605.00812 ↗

We investigate the convex-body containment problem $\max\{s >0 : s Z \subseteq Q\}$, where the outer body $Q \subseteq \mathbb{R}^d$ is described by a membership oracle and the inner body $Z \subseteq \mathbb{R}^d$ is a zonotope. Our main result is a sampling-based $O(\sqrt{d/\log d})$-approximation algorithm for this problem that matches the lower bound of $Ω(\sqrt{d/\log d})$ by Khot and Naor in the oracle model. Starting from approximate Lewis position, the algorithm samples Gaussian directions and adaptively shortens and repositions the generators. Its analysis combines preservation of the support in a fixed direction with contraction of the corresponding functional after renormalization. Crucially, the algorithm works directly with the input generators and does not use zonotope sparsification. We complement this result with a \emph{universal} $Ω(\sqrt{d/\log d})$ lower bound holding for \emph{all} full-dimensional zonotopes when the number of oracle queries is polynomial in $d$. Finally, we consider containment problems $\max\{s >0 : s K \subseteq Q\}$, for general convex bodies $K \subseteq \mathbb{R}^d$. A result of Nasz{ó}di on approximating $K \subseteq \mathbb{R}^d$ by a polytope implies a $Θ(d/\log d)$ approximation algorithm in polynomial time when the centroid of $K$ is the origin. We show the tightness of this approximation factor in the oracle model via a reduction to the circumradius computation. Our lower bound holds for centrally symmetric convex sets, implying that Barvinok's optimal $O(\sqrt{d})$-approximation of a centrally symmetric convex body by a polytope with a polynomial number of vertices cannot be computed in polynomial time.

fields
Metric Geometry
pdf ↗ page arXiv:2605.04183 ↗

Establishing almost sure convergence rates for stochastic approximation and reinforcement learning under Markovian noise is a fundamental theoretical challenge. We make progress towards this challenge for a class of stochastic approximation algorithms whose expected updates are contractive, a setting that arises in many reinforcement learning algorithms such as $Q$-learning and linear temporal difference learning. Specifically, for a power-law learning rate $O(n^{-η})$ with $η\in (1/2, 1)$, we obtain an almost sure convergence rate arbitrarily close to $o(n^{1 - 2η})$. For the harmonic learning rate $α_n=α/(n+1)$, the almost sure squared-error rate is $o(n^{-ζ})$ for every $ζ<\min\{1,2(1-κ)α\}$, where $κ$ is the contraction factor. Thus exponents arbitrarily close to one are available when $2(1-κ)α\geq1$. This approaches the $n^{-1}$ polynomial exponent of classical law-of-the-iterated-logarithm benchmarks. Key to our analysis is a novel Lyapunov drift construction that applies a Poisson-equation based correction for Markovian noise to the well-established Moreau-envelope smoothing for the contractive mapping.

fields
Optimization and Control
pdf ↗ page arXiv:2605.07104 ↗

We study the long-context limit of softmax self-attention with a fixed query and a random context of $n$ i.i.d. keys on the sphere with the intrinsic dimension of the key distribution held fixed, viewing the inverse temperature $β_n$ as the scaling parameter that decides whether attention degenerates into uniform averaging or collapses onto the single closest key. We show that the critical scale at which selectivity emerges is determined by the local exponent of the distance-to-query distribution near zero rather than by global features of the context, and scales like $β_n^\ast \asymp n^{2/(d-1)}$ for uniform keys on $\mathbb{S}^{d-1}$. Furthermore, we characterize the limiting laws of the ordered attention weights and of the attention output across all regimes of $β_n$: a subcritical regime in which the output reduces to a local average around $q$ with explicit deterministic bias and Gaussian fluctuations; a critical regime in which a finite collection of nearest keys retains macroscopic mass without single-key collapse; and a supercritical regime in which all mass concentrates on the closest key. Of notable interest is the subcritical case with identity value matrix where the attention map approximately implements a backward heat equation.

comments
41 pages, 4 figures
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2605.08505 ↗

We give an algebraic description of the equivariant K-theory of Gieseker varieties. Our main result identifies the equivariant K-theory of the Gieseker space with the Jucys–Murphy center of the cyclotomic Hecke algebra, over the equivariant K-theory of a point. The construction is inspired by the proof of the Hikita–Nakajima conjecture for Gieseker spaces given by the first and third authors. We discuss consequences for the center of cyclotomic Hecke algebras and for specializations to q=1 and to roots of unity. In particular, we relate K-theory of affine type A quiver varieties with the centers of the corresponding blocks of specialized cyclotomic Hecke algebras. This last result strengthens the correspondences obtained by the second author in earlier work.

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

We investigate an optimal control problem for the one-dimensional heat equation with a prescribed terminal state. To approximate the hard terminal constraint, we consider quadratic terminal penalization and analyze the convergence of the optimal controls and terminal states as the penalty parameter \(α\to\infty\). We develop a unified spectral treatment of terminal reachability, minimum-energy control, and quadratic-penalty convergence. Using modal decompositions, we characterize finite-energy admissible terminal targets and construct the corresponding minimum-energy hard-constrained control. For admissible targets, we establish strong convergence of penalized optimal controls and terminal states. Under suitable spectral summability conditions, we obtain regularity-dependent convergence estimates of order \(O(α^{-(1/2+θ)})\) for the terminal-state error, \(0\leθ\le1/2\), and \(O(α^{-θ})\) for the optimal-control error, \(0<θ\le1\). The analysis connects these results explicitly with classical Tikhonov regularization in the heat-equation setting. A finite-dimensional prototype illustrates the underlying projection structure, while companion numerical investigations provide supporting evidence for the predicted convergence behavior.

comments
30 pages; revised introduction, references, and discussion of Tikhonov regularization
fields
Optimization and Control
pdf ↗ page arXiv:2605.14060 ↗

We introduce the notion of the Frobenius–Witt cotangent complex, which can be considered as a derived variant of the module of Frobenius–Witt differentials defined by T. Saito. This new object also can be seen as an arithmetic variant of the notion of cotangent complex. We explain the suitability of these two viewpoints through a series of propositions. Furthermore, we establish a relationship between Frobenius–Witt cotangent complexes and the regularity of noetherian local rings, which can be considered as a derived variant of Saito's regularity criterion. This proof relies heavily on computations of Frobenius–Witt cotangent complexes in the case of perfectoid rings. We also study the deformation theory of delta structures using Frobenius–Witt cotangent complexes.

comments
30 pages. Comments are very welcome. v4: corrected the proof of Theorem 5.9. v3: added an application to the deformation theory of delta structures and corrected typos. v2: minor corrections and a generalization of one of the main theorems
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2605.14803 ↗

Starting from a general analysis of obstruction classes, we develop the investigation of obstructions associated with the bundle structure of the hyperbolic Clifford algebra. By taking into account particularities arising from the Whitney sum, it is shown that, unlike classical tangent bundle cases, the hyperbolic frame bundle of an oriented manifold admits lifting without any topological obstruction, that is, it admits a structure of the connected double covering of $\mathrm{GL}^{+}(2m,\mathbb{R})$, and the hyperbolic tangent bundle carries a $Spin^{e}_{m,m}$ structure (with $m=\dim\mathcal{M}$), whatever the value of $w_2(\mathcal{M})$. These conclusions are known from the work of Karoubi and Gualtieri and the point of this note is that they follow from the Whitney product formula alone, or from the additivity formula of Whitney sums with an explicit covering group, without recourse to Karoubi's criterion for indefinite signature. We also describe the spinor bundles involved, which are bundles of differential forms and not Dirac spinor bundles and show that orientability is needed for the covering of the full linear group.

comments
10 pages, version accepted for publication
journal
Axioms 15(11), 812 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2605.16558 ↗

We introduce an analytic framework for studying the number of crossings in planar straight-line and spherical geodesic drawings; we begin by analyzing drawings in a continuous setting and then pass to finite graphs. We use this approach to derive multiple results. First, we show that the midrange crossing constant is strictly smaller than $8/(9π^2)$, improving the best known upper bound of Pach and Tóth from nearly thirty years ago. Second, we prove sharp lower bounds for some restricted drawing classes. For spherical geodesic drawings with uniformly distributed vertices, we determine the minimum number of crossings at every edge density. We also prove lower bounds for planar straight line drawings in compact convex domains with uniform vertex sets. Consequently, we determine the restricted midrange crossing constant to be $8/(9π^2)$ in both of these settings. Finally, for two-layer bipartite drawings, with straight edges between two parallel lines, we determine the midrange crossing constant to be $2/3$.

comments
28 pages, 4 figures. It now includes the counter-example and lower bound for two-layer bipartite drawings
fields
Combinatorics
pdf ↗ page arXiv:2605.16700 ↗

Motivated by the Bruner–Rognes two-extension theorem and open questions regarding the secondary cohomology modeling of fibers of Steenrod operations, we develop a general framework to compute their Adams filtrations and delineate the underlying algebraic obstructions. Let $f:Y\to\prodΣ^{d_λ}H\mathbb F_2$ be a locally finite family of positive-degree stable operations, where $Y=H\mathbb F_2$ or $H\mathbb Z$. We determine the Adams filtration of its fiber from the minimal generators of $\operatorname{im}(f^*)$ as a left Steenrod module. An explicit target automorphism separates a minimal subfamily, and combining this with the two-extension theorem and an acyclic cancellation gives $E_3=E_\infty$. A terminating Adem recursion realizes this splitting for the full positive even-square family. Separately, we identify two fundamental algebraic obstructions to directly constructing the secondary cohomology of these fibers: an augmentation discrepancy when the primary row has a nonzero kernel, and a coherence obstruction class in the third cohomology of a Hom complex. These results demonstrate why the secondary Ext groups of these fibers must be derived topologically via the Baues–Jibladze comparison theorem, rather than through a direct algebraic resolution.

comments
21 pages. This new version supersedes v2 and withdraws its unsupported claims to resolve Bruner's Questions 6.1 and 6.2. Instead, it rigorously delineates the structural obstructions that make a direct algebraic secondary modeling of these fibers impossible
fields
Algebraic Topology
pdf ↗ page arXiv:2605.18906 ↗

We prove a quantitative Halász theorem for multiplicative functions on the nonzero ideals of $\mathbb{Z}[i]$, with bounds controlled by pretentious distance to the Archimedean characters $N^{it}$. We also prove a sectorial analogue: under angular non-pretentiousness, the sum of $f$ over ideals lying in a fixed sector is asymptotically given by the expected proportion of the unrestricted sum. Finally, under angular non-pretentiousness and a non-degeneracy condition on conjugate prime pairs, we prove a sectorial short-interval version of the Halász theorem for annular sectors whose radial thickness tends to infinity. The proof of the sectorial short-interval Halász theorem uses angular Fourier expansion, norm-compression to multiplicative functions on $\mathbb{N}$, and a theorem of Mangerel.

comments
43 pages, no figures
fields
Number Theory
pdf ↗ page arXiv:2605.19105 ↗

We survey recent progress on the cohomology of moduli spaces of stable curves through the lens of the Hodge and Tate conjectures, especially their generalized coniveau forms, which relate Hodge structures and l-adic Galois representations on cohomology to algebraic cycles. We explain how the inductive structure of the boundary stratification verifies these conjectures in a surprisingly wide range of cases, describe the guiding inspiration from arithmetic, and discuss open problems and directions for future research.

comments
v2: 28 pages, minor revisions and expository improvements. Final version to appear in the proceedings of the 2025 Summer Research Institute in Algebraic Geometry
fields
Algebraic Geometry
pdf ↗ page arXiv:2605.20453 ↗

We study the existence of large (boundary blow-up) solutions to semilinear equations involving the Finsler p-Laplacian on bounded domains with sufficiently smooth boundaries. We establish a Keller-Osserman-type condition that ensures the existence of such solutions, and show that this condition retains the same integrability as that of the p-Laplacian. We examine the influence of the anisotropic norm underlying the Finsler p-Laplacian on the boundary behaviour of the solution, then derive asymptotic estimates for large solutions near the boundary of the domain. Using these boundary asymptotics, we prove uniqueness results for power-type nonlinearities.

comments
Some changes in the comparison principle and the local bound of the solutions. The existence of a large radial solution on a ball is added
fields
Analysis of PDEs
pdf ↗ page arXiv:2605.22345 ↗

In this paper, we establish a higher order Morrey's inequality in the framework of $\mathsf{CD}(K,N)$-spaces for $K\in\mathbb{R}$ and $N\in\mathbb{N}$. We do so by first introducing an alternate version of second order Sobolev spaces in general metric measure spaces, which contains amply many functions even when $p>N$. These spaces contain the traditional $H^{2, p}(X)$ spaces on $\mathsf{RCD}(K, N)$-spaces.

comments
33 pages, some results are now valid in the setting of CD spaces, title change. Comments welcome!
fields
Metric Geometry
pdf ↗ page arXiv:2605.24404 ↗

Let $n, m \ge 4$. We study the Zappa–Szép products $G = HK$ with $H = \langle x\rangle \rtimes \langle y\rangle \cong SD_{2^n}$ and $K = \langle z\rangle \rtimes \langle w\rangle \cong SD_{2^m}$, together with the fixed generators $x, y, z, w$, and we describe the parameter tuples which encode the mixed commutators of these generators, according to the cores of $\langle x\rangle$ and $\langle z\rangle$ in~$G$. First, when both $\langle x\rangle$ and $\langle z\rangle$ are normal in~$G$, we show that the admissible parameter tuples are exactly the solutions of an explicit system of six polynomial congruences. Second, when the cores $\langle x\rangle_G$ and $\langle z\rangle_G$ are arbitrary subgroups of $\langle x\rangle$ and $\langle z\rangle$, under the simplifying assumption $[x, z] = 1$, and for generating systems for which all mixed commutators lie in $\langle x\rangle\langle z\rangle$, we obtain an analogous classification by twelve congruences together with two order conditions; this is the semidihedral counterpart of the Hu–Yu classification~\cite{HuYu2025} for dihedral groups $D_{2n}$ and $D_{2m}$ with $n, m$ odd. In contrast with that case, we further construct an explicit exact product with both cores non-trivial and $[x, z] \ne 1$, so that the semidihedral setting contains additional families of exact products.

fields
Group Theory
pdf ↗ page arXiv:2605.24480 ↗

The aim of this Lecture Note is to introduce the Signal Processing (SP) community to a powerful yet still under-utilised tool: the semiparametric statistics. In short, the semiparametric framework allows us to estimate or perform hypothesis testing on a finite-dimensional parameter $\boldsymbolθ \in Θ\subseteq \mathbb{R}^p$ in the presence of an \textit{infinite-dimensional nuisance parameter} $g \in \mathcal{S}$ (i.e. a function), such as the density of the noise. Clearly, this framework is general enough to include almost every SP application. Remarkably, as the title suggests drawing on George R. R. Martin's famous book series, the greatest advantage of semiparametric statistics over parametric and non-parametric ones lies in the fact that it is able to reconcile two seemingly dichotomous concepts: statistical efficiency and distributional robustness. To explain exactly what this means, in this Lecture Note we will focus our attention on the famous and fundamental symmetric location problem.

comments
Submitted to IEEE Magazine "Lecture Notes"
fields
Statistics Theory
pdf ↗ page arXiv:2605.25870 ↗

Stochastic inflation is a powerful technique for calculating the probability distribution function (PDF) of large inflationary perturbations, which may collapse to form Primordial Black Holes. The PDF, $P({\cal N})$, of the stochastic number of e-folds, ${\cal N}$, satisfies an adjoint Fokker-Planck Equation. We develop a new self-contained eigenvalue technique which can be used to determine $P({\cal N})$. First we apply this method to the simple case of quantum diffusion along a flat potential without any classical drift. We recover the expression for the PDF that has previously been found using characteristic functions, with an exponential tail, and a power-law behaviour, $P({\cal N}) \propto {\cal N}^{-3/2}$, in the intermediate regime between the peak and the tail of the PDF. Finally we apply the method to constant drift inflation, in the narrow- and broad-well limits. In the narrow-well limit, there is an analytic solution and the PDF is similar to the drift-free case, with a mildly suppressed tail. In the broad-well limit, determining the full set of eigenvalues and eigenfunctions requires a piecewise construction of the spectrum, and the broad-well PDF is qualitatively different, with an enhanced peak and a strongly suppressed tail.

comments
40 pages, 11 figures, minor text revisions; matches the accepted version in JCAP
fields
Mathematical Physics
pdf ↗ page arXiv:2606.00176 ↗

We study the long-time dynamics of many-body bosonic lattice systems under translation-invariant Gaussian quantum cellular automata. We formulate two sets of conditions on GQCAs which separately guarantee thermalization of any state on the local Weyl algebra to the infinite temperature state, whenever the state is locally normal and has uniformly bounded particle density. Our main intermediate result is a quantum many-body generalization of the classic Riemann-Lebesgue lemma which is a bound on expectation values of local Weyl operators involving their support and the state's particle density.

comments
24 pages, 1 figure, v2 is a minor revision
fields
Mathematical Physics
pdf ↗ page arXiv:2606.05542 ↗

Compositional priors describe the generic properties of layered functions in deep Bayesian models, where deep neural networks with random weights are a canonical example. In the wide-network limit, the prior is a Gaussian process (GP) with a depth-dependent kernel, and its behaviour as depth grows has been extensively studied through this kernel. Here, we study another case, where each layer itself is a vector valued Gaussian process, and our aim is similarly to understand the limiting behaviour of the prior as depth grows. Previous GP work has established that for the radial basis function (RBF) kernel and a certain range of bandwidths $r$, the prior degenerates in the limit, converging to the set of constant functions, which is not useful as a probabilistic model. In this paper we establish several new results. First, we identify a sharp bandwidth threshold $r_c(d) = Θ(\sqrt{d})$ above which the limit is degenerate, strengthening the earlier bounds. Second, and more importantly, we show that for $r$ below the threshold $r_c(d)$ the prior converges to a limit distribution $π_{\bar{Z}}$. We also prove that these distributions are non-degenerate and non-Gaussian, with non-vanishing dependence between coordinates. In contrast to the previously known degenerate regime, deep Gaussian process priors can therefore admit non-trivial limits. Empirically, we verify the threshold across a range of dimensions $d$, and demonstrate a complex multimodal behaviour of the limit distributions $π_{\bar{Z}}$, a regime that becomes increasingly narrow with $d$ and would be hard to identify without knowing the threshold.

comments
Accepted at NeurIPS 2026. 27 pages. Code: https://github.com/komarkdev/deep-gp-thresholds
fields
Statistics Theory
pdf ↗ page arXiv:2606.08218 ↗

In this work, we review and revisit the generating function techniques that provide exact analytical solutions for aggregation and fragmentation equations across several physical regimes including spontaneous and collisional shattering. For discrete coagulation-fragmentation equations with size-independent rates under monodisperse initial conditions, we show the derivation of several explicit closed-form solutions. We also briefly report the exact solutions for continuous, three-particle, $D$-particle collisions and two-component generalizations. Source-driven aggregation yields steady distributions featuring a universal $s^{-3/2}$ power-law decay and a cutoff mass scaling $s_{*} \sim t^{2}$. We also remind that exploitation of the low-rank representations of the aggregation kernel allows to organize efficient modelling the aggregation kinetics and extend this idea showing a simple way for the fast accounting of the spontaneous framentation terms. We exploit our numerical algorithm and study the numerical solutions for multiple models of spontaneous fragmentation and find a new example of temporal oscillations for the closed aggregation-fragmentation process.

comments
27 pages, 72 references;
fields
Dynamical Systems
pdf ↗ page arXiv:2606.10785 ↗

We study isotropic random walks on complex projective space in the context of stochastic state-space exploration in open quantum systems. Using results from harmonic analysis on compact rank-one symmetric spaces, first we obtain explicit transition kernels and characterise the evolution of fidelity and geometric observables. Then, we establish the correspondence between the small-step limit and Fubini-Study Brownian motion, and also show that the long-time limit reproduces Haar-random state statistics. At the level of the density matrix, the ensemble evolution formally coincides with an isotropic depolarizing channel at all times. Our main results concern first-passage statistics to high-fidelity target states. In the Brownian limit, we derive a closed-form expression for the mean first-passage time and an explicit spectral representation of the first-passage-time distribution, with decay rates determined by the eigenvalues of the killed Fubini-Study Laplace-Beltrami operator. The resulting asymptotics reveal a strong dependence on target fidelity and Hilbert-space dimension, demonstrating the rapidly increasing difficulty of reaching high-fidelity targets through unbiased isotropic exploration. The model is purely geometric and does not incorporate microscopic Hamiltonians or Lindblad dynamics. Nevertheless, the results suggest that it offers a natural starting point for stochastic models of open quantum systems that incorporate Hamiltonian and dissipative effects, with potential applications to stochastic quantum state preparation and control.

fields
Mathematical Physics
pdf ↗ page arXiv:2606.11438 ↗

This note is concerned with the spreading speed of the predator component in a class of prey-predator reaction-diffusion systems with spatiotemporal heterogeneity depending on a moving variable. The main difficulty is that the full system lacks a direct comparison principle. We establish a pointwise estimate showing that the prey density is close to its carrying capacity wherever the predator density is sufficiently small. This allows us to compare solutions of the system with those of scalar Fisher-KPP equations in shifting environments. Consequently, we obtain an explicit formula for the spreading speed of the predator. In particular, for nonmonotone shifting environments, locking and nonlocal pulling phenomena may occur.

fields
Analysis of PDEs
pdf ↗ page arXiv:2606.14059 ↗

In this paper, we establish spreading speeds for a nonlocal Fisher-KPP equation with measurable time-dependent asymmetric kernels, without imposing an inequality between growth and diffusion or requiring the kernel to be positive near the origin. The kernel has a time independent upper bound which is thin-tailed. Both the kernel and the linear growth rate have uniform means. Under these assumptions, we determine the exact rightward and leftward spreading speeds and prove convergence to the positive equilibrium inside the spreading interval. The proof is based on comparison arguments and a family of compactly supported subsolutions. Explicit examples show that time-dependent dispersal kernels with the same time average can exhibit different propagation behaviors.

fields
Analysis of PDEs
pdf ↗ page arXiv:2606.15226 ↗

This paper introduces a novel and general framework for constructing arbitrary-order, energy-stable, and decoupled schemes for the anisotropic phase-field dendritic crystal growth model. The proposed framework combines a time-dependent auxiliary variable, an algebraically stable Runge-Kutta method, and a matrix diagonalization technique. This unique combination yields a scheme that is proven to be unconditionally energy-dissipative while requiring only the solution of independent, constant-coefficient elliptic equations at each time step, which can be solved in parallel. The auxiliary variable is recovered from a uniquely solvable $q\times q$ algebraic system. We provide a rigorous proof of $q$th-order convergence in time for a $q$-stage Runge-Kutta method within a fixed Fourier-Galerkin space. Numerical experiments in 2D and 3D not only confirm the theoretical convergence and energy stability but also demonstrate the efficiency of the decoupled approach and provide a detailed investigation of key parameters' effects on dendritic morphology.

comments
36 pages, 119 figures, 5 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2606.25345 ↗

Let $K$ be a finite extension of $\mathbb{Q}_p$. We prove that a one-dimensional formal group law over $K$ has integral coefficients if and only if its multiplication-by-$n$ endomorphisms have integral coefficients for all integers $n$, in the height-one case, that is when the multiplication by $p$ has Weierstrass degree $p$. The proof relies on $p$-adic Hodge theory.

comments
12 pages, 1 figure
fields
Number Theory, Dynamical Systems
pdf ↗ page arXiv:2606.25726 ↗

In the three-rotor problem, three equally massive point particles move on a circle interacting via attractive pairwise cosine potentials. Rotors can represent superconducting phases of metallic segments in a chain of coupled Josephson junctions. We propose a digitization of the classical dynamics that records successive pair and triple coincidences of rotors using four symbols. Rotor coincidences correspond to boundaries in a disjoint partition of the configuration torus into cells where the rotors are ordered clockwise and anticlockwise. It is shown that isolated rotor coincidences must be crossings. Despite being a rather coarse digitization, we find that replacing trajectories by coincidence symbol sequences captures significant qualitative features of the dynamics through word statistics. Word-complexity $C_n$ measures the diversity of $n$-letter words in the symbol sequence while topological entropy governs asymptotic exponential growth of $C_n$. Sequences from periodic orbits have a word-complexity that saturates at the period. Ultra-high-energy trajectories with irrational `slope' are quasiperiodic. We show that they have zero entropy and $C_n = n+3$ by examining limiting slopes and by a mapping to Sturmian sequences. We examine their grammar rules and propose how their right-special words may be identified. On the other hand, numerical investigation of sequences from globally chaotic orbits leads us to conjecture an exponentially growing word-complexity $C_n = 3 \times 2^{n-1}$ with a topological entropy $\log 2$. We identify grammar rules that imply this conjectured word-complexity and model the resulting sequences as a subshift of finite type, unlike those at ultra-high energies which are not topological Markov chains.

comments
27 pages and 18 figure files
journal
Chaos 36, 103140 (2026)
fields
Mathematical Physics, Dynamical Systems
pdf ↗ page arXiv:2606.25766 ↗

In this article, a non-homogeneous $Tb$ type theorem for arbitrary dimensional Calderón-Zygmund singular integral operators is proved. This is an extension of an analogous non-homogeneous $Tb$ theorem for the Cauchy transform, in the planar setting, due to Nazarov, Treil and Volberg. The novelties of the present work are the change of dimension and the fact that the operators to which the theorem applies are not necessarily antisymmetric. The techniques used in the proof include, among others, suppressed kernels, decompositions in $L^2(μ)$, where $μ$ is a Radon measure in $\mathbb{R}^d$, and a probabilistic argument resulting from taking averages of the operators involved.

comments
98 pages, 10 figures
fields
Classical Analysis and ODEs, Analysis of PDEs
pdf ↗ page arXiv:2606.26401 ↗

We extend the notion of discrete homotopy groups of graphs to arbitrary cubical sets, and show that the discrete homotopy groups of quasisymmetric cubical sets are naturally isomorphic to the homotopy groups of their geometric realizations. Here, quasisymmetric cubical sets are cubical sets equipped with coordinate permutation symmetries that are compatible with faces and degeneracies, but not necessarily with connections. We give a purely combinatorial construction of the left adjoint of the forgetful functor from the category of quasisymmetric cubical sets to the category of cubical sets, and prove that the unit of this adjunction is a natural weak equivalence. As a consequence, we obtain a purely combinatorial description of the homotopy groups of the geometric realizations of arbitrary cubical sets. As an application, we establish the discrete Hurewicz map from the discrete homotopy groups of a cubical set to the homology groups, and prove a Hurewicz theorem with respect to the discrete Hurewicz map whenever the cubical set is quasisymmetric. Applied to the 1-nerve of a directed graph, it also yields a Hurewicz theorem relating the homotopy groups of Li, Wu, Yau, and Zhang to singular cubical homology.

comments
We replace $\mathcal{G}_0\$ by $\mathrm{Ex}^{\infty}$ in the proofs of the comparison and Hurewicz theorems for quasisymmetric cubical sets. We revise the definition of $\mathcal{S}$, and also reformulate grids as cubical maps from geometric products of zigzags
fields
Algebraic Topology, Combinatorics
pdf ↗ page arXiv:2606.28693 ↗

Why does quantum relative entropy occupy such a privileged role among measures of distinguishability? We show that a single operational principle determines it. If one pair of states can be distinguished at least as successfully as another for every prior, when both are assisted by the same auxiliary pair, acting as a catalyst, a distinguishability measure should assign it no smaller value. Remarkably, for a normalized measure, this requirement singles out Umegaki relative entropy under mild classical continuity and expansibility on uniform distributions: adding impossible outcomes leaves their associated entropy unchanged. Qubit catalysts already suffice. No additivity or quantum continuity is assumed. We also prove that, without auxiliary assistance, respecting binary discrimination dominance uniquely determines the quantum extension of every regular classical divergence, including the Hirche–Tomamichel extensions of classical $f$-divergences. For additive classical divergences, these extensions respect classical catalysis; allowing noncommuting qubit catalysts is what singles out Umegaki relative entropy.

comments
Major revision with a substantially stronger uniqueness theorem: catalytic Lorenz monotonicity characterizes Umegaki relative entropy without assuming additivity; full-rank qubit catalysts suffice. Includes a new proof and results distinguishing classical from quantum catalysis
fields
Mathematical Physics
pdf ↗ page arXiv:2607.01712 ↗

We determine the cellular $\mathbb{A}^1$-chain complex of full and partial flag varieties of split semisimple simply connected groups over a perfect field of characteristic different from 2. With compatible integral normal orientations and reindexing by opposite Bruhat cells, the differential in each degree at least two is represented by the motivic Hopf map $η$ times one half of the signed cellular boundary matrix of the corresponding real flag manifold. Consequently, the Smith data of the resulting integer complex give all positive-degree cellular homology sheaves in terms of Milnor–Witt $K$-theory and the kernels and cokernels of integer multiples of $η$. We obtain a uniform computation of the second cellular $\mathbb{A}^1$-homology of $SL_n/B$ for $n\geq3$, together with complete calculations for $SL_3/B$ and the full flags of types $F_4$ and $G_2$.

fields
Algebraic Geometry
pdf ↗ page arXiv:2607.02985 ↗

Lie-Poisson electrodynamics (LPE) is a non-Abelian and nonlinear deformation of usual electrodynamics, where the gauge algebra is defined through a Lie-algebra-type Poisson bracket on space-time. This field-theoretical model arises from noncommutative U(1) gauge theory in the semiclassical limit. We focus on the geometric approach to LPE in the absence of charged matter. We establish a non-trivial field redefinition which, under mild technical assumptions, maps the LPE dynamics to that of Maxwell theory. We emphasise that despite the dynamical equivalence, these two theories are not physically equivalent, since the corresponding local gauge-invariant observables are different. We show that our field redefinition is actually a Seiberg-Witten map between LPE and Maxwell theory. Using this map, for any symmetry of the Maxwell action, we construct generators of LPE symmetries and the corresponding conserved currents. In particular, we obtain deformed Poincaré transformations, thereby solving the problem of constructing space-time symmetries in LPE. The deformed symmetries are constructed as active transformations of the gauge field. In the outlook, we propose a natural quantization prescription for LPE based on our field redefinition.

comments
extended version, references added, 19 pages; to appear in Nucl. Phys. B
fields
Mathematical Physics
pdf ↗ page arXiv:2607.04522 ↗

Let $M_n$ be a nonnegative supermartingale with $M_0=1$, and let $T_b$ be the first time $M_n$ crosses $b>1$. Ville's inequality gives $P(T_b<\infty)\leq 1/b$. We show that, at every finite time horizon $N$, $$ 1=bP(T_b\leq N)+V_{b,N}+D_{b,N}+R_{b,N}, $$ where $V_{b,N}$ is the expected overshoot at crossing, $D_{b,N}$ is the cumulative predictable decrease before crossing, and $R_{b,N}$ is the expected value of paths that up to the time horizon $N$ remained below the boundary $b$. The identity follows from telescoping and can be made horizon free without additional integrability assumption. It gives a formula for the slack in Ville's inequality and thus the conservatism of the threshold test $M_n\geq b$. For likelihood ratio martingales, the same terms also describe power: $R_{b,N}$ is the probability, under the alternative, of not crossing by $N$, whereas $bP(T_b\leq N)+V_{b,N}$ is the power. The identity also allows us to verify horizon-free guarantees from a finite computation: $P(T_b<\infty)$ lies between $P(T_b\leq N)$ and $P(T_b\leq N)+R_{b,N}/b$, so a proposed threshold test $M_n\geq b_α$ can be shown to be of level $α\in(0,1)$ for every time horizon based on computations at the single horizon $N$. We illustrate how Ville's identity yields sharper thresholds for Bernoulli and exponential likelihood-ratio tests, and for a conformal test of exchangeability, demonstrating Monte Carlo calibration under a composite, nonparametric null. Lastly, we also establish a continuous-time analogue of Ville's identity.

fields
Probability
pdf ↗ page arXiv:2607.04620 ↗

Let $p$ be a fixed prime number and let $R$ be a $p$-quasisyntomic ring. We provide conditions for objects in the absolute prismatic site $R_\Prism$ to cover the final object in $\Shv(R_\Prism)$ and to admit finite self-coproducts in $R_\Prism$. More precisely, we introduce in $R_\Prism$ the so-called transversal objects, so that the coproduct of any object in $R_\Prism$ with a transversal object exists in $R_\Prism$. As an immediate generalization, we introduce the so-called relatively quasiregular semiperfectoid covers of $R$, whose prismatic cohomology (of $δ$-pairs, in the sense of Antieau-Krause-Nikolaus) produces objects in $R_\Prism$ that cover the final object in $\Shv(R_\Prism)$ and admit finite self-coproducts in $R_\Prism$.

comments
14 pages
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2607.04931 ↗

This paper investigates the control of discrete-time linear time-invariant (LTI) systems subject to incomplete and corrupted measurements. Specifically, we focus on designing a Linear Quadratic Gaussian (LQG) controller without relying on explicit state estimation. By leveraging minimum variance duality, our approach allows the current control input to be represented as a linear function of available measurements and previously applied inputs, successfully reducing the task to a tractable deterministic optimization problem. We provide theoretical justification for this framework and demonstrate its practical effectiveness through numerical experiments.

fields
Optimization and Control
pdf ↗ page arXiv:2607.12135 ↗

We study flags of subrepresentations of a general representation of a finite quiver. For each representation, its flag scheme is the zero scheme of a section of a quotient bundle on a product of partial flag varieties. We obtain the generic dimension and cycle class and equivariant localization formulas for Euler characteristics and parabolic Schubert coefficients. We further express these coefficients as finite signed sums of semi-invariant dimensions for auxiliary star quivers with inward and outward flag arms. In the acyclic one-step case, this is compatible with the result of Derksen–Schofield–Weyman, and the zero-dimensional case recovers their semi-invariant counting theorem. Examples treat matrix pencils and generalized Kronecker quivers.

comments
29 pages. v3. generalized to flags; title changed. Final version to appear IMRN
fields
Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2607.12458 ↗

The celebrated (offline) Beck–Fiala conjecture asserts that every matrix $A\in\{0,1\}^{n\times T}$ with at most $d$ nonzero entries in each column has discrepancy $O(\sqrt d)$. In this note, we consider the {\it online} version of the conjecture. For every fixed $η>0$, we give a randomized online algorithm that achieves $O_η(\sqrt d)$ prefix discrepancy for every fixed sequence of $d$-sparse vectors $a_t\in[-1,1]^n$, except with probability at most \[ C_ηT\exp\left[-\frac{c_ηd}{\log^{2+η}(ed)}\right]. \] In particular, this gives an optimal $O(\sqrt d)$ discrepancy upper bound for $d\geq C_η(\log T)(\log\log T)^{2+η}$. This range of sparsity is optimal up to $\log\log T$ factors. The result also resolves in strong form the {\it online Spencer problem}, corresponding to the case $d = n$. The algorithm is based on a compactly supported Metropolis walk, constructed by combining ideas from several recent works on online vector balancing. The proof was generated in conversation with ChatGPT 5.6 Pro; the authors provided high-level guidance in several rounds of prompting, followed by manual checking and rewriting of the proof.

comments
Minor revision - simplified proof and significantly expanded the exposition
fields
Combinatorics, Probability
pdf ↗ page arXiv:2607.14238 ↗

We study the last iterate of the projected subGradient Method with a constant stepsize for convex $L$-Lipschitz objectives in $\mathbb{R}^d$, minimized over closed convex sets. Assuming that the initial iterate $x_1$ has distance at most $R$ from a minimizer, we establish matching upper and lower bounds on the minimax optimization error at $x_n$, where the infimum is taken over constant stepsizes. Specifically, this error is of order $L\cdot R\cdot\sqrt{\min\{d,\log n\}/n}$. Notably, when the dimension is fixed, the minimax error decays as $1/\sqrt{n}$, without the extra logarithmic factor intrinsic to dimension-free analyses. Our analysis exploits a combinatorial argument based on linear algebra and novel geometric constructions.

comments
25 pages, 2 figures. Substantially revised and expanded; sharp minimax bounds after optimizing over constant stepsizes. Title and abstract updated
fields
Optimization and Control
pdf ↗ page arXiv:2607.15980 ↗

Stochastic nonconvex optimization is central to training deep networks and LLMs in modern machine learning. We give a black-box reduction from stochastic nonconvex optimization to ordinary static regret minimization in online convex optimization (OCO), addressing the open problem posed by Chen and Hazan (2024). Our reduction maintains a predictable gradient tracker, while a black-box online learner $\mathcal A$ selects a preconditioner that transforms this tracker into the update direction. Given a $β$-smooth function with initial gap at most $M$ and an unbiased gradient oracle with variance bounded by $σ^2$, we bound the expected average squared gradient norm by $O(σ\sqrt{Mβ/T}+\sqrt{Mβ}\mathrm{Reg}_T(\mathcal A)/T+\frac{Mβ}{T})$, where $\mathrm{Reg}_T(\mathcal A)$ is the static regret of $\mathcal A$ against the identity preconditioner. Thus, any OCO oracle with $O(\sqrt T)$ regret recovers the classical $O(T^{-1/2})$ convergence rate. We also prove that the additive variance term cannot be removed: every conversion making a constant number of stochastic-oracle queries per round, whose guarantee is stated through static regret against a comparator that the online learner can play, must contain an additive term of order $σ\sqrt{Mβ/T}$ for sufficiently large $T$. Moreover, for every online learner, our conversion bound is tight up to universal constants. We also extend the framework to nonsmooth nonconvex optimization, still relying only on ordinary static regret, and attain the optimal convergence rate for Goldstein-type stationarity. Finally, we conduct numerical experiments on nonconvex objectives to illustrate how the reduction exploits online-selected preconditioners while using the same stochastic-oracle budget as stochastic gradient descent.

fields
Optimization and Control
pdf ↗ page arXiv:2607.17607 ↗

Finite-precision arithmetic unavoidably introduces numerical approximation errors. Numerical computations may use insufficient precision or an improper formulation, which leads to numerical instability. In this paper, we introduce a unified software tool for stochastic numerical validation of deep-learning operators. The tool follows CESTAC on supported exposed operations and uses an operator-level data-perturbation approximation for GEMM-like kernels. Our developed software not only enables numerical validation with a single computation pass but also detects the sources of numerical instability and provides numerical stability monitoring during deep learning training and inference. We verified its effectiveness on the detection of polluted operators with injected numerical instabilities across various tasks. We believe that our developed method and tools provide valuable insights into developing numerically stable computing kernels, which are particularly critical for numerically stable and efficient deep learning training and inference.

fields
Numerical Analysis
pdf ↗ page arXiv:2607.25494 ↗

We describe infinitesimal deformations of post-Lie algebras and post-Hopf algebras and prove that the universal enveloping algebra and primitive elements adjunction is compatible with the infinitesimal structure. In characteristic zero, this restricts to an equivalence for connected cocommutative infinitesimal post-Hopf algebras, extending the Cartier–Milnor–Moore theorem. We parametrize all infinitesimal post-Lie structures on $\mathfrak{sl}(2)$ and exhibit a second-order obstruction. From a geometric point of view, infinitesimal post-Lie algebras emerge from flat connections with covariantly constant torsion and an additional compatible symmetric $(1,2)$-tensor. This leads to explicit examples of infinitesimal post-Lie structures based on Heisenberg Lie algebras. On the Hopf side, we classify infinitesimal structures above the trivial action, prove rigidity for group algebras, and describe the structures on Sweedler's Hopf algebra. The subadjacent construction induces a Hopf algebra deformation with fixed coproduct. Finally, we prove that the quadratic operad of infinitesimal post-Lie algebras is Koszul, using a filtered distributive law between the operads of Lie algebras and bi-magmas.

comments
Correction of Theorem 15, improvement of Section 2.1.3, other minor additions and updated references
fields
Quantum Algebra, Category Theory, Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2607.28009 ↗

We study linear disturbances localized near planar surfaces moving at constant velocity $v$ in relativistic media. Depending on the physical setting, the surface may represent a moving obstacle, a thermal boundary, or an external source, providing a unified description of boundary layers, wakes, and the asymptotic tails of shock waves. The central result is a propagator representation of the interface solution that yields a geometric characterization of these phenomena. Using a Laplace-transform formulation, we show that the solution is a superposition of modes with purely imaginary frequency and wavenumber. For a given interface velocity, the admissible modes are selected by the line $iω=vik$ in the $\{iω,ik\}$ plane. As $v$ varies, this line sweeps across the spectrum, providing a unified geometric description of interface-localized solutions for arbitrary interface velocities. We illustrate the formalism with applications to relativistic hydrodynamics and kinetic theory.

comments
20 pages, 7 figure, published in PRD (see https://journals.aps.org/prd/abstract/10.1103/6ldz-p4s1)
journal
Phys. Rev. D 114, 104005 (3 November, 2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2607.28569 ↗

Deep joint source–channel coding (Deep JSCC) can suffer from domain shift between training and deployment data. We study single-source domain adaptation for image classification over wireless channels. A Gaussian example shows that improving channel quality does not necessarily improve target-domain accuracy under a fixed source-trained classifier. We further proposed an information objective to reduce domain information while preserving class information. Motivated by the analysis, we develop a domain-adaptive Deep JSCC method that combines class-wise adversarial alignment with pseudo-label supervised contrastive learning. The former uses all target samples to reduce class-conditional domain differences, while the latter selects high-confidence target samples to obtain class-discriminative received representations. We relate these losses to the information objective, and analyze the effects of pseudo-label errors and confidence-based selection. Experiments on SVHN–MNIST and PACS over AWGN and Rayleigh channels demonstrate improved target-domain classification without additional inference-time networks. The proposed method achieves 98.15\% accuracy on SVHN $\rightarrow$ MNIST at 10~dB CSNR.

fields
Information Theory
pdf ↗ page arXiv:2607.28907 ↗

The fundamental groups of compact 3-manifolds are known to be residually finite. Feng Luo conjectured that a stronger statement is true, by only allowing finite groups of the form $\mathrm{PGL}(2,R)$, where $R$ is a finite commutative ring. In earlier work, this conjecture was disproven in full generality. The conjecture arose in the context of orientable connected compact 3-manifolds which are geometrizable. By constructing explicit faithful linear representations using rings with nilpotent elements, we demonstrate that the conjecture holds for six of the eight Thurston model geometries, namely all but $\mathbb{S}^3$ and $\widetilde{\mathrm{SL}_2}$. In the case of $\mathbb{S}^3$, the conjecture holds if we replace $\mathrm{PGL}(2,R)$ with $\mathrm{GL}(2,R)$. A spherical counterexample for the projective variant is the Poincaré homology sphere $Σ(2,3,5)$. In the case of $\widetilde{\mathrm{SL}_2}$, the conjecture fails to hold for both the projective and non-projective variants; a counterxample is provided by the Brieskorn sphere $Σ(2,3,7)$.

comments
17 pages
fields
Geometric Topology
pdf ↗ page arXiv:2608.01532 ↗

We present a simple construction of a family of $0/1$-polytopes whose edge expansion decreases exponentially with the dimension, which disproves the Mihail-Vazirani conjecture that the graph of every $0/1$-polytope has edge expansion at least one.

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

Let $X=\{x_1,\dots,x_n\}\subset \mathbb{R}^2$ be a finite set of points of diameter at most $1$. It is natural to expect that if many pairs $(x_i,x_j)$ lie at distance close to $1$ from each other, then some clustering phenomenon must occur, implying that a significant number of these pairs are also very close to each other. %For $0<\varepsilon<1$, we call a pair $(x_i,x_j)$ $\varepsilon$-antipodal if $\|x_i-x_j\|\ge 1-\varepsilon$ and $\varepsilon$-neighboring if $\|x_i-x_j\|\le \varepsilon$. We prove that there exists a universal constant $c>0$ such that for all $0<\varepsilon<1$, whenever $n$ is large enough, we have: \[ \big|\{(i,j):\|x_i-x_j\|\le \varepsilon\}\big| \geq c\cdot \varepsilon^{1/2}\cdot \big|\{(i,j):\|x_i-x_j\|\geq 1-\varepsilon\}\big|. \] This confirms a recent conjecture of Steinerberger, who asked whether the $\varepsilon^{1/2}$ ratio is the best possible. We also study a two-parameter version of Steinerberger's question by considering the number of pairs at distance at most $\varepsilon_1$ and at distance at least $1-\varepsilon_2$. We show that in this case the optimal ratio is $\varepsilon_1^2\cdot\varepsilon_2^{-3/2}$ when $\varepsilon_1\leq\varepsilon_2$, and $\varepsilon_1^{1/2}$ otherwise. The proof proceeds by introducing an auxiliary graph associated with the set $X$ and reducing the problem to bounding the largest eigenvalue of its adjacency matrix. Our main result is the outcome of human–AI interactions using ChatGPT 5.4.

comments
20 pages, 7 figures
fields
Metric Geometry, Combinatorics
pdf ↗ page arXiv:2608.02605 ↗

A computational path records the steps used to establish an equality. Topologies on computational equality witnesses can depend on the chosen generators and execution schedule, even when their algebraic and homotopical meanings agree. We study continuous presentations of finite computational paths whose declared rewrites are realized by endpoint-fixed homotopies. We compare a topology retaining the full signed trace with an observable topology recording endpoints, length, and exact path realization. Continuous finite-word interpretations that are inverse up to scoped rewriting preserve trace-sensitive quotient arrows and their final composable-pair spaces. Observable quotients behave differently. Over a point with a nonempty primitive alphabet, we classify their topology: it records length parity when all named relations preserve parity, and is otherwise indiscrete. Adjoining a conservative abbreviation can therefore turn a discrete two-element quotient into an indiscrete space, even though ordinary multiplication remains continuous. A circle presentation also gives nonhomeomorphic quotients under binary and equal-slot timing. Geometric completeness alone does not identify the trace-sensitive and observable topologies. Multiplication is continuous on the quotient of composable representatives. We characterize when this topology agrees with the ordinary pullback topology and give an open-projection criterion. Universal presentations recover classical fundamental-groupoid topology. Normal forms, primitive interchange, and a Cayley covering prove completeness for circle, torus, product, and rose presentations. A literal-word correspondence relates the semantics to the reflexivity, symmetry, and transitivity fragment of equality derivations. Selected results are formalized in Lean, with the realization models and proof coverage stated explicitly.

code
github.com/Arthur742Ramos/TopologicalComputationalPaths ∎ Lean project (lakefile.toml, lean-toolchain) builds with 8 sorry warnings at ea1367d, checked 2026-11-04 build details
comments
34 pages, 10 figures. Substantially revised and retitled; expanded presentation-invariance results, observable-quotient counterexamples, and geometric completeness examples; clarified formalization scope. Lean artifact: https://github.com/Arthur742Ramos/TopologicalComputationalPaths
fields
Algebraic Topology
pdf ↗ page arXiv:2608.04228 ↗

The low-degree method predicts computational thresholds by asking whether low-degree polynomials can distinguish a planted distribution from a null one. Recent counterexamples by Buhai, Hsieh, Jain, and Kothari (FOCS 2025) and Mao (2026) show that low-degree indistinguishability does not, in general, rule out efficient algorithms, even on noisy inputs. Hsieh, Kane, Kothari, Li, Mohanty, and Tiegel (STOC 2026) asked what it does imply, and showed that for permutation-invariant distributions on $\{0,1\}^n$, low-degree indistinguishability from the uniform distribution implies statistical indistinguishability after noise. In this work, we study the same question for planted subgraphs in sparse random graphs. Let $Q_n=G(n,c/n)$, and let $P_n$ be obtained by planting a uniformly random copy of a deterministic graph $Γ_n$ into an independent sample from $Q_n$. In the supercritical regime $c>1$, we show that if $P_n$ is degree-$D_n$ indistinguishable from $Q_n$ and the treewidth of $Γ_n$ is $o(D_n/\log n)$, then a noisy version of $P_n$ is asymptotically indistinguishable from $Q_n$. In the critical and subcritical regimes $0<c\le 1$, we obtain the same conclusion without any treewidth assumption, provided $D_n=ω(\log n)$. Our proof has two main ingredients. First, we identify the subgraph-count and automorphism factors in the Fourier expansion with counts of isomorphism triples. Second, we cut a tree decomposition of $Γ_n$ into subtrees, which splits each large Fourier support into low-degree pieces that meet at only a few interface vertices, and we use noise to absorb the cost of reassembling them. At and below criticality, we use the low-degree assumption to rule out short cycles and noise to destroy the remaining long ones.

comments
41 pages, 4 figures
fields
Probability
pdf ↗ page arXiv:2608.06279 ↗

We develop a framework for proving universality results in sparse random graphs. As a first application, we show that there exists an absolute constant $C>1$ such that, with high probability, for every fixed constant $Δ$, the binomial random graph $G(n,C\ln n/n)$ contains every $n$-vertex tree with maximum degree at most $Δ$. This answers a question of Montgomery (Advances in Mathematics, 2019). We also determine, for every $p$ satisfying $C\ln n/n\leq p=n^{-1+o(1)}$, the minimum girth $\ell$ (up to an absolute multiplicative constant) for which with high probability $G(n,p)$ contains all cycle factors of girth at least $Ω(\ell)$. In particular, with high probability $G(n,C\ln n/n)$ contains all cycle factors of girth at least $C\ln n/\ln\ln n$, which is optimal up to a constant factor. This extends an earlier result of Ferber, Kronenberg, and Luh (Transactions of the American Mathematical Society, 2019) and significantly improves a corollary of a deep result of Kahn, Lubetzky, and Wormald (Communications on Pure and Applied Mathematics, 2017). One of the key ingredients in the proofs is establishing the optimal depth of linking systems in sparse random graphs.

comments
59 pages, 2 figures, comments are welcome!
fields
Combinatorics, Probability
pdf ↗ page arXiv:2608.06358 ↗

In this paper, we investigate the moduli space of algebraic asymptotic hyperkähler structures on hyperkähler quotients arising from a quaternionic vector space $\mathbb{H}^n$. We consider the period map on this moduli space, and prove a Torelli-type theorem (i.e., the bijectivity of the period map) under mild assumptions including the surjectivity of the Kirwan map. This work provides an algebro-geometric generalization of the Torelli-type theorem for ALE gravitational instantons by Kronheimer (1989). In particular, this theorem applies to toric hyperkähler varieties and Nakajima quiver varieties.

comments
30 pages. v2: §4.5.2 (algebraicity via twistor spaces) revised
fields
Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2608.08680 ↗

We introduce and study monoidal and symmetrized versions of parametrized topological complexity. First, we develop parametrized analogues of the monoidal topological complexity theories of Iwase–Sakai, Aguilar-Guzmán–González (based on the Fadell–Husseini approach), and Dranishnikov. We investigate the parametrized Iwase–Sakai conjecture and provide sufficient conditions under which it holds. We then introduce symmetrized parametrized topological complexity and combine it with the monoidal perspective to define monoidal symmetrized parametrized topological complexity, showing that the resulting notions agree. Finally, we compute these invariants for Fadell–Neuwirth fibrations.

comments
38 pages. Generalized Proposition 4.4 (fiberwise homotopy invariance of symmetrized parametrized TC) to different bases. Corrected computations for Fadell--Neuwirth fibrations by proving Lemmas 6.2 and 6.3
fields
Algebraic Topology
pdf ↗ page arXiv:2608.08737 ↗

We study the $β=2$ partition function $\int_{|h| \leq \log ^θ q/2}|L(1/2+ih,χ)|^2dh$ for typical Dirichlet characters modulo a large prime $q$ and $θ\in (-1/3,0]$ motivated by a $q$-analogue of the Saksman–Webb conjectures. When $θ<0$, we use an extension of Harper's randomisation argument with different localisations to recover moment upper bounds consistent with the critical normalisation predicted there. As an application, we prove that for $q(1-o(1))$ Dirichlet characters modulo $q$ with $U(q) \to \infty$, $$\max_{|h| \leq 1/2}|L(1/2+ih,χ)|\ll \frac{e^{U(q)}\log q\log_3 q(\log_4 q)^{1/2}}{(\log_2 q)^{3/4}},$$ establishing an upper bound matching the predictions of the $q$-analogue of the Fyodorov–Hiary–Keating conjectures up to second order. Our proofs adapt Harper's argument in \cite{harper2019partition}.

comments
35 pages. Fixed multiple issues in Sections 4 and 5, reworked the proofs and better exposition. Comments welcome
fields
Number Theory, Probability
pdf ↗ page arXiv:2608.09906 ↗

We classify universal divisor-profile separation for coprime polynomial pairs of arbitrary degree and for all pairs of degree at most two. For \(A\subset\N\) and \(m\in\Z\), let \(d_A(m)\) count the members of \(A\) dividing \(m\). For coprime nonzero \(F,G\in\Z[x]\), universally unbounded separation between \(d_A(F(n))\) and \(d_A(G(n))\) occurs if and only if one of \(F,G\) is intersective, that is, has a root modulo every positive integer. More generally, an intersective factor separated from finitely many polynomial opponents yields simultaneous one-sided dominance against all of them. For pairs with common irreducible factors, let \(U,V\) be the products of the factors occurring only on the two respective sides. Universal separation forces \(UV\) to have a root modulo almost every prime; equivalently, its Galois action has no derangement. We resolve the remaining finite \(p\)-adic boundary for all pairs of degree at most two: separation holds exactly when \(UV\) and at least one of \(F,G\) are intersective, and the criterion is unchanged by contents or factor multiplicities. The same criterion holds, in arbitrary degree, for three linear support factors with arbitrary positive multiplicities. The proofs combine uniform almost-prime values on root progressions with an adaptive local-routing argument.

fields
Number Theory
pdf ↗ page arXiv:2608.13388 ↗

Indefinite integrals are found for 63 half-integer Bessel and Struve functions, and incomplete gamma functions with integer indices, each multiplied by $Exp(-ax^{2})$ and divided by powers. A series solution is given for the individual terms (of any inverse power) in such functions, split into even and odd portions. Eight integrals are given involving these series. Three infinite sets of auxiliary integrals are also given.

comments
34 pages
fields
General Mathematics
pdf ↗ page arXiv:2608.14751 ↗

We study the $\mathbf{I}^*$-cohomology of a smooth real algebraic curve in terms of its real locus and its geometric genus. We notably extend results of Knebusch and Monnier to the twisted case. We further describe how to compute twisted Witt groups of surfaces, generalising work of Sujatha, and apply our results to the computation of the shifted and twisted Witt groups of the smooth real anisotropic quadric surface. Finally, we extend Monnier's investigation of the image of the global signature homomorphism for surfaces.

comments
31 pages. v4: greatly streamlined, study of (Chow--)Witt groups of quadrics reduced to the Witt groups of the smooth real anisotropic surface, removed investigation of Pardon spectral sequence, comments still welcome
fields
Algebraic Geometry, K-Theory and Homology
pdf ↗ page arXiv:2608.18599 ↗

Let $X$ be a metrizable space, and let $\mathrm{Met}(X)$ denote the space of metrics compatible with the topology of $X$, regarded as a subspace of the space of continuous pseudometrics with the topology induced by the supremum metric. We first prove that if $Z$ is a discrete space whose cardinality is the first uncountable cardinal, then $\mathrm{Met}(Z)$ is not Borel. As a consequence, if $\mathrm{Met}(X)$ is Borel, then $X$ is separable. Combined with a theorem of Koshino, our result yields that the space of bounded compatible metrics on a metrizable space $X$ is completely metrizable if and only if $X$ is $σ$-compact. We also establish non-Archimedean analogues for spaces of ultrametrics. We further prove componentwise versions of these results, where two metrics belong to the same component if their distance is finite.

comments
26 pages. This paper builds upon arXiv:2608.11023(https://arxiv.org/abs/2608.11023)
fields
General Topology, Metric Geometry
pdf ↗ page arXiv:2608.19618 ↗

We explain the relation between the relative topological Hochschild homology $\THH(R/\Sphere_{W(k)}[x_0,\ldots,x_n])$ and the Nygaard-completed Frobenius-twisted relative prismatic cohomology $\widehat{\Prism}^{(1)}_{R/W(k)[x_0,\ldots,x_n]^\wedge}$, where $W(k)[x_0,x_1,\ldots,x_n]\rightarrow R$ is relatively quasiregular semiperfectoid. As an application, for $R=\Z_p[x]/(px)$, we compute $π_*\THH(R)^\wedge_p$ by descent along $\THH(R)^\wedge_p\rightarrow \THH(R/\Sphere_p[z,x])$, where $R$ is regarded as an $\Einfty$-$\Sphere_p[z,x]$-algebra via $\Sphere_p[z,x]\xrightarrow{z\mapsto p,x\mapsto x}\Z_p[x]/(px)$.

comments
28 pages
fields
Algebraic Topology
pdf ↗ page arXiv:2608.19829 ↗

A learning architecture induces a prior over its expressible models. Recent work links architectural success to a broad complexity spectrum: model probabilities spanning many orders of magnitude. Understanding how depth shapes these priors and prediction may help explain the success of neural networks and transformers. We study this connection in large-alphabet prediction through the *layered simplex architecture* (LSA), which multiplies independent uniform simplex vectors coordinate-wise and normalizes. At depth zero, the prior is concentrated on the uniform distribution; at depth one, the Bayesian predictor is Laplace's rule. Each additional layer shifts prior mass toward more concentrated distributions. We derive exact Bayesian marginal likelihood and regret expressions using reusable depth-specific kernels. Mixing over depths up to a cutoff logarithmic in alphabet size yields an explicit predictor with rigorous guarantees. For targets uniform on a specified sparse support, the mixture's prior complexity is asymptotic to the support-description cost at every fixed positive KL resolution, establishing a broad complexity spectrum. We also prove a regret lower bound for every label-invariant predictor: the expected description length of the discovered symbol set minus the source's uncertainty about its identity given its size. For Zipf sources in a growing-alphabet regime, the depth mixture attains this bound to leading order. Thus, the symbol-discovery rate determines the regret exponent. Although introduced to study depth, the LSA predictor competes with established large-alphabet methods, including Good–Turing, Ristad's law and an adaptive Dirichlet mixture, while substantially outperforming classical add-constant rules on concentrated sources.

fields
Information Theory
pdf ↗ page arXiv:2608.19908 ↗

We study the one-dimensional quasilinear Majda–McLaughlin–Tabak (MMT) equation on a large torus $[0,L]$: \begin{align*} i \partial_t u +2π|\nabla|^σu +λ^{2}|\nabla|^β\left[ \left||\nabla|^βu\right|^{2} |\nabla|^βu\right]=0, \end{align*} with $σ\in(0,1)\cup (1,2]$ and $0<β<σ/4$. We consider Gaussian random initial data and work in the joint limit $L\to\infty$ with $α=λ^2L^{-1}\to0$. The quasilinear structure leads to unavoidable derivative loss, which prevents the direct construction of solutions via iteration of the Duhamel formula. For $σ\in(1,2]$, we prove that, with high probability, solutions exist up to time scales ${T} \simα^{-{\frac43}+} \wedge α^{-\frac1{σ/2-β}+}$, and that only trivial four-wave resonances occur, leading to a degenerate wave kinetic equation. For $σ\in(0,1)$, we prove the existence up to time scales $T\sim α^{-\frac43+}$, and show that the second-order statistics are well approximated by the wave kinetic equation. In both cases, the solutions remain smooth while exhibiting smallness in suitable $L^\infty$-based norms. The proof combines propagation of randomness for a truncated equation with deterministic energy estimates and a bootstrap argument. The main technical difficulties arise in the regime $σ\in(0,1)$. At low frequencies, the counting argument requires simultaneous control of the frequency gap and the associated resonant phase gap. In the energy estimate, nontrivial resonances generate quartic terms that prevent the energy estimates from closing the bootstrap on $[0,T]$. To overcome this obstruction, we develop a new normal-form $L^2$ energy estimates, using distinct frequency truncations for the initial data and the nonlinearity.

comments
80 pages
fields
Analysis of PDEs, Mathematical Physics, Probability
pdf ↗ page arXiv:2608.22710 ↗

It is proved that, for every $δ\in (0,1)$, the Glauber dynamics for the uniform distribution on proper $q$-colorings is rapidly mixing when $q \geq (1+δ)Δ$ and the underlying graph has girth at least $5$ and maximum degree $Δ= Ω_δ(1)$. This result also extends to general multi-spin systems satisfying a $\textit{local spectral contraction}$ condition, including the anti-ferromagnetic Potts model with $q\geq (1+δ)(1-β)Δ$. These results are achieved by a new spectral local-to-global principle on graphs with girth at least five for general multi-spin systems, and a novel Fourier analysis for Glauber dynamics on a star. The main ideas behind all the proofs were developed through several rounds of interaction with GPT-5.6 Sol Ultra.

fields
Probability
pdf ↗ page arXiv:2608.25491 ↗

Barría and Halmos [\emph{Trans. Amer. Math. Soc.} (1982), (10) Example] asked whether the Cesàro operator belongs to the Toeplitz algebra. We answer this question affirmatively and prove that the Cesàro operator is the product of a Toeplitz operator and a continuous function of a self-adjoint Toeplitz operator. Rhaly operators are a natural generalization of the Cesàro operator. We give necessary and sufficient conditions for a Rhaly operator to belong to the Toeplitz algebra or the Hankel algebra. The main approach is to use the Fejér kernels to get localized estimates for operators. This yields a necessary condition for an operator to belong to the Hankel algebra. As an application, we find a class of Rhaly operators that are asymptotic Toeplitz operators and essentially commute with the unilateral shift, but are not in the Hankel algebra. This answers (17) Question in the same paper.

comments
24 pages, 1 figure
fields
Functional Analysis
pdf ↗ page arXiv:2608.25740 ↗

We study nearest and farthest Voronoi diagrams of lines in three-dimensional Euclidean space, which partition space according to the closest and farthest input lines, respectively. For arbitrary lines, a gap remains between the known quadratic lower bound and near-cubic upper bounds for the complexity of the nearest diagram. We consider input lines chosen from one of two continuous families of straight lines on a smooth surface defined by a quadratic equation, with one line from each family passing through every point of the surface. Under the geometric assumptions stated in the paper, we prove quadratic upper bounds on the total number of vertices, edges, faces, and connected three-dimensional regions in both diagrams. We also construct quadratically many nearest vertices using lines from a single family on one fixed surface, establishing a tight quadratic worst-case bound. The farthest diagram has quadratic total complexity for every input satisfying our assumptions. Our proof uses a parametrization that arranges the input lines in a cyclic order and expresses tangency to a sphere by a polynomial equation of degree four. At a Voronoi vertex, the four tangent input lines give four distinct roots. The sign changes between these roots, together with the nearest or farthest condition, force two intervening parameter intervals to contain no other input parameters. Thus, only quadratically many choices of four lines can define a vertex, and each choice yields at most eight isolated candidate centers.

comments
Added a coauthor, more detailed explanations of algebraic geometry, and additional figures
fields
Algebraic Geometry
pdf ↗ page arXiv:2608.27114 ↗

This paper develops the first distributed cross-layer algorithm for joint congestion control, routing, scheduling, and power control in covert multi-hop, multi-modal wireless networks, where adversarial wardens (Willies) monitor radio modalities via energy detection. The Detection Error Probability (DEP), the probability that a Willie fails to reliably detect ongoing transmissions, is generally non-concave in the transmit powers, making DEP-based covert network optimization challenging. We resolve this by constructing the tightest concave lower bound on the log-DEP, yielding a conservative convex problem that guarantees satisfaction of the original DEP constraints and unifies hard covertness constraints and covertness-utility maximization in a single problem. We develop a Parallel Proximal Alternating Direction Method of Multipliers (PP-ADMM) algorithm for the resulting cross-layer problem and prove global Q-linear convergence, i.e., exponentially fast convergence, to the set of optimal solutions under standard regularity conditions. Numerical results confirm linear convergence and demonstrate robust tracking performance under channel fading and Willie mobility.

comments
18 pages, 6 figures. Full technical report corresponding to the paper accepted to IEEE MILCOM 2026
fields
Information Theory
pdf ↗ page arXiv:2608.28469 ↗

Koopman autoencoders (KAEs) seek a higher-dimensional latent representation in which nonlinear dynamics evolve linearly. However, many interesting systems have multiple basins of attraction, and both theoretical and empirical work has shown these multibasin systems cannot generally admit a single finite-dimensional global Koopman embedding under standard assumptions. We posit that encoders with a sparsity-inducing objective encouraging few active latent coefficients will provide latent supports as an inspectable basin-modeling principle for Koopman autoencoders. We use these encoders producing sparse latents in training Sparse Koopman Autoencoders (SKAEs) without basin labels or other regime annotations, and treat the learned latent supports as model-produced regime variables after training. Across a range of procedurally generated multibasin systems and chaotic flows, we show that SKAEs have superior forecasting performance compared to dense-latent KAEs. We also perform a mechanistic study that shows latent supports produced by SKAEs are both essential for the quality of the representation and useful for identifying basins on basin-interior states, whereas dense-latent KAEs collapse to an uninformative single support family. These results identify sparse latents and their corresponding supports as label-free, interpretable regime variables for Koopman learning in nonlinear systems with multiple local dynamical laws.

comments
v3: changed code url. Accepted at NeurIPS 2026. 33 pages (10 pages main text) including references and appendices, 6 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2608.29057 ↗

We study the Brill–Noether theory of higher rank sheaves on surfaces $X$ with $H^1(X,\mathcal{O}_X) = 0$ and its interactions with the classical Brill–Noether theory of line bundles on curves lying on $X$. Denoting by $\mathrm{Spl}(v)$ the moduli space of simple sheaves on $X$ with Chern character $v = (r,c_1,\mathrm{ch}_2)$, we introduce the Brill–Noether loci $BN^k(v)^\circ \subseteq \mathrm{Spl}(v)$ of \emph{generically $k$-generated} sheaves and show, under assumptions on $c_1$ and $K_X$, certain well-behavedness results. In particular, if $c_1$ is \emph{indecomposable} and $X$ is a K3 surface, we generalize a Brill–Noether theorem for sheaves on K3s due to Yoshioka. This is achieved by employing He's deformation theory of the moduli space of coherent systems and a globalization of the Lazarsfeld–Mukai construction, providing a correspondence between the Brill–Noether theories of generically $r$-generated sheaves on $X$ and that of line bundles on curves $C \in |c_1|$. The same techniques yield upper bounds on the dimension of $\mathcal{W}^{r,\mathrm{bpf}}_d(|c_1|) \setminus \mathcal{W}^{r+1}_d(|c_1|)$ consisting of basepoint-free line bundles in terms of the number of endomorphisms of associated Lazarsfeld–Mukai bundles, for arbitrary $c_1$. This generalizes a result of Aprodu and Farkas in the context of Green's conjecture beyond K3 surfaces. In the case $r = 1$ of pencils, we obtain smoothness and expected-dimension results under an effectivity condition on $-K_X|_C$ for $C \in |c_1|$. As an application, we prove Green's conjecture for the general curve on a rational surface with a nef and effective anticanonical divisor.

comments
Comments welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2609.06824 ↗

Markov chain central limit theorems (CLTs) and their associated variances are very important for implementing Markov chain Monte Carlo algorithms among other applications. Häggström and Rosenthal (2007) presented various results regarding the equality of different formulae for this variance and also posed seven open problems. We resolve all seven in this paper. Our main result is a general characterization of Markov chain CLTs: for stationary and ergodic Markov chains, we prove that the normalized partial sums satisfy a $\sqrt{n}$-CLT if and only if the Poisson equation admits a finite solution with square-integrable martingale differences whose second moment equals the CLT variance. In particular, this result does not require reversibility of the chain or square integrability of the function. It implies that Roberts' holding-probability condition always precludes a $\sqrt{n}$-CLT, and for reversible chains, whenever a $\sqrt{n}$-CLT holds, the variance limit is finite if the function is square-integrable, otherwise undefined. In addition, we develop a general principle that expresses Fourier coefficients as the autocovariances of an ergodic nonreversible Markov chain.

comments
26 pages
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2609.07819 ↗

We prove the sharp Hausdorff–Young inequality on quantum euclidean spaces. Our result implies the sharp Hausdorff–Young constants for the Weyl transform. The key ingredients are a sharp Hessian comparison inequality and a novel flow related to the mixed- norm of noncommutative Gabor transform; the Hessian comparison leads to the monotonicity of the flow. We also apply the same flow technique to prove the sharp Hausdorff–Young inequalities on Heisenberg groups and the affine group.

comments
Submitted version. This manuscript was submitted to the journal in mid-Oct.,2026
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2609.10424 ↗

We show that Max Independent Set (MIS) remains NP-hard in graphs excluding the $5 \times 5$ grid as an induced minor. This negatively answers a question of Dallard–Milanič–Štorgel that has attracted sustained attention, and refutes a conjecture by Gartland and Lokshtanov. Unless $N$-variable 3-SAT can be solved in time $2^{\mathcal O(N^{1-\varepsilon})}$ for some $\varepsilon > 0$, MIS requires $2^{Ω(n^{1/2-o(1)})}$ time on $n$-vertex graphs in this class. This complements a $2^{\widetilde{O}(n^{2/3})}$-time algorithm on any $H$-induced-minor-free class by Korhonen and Lokshtanov. Exploiting a connection between low twin-width or reduced parameters on one hand and planar-induced-minor-freeness on the other, we further show that 3-Coloring, Feedback Vertex Set and Dominating Set are NP-complete on weakly sparse graphs of reduced component max-leaf (hence twin-width) at most 3, even when a witnessing contraction sequence is given. Classes of bounded reduced component max-leaf (by any constant) and of twin-width at most 3 are known to exclude a fixed planar graph as an induced minor. The 3-Coloring and Feedback Vertex Set results refute more cases of the Gartland–Lokshtanov conjecture, even when the inputs are weakly sparse. The complexity of MIS in weakly sparse graphs excluding a planar induced minor remains open.

comments
34 pages, 11 figures
fields
Combinatorics
pdf ↗ page arXiv:2609.11285 ↗

Let $A_1,\ldots,A_n$ be independent $d \times d$ real symmetric Gaussian random matrices, and consider the linear operator $A(x) = n^{-1/2}\sum_{i=1}^n x_iA_i$, $x\in \mathbb R^n$. We construct an iterative algorithm in the Approximate Message Passing family which iterates over $A$ and its adjoint $A^*$, and establish a state evolution result which characterizes its behavior in the limit $d\to \infty, 2n/d^2 \to α$ in terms of a correlated Gaussian-semicircular process in a free probability space, in the sense of strong convergence of operators. We then apply this iteration to the random matrix discrepancy problem which asks for a binary vector $x \in \{-1,+1\}^n$ such that $A(x)$ has a small operator norm. Our algorithm achieves an operator norm $2σ(α)$, for a standard deviation $σ(α)<1$ for all $α>0$, and $σ(α) = O(1/\sqrt{α\log α})$ for large $α$. This resolves the algorithmic question of Kunisky-Zhang (2023) and Maillard (2025).

comments
Revised version contains stronger results on random matrix discrepancy, further minor edits, and an updated bibliography
fields
Probability
pdf ↗ page arXiv:2609.11836 ↗

6G is expected to push ultra-reliable low-latency communication (URLLC) toward stringent residual-error tar- gets for mission-critical services, where undetected errors and erasures carry fundamentally different costs. Block error rate (BLER) conflates block confusions (undetected errors) and block erasures, which have fundamentally different impacts on system reliability. To characterize the confusion rate analyt- ically, we consider an error-bounded decoder with spherical decision regions. We focus on square quadrature amplitude modulation (QAM) constellations in the finite blocklength (FBL) regime. The confusion rate is governed by the Euclidean distances between modulated codewords, whereas the code structure constrains their Hamming distances. To bridge the two metrics, we introduce a typical distance, which represents the Euclidean distance of a codeword pair at a given Hamming distance on average, and relate it to the Hamming distance through a per-symbol squared-distance coefficient. On this basis, we derive a lower bound on the block confusion rate for random codes and an upper bound for codebooks whose minimum Euclidean distance reaches the typical distance at the non-overlapping threshold. We further characterize how both bounds evolve with the average symbol energy and the block- length. Numerical results, validated by an exact computation for short codes, confirm that as the signal-to-noise ratio (SNR) or redundancy increases, the confusion rate falls many orders of magnitude below the reliability target, leaving detectable erasures as the dominant residual error.

comments
Submitted to IEEE ICC 2027
fields
Information Theory
pdf ↗ page arXiv:2609.12631 ↗

A uniform magnetic field completely suppresses long-time dispersion for the Euclidean Landau Hamiltonian. We show that negative curvature fundamentally changes this behavior. For the Landau Hamiltonian with arbitrary field strength $B\in\mathbb R$ on the hyperbolic plane $\mathbb H$, we establish sharp dispersive estimates for the Schrödinger evolution on the absolutely continuous spectral subspace. The decay is $|t|^{-1}$ at short times and, strikingly, improves to $|t|^{-3/2}$ at large times whenever $B\notin\frac12+\mathbb Z$. At half-integer fields, we identify a threshold resonance and isolate its leading contribution, which yields the slower but sharp rate $|t|^{-1/2}$. Thus the long-time dynamics exhibit a resonance-driven dichotomy with no analogue in the flat constant-field problem. Our analysis is based on an explicit representation of the magnetic Schrödinger kernel together with a precise separation of the Landau levels and threshold profile. As a further consequence, for every nonthreshold field we obtain global-in-time Strichartz estimates on the absolutely continuous spectral subspace throughout the full hyperbolic admissible region.

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

An identifiability criterion is a condition on a tensor decomposition that certifies uniqueness when the condition holds. Kruskal's classical condition is one of the best-known deterministic criteria for identifiability. However, no polynomial-time decomposition algorithm is known under the Kruskal condition; verifying the condition itself is NP-hard. Lovitz and Petrov introduced a strictly more general identifiability condition which, in contrast, is polynomial-time verifiable, but no polynomial-time decomposition algorithm was known under this condition either. In this paper we give a randomized polynomial-time algorithm, in the algebraic model over $\mathbb R$, for tensor decomposition under the Lovitz–Petrov condition, and therefore also under the stricter Kruskal condition. Moreover, combining our algorithm with polynomial-time verification of the Lovitz–Petrov condition yields an efficient end-to-end certification procedure: after computing a decomposition, one can deterministically certify in polynomial time that it is unique and therefore of minimum rank.

fields
Combinatorics
pdf ↗ page arXiv:2609.13693 ↗

In this paper, we derive an explicit solution of the stationary prediction with expert advice PDE for five experts. The formula is given in three regions. In the first two regions, it is the four-expert solution plus a single integral with an elementary positive density. In the third region, it is a finite sum of hyperbolic products whose coefficients are determined by one scalar quadrature. Our formula establishes that the rank ordered adversary $(1,0,1,0,0)$ achieves the Hamiltonian maximum in the PDE everywhere in the ordered sector, while the COMB strategy $(1,0,1,0,1)$ is optimal only on a lower dimensional subset of the sector (where $x_1=x_2$ and $x_3=x_4$). The verification of the Hamiltonian inequalities is a tedious task, part of which is completed with a computer assisted proof. The verification reduces to 21 scalar inequalities, which we prove using 147 exact rational Bernstein polynomial certificates. The exact certificates and their independent arithmetic checks are included in a supplement to this paper, and a Lean 4 formalization machine-checks the verification and both main theorems, apart from the viscosity characterization.

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

Hypergraphs provide a natural framework for modeling higher-order relationships, but the development of spectral techniques with provable guarantees for general non-uniform hypergraphs remains challenging. Building on Banerjee's normalized adjacency matrix and Spiro's averaging-based diffusion framework, we develop a spectral framework for non-uniform hypergraphs and establish Cheeger's inequality for their conductance. A fundamental result in the spectral theory of hypergraphs asserts that, for every non-covering hypergraph, the second-smallest eigenvalue of its normalized Laplacian is at most one. This spectral characterization yields an improved Cheeger's inequality for non-covering hypergraphs, and we show that the resulting inequality is tight on both sides using cycle and cube hypergraphs. Our framework further yields higher-order Cheeger inequalities and provides theoretical guarantees for Fiedler's spectral partitioning algorithm, all in the setting of hypergraphs. Finally and most notably, we construct a new family of optimal hypergraph expanders that is tight for the Alon-Boppana bound.

fields
Combinatorics
pdf ↗ page arXiv:2609.16286 ↗

Cladograms of size $n$ are unrooted binary trees whose leaves are labelled from 1 to $n$. Aldous introduced in 2000 a Markov chain on cladograms, a step of which consists of removing a leaf uniformly at random and reinserting it on a uniformly chosen edge. We introduce a coupling for this walk, which follows multiple colored subtrees in parallel. We go around the lack of independence of the colored components by finding a relevant statistic, namely the sum of the squares of the sizes of all colored components, which we prove has a drift. We deduce that the mixing time of the walk is of order $n^2$, solving a conjecture of Aldous.

comments
12 pages, 6 figures, comments welcome!
fields
Probability, Combinatorics
pdf ↗ page arXiv:2609.16955 ↗

We give a deterministic polynomial-time algorithm that, given rational Hermitian matrices $H_1,\dots,H_N$ of rank at most one, finds signs $s\in\{\pm1\}^N$ with $\|\sum_i s_i H_i\|\le 13\|\sum_i H_i^2\|^{1/2}$. As a corollary, for vectors $v_i$ with $\sum_i v_iv_i^*=I$ and $\|v_i\|^2\leδ$, the signs yield a partition $[N] = S_1 \cup S_2$ such that each part satisfies $\|\sum_{i \in S_j} v_i v_i^* - \frac{I}{2}\| \leq \frac{13}{2}\sqrtδ$ for $j = 1,2$. This gives a deterministic polynomial-time algorithm for the Kadison–Singer problem, in Weaver's equivalent discrepancy-theoretic $\mathsf{KS}_2$ formulation, with a universal constant.

fields
Combinatorics, Functional Analysis
pdf ↗ page arXiv:2609.17266 ↗

We prove the existence of solutions to the Lorentzian Monge problem on synthetic Lorentzian spacetimes that satisfy the forward timelike measure contraction property $TMCP^+(K,N)$. The cost for this problem is the time separation function $\ell(x,y)$ (the Lorentz distance), which represents the maximum amount a particle can age when traveling from $x$ to $y$. The solution is based on the needle decomposition technique, and amounts to a reduction of the full problem to its one-dimensional counterparts. As an application of needle decomposition, we introduce the blended $TMCP$ condition, and obtain a quantitative refinement of the synthetic Hawking singularity theorem. We additionally prove a timelike nonbranching reversibility theorem for $TCD_p(K,N)$ spacetimes, showing that forward $p$-essentially nonbranching spacetimes are backward $p$-essentially nonbranching.

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

Faster quantum gates can reduce the decoherence accumulated during a computation, but in superconducting processors, speeding up gates often involves stronger microwave pulses, which can increase leakage, off-resonant excitation, stray-field errors, and crosstalk. This creates a central energy–speed–error tradeoff: can quantum state engineering make a gate faster without paying proportionally more drive energy? We address this question by treating the driving pulse as a quantum bosonic field rather than a classical waveform. For a finite-dimensional system coupled linearly to that field, we prove that gate transition rates at fixed trace distance between the initial and final system states grow at most as the square root of the pulse energy, under pulse-uniformity conditions, without assuming an upper bound on the coupling strength. The bound permits arbitrary pulse states, including squeezed and non-Gaussian states, as well as drive–system entanglement and back action; coherent Gaussian pulses attain its energy exponent. Thus squeezing or other state engineering alone cannot replace the square-root energy law of a conventional linear drive by the linear scaling allowed by general quantum speed limits. Achieving that improvement requires changing the interaction class, in addition to using a suitable nonclassical pulse, thereby identifying interaction nonlinearity as an essential resource for relaxing the practical gate-speed error tradeoff.

comments
Proves same bounds but under much weaker assumptions. Added operational interpretation of physical assumptions. 5 + 36 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2609.19280 ↗

Phase reduction is a powerful technique to obtain phase models from high dimensional oscillatory systems. Starting from pairwise interactions, a first order approximation yields Kuramoto and Winfree phase models, while nonpairwise interactions emerge at the second order. Recently, phase models have been extended to account for nonpairwise interactions, notably, the higher-order Kuramoto model. Is there an intrinsic difference between physical and emergent nonpairwise interactions? And can we make use of the former to even out the effects of the latter? In this work, we exploit a recently developed parametrization method to compute the phase reduction and answer these questions. After a comparison of the new method with the classic Kuramoto-style phase reduction, we derive the network motifs of the emergent nonpairwise interactions and compare them with the physical once. Lastly, we exploit the motifs to adopt a coupling design approach. Our framework paves the way for further exploitations of physical nonpairwise interactions for applications in synchronization engineering.

fields
Dynamical Systems
pdf ↗ page arXiv:2609.20632 ↗

We study first-order black-box convex optimization over an $\ell_p$-ball for objectives Lipschitz in the $\ell_q$-norm, solving in the affirmative the nonsmooth version of the COLT open question (Guz15b) on whether the geometry of a smaller feasible set ($p < q$) can improve convergence rates in convex optimization, and matching prior lower bounds up to logarithmic factors. Our rates include $\widetilde{O}(1/T)$ for convex Euclidean-Lipschitz optimization over the $\ell_1$-ball, improving on the $O(1/\sqrt{T})$ classical rate under general assumptions. The key technical device is a new online learning game, where the comparator is evaluated using the maximum of affine losses observed so far. We bound the value of this game above and below in terms of a combinatorial online learning quantity: the sequential fat-shattering dimension, which we characterize for the $\ell_p / \ell_q$ case. Our results generally apply when the feasible set $\mathcal{X}$ and the set of possible subgradients $\mathcal{H}$ admit a type of minimax theorem, advancing on a fundamental question by Sridharan (Sri12, Section 10.1.2, Q3). As a geometric consequence of our analysis, of independent interest, we obtain estimates for the expected distance of a convex hull of samples to their mean in several Banach geometries, a version of the celebrated Wendel's theorem (Wen62), but quantitative and for bounded general distributions as opposed to centrally symmetric ones.

comments
Polished writing. Small additions (quasar-convex optimization, clarification regarding optimizing in a subset...)
fields
Optimization and Control
pdf ↗ page arXiv:2609.20687 ↗

We study efficient algorithms for realizing the first-order oracle complexity of optimization of $G$-Lipschitz convex functions with respect to the $\ell_q$-norm over an $\ell_p$-ball of radius $R$, where $1\leq p,q\leq\infty$. For $p<q$, we obtain error $\widetilde{O}_{p,q}(GR/T^{1/p-(1/q-1/2)_{+}})$ after $T$ oracle queries, attaining the lower bounds in a COLT 2015 open problem (Guz15b) with efficient algorithms. In particular, the rate is $\widetilde{O}(GR/T)$ for Euclidean Lipschitzness with an $\ell_1$-ball domain of radius $R$ ($p=1,q=2$). Our solution consists of reducing convex Lipschitz optimization to the chasing nested convex sets problem (BBE+20) in sublevel sets of an evolving maximum of affine lower bounds, that is, the bundle (LNN95): at each query we either find a point with low function value or we produce a deep cut in the current sublevel of the bundle that we chase. The dichotomy between stability of selectors and forced movement by deep cuts bounds the number of iterations of the algorithm nearly optimally. For nested convex subsets of the $\ell_p$ ball $R B_p^d$, we introduce novel stable selectors whose movement is nearly optimal in high dimensions. A Monte Carlo average of the proposed selector achieves near-optimal rates with high probability and can be implemented for our optimization algorithm in polynomial time in the real-arithmetic model.

comments
polished writing, added a few more general results (such as a better lower bound, and a more general potential-energy center)
fields
Optimization and Control
pdf ↗ page arXiv:2609.20701 ↗

The transmission eigenvalue problem plays an increasingly important role in inverse scattering theory. Although significant progress has been made in developing efficient numerical methods for the problem over the last two decades, its numerical treatment for curved domains in $\mathbb{R}^d$ ($d=2,3$) remains challenging. In this paper, we introduce and analyze a geometrically flexible and $H^2$-conforming isogeometric method for solving a fourth-order, quadratic and non-self-adjoint eigenvalue problem arising from the Helmholtz transmission eigenvalue problem. Using the spectral approximation theory for compact non-self-adjoint operators, we derive optimal error estimates for the discrete eigenvalues and eigenfunctions. Numerical results for the two- and three-dimensional benchmark problems, including those defined in curved domains, are presented to verify our theoretical results, and to demonstrate the advantages of the method over existing numerical methods in terms of both accuracy and geometric flexibility.

fields
Numerical Analysis
pdf ↗ page arXiv:2609.21862 ↗

The Komlós problem asks for signs $\varepsilon\in\{-1,1\}^n$ with $\|A\varepsilon\|_\infty$ bounded by an absolute constant whenever the columns of $A\in\mathbb R^{m\times n}$ have Euclidean norm at most $1$. We give the first polynomial-time algorithm for this problem in the unit-cost real-RAM model. Our deterministic algorithm achieves discrepancy at most $8272$. As a consequence, we obtain a deterministic $O(\sqrt t)$-discrepancy algorithm for the Beck-Fiala problem on set systems in which each element belongs to at most $t$ sets. Our algorithm rounds a fractional coloring while keeping the row sums bounded. Its key idea is to keep the number of nearly tight row constraints small relative to the number of active coordinates. We achieve this through a spectral bound based on a weighted Gram matrix of squared row entries. We maintain the bound using a cubic spectral potential and negative-curvature updates that satisfy the required linear constraints.

comments
23 pages, no figures
fields
Combinatorics
pdf ↗ page arXiv:2609.23540 ↗

We study the following general situation. Let $R\to S$ be a finite flat morphism of regular rings of zero (resp. prime) mixed or (equi)-characteristic. For $P\in Spec R$, put $A=R/P, C=S/PS,$ and $B=S/\sqrt{PS}=C_{\mathrm{red}}.$ The basic question is whether a property of $B$ forces the same property of $A$. The main point is that ordinary finite-flat descent applies naturally to $A\to C$, whereas the passage $C\to C_{\mathrm{red}}$ may (not) destroy nilpotent information.

fields
Commutative Algebra
pdf ↗ page arXiv:2609.24577 ↗

We show that for any number field $K$ and any rational map $f$ in $K(x)$ of degree at least $2$ that is not conjugate to a power, (signed) Chebyshev or CM Lattès map, $K^{\mathrm{ab}}$ has the strong Bogomolov property for the canonical height of $f$. Combined with former results of Amoroso-Zannier, Pottmeyer and Ratazzi, this implies that $K^{\mathrm{ab}}$ has the Bogomolov property for canonical heights of any rational map of degree at least $2$. We also classify the pairs $(f,α)$ whose backward orbit contains infinitely many abelian points. This settles the Andrews–Petsche conjecture in the greater generality of rational maps over a number field and infinite abelian subsets of backward orbits. The authors were led to the main idea of the proof in conversation with \emph{Astra}. The key insight consists of applying Yuan's equidistribution results, followed by a classification of $(f,f)$-preperiodic curves due to Pakovich and Beaumont followed by an additional application of equidistribution on a parametrized preperiodic curve.

fields
Number Theory
pdf ↗ page arXiv:2609.24938 ↗

In the binary diameter problem, the input consists of explicitly given permutations generating a finite group $G$ and a binary-encoded number $k$, and the question is whether every element of $G$ is a product of at most $k$ of the given generators. In the binary length problem, the input additionally contains a permutation $g \in G$, and the question is whether $g$ is such a product. We show that the binary diameter problem is PSPACE-complete, thereby confirming a conjecture of Lohrey and Rosowski (2023). Moreover, we show that PSPACE-hardness already holds for solvable groups of derived length at most 3, whereas the problem is $Π_2^{\mathrm{P}}$-complete for 2-step nilpotent groups. For the binary length problem, we establish a sharp complexity threshold: the problem is NP-complete for 2-step nilpotent groups, which extends a result of Lohrey and Rosowski for abelian groups, and PSPACE-complete for groups that are simultaneously 3-step nilpotent and metabelian, which strengthens the main result of Jerrum (1985). Finally, we show that the unary diameter problem, where $k$ is encoded in unary, is $Π_2^{\mathrm{P}}$-complete for generating sets of the full symmetric group, confirming another conjecture of Lohrey and Rosowski.

fields
Group Theory
pdf ↗ page arXiv:2609.26307 ↗

A metric space is called all-set-homogeneous if every isometry between two of its subsets extends to an isometry of the whole space. We classify all-set-homogeneous length spaces: besides the classical examples, they include the universal metric trees of finite valence.

comments
22 pages, 9 figures
fields
Metric Geometry, Differential Geometry
pdf ↗ page arXiv:2609.26410 ↗

We consider the Cauchy problem for semilinear classical damped wave equations with general nonnegative nondecreasing nonlinearities, without imposing a modulus-of-continuity structure or convexity. A Dini-type integral condition expressed directly in terms of the nonlinearity gives small data global in-time existence and extends the nonlinear framework of Ebert–Girardi–Reissig [Math. Ann. 378 (2020), 1311–1326]. When this Dini-type integral diverges and the effective total mass of the initial data is positive, convergence of the Keller–Osserman tail integral is necessary and sufficient for finite-time blow-up of the maximal mild Sobolev solution, particularly, divergence of the tail integral gives global grow-up. The resulting integral criteria distinguish the contributions of the nonlinearity near zero and at infinity in governing small data global in-time existence with diffusion decay, global grow-up, and finite-time blow-up.

fields
Analysis of PDEs
pdf ↗ page arXiv:2609.27862 ↗

Given a family of genus $g$ curves $f:Ψ\to S$ and a relative degree $d$ line bundle $L$ on $Ψ$ such that $f_*L$ is a vector bundle, the projectivization $\mathbb{P}(f_*L)$ is stratified by relative de Jonquières loci, which parameterize sections of $L$ with prescribed vanishing orders. We give universal formulas for the classes of these loci in terms of the relative $O(1)$ on $\mathbb{P}(f_*L)$ and tautological classes pulled back from the universal Picard stack $\mathrm{Pic}_g^d$. When $f$ is the family of lines in $\mathbb{P}^r$, we use the universal polynomials to compute $\mathrm{GL}_{r+1}$-equivariant classes of loci of hypersurfaces and complete intersections admitting lines with prescribed contact orders.

comments
v2: 25 pages. Added additional assumption to Theorem 1.2, and additional Lemma 3.3
fields
Algebraic Geometry
pdf ↗ page arXiv:2609.30892 ↗

We study Bayesian optimization (BO) through the lens of information geometry. Pulling back the Fisher information metric through the surrogate posterior map yields a local sensitivity tensor on the input space, which leads to an upper bound on the gradient of reparameterizable acquisition functions (AFs). This view explains vanishing-gradient behavior in high-dimensional BO and provides a common interpretation of heuristics such as RAASP and dimension-scaled lengthscales. The upper bound can also serve as a generic recipe to understand the behavior of new acquisition functions or surrogates in high input dimensions as well. Using the bounds, we also identify necessary conditions for an input location to be an optimizer of the AF for a univariate Gaussian predictive posterior. Building on this analysis, we propose FITR, a trust-region-based BO method that replaces lengthscale-based scaling with local pullback-Fisher weights. FITR is not restricted to GP kernels with explicit lengthscales and easily generalizes to non-isotropic surrogates. FITR shows competitive performance on several benchmarks.

comments
Accepted at NeurIPS 2026 (Camera Ready Version)
fields
Information Theory
pdf ↗ page arXiv:2609.31107 ↗

We study two hierarchies of bivariate generating functions defined by differential recursions: a self-dual hierarchy and a reduced-symmetry hierarchy. Their rational coefficient functions produce palindromic and anti-palindromic triangles, including OEIS A336110 and A140136. For general differential order $p$, the reduced hierarchy decomposes into $p-1$ Horn-type companions. An explicit differential intertwiner of order $p-3$ relates the last companion to the normalized self-dual generating function. The companions share a principal symbol and a rationally parametrized characteristic curve with a projective $S_3$ action. At $p=2$ this construction yields the Narayana quadratic. At $p=3$ the symmetry lifts to $S_4$: two algebraic sectors are edge resolvents of one quartic root configuration, and the nonsymmetric Gross–Witten–Wadia generating function has degree four. For $p=4$ and $p=5$ we derive algebraic equations of degrees six and eight, respectively, and find Galois groups $S_6$ and $S_8$ at generic specializations. At $p=6$ we verify a degree-ten specialization with Galois group $S_{10}$. Their discriminants exhibit a universal cubic characteristic factor and a squared lower-order factor. A boundary factorization explains the observed algebraic degrees and discriminant monomials. We formulate conjectures on algebraicity and Galois groups in the reduced hierarchy and identify a possible mechanism for transcendence in the higher self-dual hierarchy.

fields
Mathematical Physics
pdf ↗ page arXiv:2609.31189 ↗

We reveal an unexpected connection between two interacting particle systems: Kac's walk and the Kipnis-Marchioro-Presutti (KMP) process. We first establish a mixing-time analogue of Aldous's conjecture for the KMP process on general graphs: the mixing time of the $t$-particle process on any connected $d$-vertex graph is at most $O(\log d)$ times the corresponding single-particle mixing time, uniformly in $t$. As an application, we improve the mixing-time bound for coordinate hit-and-run on the $n$-dimensional standard simplex from $\widetilde{O}(n^3)$ [KV26] to $O(n\log n)$, while removing the dependence on the initial distribution. We then show that the twirling channel induced by the parallel Kac's walk on the symmetric subspace can be exactly encoded by a Markov chain on partitions, which naturally lifts to a parallel KMP chain on the complete graph. We prove that $O(\log d+\log(1/\varepsilon))$ repetitions of the parallel Kac's walk suffice to approximate Haar twirling on the symmetric subspace of $(\mathbb{C}^d)^{\otimes t}$ to error $\varepsilon$, uniformly in all $t$. Our main technical contribution is a new structural property of KMP-type dynamics: conditional product structure, which holds for both the standard KMP processes on general graphs and the parallel KMP processes on complete graphs. Conditioned on suitable auxiliary randomness, the evolution of the labeled KMP process factorizes into independent single-particle updates. Combining this structure with an exact coupling, we remove the dependence on the number of particles from the mixing bounds for both unlabeled KMP models. This bypasses the $\log(π_{\min}^{-1})$ dependency from spectral-gap arguments, which is often prohibitively large for many-particle systems. Using this framework, we prove mixing bounds that are sharp up to logarithmic factors for both unlabeled KMP models.

comments
79 pages, 2 figures
fields
Probability
pdf ↗ page arXiv:2609.38044 ↗

Understanding nonlinear dynamics is central to many fields of study, yet most nonlinear systems are beyond the reach of closed-form solutions. Numerical simulation is then used to reveal dynamical structures before their existence can be established. This alone, however, leaves the validity of the computed solution unanswered. Rigorous numerical methods address this gap by combining computation with explicit analytic estimates. Among them, the radii polynomial approach, a Newton–Kantorovich type argument, turns a numerical approximation into a proof of existence and uniqueness of a true solution near that approximation. In previous practice, the verification of these inequalities relies on interval-arithmetic libraries and hand-derived algebraic bounds. In this paper, we present a framework for the radii polynomial method in the Lean~4, which turns numerical certificates into fully type-checked theorems about the true solution. A central challenge in this process is to manage the complexity of the formalization. Our approach begins with a family of problems and their common structure. The spaces in which the analysis takes place are developed through universal properties in suitable categories, with extension properties that characterize maps by their action on generators. These properties guide the design of a reusable interface such that problem-specific arguments concentrate on the numerical data and the algebraic bounds that distinguish one equation from another. We formalize a general radii polynomial theorem, develop weighted coefficient algebras and reusable operator estimates, connect finite computational checks to the hypotheses of the theorem, and establish the realization theorems that transport certified coefficient space zeros to analytic solutions of the original equations.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.02335 ↗

We prove that metric measure spaces arising from $2$-manifolds equipped with Riemannian metrics $g$ such that $g, g^{-1} \in L^\infty_{\rm loc} \cap W^{1,p}_{\rm loc}$ are infinitesimally Hilbertian. Along the way, we establish uniform lower $1$-capacity bounds of several $1$-dimensional subsets of $\R^2$.

fields
Differential Geometry, Metric Geometry
pdf ↗ page arXiv:2610.03373 ↗

We refute the Strong Roberson Conjecture, which asserts that adding any graph outside a graph class closed under minors and disjoint unions strictly increases the distinguishing power of homomorphism counts from that class. More precisely, we construct connected graphs $H$ for which homomorphism counts from graphs excluding $H$ as a minor determine the number of homomorphisms from $H$ to any target graph. We also refute the analogous conjecture with immersions in place of minors. The proof introduces a method for deriving exact homomorphism count dependence from modular equivalences. We obtain these modular equivalences for infinitely many primes using prime-order automorphisms and the corresponding orbit quotients. We complete the refutations by proving that suitable circulant graphs with two jump lengths and related cubic bipartite graphs exclude their corresponding orbit quotients as minors and immersions, respectively.

comments
24 pages. v2: expanded introduction, related work and conclusion; improved exposition throughout; smaller explicit counterexamples obtained
fields
Combinatorics
pdf ↗ page arXiv:2610.03550 ↗

For $n\geq2$ and $p\in(n-2,n)$, we prove that closed balls maximize the ratio of Riesz $p$-capacity to Newtonian capacity among all compact subsets of $\mathbb{R}^n$. This resolves the classical Pólya–Szegő capacity ratio conjecture and its higher-dimensional extensions. For $n\geq4$, a sharp inequality for the ratio of Newtonian capacity to logarithmic capacity is established. All equality cases are characterized.

comments
second version; 22 pages
fields
Functional Analysis, Mathematical Physics
pdf ↗ page arXiv:2610.04811 ↗

In 1949, De Bruijn and Erdős considered infinite stick-breaking sequences. In this work, we consider finite sequences and prove that an infinite sequence that is due to De Bruijn, Erdős, and Toulmin is in some sense unique.

fields
Combinatorics
pdf ↗ page arXiv:2610.05067 ↗

For every centered one-mode continuous-variable Gaussian state, we prove that the signed Wigner periodization defines a discrete-variable density operator in every odd dimension $d\ge3$. Positivity is equivalent to the one-mode uncertainty condition, and we determine the complete inertia outside and on its boundary. A covariance-independent isometric embedding gives exponential convergence in trace norm, with an explicit error bound uniform in Planck's constant. For covariance twice the identity, dimension $31$ gives a certified trace-norm error below $1/8000$. The trace-norm estimate controls all measurement probabilities. We retain the original canonical-coherent-frame formula in terms of the determinant and trace of the covariance matrix, with continuous normalization fixed to agree with the discrete frame convention. The coherence comparisons identify which diagnostics accompany the controlled state approximation. Position- and momentum-basis coherences have exponentially convergent values after division by the square root of the dimension. Numerical comparisons of purity and frame coherence illustrate the discrete-continuous transition.

comments
Substantially revised and expanded, with new authors, title and abstract; added proofs of positivity and quantitative discrete-continuous approximation, and extended coherence comparisons
fields
Mathematical Physics
pdf ↗ page arXiv:2610.05623 ↗

The Sachdev-Ye-Kitaev (SYK) model is a strongly interacting fermionic system. Its dynamics are difficult to analyze with Lieb-Robinson bounds and cluster expansions due to its all-to-all disordered interactions. We prove that, with high probability over the disorder, the SYK model admits a quantum Gibbs sampler with a system-size-independent spectral gap at sufficiently high constant temperatures. This yields polynomial-time preparation of SYK Gibbs states on a quantum computer. While prior non-rigorous computations that suggested SYK thermalization were limited to studying local correlators, we emphasize that our result holds up to arbitrary inverse polynomial trace distance. Our proof introduces the pseudo-Lindbladian approach to fermions then applies two key new ideas: a Bochner inequality for quantum dynamics, and an especially simple SYK analysis based on a comparison to classical dynamics.

comments
34 pages; v2 improves exposition and updates references
fields
Mathematical Physics
pdf ↗ page arXiv:2610.05953 ↗

We design the first fully polynomial-time randomized approximation scheme ($\mathsf{FPRAS}$) for approximately counting and uniformly sampling common bases of two matroids given by their independence oracles. Moreover, our algorithms generalize far beyond this to Hadamard products of two probability measures on the Boolean cube satisfying a simple nonnegative curvature condition. These algorithmic primitives have myriad applications in statistical physics, polyhedral combinatorics, the theory of quantum many-body systems, and beyond. The central difficulty is that the hard constraints imposed by the two input matroids (or the two input measures, more generally) obstruct traditional approaches based on local Markov chains. Relaxing these constraints can restore rapid mixing, but configurations that satisfy the original hard constraints may become exponentially rare if this is done naïvely. Our main contribution is a novel approach for approximate counting that marries Markov chain Monte Carlo (MCMC) with convex programming to overcome these obstacles: - We relax the intersection by imposing an overlap penalty on the product measure formed by the two input measures. We prove, via an integrated Bochner-type method, that this "soft intersection" satisfies a Poincaré Inequality uniformly over all external fields. - We use samples from the relaxed distribution to solve a dual maximum entropy convex program inspired by the Gurvits capacity. This program reweights the soft intersection measure using external fields to boost the aggregate probability of configurations satisfying the hard intersection constraint, without changing their relative weights. We bound the success probability directly using the uniform Poincaré Inequality and smallness of the gradient norm. AI Disclosure: GPT-5.6 Sol Ultra and GPT-6 Astra Ultra were heavily used to develop the ideas in this paper.

fields
Probability
pdf ↗ page arXiv:2610.06724 ↗

In this paper, we present a model-based Koopman-Galerkin framework for output-feedback control of nonlinear systems with known dynamics. With a suitable actuator augmentation, the finite-dimensional realization preserves the actuator dynamics and the constant input matrix. The approach is based on an exact decomposition of the lifted dynamics into an LTI system and a finite-order closure residual. It also applies to non-control-affine systems and allows dictionaries that do not span an invariant subspace. Regional bounds are derived for the closure residual, actuator-realization defect, and output-reconstruction error. We use these bounds to formulate a standard $\mathcal{H}_\infty$ output-feedback problem. The controller is linear and dynamic and is implemented using only the measured tracking error. Neither full-state measurements nor a separate state observer are required. Lifting is performed offline. With the state coordinates retained in the dictionary, we obtain explicit transient bounds on the original state and tracking error. A sufficient condition for regional containment is also given. Under this condition, the nonlinear closed loop is forward complete, and the state and tracking error are uniformly ultimately bounded. The cart-pendulum example illustrates the nonlinear closed-loop guarantees. The proposed output feedback gives lower RMSE and peak tracking error on average than Jacobian-based $\mathcal{H}_\infty$ feedback, full-state backstepping, and Koopman-based hybrid MPC.

comments
16 pages, 4 figures. Code: https://github.com/kurkcub/RCCG
fields
Optimization and Control
pdf ↗ page arXiv:2610.07299 ↗

Over a field of characteristic zero, we characterize the Hilbert functions that determine the degree reverse lexicographic generic initial ideal among Artinian quotients of embedding dimension $n\ge2$ with the $(n-2)$-strong Lefschetz property. The criterion is a finite arithmetic test on successive positive differences of the Hilbert function. It uses recursively defined integer vectors and requires no construction of a monomial ideal. When uniqueness holds, the same vectors recover the common generic initial ideal degree by degree. The proof reduces uniqueness successively to uniqueness of lower sets of specified cardinalities in Borel orders. In four variables, the test simplifies to avoidance of explicitly computed integer intervals. We recover the quasi-symmetry criterion of Harima and Wachi and give infinite families beyond that criterion in every number of variables at least four.

comments
18 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2610.07799 ↗

We propose a new variant of a biased random walk on a Galton-Watson tree, in which some vertices have infinitely many children. These vertices induce a natural regeneration structure, which allows to study differentiability and also monotonicity of the speed of the random walk in the bias parameter. In particular, we give explicit examples of offspring distributions for which the speed is strictly monotone increasing. Additionally, we show that the speed in this model is the limit of the speed of random walks on appropriate locally finite trees.

fields
Probability
pdf ↗ page arXiv:2610.08181 ↗

We prove that the probability that Gaussian elimination with partial pivoting on $n \times n$ Gaussian random matrices has growth $ρ$ is at least inverse quasi-polynomial: $Ω\left(\exp\left(-c \log^2 \left(\fracρ{\sqrt{n}}\right)\log(n)\right)\right)$ for some constant $c > 0$. In particular, the probability of growth $ρ\ge n^{1/2 + ε}$ is at least $\exp(- O (ε^2 \log^3 (n) ))$. This lower bound breaks standard conjectures in the smoothed and average-case analysis of Gaussian elimination. To the best of our knowledge, it is the first non-trivial lower bound on the probability of large growth for Gaussian random matrices.

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

We give a relative consistency counterexample to the conjecture of Inamdar and Rinot that every regular uncountable cardinal carrying no amenable C-sequence is ineffable in the constructible universe L. The existence of a $Π^2_1$-indescribable cardinal is equiconsistent with the existence of a $Π^2_1$-indescribable cardinal carrying no amenable C-sequence and not ineffable in L. For every ground-model C-sequence on a weakly compact cardinal $κ$, generalized Hechler forcing adds a club D with $D\capβ\subseteq C_β$ at stationarily many inaccessible indices. We use this capture theorem in an iteration of length $κ^+$ after Johnstone's local lottery preparation.

comments
The upper bound is reduced from a $Π^2_1$-indescribable cardinal to an inaccessible $κ$ that is $Π^1_ξ$-indescribable for every $ξ<κ^+$. We now also establish an exact matching lower bound in $L$, determining the consistency strength and proving equiconsistency.40 pages
fields
Logic
pdf ↗ page arXiv:2610.09086 ↗

Image-size characterization relates coding budgets to the probability carried by source cells and their output images. At second order, this relation must preserve the joint fluctuations of active constraints and the information available for choosing an auxiliary description. We develop simultaneous posterior and conditional-composition image bounds, together with cell-dependent reference measures for reconstruction constraints. The reference measures retain both distortion deficits in one likelihood and permit the same analytical description cost to cancel between two image comparisons. A Gaussian evaluation gives matching second-order rates for Heegard–Berger coding with one uninformed decoder in the strict both-active regime, its common-reconstruction counterpart, and the corresponding two-stage refinement corner. The framework also gives compatible helper-image intersections, reconstruction-cell bounds, and conditional-type privacy amplification. An agreed-reproduction image explains when a scalar Gaussian coefficient replaces an optimized information–distortion profile. Gaussian Wyner–Ziv and Gray–Wyner characterizations provide attributed benchmarks and complementary evaluations of the image constraints. For arbitrary helper sections, general reconstruction policies, and reliable-key generation, the finite-block bounds identify the remaining likelihood or partition constraint. The rate applications use the same observation pattern and joint performance event in the converse and construction.

comments
Draft manuscript
fields
Information Theory
pdf ↗ page arXiv:2610.09472 ↗

We develop a sparse domination theory that captures both local polynomial approximation and cancellation of the input below the scale of each sparse cube. Its coefficients are percentiles of localized smooth maximal functions of the input minus its local polynomial approximation, combining features of mean-oscillation sparse bounds and of the cancellative sparse bounds of Conde-Alonso, Lorist and Rey. Using wavelet representations, we characterize the Calderón-Zygmund operators whose derivatives admit these bounds by explicit polynomial testing conditions. In the homogeneous setting, the same conditions characterize weighted Hardy-Sobolev inequalities with linear dependence on the $A_\infty$ characteristic. This quantitative dependence detects the transition from BMO to $L^\infty$ testing conditions that Lerner found for pointwise bounds by Riesz potentials, a distinction that qualitative weighted estimates cannot recover. In the inhomogeneous setting, we prove corresponding weighted inequalities and show that they are strictly weaker than pointwise sparse domination from the second derivative order onward. Consequences include Hardy-Sobolev estimates below the Banach range, sharp weighted Sobolev inequalities, and pointwise bounds by Riesz potentials.

comments
64 pages. Submitted. v2: numbering of the displays in Section 6 aligned with the companion paper arXiv:2611.01687; reference updated
fields
Classical Analysis and ODEs, Analysis of PDEs
pdf ↗ page arXiv:2610.09771 ↗

We propose a symmetric Nitsche method for the biharmonic Dirichlet problem on a smooth domain whose boundary may cut arbitrarily through the computational mesh. Bulk least-squares stabilization in a boundary strip and tangential boundary penalties control the consistency terms through an explicit lifting of the two Dirichlet traces. This gives coercivity on $H^4(Ω)$ without inverse inequalities and permits a fixed penalty independent of the cut configuration for sufficiently thin strips. Under suitable regularity assumptions, splines of degree $p\geq4$ give energy and $L^2$ error bounds of orders $h^{p-1}$ and $h^{p+1}$. We also analyze a face-stabilized extension to $C^1$ splines of degree $p=2$ and $C^2$ splines of degree $p=3$. Exact-ellipse experiments examine convergence, cut stability, and parameter sensitivity.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.11636 ↗

We study two problems: Local Leakage Resilience (LLR) for Shamir secret sharing, and worst-case Optimal Polynomial Intersection (OPI), over a prime field $\mathbb{F}_p$. For a polynomial $Q(X)$ of degree less than $k$, LLR for Shamir secret sharing asks what a few leaked bits from each of the $n$ shares $Q(α_1), \ldots, Q(α_n)$ reveal about $Q(0)$. Given (worst-case) input lists $S_1, \ldots, S_n \subset \mathbb{F}_p$, OPI seeks a polynomial $Q(X)$ so that $Q(α_i) \in S_i$ for as many $i$ as possible. Leveraging recent connections between these two problems due to (Sun, Wootters 2026), we improve the state-of-the-art for both problems. For LLR, we show that there is some constant $δ> 0$ so that Shamir secret-sharing is one-bit LLR (only a negligible amount about $Q(0)$ is learned) whenever $R := k/n \geq 1/2 - δ$. This is the first result to break the so-called ``one-half barrier'' for LLR, and improves over the previous best known result, requiring $R \geq 0.668$ (Kasser, 2025). For OPI, we give a quantum algorithm that finds a polynomial $Q(X)$ that agrees with at least a $\mathsf{SCL}_ρ(R)-\varepsilon$ fraction of the lists, for every fixed $\varepsilon>0$, where $\mathsf{SCL}_ρ$ is the \emph{semicircle law} of (Jordan et al., 2025). This improves previous algorithmic (and existential) results of (Jo, 2026) and (Horinaga, Yamakawa, 2026). We also give further improved existential results for all OPI instances; and when the evaluation points $α_i$ are chosen at random, for every rate $R > 0$ we show that, with high probability, for worst-case $S_i$ there exists \emph{perfect} solution. Finally, we adapt the hardness result of (Yamakawa, Zhandry, 2024) to apply to OPI (rather than a folded version); this gives an unconditional separation between the quantum and classical hardness of OPI relative to a membership oracle.

comments
82 pages, 3 figures; v2 adds near-optimal OPI discrepancy for random Reed-Solomon codes
fields
Information Theory
pdf ↗ page arXiv:2610.12357 ↗

We study whether global asymptotic stability (GAS) of the origin is decidable for homogeneous polynomial vector fields with rational coefficients. Our main technical contribution is showing that, for such vector fields of odd degree $d \geq 3$ in every sufficiently large dimension $n$, the problem of deciding GAS of the origin is many-one complete for the class of recursively enumerable sets (and hence undecidable). Using the tools we have built up, we also improve on some recent work by proving a similar result for Lyapunov stability instead of GAS. The proof of our main contribution splits naturally into two parts: - In the first part we give, for every fixed dimension $n$ and odd degree $2k+1$, a computable map which sends a homogeneous polynomial vector field of degree $2k+1$ on $\mathbb{R}^n$ to a homogeneous polynomial vector field of degree three on $\mathbb{R}^m$, where $m=\binom{n+k-1}{k}$, and preserves both GAS and Lyapunov stability. As a consequence, the problems of deciding whether the origin is GAS or Lyapunov stable for rational-coefficient homogeneous polynomial vector fields of any degree, of any fixed odd degree $d \geq 3$, and of degree three are pairwise many-one equivalent. - In the second part we prove that there is a fixed dimension $n_*$ and a fixed odd degree $d_*$ such that the set of rational-coefficient homogeneous polynomial vector fields on $\mathbb{R}^{n_*}$ of degree $d_*$ whose origin is GAS is many-one complete. This is done by "transferring" many-one completeness between several different problems, starting from the solvability of a Diophantine equation and eventually arriving at our desired GAS decision problem.

comments
84 pages
fields
Dynamical Systems, Classical Analysis and ODEs, Logic
pdf ↗ page arXiv:2610.12434 ↗

We establish variance upper bounds for the minimum perfect matching problem in general metric spaces under a geometric partition condition. As a principal application, let $H_n$ be the minimum perfect matching cost of $n$ independent uniform points in $[0,1]^d$, where $n$ is even and $d\ge2$. We prove $$\operatorname{Var}(H_n)\le C d n^{1-2/d},$$ where $C$ is independent of $n$ and $d$. This removes the logarithmic losses in earlier upper bounds in every dimension (Talagrand, 1995); in particular, the variance remains bounded in dimension two, answering an open question (Rhee, 1994). The proof relies on constructing a rapidly mixing Markov process with a multinomial stationary distribution.

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

We study a class of periodic NLS-Dysthe equations of the form $i\partial_tu+a\partial_x^2u+b|u|^2u+i\varepsilon(c\partial_x^3u+d|u|^2\partial_xu+eu^2\partial_x\overline{u})=0$ with $x\in\mathbb T$, $a,b,c,d,e\in\mathbb R$, $abc\neq0$, and $\varepsilon>0$. For $0<\varepsilon\ll1$, equations of this type arise as higher-order modulation models for some nonlinear dispersive PDEs, including the Klein-Gordon equation and the Serre-Green-Naghdi equation modeling the evolution of nonlinear shallow water waves. We prove local well-posedness in $H^s(\mathbb T)$ for $s>3/2$ for arbitrary admissible coefficients, and establish an $H^1$ continuation criterion for $s\ge2$. Under the additional assumption $e\neq0$, a lower-order conservation law provides uniform $H^1$ control and, together with the continuation criterion, yields global well-posedness for $s\ge2$. Unlike the previous $H^1$ global theory based on Takaoka's periodic well-posedness estimates (2000), our result does not require any non-resonance condition on the coefficients. Our approach relies on the construction of modified higher-order energies, following the strategy developed for the generalized KdV equation by Planchon, Tzvetkov and Visciglia (2023) and for the generalized DNLS equation by Hayashi, Ozawa and Visciglia (2025). Motivated by higher-order modulation theory, we exploit the conservation laws of cubic NLS and their invariance under the commuting complex mKdV flow to establish Sobolev bounds uniform in the modulation parameter $\varepsilon$ on time intervals of order $\varepsilon^{-1}$. This corresponds to physical times of order $\varepsilon^{-3}$, which is the natural time scale anticipated for the NLS-Dysthe approximation.

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

We prove a compact two-weight $T1$ theorem for the $α$-fractional Riesz vector, $0\leqα<n$, when one measure is supported on a compact regular $C^{1,\mathrm{Dini}}$ curve $Γ$. The measures may have common point masses. Under the global boundedness assumptions, we give a two-sided estimate for the essential norm in terms of Muckenhoupt and testing constants computed after restricting both measures to small cubes. Compactness is equivalent to the uniform vanishing of these local bounds as the cube side length tends to zero. The smooth truncations have a unique weak operator limit and converge in operator norm in the compact case. For arclength measure and distance power weights, we determine the compactness ranges for Green gradients on bounded tubes and for Newtonian gradients and Biot–Savart fields on the whole space. The whole-space operators in these ranges are compact but are not Hilbert–Schmidt. When $α=n-1$ and both measures have positive continuous arclength densities $a,b$ on the same closed curve, we obtain the exact essential norm $πc_{n-1,n}\max_Γ\sqrt{ab}$.

comments
We fixed some typos
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.15002 ↗

Correcting synchronization errors is one of the oldest problems in coding theory. In the mid-1960s, Levenshtein, and independently Ullman, showed that a single deletion can be corrected with $\log n+O(1)$ bits of redundancy, which is asymptotically optimal. For any fixed $t$, a Gilbert–Varshamov (GV) type argument shows that codes correcting $t$ deletions exist with redundancy $2t\log n+O_t(1)$. Achieving this classical GV-type bound explicitly has proved remarkably difficult. Explicit codes with redundancy $O_t(\log n)$ were first obtained by Brakensiek, Guruswami, and Zbarsky in 2016, half a century after Levenshtein, and Guruswami and Håstad matched the GV-type bound for two deletions only in 2021. For every fixed $t\ge 3$, the best explicit constructions still require roughly twice the GV-type redundancy: $(4t-1)\log n+o(\log n)$ for $t$ deletions and $4t\log n+O_t(\log\log n)$ for $t$ edits (insertions, deletions, and substitutions). We close this factor-of-two gap for every fixed $t$, even in the Damerau–Levenshtein model, which also allows adjacent transpositions. We construct explicit binary codes with deterministic polynomial-time encoding and decoding that correct any combination of at most $t$ such errors using $2t\log n+2t\log\log n+O_t(\log\log\log n)$ bits of redundancy. A single construction thus achieves the leading term of the classical GV-type bound simultaneously for deletions, edits, and Damerau–Levenshtein errors, extending the Guruswami–Håstad result from two deletions to every fixed $t$ and to substantially richer error models.

fields
Information Theory
pdf ↗ page arXiv:2610.15631 ↗

A hereditary graph class has strongly edge-sublinear separators if, for some constant $0 \leqslant b < 1$, every graph in the class with $m$ edges admits a balanced separator of size $\mathcal O(m^b)$. We show that Max Weight Independent Set (MWIS) admits a deterministic quasipolynomial-time approximation scheme (QPTAS) on every such class. In particular, this applies to graphs excluding any fixed graph as an induced minor, by a separator theorem of Korhonen and Lokshtanov [SODA 2024]. Our theorem generalizes the QPTASes for axis-parallel rectangles [Adamaszek and Wiese, FOCS 2013] and polygons [Adamaszek, Har-Peled, and Wiese, JACM 2019], or equivalently for packing connected subgraphs of a planar graph [Pilipczuk, van Leeuwen, and Wiese, Algorithmica 2020]. It also generalizes the QPTAS for MWIS on hereditary classes with strongly sublinear separators measured in vertices [Dvořák, EJC 2018; Dvořák and Lahiri, ESA 2021], as well as the QPTASes for graphs excluding specific induced minors [Chudnovsky et al., arXiv 2025; Bonnet et al., SWAT 2026; Czyżewska et al., arXiv 2026].

comments
23 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.16025 ↗

We answer, in the trace metric, a question of Kowalski and Untrau on Wasserstein distances of all orders between the distribution $μ_q$ of the normalized Kloosterman sums $\mathrm{Kl}(a;q)$, $a\in\mathbb{F}_q^\times$, and the Sato-Tate law $μ_{\mathrm{ST}}$: we prove bounds for every order $s$ and show that their exponents are optimal for Katz-type moment bounds. In the trace metric we prove $W_s(μ_q,μ_{\mathrm{ST}})\ll_s q^{-1/3}$ for $1\le s<3$, $W_3\ll q^{-1/3}(\log q)^{1/3}$, $W_s\ll_s q^{-1/4-1/(4s)}$ for $3<s<\infty$ and $W_\infty\ll q^{-1/4}$. In the angle metric we obtain bounds of every order, including $W_2\le 7q^{-1/3}$ and $W_\infty\ll q^{-1/6}$. These estimates follow from a general theorem for probability measures satisfying Katz-type Chebyshev moment bounds. Its proof combines an edge-sensitive discrepancy estimate with a new level-set bound for the distribution function and a quantile-displacement argument. We construct measures showing that the resulting exponents cannot in general be improved using moment bounds of this type alone, in the trace metric and in the angle metric for $s\le 2$ and $s\ge 6$ (up to logarithms); these constructions do not assert optimality for the Kloosterman measures themselves. A sharp comparison between Wasserstein distances and the Kolmogorov distance for the Sato-Tate law exhibits the same transition at $s=3$. Finally, using the exact third moment, we prove $W_1(μ_q,μ_{\mathrm{ST}})>q^{-1/2}/10$ when $3\nmid q$.

comments
18 pages. Substantially revised version
fields
Number Theory, Probability
pdf ↗ page arXiv:2610.16169 ↗

Subspace-design codes form a central unifying framework in coding theory, connecting probabilistic existence results and explicit algebraically structured constructions. The two core families are folded Reed-Solomon codes and univariate multiplicity codes, both possessing the subspace-design property. These codes reach list-decoding capacity with polynomial-size lists, but their alphabet size grows with code length and hurts practical efficiency. Goyal, Guruswami, and Hsieh achieved a major breakthrough: they constructed the first explicit subspace-design codes over constant-size alphabets via the Alon-Edmonds-Luby expander framework, settling an open problem and showing subspace-design properties can hold without large alphabets. Despite recent progress, constructing subspace-design codes with low-complexity efficient encoding remains a critical open challenge. This work gives an explicit construction of r-dimensional subspace-design codes over a constant alphabet whose size grows exponentially with r. By comparison, Goyal et al. (FOCS 2026) built r-dimensional subspace-design codes with alphabet size doubly exponential in r squared. Our construction is computationally efficient: encoding scales quadratically with block length and linearly with dimension r in field operations. We use modified algebraic geometry codes, replacing rational evaluation points with higher-degree places to obtain a valid additive code. To confirm parameter bounds, we use Moore matrices to analyze determinants with many zero entries. We also generalize univariate multiplicity codes, originally built from Reed-Solomon codes, to algebraic geometry codes, and prove these AG-multiplicity codes achieve optimal parameters.

fields
Information Theory
pdf ↗ page arXiv:2610.19691 ↗

Let $Γ$ be a connected metric graph of first Betti number $b\ge 2$, and let $Γ_b$ be a trivalent graph of the same Betti number with all edges of unit length. We show that if $\text{length}(Γ) \le λ\, \text{length}(Γ_b)$, then the universal cover of $Γ$ contains a vertex around which, at every radius $R\ge 0$, the ball is at least as long as the ball of radius $R$ in the trivalent tree whose edges all have length $3λ$. In particular, for $λ\le\frac13$, this ball is at least as long as the ball of the same radius in the universal cover of $Γ_b$, with no multiplicative loss. This improves an earlier theorem of the author, which gives the weaker lower bound $(1-3λ)$ times the ball in the universal cover of $Γ_b$, and only for $λ\le\frac16$. The proof rests on an elementary comparison principle. Among trees whose vertices have degree at least three and whose edges have length at most $c$, the trivalent tree with all edges of length $c$ has the smallest balls at every radius. As an application, we double the exponential growth rate in the author's earlier uniform lower bound for the area of balls in the universal cover of small-area surfaces of hyperbolic type, from $\ln 2$ to $2\ln 2$, beyond the hyperbolic rate. We also obtain explicit constants in the positive answer to Guth's question for surfaces. Finally, we conjecture the sharp, all-scale version of the minimal volume entropy inequality of Kapovich-Nagnibeda and Lim, and show that it would be optimal.

comments
Superseded by arXiv:2611.03277 (joint with S. Sabourau). Not intended for publication
fields
Differential Geometry
pdf ↗ page arXiv:2610.20088 ↗

For a one-dimensional discrete Schrödinger operator with bounded nonconstant iid potential, we prove a unit-intensity Poisson limit for local eigenvalues unfolded by the integrated density of states. The limit holds at every energy in the interior of the almost-sure spectrum. In particular, it holds for Bernoulli potentials at every fixed nonzero coupling. The proof uses auxiliary phase functions built from inverse stationary measures to obtain an exact IDS drift. Projective contraction then yields exponential crossing times, and a spatial subdivision argument gives independent Poisson counts in disjoint energy windows. At energies where the IDS has a finite positive derivative, the usual linear rescaling gives the same limit.

code
github.com/hanyi162013-Yihan/Poisson_Statistic_1dAndersonBernoulli ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at 2c24130, checked 2026-11-04 build details
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2610.21268 ↗

A universal framework for Hopf algebras in combinatorics provides a unified understanding of combinatorial objects. To establish such a framework, we dualize the theory of combinatorial Hopf algebras developed by Aguiar, Bergeron, and Sottile, obtaining the theory of rooted Hopf algebras. An object in this category is a graded connected Hopf algebra equipped with a group-like element, called a root, in its completion. These roots dualize the character theory of combinatorial Hopf algebras and provide a natural way to extend Bernstein and raising operators to other rooted Hopf algebras. The resulting constructions extend Schur, Hall–Littlewood, and Macdonald functions to rooted Hopf algebras. As an application, we develop these constructions for symmetric functions in noncommuting variables.

fields
Combinatorics
pdf ↗ page arXiv:2610.21289 ↗

We study when generalized metric projections generated by strongly quasiconvex functions are polarizable. The point of departure is Moreau's decomposition theorem, where the Euclidean metric projections onto two mutually polar closed convex cones form complementary retractions whose sum is the identity. This suggests the following fundamental question: when does a given retraction admit such a complementary polar retraction? We formulate this notion through polarizable retractions and then specialize it to generalized projections of the form $x\mapsto P_{\cal C}^\varphi(x)$, defined by minimizing $\varphi(x-y)$ with respect to $y$ over a closed convex set ${\cal C}$. After recalling basic properties of mutually polar retractions and first-order characterizations of generalized projections, we prove the main result: If $\varphi$ is strongly quasiconvex, the generalized projection $P_{\cal C}^\varphi$ is polarizable if and only if ${\cal C}$ is a closed convex cone. Thus, polarizability of the projection is characterized by the conic geometry of its range. Hence, this result can be considered as a converse of Moreau's decomposition theorem. As a consequence, a more specific converse of the same theorem is presented for the Euclidean norm.

fields
Optimization and Control
pdf ↗ page arXiv:2610.22106 ↗

Given a joint distribution $P_{XY}$ of random variables $X,Y$ on finite alphabets, the information bottleneck method seeks a representation $T$ of $X$ that is as informative as possible about $Y$ while compressing $X$; the privacy funnel asks for a representation that discloses much about $X$ while leaking little about $Y$. In both scenarios $T$ and $Y$ are conditionally independent given $X$. We show that computing the optimal value $\operatorname{IB}(P_{XY},R) = \sup_T \{ I(Y;T) : I(X;T) \le R \}$ of the information bottleneck problem, as well as its Lagrangian relaxation $L_β(P_{XY}) = \sup_T [ I(Y;T) - βI(X;T) ]$, is NP-hard. Moreover, unless $\mathrm{P} = \mathrm{NP}$, neither $\operatorname{IB}(P_{XY},R)$ nor $L_β(P_{XY})$ can be approximated in polynomial time within an additive error of order $|\mathcal{X}|^{-(1+α)}$, for every fixed $α> 0$. We also prove that computing the privacy funnel $\operatorname{PF}(P_{XY},r) = \inf_T \{ I(Y;T) : I(X;T) \ge r \}$ and its Lagrangian relaxation $Λ_β(P_{XY}) = \inf_T [ I(Y;T) - βI(X;T) ]$ is NP-hard, and that, unless $\mathrm{P} = \mathrm{NP}$, neither can be approximated in polynomial time within an additive error of order $|\mathcal{X}|^{-2}$.

comments
Updated version of the manuscript with additional results. Submitted for publication
fields
Information Theory
pdf ↗ page arXiv:2610.22272 ↗

We consider linear statistics $\sum_{k=1}^N f(x_k)$ of a Gaussian $\b$-ensemble. Following the work of \cite{LaSo22}, which was concerned only with Wigner matrices, we extend their results for general $\b$. In particular, we show that the CLT holds for any $f \in H^{1/2 + \e}$. The novel input which was not used in \cite{LaSo22} is the Helffer-Sjöstrand representation for the covariance, first appearing the random matrix context in \cite{ErYa15}, coupled with characteristic flow estimates for DBM, first appearing in \cite{Bo22}.

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

We study the multiplicity of contractible closed Reeb orbits on prequantization circle bundles $(M^{2n+1},ξ)$ over closed symplectic manifolds $(B^{2n},ω)$. For even $n$, under suitable geometric hypotheses, we prove that every non-degenerate contact form supporting $ξ$ whose contractible closed orbits have nonzero mean index and whose good contractible closed orbits have nonzero Conley–Zehnder index carries at least $\frac{1}{2}χ(B)+\frac{1}{2}\dim H_n(B;\mathbb{Q})+1$ geometrically distinct contractible closed Reeb orbits. In dimension five, under the corresponding geometric hypotheses and assuming $H_1(B;\mathbb{Q})=0$, we prove the conjectural lower bound $\dim H_*(B;\mathbb{Q})$ for every non-degenerate supporting contact form whose simple contractible closed orbits have nonzero Conley–Zehnder index.

comments
26 pages
fields
Symplectic Geometry
pdf ↗ page arXiv:2610.24557 ↗

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$.

comments
v2: we only changed the third author's address
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.25065 ↗

In this article, we prove that the spectrum, the norm, and the largest eigenvalue of a self-adjoint polynomial $P$ in $k$ independent matrices from the GOE or the GUE satisfy a large deviation principle.

comments
Corrected an error in the covariance computation in Lemma 3.1, added the GUE case, and made several small improvements throughout
fields
Probability
pdf ↗ page arXiv:2610.25353 ↗

We propose an \textit{in situ} method for certifying the multiparticle indistinguishability of identical bosons or fermions in generic linear interferometers. For particles occupying distinct input ports, the method uses two-particle marginal bunching or anti-bunching probabilities to bound full multiparticle indistinguishability through Aldous' spectral gap theorem. For Haar-random unitary interferometers, the number of experimental runs required to estimate this bound to a prescribed precision, at fixed confidence, is polynomial in the particle number, the interferometer size, and the inverse precision, with high probability over the choice of interferometer. Losses are incorporated without conditioning on particle survival. The method is particularly suited to certifying photon indistinguishability in large-scale interference experiments, including Boson Sampling experiments targeting quantum computational advantage.

comments
21 pages, 1 figure (in color); in this revision: new Section VI introduces a weighted series of subsets and a lower bound based on Aldous' spectral gap theorem, thus removing a connectivity bottleneck; updated fig1 is placed in Section VI
fields
Mathematical Physics
pdf ↗ page arXiv:2610.25471 ↗

We give a method to construct two injective connected finite quandles of different cardinal with isomorphic enveloping groups.

comments
In the v2, we added a reference to v1. We where not aware that a given result was known
fields
Group Theory
pdf ↗ page arXiv:2610.25536 ↗

In this paper, using local boundary factorizations of harmonic functions and singular-value estimates for Toeplitz products, we study the zero-product problem for Toeplitz operators on the Bergman space of the unit ball in $\mathbb{C}^n$. We prove that a finite product of such operators is zero only if one of the symbols is identically zero, provided that all the symbols are harmonic on the open unit ball and continuous on the closed unit ball.

comments
32 pages. This version corrects some typographical errors in the text
fields
Functional Analysis
pdf ↗ page arXiv:2610.26139 ↗

Pure mathematics is an honest barometer of a civilization's scientific capacity, maintaining an unwritten culture of rigor, structural perception, and intellectual honesty whose primary service is not merely proving theorems, but cultivating human judgment. In an era of automated theorem generation and formal verification, this essay argues that establishing a result and understanding both why it holds and why it matters remain distinct achievements, and outlines concrete institutional mechanisms to protect the exploratory core of the discipline.

comments
9 pages, including Appendix. Comments welcome
fields
History and Overview
pdf ↗ page arXiv:2610.26290 ↗

Let $f$ and $g$ be Hecke–Maass cusp forms of $\operatorname{SL}_2(\mathbb{Z})$, with spectral parameters $t_f$ and $t_g$, respectively. Let $T$ be a large parameter and put $L = |T-t_g|.$ We prove the Lindelöf-on-average estimate \[ \sum_{ |t_f-T|\leq H} \left|L\!\left(\frac12,f\otimes g\right)\right|^2 \ll_{\varepsilon} T^{1+\varepsilon}H, \] uniformly in the range \[ T^{1/3+\varepsilon}\ll H,\qquad HT^\varepsilon\ll L\leq T. \] As an immediate consequence, in the generic range when both $|t_g|$ and $L$ are of size $T$, we obtain the Weyl bound \[ L\!\left(\frac12,f\otimes g\right) \ll_\varepsilon C(f\times g)^{1/6+\varepsilon}. \]

comments
The authors have identified some issues in the current version that require further investigation and revision. We have therefore decided to withdraw this manuscript
fields
Number Theory
pdf ↗ page arXiv:2610.27804 ↗

This book has several fundamental aims, one of which is to serve as a reference book for computing unstable homotopy groups using methods of the Toda school. The Toda bracket serves the art of constructing homotopy liftings and extensions of maps. It plays a fundamental role in dealing with composition relations of homotopy classes. This book brings together in Appendix A.3 all known results on the $2$-primary components of unstable homotopy groups of spheres obtained using the art of Toda brackets as the principal tool, with explicit generators. It also explains in Appendix A.2 the conventions used to name the generators. The book mainly presents calculations of the $2$-primary components of the homotopy groups $π_i(\mathit{SO}(n))$ for all $23\leq i\leq 28$ and all $n,$ as well as some $π_{29}(\mathit{SO}(n)),$ with explicit generators, while retaining two possible group structures for $π_{28}(\mathit{SO}(11)).$ In degree $29,$ the cases $7\leq n\leq14$ remain under investigation. The odd-primary components of the homotopy groups $π_i(\mathit{SO}(n))$ in the above range can be computed with little effort; these computations essentially amount to looking up the relevant entries in existing tables.

fields
Algebraic Topology
pdf ↗ page arXiv:2610.28447 ↗

Let $A\in\mathbb{C}^{n\times n}$ be positive definite Hermitian, where $n\ge 2$, and define $\|X\|_A^2=\mathrm{tr}(AX^*X)$ for all $X\in\mathbb{C}^{n\times n}$. We determine the smallest constant $C_A$ for which $$ \|XY-YX\|_{\mathrm{F}}^2 \le C_A\|X\|_A^2\|Y\|_A^2 $$ holds for all rank-one $X,Y\in\mathbb{C}^{n\times n}$, where $\|\cdot\|_{\mathrm{F}}$ denotes the Frobenius norm. The constant depends only on the two smallest eigenvalues of $A$ and is determined by a strictly monotone scalar equation. This answers the sharp-constant question for rank-one matrices formulated by Fang and Cheng. We characterize all equality pairs. Also, we present an application to density matrices in quantum physics.

comments
19 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2610.29240 ↗

We develop curvature theory on Blohmann's elastic diffeological spaces. We introduce curvature-tensorial connections, whose curvature factors uniquely through $T_3M$, and show that this property holds on finite-dimensional manifolds and is preserved on mapping spaces. Using a plotwise commutator identity and the elasticity axioms, we establish the classical curvature symmetries for curvature-tensorial Levi-Civita connections. We define sectional curvature and a curvature form on the algebraic exterior square, and demonstrate an obstruction to the usual Ricci trace construction: on $C^\infty(S^1,S^2)$, the relevant curvature endomorphism extends boundedly to the $L^2$ completion but is not trace class. We express the second variation of the energy by the index form and characterize the null space of the index form by Jacobi fields. Given a geodesic flow, we construct Jacobi fields with prescribed initial data along its flow lines; they are unique when the real line is a curve object for the space. Finally, non-positive sectional curvature excludes conjugate points, while a negative index direction obstructs length minimization; the latter result does not require the curve-object property and applies to mapping spaces such as free loop spaces of complete Riemannian manifolds.

comments
19 pages.v2: Clarified the hypotheses for the existence and uniqueness of Jacobi fields; weakened the assumptions of the non-minimality theorem; revised the exposition and updated references
fields
Differential Geometry, Category Theory
pdf ↗ page arXiv:2610.29360 ↗

We develop the theory of spinor fields associated with the hyperbolic Clifford algebra $\mathbb{R}^{H}=\mathcal{C}\ell(H_V)$, which is associated with hyperbolic space $H_V=V\oplus V^{*}$. Algebraically, we exhibit an explicit real primitive idempotent which, unlike the Lorentzian case, remains primitive after complexification and generates the ideal of Witten superfields. We also describe the chirality decomposition and the hyperbolic spin group. Geometrically, we construct a canonical hyperbolic spin structure on every oriented manifold, showing that no topological obstructions arise beyond orientability and we study the associated spinor bundles, spin-Clifford bundles and ideal spinor subbundles. Finally, we introduce the isotropic extension of an arbitrary linear connection to $TM\oplus T^*M$, which is always compatible with the hyperbolic metric, and the associated hyperbolic spin connection, whose well-definedness, compatibilities, curvature and explicit form are established, providing the geometric framework for Dirac operators on the hyperbolic Clifford algebra, which we will present in a forthcoming article.

comments
24 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2610.30542 ↗

We introduce the fundamental semigroup $Λ(S)$ of a nonempty path-connected topological semigroup $S$, defined using right translations and change-of-basepoint isomorphisms on its fundamental group. We prove that this construction is closed under composition and independent of the chosen basepoint up to isomorphism. It is also invariant under homotopy equivalences that preserve multiplication up to homotopy. We characterize exactly when the fundamental semigroup is a group and identify that group with an inner automorphism group. For a connected, locally path-connected and semilocally simply connected topological semigroup, we show that multiplication admits a continuous associative lift to the universal cover if and only if $Λ(S)$ contains an idempotent. Every such idempotent can be realized by an associative lift, and any two associative lifts are isomorphic over $S$ through a deck transformation. We obtain existence results when the fundamental group has finite inner automorphism group or contains no subgroup isomorphic to Thompson's group $F$, and when the underlying space is a finite-dimensional CW complex. In contrast, we construct a path-connected countable CW topological semigroup with cells in arbitrarily high dimensions whose multiplication admits no continuous associative lift to its universal cover.

fields
Algebraic Topology, General Topology, Group Theory
pdf ↗ page arXiv:2610.32426 ↗

We establish an $Ω(d)$ lower bound on the competitive ratio of convex body chasing in $\mathbb{R}^d$ with movement costs measured in any norm. Previously, the best known lower bound valid across all norms was $Ω(d^{1/6})$, established by Papazov (2023); stronger lower bounds were known for $\ell_p$ norms, where Bubeck, Klartag, Lee, Li, and Sellke (2019) had established a lower bound of $Ω(\max\{\sqrt{d}, d^{1-1/p}\})$. In particular, a linear lower bound was known only for the $\ell_\infty$ norm, realized by the standard construction of chasing faces of a hypercube. Our lower bound strictly improves on the prior universal and $\ell_p$ lower bounds for $p < \infty$ and shows that the functional Steiner point algorithm of Sellke (2023) - which has competitive ratio $O(d)$ - is asymptotically optimal for every norm. Our approach is based on the recursive construction of Bubeck, Coester, and Rabani (2023) for metrical service systems, which gives a lower bound of $Ω(r^2)$ for requests of size $O(r)$. We show that requests in their construction, each comprising a set of discrete points in a graph metric, can be mapped to the vertices of convex requests in a $(2r+1)$-dimensional $\ell_p$ vector space while approximately preserving movement costs up to a factor of $O(r)$; the general result then follows via Milman's (1985) quotient-of-a-subspace theorem.

comments
Updates the previous version to extend the lower bound to all norms
fields
Metric Geometry
pdf ↗ page arXiv:2610.32670 ↗

We prove the Hardy-Littlewood asymptotic for prime pairs of every fixed positive even difference $h$ from a restricted uniform two-over-two zeta-ratios formula. The formula may have error $O_\varepsilon(U^{\vartheta+\varepsilon})$ for any fixed $1/2\le\vartheta<(39-\sqrt{177})/32$. The real parts of all four shifts lie in $[3/64,5/64]$; their imaginary parts need only have absolute value at most $U^ν$, for a fixed $0<ν\le1/4$. For a fixed real smooth weight supported in $(1,1+1/(25h))$, we obtain an error $O_{h,W,\varepsilon}(x^{-Δ(\vartheta)+\varepsilon})$ in the correlation sum with weight $W(n/x)^2/n$, where $Δ(\vartheta)=7/16-\vartheta+\vartheta/(3-\vartheta)>0$. Adding the Riemann hypothesis improves this error to $O_{h,W,\varepsilon}(x^{\vartheta-7/8+\varepsilon})$. The proof retains the crossed zero residues in Mellin inversion and estimates their mixed term with the logarithmic-derivative integral. Two nonnegative time weights have the same diagonal term and opposite coefficients for the difference $h$. We deduce the logarithmic asymptotic for the weighted prime-pair sum $B_h$ and an asymptotic for the second finite difference of integrals of squared increments of the truncated Chebyshev function. The latter is connected to a logarithmically weighted Möbius approximant in the Nyman-Beurling criterion by finite identities.

comments
16 pages. The result now covers all fixed positive even gaps. We also weaken the ratios assumption and improve the error bounds
fields
Number Theory
pdf ↗ page arXiv:2610.32672 ↗

We present a Wilsonian framework, globally controlled across the holonomy space, for determining the perturbative data governing the vacua of chiral supersymmetric gauge theories on a circle. This allows lifting the Intriligator–Seiberg classification of semiclassical vacua in 3d $\mathcal{N}=2$ Chern–Simons-matter theories to $\RR^3\times S^1$. The framework is showcased by finding a rich set of vacuum sectors in a simple $\U(1)$ model and by reproducing on flat space the R-twisted reduction (first diagnosed on $S^3\times S^1$) of an $\SU(2)$ Maruyoshi–Song theory to the Gang–Yamazaki theory.

comments
5 pages, 2 pages supplemental material, an ancillary Mathematica notebook; accompanying letter to arXiv:2604.27066 [hep-th]
fields
Mathematical Physics
pdf ↗ page arXiv:2610.34240 ↗

We give a conic upper bound on the asymptotic rank of every weighted graph tensor over every field. If $W$ is the logarithmic edge-weight matrix of its dimension matrix $Q$, then $$ \operatorname{MaxCut}(W)\le\log_2\operatorname{\widetilde R}_{\mathbb F}(\operatorname{WT}(Q))\le U_{\operatorname{CP}}^Δ(W). $$ Here $U_{\operatorname{CP}}^Δ(W)$ maximizes $\sum_{1\le i<j\le n}W_{i,j}P_{i,j}$ over nonnegative symmetric zero-diagonal matrices $P$ such that $J-2P$ is copositive and $P_{i,j}\le P_{i,k}+P_{k,j}$ for all distinct vertices. The matrix $J$ is all-one, and copositivity means nonnegativity of the quadratic form on nonnegative vectors. Our starting point extends OpenAI's polynomial multiplication method and its subsequent arbitrary-field developments from three tensor legs to arbitrary order. We prove $$ \left\lfloor\frac{n^2}{4}\right\rfloor\le\log_2\operatorname{\widetilde R}_{\mathbb F}(\operatorname{GT}_2(K_n))\le\frac{n^2}{4}. $$ The edge exponent is at most $n/(2(n-1))$ and tends to the optimal value $1/2$, improving the previous Coppersmith–Winograd bounds and answering Question 1.3.1 of Christandl, Vrana, and Zuiddam. The bounds coincide for every even $n$. For every odd $m\ge3$, the theorem gives $\log_2\widetilde R_{\mathbb F}(\operatorname{GT}_2(C_m))\le m-1+1/(m+1)$, improving the previous cycle bound with a gap of only $1/(m+1)$ above the maximum cut. On weighted triangles, the program recovers the rectangular matrix multiplication curve of Uznański and Amanov, van den Berg, and Zuiddam. The CP and semidefinite programs, with or without path constraints, all have value $9/4$ on the unweighted triangle, giving this upper bound a natural conic interpretation. Further applications give explicit bounds for complete multipartite graphs, split graphs, and wheels, including new cases of maximum-cut equality.

comments
80 pages, 5 figures, abstract shortened to meet arXiv requirements
fields
Combinatorics
pdf ↗ page arXiv:2610.34273 ↗

Dereziński and Gérard constructed the Gaussian $β$-Markov path space of a free Bose field in a form equivalent to the Araki–Woods representation, which suits nonequilibrium statistical mechanics with a quantum-field environment, but only for one-particle Hamiltonians with a spectral gap. We extend this construction, together with the equivalence to the Araki–Woods representation, to one-particle Hamiltonians without a spectral gap. The extension is intended for constructive quantum field theory at positive temperature and equilibrium statistical mechanics, for instance in the problem of the absence of Bose–Einstein condensation of quasiparticles whose number is not conserved.

comments
17 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2610.34783 ↗

Coron's return method established local nonlinear controllability of a moving water tank in sufficiently large time. The quadratic response at uniform equilibrium is studied in this work, where the acceleration input in the linearized model cannot excite the Fourier modes of the fluid with even indices. At three one-way wave crossings ($T=3$), the quadratic final-state map on a family of delayed controls that return the linearized state to zero is reduced to a scalar expression associated with a planar curve. A constant-level curve gives the return, and a tangential variation yields an explicit right inverse of the derivative of the quadratic final-state map. This inverse acts on all missing modes and maps mean-zero periodic $H^r$ targets to $H^r$ controls for every nonnegative integer $r$. A contraction argument also gives local exact solvability of the quadratic final-state equation. Finally, a time-dependent Sylvester equation provides an alternative representation of the coupling responsible for the second-order correction. The associated change of state coordinates involves one spatial derivative, while the control correction preserves regularity in appropriate Sobolev spaces. These results concern the first two variation equations only, while nonlinear controllability at this time remains open. Keywords: Controllability, control of partial differential equations, return method, Saint-Venant equations, Sylvester equations.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35319 ↗

We classify untwisted generalized hypercomplex structures on four-manifolds whose entire sphere has type one. Their Poisson tensors determine a canonical line field, and their local geometry is described by Gauduchon–Tod coframes. On a closed manifold, the canonical foliation is automatically Riemannian: the non-Riemannian alternative would require a twisting three-form with a nonzero period. Without assuming a circle action, we classify the compact structures into four families, distinguished by their first Betti numbers \(b_1=1,2,3,4\): Berger quotients, flat axis quotients, nontrivial circle bundles over flat three-tori, and constant tori. The underlying manifolds are parallelizable and admit symplectic forms precisely when the intrinsic Gauduchon–Tod invariant vanishes. These results address the four-dimensional untwisted case of the intermediate-type problem posed by Fino and Grantcharov.

fields
Differential Geometry
pdf ↗ page arXiv:2610.35557 ↗

We formulate a parametrized Jacobian Problem over $\mathbb{C}^{n}$ by incorporating independent scale parameters into the linear part of a polynomial map via polar decomposition. We prove that requiring the Jacobian determinant to remain constant uniformly across the parameter space decouples the Jacobian equation into a system enforcing the vanishing of all principal minors of the perturbation matrix. This system strictly forces lower triangularization up to variable permutations, establishing a necessary and sufficient condition for polynomial invertibility throughout the parameter family and providing an explicit, canonical scheme for constructing the inverse map in every dimension.

comments
12 pages
fields
Algebraic Geometry, Mathematical Physics
pdf ↗ page arXiv:2610.35918 ↗

We study compression of real-valued stationary sources under a deterministic error bound: every sample must be reconstructed within a prescribed tolerance $\varepsilon$ on every input sequence. Reconstructions are causal, depending only on present and past inputs. Rates are measured by the entropy of the quantizer output, which block entropy coding can approach, and compared with the minimum rate of unrestricted block quantization under the same error constraint. A uniform scalar quantizer with cells of width $2\varepsilon$ is within one bit per sample of this minimum whenever finite-entropy scalar quantization is possible, without density, independence, or mixing assumptions. Under entropy and Sobolev regularity conditions, the gap is at most $2\mathcal{J}\varepsilon^2/(π^2\ln 2)$, where $\mathcal{J}$ is the asymptotic Fisher information per sample. Thus the cost of causal reconstruction vanishes at a quadratic rate as the tolerance decreases. A uniform grid, however, cannot adapt to the source. We construct an adaptive quantizer whose encoder and decoder maintain a common finite set of reconstruction values, updated from the transmitted symbols alone; suitable initialization reproduces any uniform grid. When its initial values are at least $\varepsilon$ apart, its rate is within two bits per sample of the minimum for every such source. For sources uniform within separated intervals of width $2\varepsilon$, storing the interval centers attains the minimum and its Shannon lower bound. Such configurations can outperform every uniform grid of the same cell width: over sources with well-separated intervals, the best uniform grid's worst-case excess rate is $1/(2\ln 2)\approx 0.72$ bit per sample.

comments
41 pages
fields
Information Theory, Probability
pdf ↗ page arXiv:2610.35933 ↗

Using different approach we consider some problems for the class $\mathcal{S}_{ex}^{\star}$ defined by the condition $\frac{zf'(z)}{f(z)}\prec e^{αz}$, $0<α\leq1.$ Our method is more simple than that used by Das and Sarkar in their work: \textit{Sharp coefficient estimates for the exponential starlike class $S^\star_{ex}$} (\cite{DS26}).

fields
Complex Variables
pdf ↗ page arXiv:2610.36737 ↗

Building on the seminal work of Eskin, Mirzakhani and Mohammadi in the context of dynamics on moduli spaces, we introduce linear loci and linear measures to provide a relatively basic description of orbit closures and invariant measures in strata of translation surfaces. We use this to discuss geometrical properties of orbit closures and invariant measures from the perspective of geometric structures.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.36893 ↗

In this paper, we develop a general criterion for the K-property of equilibrium states within the Climenhaga-Thompson framework. Under suitable pressure-gap and non-uniform expansiveness assumptions, we show that the unique equilibrium state has the K-property, provided that the good collection of orbit segments satisfies an appropriate non-uniform specification property, as well as an appropriate non-uniform distortion control property for the potential function. These results do not require any additional lambda-decomposition structure and apply to a wide range of systems, including those with non-trivial central directions, such as the frame flow over closed rank-one manifolds with bunched nonpositive curvature. Moreover, we also construct several counterexamples to demonstrate that generally the assumptions in our criteria cannot be weakened while keeping the K-property.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.37392 ↗

For a bounded sequence $y=(y_n)\subset E^*$ and $p>0$, put $G_p(y)=\{x\in E:(y_n(x))\in\ell_p\}$ and call $y$ $p$-strongly normal when $G_p(y)$ is dense in $E$. We study the density spectra of the original sequence, its subsequences, and its normalized successive blocks. The possible subsequence and block spectra are exactly $\varnothing$, $(0,\infty)$, $(1,\infty)$, $[r,\infty)$, and $(r,\infty)$ for $r>1$, and their possible pairs are precisely the nested pairs. Every such pair has a normalized weakly null $1$-unconditional basic realization in $\ell_1(\mathfrak c)^*$, even with empty original-sequence spectrum. Without a basicness requirement, the possible original-sequence spectra are all upper subsets of $(0,\infty)$; each is realized in a separable Hilbert space. We determine the exact universal perturbation classes: $\ell_p$ for a fixed original-sequence exponent, $c_0$ for the subsequence spectrum, and $\ell_1$ for the block spectrum. The ideal-valued version holds for every proper solid permutation-invariant linear ideal $c_{00}\subset A\subsetneq c_0$, without a norm or completeness assumption. For the author's 2012 selection model, the bounded-run criterion extends to all proper symmetric quasi-Banach sequence ideals. In the unbounded-run case, a single norm-one projection annihilates the summability domains of any family of fewer than $\mathfrak b$ such ideals; the quotient by their closed linear span contains a $1$-complemented isometric copy of $\ell_\infty$. Such copies also occur in the left jump at every $q>1$ and in the right jump at every $q\ge1$ of the scale of closed summability domains. Thus the common density criterion coexists with two-sided complemented discontinuities.

comments
35 pages. Substantially revised and expanded version, with additional results on selection spectra, perturbations, and complemented summability domains
fields
Functional Analysis
pdf ↗ page arXiv:2610.38853 ↗

The present article proves (assuming GRH and a minor technical result) the veracity of Serre's conjectures for the field $\Q(\sqrt{13})$. In doing so, we prove a ``reduction to level 1'' result that holds for any real quadratic field with narrow class number one. However we can only establish the needed base cases for $\Q(\sqrt{13})$.

comments
Corrected a few typos
fields
Number Theory
pdf ↗ page arXiv:2610.38884 ↗

We study the Erdős-Moser equation in arithmetic progressions, $\sum i^k=m^k$, where $i$ runs over the positive integers $i<m$ with $i\equiv b \pmod q$. We prove that a solution has at most $\lfloor k/\log 2+3/2\rfloor$ terms for all $k<10^{55}$, and at most $k/\log 2+5/2$ terms in general; this linear bound is best possible for real solutions and replaces the previously known exponential bound $(k+1)2^{2k+1}$. For $k=3$ we obtain a complete classification: solutions with exactly $n$ terms exist if and only if $n\in\{3,4,5\}$, and in each case there are infinitely many primitive solutions. For even exponents there are no solutions with three terms, and there are no solutions at all for $k=4$, for every $k=2^s\ge 4$, and for every even $k$ with $4\le k\le 24$. The key analytic input is a uniform estimate for the classical equation $1^k+\dots+(m-1)^k=m^k$: the real exponent $κ_m$ for which $1^κ+\dots+(m-1)^κ=m^κ$ satisfies $κ_m=\log 2\,(m-3/2-γ_m/m)$ with $0<γ_m<1/(8\log 2)$ for every $m\ge 3$. The proofs rest on a method based on centres of mass, Steiner's parallel-axis theorem and what we call the half-mass principle. The same framework identifies the constants of a general class of balance equations through the moments of a mass distribution: $3/2$ is a Steiner quotient, and $25/12-3\log 2=1/12-f''(\log 2)/2$ with $f(λ)=λ/(e^λ-1)$, whose Bernoulli expansion explains why this constant is so small.

comments
27 pages. v2: new title; abstract and introduction reorganised; mathematical content unchanged
fields
Number Theory
pdf ↗ page arXiv:2610.39315 ↗

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

comments
We need to verify the correctness again
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.39527 ↗

For every prime $p$ and every three-element set $L\subseteq\mathbb{F}_p$, we prove that, for every integer $n\geq1$, there exists a symmetric $n\times n$ matrix over $\mathbb{F}_p$ with zero diagonal, off-diagonal entries in $L$, and rank $O_{p,L}(n^{1/3})$. This answers a question of Bukh. When $0\notin L$, a standard polynomial argument shows that the exponent $1/3$ is optimal. The proof combines an incidence matrix factorization with a projective-plane construction controlling line-intersection numbers modulo $p$. A separate geometric construction in characteristic two yields better explicit constants in certain cases, and also gives integer lifts $L'$ of the prescribed sets $L$ and symmetric $L'$-matrices of rational rank $O_{p,L}(n^{1/3})$. When $0\notin L'$, this improves Bukh's general quadratic lower bound, giving matrices of order $Ω_{p,L}(r^3)$ and rational rank at most $r$.

comments
14 pages. The second author has been added. Theorem 1.1 has been extended to cover all primes
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2610.39908 ↗

We investigate the structure of kernels of finite-rank perturbations of truncated Toeplitz operators. By realizing a perturbed truncated Toeplitz operator on a model space as a suitable matrix-valued truncated Toeplitz operator on an enlarged model space, we identify its kernel with a coordinate projection of the kernel of an associated block Toeplitz operator. This realization enables us to transfer the nearly $S^*$-invariant structure of Toeplitz kernels to the perturbed truncated setting. More precisely, for a perturbation of rank at most $n$, we show that the kernel of the perturbed truncated Toeplitz operator is nearly $S^*$-invariant with defect at most $2n+1$. We then extend the method to truncated Toeplitz operators on multiband spaces. In this setting, a perturbation of rank at most $n$ again preserves the finite-defect nearly $S^*$-invariant structure of the kernel, with the explicit upper bound $2n+2$ for the defect.

comments
31 pages, updated version. Comments are welcome:)
fields
Functional Analysis
pdf ↗ page arXiv:2610.40295 ↗

We study antiferromagnetic spin systems on random regular graphs through the lens of the phase transitions characterized by the complex zeros of the partition function. Our motivating examples include the hardcore model and the antiferromagnetic Potts model (including proper $q$-colorings at $β=0$). For both models on random $d$-regular graphs, we establish, with high probability over the graph, zero-free regions throughout the interior of the replica-symmetric regime. Asymptotically, this regime extends up to tree occupation density $$α< α_{\mathrm{RSB}}(d) = (2\log d - 2\log\log d + 2 - 2\log 2 + o_d(1))/d$$ for the hardcore model and up to degree $$d < d_{\mathrm{RSB}}(q) = (2q-1)\log q - 2\log 2 + o_q(1)$$ for proper $q$-colorings. Leveraging the standard algorithmic implications of zero-freeness, we obtain deterministic polynomial-time algorithms that multiplicatively approximate the corresponding partition functions at fixed rational parameters throughout this regime, with high probability over the graph. Our algorithmic guarantees significantly improve upon prior work and extend beyond the parameter ranges reached by previously known search algorithms. As a key intermediate step, we establish the pointwise equivalence, away from the threshold, of three notions of replica symmetry: geometric (averaged pairwise correlation decay), thermodynamic (convergence to the Bethe free-energy prediction), and variational (nonpositivity of the Bethe functional). To establish zero-freeness, we develop reinforced small subgraph conditioning, lifting classical small subgraph conditioning to random holomorphic functions to control short-cycle fluctuations. We also use variational replica symmetry to obtain exponential planted overlap concentration. This enables a typical-graph truncation that controls complex second moments up to the replica symmetry breaking threshold.

comments
Revised and expanded: strengthened the characterization of the replica-symmetric phase, reorganized and expanded the proofs. 84 pages
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2610.40510 ↗

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

fields
Probability
pdf ↗ page arXiv:2610.40562 ↗

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. The proofs given in this paper are formally verified in Lean 4.

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
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2610.40703 ↗

For fixed integers $t,k\ge 2$, put $N=(t-1)(k-1)+1$. We prove that the maximum universe size of a $t$-perfect hash family of length $N$ over an alphabet of size $q$ satisfies $ p_t(N,q)\ge q^{k-o(1)}$. Together with monotonicity in the length, this gives a positive answer to a question of Blackburn, Etzion, Stinson and Zaverucha for every choice of feasible parameters. Our proof combines the Nash–Williams–Tutte theorem, a graph-theoretic elimination argument, and a solution-free-set theorem established in our previous work.

comments
17pages. v2: The role of AI is explained more properly in the declaration. The funding information has been updated
fields
Combinatorics
pdf ↗ page arXiv:2610.41353 ↗

In this paper, we analyze the standard and the mass-lumped linear finite element methods for the Gross–Pitaevskii eigenvalue problem. For the standard method, we give a new proof of the uniqueness of the discrete ground state up to sign for sufficiently small mesh sizes, which only requires the $H^1$-convergence of the discrete ground states. For both methods, we establish optimal convergence rates in the $L^p$- and $W^{1,p}$-norms for $1 \le p < \infty$. Under additional regularity assumptions on the potential, we further obtain an optimal convergence rate in the $W^{1,\infty}$-norm and an almost optimal convergence rate, up to a logarithmic factor, in the $L^\infty$-norm. Moreover, we prove that the discrete ground states superconverge to the Ritz projection of the exact ground state in the $W^{1,p}$-seminorm. The analysis is based on a perturbation argument. Numerical experiments confirm the theoretical results.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.41715 ↗

We prove that the root lattice $D_4$ uniquely minimizes the normalized second moment among four-dimensional lattices, up to similarity. The minimum is $13/(120\sqrt{2})$. The proof reduces the problem to polynomial inequalities on three secondary cones. We derive the second-moment formulas geometrically and give explicit polynomial certificates that can be checked by coefficient comparison. We also derive a lower bound for lattice quantizers in every dimension at least two from the number of Voronoi facets, using a comparison with circular cones and concavity in the solid angle. This bound strictly improves the sphere bound and recovers the hexagonal value in dimension two.

comments
Simplified the proof of four-dimensional optimality, with explicit polynomial certificates now included in the paper. Main results unchanged
fields
Metric Geometry, Information Theory, Combinatorics
pdf ↗ page arXiv:2611.00100 ↗

The fundamental groups of compact $3$-manifolds are known to be residually finite. Feng Luo conjectured that a stronger statement is true, by allowing only finite groups of the form $\mathrm{PGL}_2(R),$ where $R$ is a finite commutative ring with identity. In a prior paper, "Linear representations of $3$-manifold groups over rings", we, together with two co-authors, gave an equivalent formulation of Luo's conjecture via faithful representations, investigated variants of the conjecture where the target group is of type $\mathrm{SL}_2, \mathrm{GL}_2, \mathrm{PSL}_2$, or $\mathrm{PGL}_2$ as in the original conjecture, and claimed to provide a $3$-manifold group which violated all four variants of the conjecture. We have discovered a flaw in the work, such that the existing proof is valid only for $\mathrm{SL}_2$ and $\mathrm{GL}_2$. Here, we provide a modified argument for the $\mathrm{PSL}_2$ and $\mathrm{PGL}_2$ cases.

comments
7 pages, including code; the final result remains exactly the same as in the original paper, only the argument changes. Erratum to arXiv:1703.06609
fields
Geometric Topology
pdf ↗ page arXiv:2611.00142 ↗

Let $α$ be an element of $\Fq((1/T))$ which is not in $\Fq(T)$. We ask how small $\nrm{απ}$ can be made when $π$ runs over irreducible polynomials, and write $θ(α)$ for the largest exponent $θ$ such that $\nrm{απ}<|π|^{-θ}$ has infinitely many solutions. The analogue of Matomäki's exponent, $θ(α)\ge\frac13$, was proved by Baier and the author, and it is the natural limit of \chg{methods based on} the Riemann Hypothesis. In this paper we go beyond it. For odd characteristic $p$ and $q$ large in terms of $p$ and $θ$, we prove that $θ(α)\geθ$ for every $α$ and every $θ<\sqrt2-1=0.414\ldots$, and for every $θ<\frac12$ when $α$ has bounded partial quotients. The main tools are an exact count of points in affine subspaces of $\Fq[T]$, a splitting of these subspaces into long arithmetic progressions, and the results of Sawin and Shusterman on the Möbius function along such progressions.

comments
25 pages
fields
Number Theory
pdf ↗ page arXiv:2611.00623 ↗

We classify the pairs $(q,n)$, where $q$ is a prime power, $n>1$, and $\gcd(n,q)=1$, for which every irreducible factor of $Φ_n(x)$ over $\F_q$ has exactly three nonzero terms. The positive support exponents of these factors have a common greatest common divisor, which gives a unique reduction by a power substitution. The reduced degree is two in odd characteristic and belongs to $\{2,3,4\}$ in characteristic two; the cubic and quartic cases arise by scalar substitution from the layers of orders $7$ and $15$. This yields necessary and sufficient arithmetic conditions on $(q,n)$ and explicit factorizations. Among the classified families, precisely those arising from quartic bases have a divisor layer containing an irreducible factor with more than three terms.

fields
Number Theory, Information Theory
pdf ↗ page arXiv:2611.00647 ↗

Let $(\mathcal{T}_t)_{t\geqslant0}$ be a quantum Markov semigroup on a von Neumann algebra and let $\mathcal{A}$ be an invariant Feller $C^*$-algebra. We formulate the $e$-property on the full state space and show that its quantitative defect is equivalent, within an optimal factor two, to the Hausdorff measure of non-compactness of observable orbits. We develop Cesàro and Lip-norm criteria and a generalised Doeblin minorisation by a state-space contracting positive map, including finite-dimensional and measure-prepare factorisations. When every observable has the $e$-property, the Jacobs–de Leeuw–Glicksberg decomposition identifies the reversible Choi–Effros algebra and the norm-stable sector. Expected and decoherence-free subalgebras transfer the property under norm decay of the complementary dynamics, including infinite-dimensional ultracontractive and finite-index Pimsner–Popa regimes. Finally, we establish the full comparison hierarchy among ordinary, eventual, Cesàro and pointwise eventual equicontinuity notions, reinforced by matrix Jamison and homoclinic flow counterexamples. Projection-face criteria are treated in a companion paper.

comments
45p
fields
Operator Algebras, Dynamical Systems, Functional Analysis, Probability, Spectral Theory
pdf ↗ page arXiv:2611.00703 ↗

Surface parameterization is a fundamental task in geometry processing and shape analysis. For topologically closed surfaces, it is common to parameterize them onto a standardized closed domain in $\mathbb{R}^3$, with a prime example being a unit sphere for genus-0 closed surfaces. Many mapping methods use planar projections and perform computations on the plane rather than directly on the 3D surface. However, perturbations introduced before projection or geometric evolution propagate through the computation and may affect map quality, convergence, stopping behavior, and geometric validity. In this work, we formulate representation sensitivity as a branchwise input–output problem, separating smooth propagation through active Jacobians from changes in anchors, stopping rules, and fallback events. Under consistent piecewise-linear assembly, the unmodified south-pole Beltrami correction in the FLASH method for spherical conformal parameterization reduces exactly to source-mesh harmonic extension. On a fixed-anchor branch, the corrected map factors into chart transition, harmonic propagation, and inverse stereographic projection, yielding an explicit sensitivity Jacobian and a finite-triangle conditioning bound. Separately, we introduce a bounded five-parameter affine preconditioner over planar scale, translation, and anisotropy and evaluate candidates on the corrected spherical map. Across 30 genus-0 surfaces, it reduces median polar upper-tail log-condition and chord-angle distortion by $10.17\%$ and $10.97\%$, respectively, with both measures improving on every mesh. We also apply the framework to other spherical mapping methods including the conformalized mean-curvature flow and spherical density-equalizing maps. Altogether, our work highlights the importance of representation selection as a structural and practical component of spherical parameterization and downstream computation.

fields
Numerical Analysis
pdf ↗ page arXiv:2611.00721 ↗

We investigate a one-dimensional discrete Dirac-type operator $D_d$ acting on the Hilbert space $\big(\ell^2(\mathbb{Z};\mathbb{C})\big)^2$, obtained from the classical continuous free Dirac operator by replacing the spatial derivative with the one-sided backward difference operator $I - S_1$, where $S_1$ denotes the right shift on $\ell^2(\mathbb{Z};\mathbb{C})$. We establish the fundamental operator-theoretic and spectral properties of $D_d$: unlike symmetric or supersymmetric lattice discretizations, $D_d$ is bounded and non-normal for every non-zero rest mass $m > 0$, with self-commutator $[D_d, D_d^†] = -2mc^3(-Δ_{\mathrm{disc}})σ_2$, yet it is quadratically normal. We compute the exact operator norm, determine the exact spectral radius in two mass regimes, and show via Fourier–Laurent analysis that the spectrum $σ(D_d)$ is purely continuous and lies on a two-component algebraic curve in the complex plane undergoing a topological transition at $mc^2 = 2c$. Finally, introducing a lattice spacing $h > 0$ and embedding $\big(\ell^2(h\mathbb{Z};\mathbb{C})\big)^2$ isometrically into $\big(L^2(\mathbb{R};\mathbb{C})\big)^2$ via Whittaker–Shannon band-limited interpolation, we prove that the scaled non-normal discrete Dirac-type operator $D_{d,h}$ converges to the continuous self-adjoint Dirac operator $D$ in the norm resolvent sense at the optimal rate $\mathcal{O}(h)$ as $h \to 0^+$, without requiring frequency cutoffs.

comments
17p
fields
Spectral Theory, Mathematical Physics, Functional Analysis
pdf ↗ page arXiv:2611.00820 ↗

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. v2: attribution of maximality/uniqueness to Lenstra (1977) and Nagell; new rigidity theorem (Thm 3'), sharp constants (Props 6.8, 6.11); literature review; see section "Changes". Lean 4 formalization and Polish version: https://doi.org/10.5281/zenodo.23798809
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2611.00973 ↗

A semi-Lagrangian discontinuous finite element scheme based on the characteristic Galerkin method (CSLDG) is investigated.The scheme directly discretizes an integral invariant model derived from the coupling of the transport equation and its adjoint equation.we have established, for the first time, error estimates for the fully discrete CSLDG scheme over a general domain Ωin \mathbb{R}^d.The error is decomposed into three parts: the ideal numerical solution error (the difference between the exact solution and the spatial discretization), the time-dependent test function error (the deviation of the test function caused by the numerical characteristic backtracking via an ODE solver), and the upstream region approximation error (the integration region deviation induced by numerical characteristic backtracking and spline boundary reconstruction).Under either compact-support boundary conditions or periodic boundary conditions with the velocity field and the solution sharing the same spatial periodicity, without requiring incompressibility,and assuming the standard CFL condition (Δt=O(h)) linking the time step and the mesh size, the following results are proved:Using piecewise P^K polynomial spaces, the L^2 error of the ideal numerical solution attains a suboptimal order O(h^K); If the ODE solver order satisfies D \ge 2K+2+d, the overall error retains the suboptimal order even after incorporating the time-dependent test function error;When the upstream region approximation error is further taken into account, for d \ge 2 the overall error remains suboptimal O(h^K) provided the spline reconstruction degree satisfies r \ge \max(K+1+d, d+2);

comments
All the order conditions stated above are just sufficient conditions, not sharp necessary conditions. They are needed to be improved
fields
Numerical Analysis
pdf ↗ page arXiv:2611.01448 ↗

We use Castillo's dual formulation of classicality for the alternating map to reduce polynomial time-and-band limiting to two scalar problems. The reconstruction preserves polynomial cutoffs, multipliers and concentration forms. It recovers the symmetric Dunkl constructions of Castro and Grünbaum and applies to continuous and discrete inputs. Scalar recurrences avoid moment factorizations; positive integrals and residual bounds control the accuracy of the concentration values.

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

For any $r>1$ and any nonnegative sequence $ω(n)=o(n)$, we construct a $C^r$ sphere diffeomorphism $f$ with $h=h_{\mathrm{top}}(f)>0$ such that $\displaystyle \lim_{n\to\infty}\frac{1}{n}\log\#\operatorname{Fix}(f^n)=h$ and $\displaystyle \sum_{n\geqslant 1}e^{-hn+ω(n)}\#\operatorname{Fix}(f^n) < \infty$. Every ergodic invariant probability measure is hyperbolic, and, apart from finitely many fixed points, all periodic points lie in a single topologically mixing homoclinic class of entropy $h$. This shows that the logarithmic periodic-point lower bound is optimal in finite regularity. In particular, we answer the finite-regularity case of Katok's periodic-point question in the negative.ative.

fields
Dynamical Systems
pdf ↗ page arXiv:2611.01980 ↗

Both quantum and classical logics have several mutually non-equivalent and non-isomorphic models as has repeatedly been proved in the literature. Yet, several authors have recently come with criticisms of this result. In this paper, we show that the criticisms are either unfounded or wrong.

comments
13 pages, 2 figures, minor typos corrected
fields
Mathematical Physics, Logic, Quantum Algebra
pdf ↗ page arXiv:2611.02070 ↗

For countable vocabularies, we extend the omitting types theorem for countable fragments of infinitary logic to Keisler's general real-valued structures by proving that the space of Henkin types of each such fragment is Čech-complete. The structures interpret function symbols arbitrarily and predicate symbols by bounded real-valued functions, while each formula carries a bound of its own. This extends the setting of Eagle's theorem from metric structures with a prescribed master metric to general structures whose vocabulary prescribes the sorts and bounds of the symbols. Following Keisler and Miller's treatment of logic without equality, we build models from closed terms. Morley's Baire category method then gives every satisfiable theory on a countable fragment a model with countable sorts omitting any countable family of types whose closed-term instances have empty interior in the space of Henkin types satisfying the theory.

fields
Logic
pdf ↗ page arXiv:2611.02247 ↗

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.

comments
I want to fix something
fields
Functional Analysis
pdf ↗ page arXiv:2611.02597 ↗

We study the characteristic Galerkin-type semi-Lagrangian discontinuous finite element (CSLDG) method for conservative linear transport equations. When the characteristic maps and upstream regions are exact, each update of the ideal CSLDG scheme is equivalent to exact conservative transport of the current numerical solution followed by L^2 projection onto the background DG space. The conventional estimate obtained by accumulating projection errors over successive time steps loses one order when Δt\asymp h, but this loss does not represent the actual accuracy of the scheme. For smooth velocity fields \A(\x,t) on a common periodic lattice, we construct local correctors used only in the analysis on uniform Cartesian meshes, assuming that Δt/h is fixed and that every component of the local Courant vector remains uniformly separated from the integers throughout the space-time domain. We prove strict contraction of the reference-cell transport-projection operator on the zero-mean polynomial space, establish uniform solvability of the corrector equation and Lipschitz estimates with respect to its parameter, and control the difference between the exact flow map and a local frozen translation through weak integral moments. This yields a one-step residual of order O(h^{K+2}), and, while retaining the step-by-step update and the standard L^2-projected initial data, gives, for the P^K approximation, an optimal O(h^{K+1}) error bound. The velocity may depend on both space and time, and incompressibility is not required. An appendix extends the analysis to a compact-support setting, in which the velocity field and the solution need not share a common spatial period.

comments
the order conditions stated above are just sufficient conditions, not sharp necessary conditions. We need to improve them
fields
Numerical Analysis
pdf ↗ page arXiv:2611.02867 ↗

The Kaczmarz algorithm is an iterative projection method for reconstructing vectors in a Hilbert space from inner product data. However, sequences that are effective for this algorithm need not be frames and may lack standard frame reconstruction properties. We investigate these properties for stationary effective sequences, which were classified by Kwapień and Mycielski according to their spectral measures. In particular, we show that the corresponding Kaczmarz reconstruction series always converge unconditionally if and only if the spectral measure is atomic with finitely many point masses. We show that if the spectral measure is atomic, the stationary effective sequence and its auxiliary Parseval frame can be interchanged in the Kaczmarz reconstruction formula. Finally, we construct two stationary effective sequences with singular continuous spectral measures, one of which can be interchanged with its auxiliary Parseval frame in the reconstruction formula, and one of which cannot be interchanged.

fields
Functional Analysis
pdf ↗ page arXiv:2611.03358 ↗

We characterize finite groups whose involutions form a single fusion class. In the solvable case, we show that the $2$-length is $1$, extending Thompson's theorem which states that a solvable group with all involutions conjugate has $2$-length $1$. For a nonsolvable group $G$, we prove that if its involutions are fused then they are conjugate; moreover, $G/\mathbf{O}_{2'}(G)$ is almost quasisimple. As an application, we obtain a restriction on $m$ for which an $m$-pyramidal Kirkman triple system can be realized under a nonsolvable group.

comments
15 pages; v1 was an earlier draft; v2 is the intended version. Changes are limited to typographical corrections and minor clarifications of proof details
fields
Group Theory, Combinatorics
pdf ↗ page arXiv:2611.03366 ↗

Building on the results of \cite{HR}, we investigate the relationship between \(C^*\)-extremality and linear extremality in the closed unit balls of general unital \(C^*\)-algebras. We show that, unlike in von Neumann algebras, these two notions of extremality need not coincide in general \(C^*\)-algebras. More precisely, we prove that the unilateral shift is a linear extreme point, but not a \(C^*\)-extreme point, of the closed unit ball of the Toeplitz \(C^*\)-algebra. We further establish that \(C^*\)-extremality implies linear extremality whenever the \(C^*\)-algebra admits a faithful unital representation on a separable Hilbert space. We also prove this implication for elements admitting a factorization $x=v|x|$, where $v$ is a partial isometry belonging to the algebra, and extend the result to suitable quotient \(C^*\)-algebras, including the Calkin algebra. Finally, we characterize the linear extreme points of the closed unit ball of unital \(C^*\)-subalgebras of \(B(H)\) containing the compact operators.

comments
10 pages. Comments are welcome
fields
Operator Algebras
pdf ↗ page arXiv:2611.03563 ↗

Get each issue by email →