Paperlane

no. 3 · from the archive← Mon 26 Oct archive Wed 28 Oct →

Tuesday, 27 October 2026

1383 papers in 32 fields

Analysis of PDEs108

We develop a convex-analytic $L^2$-framework for gradient flows of pumping-energy functionals coupled with elliptic state equations and an evolving nonnegative conductivity $a\geq 0$. The main difficulty is that the conductivity may be merely square-integrable, or degenerate, and formal differentiation need not produce an $L^2$-subgradient. After imposing the strictly positive lower cutoff $r+a\geq r>0$, we define the pumping-energy functional by a variational formula, prove convexity and lower semicontinuity, and show that its $L^2$-subdifferential is nonempty if and only if the pressure gradient belongs to $L^4$. We also obtain a unique maximal-monotone $L^2$-gradient flow satisfying an energy identity. Moreover, we prove Mosco convergence of the pumping-energy functionals as the cutoff vanishes. An inverse-moment conductivity constraint provides a weak alternative to a uniform positive lower bound. For nonlinear laws $a=μ(b)$, primal and flux representations distinguish two complementary regimes. If $μ$ is concave, the pumping-energy functional remains convex, and we characterize its $L^2$-subdifferential and the induced gradient flow. If $1/μ$ is concave, the pumping-energy functional is concave, and therefore its negative is convex. We construct its pointwise gradient flow on a uniformly elliptic box. Admissible stationary points for power laws yield $p$-Laplacian equations with $p>2$ and $1 < p < 2$, respectively.

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

We investigate the fourth-order Jordan-Moore-Gibson-Thompson equation \bee u_{tttt}+\al u_{ttt}+\bet u_{tt}-γ\Del u_{tt}-\del \Del u_{t}-\varrho \Del u=(f(u))_{ttt}+(f(u))_{tt} \eee under homogeneous Dirichlet boundary conditions in a smooth bounded domain $\Om \subset \R^n$ with $n\leq 3$, where $\al \in \R$ and $\bet,γ,\del,\varrho>0$. First, for any suitably regular initial data and assuming that $f\in C^4(\R)$ with $f(0)=0$, we prove that the corresponding initial-boundary value problem admits a unique maximal strong solution $u$ on $(0, \tm)$. Second, by combining three time-integrated formulations with a series of resolvent-regularized energy estimates, we show that gradient blow-up is ruled out in the sense that \be{EE} \tm<\infty \quad\,\, \Rightarrow\quad\,\, \limsup_{t\nearrow \tm}\|u(\cd,t)\|_{L^{\infty}(\Om)}=\infty. \tag{$\star$} \ee Finally, assuming in addition that $f$ is convex and grows superlinearly in the sense that \bee f''(ξ)\geq 0 \;\; \mbox{ for all}\;\;ξ\in\R, \qquad \frac{f(ξ)}ξ\rightarrow +\infty\;\;\mbox{ as}\;\; ξ\rightarrow +\infty , \qquad \int_{ξ_{0}}^{\infty}\frac{dξ}{f(ξ)}<\infty \;\; \mbox{ for some}\;\; ξ_{0}>0, \eee we employ the extensibility criterion (\ref{EE}) to prove that, for a suitable class of initial data, the solution blows up in finite time in the $L^\infty$-norm. To the best of our knowledge, this provides the first rigorous description of finite-time blow-up for a genuinely nonlinear equation of fourth order in time.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33213 ↗

Hybrid analytical–finite-element methods support scan-resolved, part-scale thermal simulation of laser powder bed fusion, but their analytical evaluation cost grows as scan-line contributions accumulate. This work develops a space–time localized hybrid formulation that restricts where and how long each contribution is evaluated analytically. Residual terms and boundary conditions derived from the heat equation allow the finite-element correction to account for the thermal effect of contributions removed from the analytical field. The formulation is assessed using a single-line benchmark against an independent full finite-element solution and multiline comparisons with the conventional hybrid formulation. Localization limits the number of analytical contributions retained while maintaining close agreement with the conventional solution. A comparison with uncompensated temporal truncation demonstrates the importance of the residual correction in retaining the thermal effect of removed contributions. In the 500-line case, analytical and total simulation times are reduced by factors of approximately 25.5 and 3.92, respectively, with a relative nodal 2-norm difference of 0.139%.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33273 ↗

We investigate fractional analogs of Korn's inequality on bounded Lipschitz domains in several contexts. Constrained and unconstrained inequalities are established; constraints include quotient spaces and spaces incorporating various classes of boundary conditions or volume constraints. We also expand the parameters of integrability for which the inequalities hold. Specifically, a fractional Korn's first unconstrained inequality holds for vector fields in the fractional Sobolev space $W^{s,p}(Ω;\mathbb{R}^n)$ for all $p \in [1,\infty]$ and all $s \in (0,1)$. In the cases $p = 1$ and $p = \infty$, the inequality has no local analog. We quantify this by investigating the consistency of the inequalities as the differentiability parameter $s \to 1$; the universal constant in the inequality remains stable for $p \in (1,\infty)$ but degenerates for $p \in \{1,\infty\}$. We introduce an explicit $L^p$-bounded projection operator onto infinitesimal rigid motions as a key tool to quantitatively strengthen the inequality.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33325 ↗

We give a new proof of Corvino-Schoen-type gluing, also known as gluing up to linear obstructions, for asymptotically hyperbolic spacetimes satisfying appropriate smallness conditions in arbitrary dimension. The results retrieve and improve on previous known smallness requirements on initial data to conduct such gluing, including the work of Chrusciél and Delay. Our technique is highly versatile and well-suited for gluing results in highly anisotropic geometric settings.

comments
42 pages, 1 figure
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33372 ↗

We study the rigidity of convex entire solutions to sum Hessian equations. Using a dimension-lifting identity, we reduce the problem to a standard \(k\)-Hessian equation in one higher dimension. By applying existing rigidity theorems, we prove that every \(C^2\) convex entire solution is a quadratic polynomial for \(2\leq k\leq n\), \(α\geq0\), and a positive constant right-hand side, without any growth assumption at infinity. We also discuss the linear case \(k=1\).

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33397 ↗

We study a two-dimensional Schrödinger equation with a boundary degeneracy. More precisely, the diffusion matrix is given by $ A=\operatorname{diag}(1,x_2^α), α\in(0,1)$, so that the partial differential operator degenerates on a portion of the boundary. The main objective is to establish a boundary observability inequality for the corresponding degenerate Schrödinger equation. To overcome the difficulties caused by the boundary degeneracy, we introduce a shape design and approximation procedure. By removing a thin neighborhood of the degenerate boundary, we construct a family of uniformly Schrödinger equations on perturbed domains. We first investigate the spectral properties of the associated operators and establish the convergence of the approximate problems to the original degenerate problem. We then derive a boundary observability inequality for the uniformly approximating equations and pass to the limit as the thickness of the removed boundary layer tends to zero. This yields a boundary observability inequality for the original degenerate Schrödinger equation. Our approach combines spectral analysis, separation of variables, and shape design techniques. By employing multiplier methods for the uniformly approximating problems and passing to the degenerate limit, we establish the boundary observability inequality for the original degenerate Schrödinger equation.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33406 ↗

The aim of this paper is to establish the existence of extremal functions for the Trudinger–Moser inequality with logarithmic weights $(-\log |x|)^β$ in two dimensions throughout the full range $0\le β<1$. We also extend recent results on the existence of local maximizers for the Trudinger–Moser functional beyond the critical threshold. Our approach uses polygonal profiles to establish a lower bound uniform in the weight parameter. An explicit thirty-node profile gives the lower bound $\mathrm{TM}_{4π}>4.38421793217\,π$ for the classical critical supremum on the unit disk, improving on the value $4.3556\,π$ obtained in the computer experiments of Carleson and Chang. This lower bound has a purely analytic proof, which uses only elementary inequalities and exact rational arithmetic. Numerical experiments with polygonal profiles of up to $102400$ nodes suggest that this lower bound can be raised to $4.402732044\,π$, which improves the recent computational lower bound by Li and Sun.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33439 ↗

We study blow-up and compactness for the critical nonlinear Dirac equation \[ D_{g_0}ψ_i = H_i|ψ_i|^{\frac{2}{n-1}}ψ_i \qquad \text{on }\mathbb S^n,\quad n\ge 3, \] where $g_0$ is the round metric and $H_i\to H>0$ in $C^0(\mathbb S^n)$. Under a first-threshold bound on the critical mass, we prove that every blowing-up sequence has, after passing to a subsequence, a unique blow-up point $p$ satisfying $H(p)=\max_{\mathbb S^n}H$. The rescaled solutions converge to a ground-state Dirac bubble that carries the entire limiting critical mass. Under local uniform $C^1$ bounds on $H_i$, we use the Kelvin transform and a second rescaling to prove that $p$ is an isolated simple blow-up point. We also derive sharp pointwise and gradient estimates in cylindrical coordinates and identify the normalized Green limit. If the coefficients converge in $C^2$ near $p$, the Pohozaev identity yields $\operatorname{Hess}_{g_0}H(p)=0$. Consequently, if a positive $H\in C^2(\mathbb S^n)$ satisfies $Δ_{g_0}H(p)<0$ at every global maximum, then solutions with critical mass bounded by a level slightly above the first threshold are uniformly bounded in $L^\infty(\mathbb S^n)$. This bound remains uniform under small $C^2$ perturbations of $H$.

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

Understanding the onset and mechanism of collapse at critical attractive interaction is a fundamental problem in the variational theory of finite fermionic systems. In this paper, we study this problem within the Hartree–Fock framework under various trapping potentials. By establishing a finite-rank Hartree-type Gagliardo–Nirenberg–Sobolev inequality, we identify a critical threshold $\mathcal{K}^{(N)}$ governing the existence of ground states. We then determine the concentration behavior of ground states as the interaction parameter approaches $\mathcal{K}^{(N)}$. To reveal how the geometry of the trap influences this critical phenomenon, we consider three representative classes of potentials: polynomial-type potentials, ring-shaped potentials, and potentials whose zero set has nonempty interior. For each class, we derive the concentration scale and sharp asymptotics of the least energy. The resulting regimes are qualitatively different, showing that both the location and the rate of concentration are selected by the local geometry of the potential near its minimum set. In contrast to scalar Hartree problems, the nonlocal interaction is coupled here with pairwise $L^2$-orthogonality constraints, and their interplay creates substantial difficulties in the compactness and blow-up analysis.

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

Let $\mathcal{L}_\varepsilon=-\operatorname{div}(A(x/\varepsilon)\nabla)$ be a scalar divergence-form operator on a bounded $C^3$ domain, where $A$ is symmetric, uniformly elliptic, Lipschitz continuous, and periodic. For initial data spectrally truncated at the eigenvalue level $N$, we establish whole-boundary observability and projected exact controllability, uniformly in the range $N\leqδ\varepsilon^{-1}$. This extends the cutoff $N\lesssim\varepsilon^{-1/2}$ obtained by Lin and Shen (J. Eur. Math. Soc. 2022). The key input is a two-sided boundary estimate for fixed-width spectral packets of $\sqrt{\mathcal{L}_\varepsilon}$ at frequencies that satisfy $\varepsilonμ^2\ll1$. Its lower bound combines quantitative Dirichlet corrector estimates with a forcing-stable microscopic boundary Cauchy estimate. Miller's spectral packet criterion and the Hilbert uniqueness method then convert this packet estimate into the corresponding wave results, with constants independent of $\varepsilon$ and $N$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33547 ↗

We prove that every concave entire solution of the Liouville equation $-Δu=e^{2u}$ in $\R^n$ is one-dimensional, and we extend the result to a class of general semilinear equations under suitable conditions on the nonlinearity. In dimension two, we also provide a PDE-based proof of the known classification of quasiconcave solutions to planar Liouville solutions, without relying on complex-analytic methods developed in the previous work by Bergweiler-Eremenko-Langley \cite{BEL}

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33571 ↗

This paper is devoted to the study of a nonlinear boundary value problem driven by a combination of mixed variable-exponent triharmonic operators and a Hardy-type singular potential. Specifically, we consider \[ \begin{cases} -a(x)\,Δ_{p(x)}^{3}u - b(x)\,Δ_{q(x)}^{3}u + m(x)\,\dfrac{|u|^{s(x)-2}u}{|x|^{3s(x)}} = μf(x,u), & \text{in } Ω, \\ u = Δu = Δ^{2}u = 0, & \text{on } \partialΩ, \end{cases} \] where $Ω\subset \mathbb{R}^N$ is a smooth bounded domain with $N > 3$. The operators $Δ_{p(x)}^{3}$ and $Δ_{q(x)}^{3}$ represent triharmonic operators with variable exponents, creating a framework of nonstandard growth. Under suitable assumptions on the variable exponents $p(x), q(x), s(x)$, the weight functions $a(x), b(x), m(x)$, and the nonlinearity $f(x,u)$, we establish the existence of at least three distinct weak solutions. Our approach is variational, relying on critical point theory for functionals defined on variable-exponent Sobolev spaces. By combining Ricceri's and Bonanno-Marano's abstract three critical points theorems with new Hardy-Rellich inequalities adapted to the variable-exponent setting, we prove our main multiplicity result for small values of the parameter $μ$. To our knowledge, this work presents the first systematic treatment of sixth-order problems featuring simultaneously mixed variable exponents and Hardy-type singular potentials.

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

We study the Dirichlet problem $-\mathrm{div}(A^{\varepsilon}\nabla u^{\varepsilon}) = f$ on varying open sets $D^{\varepsilon}$, with uniformly elliptic coefficients $A^{\varepsilon}$, in the regime where the solutions vanish in the limit for every source. For periodically perforated domains, this is the supercritical regime. We show that the torsional rigidity $T(D^{\varepsilon})$ is the natural normalization: up to a subsequence, $u^{\varepsilon}/T(D^{\varepsilon})$ converges weakly as measures to $kf$ for every continuous source $f$, where $k$ is a nonzero finite measure independent of $f$, which we call the effective measure. The key ingredient is an estimate comparing $u^{\varepsilon}$ with the product of $f$ and the torsion function, whose rate depends on the domains only through $T(D^{\varepsilon})$. We also show that this rate is optimal. No structural assumption on the perforation is needed, and the results hold for relaxed Dirichlet problems. Every nonzero finite measure arises as an effective measure, so the continuity of the source cannot be dropped in general. For rougher sources, we characterize the convergence by a condition on the domains alone, expressed through their torsion functions or, equivalently, their Poincaré constants. We also prove that the effective measure is local, satisfies optimal two-sided bounds and is monotone with respect to the coefficients, and we study the role of the antisymmetric parts of the coefficients.

comments
41 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33621 ↗

We study a quasilinear chemotaxis–May–Nowak system with nonlinear diffusion growing at least as $s^{m-1}$ at high densities and derive improved criteria for global existence and uniform boundedness. For the parabolic–elliptic–parabolic system, we establish global boundedness when $m>3-\frac{4}{n}$ for $n\in\{2,3\}$ and when $m>1+\frac{n}{4}$ for $n\ge4$. For the fully parabolic system, the same conclusion holds under $m>1+\frac{n}{4}$ for $n\ge4$. The proof relies on two refined estimates. Weighted space–time control of the nonlinear infection source yields the low-order $L^q$-bounds for the free virus density needed to initiate the bootstrap in the parabolic–elliptic–parabolic case. Subsequently, preserving the product structure of this source in the interpolation argument allows the chemotactic contribution to be absorbed more efficiently by the nonlinear diffusion. These estimates improve the previously known sufficient conditions for global boundedness.

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

This paper continues the work of Bai, Li, Liu and Luo \cite{BaiLiLiuLuoPreprint} on a quasilinear chemotaxis–May–Nowak system. We establish global boundedness in three dimensions for both the parabolic–elliptic–parabolic and fully parabolic systems when $m>4/3$. For the former, we construct finite-time blow-up solutions in balls when $n=3$ and $1<m\le4/3$, and when $n\ge4$ and $0<m\le2-2/n$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33664 ↗

We study elliptic Ornstein-Uhlenbeck operators in $L^2$ spaces with respect to invariant measures. These operators have discrete spectra and generate analytic semigroups. The angle defining the analyticity sector of a Ornstein-Uhlenbeck semigroup is not always equal to the complementary angle of the spectral angle of its generator. In this work, we study the link between these two angles. More specifically, we provide a necessary and sufficient criterion ensuring that they are complementary, and explain how pseudospectral phenomena account for these two angles to fail to be complementary.

comments
34 pages, 5 figures
fields
Analysis of PDEs, Spectral Theory
pdf ↗ page arXiv:2610.33683 ↗

Let $0<σ<2$ and $1\leq p<\infty$. We construct a fixed linear nonlocal elliptic operator $L$ and functions $u_m\in C^\infty(\mathbb R^n)\cap L^\infty(\mathbb R^n)$ such that \[ \|u_m\|_{L^\infty(\mathbb R^n)}+\|Lu_m\|_{L^p(B_2)}\longrightarrow0, \qquad \liminf_{m\to\infty}\|(-Δ)^{σ/2}u_m\|_{L^p(B_1)}>0. \] The kernel is symmetric in the increment variable, uniformly elliptic, and satisfies the standard bounds on its first two derivatives in that variable. Its dependence on $x$ has a uniform modulus of continuity of order $(\log(1/r))^{-1/2}$ as $r\downarrow0$. Moreover, $\|Du_m\|_{L^p(B_4)}\to0$ for $σ>1$, and these norms remain bounded for $σ=1$. Thus the interior $L^p$ estimates for translation-invariant operators do not extend to this class under mere continuity in $x$.

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

We consider a wave equation with linear elasticity, nonlinear \(p\)-Laplacian damping acting on the velocity, and a focusing power source in a bounded three-dimensional domain. For \(2<p<r+1\leq6\), we prove finite-time blow-up in the natural energy norm for initial data in \(H_0^1(Ω)\times L^2(Ω)\) lying in the unstable potential well below its depth. This includes every nonzero initial state with nonpositive total energy and requires no sign condition on the initial displacement–velocity pairing. For positive initial energy, we establish a sufficient condition for finite-time blow-up involving the \(L^2\) pairing of the initial velocity with a fixed approximation of the initial displacement. The proof combines a shifted displacement multiplier, an auxiliary quantity built from the time integral of the spatial \(L^p\)-norm of the velocity gradient, and a weighted auxiliary functional. Linking the weight parameter to the initial value of the cumulative quantity allows us to absorb the mixed terms in the auxiliary functional estimate. Together with the shifted displacement multiplier, this yields upper bounds for the maximal existence time in both ranges \(2<p\leq3\) and \(p>3\), without assuming \(W_0^{1,p}(Ω)\) regularity of the initial displacement.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33700 ↗

We study existence and uniqueness of solutions to the vertex-weighted Dirichlet problem on locally finite graphs. Let $B$ be a subset of the vertices of a connected graph $G$. The Dirichlet problem asks for a function whose discrete Laplacian is prescribed on $V\setminus B$ and whose values are prescribed on $B$. Each infinite connected component of $G\setminus B$ is called an end of $G$ relative to $B$. On finite graphs we show that the solution is the limit of an averaging process, with an explicit geometric rate given by the spectrum of the random walk, and is also the limit of the heat flow and the minimizer of an energy functional. On infinite graphs we prove two existence theorems: one with no assumption on vertex degrees, under a finite-width condition and summable data, and one for bounded data on graphs of bounded degree, where the solution is also unique among bounded functions. If there are no ends, the Dirichlet problem has exactly one solution. If there are $l$ ends, the solution set, when nonempty, has dimension at least $l$; each end carries a positive harmonic function vanishing on $B$. Calling an end parabolic when the random walk started in it hits $B$ almost surely, we show that this function can be taken bounded exactly on non-parabolic ends and is necessarily unbounded on parabolic ones, a discrete analogue of a theorem of Li and Tam. Consequently, bounded solutions are unique if and only if every end is parabolic.

comments
This is a revised and extended verison of an earlier published article
journal
M. Javaheri, Dirichlet problem on locally finite graphs, Discrete Appl. Math. 155 (2007), no. 18, 2496--2506
fields
Analysis of PDEs, Functional Analysis
pdf ↗ page arXiv:2610.33703 ↗

We investigate global smooth solvability for the one-dimensional inviscid Burgers-Vlasov system. For a smooth initial fluid velocity and a nonnegative, compactly supported particle distribution, we establish a sharp necessary and sufficient threshold expressed through the sum of the initial velocity gradient and the initial particle density. The principal difficulty is to control simultaneously the nonlinear steepening of the fluid velocity, the drag coupling, the particle velocity support, and the full hierarchy of derivatives. To overcome it, we introduce a combined gradient-density quantity whose evolution closes along fluid characteristics. Its sign invariance, together with characteristic support estimates and fixed-order derivative bounds, yields global continuation whenever the initial threshold is nonnegative. If the threshold fails at one point, a Riccati comparison gives an explicit finite upper bound for the maximal smooth lifespan and identifies negative velocity-gradient blow-up when this bound is attained. We also use nonnegative regularization and compactness to extend the threshold result to initial data of any fixed finite regularity.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33714 ↗

We analyse stationary Sellers-type energy-balance climate models with heterogeneous insolation $Q_\varepsilon = Q_*+\varepsilon Q_1$, both on the interval $(-1,1)$ with degenerate diffusion $κ(x)=1-x^2$ and on $\mathbb{S}^2$ with uniformly elliptic diffusion. Assuming that the homogeneous model corresponding to $\varepsilon = 0$ admits three constant equilibria $θ_S <θ_M < θ_W$ satisfying suitable non-degeneracy and spectral conditions, we prove that, for sufficiently small $\vert \varepsilon \vert $, these equilibria continue to three stationary branches $ u_S^\varepsilon$, $u_M^\varepsilon$, and $u_W^\varepsilon$. The cold and warm branches, $u_S^\varepsilon$ and $u_W^\varepsilon$ respectively, are strict local minimisers of the associated energy functional, while the intermediate branch $u_M^\varepsilon$ is non-degenerate and has Morse index one. We further establish the Palais-Smale condition and obtain a mountain-pass critical point $u^\varepsilon_{MP}$ at the minimax level between the two local minima. Under an additional isolation assumption for the homogeneous problem at the minimax level, this critical point coincides with $u_M^\varepsilon$. Lastly, a Legendre-Galerkin discretisation of the one-dimensional model numerically illustrates the three stationary branches, their discrete Morse indices, and the corresponding energy landscape.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33797 ↗

We study an optimal control problem (OCP) governed by the two-dimensional (2D) Boussinesq equations, where the right-hand sides of the velocity and temperature equations are projected onto the corresponding tangent spaces of the manifolds $\mathcal{M}_1:=\{y\in\mathbb{H}:\|y\|_{\mathbb{H}}=1\}$ and $\mathcal{M}_2:=\{θ\in H:\|θ\|_H=1\}$, respectively. The resulting evolution is subject to finite-codimensional constraints, under which the state $(y,θ)$ remains on $\mathcal{M}:=\mathcal{M}_1\times\mathcal{M}_2$ throughout the time interval. A Faedo–Galerkin construction provides a unique, global, strong solution to the constrained Boussinesq system for external controls $\mathfrak{H}\in L^2(0,T;\mathbb{H})$, along with uniform energy bounds. In addition, we establish the existence of an optimal triplet $(y^*,θ^*,\mathfrak{H}^*)$ that minimizes the quadratic cost subject to the constrained Boussinesq system. Necessary conditions of the first order are obtained through a coupled state–adjoint–control system. The optimal state $(y^*,θ^*)$ remains on $\mathcal{M}$, while the optimal control lies in the tangent space: $\mathfrak{H}^*(t)\in T_{y^*(t)}\mathcal{M}_1$, for all $t\in[0,T]$. We also show that the map $\mathfrak{H}\mapsto(y_{\mathfrak{H}},θ_{\mathfrak{H}})$ in $(C([0,T];\mathbb{H})\cap L^2(0,T;\mathbb{V}))\times(C([0,T];H)\cap L^2(0,T;V))$ is Fréchet differentiable. The linearized state is the unique weak solution to the constrained linearized Boussinesq system and satisfies the necessary tangency condition. Hence, the well-posedness and first-order optimality conditions are established for the Boussinesq system under nonlinear manifold constraints.

comments
47 pages
fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2610.33828 ↗

We rigorously establish the well-posedness of the initial-boundary value problem (IBVP) for the Burgers' equation on the half-line for data in Sobolev-type spaces. The formal solution to this problem was previously derived via the Cole-Hopf transformation and the Fokas unified transform method under the assumption of smooth, Schwartz-class data. In this work, we prove the validity of this formal representation for initial data $u_0\in \tilde{H}^{s+1}_x (0,\infty)$ and boundary data $g_0 \in H_t^{{(2s+1)}/{4}}$ where $1/2<s<3/2$. Well-posedness is established under two complementary conditions: (1) sufficiently small initial and boundary data, and (2) non-positive boundary data of arbitrary size. The latter condition utilizes the strong minimum principle for the corresponding linear heat equation to ensure the global invertibility of the nonlinear Cole-Hopf map. The proofs combine linear estimates for the heat IBVP with nonlinear bounds obtained through Taylor series representations and the algebraic properties of Sobolev spaces.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33886 ↗

We study an inverse source problem for a time-fractional sub- and super-diffusive anomalous diffusion equation on the unit disk with sparse boundary observations. We prove the recovery of a general class of $L^2$ sources for anomalous diffusion, with separated variables, from boundary measurements that are sparse in both space and time, using observations at two carefully chosen boundary points on a discrete set of times arbitrarily close to the final time. The analysis relies heavily on the memory effect of the model, properties of complex analysis and the representation of solutions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33896 ↗

We give a short proof that the planar cracktip is a global minimizer of the Mumford–Shah functional, based on interior and Dirichlet boundary regularity. We construct a Dirichlet minimizer with nonempty discontinuity set and show that this set contains no simple closed curves. The regularity results then imply the existence of an interior regular loose end, at which a blow-up yields the cracktip.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33900 ↗

We investigate the three-dimensional unforced Navier-Stokes equations through the interaction between spatial analyticity and the geometric sparseness of regions of intense fluid activity (i.e., regions where the fluid's motion varies sharply). Interpreting higher-order derivative ratios as turbulence scales, we introduce time-weighted bridge inequalities that quantify the relationship between lower- and higher-order derivative norms. The time weights give the derivative ratios greater flexibility while ensuring that the resulting lower bound on the radius of analyticity dominates the sparseness scale of the super-level sets, indicating that the flow has entered the dissipation regime. Combining this scale comparison with a harmonic-measure maximum principle on one-dimensional sparse sets yields a contraction in the relevant derivative norm, thereby excluding a class of strongly turbulent blow-up scenarios. Consequently, the strong solution extends analytically beyond the candidate blow-up time.

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

We study the asymptotic behavior of small-data global solutions to the Einstein–Klein–Gordon system with a positive-mass real scalar field in wave gauge. We show that the linearized trace component of the metric perturbation admits a $\hat t^{-1}\simeq t^{-1}$ optimal decreasing rate. Moreover, a quantitative one-point observability estimate is established: the initial Klein-Gordon energy is controlled by this leading order coefficient.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33928 ↗

In the present article, we prove the nonlinear asymptotic stability of stationary solutions to the quasi-one-dimensional barotropic Euler equations in a finite-length nozzle with variable cross-sectional area $A(x)$. We consider all stationary flow configurations arising from subsonic inflow: flows that remain subsonic throughout the nozzle, flows that pass continuously through a sonic state and remain supersonic up to the exit, and flows that subsequently return to the subsonic regime through a stationary shock. We prove that all these stationary solutions are asymptotically stable with respect to sufficiently small perturbations. No smallness restrictions are imposed on the mass flux, the magnitude of $A_x$, or the prescribed exit pressure, provided that the corresponding stationary solution exists. The only geometrical assumptions are that $A_{xx}>0$ at a smooth subsonic–supersonic transition, and $A_x>0$ at a stationary supersonic–subsonic shock. To the best of our knowledge, this gives the first nonlinear asymptotic stability result for a stationary flow passing smoothly from the subsonic to the supersonic regime in a finite-length nozzle. The principal analytical difficulty is the degeneracy of the characteristic structure at the sonic point. We overcome this difficulty by coupling energy structures adapted respectively to the subsonic and supersonic regimes. This coupling provides the dissipation needed to control the smooth sonic transition, and when combined with the dynamics of the shock, yields a unified nonlinear stability framework for smooth and discontinuous transonic nozzle flows.

comments
91 pages, 6 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33951 ↗

We investigate the global regularity up to the boundary and the fine pointwise behavior along the critical set for bounded weak solutions to general quasilinear elliptic Dirichlet problems in Orlicz-Sobolev spaces. Our structural framework encompasses operators with non-standard Lieberman-type growth alongside lower-order terms featuring natural gradient growth, an unbounded source term in $L^q$, and an unbounded spatial drift weight in $L^s$. To overcome the analytical obstructions posed by the unbounded drift across the anisotropic growth gap, we first establish global Hölder continuity up to the boundary via Moser iteration. We then construct a novel smooth regularization scheme for general homogeneous constant-coefficient operators, merging the approximation frameworks of Lieberman and Cianchi-Maz'ya, to derive global $C^{1,α}$ regularity up to the boundary through a variational perturbation approach. Building upon this global theory, we employ a geometric compactness and blow-up argument to prove that at any interior or boundary critical point where the gradient vanishes, the solution achieves an improved pointwise $C^{1,α}$ regularity. Remarkably, at boundary critical points, this quantitative improvement decouples from the lower-order terms and completely bypasses both the boundary datum regularity and the domain smoothness. Finally, we discuss the sharpness of the integrability threshold required for the unbounded drift weight in the subcritical regime.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33961 ↗

For the 3D Navier-Stokes equations with sufficiently smooth initial data having zero swirl $u_{0θ}\equiv 0$, Ladyzhenskaya \cite{L1968} and Ukhovskii and Yudovich \cite{UY1968} established global regularity. It has since remained open as to whether well-posedness still holds for smooth axisymmetric initial data, with the initial swirl being smaller than an \textit{absolute} constant in a critical space. In this remark, we prove \textit{norm inflation} occurs for the Navier-Stokes scalar swirl component, with initial smallness in the critical space $\dot{H}^{\frac{1}{2}}$ or even subcritical Sobolev spaces. We also obtain norm inflation for the 3D Euler swirl \textit{vector} in the Euler subcritical space $\dot{H}^3$. Our results are achieved by introducing an anisotropic scale in Luo's supercritical norm inflation construction \cite{Luo24}, as well as performing an anisotropic bootstrap argument to get a sufficiently small swirl remainder term.

comments
13 pages, no figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33973 ↗

The Cauchy-Lipschitz theorem guarantees that the ODE $\dotγ= b(t,γ)$ is well-posed if $b$ is Lipschitz in space, an assumption too restrictive for applications such as fluid mechanics. In 1989, DiPerna and Lions extended the theory to Sobolev vector fields with bounded divergence. Well-posedness then holds not for individual trajectories but for regular Lagrangian flows: flows that solve the ODE for almost every initial point and compress volume by at most a bounded factor. Their method rests on renormalized solutions of the associated transport equation. This thesis is primarily expository: it presents the DiPerna-Lions theory with detailed proofs. We treat existence, uniqueness and stability of weak and renormalized solutions of the transport equation, deduce existence (for autonomous fields) and uniqueness of regular Lagrangian flows, and discuss applications to the two-dimensional Euler equations. Three counterexamples with divergence-free fields show that uniqueness can fail without a growth condition at infinity, if $b$ has only fractional Sobolev regularity (due to DiPerna and Lions), or for $L^1$ solutions when $\nabla b \in L^r$, $r<d$ (the simplest case of a recent construction by Bruè, Colombo and Kumar). Contributions are (1) smooth approximations of $b$ with uniformly bounded divergence for the existence proof; (2) a direct proof of the known uniqueness of regular Lagrangian flows from uniqueness for the continuity equation; (3) a construction of the auxiliary cube-translating field in the example of Bruè, Colombo and Kumar that works for all $d \ge 2$, replacing an extension from two dimensions that is not a vector field on $\mathbb R^d$ for $d \ge 3$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.33993 ↗

We study a variational problem motivated by models of multiple segregated species in a nonhomogeneous environment. The analysis combines tools from potential theory, in particular free boundary methods. The main novelty is that we formulate the variational problem in the whole Euclidean space while imposing a finite carrying capacity constraint, which allows us to investigate saturated regions where the species attain their maximal density. In addition, we provide a modeling interpretation of the constrained energy. We show that it arises as the variational limit of energies with increasingly strong crowding and interspecific competition penalties, in the sense that, regardless of their relative rates, every sequence of minimizers of the penalized energies admits a subsequence that converges strongly to a minimizer of the constrained energy.

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

We investigate radial bound states with prescribed nodes for the odd cubic equation \[ Δu+u(\abs{u}-b)(c-\abs{u})=0 \quad\text{in }\R^n,\qquad n\ge2,\quad 0<b<c. \] Writing $a=b/c$, we prove that a radial bound state with exactly $k\ge1$ simple zeros and positive central value exists if and only if $0<a<1/2$. For each $k$, this solution is unique for all $0<a<1/2$ in dimension two, for $a\ge(7-3\sqrt5)/2$ in dimension three, and for $a\ge(43-5\sqrt{33})/32$ in dimension four. For one node, we identify exact ranges obtained from a tangent comparison and a quotient inequality in every dimension $n\ge3$; the threshold is dimension-independent for $3\le n\le23$ and is characterized implicitly for $n\ge24$. These results address the natural odd counterpart of the cubic nonlinearity highlighted in Tang's prescribed-node uniqueness conjecture [M. Tang, \emph{Invent. Math.}, 2026]. The main challenges are the second positive zero of the cubic source, the lack of a global comparison inequality, and supercritical cubic growth in higher dimensions. We overcome them by an amplitude confinement argument, controlled extensions preserving sharp comparison estimates, and a subcritical truncation for existence. A complementary small-$a$ uniqueness range in dimensions three to five follows from a recent massive double-power result.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34025 ↗

Environmental DNA (eDNA) is increasingly used to monitor aquatic organisms in rivers, yet predicting its concentration and assessing the reliability of such predictions remain challenging because river flow fluctuates with long memory and models of eDNA dynamics are inevitably misspecified. We propose a stochastic modeling framework for eDNA concentration in rivers that addresses both issues. The eDNA concentration is described by a stochastic partial differential equation with transport, decay, source, and square-root multiplicative noise, and the flow velocity is modeled by a superposition of Ornstein-Uhlenbeck-type processes with long memory. We show that the long memory of the flow velocity induces superdiffusive transport of eDNA, with the variance of the transported distance growing superlinearly in the ensemble sense. The proposed model admits a closed-form Laplace functional, based on which we prove the existence and uniqueness in law of the solution on an unbounded domain. We further evaluate the effects of model uncertainty through a robust control formulation based on the relative entropy, in which the lower and upper bounds of the expected eDNA concentration, together with the worst-case distortions, are obtained in closed form. The framework is applied to eDNA and flow velocity data collected for the upstream migration of Plecoglossus altivelis altivelis in a river in Japan. The results demonstrate that the closed-form bounds provide a computationally inexpensive tool for quantifying the range of eDNA concentrations that can be expected under model uncertainty.

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

We study the semiclassical limit of the Dirac equation with external electromagnetic fields using a dual formulation based on a Wasserstein-1-type distance. This distance is tailored to matrix-valued density operators and matrix-valued Wigner measures and extends earlier metrics comparing density matrices with classical phase-space distributions in the scalar case. We prove a quantitative convergence rate in the semiclassical parameter, improving previous results for the Dirac equation. Our approach relies on a Lagrange-multiplier formulation of the semiclassical limit for the full matrix-valued Wigner equation (without projection onto energy eigenspaces), introduced in [F. Golse, N. Leopold, N. Mauser, J. Möller, C. Saffirio, J. Math. Pures Appl., (2026)].

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34086 ↗

The aim of this paper is to apply Lie-symmetry methods to the one-dimensional Saint–Venant shallow-water equations over variable bottom topography. We classify the bottom profiles that admit symmetry extensions, derive similarity reductions to ordinary differential equations, and analyze selected reduced systems. In particular, heteroclinic trajectories yield physically meaningful self-similar solutions describing the draining and filling of water over a quadratic bottom with a fixed shoreline.

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

We investigate the third Robin eigenvalue on simply connected domains of area $A$ in surfaces with Gaussian curvature bounded above by $K$. For $K>0$, we discover a transition at the critical parameter $α=-4π+KA$: two equal geodesic disks give a sharp upper bound when $α=-4π$ or $-4π+KA\leqα\leq4π$, but the two disk bound fails for $-4π<α<-4π+KA$. In the latter range, we establish a new upper bound involving a single geodesic disk with a modified Robin parameter and prove its sharpness in an explicit subrange. The sharp two-disk inequality persists for nonpositive curvature bounds, and Steklov–Helmholtz analogues are also obtained. Both the two-disk and one-disk bounds arise from a unified two-pole Green-function method, with the one-disk regime emerging from a degenerate area split that produces the $2π$ shift in the effective Robin parameter, while sharpness in the stated subrange is established by boundary oscillations that redistribute Robin boundary mass.

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

We consider the dynamics of $N$ particles with Riesz repulsive interaction in one dimension, focusing in particular on the hypersingular case (i.e. inverse power with power larger than or equal to the dimension). We prove convergence of the empirical measure to the solution of a porous medium equation by the method of $Γ$-convergence of gradient flows introduced by Sandier and the second author. This improves on the prior convergence result by Oelschläger obtained under more stringent assumptions. The method also works for the case where the power is smaller than the dimension, as well as for a class of convex short-range interactions. The proof highlights the crucial role played by the convexity of the interaction, which allows one to show that no excess energy can arise along the flow, implying the needed "slope inequality".

comments
38 pages, no figures
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2610.34136 ↗

In this paper, we study the global well-posedness and large-time asymptotic behavior of strong solutions to the $n$-dimensional ($n\ge 2$) compressible viscous resistive magnetohydrodynamics (MHD) equations in the upper half-space $\mathbb{R}_+^n$. We impose the standard no-slip boundary condition on the velocity field and two types of physically relevant boundary conditions on the magnetic field: the insulating boundary condition and the perfectly conducting boundary condition. Under the assumption that the initial data are small perturbations of the constant equilibrium state $(\barρ, \mathbf{0}, \mathbf{0})$, we first establish the global existence and uniqueness of strong solutions in Sobolev spaces by deriving uniform energy estimates and using a bootstrapping argument. Then, by combining the sharp decay estimates of solutions to the corresponding linearized system with Duhamel's principle, we obtain the decay rates of solutions to the nonlinear problem. Specifically, we prove that the solutions decay at the rate $t^{-\frac{n}{2}\left(1-\frac{1}{p}\right)}$ in $L^p$ norm for $2\le p\le\infty$, and we also establish the decay rates of their first-order derivatives. Furthermore, we show that the global solutions converge to the linearized solutions with an improved decay rate as time goes to infinity. Our results extend the classical results of Kagei and Kobayashi \cite{Kagei-Kobayashi2002, Kagei-Kobayashi2005} for the compressible Navier–Stokes equations on the half space to the compressible MHD system with both insulating and perfectly conducting boundary conditions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34166 ↗

We establish a quantitative large-time comparison between the macroscopic Boltzmann solution and the full nonlinear compressible Navier-Stokes solution in one space dimension. For Maxwellian molecules and hard potentials with angular cutoff, we consider small, spatially compactly supported perturbations of a global Maxwellian with polynomial velocity decay, without assuming spatial differentiability. Nonlinear diffusion waves persist at leading order, making comparison through linearized equations alone insufficient. We construct a coupled system for the leading nonlinear fluid waves and derive cancellation identities from the exact kinetic spectral representation to control interactions between distinct characteristic families. Combined with a particle-fluid decomposition, these yield pointwise estimates separating the leading waves, their interactions, and a faster-decaying remainder.

comments
56 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34174 ↗

The paper concerns the orbital stability of positive standing waves for the logarithmic Choquard equation with a small local nonlinear perturbation. First, the uniqueness and nondegeneracy of the positive ground-state solution are established via bifurcation and compactness arguments. Then, by exploiting the spectral properties of the linearized operator around the positive ground-state solution in high-energy spaces, the orbital stability of the corresponding positive standing wave is proved. The main difficulty in establishing orbital stability stems from the fact that the logarithmic convolution kernel is both sign-changing and strongly singular, while the norm used to prove global existence is not translation invariant. Consequently, existing approaches to orbital stability for positive ground-state solutions of three-and higher-dimensional Choquard equations with Riesz-type kernels cannot be applied to the two-dimensional logarithmic Choquard equation considered here.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34200 ↗

We study the two-dimensional quadratic Schrödinger equation $(i\partial_t+Δ)u=λ_1u^2+λ_2\overline u^{\,2}$ with initial data of size $\varepsilon$ in a weighted $H^2$ space. We prove almost global existence, with a lifespan of at least $\exp(c/\varepsilon)$ and decay at the optimal linear dispersive rate $t^{-1}$. Our proof is based on the space–time resonance method introduced by Germain, Masmoudi, and Shatah. The main new ingredient is a Besov-type profile norm $\mathcal Z$, which allows us to close the bootstrap argument without controlling the global second spatial momentof the free profile, thereby avoiding the substantial time-dependent losses arising from direct second-moment estimates.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34237 ↗

We study finite-time blow-up, critical norm inflation, and global well-posedness for the Geng–Xue system, an integrable two-component extension of the Novikov equation. For initial velocities $(u_0,v_0)\in(H^s)^2$, $s>3/2$, with second momentum $n_0=v_0-v_{0,xx}\in L^1_{\rm uloc}$, we derive explicit blow-up conditions and upper bounds on the lifespan. The blow-up proof uses a cancellation in the equation for $nu_x$ to close the convolution estimates without an a priori bound on $\|u_x\|_{L^\infty}$. Combined with a continuation criterion involving only $u$, these estimates yield critical Besov norm inflation around the initial data in $(H^{3/2})^2$. For initial momenta in $(H^σ)^2$, $σ>-1/2$, each with a fixed sign, we prove global well-posedness. The blow-up and norm-inflation results also extend to the three-component Degasperis–Procesi system.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34267 ↗

This paper investigates the robustness of quantum observability on compact hyperbolic surfaces subject to $L^q$ potential perturbations with $2<q\leq \infty$. Since $L^q$ regularity is strictly subcritical in dimension two, for every non-empty open set $Ω\subset M$ and $T>0$, the solution of $(i\partial_t+Δ-V)u=0$ satisfies the space-time observability estimate $$ \|u_0\|_{L^2(M)}^2 \leq C\int_0^T \|e^{-it(-Δ+V)}u_0\|_{L^2(Ω)}^2\,dt. $$ A cornerstone of our analysis is Sogge's spectral cluster estimate, which allows us to obtain refined spectrally localized semiclassical Strichartz estimates adapted to rough potentials and to show that the potential's contribution vanishes in the propagation of semiclassical measures. The full-support property of invariant semiclassical measures on hyperbolic surfaces associated with the eigenfunctions then yields the desired observability by contradiction. By the Hilbert Uniqueness Method, the corresponding internal controllability result follows.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34287 ↗

We prove global nonlinear stability near the mass Kolmogorov–Zakharov spectrum $f_M(ω)=ω^{-7/6}$ for the isotropic cubic wave kinetic equation, including small time-dependent external forces. For sufficiently small initial perturbations and forcing, the solution remains uniformly close to $f_M$ for all time in a weighted norm. This norm allows $f(t,ω)\sim a_0(t)ω^{-7/6}$ as $ω\to0$ and $f(t,ω)\sim a_\infty(t)ω^{-7/6}$ as $ω\to\infty$. When the external force $φ$ is independent of time, the solution converges at an algebraic rate to a stationary solution in weaker weighted norms. We also give a necessary and sufficient condition on the initial perturbation for convergence in the original weighted norm. These results resolve, for small perturbations of the Kolmogorov–Zakharov spectrum, the question of convergence to a stationary solution under time-independent forcing raised by Collot, Dietert, and Germain (arXiv:2208.00947, Section 1.3). To establish this stability, the collision integral is expanded around $a_0(t)f_M$ at low frequencies and $a_\infty(t)f_M$ at high frequencies, separating it into a linear term with time-dependent coefficients and a nonlinear remainder. This decomposition yields improved control of the nonlinear remainder. The main difficulty is that $a_0(t)$ may vary in time, so the linear operator itself changes with time and its evolution cannot be represented by the semigroup of a single fixed operator. To address this difficulty, we use a parametrix construction to explicitly construct the evolution operator $U_{a_0,a_\infty}$ and establish the required uniform bounds. Moreover, our arguments provide a general framework for proving global stability that may also apply to other evolution equations.

comments
62 pages, 0 figure
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34359 ↗

We consider the compressible quantum Navier-Stokes (QNS) system in a smooth bounded domain, supplemented with a curvature Navier-slip boundary condition for the velocity and a homogeneous Neumann boundary condition for the density. For arbitrarily large initial data away from vacuum, we establish the global existence and uniqueness of strong solutions when the adiabatic index \[ γ\in[1,\infty)\quad\text{for }N=2, \qquad γ\in\left[1,3\right)\quad\text{for }N=3. \] The argument relies on the effective velocity $v=u+\nabla\logρ$, which reveals the parabolic structure of the system. Compared with previous works in the periodic and Cauchy cases, additional difficulties arise from the treatment of boundary terms. We also use a bootstrap argument between the density integrability and the weighted integrability of the effective velocity to enlarge the admissible range of $γ$ from $\left[1,11/4\right)$ to $\left[1,3\right)$. Combining this bootstrap argument with a De Giorgi iteration for the density upper bound and a Nash-Moser type iteration for the positive lower bound, we derive a priori estimates on every finite time interval and extend the local strong solution globally in time. As far as we know, this is the first result on global strong solutions with large initial data for the initial-boundary value problem (IBVP) of the QNS system in bounded domains with compatibility boundary conditions.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34394 ↗

Let $(M^n,g)$ be a smooth closed connected Riemannian manifold of dimension $n\ge3$, and let $ψ\in C^\infty(M,\mathbb R)$. We prove that the equation $$ -\frac{4(n-1)}{n-2}Δ_g u+ψu=u^{\frac{n+2}{n-2}} $$ has a smooth positive solution if and only if its linear part has positive first eigenvalue. In dimensions $n\ge6$, the proof combines an energy estimate under exact local mass constraints with an intersection argument for finite cycles of atomic measures; dimensions $3\le n\le5$ follow from the theorem of Bahri and Brezis.

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

We study an Alt-Caffarelli-type free boundary problem for symmetric elastic graphs with fixed boundary height. Our results concern existence of minimizers and their description in terms of regularity and shape. It turns out that the weight coefficient in front of the measure term is decisive for existence. We identify a sharp threshold for this coefficient below which existence is guaranteed. Moreover, we find that all sign-changing minimizers are described by a system of three Eulerian elasticae, none of which are lines. Another result shows non-flatness of free boundary points, a classical question in the study of Alt-Caffarelli problems. These properties lead to a better understanding of the nonexistence phenomenon above the aforementioned weight threshold.

comments
23 page, 3 figures, comments welcome
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34447 ↗

We consider the focusing energy supercritical nonlinear Schrödinger equation \begin{equation*} i\partial_tψ+Δψ+|ψ|^{2p}ψ=0 \end{equation*} in dimensions $d\geq11$, with $p\in\mathbb N^\ast$, under the Joseph–Lundgren condition $2p+1>p_{JL}(d)$. For every $ν>ν_0(d,p)$, there exists a radial finite-time type II blow-up solution concentrating the ground state $Q$ in the form \begin{equation*} ψ(t,x)=λ^{\frac{1}{p}}(t)Q(λ(t)x)+ζ(t,x),\quad λ(t)=t^{-\frac12-ν}. \end{equation*} All homogeneous Sobolev norms $\|ψ(t)\|_{\dot H^s}$, $1\leq s<s_c$, remain bounded. The radiation converges to a limiting profile \begin{equation*} ζ^*\in \dot H^s(\mathbb R^d), \qquad s_c<s<s_c+2ν|λ_+|, \end{equation*} where $λ_+$ is determined by the leading correction in the asymptotic expansion of $Q$ at infinity. Our proof combines matched asymptotic expansions across three spatial scales with modified energy estimates. The key ingredient is the systematic treatment of the singular nonlinear background and coupled oscillations generated by the slow algebraic tail of $Q$.

comments
67pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34448 ↗

The data-to-solution map of the incompressible Euler equations is continuous but not uniformly continuous on Sobolev spaces, whereas viscosity makes the Navier–Stokes solution map Lipschitz continuous on small data, uniformly in time. This paper identifies the behavior of the solution map for a hybrid system sitting between these two extremes: the incompressible Oldroyd–B model in $\mathbb{R}^d$, $d=2,3$, in the high-Reynolds-number, high-Weissenberg-number regime. The velocity equation is a forced Euler equation and the only dissipation is a fractional diffusion $η(-Δ)^β$, $\frac12\leβ\le1$, acting on stress. We prove that, on the ball of small $H^s$ data ($s>1+\frac d2$) on which global solutions exist, the solution map is Lipschitz continuous with respect to the $H^{r}$-norm, $r=s-(2β-1)$, uniformly for all time, and Lipschitz into the natural dissipation spaces; the constant is explicit and tends to $\sqrt3$ as the size of the data tends to zero. Consequently the map is Hölder continuous into $C_b([0,\infty);H^{s'})$ for every $s'<s$, and is Lipschitz in $H^s$ itself when $β=\frac12$. Thus, although the velocity field is only transported, the solution map behaves like that of the Navier–Stokes equations rather than that of the Euler equations. The proof exploits the damped wave structure generated by the coupling between $u$ and $\nabla\cdotτ$ through a Lyapunov functional with a cross term $(δu,\nabla\cdotδτ)_{H^{r-β}}$, which transfers the stress dissipation to the velocity difference, together with a low-frequency interpolation argument that keeps all Gronwall coefficients integrable on $(0,\infty)$. The loss of $2β-1$ derivatives is exactly the gap between the hidden velocity dissipation of order $2(1-β)$ and the dissipation required by the Lipschitz estimate, and we show that it cannot be reduced by the energy method.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34498 ↗

We construct mixing solutions to the incompressible porous media equation for fully unstable Muskat initial data. The mixing zone expands linearly in time around an evolving central interface. Our approach combines the $h$-principle with the inversion of the associated Birkhoff-Rott operator, required when the viscosities differ. A key ingredient is to formulate this inversion in terms of the Saffman-Taylor function rather than the vorticity. This considerably simplifies the analysis and may be of independent interest for the Muskat problem.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34504 ↗

We prove that the Kirchhoff-Pohozaev equation on any compact connected Riemannian manifold without boundary admits a Lax pair $(L,B)$, where $L$ is a self-adjoint finite-rank perturbation of the Laplace-Beltrami operator and $B$ is a skew-adjoint operator of finite rank, both depending analytically on the phase space variables. We study the spectrum of $L$ using the perturbative determinant which is known to determine its spectrum and to admit a product representation similar to that of the generating function in KdV. We use this to show that the dynamics of the integrals of motion constructed in \cite{BoitiManfrin2026,BHMP,campos} admits a Lax pair formulation with the same operator $L$ and to get a new proof of the involutivity of these integrals.

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

We construct smooth Riemannian metrics and scalar potentials that are invariant under a circle action and satisfy the static Einstein equations with positive cosmological constant. The underlying compact three-manifold is a ball with two disjoint open balls removed. The potential (or lapse function) is positive in the interior and vanishes at the boundary, consisting of three non-degenerate horizons. The areas of the two inner boundary components are controlled by two arbitrary parameters, namely the masses of the black holes, which are taken to be sufficiently small and comparable. Each inner horizon radius scales linearly with the individual mass parameters, while the separation of their reference centers scales as the cube root of the total mass. These two scales are assumed to be sufficiently small at different rates, whereas the cosmological length remains fixed. The main analytical challenge is to control the linearized equation and the nonlinear remainder simultaneously near the shrinking horizons, between the centers and in the outer region. Weighted Hölder estimates quantify the growth of the inverse and show that the error of an approximation joining Kottler collars to de Sitter space is small enough to close a contraction argument. Namely, we solve a reduced elliptic Einstein equation that is endowed with two obstruction tensors; varying the two axial positions removes their coefficients. The contracted Bianchi identity and an energy estimate for an auxiliary vector field (Killing field) introduced by the projection to vanish. Finally, for a fixed cosmological constant, the intrinsic metric of one of the two boundary components is sufficient to determine a static solution with simply connected interior and non-vanishing boundary gradient, up to isometry and multiplication of the potential by a positive constant.

comments
76 pages
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2610.34555 ↗

We prove action and spectral stability near finite-gap tori of the periodic Korteweg–de Vries equation under autonomous analytic Hamiltonian perturbations of size $\varepsilon$. The estimates are uniform over prescribed compact families, without small-amplitude or nonresonance assumptions, and allow nearby initial data with infinitely many open gaps. Assuming a strong solution and a uniform higher Sobolev bound on $[0,T_0/\varepsilon]$, we permit one-derivative loss in the perturbing Hamiltonian's normal gradient. For sufficiently small $\varepsilon$ and initial normal Birkhoff size $r_0$, the tangential action variations and weighted sum of normal actions are bounded by $C_δ(r_0^2+\varepsilon^{2δ})$, while the spectral-gap variation in $\ell^2$ is bounded by $C_δ(r_0+\varepsilon^δ)$, for every $0<δ<1/4$. A key ingredient is coercivity of the negative Hessian of the nonlinear KdV Hamiltonian on the full $\ell^2$ action space at every finite-gap action. We combine this with resonance analysis and corrected action observables evaluated along the solution. The hypotheses are verified for several local and nonlocal Hamiltonian perturbations.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34601 ↗

We study the nonlinear dynamics of the spatially inhomogeneous kinetic wave equation associated with the FPUT-$β$ problem. We prove global-in-time well-posedness near nonsingular Rayleigh-Jeans equilibria and their asymptotic stability in particular in weighted $L^\infty$ norms in space and momentum, for small initial perturbations orthogonal to the collision kernel at almost every spatial point. We describe the spectrum near the origin at small spatial frequencies, identifying two simple eigenvalues with fractional and diffusive orders $|ξ|^{8/5}$ and $ξ^2$, respectively. Combining this spectral analysis with energy estimates taking into account the transport effect, we establish algebraic decay for the linear semigroup despite the absence of a spectral gap for the collision operator. We then use these estimates to obtain nonlinear stability.

comments
53 pages, 1 figure
fields
Analysis of PDEs, Mathematical Physics
pdf ↗ page arXiv:2610.34636 ↗

We consider the convexity-preserving property and finite-time extinction of level sets for quasilinear geometric equations using a game-theoretic approach introduced by Kohn and Serfaty. To construct the game whose value function approximates the viscosity solution, we use the approach introduced by Sato.

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

In this paper, we establish unconditional uniqueness for the cubic nonlinear Schrödinger equation (NLS) in the scaling-critical class $H^{1/2}(\mathbb{T}^3)$. Unlike approaches based on the GP-hierarchy or normal form reductions, which typically involve higher-order expansions, our proof works directly with the original cubic NLS, where we also make use of several new a priori Euclidean-like Strichartz estimates. More precisely, we show that every distributional solution in $C_tH_x^{1/2}$ belongs a priori to the class $L^2_{t,\mathrm{loc}}L_x^6$. The key ingredients are a suitable high-low modulation decomposition and the compactness of solution trajectories on bounded time intervals. We also exploit the preservation of the canonical symplectic form under the truncated NLS flow, in order to obtain necessary stability estimates in the rough Sobolev space $H^{-1/2}(\mathbb{T}^3)$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34733 ↗

The current paper is devoted to the study of the propagation dynamics of a parabolic-elliptic chemotaxis model in a shifting environment. We investigate the scenario in which the favorable and unfavorable habitats are spatially separated, with the favorable habitat shifting at a time-periodic speed. We first establish the vanishing, persistence, and spreading properties of solutions with compactly supported and front-like initial data. In particular, we show that if the self-limitation rate of the species is large relative to the chemotactic sensitivity and the species is initially confined to a bounded region, then the species eventually becomes extinct when the habitat shifts rightward with a large average speed. In contrast, when the average shifting speed of the habitat is moderate, the species can persist and spread along the shifting habitat into an increasingly large spatial region. Finally, we establish the existence and nonexistence of time-periodic forced wave solutions whose wave speed coincides with the average shifting speed of the habitat.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34753 ↗

We prove Liouville theorems for smooth stationary incompressible Navier-Stokes flows in $R^3$ with finite Dirichlet integral and velocity vanishing uniformly at infinity. If the partial components of velocity $(u_1,u_2)$ belong to $L^{4,\infty}$, then we show that $u$ must vanish. The second result only requires that one component $u_1$ belongs to $L^{3/2,\infty}$. The proofs are based on the head-pressure sign and a localized energy identity, combined with different pressure estimates for the two cases.

comments
20 pages, no figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34780 ↗

We study the recovery of spatial rotational damping in a clamped Timoshenko beam. The coefficient belongs to a prescribed bounded finite-dimensional family. One fixed spatial average of rotation is recorded in separately labelled experiments with known initial rotational velocities. We construct these velocities so that the leading coefficient-to-data map is an invertible Gram matrix. Testing the equations against the smooth observation kernel gives a uniform parameter-Lipschitz remainder without differentiating the damping coefficient. A weighted temporal moment then yields global injectivity, Lipschitz stability and a globally convergent projected fixed-point reconstruction for sufficiently short observation times. Upper and deterministic two-point lower bounds give the same noise-amplification order $T^{-5/2}$ for $L^2$ time-history errors. A second sensitivity estimate supplies a separate sufficient condition for strong convexity and global projected-gradient convergence. We derive continuous and exact discrete adjoints, prove finite-time convergence of a conforming finite-element midpoint scheme, and propagate forward error into coefficient error. Reproducible synthetic experiments examine symmetry, gradient accuracy, noise and discretization bias.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34786 ↗

We prove small-data global well-posedness for the quadratic good Boussinesq equation on the real line and the circle at the endpoint $H^{-1/2}\times H^{-3/2}$. On each domain, a small invariant spectral set supports a continuous global group, with uniqueness in a fixed local integral class. In the periodic case, both components have zero mean and the flow is Lipschitz on bounded time intervals. The a priori bounds follow from a balanced perturbation determinant for the third-order Lax operator. Averaging two real spectral branches yields coercivity and frequency-tail control. On the line, we construct the endpoint flow by commuting Hamiltonians and Green-field estimates. On the circle, discrete spectral bounds and Kishimoto's endpoint local theory give global well-posedness.

comments
50 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34793 ↗

We study the linearized 2D ideal incompressible magnetohydrodynamic equations around a monotone shear flow $(U(y),0)$ with a constant horizontal magnetic field $(β,0)$ on $\mathbb{T} \times \mathbb{R}$. For each fixed $β\neq 0$, we assume that the shear rate $U'$ is bounded above and below by positive constants and varies sufficiently slowly, although it need not be close to any constant. For every nontrivial perturbation with zero horizontal average, we establish sharp $L^2$ time rates in the corresponding paired norms: the horizontal velocity and magnetic components remain of order one, the vertical components decay at rate $\langle t \rangle^{-1}$, and the vorticity–current pair grows at rate $\langle t \rangle$. We prove strong $L^2$ scattering to two Alfvén profiles, identify the leading asymptotic behavior of the physical variables, and establish asymptotic completeness in the natural energy space.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34867 ↗

We study the dependence of the effective Hamiltonian $\overline H_Ω(p)$ on the geometry of periodic perforated domains for convex Hamilton–Jacobi equations with state-constraint boundary conditions. We establish an inf–max representation over smooth test functions for domains with $C^1$ boundary. Using this representation, we derive a quantitative stability estimate in terms of the Hausdorff distance between domains and the reach of one boundary. This estimate yields convergence for non-nested domain approximations whose Hausdorff error is negligible relative to their boundary reach. Examples demonstrate the sharpness of the continuity modulus and show that Hausdorff convergence alone can fail to preserve the effective Hamiltonian, even for smooth domains and the quadratic Hamiltonian.

comments
33 pages, 3 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34910 ↗

In this work, we study the sharp constant \(\mathcal H_d\) in the second-order Hydrogen Uncertainty Principle in every dimension \(d\ge2\). Using a spectral basis built from generalized Laguerre polynomials, together with a linearization procedure and spherical harmonic decomposition, we establish a spectral characterization of \(\mathcal H_d\). More precisely, we show that \[ \mathcal H_d = \frac12\min\{d+1,c_d^*\}, \] where \(c_d^*\in(0,d+3)\) is the unique parameter such that \[ \|S_{c_d^*}^{(d)}\|_{\ell^2\to\ell^2}=1. \] Here, for \(0<c<d+3\), \(S_c^{(d)}\) is an explicit positive Hilbert–Schmidt operator on \(\ell^2(\mathbb N_0)\). This characterization reveals a competition between the radial sector, which yields the value \(d+1\), and the first non-radial sector, encoded by the spectral parameter \(c_d^*\). For \(d\ge4\), we recover the known identity \[ \mathcal H_d=\frac{d+1}{2} \] through a spectral argument, giving an alternative proof of the results of Cazacu, Flynn and Lam \cite{CazacuFlynnLam} for \(d\ge5\) and Huang and Ye \cite{HuangYe} for \(d=4\). For \(d\in\{2,3\}\), this characterization yields \[ \mathcal H_d=\frac{c_d^*}{2}. \] We then exploit this spectral formulation to derive an explicit finite recursive scheme yielding effective two-sided bounds for \(\mathcal H_2\) and \(\mathcal H_3\), substantially improving the estimates of Huang and Ye \cite{HuangYe}.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34916 ↗

In this paper, the Cauchy problem for the equations of pressureless flows in three space dimensions is considered. It is well known that for smooth initial data, the density and velocity gradient often become unbounded at a finite time $t_0$. This type of singularity is associated with sticky-particle dynamics. For an open dense set of smooth initial data, the formation and structure of singularities are investigated using the transversality theorem, with the aid of constructive methods for initial velocity fields. In contrast to the two-dimensional case studied by Bressan, Chen and Huang (arXiv:2408.06877), for $t>t_0$ a singular hypersurface will be formed, whose governing system of equations is not hyperbolic. By assuming the initial data are analytic, we are able to precisely analyze the singular behavior of velocity and density. Based on this, the system of equations for singular hypersurfaces can be recast into a first-order system of Briot-Bouquet type, and the local analytic solution can be constructed using a version of the Cauchy-Kovalevskaya theorem.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34958 ↗

We show the existence of a ``nonradial" smooth entire solution of the Ginzburg–Landau equation with degree $q\in\{8,9\}$ and modulus tending to one at infinity. This answers Brezis' Open Problem 2.4 negatively. To construct the counterexample, we vary a cone parameter $q \in [8, 9]$ and keeping the degree on the cone equal to one. Several key ingredients are needed. First, we need to compute the Morse index of radial vortex solutions at $q\in \{8, 9\}$. Second, we need to show compactness. Finally, Leray-Schauder degree theory and a homotopy argument yield the desired existence result.

comments
50 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34979 ↗

For a nonnegative, uniformly convex function $Φ$, we study nonnegative minimizers of the quasilinear Alt-Caffarelli energy $\int_ΩΦ(\nabla u)+χ_{\{u>0\}}$. Under mild regularity assumptions on $Φ$, we show that the codimension of the singular set of the free boundary is at least $2+η$ for a positive $η$. With a singular minimizer in three dimensions in a forthcoming work, this result is sharp as long as integer dimensions are considered. Our proof method is flexible, and we use it to also prove a similar result for minimizers of the $p$-Laplacian counterpart of the Alt-Caffarelli energy.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.34986 ↗

We study the recovery of a spatial source in the heat equation from terminal observations on a compact interior set $E$ with positive $β$ dimensional Hausdorff content for some $β>d-1$. The prescribed temporal forcing vanishes on a nontrivial interval immediately preceding the observation time. Under a spectral Sobolev prior and a quantitative noncancellation condition on the terminal spectral multipliers, we establish conditional logarithmic stability. For scattered observations on such sets, we derive a sampling inequality under a quasi uniformity assumption. Under explicit sampling and independent noise assumptions, we prove a logarithmic convergence rate in probability for the corresponding Tikhonov reconstructions with a data driven parameter choice. Two numerical experiments using a finite candidate approximation of a fixed Hausdorff set assess discrete spectral sampling stability and illustrate the effects of the waiting interval and measurement noise on reconstruction.

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

This article studies the propagation, near a smooth non-constant ground state, of monophase oscillatory wave trains with small amplitude and very high frequency for multidimensional nonlinear scalar conservation laws. These oscillations lie beyond the classical regime of uniformly bounded variation. Two scenarios may occur. Under suitable compatibility conditions, the oscillations propagate. Otherwise, they are damped through shock formation. In the baseline supercritical regime, we give an explicit criterion distinguishing these two behaviors and justify the corresponding asymptotic descriptions. At higher frequencies, the propagation mechanism becomes more restrictive and is governed by compatibility conditions involving a Lie algebra. Under a natural local constant-rank assumption, we obtain a necessary and sufficient condition for the existence of complete WKB expansions. We also prove cancellation under first-order incompatibility. Perturbing a non-constant background state limits the propagation of small scales compared with the constant-background case. Our constructions contribute to the understanding of the fractional smoothing effect conjectured by Lions, Perthame and Tadmor.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35034 ↗

In this paper, we study the singularity behavior of immersed locally convex closed plane curves evolving under generalized anisotropic Gage area-preserving flows with slow curvature speeds of the form $κ_σ^α$, where $0<α\le 1$. Here $κ_σ$ denotes the anisotropic curvature associated with a prescribed anisotropy function $σ$. We prove that every finite-time blow-up is of Type-II provided that the Euclidean length of the evolving curve remains uniformly bounded away from zero. This result holds without any symmetry assumptions on either the initial curve or the anisotropy. When the initial signed area is nonzero, this length lower bound is automatically satisfied, and thus any finite-time singularity is necessarily of Type-II. By means of Hamilton's rescaling method combined with a differential Harnack estimate, we show that along a suitable blow-up subsequence, the rescaled curves at the selected times converge locally to the profile of a translating solution of the corresponding anisotropic curvature flow $V=κ_σ^α$. We also establish sufficient conditions for finite-time singularity formation in terms of the initial signed area and anisotropic length. Moreover, we construct locally convex initial curves arbitrarily close to the Wulff curve for which a finite-time Type-II singularity occurs.

comments
23 pages, 0 figures
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2610.35064 ↗

The classical formulation of Gill's theorem establishing the linear stability of the buoyant flow in a vertical porous channel subject to transverse diffusion and bounded by impermeable walls is here reconsidered from the perspective of anomalous mass diffusion. Anomalous diffusion is a physical effect implying a more general formulation of the governing equations of mass transfer either in a fluid or in a fluid-saturated porous medium. Anomalous diffusion is mathematically modelled via a diffusion equation with a time-dependent mass diffusivity. In this study, the stationary and parallel buoyant flow in a vertical porous layer saturated by a fluid is investigated. The implications of the anomalous diffusion model for the proof that such a flow is always linearly stable are analysed.

comments
9 pages, 1 figure
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35078 ↗

For any prescribed positive integer $n$, we establish the existence of a family of stationary solutions to the two dimensional capillary-gravity water wave equations in finite depth, whose stream functions exhibit $n$ well-separated vertically aligned vortex spikes with alternating signs. The construction is based on a nonlinear gluing scheme for a singularly perturbed semilinear elliptic equation coupled to the Bernoulli equation on the free surface. Our results extend the single-spike construction to arbitrary finite multi-spike configurations and reveal a mechanism through which exponentially localized vortex spikes can coexist with an almost flat free surface.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35129 ↗

This paper deals with the variational analysis of edge dislocations arising in small-angle grain boundaries (Read–Shockley) and semi-coherent interfaces (van der Merwe). Using the Nabarro–Peierls approach to model edge dislocations, we reduce the two-dimensional isotropic Navier–Lamé system governing the linearized elastic energy to a one-dimensional non-local energy on the slip interface through a Dirichlet-to-Neumann map. We prove that the resulting boundary energy coincides, up to a multiplicative constant, with the fractional \(H^{\frac12}\)-Gagliardo seminorm of the displacement jump along the interface. Within this framework, we establish the existence of a unique global minimizer by combining our dimensional-reduction result with the characterization of De Luca, Goldman, and Ponsiglione. Indeed, we show that the optimal defect configuration is uniquely attained, up to translations, by an equispaced periodic array. Finally, we provide a physical rescaling that recovers the classical logarithmic energy regimes of both the Read–Shockley and van der Merwe models.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35133 ↗

We study the global regularity of solutions to the homogeneous Dirichlet problem for a class of Monge-Ampere equations, which become degenerate or singular on the boundary due to the zero boundary value and the distance function. The degeneracy and singularity are described by the index - the sum of the powers of the distance function and the solution. We give a complete classification of the index, and prove that the solution is globally Holder continuous, log-Lipschitz continuous, $C^{1,eta}$, $C^{2,alpha}$ and $W^{2,p}$ respectively, depending on the size of the index. We also obtain estimates related to the five regularity results. All these results are optimal.

comments
32 pages, no figures. Submitted for publication
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35192 ↗

Sustainable harvesting of natural resources is a central challenge both in ecology and economics. This paper explores a MFG model for harvesting in an aquatic ecosystem. Such systems have recently attracted attention from the applied mathematics community, and, due to the interplay between the competition of agents and the internal dynamics of the fish population, the analytical properties of the resulting system are very delicate to study. In the present work, we focus on stationary solutions, with a strong emphasis on their uniqueness and dynamical stability.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35202 ↗

This paper presents a macroscopic approach for modeling pedestrian movement. A convection-diffusion partial differential equation (PDE) is described and used to model the flow of runners along a marathon course. A marathon is a good modeling case study for human movement because the location of runners is only known in sparse locations, so an accurate model is needed to know where people are at all times. As well, marathons offer many safety and logistical problems that can be solved by modeling human movement. Data is obtained from the 2023 Columbus Marathon, and model improvements are made to include a temporally varying convection term. Results show an increase in model accuracy which can allow for better resource allocation and safety measures.

comments
6 pages, 8 figures, 2 tables. Accepted to the 2026 Modeling, Estimation and Control Conference (MECC)
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35206 ↗

We study the relations between seven generalized notions of convexity for continuous integrands in the space of symmetric $3\times 3$ matrices. Here, symmetric quasiconvexity is defined through symmetrized gradients, and symmetric rank-one convexity through symmetrized rank-one lines. We construct a symmetric quasiconvex integrand that is not polyconvex at symmetric matrices, and an integrand that is both symmetric rank-one convex and Hessian quasiconvex but not symmetric quasiconvex. We also establish a transfer principle that converts smooth rank-one convex functions that lack Hessian quasiconvexity into symmetric rank-one convex integrands while preserving this lack of of Hessian quasiconvexity. Applying this scheme to already existing counterexamples yields the existence of symmetric rank-one convex integrands that are not Hessian quasiconvex. Together with known examples, these results determine all pairwise implications among the seven notions considered here.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35216 ↗

We derive a diagonalization of the normal operator of the linearized electrical impedance tomography (EIT) problem on the disk in the case of a radially symmetric Schrödinger potential with Dirichlet-to-Neumann data. The diagonalization is achieved by transforming the normal operator to the adjacent interval finite Hilbert transform which has a known spectral theory including a commuting differential operator. The normal operator in this case is not compact and the spectrum continuous.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35217 ↗

In this paper we prove Liouville-type theorems for the stationary fractional Hall-magnetohydrodynamic equations in $\mathbb R^3$. Smooth solutions vanishing at infinity, with $u\in\dot H^{α/2}$ and $b\in\dot H^{β/2}$, are trivial for $1\leα\le\frac53$, $1\leβ<2$ and $α+2β\le5$, with no additional integrability assumption. The key step is to estimate the Hall boundary term through the Caffarelli–Silvestre extension of $b$.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35260 ↗

We prove global well-posedness and regularization for the isotropic consensus-based optimization equation with initial probability measures of finite fourth moment. Under suitable weight decay assumptions, after any nonconstant consensus motion, both the density and the consensus trajectory become smooth, and all spatial Sobolev norms are locally bounded in time. The proof uses a Fourier commutator estimate, localization and iteration, followed by a nonlinear time bootstrap. Counterexamples show that smoothing can fail at a stationary consensus point. For non-Dirac initial data, we also prove positivity away from the consensus point and full support at every positive time in all dimensions.

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

We consider single-time wave inversion, that is, recovering the initial pressure $f$ from the wave field $\mathcal{W}_T f = u(\cdot,T)$ at a single time $T$, where $u$ solves the wave equation with sound speed $c$ and initial data $(f,0)$. In two dimensions this is the main reconstruction step of full-field photoacoustic projection imaging, where each camera image is a two-dimensional wave field at a single time instant. An efficient direct method is back-propagation by the Fourier multiplier $2\cos(cT|ξ|)$. It yields exact inversion in odd dimensions but not in two. We give its error in closed form, with bounds, and derive an exact explicit filtered back-propagation $f = 2\mathcal{W}_T \mathcal{M}_K \mathcal{W}_T f$ in analogy to filtered backprojection for the Radon transform.

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

This paper develops a quantitative theory of second-harmonic generation (SHG) in hollow plasmonic nanowires, distinguishing geometric symmetry breaking from cavity effects. We consider a centrosymmetric material with a concentric circular cavity and a slightly perturbed outer boundary. Relative to the solid nanowire in~\cite{liu2026quantitative}, the cavity introduces a topological defect by changing the cross-section from a disk to a doubly connected domain, whereas the outer-boundary perturbation breaks geometric symmetry. Local inversion-symmetry breaking at the interfaces induces nonlinear surface polarization. Using layer potentials and boundary-perturbation asymptotics, we derive explicit leading- and first-order formulas for the fundamental and second-harmonic fields. For a circular outer boundary, the leading-order second-harmonic field is purely quadrupolar; its amplitude differs from the solid-wire case by $O(γ^2)$ as $γ=r_i/r_e\to0$ and decays as $O(r_e-r_i)$ in the nonresonant thin-shell limit. For perturbations proportional to $\cos(nθ)$, $n\ge3$, the first-order second-harmonic correction contains only modes $n-2$, $n$, and $n+2$, yielding dipolar, quadrupolar, or higher-order radiation for $n=3$, $n=4$, or $n\ge5$, respectively, provided the lowest-order modal coefficient is nonzero. We derive plasmonic resonance conditions at both frequencies and estimate the singular orders of single and simultaneous resonances, including possible higher-order singularities from coincident resonance factors. Thus geometric symmetry determines the multipolar modes, whereas the cavity radius controls their amplitudes and resonant enhancement.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35307 ↗

We study the large-time behavior of Lions–Feireisl finite energy weak solutions to the barotropic compressible Navier–Stokes equations in three-dimensional bounded domains with Dirichlet boundary conditions and large potential external forces. For $γ>3/2$, we prove that these weak solutions converge exponentially to the steady state as time tends to infinity, provided that the steady density is bounded away from zero. The main novelty of our analysis is a compactness argument based on Young measures. Furthermore, we prove that the Young measures generated by the density are Dirac measures. Together with the extra integrability of the density, this yields strong convergence to the nonconstant steady density and uniform smallness of the energy $w$ for sufficiently large time. We use Taylor expansion and the Bogovskii operator to construct a Lyapunov functional, and use this smallness of $w$ to obtain exponential decay with a time $T_0$, which is independent of the particular weak solution, thereby answering the question raised by Kang, Peng and Xiong in \cite[Remark~1.1]{KPX}. Corresponding decay estimates for the density, momentum, kinetic energy and the viscous dissipation integrated from large times to infinity also hold, allowing vacuum.

comments
28 pages,no figures,
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35320 ↗

This paper addresses the non-local fractional counterpart of the Laplace equation involving critical nonlinearities, a famous problem originally investigated by Brezis and Nirenberg in [Comm. Pure Appl. Math. 36(4) (1983), pp. 437–477]. We study a class of fractional elliptic systems and equations with critical exponents, sublinear absorption, subcritical perturbation, and general noncoercive frequency parameters. The work is carried out both within a general framework involving non-local integrodifferential operators and in specific concrete models. Our results extend and complement the existing literature on critical fractional elliptic problems in several directions: (1) we include sublinear absorption together with a subcritical perturbation, so that the overall nonlinearity is not superlinear at zero; (2) we provide two types of concrete verification of the energy threshold condition in the presence of the critical term, the sublinear absorption, and the subcritical perturbation, whereas the existing verifications are restricted to the pure critical case; (3) we obtain ground state solutions for coupled systems, not merely nontrivial solutions for scalar equations; (4) we allow a general noncoercive range of frequency parameters, including negative values.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35365 ↗

We study the time-asymptotic behaviour of solutions to a singular perturbation of the inviscid Burgers problem describing sound propagation in a radiating gas. This radiating gas model exhibits the interesting phenomenon known as metastability that has been first identified for the viscous Burgers equation. Precisely, on an initial time span, that scales linearly in the inverse of the perturbation parameter, we can quantify the L1-distance of the solution to the so-called sharp N-wave solution of the inviscid Burgers problem and to a diffusive N-wave. On a second long-time stage that scales exponentially in the inverse of the perturbation parameter, the solutions still remain close to a diffusive N-wave before finally collapsing into diffusion waves. Besides our analysis of the radiating gas model, we also provide an alternative description of metastability in the viscous Burgers model which, unlike other studies, relies on L1-estimates and does not require the passage to similarity variables.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35387 ↗

This paper studies the existence and dynamical stability of time-periodic transonic shock solutions to the one-dimensional Euler–Poisson equations under periodic boundary perturbations. The analysis relies on two key mechanisms: the structural dissipation induced by the transonic shock and the stabilization effect of the positive electric field on the shock position. Using a reformulation of the Rankine-Hugoniot conditions and uniform estimates on the flow and shock perturbations, we establish the existence of a time-periodic transonic shock solution. We further prove its dynamical stability under small perturbations of the initial data.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35402 ↗

In this paper, we study neural operators for the Dirichet-to-Neumann map (DN map), which is encountered in the famous Calderón's problem. In many numerical methods used for reconstructing the unknown conductivity from the knowledge of the DN map need to evaluate the corresponding DN map at a given conductivity function, which involves solving the boundary value problem for the conductivity equation and taking the Neumann data. Such procedure is time consuming and not effective. Hence, it is a favorable strategy to construct a surrogate to replace the forward map mapping conductivity functions to corresponding DN maps. The main theme of this paper is to derive quantitative bounds on the parametric complexity of these neural operators. In particular, under suitable assumptions, their depth grows at most logarithmically with $\varepsilon^{-1}$, while the relevant spectral and projection ranks grow algebraically. It should be noted that general neural operators suffer from "the curse of parametric dimensionality". This work demonstrates the construction of neural operators for the DN map that does not suffer from such curse.

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

We study the Gevrey hypoellipticity of a sum of two squares in two variables, satisfying the Hörmander hypothesis, assuming that the function, $ q $, describing (the space projection of) its characteristic variety vanishes only at a single point, which can be assumed to be the origin. A hypoellipticity result is given in a Gevrey class, depending on $ q $. In some examples the found regularity is known to be optimal.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35427 ↗

We prove quantitative log-concavity and fundamental-gap estimates for Dirichlet Schrödinger operators on complex projective domains. With holomorphic sectional curvature four, the boundary condition $\mathrm{II}\ge\sqrt{44/5}\,g$ suffices in every complex dimension under $\operatorname{Hess} V\ge2|\nabla V|g$ and $\operatorname{osc}V\le4n$. It yields $\operatorname{Hess}(-\logφ_1)>g$ and $λ_2-λ_1>\max\{n+2+\sqrt{n^2+5n+11},\,2n+14/3\}$. The main difficulty is to control the distinguished Hopf direction together with a transverse Hessian block whose dimension grows with $n$. We extend modified-Hessian first-contact arguments by retaining the Hopf term and using longitudinal and transverse rotational tests. A trace minimization reduces all gradient orientations to three extreme directions. A dimension-scaled logarithmic barrier then compares their contact costs with a single limiting profile. A radial spectral estimate supplies the required quadratic-in-dimension spectral threshold from a dimension-independent boundary curvature bound. For $n\ge3$ these are, to our knowledge, the first log-concavity estimates for domains in $\mathbb{CP}^n$ without symmetry assumptions. We also prove a sharp diameter bound and Hessian levels linear in $n$ under larger dimension-free curvature bounds.

comments
38 pages, 1 figure
fields
Analysis of PDEs, Differential Geometry, Spectral Theory
pdf ↗ page arXiv:2610.35431 ↗

Let $z\in \mathbb{H}:=\{z\in\mathbb{C}:\Im(z)>0\}$ and $Λ:=\frac{1}{\sqrt{\Im(z)}}\big({\mathbb Z}\oplus z{\mathbb Z}\big)$, and set $ θ(α;z):=θ(α;Λ)=\sum_{(m,n)\in\mathbb{Z}^2}e^{-πα\frac{|m+nz|^2}{\Im(z)}}. $ We study the minimization of the functional $θ(α;z)-bθ(2α;z)$ and establish a complete phase diagram for all $α>0$ and $b\in(0,\sqrt{2})$. For $0<b<\sqrt{2}$, an explicit threshold $b_1=0.0767767081\cdots\in(0,1/10)$ separates two distinct types of phase transitions. Type I: $0<b<b_1$: it admits a type of ``hexagonal–rhombic–square–rectangular'' phase transition. Type II: $b_1\le b<\sqrt{2}$: it admits a type of ``hexagonal–square–rectangular'' phase transition, without passing through the rhombic lattices. These phase transitions contrast with Montgomery's theorem \cite{Mon1988}, where the hexagonal lattice minimizes the single theta function at all scales, and the recent Bétermin-Faulhuber-Steinerberger theorem \cite{BFS2026} for translated Gaussian lattice sums, where the hexagonal lattice prevails in a min-max structure. In our setting, the density parameter $α$ governs the sequence of optimal lattice shapes, while the competition parameter $b$ controls the emergence of the rhombic phase, which exists for $b<b_1$ and vanishes for $b\ge b_1$. As an application, we resolve Bétermin's conjecture \cite{Betermin2021AHP}. Bétermin predicted a Type I phase transition for the functional $θ(α;z)-(1/10)θ(2α;z)$ with $b=1/10$. We instead rigorously establish that no rhombic lattice is a global minimizer at any density and prove that the system undergoes a Type II phase transition, thereby settling the conjecture in corrected form.

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

We investigate the simultaneous low Mach number and vanishing viscosity limit for a three-dimensional compressible viscous fluid interacting with a freely moving rigid body. The fluid satisfies the compressible Navier-Stokes equations and the no-slip condition on the body surface, while the body evolves according to Newton's laws driven by the fluid stresses. We establish convergence of finite-energy weak solutions to a strong solution of the corresponding incompressible Euler-rigid body system on its interval of existence. Assuming that the initial relative energy tends to zero, convergence holds under a Kato-type condition in a boundary layer whose thickness is proportional to the viscosity. This condition combines vanishing viscous dissipation with a weighted estimate on the fluid momentum relative to the rigid body motion. The proof uses the relative entropy method and a boundary layer corrector adapted to the fluid-rigid body coupling, providing a sufficient condition for convergence in relative energy as the Mach number and viscosity tend to zero simultaneously.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35441 ↗

For $m\geq 2$, we give a complete characterisation of the continuous functions on $\mathbb{R}^m$ that are divergences of continuously differentiable vector fields. The characterisation is formulated in terms of distributions and, equivalently, in terms of the continuous dual of a suitably topologised subspace of the Arens–Eells space. The two implications yield contrasting applications. First, there exists a compactly supported continuous function which is the divergence of a bounded Lipschitz vector field but not of any continuously differentiable vector field. Second, every continuous function whose distributional partial derivatives are locally $m$-integrable (the critical exponent for Sobolev embedding) is the divergence of a continuously differentiable vector field.

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

We study the boundedness of extremal 2D Trudinger-Moser inequality associated with many point vortices with multi-intensities. Sufficient conditions for continuously-distributed measures are given in one-sided and two-sided cases.

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

We study the dependence on the terminal condition of solutions to a fully nonlinear parabolic Hamilton–Jacobi–Bellman (HJB) equation, when the terminal condition varies along a finite-dimensional family. This problem is motivated by a dual formulation of semimartingale optimal transport. The equation is posed as a terminal-value Cauchy problem on an unbounded spatial domain. Under structural ellipticity and regularity assumptions on the nonlinear operator, we recall local parabolic Hölder estimates and stability results for bounded uniformly continuous terminal data. We then establish continuous directional differentiability of the solution map with respect to the finite-dimensional parameter, and identify its derivative through the corresponding linearized Cauchy problem. Under an additional convexity assumption on the Hamiltonian and a non-degeneracy condition on the terminal data, we prove local strong convexity of the point-evaluated solution map. The analysis relies on Evans–Krylov theory for fully nonlinear parabolic equations and combines PDE arguments with probabilistic representations. Finally, we extend the differentiability and convexity results to cascades of Cauchy problems in which successive equations are coupled through terminal conditions at several prescribed times. This structure is motivated, for instance, by optimal transport problems with marginal constraints imposed at several maturities.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35476 ↗

We examine the linear stability and nonlinear evolution of a heated falling film containing a soluble surfactant and a weakly viscoelastic liquid. The stress response is described by the short-memory Walters model, while surface tension depends on temperature and surface concentration. An Orr–Sommerfeld analysis and its long-wave limit determine how elastic memory and the two Marangoni stresses enter the instability threshold. A five-field weighted-residual model is then derived to describe finite-amplitude disturbances. The bulk and surface transport equations are written with compatible fluxes, which conserve their combined projected surfactant inventory in a periodic domain. The numerical examples show that solutal Marangoni stress suppresses disturbance growth and reduces the amplitude of the nonlinear waves. Thermal Marangoni stress increases the maximum growth rate, although its effect on the width of the unstable wavenumber band is different. Elastic memory changes both the onset and the finite-wavelength response. The nonlinear profiles develop a main hump and capillary ripples, accompanied by variations in bulk concentration, surface concentration, and interfacial temperature. These results describe the competition between thermocapillary forcing, surfactant redistribution and elastic stress within the retained long-wave model. The larger elastic parameters are interpreted as formal predictions of the truncated constitutive equations, rather than as a controlled extension to strongly elastic flow.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35481 ↗

We establish a scale-invariant interior $C^2$ estimate for smooth solutions of the real $k$-Hessian equation. As an application, we prove that every smooth entire solution of $σ_k(D^2u)=1$ satisfying $u(x)\ge b|x|^2-B$ for some constants $b,B$ with $b>0$ is a quadratic polynomial. For smooth solutions, admissibility is forced by the growth condition. The results also hold for viscosity solutions and for weak solutions in Trudinger's sense. Admissibility is required in the latter case.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35565 ↗

We study exponentially harmonic functions on complete Riemannian manifolds. Under a lower Ricci curvature bound \(\Ric_g\geq-Kg\), we first establish a local gradient estimate in terms of the oscillation. We then prove a pointwise gradient estimate for solutions bounded from one side. As an application, when \(\Ric_g\geq0\), we obtain a Liouville theorem under a one-sided sublinear growth condition. In particular, every exponentially harmonic function bounded above or below is constant.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35571 ↗

Continuing \cite{NWX} and Part I \cite{AOSI}, we further investigate symmetry for spacetime observability of wave equations. Building on asymptotic observable symmetry (AOS) introduced in \cite{AOSI}, we study symmetry under glancing propagation and caustics. We prove that, on every smooth bounded domain in $\R^2$ and for every positive observation time, there is a fixed measurable set satisfying the essential spacetime measurable geometric control condition. However, the observability inequality fails on this set.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35610 ↗

We investigate positive weak solutions of $-Δ_m u\ge u^p|\nabla u|^q$ on complete noncompact Riemannian manifolds without curvature, volume doubling, or Poincaré assumptions. For the superhomogeneous mixed reaction we derive a curvature-free integral volume test by combining two first-order estimates with a recurrence for the mass of a \emph{fixed} density. The same approach organizes the pure-gradient and capacity criteria and yields sharp finite hierarchies of iterated-logarithmic growth bounds, with counterexamples on smooth model manifolds. In the subhomogeneous region, vanishing lower growth of $\log V(R)/R^{m-q}$ forces the Liouville property. On the homogeneous line $p+q=m-1$, we obtain the optimal strict lower-volume-entropy threshold $(p+1)((m-1)/p)^{p/(p+1)}$ for $p>0$ (and $1$ for $p=0$), together with examples at equality. The existing six-region classification is not claimed as new; the advances concern refined volume hypotheses and their model sharpness. The tests remain valid for smooth weighted measures and for locally bounded positive Sobolev solutions. Sharpness is understood within the stated model families; no characterization from volume alone on an individual manifold is asserted.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35688 ↗

Unconditional global existence and scattering are established for the three-dimensional focusing energy-critical generalized Hartree equation with $0<α<3$, below the ground-state energy and kinetic thresholds. The initial data lie in $\dot H^1$, with no radial symmetry, finite-mass, or finite-variance assumption. Annular frequency estimates and Gaussian interaction estimates rule out a compact critical trajectory by first controlling its nonlinear forcing and then recovering its conserved mass.

comments
75 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35700 ↗

We study a stochastic model for the growth and invasion of glioma cells in the anisotropic brain tissue, also incorporating effects of radiotherapeutic interventions and associated uncertainties. The PDE-ODE model couples glioma and healthy tissue dynamics in a nonlinear manner and explicitly includes treatment-related stochasticity through random depletion terms. The macroscopic system has been obtained by an upscaling procedure from a microscopic description in [1]. We prove the existence and uniqueness of local strong solutions to the corresponding stochastic system. The analysis addresses challenges arising from the nonlinear coupling, anisotropic diffusion, taxis mechanisms, and stochastic treatment effects, providing a first rigorous step toward the mathematical understanding of stochastic continuum models for glioma invasion and therapy response.

comments
40 pages, 2 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35763 ↗

Non trivial traveling waves in genuinely nonlinear conservation laws hardly appear and, in some cases, scalar nonlocal conservation laws inherit this feature. Here, we show that mixed nonlocal-local systems of conservation laws display a far richer scenario. A variety of traveling waves may exist, different components may travel with different speeds and traveling waves can appear as time-asymptotic limits. Technically, these results need a significant extension of Dafermos' "trend to steady state" theory, exploiting properties of Hamiltonian systems solved by generalized characteristics.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35771 ↗

The paper consider a conservation law model of traffic flow on a highway, where each driver chooses an optimal departure time $τ^d$, based on a departure cost $\varphi(τ^d)$ and an arrival cost $ψ(τ^a)$. Nash equilibria are studied, where no driver can reduce his own cost by changing his departure time. The first results provide continuity estimates on the arrival time, depending on the distribution of departures. In terms of the ${\bf L}^1$ distance, we show that the corresponding map is Hölder continuous with exponent $1/2$ in Lagrangian variables (labelling individual drivers), and Lipschitz continuous in Eulerian space variables. Concerning the regularity of the a Nash equilibrium, our results show that, when the total number of drivers is sufficiently large, a queue alway forms at the entrance of the highway and the corresponding traffic density contains a shock. Moreover, for any number of drivers (possibly small), we prove that for generic $\mathcal C^2$ cost functions $\varphi, ψ$ the Nash equilibrium solution still contains a shock. In the last section of the paper, assuming that the initial departure rate is not a Nash equilibrium, we consider an evolution equation for the departure rate, where each driver keeps changing his daily departure time in order to reduce his own cost. It is proved that this nonlocal integro-differential evolution equation admits a unique solution, globally in time. This provides some theoretical support to earlier numerical simulations, which indicated the dynamic instability of the Nash equilibrium and the possible existence of a chaotic attractor.

comments
Keywords: Conservation laws, shocks, Nash equilibrium, integro-differential evolution equation
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35772 ↗

We show that, in every space dimension $n\ge2$, the singular set $Σ$ of a generic (in the Baire-category sense) solution of the Stefan problem is countably parabolically $(n-2)$-rectifiable. In particular, $\dim_{\mathrm{par}}(Σ)\le n-2$. This is achieved by proving the following sharp result: in every space dimension, points of the maximal stratum of a generic solution are discrete in space-time.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35780 ↗

We announce a structure theory for measures on $\mathbb{R}^n\times\mathbb{R}$ equipped with the parabolic distance. Our results include a parabolic rectifiable Reifenberg theorem for arbitrary Radon measures, qualitative and quantitative characterizations of regular parabolic rectifiability by Jones square functions, and sharp results for $L^p$ beta numbers. The results hold in every parabolic dimension and extend the theories of Edelen–Naber–Valtorta, Azzam–Tolsa and David–Semmes to space-time. The stated theorems and corollaries, together with their proofs, are formalized in Lean~4 with Mathlib.

comments
Comments are welcome. 15 pages, 7 figures, link to a github repository for formalization
fields
Analysis of PDEs, Classical Analysis and ODEs, Differential Geometry
pdf ↗ page arXiv:2610.35809 ↗

We prove a non-perturbative, non-axisymmetric characteristic gluing theorem for the Einstein vacuum equations: every Boyer-Lindquist sphere in the domain of outer communication of a Kerr black hole, in particular every symmetry sphere of a Schwarzschild exterior, can be glued along a single outgoing null hypersurface to a horizon sphere of an extremal Kerr black hole of sufficiently large mass. The gluing is exact at both ends and matches the full sphere data, including the transversal curvature. This proves a conjecture of Kehle and Unger in the extremal case. We first raise the angular momentum to the extremal value by rotating shear pulses of non-axisymmetric gravitational radiation, and then damp the incoming data exponentially along a long non-expanding neck. At the degenerate target horizon we invert the linearised problem at all angular frequencies, using a factorisation of a fourth-order angular operator into an angular Teukolsky-Starobinsky product. As an application, we construct one-ended asymptotically flat vacuum initial data whose maximal development contains an exactly Schwarzschild apparent horizon and, at a later advanced time, an exactly extremal Kerr event horizon. This is the first rigorous counterexample to the third law of black hole thermodynamics in vacuum, and proves a second conjecture of Kehle and Unger.

comments
84 pages, all comments welcome
fields
Analysis of PDEs, Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2610.35836 ↗

In this paper, for every $\varepsilon>0$, we establish interior and global a priori $C^{1,α}$ estimates for some $α\in(0,1)$ from $W^{2,1+\varepsilon}$ bounds for bounded smooth $2$-admissible solutions of the $2$-Hessian equation, with the interior estimate requiring only an upper bound on the density. Under positive upper and lower density bounds, we prove global $W^{2,1+\varepsilon}$ estimates for some $\varepsilon>0$ on bounded strictly mean convex $C^{2,β}$ domains with $C^{2,β}$ boundary values. For densities bounded above and below by positive constants, the interior $C^{1,α}$ estimate follows by combining the first result with an interior $W^{2,1+\varepsilon}$ estimate obtained by a slight modification of an existing argument. Combining the first result with the global $W^{2,1+\varepsilon}$ estimate yields the global $C^{1,α}$ estimate. Known examples show that the $C^{2,β}$ regularity assumptions on the boundary and boundary values are optimal in the Hölder scale for both the global $W^{2,1+\varepsilon}$ estimate and the global $C^{1,α}$ estimate.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.35839 ↗

Combinatorics86

In this paper, we consider the magic positivity of the Ehrhart polynomial of dilated base polytope of minimal matroid of rank $k$ dimension $n$. We prove that for $\displaystyle 1\leq k<\lfloor\frac{n}{2}\rfloor$, the $n-k-1$ dilate of the Ehrhart polynomial is not magic positive. We also show that for sufficiently large $n$, the $n-k$ dilate of the Ehrhart polynomial is, in general, magic positive. This gives rise to a lower bound of the $m-$index of the Ehrhart polynomial.

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

Let $\Tn$ be the triangular grid of side $n$, with its $n^2$ unit cells, and let two cells be side-adjacent if they share an edge and point-adjacent if they share a vertex. We count the orbits of $3$-element sets of pairwise non-adjacent cells under the rotation group $C_3$ and under the full symmetry group $D_3$ of $\Tn$. Three of the four resulting sequences are OEIS A397730, A397731 and A397732, for each of which the only formula on record is a generating function conjectured by Sean A.\ Irvine on 14 July 2026. We prove all three conjectures. The route is Burnside's lemma, together with exact lattice counts for each fixed-point term. The side-adjacency graph turns out to be bipartite, so its triangle count vanishes, and the triangles of the point-adjacency graph have a clean structural description, which gives that count too. Along the way we obtain the first explicit closed forms for the three sequences, each a quasi-polynomial of degree $6$ and period $3$, $6$, $3$ respectively. The same machinery settles the fourth member of the family, whose closed form has been recorded at A289230 without proof since 2017, and the labeled count A289224 that feeds it.

comments
24 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.33023 ↗

We classify all 1024 length-two mesh patterns on involutions into exactly 287 equidis- tribution classes, consisting of 262 trivial classes and 25 nontrivial classes. Since many bi- jections on arbitrary permutations do not preserve the involution condition, our proofs use several involution-preserving bijections, including conjugation and local adjacent-transposition operations, transposition of the RSK recording tableau, prefix-rank swap bijections and marked-occurrence bijections. In particular, we establish the equidistribution of INV-099, a nontrivial class closely related to the unrestricted Class 69, by adapting the marked- occurrence bijection of Zhang and Zhao through a symmetric closure of the marked set. We also obtain explicit distribution formulas and recurrences for several classes, including continued fractions obtained by specializing known labeled Motzkin-path formulas and rational expressions derived from paired skew decompositions of involutions.

fields
Combinatorics
pdf ↗ page arXiv:2610.33028 ↗

Before the game, the sages agree on a finite set of symbols and on a rule for choosing one of them. They are then seated in an unknown order, either in a row or around a circle with a common clockwise direction. Each sage sees only the adjacent sage or sages and secretly writes one symbol. The slips are then mixed, so nobody learns who wrote which symbol; everyone learns only how many times each symbol occurred. The aim is that every sage should be able to independently reconstruct the entire seating. We ask for the smallest number of distinct symbols that makes this possible. We also consider a version in which the seats have fixed public labels, and each sage is told the label of their own seat. For large numbers of sages, the minimum number of symbols is proportional to the square of the number of sages, up to a constant factor. Several small cases can be settled exactly. Four sages in a row need exactly two symbols, and so do five sages on a circle. Six sages on a circle need exactly three symbols, both with and without labeled seats; we give a short explicit rule. Five sages in a row with labeled seats also need exactly three symbols. Without seat labels, two symbols are impossible, and four are sufficient; whether three symbols suffice remains open.

fields
Combinatorics
pdf ↗ page arXiv:2610.33032 ↗

We study characteristic Chow polynomials of principal intervals in generalized subword order, equivalently of pattern-containment intervals below layered permutations. A terminal-chain recurrence and canonical rightmost embeddings yield a recursive rational generating function for every fixed number of layers, governed by a universal denominator. In the two-layer case we obtain an explicit kernel, prove canonical interlacing when one layer has size at most four, and prove eventual interlacing at every fixed width by a Laguerre limit. We also treat two families with unboundedly many layers. Singleton-prefix intervals have a closed Delannoy-Jacobi gamma polynomial and form real-rooted interlacing sequences. Singleton-sandwich intervals admit rational three-variable series and a marked-slot formula for all gamma coefficients. Their central-layer-two and central-layer-three slices are real-rooted, with interlacing under growth from two to three. For each fixed pair of singleton flanks, a Laguerre differential transform proves eventual interlacing as the central layer grows. These results exhibit composition intervals as a structured testing ground for positivity and root-location questions for Chow polynomials of posets.

comments
32 pages. Supplementary verification code and scope reports included as ancillary files
fields
Combinatorics
pdf ↗ page arXiv:2610.33037 ↗

Let $G$ be an $H$-free graph and $e$ be a non-edge of $G$. We say $e$ is an $H$-saturating edge of $G$, if $G+e$ contains a copy of $H$. We denote by $f_H(n,m)$ the minimum number of $H$-saturating edges of an $n$-vertex $H$-free graph with exactly $m$ edges. In this paper, we show that $f_{W_{2k+1}}(n,ex(n,F_{2k+1})+1)= \begin{cases} \ell -k, &(k-2)\ell \ \text{is even}, 2(\ell-k)-1, &(k-2)\ell \ \text{is odd}, \end{cases}$ and $f_{W_{2k}}(n,ex(n,F_{2k})+1)=\left(\frac{2}{33}+o(1)\right)n^2.$ At the same time, we characterize the corresponding extremal graphs.

fields
Combinatorics
pdf ↗ page arXiv:2610.33041 ↗

Let $D(n)$ be the maximum number of unit-square diagonals in an $n\times n$ square array such that no two selected diagonals share an endpoint and no unit square contains both diagonals. We prove that, for every odd positive integer $n$, $D(n)=n(n+1)/2+\lfloor(n+1)/6\rfloor$. The matching lower bound was established by Boyland, Roth, Pintér, Laukó, Schoenfield, and Wasielewski. We obtain the upper bound by transforming any admissible selection $M$ in a $(2k-1)\times(2k-1)$ square array into an isometric path cover of the $k\times k$ vertex grid with at most $2k^2-|M|$ paths. An auxiliary matching decomposes the original vertices into alternating paths. On each such path, all segments between blocks are either of type $da$ or of type $bc$. Projecting these paths to the block grid gives coordinate-monotone sequences, which become geodesics when diagonal steps are expanded. The Fisher–Fitzpatrick theorem then yields the sharp upper bound. We also describe a Lean verification of the upper-bound reduction, with the grid-cover theorem supplied as an explicit hypothesis.

comments
Lean source code included as ancillary files
fields
Combinatorics
pdf ↗ page arXiv:2610.33042 ↗

Let $λ_2(G)$ and $κ(G)$ denote the second largest adjacency eigenvalue and the vertex-connectivity of a graph $G$. For a non-complete $r$-regular graph $G$, Fiedler's inequality $λ_2(G)\ge r-κ(G)$ shows that $λ_2(G)<r-t$ forces $κ(G)\ge t+1$. The best such bound is known for $t=1$, by Zhang and Wang, and for $t=2$ with $r\ge4$, by Zhang. In this paper, for every $r\ge3$ and every integer $t$ with $2\le t\le r-1$, we give an upper bound on $λ_2(G)$ that forces an $r$-regular graph $G$ to satisfy $κ(G)\ge t+1$, and we determine exactly when this bound is best possible. For $\frac{r+2}{2}\le t\le r-1$, Fiedler's bound $r-t$ is already best possible. For $2\le t<\frac{r+2}{2}$, it is replaced by one of two explicit algebraic numbers, and the sign of an explicit polynomial $W(r,t)$, which never vanishes, decides which one applies. Each of the two numbers is attained exactly when $(r,t)$ satisfies an explicit arithmetic condition, and every extremal graph then consists of two cliques and an independent cut of size $t$. In this range our bound also improves a bound of Zhang that holds for every such $t$.

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

We give a new checkable criterion to ensure that a one-dimensional cellular automaton on a finite alphabet is locally eventually onto. In this setting, openness is equivalent to being n-to-1 for some n and therefore implies surjectivity. Bipermutive cellular automata are known to be locally eventually onto, while open cellular automata that are neither bipermutive nor bijective appear to have received less attention. Building on Sutner's work with de Bruijn graphs, we describe a method for deciding openness and at the same time determining n. We then introduce the notion of block-regularity of local rules as a generalization of bipermutivity and prove that it implies openness. We further identify two conditions that, together with block-regularity, ensure that every nonempty cylinder set is mapped onto the whole configuration space after a finite number of iterations, and hence that the cellular automaton is locally eventually onto. The appendix provides the algorithms that check these finite criteria and then presents examples of locally eventually onto, non-bipermutive cellular automata for small diameters.

comments
29 pages
fields
Combinatorics, Dynamical Systems
pdf ↗ page arXiv:2610.33131 ↗

A strong blocking set is a set of points in a finite projective space that intersects every hyperplane of the space in a spanning set of the hyperplane. These objects have been studied both in finite geometry and coding theory due to their equivalence with minimal codes. We give an explicit construction of strong blocking sets using expander graphs that improves the explicit construction of Alon et al. (Noga Alon, Anurag Bishnoi, Shagnik Das, Alessandro Neri, Strong blocking sets and minimal codes from expander graphs. Transactions of the American Mathematical Society ) by introducing a new geometrically motivated graph parameter that is better suited for this problem. Using this approach, we improve the constant $C$ in the explicit construction of a strong blocking set of size $C (q+1) k$ in the $(k - 1)$-dimensional projective space over $\mathbb{F}_q$ for every prime power $q \geq 7$.

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

An oddomorphism to $K_n$ is a proper colouring with $n$ colours in which every vertex is designated odd or even, every vertex has in each other colour class a number of neighbours of its own parity, and every colour class contains an odd number of odd vertices. We prove that an oddomorphism witness to $K_n$ on at most $n+6$ vertices contains a $K_n$ minor with every branch meeting the witness's specified odd set. The conclusion holds inside any graph containing the witness and therefore applies to weak oddomorphisms. The bound is sharp: for every $n\ge8$ the minimum order of a graph admitting a weak oddomorphism to $K_n$ but having no $K_n$ minor is exactly $n+7$. The extremal example is a fifteen-vertex graph with an oddomorphism to $K_8$, obtained from the doubled theta graph of Kriesell and Mohr by adding one vertex adjacent to the seven roots; we give a structural proof that it has no $K_8$ minor, including their counting argument for the rooted case. A separate technical companion records further results on related root-apex graphs, an attachment theorem and a bounded nine-colour statement, together with their computational provenance; none of it is used here. The results do not resolve the unrestricted clique-target problem.

comments
64 pages, main article and technical companion combined; includes computational provenance and verifier source
fields
Combinatorics
pdf ↗ page arXiv:2610.33283 ↗

We prove Wang's planar D-coloring conjecture. A D-coloring of a graph is a proper edge coloring in which every subgraph isomorphic to $K_4$ minus an edge is rainbow. Wang conjectured that every planar graph of maximum degree $Δ$ has a D-coloring with 9 colors if $Δ=4$, 10 colors if $Δ=5$, and $2Δ-1$ colors if $Δ\ge 6$. Hu, Kong and Wang proved the cases $Δ\le 5$ and $Δ\ge 33$. We prove the sharp bound $2Δ-1$ for every $Δ\ge 6$, settling the remaining cases. The proof uses discharging; the case $Δ=6$ is computer-assisted.

comments
21 pages. Ancillary files contain the certificates and verification scripts for the computer-assisted case of maximum degree 6
fields
Combinatorics
pdf ↗ page arXiv:2610.33322 ↗

We study the symmetry-weighted enumeration of complexes formed by gluing copies of a regular polytope. For polytope trees and complexes obtained by attaching such trees to a fixed initial complex, we derive cut-and-join recurrences, differential equations for generating functions, explicit counting formulas, and asymptotic estimates. We then extend the method to complexes with cycles in their dual graphs, enumerating them by the numbers of polytopes and free facets. We derive recurrence relations and partial differential equations for the corresponding bivariate generating functions. In this setting, we obtain recurrences for connected configurations and explicit coefficient formulas for possibly disconnected configurations, both with and without a distinguished initial complex.

comments
54 pages, 13 figures
fields
Combinatorics, Mathematical Physics, Geometric Topology
pdf ↗ page arXiv:2610.33344 ↗

In this paper we prove that every graph $G$ with no induced six-vertex path satisfies $χ(G)\le ω(G)^{c\log_2ω(G)}$ for $c=45/\log_2(4/3)<109$. The best previous bound was exponential in $ω(G)$. Our result is the first quasi-polynomial bound for $P_6$-free graphs and generalizes the bound for $P_5$-free graphs by Scott, Seymour, and Spirkl [Polynomial bounds for chromatic number. {IV}. {A} near-polynomial bound for excluding the five-vertex path. {\em Combinatorica}, 43(5):845–852, 2023].

comments
16 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.33407 ↗

We develop a compression-and-lifting procedure for constructing D-optimal complementary pairs on finite abelian groups of odd order. The procedure separates the Fourier conditions preserved by compression from those needed to recover the original binary sequences. For groups with a cyclic factor of order nine, integer matching conditions separate compatible classes of local sign assignments. Their exact sizes can be computed before full sequences are generated, allowing searches to discard incompatible pairs and select manageable classes. A bound on cosets on which a sequence is constant also excludes certain automorphisms as fixing symmetries. Applying the method yields supplementary difference sets with parameters $(99;43,42;36)$ and $(85;39,34;31)$, resolving two previously undecided parameter sets. These give the first D-optimal matrix of order $198$ and constructions with new parameters at the known order $170$. For the successful length-$99$ compression, the exact class condition removes $99.9888\%$ of candidate pairs while preserving every D-optimal lift. A reflection-invariant construction at length $85$ gives seven supplementary difference set classes and fourteen matrix classes under signed row and column permutations, paired by transposition. The class reductions guide computation; finding suitable compressions and matching their lifts remain search problems.

fields
Combinatorics
pdf ↗ page arXiv:2610.33418 ↗

An aperiodic binary orientable sequence is a finite sequence of zeros and ones for which, for some integer $n$, all the subsequences of $n$ consecutive symbols, read either forwards or backwards, are distinct. Analogously, a periodic binary orientable sequence is an infinite periodic sequence of zeros and ones for which, for some integer $n$, all the subsequences of $n$ consecutive symbols, read either forwards or backwards, are distinct within a single period of the sequence. Such sequences have potential application in position-location applications. For applications, the longer the sequence (or the greater the period in the periodic case) the greater its utility, but yet while constructions are known for such sequences, and upper bounds on their length (or period) exist, the precise maximum length (or period) was previously unknown for anything other than small values of $n$. In this note the results of LLM-conducted searches for the longest possible aperiodic and periodic binary orientable sequences for $n\leq16$ are reported. In each case an example of a sequence of the maximum discovered length is also provided, and the maximum possible length is now determined for every $n\leq16$ for both the periodic and aperiodic cases.

fields
Combinatorics
pdf ↗ page arXiv:2610.33601 ↗

Each of the 64 hexagrams of the I-Ching, or Book of Changes, is a stack of six Yin-Yang lines and is therefore a binary vector of length 6; the eight hexagrams formed by repeating a single trigram span a doubled-trigram subspace $Δ$. We ask which binary $[6,3,3]$ codes are compatible with this trigram structure. We show that a $[6,3,3]$ code meets $Δ$ in at most four codewords, that the four are then forced to be the doubled trigrams Earth, Fire, Wind and Lake, and that exactly two codes attain this bound: the shortened Hamming code $\mathcal C_A$ and its dual. Since $\mathcal C_A$ has covering radius 2, its eight codewords, their radius-one balls, and its eight deep holes together reconstruct all 64 hexagrams. In general, we call a binary code of length $2m$ with $d \ge 3$ diagonal-coherent if it contains the half of the diagonal subspace $\{(u,u)\}$ coming from even-weight vectors $u$ -- the largest part of that subspace a single-error-correcting code can contain -- and extremal if its dimension is as large as possible. For $m\ge2$ and $r=\lceil\log_2(2m+1)\rceil$, we determine the number $N(m)$ of extremal diagonal-coherent codes with parameters $[\,2m,\ 2m-r,\ \ge3\,]$, show that diagonal coherence entails no loss of redundancy, and determine their minimum distances. We also put these codes in a normal form, determine their hulls, and show that each has covering radius $2$ with exactly $2^r-1-2m$ deep-hole cosets. Finally we propose three open problems.

comments
24 pages
fields
Combinatorics, Information Theory
pdf ↗ page arXiv:2610.33676 ↗

Let $G(n,m)$ be the Erdos-Renyi random graph with $n$ vertices and $m$ edges and let $δ>0$. Alon and Krivelevich [Combinatorica 1997] proved that for any sequence $m\leq n^{3/2-δ}$ there \emph{exists} an integer sequence $q=q(n)$ such that the chromatic number of $G(n,m)$ equals either $q$ or $q+1$ with probability tending to one as $n\to\infty$. In this paper, we give an explicit formula for this sequence $q(n)$ and confirm their result under a less restrictive assumption that $m=o(n^{3/2})$. Furthermore, we show that for all but a vanishing proportion of the admissible values of $m$, the chromatic number of $G(n,m)$ equals $q$ with high probability.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2610.33678 ↗

For Stirling expansions truncated after at least two Bernoulli terms, we disprove the three real-degree conjectures recorded by Mahmoud and Qi for the signed remainders of the logarithm of the gamma function and their derivatives. We give a unified proof of the corresponding integer-degree formula, recovering known cases and resolving Zhu's conjectures for higher derivatives in this range. Every real completely monotonic degree lies strictly between the predicted integer and the next integer. We obtain a universal fractional lower bound through an explicit inverse function and a simpler rational bound valid for every derivative order. A local estimate for the negative part of the Laplace kernel's derivative with respect to its logarithmic variable makes the lower improvement proportional to the reciprocal of the combined truncation and derivative order. Together with a uniform upper bound, this determines the exact order of decay of the fractional excess for each fixed derivative order and for its supremum over all derivative orders. Sharper kernel estimates give stronger bounds for the first two degrees. The proof combines fractional positivity criteria, the classical Laplace representation, a sign characterization of the associated densities, and a convexity obstruction at the upper integer endpoint. All estimates used in the proofs are analytic. The exact real degrees and the optimal asymptotic constants remain open.

fields
Combinatorics
pdf ↗ page arXiv:2610.33699 ↗

Quasicrystals were defined by Cain and Malheiro and Maas-Gariépy to model the decomposition of Schur polynomials into fundamental quasisymmetric functions. We define a new combinatorial model for crystal graphs of type $A_{n-1}$, called parsed content words, for which the decomposition into quasicrystals is particularly evident. We use the model to describe a combinatorial interpretation of Schur-Weyl duality and recover the classical combinatorial proof of the well-known expansion of homogeneous symmetric functions into Schur functions within our framework.

comments
45 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.33772 ↗

Motivated by recent studies of hook length biases in restricted partitions, we investigate the total number of hooks of fixed length in two partition functions introduced by MacMahon and Andrews. In $1916$, MacMahon proved that the number of partitions of $n$ in which no part appears with multiplicity one equals the number of partitions of $n$ into parts that are even or congruent to $3 \pmod{6}$. For a positive integer $r$, let $A_r(n)$ count the partitions of $n$ in which every part occurring an odd number of times occurs at least $2r+1$ times, and let $B_r(n)$ count the partitions into parts that are even or congruent to $2r+1 \pmod{4r+2}$. Andrews proved that $A_r(n)=B_r(n)$ for all positive integers $r$ and nonnegative integers $n$, thereby recovering MacMahon's identity as the special case $r=1$. We derive generating functions and asymptotic formulas for the total numbers of hooks of lengths $1$, $2$, and $3$ in both partition classes, employing Wright's circle method. These asymptotic formulas yield several hook length bias results. In particular, for sufficiently large $n$, the $B_r$-type partitions exhibit more $1$-hooks than the $A_r$-type partitions, whereas for hook lengths $2$ and $3$, the bias is reversed when $r=1$ and favors the $B_r$-type partitions when $r\geq 2$. We also establish asymptotic inequalities among hook numbers of different lengths within each partition class. Finally, for fixed hook lengths $\ell\in\{1,2,3\}$, we prove that the $B_r$-type partitions exhibit more $\ell$-hooks than the $B_{r+1}$-type partitions for sufficiently large $n$. These results reveal systematic asymptotic patterns in the distribution of small hook lengths across the two partition families.

comments
39 pages
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2610.33791 ↗

We prove that every claw-free subcubic graph admits a \packA-packing colouring, confirming a conjecture of Mortada, El Zein and Al Hajjar. The proof combines a reduction to line graphs of subdivided loopless cubic multigraphs with local colouring extensions. We also give a negative answer to their question on \packB-packing colourings by constructing an infinite family of connected bridgeless claw-free cubic counterexamples. The smallest graph in this family has 36 vertices. More generally, we characterise the simple cubic graphs whose triangle expansions admit a \packB-packing colouring in terms of gated independent odd-cycle transversals. This characterisation gives a classification for connected bridgeless claw-free cubic bases and shows that the double triangle expansion of a loopless cubic multigraph admits such a colouring if and only if the multigraph has a perfect matching.

comments
13 pages, 2 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.33803 ↗

The flag algebra method is a general tool in extremal combinatorics, which has been useful in tackling open problems concerning graphs, hypergraphs, permutations, point sets, and other structures. The method establishes combinatorial inequalities via sums of squares, which are usually obtained by a semidefinite relaxation of the original combinatorial problem. A typical application of the method in graph theory starts with fixing a parameter $n$ followed by constructing a semidefinite program based on the (subgraph) structure of all $n$-vertex graphs. In the standard formulation before symmetry reductions, there is a coefficient constraint for every admissible $n$-vertex graph up to isomorphism. For 3-uniform hypergraphs, there are 2,136 of them on 6 vertices and 7,013,320 on 7 vertices. While solving the resulting program for $n=6$ is an easy task on any modern computer, the programs for $n = 7$ seems out of reach, mainly because the SDP solvers need too much RAM. Yet solving such programs for as large $n$ as possible is desirable because they typically yield better bounds for the original combinatorial problems. We bypass the aforementioned memory requirements by linear programming with cutting planes. Although we do not guarantee that this cutting-plane procedure reaches an optimum in finitely many iterations, in many flag algebra instances it uses much less memory and yields improved bounds for well-known hypergraph Turán problems. We use this method to obtain numerical bounds for Turán densities and codegree squared densities of several 3-uniform hypergraphs including the tetrahedron, where we obtained the upper bound 0.55753 and tetrahedron without one edge with a new upper bound 0.2865. It also allows to tackle bounds on Turán densities of 7-vertex 3-graphs using flag algebras, which was not possible before.

comments
17 pages, 2 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.33850 ↗

We study a random graph process that connects the Erdős–Rényi random graph with the semi-random process. In each round, a uniformly random vertex is revealed together with a uniformly random candidate set of $s$ possible partners, and Builder chooses one of them. We study how this limited adaptivity $s$ changes the hitting times of monotone graph properties and how the familiar logarithmic ``coupon–collector'' delays in random graphs are reflected in this setting.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2610.33854 ↗

In 2000, Lewis introduced a nested sequence of normal subgroups of the fundamental group of a distance-regular graph $Γ$. While the full homotopy group itself is simply a free group, it is interesting to determine the smallest integer $k$ such that every closed walk in $Γ$ can be built, up to homotopy, from closed walks of "essential length" $k$ or less. Lewis proved that $k\le 6$ for any $Q$-polynomial distance-regular graph $Γ$ that is not a pseudoquotient. In this paper, we prove that $k=3$ for Johnson graphs and that $k=4$ in the case of Hamming graphs. We also compute the homotopy groups of natural cell complexes associated to the folded Johnson graphs and folded cubes. The paper finishes with some open questions and suggestions for further lines of investigation.

fields
Combinatorics
pdf ↗ page arXiv:2610.33869 ↗

Proportional choosability is a list analogue of equitable coloring introduced in 2019 that imposes both upper and lower bounds on color class sizes based on the availability of each color. The proportional choice number of a graph $G$, denoted by $χ_{pc}(G)$, is the smallest positive integer $k$ such that $G$ is proportionally $k$-choosable. We consider two previously posed questions regarding proportional choice numbers: (1) Is there a constant $C$ such that $χ_{pc}(P_n) \leq C$ for every $n \in \mathbb{N}$? and (2) Is it the case that for any graph $G$, $χ_{pc}(G) \leq Δ(G)+1$ where $Δ(G)$ is the maximum degree of $G$? In this paper we answer both questions: the first in the affirmative and the second in the negative. Specifically, we prove that $χ_{pc}(G) \leq 2^{χ'(G)}$ for every graph $G$ where $χ'(G)$ is the chromatic index of $G$. Consequently, $χ_{pc}(P_n) \leq 4$ for every $n \in \mathbb{N}$. We also prove that when $G$ is the disjoint union of $(a+b-1)$ copies of $K_{a,b}$, $χ_{pc}(G)=a+b$. In particular, for each $m \in \mathbb{N}$, there is a graph $G$ with $Δ(G)=m$ and $χ_{pc}(G)=2Δ(G)$.

comments
8 pages, 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2610.33914 ↗

In this work, we associate with each finite simple graph $G$ a nilpotent Lie algebra $\mathfrak{n}_G$ of class at most three, whose underlying vector space has a basis indexed by the vertices, edges, and paths of length two of $G$. Its nilpotency class is exactly three if and only if $G$ contains a path of length two. We compute the dimensions of its lower central series and describe its center. Over fields of characteristic different from two, we prove that two such Lie algebras are isomorphic if and only if their underlying graphs are isomorphic. We also give an algebraic description using quotients involving exterior and symmetric squares. Finally, we study balanced blow-ups and prove that $\mathfrak{n}_G$ is a retract of $\mathfrak{n}_{G^{(m)}}$.

comments
17 pages
fields
Combinatorics, Differential Geometry
pdf ↗ page arXiv:2610.33963 ↗

We present an explicit weighing matrix $W(n,k)$ for every order $n\equiv 0\pmod 4$ with $4\le n\le 108$ and every weight $1\le k\le n$: 1512 matrices in total, each checked in exact integer arithmetic. Of these, 961 come from classical constructions (identity, direct sums, Kronecker products, Paley matrices and skew-Hadamard doubling) and 551 are Goethals-Seidel matrices, found by exhaustive search (24 matrices, $n\le 24$) or by simulated annealing on the periodic autocorrelation cost (527 matrices, $n\ge 28$). The note is self-contained as far as the methods are concerned: it presents all the construction methods used and the algorithm that selects among them, explains the algorithm step by step, proves every identity on which the constructions rely, and illustrates each method with a matrix taken from the catalogue. It does not reproduce the 1512 matrices, which are available in the repository. It also gives a short parity obstruction to Goethals-Seidel matrices $W(4m,4m-1)$ with $m$ even, and lists the generating sequences of thirteen matrices whose parameters appear as unresolved in historical tables consulted by the author; their status in the current literature is still being checked, and no claim of priority is made.

fields
Combinatorics
pdf ↗ page arXiv:2610.33976 ↗

Let $f_r(n)$ be the maximum number of edges in an $n$-vertex $r$-uniform hypergraph in which all disjoint pairs of edges have distinct unions. In 1977, Erdős posed the problem of determining $f_r(n)$ and, in particular, asked whether $f_3(n)=O(n^2)$. Füredi later proved that $\binom{n-1}{r-1}+\left\lfloor (n-1)/r\right\rfloor \le f_r(n)<\frac72\binom{n}{r-1}$ for $r\ge3$ and $n\ge2r$. Motivated by his constructions, he further conjectured that $f_3(n)\le\binom{n}{2}$ for all sufficiently large $n$, and that, for each fixed $r\ge4$, the lower bound is exact for all sufficiently large $n$. This is known as the Erdős–Füredi conjecture. In a recent breakthrough, Huang, Ma and Yang proved the conjecture for every fixed $r\ge4$ and characterized all extremal hypergraphs. In this paper, we settle the remaining $3$-uniform case for every $n$. The bound is sharp whenever $n\ge5$ and $n\equiv1,5\pmod{20}$. Our proof uses a local weight inequality and a transfer argument.

comments
17 pages. Comments are welcome!
fields
Combinatorics
pdf ↗ page arXiv:2610.34038 ↗

An $r$-uniform hypergraph is linear if any two edges share at most one vertex. For a family $\mathcal F$ of $r$-graphs, let $\text{ex}^{\text{lin}}_r(n,\mathcal F)$ and $\text{spex}^{\text{lin}}_r(n,\mathcal F)$ denote, respectively, the maximum number of edges and the maximum spectral radius of an $n$-vertex $\mathcal F$-free linear $r$-graph. In this paper, we show that for $t\ge s\ge3$, $\text{spex}^{\text{lin}}_r(n,K_{s,t}^{+})\le \frac{(t-s+1)^{1/s}}{r-1}n^{1-1/s}+o(n^{1-1/s})$, where $K_{s,t}^{+}$ is the $r$-graph obtained from the complete bipartite graph $K_{s,t}$ by enlarging each edge with $r-2$ new vertices. This answers a problem of She, Fan and Kang in a stronger form. Moreover, our result implies that $\text{ex}^\text{lin}_r(n,K_{s,t}^{+}) \le \frac{(t-s+1)^{1/s}}{r(r-1)}n^{2-1/s}+o(n^{2-1/s})$, which improves the leading coefficient in the corresponding bound of Gao and Chang. We also give a construction which implies that $\text{spex}^{\text{lin}}_r(n,K_{s,t}^{+})=Θ(n^{1-1/s})$ and $\text{ex}^\text{lin}_r(n,K_{s,t}^{+})=Θ(n^{2-1/s})$ for $s\ge 4r-6$ and $t>(s-1)!$.

fields
Combinatorics
pdf ↗ page arXiv:2610.34065 ↗

In this article, the unique graph with minimum distance spectral radius among trees with given order $n$ and maximum degree $\varDelta$ is determined, where $2\varDelta+1 \leq n \leq \varDelta^{2} +1$ for $\varDelta \geq 3$. This article is a part proof of the conjecture proposed in $\cite{ref1}$.

fields
Combinatorics
pdf ↗ page arXiv:2610.34114 ↗

A circular $r$-coloring of a signed graph maps its vertices to a circle of circumference $r\ge2$, with the endpoints of negative edges at circular distance at least $1$ and those of positive edges at most $r/2-1$; the circular chromatic number is the infimum of such $r$. We construct a simple planar signed triangulation on $85$ vertices with circular chromatic number exactly $5$. This improves the lower bound on the supremum of the circular chromatic numbers of simple planar signed graphs from $14/3$ to $5$, giving a partial answer to a question posed by Naserasr, Wang, and Zhu.

fields
Combinatorics
pdf ↗ page arXiv:2610.34118 ↗

In this article, we introduce the concept of minimal excludants in colored partitions and extend it to the framework of least $r$-gaps. In particular, we focus on $k$-colored partitions and cubic partitions, deriving the generating functions for the sums of minimal excludants and least $r$-gaps, and analyzing their asymptotic behaviors. Notably, the presented theory is comprehensively extended by the systematic generalization of each result for minimal excludants in $k$-colored partitions to the case of least $r$-gaps. We introduce generalized cubic partitions and discover the minimal excludant, as well as several additional results.

comments
22 pages
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2610.34155 ↗

For fixed $r\geq3$ and $0<α<1$, we study the maximum $α$-$s$-clique spectral radius among $n$-vertex $K_{r+1}$-free graphs. Here $\mathcal A_{α,s}(G)=α\mathcal D_s(G)+(1-α)\mathcal A_s(G)$, where $\mathcal A_s(G)$ and $\mathcal D_s(G)$ are the adjacency and degree tensors of the $s$-clique hypergraph of $G$. For $s=r$, put $c_r=((r-1)/r)^{r-1}$. We prove that, for all sufficiently large $n$, the unique extremal graph is the Turán graph $T_r(n)$ if $α\leq c_r$, and $K_1\vee T_{r-1}(n-1)$ if $α>c_r$. For general $3\leq s\leq r$ and $n\geq r$, every extremal graph is complete $r$-partite. The asymptotic maximum $α$-$r$-clique spectral radius among $n$-vertex $K_{r+1}$-free graphs is $\max\{r^{1-r},α(r-1)^{1-r}\}n^{r-1}+o(n^{r-1})$. In every asymptotically extremal sequence of complete $r$-partite graphs, all parts have size $n/r+o(n)$ when $α<c_r$; when $α>c_r$, one part has size $o(n)$ and the remaining parts have size $n/(r-1)+o(n)$. At $α=c_r$, both part-size patterns are asymptotically extremal.

comments
17 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.34196 ↗

We prove that every linear hypergraph on $N$ vertices with edge sizes $O(\sqrt N)$ and $O(N^2\log N)$ triples contained in its edges has a subset of size $Ω(\sqrt N)$ meeting each edge in at most two vertices. As an application, every set of $N$ planar points with at most $\sqrt N$ collinear points contains $Ω(\sqrt N)$ points in general position. This proves a conjecture of Payne and Wood and gives the optimal quadratic bound for a geometric Ramsey problem posed by Gowers.

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

Graph tensors extend the matrix multiplication tensor by placing a two-party identity tensor on every edge of a graph and keeping one tensor leg at every vertex. We study the asymptotic rank of the tensor associated with the complete graph. For every integer $n\geq 2$, over the complex numbers, we prove \[ \left\lfloor\frac{n^2}{4}\right\rfloor \leq \log_2\widetilde R\bigl(\mathsf{GT}_2(K_n)\bigr) \leq \frac{n^2}{4}. \] The upper bound matches the maximum-cut lower bound for every even $n$ and differs from it by only $1/4$ for every odd $n$. In particular, the exponent per edge is below $2/3$ for every $n\geq5$, answering a question of Christandl, Vrana, and Zuiddam. Our proof extends the polynomial multiplication approach underlying OpenAI's bound $ω\leq9/4$. The main step separates any fixed number of shared tensor legs simultaneously, using only linearly many direct-sum copies in the number of blocks. This yields an entropy inequality for higher-order tensors. We apply it to the tensor for multiplying $n-1$ polynomials, whose rank is linear in the input length. Discrete concavity and a shifted tripling inequality then force a lower bound on a symmetrized spectral profile. Comparing this growth with polynomial interpolation gives the stated upper bound while preserving all $n$ tensor legs. We also prove an operational barrier for these higher-order polynomial constructions. For $n\geq3$, the specified formal reduction rules cannot certify an exponent below $n^2/4$ for $\mathsf{GT}_2(K_n)$, even after taking tensor powers and allowing subexponential overhead and common auxiliary factors. This extends the symmetric three-leg barrier of Amanov, van den Berg, and Zuiddam and explains the remaining gap for odd complete graphs within this method.

comments
55 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.34273 ↗

We prove that for all $n\ge3$ and $r\ge2$, the Lee ball $B_n(r)$ does not tile $\Z^n$ by translations, resolving the Golomb–Welch conjecture for arbitrary centre sets and completing the existence classification of perfect Lee codes in $\Z^n$. The proof combines translation-invariant averaging, boundary contact identities, and integer moment inequalities with coefficient comparisons in stable symmetric functions. Consequently, we obtain finite local obstructions, strict Banach density gaps for packings and coverings, and the nonexistence of exact measurable Lee-ball towers. In the lattice specialization, our result classifies the attainability of the Lee bound for even-degree abelian Cayley graphs, excludes normal topological coverings and Galois graph coverings for Lee-ball completions, and gives a strict node bound for lattice cubature as well as the nonexistence of subgroup-indexed orthogonal exponential bases on $B_n(r)$.

comments
58 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.34291 ↗

For $k\ge2$, a graph is $C_{2k}$-connected if every two distinct edges lie together on an even cycle of length at most $2k$ in that graph. Let $f_k(n,m)$ be the largest number of edges in a $C_{2k}$-connected subgraph that every $n$-vertex graph with $m$ edges must contain. In this paper, we study two cycle-connected problems raised by Duke, Erdős and Rödl. First, Duke, Erdős and Rödl showed that $f_3(n,\lfloor n^{2-β}\rfloor)=Θ(n^{2-3β})$ for every fixed $0< β<1/2$ and ask for the case of $β\ge 1/2$. We solve this problem in a stronger form by determining that the optimal range of $β$ is $(0,2/3]$. Second, we prove that $f_2(n,\binom n2-s)=(1/(2e)+o(1))n^3/s$ whenever $\frac{s}{n}\to\infty$ and $s=o(n^2)$, determining the leading constant in an estimate of Duke, Erdős, and Rödl. The first result uses a finite-field construction and a count of three-edge paths. The second uses the known structure of $C_4$-connected graphs and estimates for complete bipartite subgraphs in a random graph.

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

Given a small permutation class $\mathcal{P}$, we consider the set of possible limits of the probability $\mathbb{P}\big(\mathbfσ_n \models Ψ\big)$ that a uniformly chosen random permutation $\mathbfσ_n\in \mathcal{P}_n$ satisfies a fixed first-order sentence in Theory of Two Orders (TOTO). In the case of small permutation classes with polynomial growth, we show this limit set is finite, and characterize the set explicitly. In particular, we prove that many natural small permutation classes of polynomial growth arising from permutation matrices satisfy a $0$-$1$ convergence law, and have an infinite model. In the case of small permutation classes with exponential growth we show that the limit set is dense in $[0,1]$, thereby extending a result of Albert–Bouvel–Féray–Noy, using different methods, to this range.

fields
Combinatorics
pdf ↗ page arXiv:2610.34328 ↗

We present a general algebraic method for maximizing a vertex-degree-based (VDB) topological index $TI(G) = \sum_{uv \in E(G)} f(d(u),d(v))$ over the class of $n$-vertex trees with a prescribed maximum degree $Δ\ge 3$. By expressing the edge multiplicities of the basis $\mathcal{B} = \{(1,Δ), (Δ,Δ)\}$ via degree-sum identities, we reduce the maximization of $TI(T)$ to the minimization of an explicit discrete penalty function $G(x,y)$ over the non-basic edges. We formulate five analytical conditions on the weight function $f(x,y)$ that dictate the optimal edge distributions, yielding a complete characterization of the extremal trees across all congruence classes of $n \pmod{Δ- 1}$. Additionally, we provide their explicit construction by attaching leaves to a core of internal vertices. Applying this framework, we obtain the complete characterization of extremal $Δ$-trees for the Degree-Ratio Sombor ($DRSO$), Symmetric Division Deg ($SDD$), and Hyperbolic Sombor ($HSO$) indices for all $Δ\ge 3$. Furthermore, the analytical conditions identify the exact degree thresholds for the Arithmetic-Geometric ($AG$) and Diminished Sombor ($DSO$) indices, showing that the same extremal family maximizes $AG$ if and only if $3 \le Δ\le 8$, and $DSO$ if and only if $3 \le Δ\le 4$. Finally, since changing the edge count from $m = n - 1$ to $m = n - 1 + k$ affects only the constant term in the decomposition while leaving the penalty function $G(x,y)$ invariant, the method extends directly to connected $k$-cyclic graphs.

comments
16 pages, 1 figure
fields
Combinatorics
pdf ↗ page arXiv:2610.34361 ↗

A finite set of positive integers is admissible if any two of its subsets with the same sum have the same cardinality. In 1991, Erdős, Nicolas and Sárközy conjectured that $\log a(N)\asymp\sqrt N$, where $a(N)$ denotes the number of nonempty admissible subsets of $\{1,\ldots,N\}$. We prove this conjecture by showing that there are absolute constants $c,C>0$ such that $\exp(c\sqrt N)\le a(N)\le\exp(C\sqrt N)$ for every integer $N\ge4$. The same bounds hold for the number of admissible sets with maximum $N$. For the upper bound, we show that every sufficiently large admissible set $A\subseteq\{1,\ldots,N\}$ contains a subset of proportional size whose doubling constant is $O(N/|A|^2)$.

fields
Combinatorics
pdf ↗ page arXiv:2610.34372 ↗

For a planar graph \(G\), a plane subgraph \(H\) is plane-saturated with respect to \(G\) if adding any edge to the fixed drawing of \(H\), possibly together with new vertices, either creates a crossing or results in a graph that is not a subgraph of \(G\). The plane-saturation ratio \(\psr(G)\) is the minimum of \(e(H)/e(G)\) over all plane-saturated subgraphs \(H\) of \(G\). For nonnegative integers \(k_1\) and \(k_2\), let \(\cG_{k_1,k_2}\) denote the class of planar graphs in which, for each \(i\in\{1,2\}\), at most \(k_i\) vertices of degree \(i\) have any prescribed neighborhood, where \(k_i=0\) means that vertices of degree \(i\) are forbidden. We prove that every \(G\in\cG_{k_1,k_2}\) with at least one edge satisfies $\psr(G)>\frac{1}{9+k_1+6k_2}.$ This settles two conjectures of Clifton and Salia.

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

We study online vector balancing for independent sparse random vectors: each arrival is supported on a uniformly random set of $s$ of the $n$ coordinates, with nonzero entries equal to one (binary model) or independent random signs (signed model), and an online algorithm must sign each vector upon arrival. The prefix discrepancy is the largest $\ell_\infty$-norm of the signed sums up to the horizon $T$, the terminal discrepancy that of the sum at time $T$. For binary inputs with $2\le s\le n/2$ and $T=Θ(n)$, Altschuler and Tikhomirov showed that both are of order $\sqrt{s}+\log\log n$; they asked how the prefix discrepancy depends on the horizon and whether a matching terminal bound holds at every prescribed time. Over long horizons, the two differ. For every fixed $s\ge2$ and $c>0$, every online algorithm, even a randomized one that knows the horizon, incurs with high probability prefix discrepancy $Ω(\log\log n+(\log T/\log n)^{α_s})$ for $n\le T\le e^{cn}$, where $α_s=(2^{s-1}-1)/(2^s-1)$. For $s=2$, quadratic Greedy matches this bound; for fixed $s\ge3$, we give an online algorithm with prefix discrepancy $O(\log\log n+(\log T/\log n)^{1/2})$. In contrast, a deterministic algorithm that knows neither the horizon nor the failure probability keeps the terminal discrepancy $O_k(\sqrt{s}+\log\log n)$ at each prescribed time, with failure probability $n^{-k}$ for every fixed $k$, for $2\le s\le n/2$ (binary model) and $2\le s\le n$ (signed model); for $s=2$, quadratic Greedy itself does so. This answers their terminal question, and the same order is optimal for prefixes at all polynomial horizons $T\ge n$. The lower bound uses a finite safety game realized within the input law; the upper bounds use moments of elementary symmetric polynomials and, at terminal times, a $\cosh$ potential or a translated gauge with a Foster inequality at every state.

comments
83 pages
fields
Combinatorics, Probability
pdf ↗ page arXiv:2610.34410 ↗

Graham conjectured in 1971 that every subset of the nonzero elements of a prime cyclic group admits an ordering with pairwise distinct nonempty partial sums. Recently, the work of Pham and Sauermann, together with earlier results, settled this conjecture for all sufficiently large primes. In this paper, we prove that there is an absolute integer $n_0$ such that every subset $S\subseteq G\setminus\{0\}$ of a finite abelian group with $|S|\ge n_0$ admits such an ordering, which also solves a conjecture of Alspach and Liversidge for all sufficiently large sets. A key ingredient of our proof is a sufficient condition via additive dimension: If $|S|=n$ and $S$ contains a dissociated subset of size at least $Ω((\log n)^2/\log\log n)$, then $S$ has an ordering in which no proper nonempty interval of consecutive terms sums to zero. This bound is within a factor of $O(\log n/\log\log n)$ of the smallest possible additive dimension of an $n$-element set.

fields
Combinatorics
pdf ↗ page arXiv:2610.34424 ↗

Benade et al. (EC 2024) introduced a semi-random model for non-additive fair division in which each agent starts with an arbitrary base valuation over bundles of items and independently permutes the item names uniformly at random. While they proved that envy-free allocations exist with high probability as the number of items grows for $n = 2$ agents, they left open whether the same holds for $n > 2$ agents. We resolve this open question in the affirmative: for any fixed number of agents $n$ and any number of items $m$ divisible by $n$, an envy-free allocation exists with probability $1 - o(1)$ as $m \to \infty$. Our proof combines the second moment method with a connection to the (small-set) expansion of generalized Johnson graphs, which may be of independent interest.

fields
Combinatorics
pdf ↗ page arXiv:2610.34434 ↗

The Harary–Hill conjecture states that the crossing number of the complete graph $K_n$ is exactly $\frac{1}{4}\left\lfloor\frac{n}{2}\right\rfloor \left\lfloor\frac{n-1}{2}\right\rfloor \left\lfloor\frac{n-2}{2}\right\rfloor \left\lfloor\frac{n-3}{2}\right\rfloor$. We present a streamlined variant of the proof of this conjecture recently announced by OpenAI (2026). Although the original proof is relatively short, it is quite difficult to follow. We simplify several steps and provide a concise and accessible exposition of the proof. We also combine this new result with known reductions to determine the crossing numbers of several other graph families.

comments
16 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.34444 ↗

We prove that every planar graph on $n$ vertices has a vertex ordering $v_1,v_2,\ldots,v_n$ in which each prefix $\{v_1,\ldots,v_i\}$ is joined to at most $C\sqrt{i}$ elements of $\{v_{i+1},\ldots,v_n\}$, where $C$ is an absolute constant. Consequently, every prefix can be separated from its complement by deleting $O\left(\sqrt{i}\right)$ vertices lying entirely in its complement.

comments
8 pages, no figures
fields
Combinatorics
pdf ↗ page arXiv:2610.34512 ↗

Let $G$ and $H$ be Gram matrices of spherical $2$-designs on the same number of indices. We study when their Schur product is again the Gram matrix of a spherical design. We give a criterion in terms of orthogonal projections with constant diagonal, and an explicit $15$-point spherical $3$-design whose Gram matrix belongs to no symmetric Bose-Mesner algebra. For a symmetric association scheme, the factorization problem takes the form $v(E_S\circ E_T)=μE_U$. This is a counterpart of ordinary matrix product factorizations in the adjacency basis. The case $E_U=I-E_0$ gives a dual near-factorization and has a regular simplex as its normalized output. We characterize complementary input supports by a strongly regular fusion, give a reciprocal criterion, and classify the case in which one factor is the last Hamming idempotent.

fields
Combinatorics
pdf ↗ page arXiv:2610.34598 ↗

We prove the (signed) Grothendieck join–meet positivity $$ G_{λ\veeμ}G_{λ\wedgeμ} -G_λG_μ\in \sum_ν \mathbb{N}\cdot (-1)^{|ν|-|λ|-|μ|}G_ν$$ for stable Grothendieck polynomials using geometric Satake equivalence, thereby resolving a conjecture posed by Thomas and Yong.

comments
20 pages. Comments welcome!
fields
Combinatorics
pdf ↗ page arXiv:2610.34607 ↗

In this paper, we investigate the expansion of the integral form Macdonald polynomials $J_μ(x;q,t)$ in the elementary symmetric function basis. Motivated by the connection between chromatic symmetric functions and LLT polynomials, we conjecture the $e$-positivity of a normalization of $J_μ(x;q,t)$. We verify the conjecture when $μ$ is either a hook or a two-column partition. In the hook case, we express the $e$-coefficients as weighted sums over compositions. In the two-column case, we derive explicit formulas for the $e$-coefficients.

comments
19 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.34772 ↗

A strong odd coloring of a graph is a proper vertex coloring such that for every vertex $v$, each color appearing on the neighborhood of $v$ appears an odd number of times. We investigate strong odd colorings of sparse graphs, where sparsity of a graph $G$ is measured in terms of maximum average degree, denoted $\operatorname{mad}(G)$. We prove that the optimal threshold on the maximum average degree guaranteeing a strong odd $c$-coloring is $4-Θ(\frac{1}{c})$ as $c\to\infty$. Moreover, for every $c\geq 5$, this threshold is strictly smaller than the threshold for odd $c$-coloring. We also determine the sharp threshold on the maximum average degree guaranteeing a strong odd $5$-coloring: every graph $G$ with $\operatorname{mad}(G)<\frac{7}{3}$ has a strong odd $5$-coloring, and this bound is sharp. In addition, we show that every graph $G$ with $\operatorname{mad}(G)<\frac{11}{5}$ and no induced $5$-cycle has a strong odd $4$-coloring. Note that the $5$-cycle has maximum average degree 2 and no strong odd $4$-coloring.

fields
Combinatorics
pdf ↗ page arXiv:2610.34874 ↗

Let $τ(N)$ be the number of graceful labelings of trees with $N$ edges, that is, the number of spanning trees of the complete graph on $\{0,1,\dots,N\}$ whose edges have distinct lengths. The answer to exercise 7.2.2.3-106 of The Art of Computer Programming states that, if an empirical observation of Anick is true, then $τ(n)=\exp(n\ln n-n\ln(e/b)+O(\log n))$ with $b\approx0.636$, and that rigorous proofs are unknown. We prove that $|\logτ(N)-(N\log N-N\log(e/b))|\le152(1+\log(N+1))^4$ for every $N\ge3$, with $b=2/π$. A rainbow map of order $N$ sends each vertex $k\in\{1,\dots,N-1\}$ to a vertex $f(k)\in\{0,\dots,N\}$ so that the lengths $|f(k)-k|$ are $1,\dots,N-1$ in some order. Acyclic rainbow maps are exactly the graceful labelings, and all rainbow maps are counted by the Whitty numbers $W(N)$ (OEIS A134983). We show that $τ(N)\le W(N)\leτ(N)e^{151(1+\log(N+1))^4}$ by a combinatorial argument: for fixed directions, rainbow maps are rook placements on a Ferrers board; a swap injection shows that a uniformly random rainbow map has $O(\log^2N)$ cycles on average; and an inequality on the periods of a word shows that the $c$ cycles of a rainbow map can be removed by changing $O(c\log N)$ edges. We also show that $W(N)$ is the total weight of a family of weighted Motzkin paths. This yields exact enumerations, an alternating sum for $W(N)$, and a representation of $W(N)$ as a moment of a continuous dual Hahn weight, from which $|\log W(N)-(N\log(2N/π)-N)|\le5(1+\log(N+1))$. The main theorem has been formalized in Lean 4; its combinatorial half uses no axioms beyond those of Lean.

comments
27 pages, 2 figures. A Lean 4 formalization of the main theorem is included in the ancillary files (directory anc/lean)
fields
Combinatorics
pdf ↗ page arXiv:2610.34877 ↗

We introduce a new permutation statistic, called the \emph{cross work}, on four important subsemigroups of the partial transformation semigroup $\mathcal{PT}_n$: the symmetric group $\mathcal{S}_n$, the semigroup of singular transformations $\mathrm{Sing}_n$, the symmetric inverse semigroup $\mathcal{I}_n$, and the semigroup $\mathcal{POI}_n$ of partial order-preserving injective transformations. The cross work is defined via local distance interactions between adjacent positions and their images. Fundamental invariance properties are established, including inversion invariance under a natural symmetry condition and a characterization of conjugations preserving the statistic. Using elementary combinatorial methods, we derive closed formulas for the total and average cross work on $\mathcal{S}_n$. We also determine the exact minimum and maximum values of the cross work, showing that the maximal value grows quadratically with $n$.

comments
20 pages. An article by Nsibiet E. Udo, Victor A. Owai and Moses O. Francis
fields
Combinatorics, Group Theory, Rings and Algebras
pdf ↗ page arXiv:2610.34902 ↗

In 1986, Brualdi and Solheid asked which connected graph of prescribed order and size has maximum adjacency spectral radius. We complete the classification for every feasible pair of parameters. We prove that no graph outside the dense and star threshold families is extremal, including at ties, and settle the range $n\le e+1$, where the star candidate is not defined. The final comparison \emph{between} the dense and star candidates is supplied by Damnjanović's Propositions~4.1–4.2, not reproved here. We combine an exact Bellman recursion with dense-core domination, fractional complete-split bounds, and a virtual-star inequality. Three remaining comparison families (J), (K1), and (K2) are established analytically and by exact polynomial and Sturm certificates. The exact certificates are implemented in Python/SymPy and SageMath.

comments
45 pages, includes computer-assisted proofs and supplementary Python/SageMath verification programs
fields
Combinatorics
pdf ↗ page arXiv:2610.34905 ↗

Let $n\geq2\ell\geq2k\geq6$ and $n>k+\ell$. We determine the maximum of $|\mathcal A||\mathcal B|$ over all nonempty, nontrivial cross-intersecting families $\mathcal A\subseteq\binom{[n]}k$ and $\mathcal B\subseteq\binom{[n]}\ell$. The exact bound is $|\mathcal A||\mathcal B|\leq\max\{M_1,M_2\}$, where \[ \begin{aligned} M_1 &=\left(\binom{n-1}{k-1}-\binom{n-\ell-1}{k-1}+1\right) \left(\binom{n-1}{\ell-1}-\binom{n-k-1}{\ell-1}+1\right),\\ M_2 &=\left(\binom{n-2}{\ell-2}+1\right) \sum_{i=1}^{2} \left(\binom{n-i}{k-1}-\binom{n-\ell-i}{k-1}\right). \end{aligned} \] Both terms are attained by explicit constructions: a Hilton–Milner-type pair and a two-point construction, respectively. We classify all equality cases, including the additional cross-triangle pairs when $k=\ell=3$. Two structural results underlie the proof. First, we establish a restricted-lex comparison theorem showing that restricted lexicographic initial segments minimize disjointness neighborhoods, and characterize equality at the first nontrivial threshold. Second, a decomposition of critically shifted families into two parts with disjoint cores leads to a sharp product theorem, with equality characterized, for all cross-intersecting pairs admitting this decomposition, without additional nontriviality assumptions. Endpoint comparisons and reverse shifting complete the proof for unequal as well as equal uniformities.

comments
29 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.34944 ↗

A classical result, independently proved by Garsia and by Wachs, gives a simple and elegant closed expression for the evaluation, at a primitive root of unity, of the major index generating function over a conjugacy class in the symmetric group. In this paper, we generalize this result to the flag major index generating function over conjugacy classes in any wreath product $\mathbb{Z}_{r}\wr S_{n}$. Our approach is new, and applies conjugation by a Coxeter element as a cyclic group action on the conjugacy class. This leads to a simple formula in the general case.

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

The Tutte polynomial is a fundamental invariant of graphs and matroids. For a matroid M of rank r, the Tutte polynomial T_M(x,y) of M serves as a generalization of the characteristic polynomial chi_M(x), with the relationship given by chi_M(x) = (-1)^r T_M(1-x,0). For any real number t satisfying 0 <= t <= 1, under suitable exclusion hypotheses on M, we establish an upper bound on the coefficients of the polynomial T_M(x,t) (resp., T_M(t,y)) in terms of girth g and the number of circuits of size g (resp., maximum cardinality h of hyperplanes and the number of hyperplanes of size h). The resulting characteristic polynomial bound extends the bound of Delaplane and Wu [Discrete Math. 312(12-13) (2012) 2062-2068] to simple U_{g-1,g+1}-free matroids satisfying n >= r + c_g, thereby giving a partial affirmative answer to the question of extending their upper bound beyond binary matroids.

fields
Combinatorics
pdf ↗ page arXiv:2610.34985 ↗

A graph $G$ is said to be $H$-saturated if $G$ contains no copy of $H$, but $G+e$ contains a copy of $H$ for any edge $e$ of $\overline{G}$. The saturation number of $H$, denoted by $\mathrm{sat}(n, H)$, is the minimum number of edges among all $H$-saturated graphs of order $n$. In this paper, we investigate the saturation number of $K_3 \vee P_k$ for $k \ge 3$ and show that $\mathrm{sat}(n, K_3 \vee P_k) = 3n - 6 + \mathrm{sat}(n-3, P_k)$ holds for all $n \ge a_k + 3$ and $k \ge 3$, which verifies the conjecture [Discrete Appl. Math, 394(2026) 62-80] on $\mathrm{sat}(n, K_s \vee P_k)$ is true for the case $s=3$, where $a_k = k$ for $3 \le k \le 5$, $a_k = 3 \cdot 2^{t-1} - 2$ for $k = 2t \ge 6$, and $a_k = 2^{t+1} - 2$ for $k = 2t + 1 \ge 7$.

fields
Combinatorics
pdf ↗ page arXiv:2610.34990 ↗

In 1999, Alon, Krivelevich and Sudakov conjectured that the choice number and chromatic number of the random graph $G(n,p)$ are asymptotically equal whenever $np\to\infty$. We prove their conjecture, showing that, with high probability, $$ \operatorname{ch}(G(n,p))=(1+o(1))χ(G(n,p)) $$ whenever $np\to\infty$. This improves the bound $\operatorname{ch}(G(n,p))\le(2+o(1))χ(G(n,p))$ for $np\to\infty$ and $p\le0.9$ obtained by Krivelevich and Vu in 2001. Our proof distinguishes two cases according to the size of independent sets. When independent sets of growing size are available, we establish a sharper uniform independent-set estimate that eliminates the factor-two loss in the bound of Krivelevich and Vu. When independent sets have bounded size, we establish a deterministic result showing that, under a suitable uniform independent-set condition, a proper colouring with bounded colour-class sizes yields an asymptotically matching upper bound on the choice number.

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

We consider weighted analogues of multiple harmonic and multiple $t$-harmonic star sums, where the "star" indicates non-strict inequalities between the summation indices. In the special case where all exponents are 2, which is of particular interest also for ordinary multiple ($t$-)harmonic star sums, we obtain evaluations in terms of simple finite sums. The proofs are based on several combinatorial identities which are of interest in their own right.

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

A set $S \subseteq V(G)$ is a solid-resolving set of an undirected graph $G$ if each vertex can be distinguished from any vertex subset by their distances from the set $S$. Solid-resolving sets are a generalization of resolving sets, which have been studied extensively in the literature. We extend this concept to oriented graphs and directed graphs. In this setting, we first define solid-resolving sets for digraphs and then consider vertices that must be included in any solid-resolving set. We also study the solid-metric dimension, which is the minimum cardinality of a solid-resolving set of a given digraph. We determine the possible values of the solid-metric dimension for several common graph classes, including tournaments, directed trees, oriented cycles, complete bipartite graphs, as well as for Cartesian products of oriented paths and cycles. We also show via some examples that there is no trivial relation between the solid-metric dimension of a digraph and the solid-metric dimension of its underlying undirected graph. Furthermore, we show that the solid-metric dimension can increase or decrease by an arbitrary $k$ when one vertex is removed. Similarly, removing a single arc can decrease the solid-metric dimension by an arbitrary $k$; however, it can increase by at most 1. The arbitrary changes in solid-metric dimension indicate that the solid-metric dimension is a global, rather than a local, property.

comments
24 pages, 5 figures. This paper has been presented in part in IWOCA 2026
fields
Combinatorics
pdf ↗ page arXiv:2610.35041 ↗

Bang-Jensen-Gutin-Li type conditions are degree conditions for the existence of hamiltonian cycles in digraphs, which impose degree restrictions on nonadjacent vertices which have a common in-neighbor or a common out-neighbor. They can be viewed as directed analogues of both Fan-type conditions and heavy subgraph conditions in undirected graphs, and they also generalized the classes of locally semicomplete digrahs, loclaly in-semicomplete digraphs, and locally out-semicomplete digraphs. In this paper, we prove what is, to our knowledge, the first Bang-Jensen-Gutin-Li type condition for pancyclicity in digraphs. More precisely, let $D$ be a strong digraph with order $n\ge 3$. We show that, if for every $u\in V(D)$ belonging to a dominated nonadjacent pair or a dominating nonadjacent pair, we have $d(u)\ge n$, then $D$ is pancyclic, unless $D$ belongs to one of two well-characterized classes of exceptional digraphs.

comments
15 pages, under review
fields
Combinatorics
pdf ↗ page arXiv:2610.35063 ↗

Banderier, Marchal, and Wallner studied the enumeration problem for Young tableaux with walls. These are similar to standard Young tableaux, except that local decreases are allowed at some walls. In 2021, Banderier and Wallner counted Young tableaux with periodic walls, in which the elementary blocks are Young diagrams of shape $(2,2)$. They obtained exact counting formulas for $30$ of the $32$ classes up to symmetry. In this paper, we first derive recurrences for counting the remaining two classes of Young tableaux with periodic walls. We then prove that their counting exponential generating functions are differentially transcendental. Consequently, they are neither D-algebraic nor D-finite. This disproves a conjecture of Banderier and Wallner.

fields
Combinatorics
pdf ↗ page arXiv:2610.35067 ↗

Let $d_{K_{s,t}}(n)$ be the largest fraction of all graphs on $[n]$ in a family containing no two distinct members whose symmetric difference is a copy of $K_{s,t}$. We determine this maximum density for every fixed pair of positive integers $s,t$. If both part sizes are odd, it is known that the density is exactly $1/2$. Otherwise, let $2h$ be the largest even part size. We prove $$ d_{K_{s,t}}(n)=Θ_{s,t}(n^{-h}). $$ For $h>1$, this improves the general $O_{s,t}(1/n)$ upper bound obtained from Alon's two-copy gluing theorem~\cite{Alon2024}. The sharp bounds for even stars were already proved by Alon and are recovered as special cases. The upper bound uses the Frankl–Füredi forbidden-intersection theorem. For the lower bound, we construct binary linear codes using BCH codes. When exactly one part size is even, we assign to each edge the sum of the binary vectors assigned to its endpoints. When both part sizes are even, we identify these vectors with elements of a finite field and assign to each edge the product of its endpoint elements. In both cases, every copy of $K_{s,t}$ has a nonzero syndrome.

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

A wheel consists of an induced cycle of length at least four and a vertex with at least three neighbors on the cycle. Let $\cal T$ be the class of graphs with no wheel containing a triangle. We prove that, for every $G\in\cal T$ and every integer $t\ge3$, the $K_t$-free chromatic and choice numbers both equal $\lceil{ω(G)/(t-1)}\rceil$. We further prove that $\cal T$ is $k$-strongly linear-Pollyanna for every integer $k\ge2$, and hence is linear-Pollyanna. In particular, the class of wheel-free graphs is Pollyanna, answering Problem 10.2 of Chudnovsky, Cook, Davies and Oum.

fields
Combinatorics
pdf ↗ page arXiv:2610.35225 ↗

While multi-sum Rogers-Ramanujan type identities have been extensively investigated through Bailey pairs, the constant term method, complex contour integration, and related techniques, many still lack an intrinsic combinatorial understanding. In this paper, we establish combinatorial interpretations for several families of triple-sum identities via structural decompositions of strict partitions. For one of these families, we extend the underlying combinatorial framework to obtain a general $(m+1)$-fold multi-sum identity. Leveraging these partition-theoretic interpretations, we construct explicit bijective proofs for all the corresponding identities. As an application, this constructive approach naturally yields some parameterized generalizations.

comments
41 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.35234 ↗

A graph is bisectable if its vertex set can be split into two sets inducing isomorphic subgraphs. Ando conjectured that every cubic graph is bisectable, and Das, Pokrovskiy, and Sudakov proved it for large enough connected cubic graphs. We give a constructive proof that, for every $d\geq5$, there exists a non-bisectable $d$-regular graph of even order.

fields
Combinatorics
pdf ↗ page arXiv:2610.35274 ↗

Motivated by Scott's inequality for lattice polygons, we study normalized volume bounds for lattice polytopes $\mathcal{P}$ with $h^*$-polynomials $1+at^k+bt^\ell$, where $a,b\ge1$ and $1\le k<\ell$. For $\ell>2k$, the coefficients satisfy $a+1\le b$, and consequently ${\rm vol}(\mathcal{P})\le2b$. In the complementary range $k<\ell\le2k$, we establish the dimension-independent bound \[ {\rm vol}(\mathcal{P})\le(2b+1)(k+\ell). \] On the boundary $\ell=2k$ with $b\ge2$, the sharper Scott-type inequality ${\rm vol}(\mathcal{P})\le4k(b+1)$ holds, confirming a conjecture of Higashitani, Nill, and the author. Equality holds if and only if $k=1$ and $a=3b+3$. Moreover, when $\ell=2k$ and $k,b\ge2$, we obtain an upper bound depending only on $b$.

comments
16 pages
fields
Combinatorics
pdf ↗ page arXiv:2610.35287 ↗

We give, for the first time, a formula for the largest size of an $(s,t)$-core partition with distinct parts valid for every coprime pair. We also determine the greatest number of parts of an $(s,t)$-core partition whose successive parts differ by at least $D$, whenever $\gcd(s,t)\le D$, removing the restrictions on the core parameters in the formula of Burson, Sisneros-Thiry, and Straub. The size formula uses a column description and a single Dedekind sum. The length formula uses coefficients from the Euclidean algorithm and satisfies a recurrence in smaller core parameters. We construct partitions attaining each maximum.

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

We introduce the left and right Cayley graphs of a finite skew brace $(A,\cdot, \circ)$ with a connection set $T\subset A$, as a directed multigraph with additive and multiplicative edges, depicting the operations $\cdot$ and $\circ$ respectively. We compute the distance from $a$ to $a\circ b$ in these Cayley graphs in terms of factorization lengths over $T$. As an application, we provide a characterization of the ideals of a skew brace in terms of their corresponding Cayley graphs.

comments
13 pages, 3 figures
fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2610.35388 ↗

The dissociation number ${\rm diss}(G)$ of a graph $G$ is defined as the maximum cardinality of a vertex subset $D\subseteq V(G)$ such that the induced subgraph $G[D]$ has maximum degree at most $1$. In 2023, Bock, Pardey, Penso and Rautenbach [J. Graph Theory 103 (2023), 661–673] showed that ${\rm diss}(G)\ge n-\frac{1}{3}(m+k+c_1)$ where $n, m, k, c_1$ denote the numbers of vertices, edges, components and induced cycles of length $1$ modulo $3$ in $G$ and they also established a complete characterization of extremal graphs under the vertex-disjoint cycle constraint. Although this partial characterization offers very valuable structural insights, it excludes many simple extremal graphs. So they posed a natural question: How can all extremal graphs be comprehensively characterized without restrictions? In this paper, we give a recursive characterization of all graphs attaining equality in this bound.

comments
Dissociation sets; dissociation number; maximum; extremal graphs
fields
Combinatorics
pdf ↗ page arXiv:2610.35408 ↗

Let $(T, \circ)$ be a loop of order $k \geq 3$ and $D_S^*$ the loopless central digraph obtained from the associated central digraph $D_S$ by removing the $k$ self-loops at the diagonal vertices. We construct an explicit arc-labeling $f$ of $D_S^*$ ordering all arcs lexicographically by $(\text{tail}, \text{head})$ and assigning labels $1, \ldots, m$ in that order and prove that $f$ is an antimagic labeling. Consequently, $D_S$ is antimagic for every loop of order $k \geq 3$, a property that depends only on $k$ and is invariant across all non-isomorphic loops of the same order.

comments
15 page article
fields
Combinatorics
pdf ↗ page arXiv:2610.35419 ↗

Let $C_k$ denote a cycle on $k$ vertices. Pascadi (2026) established a removal lemma for $C_{2k+1}$ in graphs with few $C_{2k}$-homomorphisms under a dense-pairs condition, using Schatten–von Neumann norms and entropy methods. We give a short proof of a version with more restrictive partition and diagonal requirements, extending the combinatorial approach of Conlon, Fox, Sudakov and Zhao (2021) without using Pascadi's Schatten-norm regularity framework. We illustrate the method with a known sparse removal statement for odd product equations in finite groups.

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

For positive integers $a\le b\le c\le d$ with $ad=bc$, we prove that the Lucas binomial coefficients satisfy $(-1)^{a+1}(L_{b,c}[X]-L_{a,d}[X])\in\mathbb{N}[e_1[X],e_2[X],h_2[X]]$, resolving Bergeron's conjecture on Schur positivity in two variables. We also prove the same positivity for $L_{u,v}[X]-e_1[X]^{uv-rs}L_{r,s}[X]$ when $rs<uv$. Using Lucas atoms, we establish $e$-positivity for degree-adjusted Lucas multinomial differences under dominance order.

fields
Combinatorics
pdf ↗ page arXiv:2610.35465 ↗

The number of transversals in a Latin square $L(G)$ whose rows and columns are indexed by a finite group $G$ has been determined computationally for all $G$ of order at most $23$ and for $C_{25}$. However, computation of the number of transversals of $L(G)$ has until now been considered intractable for all non-cyclic groups $G$ of order $32$. We show, for a group $G$ containing an order $2$ normal subgroup $N$, that the image of a transversal in $L(G)$ under the quotient mapping from $G$ to $G/N$ is a $2$-plex in $L(G/N)$. We then derive linear algebraic conditions that determine the number of transversals in $L(G)$ whose image under the quotient mapping is a given $2$-plex in $L(G/N)$. This allows us to count transversals in $L(G)$ by examining all $2$-plexes in $L(G/N)$. Although we can simplify the counting of $2$-plexes in $L(G/N)$ by taking advantage of their symmetry group, the linear algebraic conditions can vary over a symmetry class of $2$-plexes. However, in the case that $G$ takes the splitting form $C_2 \times H$, the linear algebraic conditions become invariant over each symmetry class and so the counting of transversals in $L(C_2 \times H)$ reduces to counting the $2$-plexes in $L(H)$ under the action of their symmetry group. We illustrate the power of these techniques by computing the exact number of transversals in $L(C_2^5)$.

comments
18 pages, 4 figures, 3 tables
fields
Combinatorics
pdf ↗ page arXiv:2610.35611 ↗

We uniformly study directed Praeger–Xu graphs and Praeger's generalized family $\overrightarrow{\operatorname{PX}}(Γ,r,s)$, without requiring that $s\mid r$ and $Γ$ is an undirected graph. Assuming that $Γ\times\overrightarrow{K}_2$ is connected, we determine the full automorphism group of $\overrightarrow{\operatorname{PX}}(Γ,r,s)$ for every $r$ and $s$, prove connectivity, characterize vertex-transitivity, and give an equivalent criterion for $t$-arc-transitivity. We also study when $\overrightarrow{\operatorname{PX}}(Γ,r,s)$ is a Cayley graph. We also give two applications. First, we give a new family of twin-free connected arc-transitive digraphs of valency $4$ whose vertex stabilizers have exponential growth. We also give a connected regular digraph that is not vertex-transitive but whose direct product with a directed cycle is Cayley.

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

Disjunctions over the cells of a triangulation arise in formulations of piecewise-linear functions. For a poset $P$ on $[d]$, we study the convex hull $D$ of the simplices of Stanley's triangulation of the order polytope of $P$, each lifted by its own indicator vector. Via the Cayley trick, for any disjunction of full-dimensional polytopes, the facets of the convex hull other than those described by the bounds on the indicator variables correspond to the facet normals of the Minkowski sum of the polytopes, and each is described by the full optimal big-M lifting of the supporting inequality with that normal of any one polytope. For Stanley's triangulation, with $M(P)$ the Minkowski sum of its simplices, lifting only the facet-describing inequalities of the simplices need not suffice, unlike some other cases; we show that it suffices if and only if $M(P)$ is alcoved, if and only if deleting one element of $P$ leaves a chain. Otherwise, the coefficients of the additional facet-describing inequalities are governed by the least number $\ell(P)$ of elements whose deletion leaves a chain: for fixed $\ell(P)$, the largest entry of a primitive facet normal grows like $d^{\ell(P)-1}$, and it can be exponential in $d$ if $\ell(P)$ grows with $d$. For $d \geq 3$ and $\ell(P)\leq2$ the sharp bound is $d-2$.

fields
Combinatorics
pdf ↗ page arXiv:2610.35668 ↗

Staircase simplices are the simplices of the standard (Freudenthal–Kuhn) triangulation of $[0,1]^d$ and of Stanley's triangulations of order polytopes. We study the facet normals of their Minkowski sums and how the number of summands constrains the size of primitive integer normals. We characterize the normals attainable with a prescribed number of summands in terms of $d-1$ linearly independent zero-one vectors orthogonal to the normal, whose supports have an intersection graph that can be colored with one color per summand. This gives a combinatorial characterization of the least number of summands needed to realize a normal. For two summands, all primitive normals have entries in $\{-1,0,1\}$, and we determine which of them occur. For three summands we bound every entry in absolute value by $3^{(d-2)/3}$ and construct normals with entries of order $θ^d$, $θ$ the plastic number; for four summands a second construction gives entries of order $ψ^d$, $ψ$ the supergolden ratio. Since $ψ>3^{1/3}$, the largest coefficients for three and four summands are exponentially separated. For vectors with at most two distinct nonzero entry values, we determine the least number of summands exactly, using a matching-rank formula proved by exterior algebra and representations of symmetric groups. With no restriction on the number of summands, the maximum coefficient equals the classical maximum for facets of $0/1$-polytopes in the same dimension.

fields
Combinatorics
pdf ↗ page arXiv:2610.35689 ↗

In a proper coloring, a Kempe change interchanges two colors on a connected component of the subgraph they induce. For a fixed list assignment $L$, a Kempe change is $L$-valid if it transforms an $L$-coloring into another $L$-coloring. We prove that if $G$ is a $3$-connected graph other than a complete graph or the triangular prism, and $L$ is a list assignment with $|L(v)|\ge d_G(v)$ for every vertex $v$, then $G$ has a proper $L$-coloring and any two such colorings can be transformed into one another by a finite sequence of $L$-valid Kempe changes. This proves a conjecture of Chakraborty, Feghali and Mahmoud.

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

In 2010, Haglund, Luoto, Mason and van Willigenburg proved that the product of a Schur function $s_λ$ and a Demazure atom $A_γ$ expands positively in terms of Demazure atoms, and interpreted the coefficients as the number of Littlewood-Richardson skew skyline tableaux of a given shape and a filling type. Extending this approach, they further established the positive expansion for the product of a Schur function $s_λ$ and a quasisymmetric Schur function $S_α$, or of a Schur function $s_λ$ and a Demazure character $κ_γ$. In particular, the latter provides a refinement of the classical Littlewood-Richardson rule. We present a natural $t$-analogue of these positive expansions by deriving the expansion for a product of a Hall-Littlewood polynomial $P_λ(t)$ and a $t$-Demazure atom $E_γ(t)$ in terms of $t$-Demazure atoms. The corresponding coefficients are $\mathbb{N}\,[t,1-t]$-positive; that is, they are polynomials with nonnegative integer coefficients in $t$ and $1-t$, and they are interpreted in terms of standard Young tableaux. We take the approach of connecting the multiplication coefficients with the LLT polynomials, which differs from the combinatorial insertion arguments of Haglund, Luoto, Mason and van Willigenburg.

comments
28 pages, 7 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.35708 ↗

We give a unified account of zero counting in finite-field polynomial rings with commuting variables twisted by a common automorphism. A decomposition into fixed-field slices connects skew evaluation with ordinary polynomial evaluation. First, we derive a slice coefficient formula from the skew Combinatorial Nullstellensatz and use it to deduce skew Chevalley-Warning, including the sufficient condition $n>h\sum_i d_i$. Next, classical Ax-Katz gives the corrected integer congruence $Q^{\max\{0,\lceil(n-h\sum_i d_i)/D\rceil\}}\mid N+(M-1)δ$. We construct homogeneous examples proving optimality for every positive degree table and every number of variables. We also establish a sharp lower bound with a prescribed zero, an input-sensitive coefficient-filtration refinement, and transfers of known bounds for nonlinear zero sets. Detailed calculations explain the origin correction, incomplete norm blocks, and the distinction between characteristic-$p$ summation and higher integer divisibility. Existing geometric, interpolation, and counting theorems are explicitly attributed.

fields
Combinatorics
pdf ↗ page arXiv:2610.35739 ↗

We investigate how large the minimum size of a contagious set can be among trees of a fixed order. Given a graph $G$ and $ρ\in[0,1]$, an inactive vertex $u$ becomes active when at least $\lceil{ρd_G(u)\rceil}$ of its neighbors are active. An initial set of active vertices is contagious if the process eventually activates every vertex. We obtain exact values for the minimum size of a contagious set in perfect $d$-ary trees. We then determine the exact maximum of this minimum size over all trees of order $n$. We establish this result by bounding the number of pairwise disjoint resistant sets, each of which must intersect every contagious set, and constructing trees that attain the resulting bounds. Finally, by bounding the change in the minimum size of a contagious set under a leaf exchange, we show that, for $0<ρ\leq1$ and $n\geq2$, every integer between $1$ and this maximum occurs as the minimum size of a contagious set in a tree of order $n$.

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

The switch Markov chain is a natural method for sampling graph realizations with a prescribed degree sequence, and $P$-stability is a general sufficient condition for its rapid mixing. Since $P$-stability is often difficult to verify directly, we develop an approach based on the simpler and more readily verifiable property of \emph{full graphicality}. We consider bidegree sequence regions obtained by fixing the two class sizes, the common degree sum, and lower and upper bounds for the degrees in each class. Such a region is fully graphic if every bidegree sequence satisfying these constraints has a bipartite realization. Our main result shows that every fully graphic region of this form is $P$-stable. More precisely, for class sizes $n$ and $m$, the perturbation ratio is at most $(nm)^5$. It follows from a known theory that the switch Markov chain is rapidly mixing on every such region. We also show that full graphicality can be tested on a canonical extremal bidegree sequence and use this characterization to derive several new explicit sufficient conditions. By encoding loopless directed graphs as bipartite graphs, we develop a parallel theory for directed degree sequences. This gives analogous extremal characterizations, sufficient conditions for full graphicality, and $P$-stability and rapid-mixing results for directed degree-sequence regions. The encoding process allows most corresponding statements for the two cases to be formulated and proved in one run.

comments
29 pages, 6 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.35777 ↗

A permutation $σ\in\mathbb{S}_n$ of objects $\{1,\ldots,n\}$ is called \emph{late-growing} if its partial sums never exceed the respective partial sums of the `average' permutation (with the arithmetic mean $n^{-1}\cdot\sum_{i=1}^n i = (n+1)/2$ of $1,\ldots,n$ on average at each entry $σ(i)$): $\sum_{i=1}^k σ(i) \leqslant k\cdot (n+1)/2$ for all positive $k\leqslant n$. We prove that for $n=2p-1$ odd, the set $Φ_p\subseteq \mathbb{S}_{2p-1}$ of late-growing permutations is partitioned into parity-even vs odd elements, $Φ_p = Φ_p^{+} \sqcup Φ_p^{-}$, in an almost symmetric way: $| Φ_p^{+} | - | Φ_p^{-} | = (-1)^{p+1}$. The proof is constructive: by viewing the permutations $σ\inΦ_p$ as constrained walks on the integral lattice $\mathbb{Z}$, we describe two filters that pair all but one element in $Φ_p^{+}$ versus $Φ_p^{-}$; the remaining walk $σ^*$ with monotonically growing step amplitudes determines the dominant parity subset.

comments
Proof of the claim from arXiv:2605.11137 [math.CO]; sequel to arXiv:2610.08636 [math.NT]; 21 pages, 4 appendices, 6 tables, 6 figures
fields
Combinatorics, Mathematical Physics, Quantum Algebra, Rings and Algebras
pdf ↗ page arXiv:2610.35779 ↗

If $G$ and $H$ are two cubic graphs, then an $H$-coloring of $G$ is a mapping $f: E(G)\rightarrow E(H)$, such that for every $v\in V(G)$ there is a vertex $x\in V(H)$, such that $f(\partial_G(v))=\partial_H(x)$. If $G$ admits an $H$-coloring then it is common to write $H\prec G$. In this paper, for a fixed connected cubic graph $H$, we consider a decision problem, which we call $H$-coloring. In this problem, on the input one is given a connected cubic graph $G$. The goal is to decide whether $H\prec G$. A conjecture by Hakobyan and the author states that $H$-coloring is polynomial time solvable, if $H$ does not admit a $P_{12}$-coloring. Here $P_{12}$ is the unique cubic graph obtained from the Petersen graph by expanding one of its vertices into a triangle. In this paper, we disprove this conjecture under $P\neq NP$, by showing that $S_6$-coloring is NP-complete. Here $S_6$ is the unique cubic graph on six vertices having exactly one bridge. Our second result is an algorithm that solves $H$-coloring problem in time $O^*(c^n)$, where $H$ is a simple connected cubic graph, $n$ is the number of vertices of the input cubic graph $G$ and $c=\sqrt{8}\approx 2.8284$.

comments
13 pages, 9 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.35794 ↗

Let $s(C_n^r)$ be the Erdős–Ginzburg–Ziv constant (zero-sums of length exactly $n$) and $η(C_n^r)$ the short zero-sum constant. Properties C and D of Gao et al.\ assert that every sequence of the extremal length without the relevant zero-sums has the form $T^{n-1}$. For even $n$ they imply $s(C_n^r)=2^r(n-1)+1$ and $η(C_n^r)=(2^r-1)(n-1)+1$. G.~Wang recently disproved both for $C_6^r$, $r\ge4$. We prove that both fail for $C_n^r$ for every $n\equiv2\pmod4$ with $n\ge6$ and every $r\ge4$. More precisely, for these $n$ we have: $s(C_n^r)\ge2^r(n-1)+2^{r-2}+1$.

comments
Comments welcome
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2610.35819 ↗

Mathematical Physics59

We prove that the second-moment Hamiltonian of the open qubit eSWAP chain has a diffusive spectral gap, resolving a conjecture of Li, Zheng, Liu, Jiang, and Liu. We also characterise the ground space on every connected interaction graph with at least five vertices and prove a uniform lower bound for the unnormalised complete-graph gap. We apply these results to sequential and brickwork circuits and prove that the periodic chain also has a diffusive spectral gap.

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

We deduce the rational analogue of the elliptic Rains identity of type $A_n$ arXiv:0309252. We also derive reductions of the rational analogue and present the connection of them with well-known integrals in literature.

fields
Mathematical Physics, Classical Analysis and ODEs, Representation Theory
pdf ↗ page arXiv:2610.30317 ↗

A fundamental question in plasma physics and its applications to fusion theory is to find minimum energy stares of plasma.. Hong Qin has suggested the use of what he calls "Gromov ground states" which take into account the phenomenon of symplectic rigidity, as opposed to Gardner's classical approach which only use volume-preserving diffeomorphisms. Howev4er Qin's approach leads to topological difficulties because his constructions remain in the classical (Hamiltonian) domain. We circumvent these difficulties by introducing a quantum-mechanical formulation of the problem, based on the Wigner transform and the symplectic geometry of Gaussian state

fields
Mathematical Physics
pdf ↗ page arXiv:2610.33040 ↗

Direct Numerical Simulation (DNS) of the deterministic Navier-Stokes (NS) equations is widely used to provide benchmark solutions of turbulent flow, but its accuracy and reliability have not been rigorously inspected from a mathematical viewpoint. Here we prove a spatial symmetry invariance theorem (SSIT) of three-dimensional NS equations whereby an exact solution of deterministic NS equations under periodic boundary conditions maintains the same spatial symmetry as its symmetric initial flow, forever. SSIT provides an absolute benchmark test for computational fluid dynamics (CFD). It is shown herein that traditional DNS of NS turbulence quickly violates SSIT, revealing that the spatiotemporal trajectory of NS turbulence predicted by DNS soon becomes badly polluted by numerical noise. Importantly, it is found that even the statistical results of DNS might be unstable, i.e., exhibit sensitivity dependence on the initial flow conditions. In other words, the loss of spatial symmetry in traditional DNS of NS turbulence is not a physical instability but instead a numerical artifact caused by the chaotic nature of the flow. Using the SSIT, it is straightforward to deduce several key properties of NS turbulence, including `ultra-chaos', the so-called `noise-expansion cascade', `permanent memory of symmetric initial flow conditions', and so on. Note that permanent memory of symmetric initial flow conditions suggests that NS turbulence governed by deterministic NS equations subject to symmetric initial flow should have no `mixing', corresponding to non-ergodicity, although ergodicity is one of the most fundamental assumptions of turbulence theory.

comments
26 pages, 5 figures
journal
J. Fluid Mech. (2026), vol. 1045, A32
fields
Mathematical Physics
pdf ↗ page arXiv:2610.33115 ↗

We propose a uniform construction of affine schemes encoding the Higgs branches and Macdonald indices of the Argyres–Douglas theories $\mathcal{D}_p(ADE)$, with $\gcd(p,h^\vee)=1$. The construction captures conjectural OPE decoupling relations via the Jacobian ring of a single invariant polynomial potential, obtained from a polynomial twisted period of the corresponding Coxeter orbit space. We show that these potentials are ``syzygy-maximizing'' in the first jet schemes and recover the Higgs branches as their reduced critical loci. We obtain closed determinant expressions for the classical types and explicit potentials for $E_6$, $E_7$, and $E_8$. Powers of the nilradical define an intrinsic filtration on the resulting Jacobian rings, from which we compute candidate Macdonald indices with the correct Schur and Hall–Littlewood limits, in the examples studied. Restricting the potentials to Slodowy slices extends the prescription to nilpotently Higgsed theories. We further conjecture that these Jacobian rings are isomorphic to Zhu's $C_2$-algebras of simple affine VOAs at boundary admissible levels and their quantum Drinfeld–Sokolov reductions.

comments
44 pages + references, 1 table
fields
Mathematical Physics, Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2610.33151 ↗

It has been an open question whether there exist holomorphic VOAs with N=1 supersymmetry and Witten index 1 for any positive central charge c. The existence of such a theory with c=288 is closely related to the 576-periodicity of the TMF spectrum via the Segal-Stolz-Teichner conjecture. Here we report the construction of thousands of such theories by extending the approach initiated by Gaiotto and Johnson-Freyd via ternary codes. In addition, for every positive integer k, we also construct holomorphic N=1 VOAs of central charge c=12k with index 24/gcd(24,k) -- conjectured to be the minimum -- in a computer-aided search carried out by AI coding agents. We overcome the exponential-time barrier by using chains of smaller cells to build ternary codes, whose indices can then be evaluated via a transfer-matrix technique, and we use a symmetric orbifold construction to reduce the problem of k=12 and 24 to that of k=6. Along the way, we also establish several results on ternary codes and their indices. Using an observation relating codes and Landau-Ginzburg orbifold models, we argue that the non-chiral doubles of the ternary code VOAs can always be gapped supersymmetrically.

comments
24 pages, 2 figures, 2 tables
fields
Mathematical Physics, Algebraic Topology, Quantum Algebra
pdf ↗ page arXiv:2610.33165 ↗

We show that $K_6^{(2)} \cap X_6^{(2)} = D_6^{(1)} \cup C_6^{(1)}$ up to standard Hadamard equivalence, where $C_6^{(1)}$ is a new non-affine one-parameter family of complex Hadamard matrices. This demonstrates that the intersection of the two-parameter Hadamard families of Karlsson and Szöllősi is strictly larger than the known affine Diţă curve $D_6^{(1)}$. Our new parametrisation of the Szöllősi family $X_6^{(2)}$ in Karlsson coordinates and our constructive classification of the Karlsson-Szöllősi intersection shed light on the intersection of block-reducible forms and hypocycloid constraints. This may support the search for mutually unbiased bases in six dimensions.

comments
27 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.33207 ↗

We prove the propagation of Bose–Einstein condensation and a norm approximation for the dynamics of a Bose gas with localized initial data in two dimensions with singular interactions that may have a small attractive part. We allow the scaling of the interaction to be any polynomial scaling $N^β$ for $0<β<\infty$ and even exponential scaling $e^{N^κ}$ for $0<κ<1/4$. Our approach covers external potentials that are time-dependent, at most quadratic, and bounded below, including the situation without an external potential.

comments
45 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2610.33212 ↗

In this paper, we determine the complete ground-state spaces for a broad class of generalized stabilizer quantum models defined over CW-decompositions of non-compact manifolds of arbitrary dimensions and topological type. We introduce a $C^*$-algebraic framework in which the quantum spin algebra $\A$ is realized as the twisted group $C^*$-algebra of an infinite discrete Pauli module $P$ endowed with a symplectic structure. We establish a correspondence between stabilizer models and isotropic subgroups of $P$: Every Lagrangian extension of such a subgroup determines a $C^*$-diagonal of $\A$, whose Weyl groupoid encodes the dynamics through a continuous 1-cocycle. This realization yields an explicit family of extremal ground-states for every admissible Lagrangian model, together with their decomposition into sectors. When the sector space is $T_0$, this gives a complete characterization of the ground-state spaces. We also prove that every Lagrangian stabilizer model admits a unique frustration-free ground state with a spectral gap. Our framework applies in arbitrary dimension, including higher abelian quantum doubles, homological codes, and a broad class of stabilizer models.

comments
51 pages, 4 figures
fields
Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2610.33221 ↗

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

comments
62 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2610.33232 ↗

Blood vessels remodel in response to wall shear stress while the network operates under a metabolic maintenance budget. For a power-law maintenance cost, minimizing dissipation at fixed budget yields a local shear set-point, and a purely local adaptation rule drives the network towards this optimum. Here we give this result a non-equilibrium thermodynamic formulation. Blood flow is an exactly linear Onsager system, and the slow remodeling of vessel radii is a gradient flow generated by a Rayleigh dissipation functional. This identifies the structural mobility, which scales inversely with the maintenance cost of each vessel and can be measured from radius fluctuations. Enforcing the budget exactly requires a time-dependent metabolic multiplier, which we obtain in closed form; with a fixed multiplier the budget is violated by up to one third during transients. The fluid displaced by remodeling vessels couples flow and structure through a symmetric, non-diagonal mobility, so that Onsager reciprocity becomes a testable statement: neighbouring vessels should show anticorrelated radius fluctuations. With noise, the structural sector obeys a second law and an integral fluctuation theorem. Non-reciprocal signaling between vessels, such as upstream conducted responses, then breaks the time-reversal symmetry of radius fluctuations and produces housekeeping entropy, detectable from time series of realistic length. Finally, we construct a partition function over network topologies with the number of loops as order parameter. Numerical tests show that loop counts do not collapse onto a single curve against an effective temperature, and that they depend strongly on the detection threshold.

comments
21 pages, 3 figures, 2 tables
fields
Mathematical Physics
pdf ↗ page arXiv:2610.33250 ↗

A novel method is introduced for constructing hyperboloidal initial data with direct analytic control over asymptotic charges prior to solving the Einstein constraint equations. Using the parabolic-hyperbolic formulation of the constraints together with a Fuchsian-analysis-inspired spectral solver, the asymptotic degrees of freedom, which determine infinite towers of asymptotic charges, including the Bondi energy and angular momentum, are used to prescribe the asymptotic behavior of solutions. As a proof of concept, we explicitly construct hyperboloidal initial data for a spinning black hole with Bondi energy $E_B = 2$ and angular momentum $J_B = 1/2$, starting from seed data induced on a hyperboloidal slice of the non-rotating Schwarzschild spacetime with mass $M=1$.

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

Higher-order squeezing Hamiltonians have several self-adjoint realizations, while their classical trajectories reach infinity in finite time. We relate these extension problems through boundary amplitudes and the semiclassical propagation of coherent states. A discrete Fourier transformation gives the sink-to-source ray matrix of each quantum realization. After the first passage through infinity, the full Husimi probability measure converges to point masses on outgoing classical branches, with weights equal to the squared moduli of the matrix entries. The proof combines finite-order approximate tail solutions satisfying the exact extension boundary condition with full-norm Gaussian matching and a square-summable residual estimate. For positive energy, we determine the limit after any fixed number of passages: amplitudes evolve by powers of the unitary ray matrix, not by iterations of its squared-modulus matrix. We also realize these limits by concentrated complex amplitudes for an energy-preserving Liouville extension, distinguishing deterministic classical gluings from coherent boundary mixing.

comments
16 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.33378 ↗

This paper is a third one in a series devoted to the construction of $2D$, $\mathbb{Z}_2^2$-graded, integrable Toda field theories. The first paper introduced parabosonic models obtained from Rittenberg-Wyler color Lie algebras; the second paper explained how to deal with parafermions (the $\mathbb{Z}_2^2$-graded super-Liouville theory) from finite Rittenberg-Wyler color Lie superalgebras. This new paper extends the construction to the infinite case of (twisted) affine color Lie superalgebras. A $\mathbb{Z}_2^2$-graded extension of ${\widehat{\mathfrak{osp}(2|2)^{(2)}}}$ allows to interpolate the super-Liouville and the super-Sinh-Gordon models, recovered as special limits. The $\mathbb{Z}_2^2$-graded extensions of three frameworks are here discussed: the Polyakov's soldering, the Leznov-Savel'ev Lax pair (zero-curvature) formulation and the Bäcklund transformations. As a byproduct of the construction, the Hamiltonian reduction from the $\mathbb{Z}_2^2$-graded ${\widehat{\mathfrak{osp(2|2)}^{(2)}}}$ WZNW models induces a $\mathbb{Z}_2^2$-graded color Lie superalgebra which admits three inequivalent superVirasoro subalgebras; they are the ${\cal N}=2$ superVirasoro, the $(1,\frac{3}{2},\frac{3}{2},2)$ $\mathbb{Z}_2^2$-graded superVirasoro and the $(\frac{3}{2},\frac{3}{2},2,2)$ $\mathbb{Z}_2^2$-graded superVirasoro.

comments
26 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2610.33485 ↗

A frequency-domain response analysis of a wind turbine rotor requires the complete hub-load spectrum, but the customary scalar thrust and torque spectra retain neither the four in-plane components nor the coupling between them. This paper derives the full six-degree-of-freedom (6-DOF) rotor-load cross-spectral-density (CSD) matrix from the IEC Kaimal turbulence model. By decoupling the spatial order of inflow coherence from the temporal Doppler shift, the formulation introduces a two-index rotational-sampling kernel. Rotor symmetry and azimuthal averaging constrain the observed Doppler carrier strictly to blade-passing harmonics $pBf_{\mathrm{rot}}$, while the azimuthal aerodynamic transfer shifts the spatial coherence order to $pB+s$. A convergence study of the retained azimuthal order $s$ shows that $\lvert s\rvert\le4$ suffices, the assembled CSD then deviating from the full-band result by less than $10^{-5}$ in relative norm. The formulation is compared with OpenFAST simulations of a rigid floating wind turbine over nine wind speeds: the six auto-spectral densities agree closely below 1~Hz, and the present theory over-predicts the spectra near the 6P and 9P rotational harmonics.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.33513 ↗

We propose a novel framework for analyzing the sample-path large deviations of interacting particle systems directly on a lattice by considering a large-spin limit ($s \to \infty$). Through an appropriate scaling of variables, the process concentrates around its deterministic trajectory, governed by the lattice diffusion equation. We quantify the exponential cost of observing atypical trajectories by explicitly computing the path-space large deviation rate function from the scaled microscopic generator, based on a theory due to Feng and Kurtz. The rate function is described in terms of a Hamiltonian on a lattice in terms of classical spin variables. Notably, for our main model, the symmetric harmonic process, the corresponding Hamiltonian is identified with the classical integrable non-compact Ishimori spin chain. Furthermore, we show that our large spin large deviation theory is fully consistent with traditional Macroscopic Fluctuation Theory (MFT), smoothly recovering the standard MFT Hamiltonian in the spatial continuous limit. We also perform a Poisson-noise Martin–Siggia–Rose (MSR) computation to derive the non-linear lattice Hamiltonian directly from microscopic dynamics, use a relative entropy argument to obtain the density-current action, and establish the lattice fluctuation theorem alongside its symmetry origin. Overall, our framework provides a naturally regularized, lattice analogue of MFT that circumvents spatial ultraviolet singularities and possible continuous density blow-ups. We also apply our new scheme to partial symmetric exclusion process, symmetric inclusion processes, Brownian energy process and integrable heat conduction model, showing how their large-deviation Hamiltonians relate to classical compact and non-compact spin chains.

comments
27 pages, no fiugre
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2610.33523 ↗

Quantum private broadcasting (\textsf{QPB}) asks whether a quantum message can be encrypted once, broadcast to several recipients, and decrypted locally while the joint ciphertext reveals no plaintext information. Broadbent, González-Guillén, and Schuknecht showed that the full tensor-power space \(\mathcal H_d^{\otimes t}\) is generally unsuitable for \textsf{QPB}, identified \(\mathrm{Sym}^t(\mathcal H_d)\) as a natural plaintext space, introduced symmetric unitary \(t\)-designs, and asked which other subspaces support private broadcast. Using Schur-Weyl duality, we classify all subspaces \(\mathcal S\subseteq\mathcal H_d^{\otimes t}\) on which the collective Haar twirl \(\mathcal T^{(t)}\) is a replacement channel. Precisely, every Schur-Weyl block weight must be independent of the encoded state, and in each active block \(V_λ\otimes W_λ\), the reduced state on the multiplicity space \(W_λ\) must be fixed. This yields explicit two-block and general multiblock constructions and realizes the classification as the Schur-Weyl form of the Knill-Laflamme conditions for a complementary channel of \(\mathcal T^{(t)}\). We also introduce a canonical reduction under deletion of a recipient and characterize privacy heredity, design heredity, and \textsf{QPB}-heredity for exact restricted designs. The symmetric tower is fully \textsf{QPB}-hereditary, whereas the antisymmetric tower is fully privacy-hereditary and is design-hereditary from level \(s\) to \(s-1\) exactly when \(s\leq(d+1)/2\). For canonical carriers in arbitrary Schur-Weyl blocks, hereditary reduction is governed by multiplicity-free branching along the Young graph and inclusion of the associated Peter-Weyl coefficient spaces.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.33553 ↗

Previous studies have indicated that the local defocusing nonlinear Schrödinger equation (NLSE) is modulationally stable. Therefore, superregular solitonic solutions characterizing the nonlinear evolution of modulational instability under weak localized perturbations do not exist. In this work, we study the nonlinear stage of the modulation instability of a condensate in the framework of the defocusing nonlocal NLSE. By using the dressing method and Joukowski transformation, we systematically derive the general $N$-solitonic solution of the defocusing nonlocal NLSE, and the explicit expressions for one-solitonic, two-solitonic and superregular two-solitonic solutions are provided. Then dynamics of these solutions is also examined. We find that these solutions show a much wider variety than those in the local NLSE, such as the one solitonic solution composed of two interacting wave components and the two-solitonic solution containing four wave components. Finally, the accuracy and noise robustness of the analytical solutions are confirmed by numerical simulations. Such results advance the theory of superregular solitonic solutions in nonlocal systems and offer new physical understanding of wave propagation in nonlocal nonlinear media.

comments
24 pages, 7 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.33560 ↗

Recovery from a coherent rotation with an unobserved angle depends on both the encoding and what calibration reveals about the noise. We determine their combined limit for a known finite-dimensional generator and one final recovery. Two polynomial projections organize the answer. A physical Krylov chain separates correctable error amplitudes from their first state-dependent distortion; projection onto lower-angle powers identifies the part that a coherent decoder can cancel. Under explicit rank and moment conditions, their combination gives the exact leading optimal entanglement infidelity at weak noise and a recovery attaining it for any finite logical dimension. The optimal worst-input error lies between one and $d$ times that infidelity at leading order, for logical dimension $d$. When the angle distribution is unknown, we optimize one decoder for every distribution compatible with the calibration. When spectral and calibration frequencies are integer multiples of a common frequency, moment positivity turns this into an exact finite optimization. Small measured means can still allow rare finite rotations. If the sole calibration datum is $β_r=\mathbb E[\sin^{2r}(θ/2)]$, with $θ$ the wrapped rotation phase at that common frequency, the optimal worst-prior infidelity is $O(β_r)$ exactly when generator powers through degree $r-1$ are correctable. When the first uncorrectable power has degree $m<r$, the optimal loss scales as $β_r^{m/r}$, with a sharp coefficient fixed by a universal moment problem. In a loss-free four-photon memory, population measurements at two calibration durations retain the fully informed quartic error coefficient for a fixed symmetric narrow-noise family with positive variance and finite fourth moment; a single duration permits loss quadratic in the noise width.

comments
72 pages including appendices, 5 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.33607 ↗

In this work, we present a fractional framework for reversible two-state chemical kinetics derived from the Continuous-Time Random Walk (CTRW) formalism with Mittag-Leffler waiting-time distributions. This derivation provides a microscopic basis for the fractional kinetic equations governed by the Caputo derivative. An exact analytical solution is obtained, yielding closed-form expressions for the time evolution of the state populations. To the best of our knowledge, a time-driven Monte Carlo algorithm is developed for the first time to simulate the irreversible underlying non-Markovian stochastic dynamics governed by a system of Caputo fractional differential equations. The proposed framework is applied to the conformational dynamics of the TbQSOX enzyme, whose relaxation exhibits power-law behavior. The fractional model accurately reproduces the experimental kinetics, providing an estimate of the fractional order $α= 0.22$, which is consistent with the observed anomalous dynamics.

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

We consider a classical Coulomb gas of $N$ particles in dimension $d\geq2$, confined by a general external potential $U$ in the large-$N$ limit. In that limit the density of particles has a compact support called the droplet. We study smooth linear statistics ${\mathcal L}_N=\sum_{i=1}^N f({\bf x}_i)$ at large $N$. While the leading variance of ${\mathcal L}_N$ is by now well understood in many settings, much less is known about higher cumulants. When $f({\bf x})=f(|{\bf x}|)$ and the potential is rotationally invariant, these cumulants were computed recently at leading order. We derive explicit formulas for the leading third and fourth cumulants for general smooth droplets, without assuming that either the potential or the test function is radial. The answers are expressed as intrinsic boundary integrals over the equilibrium droplet. The third cumulant depends on the cube of the jump of the normal derivative of the harmonic extension of $f$, while the fourth cumulant also involves the exterior Dirichlet-to-Neumann operator, the mean curvature of the boundary, and normal derivatives of the background density. Our derivation uses the tilted potential $U_s=U+s f/β$, the associated deformation of the droplet, and shape derivatives of the Dirichlet energy. This deformation has a natural interpretation as the infinitesimal motion of the free boundary in the obstacle-problem formulation of the equilibrium measure. Our formulas extend previous studies by Wiegmann and Zabrodin in two dimensions for $β=2$. In their setting, we provide a rigorous proof of the limiting third and fourth cumulants, supporting the proposed formulas for general Coulomb gases. We specialize the general formulas to the disk, the half-plane and the sphere, and check them against exactly solvable non-radial deformations, including translated elliptic droplets in $d=2$ and spheroidal deformations in $d=3$.

comments
59 pages
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2610.33659 ↗

The study of closed timelike curves has proceeded one spacetime at a time, and the criteria available form three families, the time function criteria, the energy condition criteria, and the topological criteria. We initiate a fourth family of criteria, elementary in form and resting on a single scalar equation rather than any energy condition. We prove that a spacetime admitting a globally defined function whose gradient is everywhere null cannot contain a closed timelike curve, and that the hypothesis is logically independent of stable causality rather than weaker than it. The proof turns on one algebraic fact, that a null covector is never orthogonal to a timelike vector, so the function grows strictly along every timelike curve and cannot close. Because the null eikonal equation alone decides the criterion, we can use it where the classical time function theorem is silent. We establish for the first time that no Kundt spacetime and no Robinson–Trautman spacetime can contain a closed timelike curve on any region where the null coordinate is globally single valued, whatever the cosmological constant and the rotation one form, which settles a question left open for gyratonic waves. We further show that the Misner, Ori and Ahmed constructions reduce to the statement that a compact null direction has turned timelike, and that the cosmological constant, the expansion and the shear are spectators in all of them.

comments
39 pages, 2 figs
fields
Mathematical Physics
pdf ↗ page arXiv:2610.33706 ↗

The Summers-Werner theorem shows that the vacuum of a relativistic quantum field theory violates the Bell-CHSH inequality maximally on complementary wedges, but it is an existence statement: it exhibits neither the observables nor an apparatus that measures them. We give an explicit operator-level realization within the Fewster-Verch measurement framework, obtaining dichotomic Bell observables of a free Majorana field in $1+1$ dimensions as observables induced by local couplings to Majorana probes. The induced system smearing factorizes exactly as $f_h=k\,b_{λ,h}$, so its support is controlled by the compactly supported coupling profile $k$; dichotomy is imposed by calibrating and normalizing the induced smearings rather than required of the probe observable; and a probe-only normal ordering yields the product of Alice's and Bob's induced bilinears, which the non-multiplicative induced map alone does not provide. Under explicit attainability hypotheses the induced observables saturate the Tsirelson bound in a state prepared from the vacuum. The construction extends to coupled scalar fields.

comments
15 pages, 1 figure
fields
Mathematical Physics
pdf ↗ page arXiv:2610.33773 ↗

We study the global $V$-representability problem in time-dependent density functional theory (TDDFT) for the two-particle Hubbard dimer model in the spin-singlet sector. In particular, we investigate whether the time-dependent density of the interacting system obtained for a given one-body external potential $u$ (the tunable control variable) can be reproduced by a non-interacting Kohn–Sham system beyond the singular times at which the usual inversion formulas break down. We deal with both the conventional formulation of TDDFT based on some time-dependent variational principle and the recently introduced geometric formulation of TDDFT (Phys. Rev. Lett. 136 (2026) 256401, Phys. Rev. A 113 (2026) 062222). For both principles, we prove global-in-time $V$-representability, show that singular times induce non-uniqueness of the time-dependent effective potential, and classify the set of solutions.

comments
49 pages, 10 figures
fields
Mathematical Physics, Optimization and Control
pdf ↗ page arXiv:2610.33837 ↗

In a recent work we introduced a finite scalar-qubit-scalar spectral triple whose Connes distance reproduces the Bloch-ball trace metric up to a factor $2/Λ$, where $Λ^2=μ_L^2+μ_R^2$ for isotropic link strengths $μ_L,μ_R$ appearing in the proposed Dirac operator. Here we analyse time-dependent variation of these links, independent of the qubit dynamics. In doing so, we separate the distinguishability and calibration contributions to the spectral rate. A depolarizing example demonstrates spectral growth despite a monotonic contraction of the trace-distance. More generally, we characterize the admissible trace-distance histories compatible with a given positive spectral record and exhibit contracting and reviving realizations. At fixed $Λ$, we also study a sinusoidal link imbalance that preserves the Dirac spectrum and qubit metric, while the scalar-scalar distance oscillates with half the period of the imbalance.

comments
12 pages, 2 figures. Prepared for the proceedings of the XLIII Workshop on Geometric Methods in Physics (Białystok, Poland, 2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2610.33848 ↗

We study the Yang-Mills gradient flow of center vortices in SU(2) gauge theory. For axially symmetric vortices the flow reduces exactly to a linear diffusion equation for the radial profile: a Gaussian core keeps its shape while its width grows as $\sqrt{R^2+4t}$, the flux is exactly conserved, and the thin vortex is the unique bounded fixed point, though not an attractor. Off-diagonal perturbations are governed by a pair of radial Schrödinger operators, and a variational computation shows that, frozen at any instant, the Abelian core has a tachyonic mode for every winding $n\geq 1$. Since the core spreads while the mode grows, we pass to self-similar variables, where the unstable modes are known in closed form, with growth exponents $μ_{n,m}=n-1+m$. Multiply wound vortices are therefore unstable, while the fundamental vortex is exactly marginal and stays Abelian. A scaling argument rules out any static vortex in the transverse plane, and the instability acquires a simple geometric meaning that shortens the path traced in SU(2) by the holonomy of a growing loop, lowering the winding by two. The flow thus drives every vortex toward the Abelian core of winding $n \bmod 2$, with non-Abelian structure appearing only as the transient through which multiply wound cores unwind.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.33874 ↗

We construct a matrix representation of the algebra defined by the associative Yang–Baxter equations of ${\rm BC}_n$ type. In the elliptic case, two sets of generators are represented in terms of the Baxter–Belavin quantum $R$-matrix in the fundamental representation of ${\rm GL}_N$, while the remaining generators are represented by the elliptic $K$-matrix found by Komori and Hikami. We revisit its derivation using the Felder–Pasquier procedure and correct the unitarity relation for odd $N$. We then use these matrix representations to construct examples of long-range quantum spin chains from $R$-matrix-valued Lax pairs for the classical Calogero–Inozemtsev system associated with the ${\rm BC}_n$ root system. We also construct $R$-matrix-valued Lax pairs for Calogero–Moser models in an external field, leading to Haldane–Shastry and Polychronakos–Frahm chains with modified spin positions.

comments
48 pages
fields
Mathematical Physics, Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2610.33913 ↗

Let $f:\mathbb C^n\to\mathbb C$ be a homogeneous polynomial of degree $n$ with an isolated critical point at the origin. The Calabi–Yau/Landau–Ginzburg correspondence predicts a close relation between invariants of the Landau–Ginzburg orbifold $(\mathbb C^n/\mathbb Z_n,f)$ and those of the associated Calabi–Yau hypersurface $ X_f=\{[z_1:\cdots:z_n]\in\mathbb P^{n-1}:f(z_1,\ldots,z_n)=0\}. $ In this paper, we establish this correspondence for the genus-one B-model by constructing the Landau–Ginzburg genus-one B-model invariant intrinsically from the $f$-twisted Laplacian on $\mathbb{C}^n/\mathbb{Z}_n$ and proving that it agrees with the corresponding BCOV invariant of $X_f$ up to an additive constant depending only on the dimension.

comments
45 pages, comments welcome!
fields
Mathematical Physics, Differential Geometry, Spectral Theory
pdf ↗ page arXiv:2610.33984 ↗

Reproducibility, replicability, robustness, and generalizability are essential but distinct requirements for reliable electroencephalography (EEG) research. Achieving these goals remains challenging because EEG datasets vary substantially across acquisition systems, file formats, experimental paradigms, participant populations, event annotations, and recording conditions. In addition, differences in preprocessing choices, software implementations, parameter settings, and computational environments can substantially influence analytical results. This overview examines the standards, open-source software, and computational pipelines that support transparent and generalizable EEG analysis. We discuss the role of the Brain Imaging Data Structure (BIDS), Hierarchical Event Descriptors (HED), FAIR data principles, and community reporting guidelines in improving data interoperability and reuse. We review major EEG analysis platforms, including Brainstorm, EEGLAB, FieldTrip, MNE-Python, and SPM, as well as automated preprocessing and quality-control pipelines. We also describe supporting infrastructure for dataset validation, curation, standardized event annotation, and scalable cohort-level analysis. Finally, we provide practical recommendations emphasizing standardized data organization, complete reporting of analysis parameters and software environments, code sharing, preregistration, automated quality control, and robustness analyses across plausible pipelines. Together, these practices provide a foundation for EEG findings that are more transparent, reproducible, and generalizable across datasets, laboratories, and analytical tools.

comments
21 pages, 6 figures, 2 tables. Chapter 17 of the 2026 monograph "Electroencephalogram Signals and Cognition," edited by Hema A. Murthy, Shrikanth Narayanan et al
journal
In: Electroencephalogram Signals and Cognition, Hema A. Murthy et al Sriranga Digital Software Technologies Pvt. Ltd., 2026, Chapter 17
fields
Mathematical Physics
pdf ↗ page arXiv:2610.34047 ↗

This PhD thesis constructs the $P(Φ)_2$ Euclidean quantum field theory on $\mathscr{S}'(\mathbb{R}^2)$. We first construct the finite-volume measure of the $P(Φ)_2$ model on $\mathscr{D}'(\mathbb{S}_R)$, where $\mathbb{S}_R$ is a two-dimensional sphere of radius $R\in\mathbb{N}_+$. To this end, we rely on Nelson's hypercontractivity estimate. We then use parabolic stochastic quantization and the energy method to construct the infinite-volume measure on $\mathscr{S}'(\mathbb{R}^2)$. This requires establishing the global-in-time existence of solutions to the corresponding stochastic partial differential equations with fixed cutoffs. The remainder of the thesis is devoted to verifying the Osterwalder-Schrader axioms: regularity, reflection positivity, and invariance under translations, rotations, and reflections. This combination of axioms, which is crucial for obtaining a non-trivial local relativistic quantum field theory on Minkowski spacetime, had not been established in earlier constructions based on stochastic quantization.

comments
PhD thesis submitted in October 2025 and defended in April 2026 at Adam Mickiewicz University, Poznań. Typos corrected and English revised
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2610.34063 ↗

We consider the ground state energy E_0(alpha, Lambda) of a single spinless non-relativistic electron coupled to the quantized radiation field with a sharp ultraviolet cutoff Lambda (the Pauli-Fierz model), with fine structure constant alpha = e^2/(4 pi). Lieb and Loss proved that C_1 alpha^(1/2) Lambda^(3/2) <= E_0 <= C_2 alpha^(2/7) Lambda^(12/7) for large Lambda and suggested that the upper bound, which comes from product states, gives the correct order. We prove that, for every fixed alpha > 0, E_0(alpha, Lambda) = (1+o(1)) c_alpha alpha^(2/7) Lambda^(12/7) as Lambda -> infinity, with an explicit constant c_alpha = 0.99338...; more generally, this holds uniformly in the joint limit Lambda/alpha -> infinity, alpha^(5/2) Lambda -> infinity, provided log(2+alpha) = o((Lambda/alpha)^(1/21)). Since our upper bound holds already for the infimum over product states, it follows that the ratio of E_0 to this infimum tends to one: electron-field correlations do not contribute to the leading term. The condition alpha^(5/2) Lambda -> infinity cannot be dropped, since for alpha^(5/2) Lambda -> 0 the vacuum trial state gives a smaller energy. The upper bound follows from a coherent state bound for the field energy in a fixed electron density. The lower bound combines a periodization of the field, a Born-Oppenheimer bound in which phase multiplication and a Hardy inequality in field space are applied block by block, and a lower bound on the magnetic Neumann Laplacian on a cube for band-limited fields; the key point of the last is that a band-limited field obeying a weighted gradient condition cannot concentrate its vorticity.

comments
36 pages. First paper of a series on the Pauli-Fierz model in the ultraviolet limit. Ancillary file: interval arithmetic script for the explicit constants
fields
Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2610.34122 ↗

We consider the Pauli-Fierz model of one spinless non-relativistic electron coupled to the quantized transverse electromagnetic field, without external potential, with a sharp ultraviolet cutoff Lambda and bare mass m. Let h = m_eff/m be the ratio of the effective mass, defined by the curvature of the fiber ground state energy at total momentum zero, to the bare mass; by scaling, h depends only on the fine structure constant alpha = e^2/(4 pi) and on lambda = Lambda/m. We prove two lower bounds. First, h >= 1 + 0.3441 alpha/(1 + 0.2985 sqrt(alpha) + 0.1252 alpha) for all alpha > 0 and all lambda >= 1; the bound does not depend on the cutoff, and with the band extended to the cutoff its first order coefficient in alpha is the perturbative one of Hiroshima and Spohn. The proof uses a coherent translation of the field applied to the ground state as a trial state; the term linear in the translation vanishes by minimality of the ground state. Second, for every fixed alpha, h grows faster than linearly: for every epsilon > 0, h >= lambda^(8/7 - epsilon) for all large lambda (8/7 is the limit of the method). Consequently iota_PF(alpha) := inf_{lambda > 0} h/lambda > 0, and for a fixed physical mass m_phys a bare mass reproducing it exists only if Lambda <= m_phys/iota_PF(alpha). This was expected, but not proved, by Lieb and Loss (2002). The proof of the second bound starts from the sharp self-energy asymptotics of a companion paper and uses a trial state obtained from the ground state by a phase depending on the field configuration. The new ingredients are an estimator for the position of the electron given by the local centre of a shallow level set of the photon cloud, the decoupling of a localized part of the field from the electron through a divergence-free external subspace, and a proof that shallow depressions near the edge of the localization window are rare.

comments
62 pages. Second paper of a series on the Pauli-Fierz model in the ultraviolet limit; Part II uses results of the companion paper "The sharp leading asymptotics of the self-energy of the spinless Pauli-Fierz model", submitted simultaneously. Ancillary file: interval arithmetic script for the constants of Part I
fields
Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2610.34125 ↗

In a series of joint papers with Loring, it was shown how index parings of $K$-theory classes with Fredholm modules can be computed as the half-signature of a suitably constructed finite-dimensional matrix, called the spectral localizer. After offering a novel perspective on earlier results, it is shown how the framework can be extended to unbounded gapped Hamiltonians given as second-order linear differential operators (in particular, matrix-valued Schrödinger and regularized Dirac operators). Important insights are the coercive phase space localization and discretizations by means of wavelets.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.34138 ↗

We investigate the signatures of phase-space noncommutativity in an anisotropic oscillator and propose an optomechanical protocol to experimentally characterize it through Stokes-like measurements of an optical field. Starting from a deformed phase-space algebra characterized by the position-position and momentum-momentum noncommutativity parameters $θ$ and $η$, we employ the Darboux transformation to construct an equivalent Hamiltonian in canonical variables. The resulting effective dynamics exhibits correlations between the oscillator degrees of freedom. We derive the corresponding covariance matrix and examine how the noncommutative parameters enter the mechanical dynamics and the optical response. By coupling the oscillator to a coherent optical probe, we obtain analytical expressions for the time-dependent optical coherence attenuation and the nonlinear Kerr phase. We then formulate an interferometric detection scheme through Stokes-like measurements, in which the outgoing optical field is combined with a phase-controlled reference beam at a balanced beam splitter, and the resulting photocurrents are measured using photodetectors. The optical response provides access to the modified normal-mode frequencies, which enables us to estimate experimental values of $θ$ and $η$. Our results establish a theoretical connection between NC-space dynamics, Gaussian-state correlations, and experimentally accessible optical observables, suggesting an optomechanical route toward testing signatures of phase-space noncommutativity.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.34176 ↗

The triangle map is an area-preserving, piecewise-parabolic map of the torus with vanishing Lyapunov exponent. We study the symbolic process $X_n=\pm1$ given by the two halves of the torus, whose partial sums $S_n$ are the transport of the lifted momentum, with an integrator free of accumulated rounding errors and exact computations on polygonal cylinder sets. We prove that the Koopman operator has no non-constant $H^1$ eigenfunctions, that the symbol is not an $H^1$ coboundary, and that runs of equal symbols are uniformly bounded. For generic parameters the walk is normally diffusive and Gaussian, but its diffusion coefficient is not that of a coin: away from the edges of the parameter square it varies between $0.2$ and $14$ times the Bernoulli value, and for a benchmark pair, with $D=3.09\pm0.01$, the excess is produced by the order of the bounded inter-event intervals, not by their distribution. The first-passage exponent is $1/2$ with a non-Bernoulli amplitude, and worst-case Birkhoff averages decay as for a uniquely ergodic system. For $β=0$ the Green-Kubo sum cancels, $D=0$, yet $\mathrm{Var}(S_n)$ keeps growing slowly, sign changes are rare and the correlations of Fourier modes decay as $n^{-0.2}$. We identify the zero-sum words, which become pure twists at $β=0$, as resonances that trap orbits with a computable $1/\ell$ law, set the crossover time $β^{-1/2}$ at small $β$, and, in an asymmetric deformation of the symbol, produce a logarithmic term in the variance whose coefficient we compute exactly. We formulate conjectures on unique ergodicity, mixing, the central limit theorem and the cohomology of the symbol.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.34179 ↗

Long-range correlations in written texts extend over scales far beyond local syntax, but their relation to semantic organisation remains incompletely understood. Previous work has linked these correlations to the bursty recurrence of topically relevant words. Here we generalise that construction from individual lexical items to distributed semantic observables. We map a text token by token onto a trajectory of pre-trained word embeddings, use principal component analysis (PCA) to identify text-specific directions of semantic variation, and threshold the projected series to define inter-event times; their coefficients of variation form a component-resolved burstiness spectrum $\{B_k\}$. Across 28 literary and scientific texts and the first 20 components, the originals remain systematically above the geometric inter-event-time baseline and above two complementary controls: a word-shuffled null, which preserves the embedding covariance, the PCA eigensystem and the marginal projected distributions while destroying temporal order, and a fractional-Gaussian-noise surrogate, which preserves the Zipfian frequency structure and matches the detrended fluctuation analysis (DFA) exponent of the original rank sequence. With events defined by the upper 5% tail of each projection, the original exceeds both controls in every text-component pair, while the two controls are statistically indistinguishable from each other. Autocorrelation and detrended fluctuation analysis of the semantic projections separate the originals from both controls in the same way. Global rank-level long-range correlations are therefore insufficient to generate the bursty recurrence observed along semantic directions. The results instead support an interpretation in terms of the ordered recurrence of semantically related material.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.34188 ↗

We establish global control of perturbative D-term data governing semiclassical vacuum sectors in chiral supersymmetric gauge theories on $\mathbb{R}^3\times S^1$. A closed-form, one-loop-exact D-term coefficient, including 4d Fayet–Iliopoulos (FI) parameters, gives a uniformly controlled leading potential away from massless thresholds and fixes local FI and Chern–Simons couplings near them. This allows lifting the 3d Intriligator–Seiberg classification of semiclassical vacua to $\mathbb{R}^3\times S^1$ across the compact holonomy space. The framework is showcased by finding a remarkably rich set of vacuum sectors in a simple abelian model and reproducing on flat space the R-twisted reduction of an $\mathrm{SU}(2)$ Maruyoshi–Song theory to the Gang–Yamazaki theory, first found on $S^3\times S^1$. The examples demonstrate the stakes of global matching: true vacua may lie at nontrivial holonomy even with nonzero threshold values of the Coulomb-slice D-coefficient, and despite vanishing D-coefficient at trivial holonomy.

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 ↗

Extending the analytic machinery and using the numerical inputs from OpenAI's proofs of the Haldane gap, we study infinite-chain ground states of the $S=1$ $J$-$D$ antiferromagnetic model $H=\sum_j\{\boldsymbol S_j\cdot\boldsymbol S_{j+1}+D(S_j^{\mathrm z})^2\}$ for sufficiently small $|D|$. We consider two finite-volume settings: periodic chains with an even number of sites, and open chains with an odd number of sites and the same positive magnetic field in the $\mathrm z$ direction at both endpoints. We prove that the ground states in each setting have an infinite-chain limit along the full sequence, without passing to a subsequence, and that the two limiting states coincide. Convergence is uniform in $D$ on a fixed neighborhood of zero. The common limit is a symmetric locally-unique gapped ground state, and its local expectation values depend continuously on $D$. These conclusions concern the two specified constructions, not uniqueness among all infinite-chain ground states. They provide the input for the study of a topological phase transition in a forthcoming revision of our companion paper. The author formulated the problem and proposed the basic strategy. ChatGPT Astra made substantial contributions to the inductive estimates and to completing the proof.

comments
32 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.34330 ↗

We establish a new iterative method for computing rigorous lower bounds for the ground-state energies of all atoms and ions. The accuracy of the resulting bounds depends on two ingredients: the quality of the initial energy estimate and the quality of the used upper bound for the maximum number of bound electrons, $N_c(Z)$, as a function of the nuclear charge $Z>0$. In particular, this new method allows us to establish the explicit lower bound $E(N,Z) \geq -0.8710\,N^{1/3}Z^2$ for the ground-state energy $E(N,Z)$ of the atom/ion with $N \in \mathbb{N}$ electrons and nuclear charge $Z \in (0,N]$, thereby considerably improving the best known constant $A=(3/2)^{1/3} \approx 1.1447$ in the estimate $E(N,Z) \geq -A\,N^{1/3}Z^2$ for $0 < Z \leq N$ and coming much closer to the best possible constant given by the Thomas-Fermi asymptotics $\lim_{N \to \infty} |E(N,N)|N^{-7/3}= -E_{\text{TF}}(1)\approx 0.7687$ derived in Adv. Math., 23(1) by Lieb and Simon. To demonstrate the potential and the limits of our method, we also compute explicit lower bounds for the ground-state energies $E(N,N)$ of all atoms with $2 \leq N \leq 86$ and we compare them with the bounds obtained in J. Chem. Phys., 62(8) by Hertel, Lieb, Thirring and the bounds obtained by Seco in his dissertation. Finally, we also provide a uniqueness result for the expectation values of the kinetic, potential and interaction energies on the ground-state space.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.34480 ↗

Path integral control is a stochastic optimal control framework that computes optimal policies as weighted averages over state trajectories. It was recently shown that, combined with stochastic quantum trajectories, the path integral control approach constitutes a promising alternative for quantum optimal control. In this work, we propose an extension of path integral control to the complex plane using circular complex Wiener processes. The change of measure is defined on the driving noise space under an exact control-noise matching condition, which also accommodates rank-deficient state diffusions. Applied to stochastic Schrödinger equations, the resulting formalism gives a compact treatment of paired non-Hermitian jump channels with unequal positive dissipation rates and yields cross-entropy-optimal feedback and open-loop control formulas.

comments
12 pages, 1 figure
fields
Mathematical Physics
pdf ↗ page arXiv:2610.34483 ↗

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 ↗

A state over time (stote) pairs a state $ρ$ with a channel $\mathcal{E}$ as the Hermitian, generally non-positive operator $(ρ\otimes\mathbf{1})\star J_\mathcal{E}$. Characterizing the convex cone $\widehat{\mathcal{Q}}$ these operators generate was posed as an open problem in~\cite{HoogstederCalsamigliaWinter2025}. We exhibit a linear copy of the bipartite separable cone as an exposed face of $\widehat{\mathcal{Q}}$: for output systems of the form $B = A'R$ with $A'$ a copy of the input, there is an explicit witness $W_0\in\widehat{\mathcal{Q}}^*$ and an explicit injective linear map $L$ with $σ\in \mathrm{SEP}_{+}(A{:}R)\iff L(σ)\in\widehat{\mathcal{Q}}(A{:}A'R)$. Composing with the NP-hardness of separability shows that exact membership, weak membership, and weak optimization are NP-hard for $\widehat{\mathcal{Q}}$ and its dual. A quantitative stability bound makes the weak-membership reduction valid at inverse-polynomial accuracy. Thus polynomial-time membership tests do not exist unless $\mathrm{P}=\mathrm{NP}$. Independently of this complexity assumption, Fawzi's theorem implies that $\widehat{\mathcal{Q}}(A{:}A'R)$ admits no finite semidefinite representation when $d=\dim A\ge2$, $r=\dim R\ge2$, and $d+r>5$.

comments
22 pages, 2 Figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.34972 ↗

This paper delivers a novel self-consistent non-local kinetic framework based on dose-dependent semi-Markov renewal transport and the generalized Doob's h-transform to evaluate the structural degradation of WWER-1000/1200 fuel claddings. By leveraging the Feynman-Kac formalism, we map the continuous microscopic defect path trajectories generated by the Liouville operator directly onto the evolution of the macroscopically integrated damage potential. The framework accounts for long-range memory effects in the degradation kinetics via a non-vanishing structural commutator of the path Liouville operator and Zwanzig-Mori projection operators, which mathematically links the spatial restrictions of microscopic sinks to energetic path penalties. Spatial profiling of the cladding's mean lifetime, demonstrates a distinct sigmoidal, S-shaped degradation trajectory encompassing distinct incubation, linear growth, and avalanche breakdown stages. The numerical results reveal an abrupt, localized reduction in the operational lifespan near the cladding boundaries. This marginal vulnerability is shown to be a direct physical consequence of boundary stress field singularities at the fuel cladding interface and localized embrittlement. The developed path integral architecture provides a strict thermodynamic link between non-equilibrium fluctuations and the global Griffiths macro-barrier, offering a robust predictive tool for high-burnup nuclear fuel safety assessments.

comments
27 pages, 5 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.34983 ↗

We examine the similarities and differences between two types of quasiperiodic functions: those obtained by restricting smooth periodic functions in $\mathbb{R}^N$ to lower-dimensional subspaces $\mathbb{R}^n \subset \mathbb{R}^N$, and those that arise as physical fields or potentials in quasicrystalline structures. Our analysis reveals that functions in these two classes share a number of common features while also exhibiting significant differences. As a key tool for investigating both classes of functions, we employ the Novikov problem - specifically, the problem of describing the global geometry of the level sets of quasiperiodic functions.

comments
17 pages, 12 figures, revtex
fields
Mathematical Physics
pdf ↗ page arXiv:2610.34989 ↗

We prove the $C^0$-inextendibility of the full Kerr realizations considered in this paper and all their connected covering spacetimes. The result holds for positive mass and nonzero rotation in the subextremal, extremal, and overextremal regimes. The obstruction at the singular ring is expressed by unbounded proper time in a fixed-endpoint causal homotopy class. It persists under every positive continuous conformal rescaling and under continuous widening of the Kerr causal cones, without any global causality assumption. We give sharp bounds in a fixed coordinate norm for stationary and axisymmetric perturbations and describe complete timelike geodesics that encounter arbitrarily large curvature near the ring.

comments
78 pages, no figure. Comments are welcome
fields
Mathematical Physics, Differential Geometry, Metric Geometry
pdf ↗ page arXiv:2610.35012 ↗

These notes cover the first part of a course of the same title taught by Filippo Fila-Robattino and Manuel Tecchiolli at the University of Zurich in the Winter Semester of 2025. Topics include variational principles in classical mechanics, special relativity, smooth manifolds and tensor calculus, connections and curvature, geodesic motion, and the derivation of Einstein's equations from the Einstein-Hilbert action. The treatment is aimed at a mathematical audience, combining physical motivation with precise definitions, detailed proofs, and explicit calculations.

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

Godin (\textit{J. Fluid Mech.}, vol. 767, 2015, pp. 52–64) showed that compressible fluids in a uniform gravity field support finite-amplitude incompressible wave motions, in which every parcel conserves pressure and density, and constructed exact Gerstner-type surface and edge waves, possibly carried by currents. Using the short-wavelength instability method for compressible flows, we show that these waves are linearly unstable above a critical steepness. The stability of each fluid level reduces to a Floquet problem depending on two parameters: the steepness $\mathfrak{e}=e^{ka_2}$ and $ν^2=(1-\mathfrak{e}^2)ν_0^2$, where $ν_0^2=\cos^2α\,N_0^2/Ω^2$, $N_0$ is the buoyancy frequency of the hydrostatic reference state, $α$ the inclination of the plane of motion and $Ω=(gk\cosα)^{1/2}$ the intrinsic orbital frequency. In an isentropic fluid, a level is unstable if $\mathfrak{e}>1/3$, recovering Leblanc's threshold for Gerstner waves (\textit{J. Fluid Mech.}, vol. 506, 2004, pp. 245–254) and extending it to compressible surface and edge waves; weak stable stratification lowers the threshold to $\frac13-\frac{32}{81}ν_0^2+O(ν_0^4)$. In an isothermal atmosphere, $ν_0^2=κ\cosα/(kH)$, where $H$ is the pressure scale height. For horizontal wavelengths near $5.5\,H/\cosα$, principal subharmonic resonance makes the critical steepness vanish. For the fast airglow wave observed by Hecht et al. (\textit{J. Geophys. Res.}, vol. 107, 2002, D20, 4444), which Godin interpreted with his solution, the lidar temperature places the layer in which this interpretation is consistent on this resonance, where the critical steepness is typically 0.1 instead of $1/3$. Instability is confined to a layer beneath the free surface of surface waves and to a wedge at the shoreline of edge waves.

comments
4 figures
fields
Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2610.35210 ↗

For the quantum phase estimation (QPE) algorithm we study the minimal space of observables that is sufficient to predict the entire output distribution under open dynamics of the counting register. Building on the general Krylov theory of reduction, we compute the structure of this space explicitly for the full Fourier measurement. The outcome probabilities are determined by cyclic sums of the state matrix. If the adjoint generator is diagonal on the matrix units, the spectral classes inside the residue classes of the index difference modulo the register dimension $M$ give a constructive basis, an exact dimension formula, and attainable bounds: the dimension of the visible space lies between $M$ and $M^2-M+1$. The class includes independent qubit dephasing, and an analytically solvable reference model of Gorini–Kossakowski–Lindblad–Sudarshan (GKLS) type yields a damped Fejér kernel; two random-unitary channels with the same Ramsey contrast show that higher harmonics are distinguishable in the QPE distribution. For approximate reduction we use a finite-time Gramian and an a posteriori residual estimate, with a quadratic error order for a reducing unperturbed subspace and a compatible initial state. Numerical calculations check the consistency of the representations and the behaviour of the error under non-Toeplitz perturbations.

comments
21 pages, 1 figure
fields
Mathematical Physics, Numerical Analysis
pdf ↗ page arXiv:2610.35332 ↗

We investigate the optimization of nuclear fusion reactivity relative to the choice of energy probability distribution. A single Maxwell-Boltzmann (MB) distribution is found to be optimal in the region where reactivity is a concave function of the average available kinetic energy, specifically near the reactivity peak. Conversely, in regions where the reactivity curve is convex, optimization is achieved through a bimodal MB distribution. We then discuss our results in the context of three classes of generalized energy distributions (superstatistics), which are modeled as a continuum of MB distributions. As expected, in all cases examined, the reactivity gains provided by superstatistics are bounded by the proposed optimal distribution. Finally, we apply these findings to deuterium-deuterium and deuterium-tritium fusion processes using empirical parametrizations of their respective cross sections. For both reactions, employing optimal bimodal MB distributions at low average energies-of particular interest for magnetically confined plasmas-yields a reactivity enhancement of approximately a factor of 2.

comments
13 pages, 4 figures with panels
journal
Physical Review E 114, 044136 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2610.35507 ↗

We highlight three geometric aspects of fault tolerance. First, we construct an operator-algebraic formulation of the fiber bundle framework for fault tolerance, and show that a generalization of the Knill-Laflamme conditions implies a flat connection for this framework. Next, we develop this framework for Gottesman-Kitaev-Preskill (GKP) codes. We show that, for each polarization type, their moduli space embeds smoothly into a Grassmannian of finite-dimensional subspaces of a regularized distribution space. Finally, we explain how GKP codes associated with Jacobians give rise to magic states that can be obtained by code space projections of Gaussian states and identify a $\rm CCZ$-type magic state arising this way.

comments
Comments welcome!
fields
Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2610.35513 ↗

To date, a Leray's weak solution to the Navier-Stokes equations enjoys an energy inequality. We prove the existence of a weak solution that enjoys the energy equality. The existence of the weak solution is achieved as limit of solutions to the mollified Navier-Stokes system (Leray's approach). Since no uniqueness result is known for weak solutions we are not able to claim that any weak solution in the sense of Leray-Hopf enjoys the energy equality.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.35517 ↗

We study the no deterministic images condition (NDI) for Schrödinger cocycles, which excludes a common image of a fixed probability measure under almost all projective transfer transformations. We prove two-step NDI at every energy for nonconstant measurable potentials over mixing systems and ergodic potentials with infinite essential range, and classify persistence for finite-state locally constant potentials. For bounded Markov and hidden Markov potentials on general state spaces under a one-step $L^2$ norm gap condition on the Markov operator, we prove Hölder bounds for solution-direction distributions above an exponential cutoff and Hölder conditional stationary measures. Counterexamples show the essential sharpness of both assumptions. For nonconstant real trigonometric potentials, including the almost Mathieu operator, we prove NDI and Hölder bounds for distributions of solution directions at all steps $k\ge2$ and all frequencies (rational or irrational). The exponent depends on the step, while the constant is uniform in steps, frequency and energy on compact intervals. For every irrational frequency and every energy with positive Lyapunov exponent, we prove non-atomicity of both Oseledets direction distributions and convergence to the unstable distribution from every phase-independent initial probability. This gives a new criterion for a zero Lyapunov exponent: a subsequential limit with an atom for one fixed initial direction suffices. All these results extend to an analytic class, with step-dependent regularity bounds.

comments
86 pages
fields
Mathematical Physics, Dynamical Systems, Spectral Theory
pdf ↗ page arXiv:2610.35583 ↗

Classical shell fracture theories predominantly consider cracks aligned with principal curvature directions in cylindrical and spherical shells under tensile mode or pressure loading, leaving the fracture behavior of arbitrarily oriented cracks in doubly curved shells under general loading poorly understood. Here, we introduce a semi-analytical framework based on Reissner shallow-shell theory to investigate isotropic shells with positive, zero, and negative Gaussian curvature. The formulation computes stress intensity factors, energy release rates, and crack-lip displacements for arbitrarily inclined through-thickness cracks in spheres, ellipsoids, cylinders, hyperboloids, and minimal surfaces under general mechanical loading. We show that shell curvature couples opening, sliding, and tearing, allowing a single loading component to activate multiple fracture modes, unlike in flat plates. This coupling depends strongly on crack orientation and the normal, parallel, and torsional components of the shell curvature. Ellipsoids exhibit weak coupling, hyperboloids generally exhibit the strongest coupling, and cylinders display the most complex orientation-dependent responses. Moreover, in-plane shear can induce crack closure in hyperboloidal shells, suggesting a potential geometric mechanism for enhanced damage resistance. These findings elucidate the role of local curvature in fracture-mode coupling and provide a mechanistic foundation for the analysis of shellular (meta-)structures with engineered curvature distributions.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.35597 ↗

A string couples to a two-form gauge potential whose local descriptions need not fit together as a single global form. Principal 2-bundles provide a geometric description of this gluing. However, we recover surface amplitudes and quantum partition functions, as well as local classical field dynamics, without the 2-bundle formalism. For global phases, topological and index invariants, and twisted-sheaf moduli, established equivalences give alternative descriptions through cocycles, bundles, operators, or modules, with the required global compatibility data. For three-dimensional finite gauge theories with cohomological actions, Fourier transformation expresses the partition function as a sum of partition functions of ordinary finite-group gauge theories. An invertible local substitution reduces invariant classical actions for a class of 2-bundle connections represented by finite-dimensional crossed modules to ordinary gauge and tensor dynamics. These finite and local reductions explicitly eliminate field variables. A four-dimensional quadratic example instead admits a direct cochain evaluation even when an ordinary gauge-theory reduction fails. These results therefore do not require the additional 2-bundle presentation.

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

We introduce a family of positive maps on qudits whose Choi operators combine two competing coherence patterns: independent exchange couplings and a collective set of diagonal couplings. For every mixed member of the family, we derive exact conditions for positivity, complete positivity, and all intermediate levels of k-positivity, and we determine the complete phase structure of decomposability and atomicity. The higher-positivity thresholds depend on the channel multiplicities, whereas the exact decomposability boundary is universal in scale-free coordinates. Its proof combines an explicit positive-plus-copositive decomposition with a matching family of positive-partial-transpose (PPT) states. The latter form PPT edge states whose detection region is an ellipse, or a disk after collective rescaling. An embedded-qutrit certificate shows that indecomposability and atomicity coincide throughout the mixed family. In contrast, the purely collective endpoint is decomposable over its entire positive interval. Finally, at maximal coherence, an explicit positive subtraction produces an atomic optimal entanglement witness with the spanning property and a strictly larger PPT- detection set. The study thus provides an exactly solvable setting in which k-positivity, decomposability, atomicity, PPT-edge-state geometry, and witness optimality can be compared in arbitrary local dimension.

comments
22 pages, 2 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.35758 ↗

We develop a multiscale criterion for exponential decay of relative entropy in the canonical stochastic quantization of lattice field theories, the underdamped Langevin dynamics of the field and its momentum. For smooth bounded perturbations of Gaussian fields, the criterion requires the uniform operator-norm bound on the smoothed interaction Hessian along the Polchinski flow of Bauerschmidt and Bodineau to have a small $L^2$ norm in the scale variable. The decay constants depend only on this $L^2$ norm and the friction. The proof measures the transfer of momentum dissipation to position on the same scales that decompose entropy. A phase-space extension of the Polchinski flow gives Gaussian coarse-graining that commutes with free kinetic evolution. Integrating position–momentum cross terms over these scales yields a corrector bounded by entropy. A force defect accounts for changes in the averaged interaction force away from equilibrium; its evolution in scale controls the errors in the kinetic estimate. For the massive two-dimensional lattice sine–Gordon model with $0<β<4π$ and small dimensionless local coupling, the criterion gives entropy decay for all finite-entropy initial laws, uniformly in the lattice spacing and the volume. For friction proportional to the mass $m$, the rate has optimal order $m$.

comments
33 pages
fields
Mathematical Physics, Functional Analysis, Probability
pdf ↗ page arXiv:2610.35759 ↗

We describe a family of convex continuous functions $E_{F,\varepsilon}$, $\varepsilon\in(0,1]$, on the set of states of a bipartite quantum system (consisting of finite-dimensional or infinite-dimensional subsystems) obtained by applying the Mora-Piani-Briegel construction of $\varepsilon$-measure (proposed in [Phys. Rev. A 109, 052413]) to the Entanglement of Formation (EoF) with the use of the trace norm distance in the role of basic metric. These functions are non-increasing in $\varepsilon$ and converge pointwise to the EoF as $\varepsilon\to0^+$. We conducted a detailed analysis of properties of the functions $E_{F,\varepsilon}$, using (among others) the relationship between the family $\{E_{F,\varepsilon}\}_{\varepsilon\in[0,1]}$ and the family $\{E^λ_F(ρ)\}_{λ>0}$ of Moreau-Yosida approximations of the EoF explored in [arXiv:2609.30246]. We obtain a variational expression for the functions $E_{F,\varepsilon}$ (which for $\varepsilon=0$ turns into the standard variational expression for the EoF). We also describe the weak subadditivity property of the functions $E_{F,\varepsilon}$ and analyse their continuity properties. The semicontinuity bounds for the EoF (presented in [Lob.J.Math., 46, 2632-2658],[arXiv:2404.07978]) allow us to obtain easily computable upper bounds on the rate of uniform convergence of the function $E_{F,\varepsilon}$ to the EoF as $\varepsilon\to0^+$ on the sets of states with bounded rank/energy of one of the marginal states. Applicability of the obtained results to other entanglement measures, in particular, to the relative entropy of entanglement, is discussed. As an auxiliary result, it is shown that for any state of an infinite-dimensional bipartite quantum system, there exists a nearest separable state w.r.t. the trace norm distance. The non-uniqueness of such a state is also shown.

comments
36 pages, preliminary version, one comments and references are welcome
fields
Mathematical Physics, Functional Analysis
pdf ↗ page arXiv:2610.35797 ↗

We prove that, for every irrational frequency, the spectra of the extended Harper family throughout the zero-measure regime have finite $1/2$-dimensional Hausdorff measure and lower box dimension at most $1/2$. Both numbers improve to $1/3$ on the isotropic critical boundary. The proof is based on a family of unitary transformations, that specializes to the chiral transform of [BJK] for the case of the critical almost Mathieu. This family allows to make every operator in this regime spectrally equivalent to a singular Jacobi operator. Using these singular representatives, we apply the method of [BJK] to construct covers by $O(q_n)$ intervals of total length $O(q_n^{-1})$, improving to $O(q_n^{-2})$ on the isotropic boundary, where $q_n$ is the denominator of a canonical approximant to $α$. The covers give upper box bounds and, with packing estimates, examples where the box-counting dimension fails to exist.

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

We analyse the large-time asymptotics of the Schrödinger time evolution of a free quantum particle on the Erdős-Rényi graph $\mathbb{G}(N,d/N)$, where the quantum Hamiltonian is given by the adjacency matrix of $\mathbb{G}$. Starting from a state localized at a vertex, the wave function is approximately radial, and we characterize precisely its asymptotic form. Our results in particular cover vertices whose degree is close to $2d$, hence probing the emergence of bound states from a dynamical perspective. This provides a dynamical counterpart of the coexistence of localized and delocalized states established in [arXiv:1905.03243,arXiv:2005.14180,arXiv:2106.12519,arXiv:2109.03227,arXiv:2305.16294], with the former giving rise to a localized mode and the latter to a dispersive wave. Our results hold in the regime $\sqrt{\log N} \ll d \ll N^{o(1)}$, which is the full region in which such dynamical phenomena may exist, and for times $1 \ll t \ll T_N$ for some explicit $T_N \gg 1$.

comments
35 pages, 3 figures
fields
Mathematical Physics, Probability
pdf ↗ page arXiv:2610.35867 ↗

Optimization and Control58

We formulate the design of a market stability reserve as a stationary mean-field singular control problem. The allowance balance follows a regime-switching diffusion, while the regulator injects or withdraws allowances through bounded-variation controls. The objective trades off the average allowance balance, its stationary dispersion, deviations from a long-run target, and intervention costs. The optimal policy is a regime-dependent band rule characterized by four reflecting thresholds. Its computation reduces to a scalar fixed-point problem combining a coupled variational inequality with the invariant distribution of the reflected process. A calibration to the EU ETS yields thresholds of the same order of magnitude as the existing Market Stability Reserve rule. Comparative statics show that volatility is the main determinant of the intervention band, whereas the frequency and duration of crisis regimes have limited effects. A simpler two-threshold policy based on average regime dynamics closely reproduces the optimal regime-dependent policy in terms of liquidity and intervention volumes.

fields
Optimization and Control
pdf ↗ page arXiv:2610.33132 ↗

The subgraph isomorphism problem (SGI) asks a deceptively simple question: is a graph B found inside a parent graph A? Famously NP-complete and the subject of volumes of study, attempts to practically solve subgraph problems typically require specialized software or the focused application of problem-specific theoretical knowledge. Here we present a straightforward linear framework that neatly joins SGI to lattice theory and constrained satisfiability and, importantly, yields an easily implemented algorithm that naturally leverages consumer-grade hardware and off-the-shelf libraries to compete with state-of-the-art specialized solvers. We additionally show practical realizations in approachable settings, along with some benchmarks that reduce 6+ hour computations to seconds. Aimed at readability, we develop a series of computable algebraic invariants and demonstrate their application to familiar problems such as the Knight's Tour, with a focus on providing an accessible entry point for researchers in graph theory, abstract algebra, and students in general.

comments
24 pages, 8 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.33235 ↗

Blind random search is a simple global optimization method that only requires the value of the loss function, without needing gradient information or an explicit loss model. However, its classical formulation assumes that the loss evaluation is noise-free, which limits its direct application to practical problems with noisy measurements. We extend blind random search by combining a vanishing acceptance threshold with the running average of noisy loss measurements. Under the stated assumptions, we prove that the proposed algorithm converges almost surely to the global minimizer. We further analyze the rate at which the loss at the current estimate approaches the minimum loss. For low-dimensional cases, we obtain an almost sure asymptotic upper bound on the difference between the two, and for high-dimensional cases, we prove that this difference, suitably scaled, has an exact Weibull limiting distribution.

comments
7 pages, 2 figures. Submitted to the 2027 American Control Conference (ACC)
fields
Optimization and Control
pdf ↗ page arXiv:2610.33302 ↗

As interest in cislunar space grows, so does the need for space domain awareness (SDA) capabilities to safely support missions. To enhance cislunar SDA capabilities, the use of space-based observers has been proposed. Prior research has explored optimizing observer placement but has not considered scheduling limitations. We propose a mixed-integer linear programming formulation that concurrently optimizes the placement and scheduling of space-based observers for cislunar SDA. Our work considers three aspects of observer scheduling: sensor tasking, communication, and charging. We utilize a scenario-based approach that generalizes observer placement for unknown targets while applying scheduling constraints to each scenario. However, this problem quickly becomes difficult for commercial solvers to handle as the number of scenarios grows. As an alternative, a column generation approach is employed to introduce well-performing schedules into the problem for each orbital slot. A comparative analysis is performed across multiple instances to evaluate the performance of column generation against that of a commercial solver. A case study is then conducted in which the performance of the observers' placement from the concurrent formulation is tested against a set of validation target sets and compared with the performance of two baselines in which placement and scheduling are performed sequentially.

comments
41 pages
fields
Optimization and Control
pdf ↗ page arXiv:2610.33313 ↗

This paper studies first-order methods for monotone variational inequalities with semi-infinite constraints and presents this model as a framework covering constrained saddle-point problems, robust optimization, distributionally robust function-constrained optimization, and generalized Nash equilibrium formulations. Since feasibility must hold over infinitely many indexed constraints, direct projection onto the full feasible region is generally difficult. Therefore, we propose a single-loop primal-dual constraint extrapolation method (PD-ConEx) that updates primal variables, Lagrange multipliers, and worst-case constraint indices using first-order information, linearization, extrapolation, and projections only onto simple sets. We establish convergence guarantees for smooth and nonsmooth regimes, showing how the achievable rates depend on strong monotonicity and strong concavity of the index block. For coupled convex-concave saddle-point problems, strong convexity in the minimization block can accelerate its smooth terms even without strong concavity in the maximization block. We also develop an adaptive smooth variant with $O(1/K)$ VI-gap and feasibility guarantees without an a priori bound on generated multipliers. Moment-based and Wasserstein distributionally robust models fit within the framework, and numerical experiments on robust quadratic instances and distributionally robust learning illustrate the method's optimality and feasibility behavior.

fields
Optimization and Control
pdf ↗ page arXiv:2610.33329 ↗

In AI-assisted service systems, the server can choose how much processing effort to spend on each job, which we call the service depth. Deeper reasoning improves output quality but occupies the server longer and increases congestion, and the realized processing time remains random because AI models are probabilistic and tasks vary in complexity. We study the joint design of service depth and priority in a single-server queue whose customers differ in delay sensitivity, with the goal of maximizing social welfare. For each customer type, the decision maker chooses a priority level and a service depth, and service times are exponential with mean equal to the chosen depth. With two customer types and linear service values, we characterize the centralized optimum. Counterintuitively, it prioritizes the patient type and gives it a smaller service depth when patient customers are sufficiently prevalent. When delay sensitivity is private, however, incentive compatibility requires the impatient type to receive a weakly shorter sojourn time, so the optimal price menu never prioritizes the patient type. Consequently, there can be a welfare gap between the centralized decision maker's optimal control policy and the optimal decentralized pricing mechanism. With a continuum of types, the centralized optimum is monotone: more delay-sensitive customers receive weakly smaller depth and higher priority, so the optimum can be implemented by a price menu with no welfare loss. Allowing randomized depths similarly closes the gap in the two-type model. Finally, we calibrate an agentic AI service system using published coding-agent trials from DeepSWE and numerically examine priority inversion, the value of joint design, and the welfare gain from personalization.

fields
Optimization and Control
pdf ↗ page arXiv:2610.33334 ↗

We revisit the variational characterization of Nesterov's celebrated method and study when Nesterov trajectories are eventually locally minimizing in a variational sense, a notion that we define precisely. We show that this question is equivalent to the nonnegativity of an associated Schrödinger operator acting on variations of the trajectory. For power objectives of the form \[ f(x)=\frac{1}{p}\|x\|^p \] (where $\| \cdot\|$ denotes the Euclidean norm), we give a complete characterization: Among all exponents $p\ge 2$, the Nesterov trajectory with non-zero initial position is eventually locally minimizing if and only if $p=4$. We further interpret this exceptional exponent through the stability theory of semilinear elliptic equations.

fields
Optimization and Control
pdf ↗ page arXiv:2610.33341 ↗

An operator who positions mobile resources before a disruption faces two uncertainties that are usually treated as one: how the joint state of demand and travel conditions will vary, and which part of the resulting cost the positioning decision can actually change. Standard distributionally robust optimization (DRO) protects total cost, and therefore spends much of its protection on disruption costs that every feasible design would pay. This paper evaluates the worst-case regret of a design and compares it with the worst-case premium of total-cost DRO, and shows that the regret-to-premium ratio can be bounded before any robust model is solved: from marginals for the dependence question, and from single-scenario optima and one transport linear program for the regret question. The worst-case law is a relabelling of the operating record, reassigning every recorded period wholesale to another recorded period, except at most one, which is split. The comparator that exposes the largest worst-case regret is found by a single mixed-integer program. We derive an explicit radius where the sample-average design is exactly regret-robust. For finite scenario and design sets we compute a design's worst-case regret exactly, bound it from quantities a planner already has, and show on fleet and EMS data how law-relative regret changes capacity and positioning choices relative to sample-average and worst-cost planning. We apply the decision tree to several years of New York fleet data, including the year before Hurricane Sandy, and to two emergency-service events. The test flags the pre-Sandy year as exposed. The training-support regret bounds cover realized test regret in three of four fleet folds. On Ida, where the regret-robust allocation differed from the sample-average one, it moved units toward the boroughs the storm loaded and cost less than the sample-average design.

comments
54 pages, 2 figures, 9 tables; includes electronic companion
fields
Optimization and Control
pdf ↗ page arXiv:2610.33361 ↗

Modern gradient boosting algorithms are based on Newton's method, which excels empirically but lacks global convergence guarantees. While recent work on Gradient-Regularized Newton (GRN) boosting achieved a global $\mathcal{O}(1/γ^{12}k^2)$ rate, its analysis was not able to exploit the natural Hessian geometry and suffers from a heavy $γ^{12}$ dependence on a worst-case `weak gradient edge' $γ$. In this paper, we tackle these theoretical drawbacks by generalizing the Affine-Invariant Cubic Newton (AICN) scheme to convex optimization with weak learners. Our analysis is based on average cosine values $\overlineΘ_k$ along the optimization path and directional improvements $δ_k$ in the Hessian-induced norm. We show that the weak-AICN update reduces to a damped weak-Newton step with an explicit stepsize determined by $δ_k$. Under semi-strong self-concordance, we establish a global $\mathcal{O}(1/\overlineΘ_k^4 k^2)$ rate, significantly improving upon the weak-GRN bound. We further prove a local linear rate, global linear convergence for Hessian-dominated losses, cosine angle lower bounds, and present weak-AdaAICN, which adaptively tunes the cubic regularization. Finally, we demonstrate the broader applicability of this framework beyond gradient boosting by showing that Newton coordinate descent emerges naturally as a special case of optimization with weak learners.

comments
Accepted to 40th Conference on Neural Information Processing Systems (NeurIPS 2026)
fields
Optimization and Control
pdf ↗ page arXiv:2610.33516 ↗

In this paper, we investigate the approximate controllability of neutral integro-differential inclusions driven by hemivariational inequalities with nonlocal inclusion conditions in a Banach space $\mathbb{V}$ whose dual $\mathbb{V}^*$ is uniformly convex, using resolvent operator theory. We first establish an equivalence between the original problem and an associated differential inclusion involving the Clarke subdifferential. Under suitable assumptions, we then prove the existence of mild solutions corresponding to admissible controls in $\mathrm{L}^2(I,\mathbb{U})$. A key contribution of this work lies in the analysis of the control construction in Banach spaces, where the duality mapping $\mathcal{J} = \partial\big(\tfrac{1}{2}\|\cdot\|_{\mathbb{V}}^2\big)$ is generally nonlinear, in contrast to the Hilbert space setting, while such nonlinearity has been viewed as a technical obstruction in earlier studies. Based on this framework, we prove approximate controllability of the original system by relating it to the controllability of the associated linearized inclusion and constructing appropriate controls involving the duality mapping. Finally, we present applications to illustrate the effectiveness of the proposed approach.

fields
Optimization and Control
pdf ↗ page arXiv:2610.33634 ↗

High penetrations of distributed energy resources (DERs) and fast-varying electric vehicle (EV) charging intensify voltage and line-limit violations in distribution networks (DNs), making safe, low-cost operation increasingly challenging. This paper proposes a physics-informed safe deep reinforcement learning (DRL) framework for coordinating community battery energy storage systems to mitigate constraint violations while minimizing operating cost. To represent nonlocal spatiotemporal interactions, we develop a dual-level physics-informed graph representation in which line impedance and capacity shape spatial information propagation, while power-balance, voltage-profile, and flow-reconstruction losses regularize the latent state toward control-relevant physical consistency. Building on this representation, we develop Lagrangian Dedicated-Critic PPO (LDCPPO), which implements constraint-specific value decomposition: independent reward and cost critics preserve heterogeneous voltage- and line-loading-related learning signals and combine their advantages only during the Lagrangian policy update. Case studies on DNs with high rooftop photovoltaic penetration and EV charging demonstrate that the proposed method reduces the key voltage-violation degree by up to 80.5% compared with the tested baselines, while also achieving the lowest voltage-violation count and line-overload degree with competitive operating cost.

journal
IEEE Transactions on Smart Grid, 2026
fields
Optimization and Control
pdf ↗ page arXiv:2610.33654 ↗

In this paper we consider optimal stopping problems with full information and rank-dependent rewards. Our focus is on the following two problems: selecting one of the r best observations (Gusein-Zade's problem with full information) and minimizing the expected rank (Robbins' problem). In both settings we provide full characterization of the optimal stopping rules and corresponding optimal values. We also present numerical experiments in which the derived dynamic programming recursions are implemented, and approximations to optimal values are computed.

comments
Keywords: optimal stopping, full information, rank-dependent reward, dynamic programming, Robbins' problem, Gusein-Zade's problem
fields
Optimization and Control, Probability, Statistics Theory
pdf ↗ page arXiv:2610.33701 ↗

Supply chain resilience research has traditionally viewed defensive actions such as safety stock, backup suppliers, expedited transportation, and emergency sourcing as beneficial. However, disruptions such as the COVID-19 pandemic, the 2021 semiconductor shortage, and the Suez Canal blockage highlight how synchronized hoarding, duplicate ordering, and capacity reservation can amplify congestion and operational costs, sometimes worsening the original disruption. Motivated by this observation, we develop a decision-theoretic framework in which Protective Response Intensity (PRI) is an endogenous decision variable. We introduce Response-Induced Loss (RIL) to capture costs generated by defensive actions and characterize a unique optimal response that balances disruption mitigation against self-induced losses. We derive a closed-form critical response threshold beyond which RIL exceeds the original disruption intensity, a phenomenon termed a *Supply Chain Cytokine Storm*. We further propose the Cytokine Storm Index (CSI), measuring response-induced loss relative to the original disruption, and discuss its potential calibration using operational data. Extending the framework to interconnected supply networks, we derive a spectral stability condition distinguishing bounded decentralized responses from network-wide propagation. Numerical experiments show that optimal responses remain below the storm threshold, whereas proportional response heuristics can exceed it. Network responses converge or diverge according to the derived stability condition. Overall, our findings highlight that supply chain resilience depends not only on mitigating disruptions but also on keeping defensive responses proportionate to the shocks they are intended to address.

fields
Optimization and Control
pdf ↗ page arXiv:2610.33750 ↗

We study convergence rates of Nesterov's Accelerated Gradient Descent (NAG) method for convex optimization in both deterministic and stochastic settings. We focus on a more general smoothness condition raised from several machine learning problems empirically and theoretically. We show the accelerated convergence rate of order $\mathcal{O}\left(1/T^2\right)$ in terms of the function value gap, given access to exact gradients of objective functions, matching the optimal rate for standard smooth convex optimization in \citep{nesterov1983method}. Under the relaxed affine-variance noise assumption for stochastic optimization, we establish the high-probability convergence rate of order $\tilde{\mathcal{O}}\left(\sqrt{\log\left(1/δ\right)/T}\right)$ and this rate could improve to $\tilde{\mathcal{O}}\left(\log\left(1/δ\right)/T^2\right)$ when the noise parameters are sufficiently small. Here, $T$ denotes the total number of iterations and $δ$ is the probability margin. Up to logarithm factors, our probabilistic convergence rate reaches the same order of the expected rate obtained in \citep{ghadimi2016accelerated} where the assumptions of bounded variance noise and Lipschitz smoothness are required. We additionally establish the convergence rates of the studied algorithms in the non-convex setting.

fields
Optimization and Control
pdf ↗ page arXiv:2610.33761 ↗

We propose a new underestimator with pointwise and Hausdorff convergence of order three for deterministic global optimization of twice continuously differentiable functions with Lipschitz continuous Hessians. The proposed underestimator is obtained by augmenting the second-order Taylor expansion with a cubic remainder term of the objective function yielding a valid global underestimator that can be used to obtain lower bounds in a branch-and-bound method to solve nonconvex global optimization problems. The underestimator is nonconvex, and finding its global minimum could be computationally expensive. Accordingly, we derive a sufficient condition under which the proposed cubic underestimator is edge-concave, so that its minimum over a box can be found by vertex evaluation, while retaining third-order convergence. We show that the maximum separation distance between the objective function and the underestimator decreases cubically with the width of the box. This higher order convergence enables the lower bounds to converge more rapidly to the optimal value as the variable bounds are progressively tightened. The proposed underestimator is incorporated into a deterministic branch-and-bound algorithm and compared with the αBB and second-order edge-concave underestimators on a collection of 130 benchmark problems. The numerical results show that the proposed underestimator outperforms the compared underestimators in terms of both the number of explored branch-and-bound nodes and total CPU time, while maintaining a competitive computational cost per node. These results demonstrate that the proposed cubic edge-concave underestimator can provide more effective lower bounds and better computational performance in deterministic global optimization.

fields
Optimization and Control
pdf ↗ page arXiv:2610.33836 ↗

In this paper, we address the prescribed/fixed-time control problem for linear time-invariant systems with relative degree $r\geq 2$ using delayed time-varying static output feedback. In addition to controllability and observability, we assume that a truncated observability matrix is nonsingular. Within the act-and-wait control framework, two types of artificial delays are introduced into the output feedback: one to realize static output feedback and the other to achieve prescribed/fixed-time control. By constructing smooth periodic delayed output feedback controllers, we achieve prescribed-time input-to-state stability (ISS) with respect to matched disturbances and measurement noise. Next, we consider systems with measurement delays. Note that existing predictor methods are not applicable to static output feedback delay compensation. We propose delayed controllers that achieve fixed-time stability in the presence of large known slowly-varying delays (with delay derivatives less than one) and even in the presence of large unknown constant delays for systems with nilpotent matrices. Moreover, we present a design for the case of discrete-time periodic measurements with a small sampling period. When the system reduces to a chain of integrators, prescribed/fixed-time convergence can be achieved with arbitrarily large artificial delays introduced by static output feedback avoiding high gain and managing with large known slowly-varying or sawtooth delays (corresponding to discrete-time measurements) or unknown constant delays. In the case of unknown constant delays, this leads to a low-gain controller that may efficiently attenuate measurement noise. Numerical examples verify the effectiveness of the proposed method.

comments
17 pages, 8 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.33878 ↗

The infimal displacement vector of the nonexpansive operator underlying the primal-dual hybrid gradient algorithm (PDHG) is known to encode useful information for infeasible optimization problems. In particular, for the ellipsoid separation problem (ESP), where the goal is to find a separating hyperplane between two collections of ellipsoids, the infimal displacement vector corresponding to an infeasible second-order cone program (SOCP) encodes a separating hyperplane. We show FISTA computes a sequence of approximations to the dual component of the infimal displacement vector and establish that a solution to the ESP can be obtained in $\mathcal{O}(δ_{\mathcal{A}}^{-2})$ iterations. Here $δ_{\mathcal{A}}$ denotes the distance between the convex hulls of the two ellipsoid collections.

fields
Optimization and Control
pdf ↗ page arXiv:2610.33902 ↗

We study a deletion rule for strictly convex quadratic minimization on a simplex: compute the affine minimizer on the current face, permanently remove a most-negative coordinate, and repeat. Correctness is required for every linear term and every resolution of ties. We characterize first-step safety by a finite maximum principle for the constrained inverse, and correctness from every initial face by principal-inverse row inequalities. Correctness from the full simplex is a different property. The two properties coincide with at most four coordinates, but an explicit rational five-coordinate example separates them. An exact reachability condition explains the separation: boundary equalities in the constrained inverse restrict the tasks that can be entered on a facet. Away from these equalities, full-start and hereditary correctness coincide. We also determine the recognition complexity. First-step safety is decidable in polynomial bit time, by combining classical strict $n$-step-vector recognition with diagonal regularization. In contrast, full-start and hereditary correctness are coNP-complete, even on a reduction family with strict column diagonal maxima on every face. The proofs include the non-strict boundary and all affine anchors; explicit rational certificates for the finite examples are given in the text.

comments
25 pages
fields
Optimization and Control
pdf ↗ page arXiv:2610.33908 ↗

Learning-based approaches to combinatorial optimization often predict solutions directly or use predictions to restrict search, while expressive energy-based models typically rely on approximate inference. We introduce EnerGNN, a framework that learns energy functions over complete binary configurations and minimizes them under explicit hard constraints through mixed integer programming (MIP). EnerGNN combines a graph neural network encoder with an optimization-compatible readout and a nonlinear energy head, enabling exact constrained inference over the learned energy. An optimality-aware contrastive loss trains the energy to reflect solution quality and constraint violations. Across Quadratic Knapsack, Combinatorial Auctions, and a personalized cell therapy supply chain problem, EnerGNN achieves near-optimal solutions with 100% feasibility. On the supply chain problem, it achieves a 0.05% mean primal gap and a 17.4$\times$ speedup over the monolithic MIP. The learned energy also generalizes to larger instances and supports zero-shot constraint injection, adapting to changing constraints without retraining while preserving feasibility.

comments
Accepted at NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2610.33930 ↗

We propose a joint sparse sample weighting and parameter estimation (SWAPE) framework that jointly optimizes model parameters and sample weights to train a model while simultaneously assigning an individual weight to each training data point. Our framework accommodates several widely used loss functions for the model parameters, including convex, weakly convex, and difference-of-convex loss, and weakly convex sparsity functions to control the complexity of the sample weights. To solve the resulting bivariate problem, we propose an alternating minimization method in which the subproblems for updating the model parameters and weights are each approximated using majorize-minimize techniques. We provide several approximation methods for the loss functions considered in this paper, and show the overall algorithm's convergence. Numerical experiments on various learning tasks and data anomaly settings demonstrate the effectiveness of the proposed framework in minimizing the impact of undesirable data points compared to benchmark methods.

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

The integer quadratic moment hull is the closed convex hull of the pairs $(z,zz^{\top})$ with $z\in\mathbb{Z}^n$. We prove that one round of Chvátal-Gomory (CG) cuts applied to its basic semidefinite relaxation recovers this hull exactly if and only if $n\le6$. Our approach identifies its facets with perfect Delaunay polyhedra and characterizes their recovery through depth, the gap between lattice and continuous minima of a defining quadratic after normalization. A facet inequality is valid for the rank-one CG closure exactly when its depth is less than one. We also analyze the complexity of deciding membership in the CG closure and finding violated inequalities. Every rational point outside the CG closure admits a violated CG inequality whose encoding length is polynomial in the input length. Membership is strongly coNP-complete and exact separation is strongly NP-hard. The same reduction proves strong NP-hardness of quadratic split-inequality separation, resolving a conjecture of Burer and Letchford.

fields
Optimization and Control
pdf ↗ page arXiv:2610.34053 ↗

We construct a coercive, locally Lipschitz, semialgebraic function on $\mathbb R^2$ for which BFGS with Armijo–Wolfe line search converges to a non-Clarke-stationary point from a nonempty open set of initial points and inverse-Hessian estimates. This disproves the almost-sure stationarity assertion in the 2013 challenge of Lewis and Overton. The construction and proof combine analytical arguments with computer-assisted verification of explicit inequalities.

code
github.com/LexiaoLai/Nonsmooth-BFGS-Nonstationary ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at 73f5282, checked 2026-11-05 build details
comments
23 pages, 2 figures. Verification code and Lean formalization: https://github.com/LexiaoLai/Nonsmooth-BFGS-Nonstationary
fields
Optimization and Control
pdf ↗ page arXiv:2610.34087 ↗

We study an inverse problem for iterated function systems: given maps $w_1,\dots,w_m$ on a Polish space and a target probability measure $ν$, choose the law $μ$ with which the maps are sampled so that the invariant measure $π_μ$ of the resulting Markov chain is as close as possible to $ν$ in the Wasserstein-1 distance. The minimization runs over the admissible set $A$ of sampling laws for which the chain has a unique invariant measure attracting every initial law; the maps need not be contractions. On bounded state spaces, regions certified by a Doeblin or splitting condition are convex unions of relatively open faces of the simplex, and they exhaust $A$ when the state space is finite; for affine systems with nonnegative matrices $A$ is a spectral sublevel set; in general $A$ is neither open, closed, convex nor connected. Existence of an optimal law reduces to the invariant measures left behind at the missing boundary $\mathrm{cl}(A)\setminus A$: boundary points without invariant measures of finite first moment repel minimizing sequences, which yields existence for all systems of homotheties of $\mathbb R^d$, and for compact state spaces a solution exists for every target if and only if the set of reachable invariant measures is closed; a two-state example shows that existence can fail. A search over a $δ$-net returns an $ε$-optimal law over any region on which $μ\mapstoπ_μ$ is Lipschitz and the chains are uniformly attracting, with explicit constants and, on an interval, an explicit sample size. Under contraction on average, $μ\mapstoπ_μ$ is differentiable, its derivative is injective if and only if the push-forwards $(w_i)_\#π_μ$ are linearly independent, and the objective is weakly convex, so that a projected subgradient method with inexact subgradients converges to near-stationary points.

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

The purpose of this paper is to provide a mathematically rigorous solution to a well-known problem in stochastic adaptive control, i.e., to find the weakest possible structural condition for global stabilizability of continuous-time Markov jump linear stochastic systems with known candidate modes but with an unobservable Markov parameter process. Under some regularity assumptions, it is shown that the necessary and sufficient condition for global adaptive stabilizability hinges on the solvability of the same coupled Riccati equations as in the non-adaptive case. This result highlights a fundamental difference between the continuous-time case considered here and the discrete-time case studied earlier by Xue and Guo (2001), in which the coupled Riccati equations for adaptive and non-adaptive stabilizability are different.

comments
19 pages
fields
Optimization and Control
pdf ↗ page arXiv:2610.34197 ↗

For every $n$ and $r$ with $1\le r$ and $\binom{r+1}{2}\le n$, we construct a connected unweighted graph on $n$ vertices whose Max-Cut semidefinite relaxation has a unique optimal solution of rank $r$. The main examples are the Kneser graphs $K(m,2)$, whose unique optima have rank $m-1$. A six-vertex wheel supplies rank three, and attaching pendant vertices preserves both rank and uniqueness. For dense random graphs, we also prove a polynomial lower bound on the optimal rank.

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

We study an optimal dividend policy problem under ratcheting and bankruptcy constraints. Firms face a tradeoff between the negative signal of a dividend reduction and a potential future bankruptcy. In contrast to previous works, the dividend rate is allowed to decrease after incurring a negative impact on equity valuation in accordance with a large empirical literature on the topic. We provide an explicit necessary and sufficient condition for the finiteness of the value function and prove the differentiability of the value function, and its characterization via viscosity solutions and the so-called supercontact property. The value function is given by the solution of a two-dimensional variational inequality combining optimal stopping, singular and impulse controls. We show that the problem is equivalent to a one-dimensional setup simplifying both mathematical and financial analysis. Finally, we provide a numerical study of the model and a sensitivity analysis with respect to the model parameters. We show the relevance of over-reaction to financial news on the manager's optimal policy.

comments
to appear in Finance and Stochastics
fields
Optimization and Control
pdf ↗ page arXiv:2610.34348 ↗

We consider multiblock nonconvex and nonsmooth optimization without assuming bounded iterates or coercivity of the original objective. We propose the Controlled Block Proximal Linearized (CBPL) method, which incorporates a control potential into block updates while retaining the original objective, variables, and constraints. Under explicit control design conditions and the KL property, the control yields boundedness, finite length, whole-sequence convergence of the original variables, and convergence of objective values. At the limit, one limiting subgradient of the original objective vanishes on all effective comparison directions. We apply CBPL to graph-regularized nonnegative matrix factorization (NMF), CP decomposition, and independent-core matrix tri-factorization (NMTF) with $\ell_0$ norm sparsity constraints. We characterize their reconstruction-preserving scale degeneracies, proving that scale criticality is equivalent to graph collapse and that full criticality forces such collapse. Explicit controls provide compact sublevel sets and a uniform positive lower bound on graph action, including with an independent Tucker core, while retaining genuine reconstruction-changing directions. Each block admits an explicit projection and a computable safe step parameter. For ordinary NMF and CP models, whole-sequence convergence to a full critical point follows. Experiments with direct safe updates demonstrate convergence, sustained graph action, and controlled factor and core scales.

fields
Optimization and Control
pdf ↗ page arXiv:2610.34390 ↗

We analyze stochastic mirror descent for minimizing a convex objective expressed as an expectation under the stationary distribution of a Markov chain, using noisy subgradient observations along a single sample path. Through Poisson's equation, we decompose the Markovian noise and control its contribution under regularity and moment conditions that allow the stochastic subgradients and the Poisson solution to be unbounded across the state space. We establish an $O(T^{-1/2})$ bound on the expected suboptimality gap of the weighted-average iterate for an appropriately chosen step size. The analysis does not require aperiodicity or convergence of the chain's marginal distributions to stationarity. For irreducible finite-state chains, we verify the required conditions on the Poisson solution and derive explicit bounds that quantify the effect of periodicity. For irreducible countable-state chains, we verify the required regularity and moment conditions under a geometric Lyapunov drift condition and suitable growth bounds on the stochastic subgradients.

comments
32 pages
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2610.34433 ↗

A scalar measurement can determine a robust decision without identifying the latent covariance or every decision risk. We study finite Gaussian projection experiments with a fixed mean-plus-standard-deviation target. The observation laws define a set of indistinguishable moment models. We exhibit decisions that agree throughout that set despite unidentified risk values, and give a confidence-set certificate that returns a decision or an unresolved outcome. We prove soundness, necessary abstention for indistinguishable models with incompatible optima, and a fixed-checkpoint certification guarantee. A scalar profile reduces nonlinear risk comparisons to convex inner problems. Across seven synthetic instances, jointly calibrated moment regions give sufficient budgets 21 to 52 times explicit expected-sample information lower bounds. Separately measured stopping times are lower, with zero decision errors in 1,900 simulated streams. These comparisons do not constitute matching bounds, and the guarantees require Gaussian replication.

fields
Optimization and Control
pdf ↗ page arXiv:2610.34493 ↗

When a product is sold out, customers who prefer it may buy a substitute or leave without purchasing. Efficient demand estimation in this setting is challenging when inventory is observed only at replenishments, because the stockout times, and hence the products available to each customer, are unobserved. Estimating demand efficiently under stockout substitution has been a challenging problem since Anupindi et al. (1998), and it has become more pressing as the scale of such problem instances grows thanks to innovations in retailing such as unmanned stores. We provide a complete solution to this problem for the multinomial logit (MNL) model, the most widely used model of customer choice. Using a continuous-time representation of the purchase process developed in Zhou et al. (2026), we show that the exact likelihood and its gradient are one-dimensional integrals, no matter how many products, customers, or stockouts there are. Both can be evaluated at a cost linear in the numbers of products and periods. Our method estimates demand for 2,000 products from 2,000 selling periods in under ten minutes.

fields
Optimization and Control
pdf ↗ page arXiv:2610.34547 ↗

We provide a uniform guarantee for a continuous-review lost-sales inventory system with unit Poisson demand, deterministic lead time, and fixed ordering costs: a simple algorithm computes an $(r,Q)$ policy and chooses between that policy and no replenishment, with cost at most $(\sqrt2+\sqrt6)/2<1.932$ times the unrestricted nonanticipative optimum. The algorithm starts by generating an optimal integer base-stock policy, which at zero setup cost achieves the tight worst-case factor $\sqrt2$ relative to the optimal system cost. For positive setup costs, it uses the reorder point of this integer base-stock policy and an integer lot at the economic order quantity scale. The inclusion of ordinary base stock in the continuous-review capped base-stock family also improves that family's earlier asymptotic $1.79$ upper guarantee to a uniform $\sqrt2$ guarantee valid at every finite parameter vector. To establish these guarantees, we construct a computable lower bound on the zero-setup optimal cost by tracking units already on hand or committed for delivery. We then combine it with a bound on holding and setup costs required by batching to obtain the general-setup guarantee and instance-specific performance bounds for any admissible replenishment policy. In our numerical study, the largest estimated policy-cost-to-lower-bound ratios are about $1.59$ for our heuristic $(r, Q)$ policy and $1.47$ after joint optimization of $r$ and $Q$. The heuristic also performs well against the optimized policy: over the sampled instances, its median extra cost ranges from $2.33\%$ to $3.91\%$, depending on the setup cost.

comments
57 pages, including a 28-page appendix
fields
Optimization and Control
pdf ↗ page arXiv:2610.34576 ↗

Verifying uniform observability of a linear time-varying system generally requires its state-transition matrix. This paper develops necessary and sufficient conditions that can be checked directly from the coefficient matrices for two classes of systems. For constant dynamics with real spectrum and a measurable, essentially bounded output matrix, uniform observability is equivalent to persistent excitation of the output matrix on each eigenspace. An equivalent condition requires persistent excitation of the Kalman observability stack. The second result concerns cascades with a constant observable measured subsystem coupled to a hidden state. Under uniform regularity assumptions, linear combinations of output derivatives eliminate the measured state and yield an equivalent observability test for the hidden dynamics. When those dynamics have real spectrum, the test reduces to excitation on each eigenspace intersected with the kernel of the direct measurements. An application to arbitrary-order integrator chains with measurements of ranges to fixed anchors gives an exact excitation condition for the associated lifted LTV system. A second application treats direct hidden measurements and compares the condition with existing sufficient tests.

comments
17 pages including a technical-report cover, 2 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.34581 ↗

A central limitation of modern machine learning systems is the lack of formal certificates guaranteeing their behavior beyond empirical, sample-based evaluation. Sum-of-squares (SOS) methods provide such guarantees by certifying polynomial inequalities over continuous domains via semidefinite programming (SDP). While prior work has introduced SDP layers as differentiable components in neural networks, repeated learning calls can lose the computational benefit of the forward program's sparse representation. We propose Sparse SOS Layers, differentiable value layers whose backward passes reuse the local coordinates of the forward solve. Under a fixed template and learned objective coefficients, each layer avoids building dense certificates and reuses its sparse structure across training steps. Compared with existing methods, our approach achieves up to 2.7 times speedup in total warm-call time, with nearly 100 times lower memory usage (1.7 vs. 160 GiB) for relatively large problem sizes for the tested dense parameterization. Experiments cover sparse polynomial certification, pendulum control, combinatorial relaxations, robotics projection, oscillator chains, and pose graph synchronization. A design study achieves zero certified violations across unseen problem instances and sizes, while requiring roughly 7 times fewer optimization solves than estimating gradients by perturbing the objective coefficients and re-solving the problem (finite differences). These results show that sparse certificate values can be effectively integrated into learning pipelines when the backward pass respects the verifier's structure.

comments
Accepted to NeurIPS 2026 - Main track
fields
Optimization and Control
pdf ↗ page arXiv:2610.34590 ↗

Factored gradient descent (FGD) is a scalable nonconvex method for low-rank positive semidefinite matrix recovery, in which the rank and positivity constraints are satisfied automatically by the factorization. Most of the existing theory that certifies benignity of its loss landscape, however, relies on a restricted isometry property (RIP) of the measurement map. In quantum state tomography, one of its applications, the measurements that can be acquired with stable statistics are limited by detection efficiency and drift to Pauli observables of low weight; we first show that under such partial-weight Pauli measurements RIP fails in the worst possible way. We then bundle the mutually commuting observables setting by setting, pushing the state forward to the probability distribution of each setting, and introduce a max-sliced total-variation loss. On the stratum where the setting attaining the maximum is unique there is no spurious local minimum, and provided only that the measurement map is injective on generic pure states, the global minimum is the truth up to a phase. Finally we verify these claims numerically on four qubits and compare against FGD with the ordinary loss.

fields
Optimization and Control
pdf ↗ page arXiv:2610.34696 ↗

We study linear multidimensional discrete systems of the form \[ x_α=\sum_{k=1}^m A_kx_{α-e_k}, \qquad α\in\mathbb N^m, \] with uniformly bounded boundary data prescribed on the codimension-one coordinate faces and attractivity understood in the sense of Pringsheim convergence. We first derive an explicit solution representation in terms of sums of ordered matrix products and introduce a shell decomposition whose associated sums satisfy a one-dimensional affine recursion. Our main result is a generalized Fornasini–Marchesini theorem in arbitrary dimension: asymptotic stability is equivalent to the condition \[ ρ\!\left(z_1A_1 + \cdots + z_m A_m \right)<1 \qquad \text{for every } |z_1| = \cdots = |z_m|=1. \] We then study the critical spectral boundary, where the maximal toral spectral radius equals one. We prove that a nonsemisimple unimodular eigenvalue of a toral pencil forces instability, yielding necessary spectral conditions for Lyapunov stability. In the simultaneously diagonalizable case, we obtain a complete classification of asymptotically stable, neutrally stable, and unstable systems in terms of the common eigenvalues. Finally, we show that bounds involving only the individual spectral radii can fail outside this setting: even when all coefficient matrices are nilpotent and their spectral radii sum to zero, a critical system may still be unstable.

fields
Optimization and Control
pdf ↗ page arXiv:2610.34802 ↗

We study robust network enhancement problems that improve network performance through component upgrades, where both network utilities and enhancement costs are uncertain. We consider two formulations: a lower-bound problem that improves the minimum utility across feasible network structures and an upper-bound problem that improves the maximum utility. For the lower-bound problem, we develop an exact cut-generation reformulation and identify the robust separation subproblem as a key computational bottleneck. We characterize conditions under which fractional extreme points arise in the linearized robust formulation and demonstrate that such points can be optimal. For the upper-bound problem, we derive two exact reformulations and compare the strength of their linear relaxations. To improve computational tractability, we introduce a box approximation of the utility uncertainty set that preserves solution robustness and provides explicit performance guarantees for both lower- and upper-bound problems. Computational experiments on spanning tree instances show that the proposed approximation improves computational efficiency for both problems while maintaining solution quality close to that of the exact formulations.

comments
22 pages, 2 tables
fields
Optimization and Control
pdf ↗ page arXiv:2610.34811 ↗

We present an explicit Lyapunov attitude controller for rigid spacecraft actuated by three orthogonally mounted reaction wheels, parameterized using Modified Rodrigues Parameters (MRPs), which enforces hard bounds on wheel angular momentum and applied torque at every instant without solving any online optimization. A barrier-inspired momentum feedback prevents wheel saturation; a continuous positive scalar uniformly scales the feedback whenever a torque limit would otherwise be breached, preserving Lyapunov convergence. For the regulation problem, global asymptotic stability (GAS) is established via LaSalle's invariance principle, and constraint satisfaction is proved analytically for arbitrary symmetric positive-definite inertia matrices. Replacing the barrier by an error-state counterpart extends the design to tracking, with asymptotic (though no longer global) stability and the same safety guarantees under explicit feasibility conditions on the reference. Simulations confirm convergence and constraint satisfaction, and compare performance against other controllers.

comments
Preprint accepted in CDC 2026 for presentation
fields
Optimization and Control
pdf ↗ page arXiv:2610.34922 ↗

This paper revisits the Golden Ratio Algorithm (GRAAL) of Malitsky (Math. Program. 184, 383–410, 2020) for monotone variational inequalities. The original analysis of GRAAL restricts the convex-combination parameter $c$ to $1<c\leq\varphi$, where $\varphi=(1+\sqrt5)/2$ is the golden ratio. Through a new Lyapunov analysis, we show that this range of $c$ can be extended to $1<c<3$. Further, a two-dimensional linear counterexample shows that this parameter range is sharp. In particular, for every $c\geq3$ and every positive constant step size, the iterates of GRAAL can be unbounded. Building on this analysis, we propose a simpler version of the adaptive GRAAL (aGRAAL) that requires neither a line search nor a prescribed upper bound on the step sizes, and demonstrate its convergence for locally Lipschitz cost operators over the same parameter range. For both methods, we establish an $O(1/N)$ ergodic gap bound and, under a residual-based error bound condition, prove the R-linear convergence of the adaptive iterates. Finally, numerical experiments are conducted to compare the proposed strategies with existing ones.

comments
29 pages and 20 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.34975 ↗

We study continuous-time stochastic linear–quadratic control with a scalar state and nonnegative control constraints. With quadratic running costs, randomized exploration can change the optimal mean feedback. We introduce an auxiliary problem without entropy in which the conditional policy mean is nonnegative and the covariance is prescribed in proportion to the squared state. Moment reduction and state separation yield two regional Riccati equations and characterize the finite-horizon value function and optimal conditional mean. We give a sufficient control–cost compatibility condition under which this mean coincides with the optimal feedback of the original constrained problem. For time-invariant coefficients, we characterize the undiscounted infinite-horizon optimum and establish mean square asymptotic stability under the stated assumptions. For unknown dynamics, we develop model-free actor–critic schemes for finite and infinite horizons. Numerical experiments compare the learned policies with their analytical targets and examine the effect of exploration on the optimal mean.

fields
Optimization and Control
pdf ↗ page arXiv:2610.34995 ↗

Follow the regularized leader (FTRL) is a foundational algorithm in online learning whose regret properties have been extensively studied for decades. However, in stark contrast to mirror descent—and gradient descent in particular—the convergence of FTRL to first-order stationary points in constrained nonconvex optimization was not well understood. In this paper, we show that continuous-time FTRL can fail to converge even asymptotically in infinitely smooth constrained optimization problems: its Karush-Kuhn-Tucker (KKT) gap can remain bounded away from zero indefinitely. This is especially surprising in light of the fact that continuous-time FTRL guarantees a monotonic improvement of the objective value. As a result, we establish that non-convergent behavior of no-regret dynamics—which besets general variational inequality problems—can occur even in potential systems. From a technical standpoint, our construction relies on an infinitely differentiable function where the gradient flow dynamics exhibit decelerating oscillations without ever converging pointwise, which we in turn embed into higher-dimensional FTRL dynamics that sustain a perpetually large KKT gap. We complement our negative result by showing that FTRL with Euclidean regularization does converge when the objective function is analytic. This shows that the analytic property plays a more fundamental role for FTRL than for gradient flow: it governs not only pointwise convergence, but convergence to first-order stationarity itself.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35004 ↗

This paper extends the least-squares and certainty-equivalence minimum-variance framework of classical linear self-tuning regulators to a broad class of nonlinearly parameterized systems with compact parameter spaces, including commonly used deep neural network models. First, historical nonlinear least-squares fitting guarantees are converted into online one-step prediction bounds under a general modulus of continuity, with explicit regret rates under parameter Lipschitz continuity and finite-moment noise. Second, approximate NLS estimation combined with certainty-equivalence control achieves closed-loop stability and asymptotically optimal tracking under mild conditions without requiring excitation or parameter identifiability. Explicit closed-loop regret and tracking error rates are established in the parameter-Lipschitz case, and closed-loop examples show that the regret rates cannot, in general, be improved for this regulator. Finally, robustness to small unmodeled dynamics is established by showing that closed-loop stability is preserved and the tracking error bounds comprise a vanishing term and a residual term determined by the model discrepancy.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35182 ↗

We develop and analyze multilevel gradient-regularized Newton methods for unconstrained convex optimization with Lipschitz-continuous Hessians. By computing Newton corrections in lower-dimensional subspaces, the proposed methods aim to reduce computational costs while preserving the global $\mathcal{O}\left(k^{-2}\right)$ convergence rate in function values of the full-space method. To establish this rate for multilevel methods, we introduce a class of row-nested restriction operators that ensures monotonicity of the reduced-gradient norms across levels. Numerical experiments with row-nested operators demonstrate convergence behavior comparable to full-space gradient-regularized Newton, while offering substantial computational savings on large-scale instances.

comments
28 pages, 3 figures
fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2610.35195 ↗

Modern machine learning relies on practical optimization methods that often differ from the algorithms studied in classical analyses: they train submodels, clip or normalize gradients, use layer-wise non-Euclidean directions, or approximate costly inner computations. This thesis analyzes the objective, assumptions, update, and computation defined by these procedures, rather than those of simplified proxies. For submodel training, we show that Independent Subnetwork Training can converge to a shifted fixed point because sketching before differentiation biases the update for the original objective. Model-Agnostic Sparsified Training instead incorporates the sketch distribution into its objective, which makes sketched gradients unbiased and admits convergence guarantees. For private optimization, we show that adaptive quantile clipping retains bias at any fixed quantile, while suitable quantile schedules recover near-optimal nonconvex rates under heavy-tailed noise. We then combine smoothed normalization with error compensation and obtain distributed private convergence guarantees under standard assumptions, without assuming bounded gradients. For optimizers based on linear minimization oracles, we develop and validate a layer-wise generalized smoothness model and build on it the Gluon framework for Muon- and Scion-style methods. We also show that the approximate orthogonalization in Muon matters: less precise orthogonalization calls for smaller stepsizes, so its precision should be tuned together with the learning rate. Overall, practical methods are better understood when theory retains the features that determine their optimization behavior.

comments
PhD thesis, 335 pages
fields
Optimization and Control
pdf ↗ page arXiv:2610.35209 ↗

We consider decentralized stochastic nonconvex optimization over directed networks. Push–Pull provides an efficient decentralized optimization framework for such networks, but in the stochastic setting, gradient variance can slow its convergence and complicate the analysis of linear speedup. Motivated by this observation, we incorporate recursive momentum into stochastic Push–Pull for variance reduction, yielding the accelerated stochastic Push–Pull (ASPP) algorithm. Under mean-squared smoothness, we prove that ASPP improves the convergence rate of stochastic Push–Pull and achieves asymptotic linear speedup with respect to the number of agents. To further reduce communication, we develop LASPP, a local-update variant of ASPP that allows each agent to perform multiple local updates between communication rounds. We show that LASPP achieves an additional asymptotic linear speedup with respect to the number of local steps. With a suitable number of local steps, LASPP reduces communication complexity while maintaining the same stochastic gradient complexity as ASPP. Numerical experiments on real datasets demonstrate the effectiveness of the proposed algorithms.

comments
38 pages, 4 figures
fields
Optimization and Control
pdf ↗ page arXiv:2610.35275 ↗

Coron's return method established local nonlinear controllability of a moving water tank in sufficiently large time. We study the quadratic response at uniform equilibrium, where the acceleration input in the linearized model cannot excite the Fourier modes of the fluid with even indices. At three one-way wave crossings (T=3), we construct a nonzero smooth acceleration, whose first two final-state coefficients vanish. A planar curve reduces this cancellation to a scalar identity. At this reference acceleration, two integrations give an explicit control correction that preserves the linear return and produces any given leading change in the quadratic final state. The correction maps periodic $H^r$ targets with zero mean to $H^r$ controls for every nonnegative integer $r$. A contraction argument also gives local exact solvability of the quadratic final-state equation. Finally, a time-dependent Sylvester equation provides an alternative representation of the coupling responsible for the second-order correction. The associated change of state coordinates involves one spatial derivative, while the control correction preserves regularity in appropriate Sobolev spaces. These results concern the first two variation equations and not yet the fully nonlinear model.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35319 ↗

We develop a unified framework for assortment optimization and matching under multinomial logit (MNL) choice, yielding simple algorithms and analyses across a broad class of problems. The framework centers on a single-customer assortment problem in which the firm commits to eligible products before their independent availabilities are revealed. A simple threshold policy achieves a tight $1/2$ guarantee against a benchmark that selects its assortment after observing availability and may control dependence subject to the same marginal probability bounds. This guarantee accommodates cardinality constraints and adversarial removal of excess available products. Combined with problem-specific linear programming relaxations, the framework yields $1/2$ guarantees for standard two-sided assortment optimization, customization under mixtures of MNL models, ride-hailing notifications, multi-round broadcast matching, and MNL prophet inequalities, and a $1/4$ guarantee for fully static two-sided assortment optimization. Across these applications, we improve approximation factors, extend guarantees to more general revenues and cardinality constraints, and retain existing factors against stronger benchmarks.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35389 ↗

This paper proposes a square-root clustered Lasso penalized method for high-dimensional linear regression. By integrating square-root loss with the clustered Lasso penalty, the resulting method enables flexible regression modeling and allows tuning parameter selection independent of the unknown noise level. We establish weak decomposability of the clustered Lasso penalty and a noise-level-free tuning strategy under Gaussian noise. Furthermore, we establish the finite-sample prediction accuracy guarantees for the proposed method. The inherent nonsmoothness of the square-root loss and clustered Lasso penalty poses considerable computational difficulties. To resolve this issue, we develop an efficient semismooth Newton-based proximal augmented Lagrangian algorithm (N-ALM) to solve the corresponding dual optimization problem. The subproblems arising in the iteration are efficiently tackled by the semismooth Newton method, which fully utilizes the sparsity structure of the generalized Jacobian. We further establish global convergence and a local linear rate for the distance to the KKT solution set under suitable conditions; the local rate becomes superlinear when the penalty parameter tends to infinity. We conduct numerical experiments on real-world datasets to evaluate the computational performance of N-ALM. The results demonstrate that N-ALM solves the tested high-dimensional SRCL problems accurately and substantially reduces running times compared with d-ADMM.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35390 ↗

High-fidelity digital twins in continuous biomanufacturing are often bottlenecked by incomplete kinetic models, while standard data-driven algorithms (e.g., SINDy, PINNs) lack interpretability or impose rigid physical assumptions. This paper introduces a hybrid closed-loop architecture for autonomous kinetic state-space discovery driven by a Large Language Model (LLM) agent. The framework employs a sequential "isolation-peeling" methodology across orthogonal operational regimes. This algorithmic peeling mathematically decouples entangled multiplicative (inhibitory) and additive (catalytic) biological rate law. Grounded in a Two-Level Retrieval-Augmented Generation (RAG) library, the framework utilizes Moving Horizon Estimation (MHE) and logarithmic decomposition to decouple complex cell growth kinetics into orthogonal multiplicative (inhibitory) and additive (regulatory) residual channels. When statistical degeneracy occurs an Active Design of Experiments (DoE) controller dynamically triggers targeted perturbations to decorrelate competing model hypotheses. Evaluated on a continuous stirred-tank reactor exhibiting unmodeled Haldane inhibition, Luong product toxicity, and secondary metabolite autocatalysis, the framework autonomously expanded the state space and recovered ground-truth parameters with under 6% error without a priori kinetic knowledge.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35391 ↗

The earlystage of factory layout planning has a direct effect on the operating costs, efficiency, and productivity of manufacturing systems. Conventional automated planning approaches often face a trade-off between solution quality and computational effort. Recent studies have investigated the potential of quantum annealing (QA) for solving factory layout planning problems. However, existing studies have mainly focused on individual QA-based formulations, whereas current hybrid QA solvers support multiple model types that combine QA and classical methods. To explore the potential of QA for factory layout planning, this paper benchmarks four QA based approaches implemented with the corresponding solvers, including an iterative binary quadratic model (IBQM), a hybrid discrete quadratic model (HDQM), a hybrid constrained quadratic model (HCQM), and a hybrid nonlinear model (HNLM). To improve scalability, an iterative decomposition strategy is developed for IBQM, while a candidate selection procedure is introduced for HDQM. The approaches are benchmarked against genetic algorithm, particle swarm optimization, and a hybrid tabu search and simulated annealing approach on 14 layout instances with different layout sizes, geometric complexity, spatial restrictions, and transport route configurations. The comparative analysis considers solution quality, computation time, and scalability. The results show that QA-based approaches achieve competitive solution quality and substantial computational advantages, reducing computation time by up to 94.51% relative to the classical reference methods. Among them, IBQM obtains the best solution quality in 78.6% of the instances, with a maximum improvement of 17.41% associated with an 81.34% reduction in computation time. These findings provide a basis for their further application in industrial layout planning.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35478 ↗

Constraint learning is an emerging paradigm of modeling optimization problems with the help of machine learning. In this paradigm, trained machine learning models are embedded into the optimization model. For example, we can learn constraints empirically from available data, or we can avoid using a nonlinear objective function by learning a simpler approximation for it. Neural networks become a compelling option if the machine learning models must capture more elaborate and nuanced relationships. However, optimization models embedding neural networks may become too large or too slow to solve. In this tutorial, we present practical considerations for an effective and efficient use of constraint learning with neural networks and validate it with a case study highlighting the benefit of smaller and sparser networks.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35505 ↗

We study the local stability of Wasserstein gradient descent-ascent (GDA) for entropy regularized two-player zero-sum games on noncompact domains. When one or both equilibrium measures fail to satisfy a Poincaré inequality, the spectral gap arguments underlying local exponential convergence are unavailable. we show that Wasserstein GDA converges algebraically to the mixed Nash equilibrium in chi-squared divergence, provided the initial relative density is a small perturbation in $L^2$ with bounded algebraic moments. The proof has two main ingredients: a cancellation in a negative Sobolev energy estimate, and a bootstrap argument that keeps the moments bounded uniformly in time. For polynomial-tailed equilibria, we construct perturbations supported far out in the tails that survive over diffusive time scales, which gives algebraic lower bounds on the worst-case relaxation rate. We also establish analogous local algebraic stability and lower bound results for mean-field Langevin dynamics, when the equilibrium fails to satisfy a spectral gap.

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

By virtue of the sheer compute demands of large-scale artificial intelligence (AI) and high-performance computing (HPC), modern multi-core microprocessors suffer from severe power density limits and thermal throttling, entailing an urgent need for principled methods for predictive, physics-informed dynamical thermal management (DTM). Here, we introduce a hardware/software co-design physics-informed PDE-constrained DTM throttling optimal control algorithm, ADACT (Adjoint-Driven Adaptive Co-Design Thermal Control), that minimizes thermal risk and cooling energy overhead while maximizing core execution throughput. The underlying physical temperature field is governed by a two-dimensional nonhomogeneous parabolic reaction-diffusion equation with spatially localized, time-varying power source terms and variable convective cooling subject to nonhomogeneous Dirichlet boundary conditions. We employ a discretization of the continuous state PDE via a Crank-Nicolson finite difference scheme with a 5-point discrete Laplacian operator on a uniform spatial mesh, which preserves unconditional numerical stability and $O(Δx^2 + Δy^2 + Δt^2)$ second-order temporal and spatial accuracy. To efficiently compute exact gradients, we construct and implement a continuous backward-in-time adjoint state method with L-BFGS as our optimization algorithm of choice. The accuracy and second-order convergence rates of both forward state and backward adjoint solvers are quantitatively verified via the Method of Manufactured Solutions (MMS), and gradient accuracy is validated using directional derivative Taylor tests. Numerical experiments demonstrate that ADACT dynamically throttles software power workloads and modulates hardware cooling efforts to strictly uphold physical thermal thresholds while maintaining operational throughput.

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

Quadratic programs (QPs) are a core building block in many applications. In practice, constraints are often softened with slack variables to guarantee feasibility. The standard approach tackles this by introducing additional decision variables, growing the resulting optimization problem. In this paper, we propose an Alternating Direction Method of Multipliers (ADMM) scheme for a broad class of convex slack penalty functions, including all $\ell_k$-norms, without increasing the problem size. The only change to the ADMM scheme is a modified slack projection function, while the remaining algorithm stays the same. We demonstrate our approach on numerical examples, showing significant speedups, and show its flexibility on an energy optimization problem.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35631 ↗

One of the main challenges of federated learning is heterogeneous data split among the clients, leading to biased local updates called client drift. The SCAFFOLD algorithm (Karimireddy et al., 2020) corrects client drift with control variates, but its relation to the similarity of client data is not yet fully understood: the original similarity-based guarantees cover only quadratics with a stronger second-order similarity assumption, and a follow-up weakly convex analysis (Luo et al., 2025) obtains a $\sqrt{Lδ}$ dependence for $L$-smooth losses with averaged Hessian similarity $δ$. We analyze SCAFFOLD with minibatch-based control variates and establish linear dependence on Hessian similarity beyond quadratics, for both convex and nonconvex objectives. In particular, for convex objectives with exact gradients, $R$ SCAFFOLD rounds with $K$ local steps lead to an objective gap of order $(L/K+δ)D_0^2/R$, where $D_0$ is the initial distance to a minimizer. When $K=Θ(L/δ)$, it improves the minibatch SGD rate by a factor $Θ(L/δ)$. For nonconvex objectives, we prove an analogous stationarity guarantee under uniform Hessian similarity for a client-selection variant. In both settings, we extend these guarantees to stochastic gradients and prove matching lower bounds for the analyzed methods with constant local stepsizes. We also show that, under partial participation, even identical clients need not obtain the full communication benefit of additional local steps.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35663 ↗

Sharing information can help coordinate supply chain decisions in response to market shocks. Yet, firms must weigh these benefits against the risk of strengthening competitors. We study when competing firms voluntarily join an information-sharing platform to exchange information about market shocks while retaining operational autonomy. Firms differ in information capabilities and decide whether to participate before private signals are realized, creating stochastic information asymmetry. We model participation and quantity decisions as a two-stage dynamic game with incomplete information. For two horizontal competitors, we derive closed-form equilibrium participation strategies that reveal how information power and production efficiency shape participation. Numerical analysis examines more complex supply chain networks. We find that supply chain characteristics impact participation and the level of information asymmetry is a key factor in the equilibrium platform profiles. Firms with similar information power may benefit from joining forces to reduce their competitive disadvantage against higher information power competitors. Cost-inefficient firms may be less willing to participate because their competitors can exploit shared information, and uncertainty can serve as a competitive shield by restricting the actions of more efficient competitors. However, when several competitors join the platform, a cost-inefficient firm may also choose to participate to avoid an informational disadvantage.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35681 ↗

Estimating travel behavior parameters is essential for understanding current travel patterns and for forecasting how travelers may respond to future changes in transportation systems. However, reliable estimation remains difficult when behavior must be inferred from sparse and aggregate observations, especially when jointly recovering several behavioral components. In this paper, we develop a bi-level estimation program for a combined destination, mode and route choice model with congestion. The inner level is a convex program at given scale parameters, and returns the taste coefficients as its dual variables together with the equilibrium travel pattern. The outer level selects the scale parameters by out-of-sample prediction, measured by how well the modeled travel pattern predicts observations withheld from estimation. To solve the bi-level problem at scale, we propose a matrix-free Hierarchical Lagrangian Dual algorithm as the inner solver and an outer search by implicit differentiation, which uses the sensitivities of the inner solution to enable efficient search over the scale parameters and reaches the calibrated scales in a handful of iterations. We validate the approach on Los Angeles County using public origin-destination, mode-share and traffic-count data. Our approach scales to a county-level problem with 2.7 million variables and substantially improves computational efficiency over a general-purpose conic solver. Compared with the fixed-scale benchmark, the calibrated model improves predictive performance at the destination and mode levels, with consistent gains across complementary goodness-of-fit measures.

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

A stochastic proximal-gradient method is proposed and analyzed for solving regularized optimization problems subject to nonlinear equality constraints and nonnegativity bounds. The objective function's values and gradients are available only through inexact stochastic oracles. The method decomposes each trial step into one component that reduces linearized infeasibility and a second component that seeks optimality while preserving that reduction. Trial steps are accepted or rejected through a relaxed sufficient decrease condition subject to stochastic merit function evaluations. Without assuming unbiasedness of stochastic gradient estimates, it is proved under reasonable assumptions that the method reaches an $ε$-KKT point within $O(ε^{-2})$ iterations with high probability. This guarantee further implies almost-sure termination in finitely many iterations and an $O(ε^{-2})$ bound on the expected iteration complexity.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35752 ↗

We consider a stochastic optimal control problem arising in the operation of industrial air-conditioning systems with delayed activation effects. The delayed transition between inactive and operational regimes induces a non-Markovian structure in the controlled dynamics. We derive a regression-based discrete dynamic programming algorithm on nested state-control grids. We give a probabilistic proof of convergence of the idealized time-discrete dynamic programming problem to the continuous-time value function. Numerical experiments based on calibrated multidimensional forecast-tracking Ornstein–Uhlenbeck models illustrate the effectiveness of the proposed methodology.

fields
Optimization and Control
pdf ↗ page arXiv:2610.35811 ↗

Probability51

We consider two linked problems for ranked choice elections: building a compact summary of a preference profile $P$, and generating synthetic profiles that resemble $P$ in key ways. We introduce a Markov model based on which candidate names follow which on observed ballots and record this in a succession matrix on candidates together with a start/stop symbol. This provides the basis for new ``autocomplete'' methods for generating synthetic profiles, with ballot length that can be tuned to a target. We compare succession-based generation to parallel use of summaries built from positional frequencies and head-to-head comparisons. To execute this comparison, we introduce new descriptive statistics of profiles that allow new tests of whether synthetic profiles are realistic. In experiments on Scottish ranked-choice profiles, succession-based generation captures held-out ballot structure well, performs especially strongly when completing partial ballots, and often preserves election outcomes, outperforming the alternatives on all counts. Finally, we study the dynamics of iterating the train-and-generate process.

fields
Probability
pdf ↗ page arXiv:2610.33035 ↗

The Gaussian Mixture Model (abbrv. GMM) is a classic generative model for clustered data, for which spectral clustering based on dimension reduction via PCA has been an effective framework. In this work, we investigate kernelised covariance matrices as an alternative mechanism for dimension reduction and spectral clustering, focusing on truncation kernels that select pairs of data points with suitable separation constraints. The structure of these matrices is motivated by considerations from statistical mechanics of repulsive particle systems. Our approach is particularly relevant for the setting of imbalanced clusters, where the sizes of the largest and smallest clusters have a diverging ratio with the problem size, and existing PCA-based methods turn out to be of limited effectiveness. We demonstrate efficient dimension reduction and clustering performance of these modified covariance matrices, substantiated by quantitative bounds. In particular, they achieve superior dimension reduction guarantees compared to PCA for a wide range of parameters in the regime of imbalanced clusters. For spectral clustering, our approach exhibits improvements over PCA in the imbalanced setting, in particular guaranteeing accurate clustering in a much larger regime of intra-cluster separations. Our theoretical guarantees reflected in a range of simulation experiments that exhibit these improvements for unbalanced clustering problems. Our analytical approach, based on kernel Laplacians, provide a toolbox as well as a relevant conceptual ingredient for clustering problems at large. We believe that our work will motivate the application of such kernelised covariance matrices for related classes of statistical problems, as well as spur new investigations in the theory of random matrices.

fields
Probability, Spectral Theory
pdf ↗ page arXiv:2610.33177 ↗

We solve the problem posed by Erdős and Rényi in $1961$ about the limiting distribution of the number of draws $T_{n,m}$ that a coupon collector needs to complete $m$ collections of $n$ distinct types of coupons, when $m$ increases with $n$. For fixed $m$, Erdős and Rényi proved that $\mathbb P(T_{n,m}\leq n\log n+(m-1)n\log\log n-n\log (m-1)!+θn)$ converges to $ \mathcal G(θ)$, for every $θ\in \mathbb R$, as $n \to \infty$, where $\mathcal G$ is the standard Gumbel distribution function, and they asked what happens when $m=m(n)$ increases with $n$. We give a complete answer to this question. More precisely, for every increasing sequence $m=m(n)$, we determine explicit sequences $t_{n,m}$ and $w_{n,m}$ satisfying $w_{n,m}/t_{n,m}\to0$ such that $\mathbb P(T_{n,m}\leq t_{n,m}+θw_{n,m})\to\mathcal G(θ)$ for every $θ\in\mathbb R$. We also determine the corresponding asymptotic behavior of $\mathbb E[T_{n,m}]$. To prove these results, we present a methodology, inspired by Poissonization, that can be applied to determine the asymptotic behaviors of standardized hitting times of discrete-time stochastic processes.

fields
Probability
pdf ↗ page arXiv:2610.33199 ↗

Let $S_1,S_2,\dots$ be a random walk in $\mathbb R^d$ with independent identically distributed increments. We show that, for every distribution of the increments and for every $n\ge1$, \[ \mathbb P\bigl[0\notin\mathrm{conv}(S_1,\dots,S_n)\bigr] = \sum_{m=1}^n\frac1{m!}\sum_{\substack{k_1,\dots,k_m\ge1\\ k_1+\dots+k_m=n}}\frac{1}{k_1\cdots k_m}\,\mathbb P\bigl[0\notin\mathrm{conv}(S^{(1)}_{k_1},\dots,S^{(m)}_{k_m})\bigr], \] where $S^{(1)},S^{(2)},\dots$ are independent copies of the walk. No symmetry, general position or moment assumptions are needed. The result rests on a deterministic identity: for arbitrary vectors $x_1,\dots,x_n$, the number of orderings for which the convex hull of the partial sums avoids the origin equals the number of permutations for which the convex hull of the cycle sums avoids it. We derive it from a permutation-averaging identity for valuations obtained in our earlier work. Consequences include the identities of Sparre Andersen and Spitzer, the distribution-free absorption probabilities of Kabluchko, Vysotsky and Zaporozhets, their generating function found by Petrov, Randon-Furling and Zaporozhets, and a formula for the probability that the origin is never absorbed.

fields
Probability, Combinatorics, Metric Geometry
pdf ↗ page arXiv:2610.33216 ↗

Let $(g_{k})_{k \geq 1}$ be a sequence of independent and identically distributed matrices with law $μ$ on $\mathrm{GL}(d,\mathbb{R})$, where $d\geq2$ is an integer. Suppose that the closed semigroup generated by the support of $μ$ is strongly irreducible and proximal and that the polynomial moment of order $2+δ$ is finite, where $0<δ\leq 1$. We establish a Berry-Esseen bound of order $n^{-δ/2}$ for $\log \| g_{n} \cdots g_{1} v\|$, where $v$ is a nonzero vector in $\mathbb{R}^{d}$ and $\|\cdot\|$ is an arbitrary norm on $\mathbb{R}^{d}$. As an application, we also obtain a Berry-Esseen bound of order $n^{-δ/2}$ for $\log \| g_{n} \cdots g_{1}\|$, where $\|\cdot\|$ is any matrix norm. The proof combines an $m$-dependent approximation with Stein's method. The argument uses identities for exchangeable pairs constructed by resampling individual matrices, together with a concentration inequality for sums of the approximating variables.

fields
Probability
pdf ↗ page arXiv:2610.33342 ↗

Let $M_n$ be an $n\times n$ random matrix with entries in $\{-1, 0, 1\}$, where each row is independently and uniformly sampled from the set of all vectors in $\{-1, 0, 1\}^n$ containing exactly $d$ nonzero entries, with $d=pn$ for some fixed constant $p\in(0,1/2]$. A recent result by one of the authors gives a lower bound of order $n^{-1/2}$ for the smallest singular value $s_n(M_n)$ of this model with high probability. In this paper, we establish a matching upper bound for $s_n(M_n)$. Specifically, there exists a constant $C_p>0$ depending only on $p$ such that \[ \forall \varepsilon >0 \qquad \mathbb{P} \left( s_n(M_n) \le \frac{\sqrt{d}}{\varepsilon^2 n} \right) \ge 1-C_p\left(\varepsilon + \frac{1}{\sqrt{d}}\right). \] Consequently, in the dense regime, the smallest singular value $s_n(M_n)$ of signed random combinatorial matrices is typically of order $n^{-1/2}$.

fields
Probability, Combinatorics
pdf ↗ page arXiv:2610.33427 ↗

We investigate the path space large deviation principle (LDP) for a class of interacting particle systems on a fixed finite discrete torus. As an illustrative example, we use the partial exclusion process with maximal occupation of $s$ particles. We first verify the standard Kurtz-type law of large numbers for the original and tilted processes, thereby identifying the deterministic flows around which the large deviations are formulated. We then establish the path space LDP, with speed $s$, and identify the associated rate function in variational form as the Legendre transform of a nonlinear Hamiltonian. The proof relies on martingale techniques, exponential tightness, and a change-of-measure argument based on exponential tilting, which renders atypical trajectories typical under a modified dynamics. We also explain how the same strategy extends to further interacting particle systems. The inclusion process illustrates the conservative non-compact finite-jump case. The harmonic process is qualitatively different: a single transition may move a variable number of particles, and the limiting Hamiltonian is logarithmic with a non-trivial domain. This places the harmonic process outside the usual finite-reaction framework for density-dependent Markov jump processes. Finally, we discuss continuous-state energy-exchange models, such as the Brownian energy process and an integrable heat-conduction model, to indicate how the same Hamiltonian large-deviation formalism appears beyond discrete-state particle systems.

comments
32 pages
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2610.33524 ↗

In this paper we prove that if a Wiener functional $F$ is $1+δ$-differentiable in the Malliavin sense for some $δ>0$ and satisfies the nondegeneracy condition, then the density of the law of $F$ exists, is bounded and is Hölder continuous of every exponent $β<δ$. This gives a partial positive answer to a problem proposed by Watanabe [13]; to date, this seems to be the best result available for the boundedness of the density of Wiener functionals. The approach is based on the fractional order Sobolev spaces associated with a probability measure and on the Riesz transform.

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

We consider a one-dimensional random walk $S_n$ with i.i.d. integer-valued increments having zero mean and finite variance. Under suitable moment assumptions, we derive asymptotic expansions for the local probabilities $\pr(x+S_n=y,τ_x>n)$, where $τ_x=\inf\{n\ge1:x+S_n\le0\}$. These extend previous expansions for walks started at zero to arbitrary starting points. We obtain different expansions according to the sizes of the starting point and endpoint relative to $\sqrt n$.

comments
36 pages, no figures
fields
Probability
pdf ↗ page arXiv:2610.33612 ↗

We study the moments of sample covariance matrices $M_{n,k,m}$ formed from independent $k$-fold tensor products of $n$-dimensional random vectors. The base vectors have independent and identically distributed centered complex entries with unit variance and finite moments of all orders. For every fixed $p \in \mathbb N_+$, under suitable moment conditions, we obtain an asymptotic formula for $p$th moment as $n, k, m$ tend to infinity with $m/n^k \to c \in (0,\infty)$. There is no restriction on the growth rate of $k$ relative to $n$. We also prove a variance bound and obtain the corresponding almost sure asymptotic formula. The results recover known limiting moments in several regimes. When $k/n$ tends to infinity and the modulus of base vector entry is not constant, we establish the asymptotic growth rate for the $p$th moment of normalized matrices. In this regime, we also provide a lower bound for the growth rate of the largest eigenvalue.

comments
32 pages
fields
Probability
pdf ↗ page arXiv:2610.33687 ↗

The covariance of Brownian motion is the Green kernel of the one-dimensional Laplacian with a pinned left endpoint and a free right endpoint. This correspondence between Green's functions for the Laplacian on an interval and Brownian covariance functions turns out to be a general phenomenon. We use this correspondence to organize Brownian-derived Gaussian processes by three operations: choosing a self-adjoint realization, recentering a path, and conditioning a fixed law. Local Robin and selected nonlocal boundary conditions yield a catalogue of twelve processes with closed-form kernels, Brownian-path constructions, spectra and traces. The periodic and Neumann-Neumann realizations annihilate the constants; projecting the source and imposing zero time average selects the corresponding covariance pseudoinverses. Recentering and conditioning can both give a Brownian path zero time average, but the resulting laws differ: a constraint alone does not specify a process. A rank-one conditioning identity gives a scale-invariant criterion for the covariance effect of a shrinking family of observations. For Brownian finite differences of any fixed positive order, the covariance effect vanishes uniformly as the spacing tends to zero. For $m$-fold integrated Brownian motion, derivative constraints of orders $1,\ldots,m$ remain detectable at interior times. For simulation, we identify which grid constructions are exact and which are approximate.

comments
59 pages, 19 figures
fields
Probability
pdf ↗ page arXiv:2610.33747 ↗

We provide axiomatic characterizations of Jensen-gap functionals, which have the form $ρ(X)=\mathbb{E}[f(X)]-f(\mathbb{E}[X])$ for some real-valued function $f$ called the generator. This class includes important examples such as the excess growth rate, the utility premium, the Kullback-Leibler (KL) divergence, and the variance, and is also closely related to measures of variability. We analyze various forms of convexity for Jensen gaps. To characterize Jensen gaps, we formulate conditional versions of law-invariant functionals, which are needed to state the decomposition principle. On an atomless probability space, we show that law invariance together with a binary decomposition principle is sufficient to characterize Jensen gaps on simple random variables. Under suitable continuity conditions, the characterization extends to broader classes, including compactly supported random variables and integrable random variables. We then identify the generator $f$ by imposing either of two natural invariance conditions: scaling invariance or translation invariance. The former identifies logarithmic, $x\log x$, and power generators, whereas the latter identifies exponential and quadratic generators.

comments
41 pages
fields
Probability
pdf ↗ page arXiv:2610.33786 ↗

We study the efficiency–complexity tradeoff for resource-limited agents through directed first-passage percolation. Nonnegative i.i.d. edge weights represent physical energy expenditure, while the logarithmic size of a constrained path family measures representational complexity. For translation-invariant families, a path-joining property yields deterministic large-distance costs in rational directions and joint convexity in constraint parameter and direction, under suitable moment and feasibility assumptions. Our main result concerns the limiting cost parameterized by path-family entropy. Using techniques from analytic combinatorics in several variables (ACSV), we establish its almost-sure existence and joint continuity in entropy and direction for nested families satisfying additional generating-function conditions, on the corresponding entropy range. Path-count asymptotics supply the change of parameter linking this cost to the constraint-parameterized cost. Two planar examples constrain the number of turns or the number of East-runs of length at least two.

comments
27 pages, 2 figures
fields
Probability, Combinatorics
pdf ↗ page arXiv:2610.33864 ↗

We study two path functionals of a branching random walk at an exponential normalization. For centered integer displacements bounded above by one, we construct on survival one ray whose local time at every large spatial level is bounded below by a positive multiple of the square of that level. For displacements in $\{-1,0,1\}$, overlapping forward profiles give a single ray with lower coefficient $4t/(σ^2j_{1,1}^2)$, where $σ^2$ is the tilted variance and $j_{1,1}$ the first positive zero of $J_1$. The profile energy quotient is optimized exactly. For discounted marked path sums with real displacements, we prove critical-moment sufficiency without a drift assumption, and necessity under a finite ascending-ladder mean and a weighted sibling moment. At positive tilted drift, a stopping-line argument replaces the sibling condition by an $L\log L$ hypothesis. A sparse mark construction identifies an exact universality obstruction in the constant-displacement subclass. At negative tilted drift, weighted powers give explicit sufficient logarithmic-tail conditions for every exponent $t>0$ and examples excluding a universal critical-moment converse. Under our sufficient conditions, path sums converge uniformly and attain their maxima. The exact optimal persistent local-time constant and a general negative-drift converse remain open.

fields
Probability
pdf ↗ page arXiv:2610.33897 ↗

We determine joint zero-count fluctuations of the self-dual weighted Szegő Gaussian analytic function in fixed and thinning annuli. For a fixed annulus, the counts near its two boundary components converge jointly to independent standard normal variables after centering and marginal normalization, at arbitrary relative rates of boundary approach. This answers the simultaneous central limit question of Katori and Shirai for this model. The unscaled covariance converges to a negative constant, which we evaluate in complete elliptic integrals. A sharp variance asymptotic for the difference between an annular winding number and its coupled disk count yields quantitative normal approximation bounds. For thinning annuli with inner radius $q=e^{-h}$, the counts in every fixed finite family of interior transverse bands converge jointly to a Gaussian vector after centering and multiplication by $\sqrt h$. We give its spectral covariance matrix, prove strict negative covariance for disjoint bands, and identify its nullspace from the interval indicators. The fixed-annulus proof couples the Laurent series to two independent Gaussian power series. For thinning annuli, we combine exact periodization of a strip kernel, a uniform Laguerre-chaos tail bound, and connected Gaussian diagrams.

comments
34 pages
fields
Probability, Complex Variables
pdf ↗ page arXiv:2610.34229 ↗

For any fixed number $k\ge3$ of independent volume-sampled sites in the unit-area Brownian map, we represent the negative-power transform of their ordinary Voronoi volumes as a finite sum of marked planar scheme integrals. These integrals arise from the critical asymptotics of generating functions for face-constrained labelled planar maps. To connect them to Voronoi volumes, we use Miermont's zero-delay correspondence to interpret the labelled maps as quadrangulations with distinguished sites and then pass to the Brownian map scaling limit.

fields
Probability
pdf ↗ page arXiv:2610.34255 ↗

We establish a functional central limit theorem (CLT) for fluctuations of time-integrated functionals of empirical measures arising from interacting McKean–Vlasov particle systems. Our framework allows for coefficients with unbounded spatial growth and dependence on arbitrarily high-order moments of the measure variable, extending the scope of the existing fluctuation theory. The proof uses a novel approach combining linear functional differentiation with new well-posedness results and estimates for perturbed backward parabolic equations in polynomially weighted Schauder spaces, yielding a martingale-type representation of the fluctuations with an asymptotically negligible remainder. The limiting process is shown to be centred Gaussian with an explicit covariance structure. As a statistical application, we derive the asymptotic theory underlying hypothesis tests for both the temporal constancy of population characteristics and parametric restrictions on the drift coefficient.

comments
35 pages
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2610.34347 ↗

We study critical holomorphic multiplicative chaos with circular iid inputs of unit variance. Writing $R=|X_1|$, we prove that the radially normalized boundary measures converge in probability to a finite measure with almost surely positive mass if and only if $\mathbb{E}[R^2\log(2+R)]<\infty$; otherwise they converge to zero. We obtain distinct sharp criteria for convergence at each fractional order $0<q<1$ for radial approximations and for the full Fourier-radial family. Convergence at every such order is equivalent to an exponential-moment radius of at least two. In the positive-limit class, coefficient vectors normalized by $(\log n)^{1/4}$ and their analytic windows converge stably to Gaussian mixtures determined by the same critical measure. This measure is nonatomic, has full support, and is carried by a set of Hausdorff dimension zero. Coefficient periodograms recover the measure, while scalar and matrix energy normalizations give universal Gaussian limits. Exact weighted tails under $\mathbb{E} I_0(2R)<\infty$, where $I_0$ is the modified Bessel function, and negative mass moments distinguish uncountably many coefficient-limit laws, even modulo deterministic scalar rescaling, within a uniformly bounded input family. This disproves the common-law clause of Gu-Zhang's Question 2 at its fixed normalization. We give conditions for convergence of the original coefficient moments and show that finiteness of the limiting moments alone does not suffice. For inputs with $\log\mathbb{P}(R>u)\sim-λu^α$, $0<α<1$, the coefficient normalization and Gaussian-mixture form persist, but the limit has no finite positive moments; we determine its logarithmic tails. Finally, we prove Hardy nonmembership under finite variance alone and, in the positive-limit class, sharp weighted Bergman criteria for $0<p\le2$ and the boundary Sobolev threshold $s=-1/2$.

comments
82 pages
fields
Probability
pdf ↗ page arXiv:2610.34371 ↗

We construct stationary measures of the multispecies ASEP on the positive half-line, with injection of highest-priority particles at the left boundary, using vertex models. Our results extend existing constructions of Martin and Aggarwal-Nicoletti-Petrov for the full-line ASEP to the half-line. For the two-species process, we compute the joint distribution of occupation colors at the first two sites. We also partially address the connection with the half-space ASEP speed process.

comments
67 pages, 22 figures, preliminary version
fields
Probability, Mathematical Physics, Combinatorics
pdf ↗ page arXiv:2610.34530 ↗

We show, under a smoothness assumption, that probability measures whose exponential tilts have a uniformly bounded variance are given by a strongly convex potential, up to a bounded perturbation, yielding a partial converse to the Bakry-Émery theorem combined with Holley-Stroock's perturbation principle. A stronger version enforcing uniform convexity of the potential is obtained by considering the low-temperature regime.

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

A robot searching for the source of an odor must eventually answer a deceptively hard question: have I arrived? Near the source, concentration gradients flatten, turbulence makes the signal intermittent, and a small robot often lacks the positional accuracy to map the plume. Here, we describe a lightweight remedy inspired by a World War II statistics conundrum: the German tank problem. To approximate enemy armament production, Allied analysts developed an estimator based on serial numbers from captured tanks. Analogously, we use the same procedure over sampled chemical sensor readings from a robot to create estimates for the peak concentration of an odor plume, and therefore the odor's source. Treating each sensor reading as an observation, our unbiased estimator needs only a running maximum and a sample counter. An exact confidence bound turns both numbers into a principled rule that the robot or UAV can use to determine whether to keep searching for the plume source or land. We derive the estimator and its bound, demonstrate its sample efficiency, and examine its robustness even when its assumptions fail. Finally, we summarize the estimator's role as the termination criterion for olfactory navigation.

comments
8 pages
fields
Probability, Statistics Theory
pdf ↗ page arXiv:2610.34583 ↗

We prove a good large deviation principle for chordal $\mathrm{SLE}_κ(W_1-2;W_2-2)$ with force points at $0^-$ and $0^+$, for every fixed $W_1,W_2>0$, as $κ\downarrow0$. The topology is Hausdorff convergence of the entire compact trace. The rate has two equivalent descriptions: the sum of the component wedge energies obtained by cutting a deterministic ambient wedge, and the Loewner driving energy relative to the force-point drift.

comments
44 pages
fields
Probability
pdf ↗ page arXiv:2610.34630 ↗

Redundant context affects attention through two distinct mechanisms: repeated items add normalization mass, while score variation within correlated groups can produce extreme individual scores. We separate these effects in a planted retrieval model with exponentially many Gaussian distractors arranged in known, exponentially large clusters. The model is a two-level generalized random energy model, whose classical free energy yields exact retrieval thresholds. Gaussian interpolation further shows that increasing positive correlation at fixed token count lowers the distractor free energy, unlike adding duplicates. Our main result identifies a sharp limitation of subtracting log cluster size from pre-softmax scores: this correction removes multiplicity but retains within-cluster extremes. Even a temperature chosen after observing all scores cannot lower the required signal below $\sqrt{2α_1}$, where $α_1$ is the exponential rate of the number of clusters. Averaging scores before exponentiation instead suppresses these fluctuations and achieves $\sqrt{2ρα_1}$, where $ρ$ is the within-cluster correlation. The gap persists after adding exponentially many singleton distractors, so group size alone does not identify the target, and extends to fixed finite hierarchies of light-tailed independent-increment scores. Finite-sample, stability, and participation results complement the asymptotic analysis. A controlled retrieval experiment with frozen sentence embeddings supports this distinction while delineating its scope: averaging helps when the relevant item is a singleton, but can discard useful evidence when a relevant group contains multiple matching items.

comments
29 pages, 2 figures, 3 tables
fields
Probability
pdf ↗ page arXiv:2610.34682 ↗

We consider symmetric $α$-stable Dawson–Watanabe superprocesses on $\mathbb R^d$ for every $d\geq1$ and $0<α<2$, started from an arbitrary nonzero finite measure. We prove that, almost surely, the times at which the spatial support is compact and nonempty have Hausdorff dimension one in every nontrivial interval before extinction. We also prove that, almost surely, the times at which the support is contained in any prescribed neighborhood of the extinction point have Hausdorff dimension one in every nontrivial interval ending at extinction. These results extend the corresponding conclusions for $0<α<2/3$ to the full stable range. The key new ingredient is a uniform zero-set theorem of independent interest for Feller branching diffusions started from zero with deterministic continuous cumulative immigration. It shows that sufficiently small total immigration ensures that the zero set on a prescribed open interval has Hausdorff dimension arbitrarily close to one, with arbitrarily high probability. The estimate is uniform over the immigration profile and allows singular continuous immigration measures.

fields
Probability
pdf ↗ page arXiv:2610.34757 ↗

In this paper we examine various sequences $(X_n)_{n \in \mathbb{N}}$ of real random variables arising naturally in connection with certain combinatorial structures. The goal is to investigate sufficient conditions for convergence to the standard normal distribution upon centering and normalization. By studying signed binomial sums, Stirling numbers of both kinds, and factorial moments, we obtain certain cancellations in the computation of centred moments $\mathbb{E}[(X_n - \mathbb{E}[X_n])^k]$. This allows us to conclude that $\frac{X_n - \mathbb{E}[X_n]}{\sqrt{Var \ X_n}} \xrightarrow{d} N(0,1)$ when the factorial moments $\mathbb{E}[(X_n)_k]$ are rational functions satisfying some simple conditions on the coefficients. A particular class of such random variables are those whose factorial moments are products and quotients of falling factorials in $n$; we apply our result in this situation and we discuss specific examples arising from block statistics of $k$-divisible non-crossing partitions and from outdegree statistics of rooted plane trees with $k$-divisible outdegrees.

fields
Probability
pdf ↗ page arXiv:2610.34775 ↗

We study the one-dimensional stochastic Landau-Lifshitz-Gilbert equation with a regularised, multiplicative, degenerate trace-class noise of strength sqrt(eps), the regularisation being Q_delta^{1/2} = (I + delta A^{beta/2})^{-1}, A = -d^2/dx^2, beta > 3/2, and determine the exponential rate of thermally induced magnetisation reversal. (i) Uniform large deviations at fixed delta: for every delta > 0 the solution satisfies a large deviation principle on C([0,T];H), with a good rate function, uniformly in the initial datum over a V-bounded set with compact H-closure; no non-degeneracy of the noise is assumed. (ii) Removal of the regularisation: as delta tends to 0 the noise tends to space-time white noise. With U_delta the state-space quasi-potential and U_0 that of the limiting control problem (Q_0^{1/2} = I), U_delta converges to U_0 in the Gamma-sense, and the barrier is delta-independent: the infimum of U_delta over the boundary of D equals that of U_0 and equals c_* times the infimum of the micromagnetic energy E over that boundary, c_* = 2 lambda_2/(lambda_1^2 + lambda_2^2), under two structural assumptions only and with no geometric or transversality input. Pointwise convergence fails, so the Gamma-limit is the sharp form of the statement. (iii) Neel-Arrhenius law: combining (i) and (ii) with the classical exit-time theorem, the escape time tau from D = {E < r} satisfies both levels of the law - for every fixed delta > 0, eps log E[tau] converges, uniformly on compact subsets of the initial set, to the barrier, and lim_{delta->0} lim_{eps->0} eps log E[tau] = c_* times the infimum of E over the boundary of D. The Arrhenius exponent is therefore stable under the regularisation of the noise and is determined by the micromagnetic energy alone.

comments
92 pages. No figure
fields
Probability, Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2610.34823 ↗

We study how stationary variance is distributed among the principal components of a randomly coupled linear system near instability. The coupling matrix has entries $N^{-1/2}ξ_{ij}$, where the $ξ_{ij}$ are independent copies of a bounded, centered real random variable of variance one. As $N\to\infty$ and the excess damping $δ_N\to0$, we prove that the covariance spectrum, with eigenvalues rescaled by $δ_N^2$ and weighted by their shares of the total variance, converges in probability to an explicit beta-product law. The convergence holds throughout $δ_N\ge N^{-1/2+\varepsilon}$ for every fixed $0<\varepsilon<1/2$. The law describes eigenvalues of order $δ_N^{-2}$ at ranks of order $Nδ_N^{3/2}$. Its limiting rank profile decays as $r^{-4/3}$ at large normalized rank and determines how many principal components retain a prescribed fraction of the stationary variance. The proof combines an exact computation of planar moments, uniform estimates for growing matrix words that accommodate nonsymmetric entry distributions, and resolvent bounds controlling the contribution of long times.

comments
45 pages, 1 figure
fields
Probability
pdf ↗ page arXiv:2610.34920 ↗

Existence and uniqueness of solutions to non-linear forward integro-differential equations related to distribution-dependent Markov jump processes is established under standard boundedness and Lipschitz conditions.

fields
Probability
pdf ↗ page arXiv:2610.34980 ↗

We study the skew-adjoint Hilbert–Schmidt operator obtained by evaluating a fixed Hilbert two-form on a centered Gaussian linear map whose covariance is the inner product on its domain multiplied by a fixed nonnegative trace-class operator. We compute the expected regularized determinant of the resulting random operator and compare the random determinant with this expectation by dilation of the scalar parameter. For each fixed covariance and two-form, a single dilation almost surely applies to every nonnegative parameter value and yields simultaneous bounds for all Schatten norms and quasi-norms of orders $0<p<2$. The least admissible dilation satisfies a universal weak-$L^1$ estimate with optimal tail exponent. For Wiener area, a rank-one perturbation identity identifies the mean determinant with the regularized determinant of an explicit deterministic skew-adjoint operator and reduces Schatten membership to conditions on the covariance eigenvalues. Consequently, for each $0<p<1$, the area belongs almost surely to the Schatten class of order $p$ if and only if the covariance of the Wiener process does. At $p=1$, the criterion is finite covariance entropy; for $p>1$, trace-class covariance suffices.

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

We determine the optimal rates of convergence in the local and central limit theorems for the one-dimensional elephant random walk in the diffusive and critical regimes, $0\le p\le3/4$. For every fixed initial distribution, we treat both exact finite-time centering and standardization and the normalization $S_n/\sqrt n$ (or $S_n/\sqrt{n\log n}$ at criticality). We establish uniform Edgeworth expansions for local probabilities and distribution functions, and use these expansions to derive the optimal convergence rates, which exhibit several phase transitions depending on the symmetry of the initial distribution, the normalization, and the type of approximation. Our approach uses elephant polynomials for precise characteristic-function expansions and a random recursive tree representation for global Fourier bounds.

comments
47 pages, 2 tables
fields
Probability
pdf ↗ page arXiv:2610.35019 ↗

We establish a martingality criterion for the Exponentially Fading Memory (EFM) signature volatility model, extending the recent result of Abi Jaber, Gassiat, and Sotnikov (2026). In the proposed framework, the volatility process is given by a linear functional of the EFM signature of a time-augmented Brownian motion, which yields a globally well-behaved, fully non-Markovian volatility model admitting a stationary distribution. The stationary EFM signature volatility model is also covered by allowing for a random initial value of the signature. Moreover, the volatility process can be adjusted to the initial forward variance curve. For this model, excluding trivial cases, we prove that the price process is a true martingale if and only if the truncation order is odd and a sign condition involving the correlation parameter holds.

fields
Probability
pdf ↗ page arXiv:2610.35022 ↗

In this paper, a stochastic model of an overcrwoded emergency department (ED) with two levels is analysed. A patient care pathway consists of a first consultation, followed by diagnostic tests and then a discharge consultation. The first level includes the patients before or during the first consultation. The second level applies to patients currently undergoing diagnostic tests, and patients waiting for or attending a second consultation. Each level has limited capacity; thus, when the second level is full, patients must remain at the first level. One of the key features of this model is the fact that first and second consultations are handled by the same pool of emergency physicians, which means that their decision to prioritize level 1 or level 2 affects the behavior of the system. Under a scaling assumption, the evolution of the number of patients in each step of the pathway is investigated. It is shown that, depending on the parameters, there is a phase transition between two different regimes: a regime limited by the number of emergency physicians and a regime limited by the second level capacity. Stochastic calculus gives the convergence of the state Markov process to a deterministic solution of a differential inclusion, which is proved to be unique and is explicitly characterized. The equilibrium points of the solution are determined depending on the service policies. It allows to compute the exit rate of the ED and the average length of stay, and find the policies that optimize them.

comments
29 pages, 8 figures. Special issue of "European Conference on Queueing Theory" 2026
fields
Probability
pdf ↗ page arXiv:2610.35061 ↗

For a closed subset $C$ of Euclidean space, we study the diffusion whose drift pulls the state towards its nearest point in $C$, with noise intensity $T$. We let $T$ tend to zero and time tend to infinity. Convexity of $C$ is equivalent to a pathwise bound of the distance from $C$ by the norm of the process of Ornstein and Uhlenbeck. For arbitrary closed sets the bound holds in law. For compact convex $C$, we describe the invariant law by the curvature measures and the intrinsic volumes of $C$. The limit points of the law of the state form the orbit of reflected Brownian motion in $C$ started from the projection of the initial law. So the two limits commute only when this projection is the uniform law on $C$. Unless $C$ is a point, the mixing time is of order $1/T$ up to a logarithm. For the control problem the two limits of the value function commute for every compact convex set and every bounded Lipschitz terminal cost. A companion paper treats finite disjoint unions of convex sets.

fields
Probability
pdf ↗ page arXiv:2610.35145 ↗

We prove continuity of the phase transition for long-range Bernoulli percolation on $\mathbb{Z}^{2}$ with connection probabilities that decay at least exponentially fast. This extends earlier work by Duminil-Copin, Sidoravicius, and Tassion on slabs. Our proof establishes a finite-size criterion that allows us to run a renormalisation argument. As a corollary, we obtain supercritical sharpness, in the sense that for every $β>β_c$, there exists a unique macroscopic cluster in large boxes with high probability.

fields
Probability
pdf ↗ page arXiv:2610.35233 ↗

We prove that the log-Sobolev inequality holds for the two-dimensional $SU(N)$ Wilson lattice Yang–Mills measure with arbitrary fixed inverse coupling $β$. The log-Sobolev constant depends on $β$ and $N$, but is uniform in the volume of the underlying lattice. The proof relies on a two-scale disintegration argument.

comments
13 pages
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2610.35286 ↗

The tail dependence function $Λ$ of a bivariate copula, and the tail dependence order based on it, cannot distinguish between copulas whose tail dependence coefficient vanishes; for all of them $Λ\equiv 0$. Such copulas, among them the Gaussian copulas with correlation $ρ<1$ and the lower tails of all extreme-value copulas other than the comonotonicity copula, are nevertheless ordered by the much finer information contained in their tail expansion $C(u w)\sim u^κ\ell(u)\,b(w)$, where $κ$ is the tail order, $\ell$ is slowly varying and $b$ is the tail order function of Hua and Joe. We introduce an asymptotic tail order $\preceq$ that refines the tail dependence order and show that it is lexicographic in the three quantities $κ$, $\ell$ and $b$. As a consequence, every real-valued measure that is monotone with respect to $\preceq$ is constant on all but countably many tail-order classes; meaningful measures of intermediate tail dependence must therefore be defined level-wise, and we construct such measures. Finally we determine where the fine structure resides: if the joint tail is ray-regular on the exponential scale, then $b$ is determined by the tail order and the one-sided derivatives at $ω=1/2$ of the angular dependence function of Wadsworth and Tawn; it is a (possibly broken) product of powers. If the joint tail is log-concave on the exponential scale, $b$ is squeezed between two such products.

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

Chatterjee's rank correlation $ξ$ measures how strongly a random variable $Y$ depends functionally on a random variable $X$, but it does not distinguish increasing, decreasing and non-monotone relationships. We ask how much of the dependence measured by $ξ$ is explained by an increasing relationship. For continuous marginals, $ξ$ is, up to a factor, a squared distance from independence in a Hilbert space geometry derived from the Sobolev scalar product for copulas. We answer it by the metric projection onto the closed convex set of stochastically increasing copulas in this geometry. The projection is explicit: it replaces every vertical section by its least concave majorant, and it coincides with the smallest stochastically increasing copula dominating the given one. It splits $ξ$ orthogonally into a monotone part $ξ^{\uparrow}$ and the squared distance to the class of stochastically increasing copulas; dually, $ξ^{\uparrow}$ is, up to a factor, the squared distance to the polar cone, which corresponds to negative quadrant dependence. The monotone part vanishes exactly for negatively quadrant dependent copulas, equals $ξ$ exactly for stochastically increasing copulas, and equals one only for the comonotonicity copula. In contrast to $ξ$, it is increasing in the concordance order and continuous with respect to weak convergence. Symmetrisation decomposes the measure of mutual complete dependence in the same way. Finally, the construction extends to arbitrary distributions via isotonic regression of conditional distribution functions. In particular, the plug-in estimator based on the empirical distribution is strongly consistent for every copula, without smoothing or tuning parameters.

fields
Probability
pdf ↗ page arXiv:2610.35340 ↗

The Stochastic Transport in Upper Ocean Dynamics project introduced a new paradigm for representing uncertainty in geophysical fluid dynamics through stochastic transport models calibrated from data. This paper provides a synthesis of the principal theoretical and data assimilation developments achieved as part of the project. The central theme of the paper is the transformation of stochastic transport models from a modelling paradigm into a mathematically rigorous framework equipped with analytical, variational, calibration and Bayesian data assimilation methodologies suitable for geophysical fluid dynamics. We describe the development of the theory of stochastic transport equations, including well-posedness, regularity and approximation results, together with their geometric foundations based on stochastic variational principles, rough paths and fractional transport models. We further review methodologies for calibrating stochastic transport structures from observational and high-resolution simulation data, ranging from reduced-order stochastic models to modern generative approaches. Finally, we discuss Bayesian inference and high-dimensional data assimilation techniques developed for stochastic transport models, including particle filter methodologies and machine learning uncertainty quantification. Taken together, these developments establish a coherent framework linking stochastic transport modelling, rigorous analysis, calibration and Bayesian inference, thereby providing a foundation for uncertainty quantification and forecasting in geophysical fluid dynamics.

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

We prove that for the normalized sum $W=\sum_{i=1}^n X_i/\sqrt{n}$ of independent, mean-zero, $d$-dimensional random vectors with $\operatorname{Cov}(W) =Σ=\operatorname{diag}(σ_1^2,\dots, σ_d^2)$ (the diagonal form of the covariance matrix is assumed without loss of generality), the 2-Wasserstein distance from $W$ to $N(0,Σ)$ is bounded by \[\sqrt{2\sum_{j=1}^d \min \left\{σ_j^2, \frac{\sum_{i=1}^n \mathbb{E} [|X_i'-X_i|^2(X'_{ij}-X_{ij})^2 ] }{n^2 σ_j^2} \right\}},\] where $|\cdot|$ denotes the Euclidean norm, $X_i'$ is an independent copy of $X_i$, and $X_{ij}$ ($X_{ij}'$ resp.) denotes the $j$th coordinate of the vector $X_i$ ($X_i'$ resp.). On the one hand, it gives the optimal rate $O(β\sqrt{d/n})$ if $|X_i|\leq β$ for all $i$. On the other hand, in the isotropic case where $Σ=I_d$, it gives the optimal fourth-moment bound $O\left(\sqrt{\sum_{i=1}^n \mathbb{E}|X_i|^4/n^2}\right)$. Moreover, the coordinatewise minima suggest a tradeoff between the naïve coupling and the normal coupling for each component. To prove the main result, we develop a new transportation inequality using a coupling via the Föllmer process with a general covariance matrix and the martingale property of its drift. The resulting bound is then controlled using a Bonis-type expansion together with Bessel's inequality. The method and the result extend to $p$-Wasserstein bounds. As a consequence, we obtain the Hilbert space 4-Wasserstein CLT bound $O(n^{-1/4}[\operatorname{tr}(Q^{1/2})]^{1/2})$, where, in the i.i.d. case, $Q=\mathbb{E}[|X_1'-X_1|^2(X_1'-X_1)^{\otimes2}]$ and the $O(n^{-1/4})$ rate is optimal given the dimension-free form of $Q$. We further strengthen it to a dimension-free strong approximation result with a near-optimal error rate through the KMT embedding construction.

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

The entropic regularized optimal transport (EOT) plays a fundamental role in the computation of optimal transport. In \cite{CLP}, the authors proposed a gradient flow approach to EOT, and derived a projected Langevin diffusion that converges in distribution to the solution of EOT when initialized with a coupling between the two given marginals. In this paper, motivated by samplings of optimal couplings for EOT, we analyze the projected Langevin dynamics with arbitrary initial distribution, and prove that its long time behavior is the same as if it was initialized from a coupling.

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

We consider a time-homogeneous random walk in a strip of a two-dimensional lattice whose transition probabilities are invariant under shifts along one of the coordinates. We study the limiting distribution of the first hitting point into a boundary set as the initial condition tends to infinity. Explicit expressions are obtained for this limiting distribution for negative and zero mean drift.

fields
Probability
pdf ↗ page arXiv:2610.35406 ↗

In this paper, we study the periodic measures within the context of time-inhomogeneous Markov processes. By extending the Hairer–Mattingly method to the time-inhomogeneous case, we first establish the existence, uniqueness and exponential ergodicity of periodic measures for general time-periodic Markov processes. These results are subsequently applied to time-inhomogeneous stochastic differential equations under the assumption that the drift is weakly dissipative and locally Lipschitz. We further employ the truncated Euler–Maruyama scheme to study numerical approximations of the periodic measures and derive the convergence rate between the exact and discrete periodic measures. These numerical results are new even in the time-homogeneous case under the assumptions considered in this paper.

fields
Probability
pdf ↗ page arXiv:2610.35519 ↗

This paper studies the convergence rate of the Polyak-Ruppert average estimator in one-dimensional linear stochastic approximation recursion driven by Markov chains, allowing the Markov chain to start from any initial distribution. Under the conditions of positive Harris recurrence, non-periodicity, and one-step domination, combined with the fourth-moment condition of the coefficient function with respect to the stationary distribution, this paper uses the exchangeable pair technique to prove that after deterministic bias correction for the average estimator, a Berry–Esseen bound of order $n^{-α/2}$ can be obtained, where the step size exponent is $α\in (1/2, 1)$. Moreover, for the statistics without bias correction and after variance normalization, the asymptotic normal approximation error is asymptotically equivalent to a normal constant multiplied by $n^{1/2 - α}$.

fields
Probability
pdf ↗ page arXiv:2610.35538 ↗

We prove that for critical percolation in high dimension the expected number of pioneers on any set containing the origin is of the same order as the probability that a simple random walk starting from the origin exits the set. Our proof works in all dimensions $d>6$, under the usual assumption that the two-point function is of the same order as the Green's function. As an application we obtain a sharp uniform quantitative bound on the probability that the cluster of the origin intersects any given ball.

comments
No use of AI or LLM tools
fields
Probability
pdf ↗ page arXiv:2610.35553 ↗

We study continuous-time random walks on finite nilpotent groups, allowing non-symmetric and nonuniform increment measures. Under a simple degree condition, sharp up to an absolute constant factor, we prove that total variation cutoff occurs if and only if the relaxation time is of smaller order than the mixing time. We establish a quantitative reduction to the Abelianization that preserves relaxation times and compares mixing profiles. Combining this reduction with a Gaussian approximation and the third-named author's cutoff criterion for diffusions yields the cutoff characterization.

fields
Probability, Group Theory
pdf ↗ page arXiv:2610.35561 ↗

Let $X_1,\ldots,X_n$ be independent random variables with arbitrary known distributions, where $n\ge2$. The optimal probability $V_n(X_1,\ldots,X_n)$ of choosing an overall maximum satisfies $V_n(X_1,\ldots,X_n)\ge(1-1/n)^{n-1}$, and this bound is attained. We obtain this known sharp bound by extending the reduction lemma of Allaart and Islas (2016) from continuous to arbitrary distributions. We construct a $V$-sequence whose optimal win probability does not exceed that of the original sequence, and then apply the bound for $V$-sequences. The construction first replaces atoms by uniform observations on strictly ordered intervals and applies the original continuous reduction lemma. The reduced distributions are determined by a common critical level and a common probability for splitting a possible atom at that level.

fields
Probability
pdf ↗ page arXiv:2610.35600 ↗

A submetric space is a topological space equipped with a continuous metric that generates a metric topology (usually) weaker than the original one (e.g., a~separable Hilbert space with the weak topology). We show that a positive linear functional on the space of bounded continuous functions on a submetric space is given as an integral with respect to a tight measure if, and only if, it is continuous in the strict topology. Neither local compactness nor complete regularity is required. We link the equicontinuity of a family of functionals in the strict topology to the uniform tightness of the underlying measures, and we provide a probabilistic representation (Skorokhod's parametrization) for such families. Finally, we identify the finest topology on the space of probability measures on a submetric space in which uniform tightness implies relative compactness. In non-metric spaces this topology is strictly stronger than the topology of weak convergence of probability measures.

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

This paper establishes uniform local large-deviation asymptotics for excursions of a Lévy process $X$ with negative drift $-β$ and $α$-locally regularly varying Lévy measure $ν$, reflected at its running infimum. Under the excursion measure $\underline n$, we first prove that the lifetime $ζ$ and height $\overlineε$ satisfy \begin{equation*} \underline{n}\big(ζ\in(t,t+δ] \big) \sim \underline{n}(\overlineε\in\big (βt,βt+βδ]\big) \sim\underline{n}(ζ)\cdotν\big((βt,βt+βδ]\big), \quad \mbox{as } t\to\infty, \end{equation*} uniformly in $δ\in[δ_0,\infty]$ for every $δ_0>0$. In contrast to the asymptotic equivalence of the corresponding tail events, fixed-width lifetime and height windows have asymptotically negligible relative overlap. Nevertheless, for any positive function $θ$ satisfying $|X_t+βt|/θ_t\to0$ in probability, \begin{equation*} \underline n\big( |\overlineε-βt| \leq θ_t \,\big|\, ζ\in (t,t+δ] \big) \sim \underline n\big( |ζ-t| \leq θ_t \,\big|\, \overlineε\in (βt,βt+βδ] \big) \to 1 . \end{equation*} For conditioning windows of sublinear width bounded away from zero, both conditional excursion laws converge under spatial rescaling to a single-jump process with deterministic jump size and random arrival time determined by the integrated excursion survival function. An additional time rescaling yields the same deterministic linear descent killed at zero. Finally, we identify the joint limiting distribution of the unscaled pre-terminal position and terminal overshoot, including continuous and discontinuous termination.

comments
61 pages, 2 figures. We did not use AI to generate any mathematical proofs or to originate any research ideas. All comments are welcomed!!
fields
Probability
pdf ↗ page arXiv:2610.35750 ↗

Self-intersection local times serve as the Hamiltonian in the Gibbs measure of continuous polymer models, for which the end-to-end distance is a key quantity. We study multiple self-intersection local times of Volterra Gaussian bridges, \emph{i.e.}, Volterra Gaussian processes conditioned on their final location $a$, as $\|a\|\to\infty$. For $d$-dimensional $(2,ζ)$-locally nondeterministic processes with $ζ\in(0,2/d)$, we prove that these local times exist in every $L^p$. Under two further conditions on the kernel, the $p$-th moment of the $m$-multiple self-intersection local time of the bridge is of exact order $\|a\|^{-γ}$ for every integer $p\geqslant1$, with $γ=p(m-1)(2-ζd)/(2-ζ)$. In the plane, for kernels $k(t-s)$ with $k(0)\neq0$ and under strong local nondeterminism, we restrict the double self-intersection local time to $\{t_2-t_1\geqslant\|a\|^{-α}\}$, $α>0$, and establish a phase transition: its expectation decays like $\exp(-c\|a\|^{2-α})$, converges to an explicit positive limit, or grows logarithmically, for $α<2$, $α=2$ and $α>2$ respectively.

comments
37 pages, no figures
fields
Probability, Mathematical Physics, Functional Analysis
pdf ↗ page arXiv:2610.35769 ↗

We prove accelerated mixing for a Metropolis-adjusted kinetic Langevin sampler: the OBABO splitting with friction $2\sqrt m$, adjusted with Neal's non-reversibly updated uniform, which is redrawn after every epoch of $E$ steps. For targets $e^{-U}$ on $\mathbb{R}^d$ with $mI\preceq\nabla^2U\preceq LI$ and an $L_H$-Lipschitz Hessian, started from a Gaussian at an approximate minimizer, the chain reaches total variation accuracy $\varepsilon$ after $\tilde O\big(\sqrt{κd}+\sqrt{L_H}(d/m)^{3/4}\big)$ gradient evaluations, where $κ=L/m$ and $\tilde O$ hides logarithmic factors. The $\sqrtκ$ term is necessary, already on Gaussian targets. The proof discretizes Lu's entropic hypocoercivity by means of an entropy inequality for free transport, so that the relative entropy of the unadjusted chain decays at a rate of order $\sqrt m$ up to a discretization bias. With the non-reversibly updated uniform, the leading energy errors of velocity Verlet telescope along a path. A coupling argument combines the two. On Bayesian logistic regression posteriors for two standard data sets, which satisfy these assumptions, the gradient cost of the chain with the non-reversibly updated uniform grows roughly like the square root of the condition number at the posterior mode, and that of standard adjusted OBABO roughly like its $3/4$ power.

code
github.com/nawafbourabee/persistence-pays-lean ∎ Lean project (lakefile.toml, lean-toolchain) does not build at 11c7e9e, checked 2026-10-27 build details
comments
37 pages, 4 figures. Code and data in the ancillary files. Lean 4 formalization of the main results at https://github.com/nawafbourabee/persistence-pays-lean (doi:10.5281/zenodo.23671351)
fields
Probability, Numerical Analysis
pdf ↗ page arXiv:2610.35781 ↗

We establish operator universality at the spectral edge of general Wigner matrices by showing that their suitably rescaled Lanczos tridiagonalizations, constructed from deterministic initial vectors, converge to the stochastic Airy operator with Dirichlet boundary condition. The result requires control of the entire tridiagonal structure on the scale relevant to the limiting differential operator. The Lanczos coefficients for non-Gaussian Wigner matrices are strongly dependent. We analyze their fluctuations by combining multi-resolvent local laws with quantitative control of Krylov subspaces and a comparison of the resulting Jacobi coefficients with those of the Gaussian ensembles. This approach identifies the limiting Brownian potential directly from the original matrix entries, without invoking Dyson Brownian motion in the step of Green function comparison. The resolvent limit yields joint convergence of edge eigenvalues, embedded eigenfunctions, and spectral measures. For Gaussian, Laguerre and circular $β$-ensembles we construct sharp couplings to the stochastic Airy, Bessel and Sine operators, preserving the finite-matrix laws. For fixed $β> 0$, their squared Hilbert-Schmidt inverse errors have almost-sure orders $n^{-1/3}, n^{-1}$ and $n^{-1}$, respectively, with $a > 0$ in the hard-edge upper bound. We also identify the positive leading order coefficient for the circular ensemble, whose second derivative jumps at $β= 2$.

fields
Probability, Mathematical Physics, Numerical Analysis
pdf ↗ page arXiv:2610.35808 ↗

Numerical Analysis47

Constitutive models for history-dependent, path-dependent materials typically encode this dependence in prescribed functional forms through internal variables such as damage or plastic strain that are phenomenological, model-dependent, and not directly observable. These rigid forms lack flexibility to match observations, make calibration potentially non-unique, and complicate uncertainty quantification. This paper develops a Gaussian-process state-space model (GP-SSM) that replaces the fixed form of the constitutive model with a flexible GP regression, and the prescribed internal variables with latent state variables learned directly from observable stress-strain histories. As a GP, the model is naturally endowed with a measure of uncertainty and can be constrained to satisfy physical principles. We demonstrate this framework for quasi-brittle materials under triaxial compression, where the latent variable evolution is driven by the current-state stress invariants and the increment of equivalent strain to reflect irreversible, pressure-sensitive history. A sparse multi-output GP then maps the latent state and current strain tensor to the six-component stress response, trained by variational sparse inference. The trained model is exported into Abaqus/Explicit through a user material subroutine. Four verification cases are reported: (1) offline rollout on validation and test histories; (2) a single element under changing confinement; (3) a frozen-memory unloading-reloading extension; and (4) a multi-element structural model compared against the Karagozian and Case Concrete (KCC) model. These results show that the learned state-space update reproduces held-out RVE-scale histories in closed-loop rollout, tracks evolving confinement, supports unloading without violating the irreversibility of the learned history state, and reproduces structural-level behavior consistent with KCC.

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

Uncertainty in the drift of a stochastic differential equation (SDE) induces uncertainty in statistical observables defined as expected functionals on path space. We propose a derivative-informed method for identifying low-dimensional structure in the drift-to-observable map, with the aim of improving the tractability of uncertainty quantification. This approach can be viewed as a generalization of the active subspace method to infinite-dimensional input spaces and to path-space observables of SDEs. Representing uncertainty in the drift by random perturbations in a Hilbert space, we construct a path-space sensitivity operator using first-order Fréchet derivatives of the observable with respect to the perturbation. We establish conditions under which the leading eigenfunctions of this operator correspond to directions of maximum mean squared sensitivity of the observable, thus enabling low-dimensional approximation with certified error bounds. We further introduce a martingale control variate of the Fréchet derivative that reduces error in sample-based estimators of the operator. Using a Galerkin scheme for numerical discretization, we show that reduced representations of the drift from the derivative-informed basis yield more accurate approximations of mean first hitting times of SDEs than the Karhunen-Loève expansion of the same truncation order.

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

We propose a hybridizable discontinuous Galerkin (HDG) finite element method to approximate the solution of the time-dependent Keller-Segel model, a drift-diffusion system describing chemotactic cell movement. We develop and analyze the corresponding HDG scheme, and establish theoretical convergence results for the proposed discretization. Finally, we present numerical experiments that confirm the theoretical findings.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.33260 ↗

In this paper, we develop a robust augmented block preconditioner for three-dimensional, two-phase, incompressible inductionless MHD equations. We employ a high-order monolithic and charge-conservative arbitrary Lagrangian–Eulerian (ALE) finite element method as base scheme, for which the solution variables are current density, velocity, electric potential and pressure. Grad-div stabilization is added in both the current density equation and discrete momentum equation. Backward Euler method is used for the time discretization. At each time step, fully coupled solution strategy is adopted. This leads to large-scale, ill-conditioned, nonsymmetric, and indefinite dual saddle-point system. To solve this system efficiently, we construct an augmented block preconditioner within the constraint preconditioning framework. The ultimate preconditioner combines the augmented Lagrangian technique with approximate block factorization for current density sub-system and fluid sub-system. The fully coupled four-field system is then solved using preconditioned FGMRES iteration. Numerical experiments confirm the high-order accuracy and discrete charge conservation of the ALE-FEM. Drop of heavy fluid in light fluid is taken as benchmark to demonstrate the robustness of the preconditioner with respect to the discontinuity of physical parameters and the mesh size.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.33385 ↗

The optimization-based cell average limiter enforces global conservation and bounds, and has been successfully applied to discontinuous Galerkin (DG) discretizations of a wide range of nonlinear systems, from phase-field models to the compressible Navier-Stokes equations. In this paper, taking the heat and convection-diffusion equations as prototypes, we analyze the convergence of the scheme resulting from cell average limiting. Encoding conservation and admissibility in a differential inclusion identifies the limiter as a backward Euler proximal step in a Lie splitting of the constrained evolution. This proximal step is the metric projection onto the convex admissible set, and we prove that it is nonexpansive and stable in the $L^2$ norm, and that it does not increase the total variation of the cell averages. Combined with the standard error analysis, nonexpansiveness yields an $O(τ+h^{k+1})$ estimate for implicit Euler time stepping with DG discretization of polynomial degree $k$ under a reverse CFL condition, together with an unconditional $O(τ+h^{k})$ estimate. Numerical experiments confirm the predicted convergence rates and the enforcement of the bounds.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.33449 ↗

The fast iterative moment (FIM) method developed in [G. Li, C. Wang, and Z. Hu, Comput. Fluids, 311 (2026), 107031] achieves fast convergence for near-continuum gas flows modeled by the Boltzmann-BGK equation through alternating iterations between the high-order moment system and the consistent hydrodynamic equations. In this paper, we extend the FIM solver to the Shakhov model and improve it in the following aspects. A finite volume method with linear reconstruction is employed for high-resolution spatial discretization of both systems. Following the original FIM method, an implicit-explicit scheme treating the Shakhov collision term implicitly is adopted for the high-order moment system. A local Fourier analysis of a linearized one-dimensional BGK model reveals the need for more hydrodynamic iterations at smaller Knudsen numbers and their slower convergence on refined grids. Motivated by these findings, a Newton-multigrid method with a new regularization strategy is introduced for the hydrodynamic equations, generally providing an effective hydrodynamic correction with one step per alternating iteration, thereby reducing the need for empirical tuning. Numerical experiments for planar Couette flow, lid-driven cavity flow, and heat transfer in a bottom-heated cavity are carried out to investigate the performance of the improved FIM solver. The results demonstrate improved efficiency and robustness over the original FIM method, particularly at small Knudsen numbers, and favorable performance with both first- and second-order spatial discretizations.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.33537 ↗

Fractional derivatives model memory effects and nonlocal interactions beyond classical integer-order models. Fractional differential equations (FDEs) thus describe anomalous diffusion, transport in heterogeneous media, and hereditary dynamics. Their nonlocality, however, makes inverse problems challenging: unknown sources, coefficients, or initial conditions must be recovered from indirect and noisy data. Inverse problems for FDEs are usually ill-posed in the Hadamard sense, so regularization, such as the quasi-boundary value method, is required for stable reconstruction. Discretization produces large linear systems whose matrices inherit the nonlocal structure of fractional operators. Understanding the asymptotic spectral properties of these matrix sequences is essential for efficient solvers and preconditioners. Generalized Locally Toeplitz (GLT) theory provides a unified framework for the spectral distribution of large structured matrices and for preconditioner design. This thesis uses GLT theory to analyze matrix sequences from inverse problems for FDEs, construct structure-preserving preconditioners, and study nonlinear operations in the GLT algebra. In particular, it proves maximal distribution results for geometric means of GLT sequences: when the symbols commute, the geometric mean sequence remains GLT without symbol invertibility. This resolves a long-standing conjecture and shows maximality in the noncommuting degenerate case. Overall, the thesis integrates regularization, spectral analysis, and preconditioning into a coherent computational framework for inverse problems in nonlocal fractional dynamics, while enriching structured matrix analysis.

comments
Thesis
fields
Numerical Analysis
pdf ↗ page arXiv:2610.33763 ↗

In this paper, a one-parameter family of second-order implicit–explicit (IMEX) multistep methods is studied for delay differential equations (DDEs). The analysis is based on the matrix problem $y'(t)=A y(t) + B y(t-τ(t))$, where $A$ is Hermitian negative definite but $B$ is any matrix. For constant, grid-aligned delays, a field-of-values argument yields unconditional stability whenever a suitable generalized field of values $F_p(A,B)$ is contained in the open unit disk. For a constant non-grid-aligned delay, we show that quadratic interpolation does not reduce the corresponding stability disk. For genuinely variable delays, the method is formulated as a nonautonomous augmented system, and product-level sufficient conditions are obtained from a common quadratic Lyapunov inequality and from a quantitative slow-variation hypothesis. The approach developed herein is illustrated through several examples in which the discussed theory is applied not only to DDEs, but also to semidiscrete parabolic problems given by partial delay differential equations with a diffusion term.

comments
24 pages, 3 figures, 2 tables. Submitted to Applied Numerical Mathematics. Code available at https://github.com/javiroguti/DDES-IMEX-stability
fields
Numerical Analysis
pdf ↗ page arXiv:2610.33780 ↗

Hajja, Hammoudeh, Hayajneh and Martini showed that a tetrahedron whose cevians to the circumcenters of the opposite faces are concurrent is either a kite or a special jaw. We determine the exact dihedral-angle-sum range on the jaw component. The lower endpoint is attained only by the regular tetrahedron, while the upper endpoint is approached only in the degenerate limit. The proof reduces the family to one scale-invariant parameter and an explicit monotonicity argument.

comments
4 pages, no figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.33783 ↗

Polynomial manifolds provide nonlinear low-dimensional representations through polynomial decoders. We propose to represent the polynomial terms of the decoder using features that are orthonormal on the training data. This empirical orthogonality enables a greedy algorithm, Greedy-OPM, which jointly selects encoder modes and polynomial features while minimizing the reconstruction error under a prescribed bound on the decoder's Lipschitz constant. Numerical experiments show that this Lipschitz constraint improves generalization away from the training data while retaining high reconstruction accuracy.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.33784 ↗

Two-phase flow in porous media arises in a wide range of applications in engineering and science. A fundamental challenge in its numerical simulation is that the approximation of the saturation transport equation can violate the maximum principle, and spurious oscillations can appear even when the solution remains within physical bounds. In this work, we propose a bound-preserving anti-oscillation postprocessing limiter for discontinuous Galerkin discretizations of the two-phase flow system on non-matching meshes. An optimization-based cell average limiter enforces the prescribed bounds on the cell averages while preserving global mass by minimizing the $L^2$ distance to the original cell averages. To suppress the remaining oscillations, the cell average limiter is combined with a minmod limiter, which is activated only in the cells identified by a troubled-cell detector to avoid unnecessary loss of accuracy, and a Zhang-Shu scaling limiter subsequently enforces the bounds on point values. In addition, we prove that the cell average limiter preserves the accuracy of the numerical solution at a fixed time on non-matching meshes. Numerical experiments on homogeneous, non-homogeneous, and fractured porous media demonstrate the accuracy and robustness of the proposed method.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.33940 ↗

This paper studies the Calderón inverse problem for the multi-fractional Laplacian Schrödinger equation with drift terms, whose leading operator is a sum of fractional Laplacians of different orders, perturbed by a drift vector field and a potential. We consider two inverse settings: in the homogeneous source case \(f=0\), we aim to simultaneously recover the drift coefficient \(b\) and the potential \(q\) from the associated Dirichlet-to-Neumann map; in the non-homogeneous case \(f\neq 0\), we aim to simultaneously determine \(b\), \(q\), and the source term \(f\). Under suitable assumptions, we establish the well-posedness of the forward problem, derive a strong unique continuation principle, prove Runge-type approximation properties in fractional Sobolev spaces and weighted \(C^k\) spaces, and obtain generalized Alessandrini identities. These tools yield global uniqueness results for the inverse problems. In addition, we develop a numerical reconstruction framework combining finite difference discretization, radial basis function surrogate modeling, and hierarchical Bayesian inversion. Numerical examples in one dimension for smooth and discontinuous coefficients and sources illustrate the effectiveness of the proposed method and support the theoretical uniqueness results.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.34077 ↗

This paper analyzes the convergence of a variable-separation (VS) model reduction method that successively constructs separated approximations to the solutions of linear parametric partial differential equations (PDEs) by solving residual problems at sampled parameter values. We prove that the resulting VS approximations converge almost surely to the exact parametric solution in the parameter-averaged energy norm, under finite-dimensional approximation conditions on the error family and the assumptions of symmetry, uniform coercivity, and uniform boundedness of the governing bilinear forms. For parametric PDEs whose operators and right-hand sides admit finite-term separated representations, we construct finite-dimensional approximation spaces for the error family and bound their dimensions and approximation errors, thereby verifying these approximation conditions and obtaining an $O((\log N)^{-1})$ upper bound for the expected parameter-averaged error energy after $N$ iterations. When the solution families are contained in a fixed finite-dimensional space, we obtain the sharper $O(N^{-1})$ bound for the expected error energy and, if the operator is also parameter-independent, exact recovery for almost every parameter after an almost surely finite number of iterations. Numerical experiments illustrate the error decay of the VS approximations, as well as finite-step recovery in the parameter-independent case.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.34139 ↗

In this paper, we develop a numerical method for determining the potential function in one-dimensional and two-dimensional fractional-order Calderón problems through a single measurement. The fractional Laplacian is discretized using the finite difference method, and the POD-RBF method is used to construct the forward problem surrogate model that can provide the predicted value and its exact gradient in time. The inverse problem is solved using Tikhonov regularization and the conjugate gradient method. The efficiency and effectiveness of the developed method are demonstrated through numerical experiments, and the theoretical results are verified.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.34175 ↗

Many nonlinear partial differential equations (PDEs) arising in physical models involve unbounded perturbations, where nonlinear terms contain spatial derivatives. Such perturbations can be expressed as compositions of unbounded operators with bounded nonlinear maps. In this paper, we propose alternating numerical schemes for constructing quasi-periodic solutions to this class of PDEs, including the nonlinear acoustic wave (NLAW) equation and the Korteweg-de Vries (KdV) equation. To render the nonlinear perturbations bounded, we apply inverse differential operators as a preconditioning; this, however, also rescales the linear part by polynomial factors in the spatial mode $n$. Two main difficulties arise. The first is to control the measure of the resulting ``bad'' frequencies, since the bounds on the measures of the excluded frequency sets are enlarged by polynomial factors in $n$; we show that this measure nevertheless remains small. The second concerns resonances involving the perturbed eigenvalues of the linearized operator at large scales. Our key observation is that, when the dispersive frequencies grow polynomially in $n$ with degree greater than one, such resonances cannot occur if the magnitude of the temporal index lies below a threshold proportional to $|n|$ raised to one less than that degree. It therefore suffices to consider the complementary regime, in which the growth induced by the unbounded perturbation can be controlled in terms of the temporal index. At large scales, an additional complication arises: for a given spatial index $n$, all temporal indices in a box may be ``bad''. We show, however, that at each scale there is at most one such spatial index. Consequently, the resulting counting loss is only polynomial and can be absorbed into the exponential-logarithmic threshold, allowing us once again to retain control over the measures of the excluded frequency sets.

comments
56 pages, 11 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.34194 ↗

Cross-geometry generalization is particularly challenging because geometry-conditioned multiple-scattering surrogates must infer unseen objects' scattering properties from geometric features while accurately capturing complex, phase-sensitive interactions arising from repeated wave exchange. We introduce ESPC-Transolver, an equivalent-surface physics-guided, coupling-aware Transolver that separates local scattering-response representations from inter-object interaction modeling. For each sound-hard scatterer, canonical scattered-pressure responses are constructed under a shared set of spherical-wave excitations. A local Dirichlet-to-Neumann (DtN) map and modal scattering conversion express these responses on an enclosing sphere, providing physically consistent input channels across geometries. Shared object-local Transolver blocks encode these responses and incident-field traces, while relative-position-aware slice attention models inter-object coupling. Predicted interface pressure and normal flux recovered from the local operator define equivalent sources for reconstructing exterior near- and far-field scattering. We evaluate the method on three-dimensional acoustic multiple-scattering problems at a fixed frequency, comparing it with geometry-conditioned predictors and alternative neural network backbones. ESPC-Transolver achieves lower scattered-field prediction errors on held-out instances of familiar geometry families and generalizes effectively to previously unseen Peanut and Torus geometries. Exterior-field reconstructions reproduce multiple-scattering interference patterns, linking cross-geometry interface prediction to near-field pressure and far-field scattering recovery.

comments
20 pages, 8 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.34246 ↗

We study Robin problems in which a small local boundary coefficient competes with the increasing surface measure of a finite-depth fractal approximation. For a fixed smooth domain, layer potentials give Green function and eigenpair expansions; contour residues and a finite-rank reduction yield a quantitative spectral-gap-dependent eigenvalue remainder. For varying Lipschitz domains, a uniform Poincaré inequality and a trace estimate with respect to normalized surface measure give a uniform ground-state expansion and a rank-one resolvent singularity as the total Robin boundary mass tends to zero. Under the boundary-resolution hypothesis and the condition on the approximation scales, ground-state measurements with known Robin coefficients recover the lower and upper Minkowski dimensions for sequences with bounded total Robin boundary mass. We describe Neumann, generalized Robin, and Dirichlet-type operator limits under the corresponding compact Mosco convergence hypotheses. Koch snowflake computations illustrate the reconstruction formulas, and an exact finite-stage area correction improves the adjacent-stage dimension estimator.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.34284 ↗

Physics-informed neural networks (PINNs) have emerged as a promising mesh-free framework for solving partial differential equations (PDEs), with broad applications in physics, engineering, and medicine. However, their performance is highly sensitive to the sampling strategy for training points. Conventional uniform sampling often fails to adequately resolve regions with complex solution features, leading to low efficiency and limited accuracy. To address these challenges, we propose a Lie symmetry-driven adaptive sampling framework for PINNs, termed Lie-AS-ISC. For PDEs admitting Lie symmetry groups, symmetry transformations are exploited to derive intrinsic functional relationships between the solution and its variables, enabling the construction of basis points with exact solutions that span the solution domain. Building on this, an adaptive sampling strategy is developed by jointly considering absolute error and invariant surface conditions, while a dual-index loss is introduced to enhance training constraints. The proposed method significantly improves prediction accuracy. The experimental results show that this method consistently outperforms existing methods in accuracy.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.34345 ↗

Eigensolvers return orthonormal bases of invariant subspaces, but each basis is determined only up to a unitary factor, so bases computed at different parameter values cannot, in general, be interpolated directly. Discrete parallel transport resolves this ambiguity by aligning consecutive bases through the polar factors of their overlaps, but approximates the continuous parallel-transported frame only to second order. We show that the resulting frames can nevertheless be interpolated with spectral accuracy. For analytic families of invariant subspaces sampled at $N+1$ Chebyshev nodes, the computed frames are exact samples of an analytic frame related to the parallel-transported frame by a gauge that remains within $O(N^{-2})$ of the identity throughout a fixed complex neighborhood, uniformly in $N$. Consequently, Chebyshev interpolation approximates this analytic frame with geometric convergence. Moreover, the continuous parallel-transported frame can be recovered to spectral accuracy by solving a small matrix differential equation, without additional eigensolves or derivatives of the underlying matrix family. The results do not require the family to be Hermitian and remain valid through eigenvalue crossings and branch points, provided the selected invariant subspace depends analytically on the parameter. Numerical examples confirm the predicted rates.

comments
32 pages, 6 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.34494 ↗

Levenberg-Marquardt power flow (LMPF) addresses ill-conditioned equations and provides least-squares stationary points for infeasible operating requests. Conventional implementations form damped normal equations, where J^T J introduces fill, squares the spectral condition number of the undamped part, and adds sparse-product cost. We propose an augmented LMPF formulation with a symbolic-permutation-based Jacobian operator that fills the augmented blocks directly. We prove that the matrix is symmetric quasi-definite for positive damping, enabling fixed-order, pivot-free QDLDL factorization. This property also motivates the solver choice: KLU value-only refactorization can reuse an unsuitable pivot order, forcing fresh full factorizations on difficult LMPF trajectories. We further introduce one-probe adaptive trust-region initialization for the radius and damping. Direct assembly is 7.5-11.9x faster than the fastest coordinate-list path and 18.0-58.8x faster than cached normal-equation sparse-product formation; QDLDL reduces numerical refactorization and triangular-solve time by up to 3.40x on identical matrices. Adaptive initialization solves flat-started RTE cases in 19-25 factorizations, 7.5-11.6x faster than reproduced three-step LM. On case2383wp, our 84-iteration run performs 84 factorizations and 168 resolves in 237 ms, versus published times of 200.780-441.72 s with fewer outer iterations, corresponding to speedups of 847-1860x. These results require complete factorization and resolve accounting and reveal initialization and legacy-parameter effects. DC-initialized NR exhibits fast quadratic convergence throughout every tested solvable loading range, motivating clearer, reproducible definitions of ill-conditioned power-flow benchmarks.

comments
8pages, 1 figure
fields
Numerical Analysis
pdf ↗ page arXiv:2610.34509 ↗

We study nonlinear degenerate parabolic equations with state-dependent coefficients admitting a scalar energy potential. The explicit–implicit–null (EIN) method avoids severe time step restrictions of explicit time stepping and costly Newton–Raphson iterations required by a fully implicit treatment of the nonlinearity. Using orthogonal projection of the Kirchhoff transform, we prove nonlinear energy stability for first- to third-order EIN time stepping coupled with a wide range of spatial discretizations that admit self-adjoint positive semidefinite discrete operators. Under an upper bound for the diffusion coefficient on relevant stage segments, two IMEX coefficient conditions yield sufficient stabilization bounds without any time step restriction. The estimates dissipate the original convex energy and allow degenerate diffusion. We also extend the analysis to diffusion systems with a scalar energy potential in a fixed positive definite metric, and to consistent positive-weight quadrature discretizations. Applications include porous-medium flow, nonlinear heat transfer in plasma, and multicomponent diffusion.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.34539 ↗

We study sampling and recovery for tensor-valued dynamical systems evolving under the t-product, using partial spatial observations over time. Although the t-product Fourier transform yields slicewise matrix dynamics, recovery does not generally decouple across slices. Eigenvalues shared across Fourier-domain frontal slices couple the corresponding eigenspaces into aggregated spectral blocks, which determine the tensor-specific recovery geometry and space–time tradeoff. We establish deterministic identifiability conditions for the initial tensor state. In the diagonalizable case, these are frame conditions on the aggregated blocks. We extend them to non-diagonalizable systems through generalized eigenspaces and Jordan structure. A temporal–spectral factorization of the finite-horizon stacked recovery system underlying Tensor Dynamical Sampling (DS) yields a decoupled two-stage formulation once the temporal threshold is reached. Under independent spatial subsampling, we prove high-probability recovery guarantees using empirical Gram matrices on the aggregated blocks. The bounds depend on aggregated multiplicities, incoherence, and population conditioning. Stability estimates separate the spatial frame factor from the temporal Vandermonde factor and show that increasing temporal depth may worsen numerical conditioning even after identifiability is ensured. We implement Tensor DS and evaluate it on synthetic and real data. Phase transitions track the predicted blockwise sampling thresholds, and stability experiments illustrate Vandermonde conditioning. Experiments on sea surface temperature and turbulence velocity data show that a learned t-product system operator generally yields more accurate and structurally faithful reconstructions than vectorized low-rank, Tucker-type, graph-regularized, graph-spectral, and vectorized dynamical sampling baselines.

comments
55 pages, 9 figures
fields
Numerical Analysis, Information Theory
pdf ↗ page arXiv:2610.34621 ↗

The nonlinear Poisson–Boltzmann equation (PBE) is a widely used implicit-solvent model for the electrostatics of biomolecules in ionic solvent. Its numerical solution is complicated by the point charges, the dielectric jump across the molecular surface, and the exponential nonlinearity. We study a two-grid finite element method for the PBE built on the solution decomposition $u=G+Ψ+\Phit$ of Xie [J.~Comput.~Phys.~275 (2014) 294–309], in which $G$ carries the singularities analytically, $Ψ$ solves a linear interface problem, and $\Phit$ solves a semilinear interface problem for an arbitrary number of ionic species. The nonlinear problem for $\Phit$ is solved on a coarse mesh only, followed by a single Newton correction on the fine mesh, so that only symmetric positive definite linear systems are solved on the fine mesh. The analysis uses a $C^2$ truncation of the exponential that grows quadratically beyond a level $τ$; for $τ$ above an explicit bound the truncated problem has the same solution as the original one, and no discrete maximum principle or mesh-angle condition is needed. Under standard piecewise regularity assumptions we prove quasi-optimal energy and $L^2$ estimates and an $L^4$ estimate for the finite element approximation of $\Phit$, and for the two-grid solution we prove $\enorm{u-\utg}\le C\big(h^{s-1}+H^{2(s-1)+t/2}\big)$ in three dimensions, where $t=\min\{s,σ\}-1$. Whenever the dual problem is at least as regular as the primal one ($σ\ge s$), the coarse mesh can be chosen as $H\sim h^{2/5}$ without loss of accuracy. A manufactured-solution test confirms the predicted rates and the quadratic dependence of the two-grid correction on the coarse error.

comments
27 pages, 1 figure
fields
Numerical Analysis
pdf ↗ page arXiv:2610.34661 ↗

In this paper, we present and analyze an interior penalty discontinuous Galerkin method for Dirichlet boundary control problems governed by the biharmonic equation, with the control imposed through the normal derivative. The method is based on a reconstructed discontinuous approximation that admits an arbitrarily high-order approximation space with only one unknown per element. We construct a discretization that approximates the state and adjoint state in this space and derive a priori error estimates in the energy and $L^2$ norms. The analysis is carried out under the limited regularity available on polygonal domains by means of a medius argument. Numerical experiments are provided to support the predicted convergence rates.

comments
22 pages, 18 tables
fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2610.34669 ↗

We consider the iterative solution of the large, sparse and nonsymmetric double saddle-point systems arising from the stationary Stokes-Darcy equations in two dimensions, discretized by the Marker-and- Cell (MAC) finite difference method. Existing block triangular preconditioners rest on approximations of two Schur complements, the second of which is hard to approximate uniformly in the physical parameters. We propose instead a coupled preconditioner that keeps the interface coupling and regularizes the constraint block by a small multiple of the identity, so that the second Schur complement never has to be approximated. We analyze the spectrum of the preconditioned matrix, both in the ideal case and for the inexact version used in computations, and derive from it a rule for scaling the regularization parameter with the physical parameters. Numerical results show mesh-independent convergence of preconditioned GMRES and robustness with respect to the viscosity and the permeability.

comments
29 pages, 7 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.34692 ↗

We construct an equation-of-state-independent geometric-compatible finite-volume (GC-FV) method and a high-order nodal discontinuous Galerkin spectral-element extension (GC-DG) for a reduced Godunov-Peshkov-Romenski system on fixed Eulerian meshes. Density is recovered from $ρ=ρ_0\det(\mathbf{A})$, so mass conservation is a hidden companion law of the distortion equation. Starting from a straight-path Dal Maso-LeFloch-Murat fluctuation pair, minimum-change cofactor projections produce a single-valued density flux and exact induced local Lax-Friedrichs dissipation without jump quotients. The summation-by-parts property lifts the geometric two-state identity to high order and yields an equivalent subcell representation of GC-DG. We then blend GC-DG with the compatible GC-FV operator on the same Legendre-Gauss-Lobatto subcells. Because both operators induce the same boundary density flux, the global subcell blend retains the exact semidiscrete mass balance while suppressing shock-generated oscillations. A complementary modal/face-jump indicator supplies the elementwise blending coefficient. Numerical experiments verify high-order convergence, the expected temporal scaling of the fully discrete mass drift, and robust shock capturing for fluid, nonlinear-elastic, thermal-wave, and elastoplastic problems, including genuinely multidimensional configurations.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.34755 ↗

In a recent paper, the authors developed an Active Flux-type algorithm for polygonal meshes (see \cite{BP_Pampa_VEM}). The main difference between Active Flux methods on polygonal meshes and those on Cartesian or simplex meshes is that the basis functions are not explicitly known. These functions describe the solution using point-value approximations on the polygon boundaries and the average value within the polygons. In \cite{BP_Pampa_VEM}, it was shown that directly transposing the algorithm from simplexes to polygons leads to a mild instability, and a remedy was proposed without a rigorous explanation. In the present paper, we clarify this issue and demonstrate that the solution presented in \cite{BP_Pampa_VEM} is indeed correct. Furthermore, another challenge-the implementation of boundary conditions-was previously solved heuristically. Building on \cite{pampa_dg}, we show how to properly implement these boundary conditions. Finally, the method is illustrated through several examples with hybrid meshes.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.34761 ↗

In this paper, we develop and analyze a numerical method for the Maxwell's transmission eigenvalue problem in dispersive media. The problem is formulated as the eigenvalue problem of a holomorphic Fredholm operator function of index zero. For discretization, we employ the Nedelec elements. Convergence of the scheme is established via the abstract approximation theory of Karma. To compute the resulting nonlinear matrix eigenvalue problems, we employ a parallel multi-step contour integral method. Numerical experiments are presented to demonstrate the viability and accuracy of the proposed approach.

comments
23 pages, 4 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.34804 ↗

We establish a discrete fractional Gronwall inequality for dissipative systems with time-dependent forcing. For completely positive discretizations, we bound individual resolvent entries by integrals of the continuous response kernel, under controlled perturbation to the L1 weights and a stepsize restriction. The proof constructs a supersolution for each resolvent column. The resulting Mittag-Leffler weights retain both the decay of initial data and the historical contributions of forcing. The framework covers L1 and several standard schemes on uniform meshes. For linear subdiffusion, it yields decay-preserving L1 error estimates separating first order and $(2-α)$ order contributions, with stronger long-time decay under additional solution regularity.

comments
26 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2610.34827 ↗

For affine-constrained $\ell_1/\ell_2$ minimization with nonzero data, a variational geometric approach is developed to characterize exact recovery. Necessary and sufficient conditions for local and global exact recovery are established in terms of directional derivatives and cones associated with sublevel sets of the ratio objective. The local analysis further reveals that local minimality, first-order growth, and tilt stability are equivalent. These pointwise characterizations lead to improved sufficient conditions for uniform recovery of sparse signals. The sufficient condition for uniform local recovery has coefficient $c_s=\max\{1,(\sqrt{s}-1)/2\}$ for $s\ge2$. For each fixed $s$, the coefficient $c_s$ is optimal within the considered family of local null-space conditions. Projection estimates yield a scalar bound for uniform global recovery with coefficient two, improving the earlier coefficient three. The coefficient two is optimal within the considered family of global null-space bounds when both $s$ and $n$ may vary. A positive margin in the local null-space condition provides explicit growth moduli, localization radii, and bounds on linear objective perturbations that leave the localized minimizer fixed. Examples show that uniform local recovery does not imply uniform global recovery.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.34842 ↗

We give a one-sided stability argument for high-order cut finite elements with symmetric Nitsche boundary conditions. On each boundary patch, an $H^1$-projection splits the discrete function into a single polynomial and a stabilized residual. Inward segments control the polynomial inside the physical domain; complete-element estimates control only the residual. For smooth exterior boundaries and under a geometry-dependent mesh restriction, this gives an explicit normal-flux estimate with factor $p^2/h$ and a sufficient Nitsche penalty with the same scaling. The constants are independent of the cut position and polynomial degree. A neighboring-interval estimate quantifies the exponential cost of polynomial continuation and motivates avoiding it in the stability proof. We obtain $hp$-error estimates, with half a power of degree lost in energy and a full power in $L^2$ relative to best approximation, and exponential degree convergence for analytic extensions on sufficiently fine meshes. Translated-disk experiments show bounded normalized flux constants and penalty thresholds over the tested degrees and cuts, and resolved convergence curves follow the predicted orders. Physical and extension-dependent stabilization errors are reported separately.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.34853 ↗

In this paper, we propose an explicit third-order low-regularity integrator for the cubic nonlinear Schrödinger equation on the one-dimensional torus $\mathbb{T}$. By carefully designing numerical approximations for the integrals in Fourier space, we construct a third-order scheme and provide a rigorous global error analysis. More precisely, we prove that the scheme achieves third-order convergence in $H^{r}(\mathbb{T})$ for the initial data in $H^{r+4}(\mathbb{T})$ with $r>1/2$. Furthermore, the third-order convergence in $L^{2}(\mathbb{T})$ is established for the initial data in $H^{4}(\mathbb{T})$. Numerical experiments are presented to confirm the theoretical convergence results.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.34918 ↗

We propose several novel Krylov subspace algorithms termed shifted randomized GMRES (RandGMRES-Sh), shifted randomized FOM (RandFOM-Sh), shifted randomized GMRES with deflated restarting (RandGMRES-Sh-DR), and shifted randomized FOM with deflated restarting (RandFOM-Sh-DR), for solving shifted linear systems. These methods are designed to significantly reduce the computational overhead of orthogonal basis generation while preserving orthogonality under specific conditions. Besides, this unified framework makes it possible to solve all shifted linear systems at the same time by using a single shared basis. These new approaches combine multiple advanced techniques together effectively, such as randomized sketching, the control of collinear residual directions, and deflated restarting methods. Compared with the standard versions of traditional algorithms, the new algorithms show a steady but moderate improvement in convergence speed. Furthermore, we theoretically prove that although GMRES and sketched GMRES have different algorithmic solution steps, their iterates are all confined to and together span the same basic Krylov subspace. We also work out the theoretical relationship between the solutions produced by RandGMRES-Sh and RandFOM-Sh at the same iteration step before the first restart. Moreover, we strictly prove how the solutions of RandGMRES-Sh and RandFOM-Sh are related to those of their traditional versions, GMRES-Sh and FOM-Sh, respectively.

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

We study a thermal Maxwell-Stefan-Navier-Stokes system modelling miscible mixtures under a quasi-incompressibility constraint. The system consists of the conservation laws for mass and momentum, and the balance law for entropy, which is preferred over the balance law for energy because it facilitates the development of two structure-preserving discretisation methods. The first method applies a semi-implicit Euler scheme in time, together with suitable finite elements in space, which guarantees generation of entropy and enforces the quasi-incompressibility constraint pointwise, but numerically dissipates total energy. The second method employs a continuous Petrov-Galerkin discretisation in time, which also generates entropy and satisfies the constraint pointwise, and in addition conserves the total energy and allows high-order time approximations. The structure-preserving properties and behaviour of both numerical methods are demonstrated by a series of numerical experiments.

comments
36 pages, 6 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.35157 ↗

We consider an inverse source problem for the heat equation on the unit disk $Ω\subset\mathbb R^2$ with flux measurements at finitely many boundary points. The source is piecewise constant in time on prescribed intervals and, on each interval, is the characteristic function of an unknown region with Lipschitz boundary. The measurements on each interval split into the contribution of the current source and a history term from earlier sources; subtracting the latter leaves a linear inverse problem for a forward operator $F_τ$ that is densely defined and unbounded on $L^2(Ω)$. We prove that $F_τ$ is not closable, so the classical regularization theory for closed unbounded operators does not apply. We regularize instead with a Hilbert-scale penalty that compactifies it. The resulting Galerkin–Tikhonov reconstruction is sequential: each source is recovered from the flux observed up to the end of its interval and from the previously reconstructed sources. We prove its convergence and uniqueness, show that earlier reconstruction errors propagate into later data with exponential decay in time, and establish stability estimates with respect to the number of sensors. A numerical experiment on noisy measurements shows the feasibility of the sequential approximations, refined by Fourier approximation and boundary correction by a neural network.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.35173 ↗

Finite-volume and discontinuous Galerkin methods update cells using the space-time flux integral over their faces, which typically depends on the solutions to local Riemann problems. In the multidimensional Riemann problem setting, this integral is difficult to evaluate exactly because of complex wave interactions. In this work, we show that the exact space-time flux integral is a polynomial in the time step and face dimensions. This motivates a learning-based approach, as only the mapping from the initial states to the polynomial coefficients needs to be learned. We propose a structure-preserving, data-informed Riemann solver framework that uses a neural network trained on high-resolution simulation data to learn this mapping. Key structural properties, including consistency and symmetry, are enforced by construction. Provided that the high-resolution simulations converge to the exact flux integrals and the network accurately predicts the coefficients, this framework yields near-exact flux integrals for use in numerical simulations. We demonstrate the framework using classical implosion and explosion problems for the two-dimensional Euler equations. In an unsplit MUSCL-Hancock scheme, the learned Riemann solver remains stable at a CFL number of 0.9, whereas the same scheme using the exact one-dimensional Riemann solver fails. Compared with the latter scheme at CFL=0.45, the learned scheme is slightly more accurate and requires approximately 30% less computational time.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.35265 ↗

We present a finite element method for reconstructing a coefficient in a fractional semilinear equation from a single exterior measurement.

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

We develop a flow-map framework for nonlinear transport equations, comprising a self-consistent exact frozen flow and its numerical realization. An exponential–pullback identity represents each frozen transport exponential in a commutator-free exponential integrator as the pullback induced by its exact backward characteristic map. Composing these maps defines the self-consistent exact frozen flow, a time-discrete construction with autonomous frozen fields formed from linear combinations of transport fields evaluated at the stage approximations. A local freezing-error identity and a one-step estimate for the Lie–Euler Vlasov–Poisson update separate field variation, field approximation, and characteristic integration errors; these estimates do not assert global PDE convergence. We specialize this construction to the Vlasov–Poisson system and obtain the self-consistent numerical flow through velocity-space quadrature, a discrete Poisson solve, field interpolation, and numerical integration of the frozen characteristic equations. Under suitable regularity assumptions, we prove that the self-consistent exact frozen flow for this system is a volume-preserving diffeomorphism. Temporal self-convergence tests on Vlasov–Poisson and guiding-center benchmarks yield rates consistent with the design orders and illustrate conservation behavior and the evolution of solution structures in long-time simulations with large time steps.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.35327 ↗

This study proposes two-dimensional one-parameter singularly perturbed parabolic problems and develops an operator-splitting direct discontinuous Galerkin (DDG) method for their numerical solution. To improve computational efficiency, an alternating direction implicit (ADI) splitting approach decomposes the original two-dimensional problem into two separate one-dimensional subproblems. The spatial discretization is performed using the DDG method on a piecewise-uniform Shishkin mesh, enabling accurate resolution of the sharp boundary layers that arise in singularly perturbed problems (SPPs). For the temporal discretization is carried out with the backward Euler scheme to ensure robustness and stability. The theoretical analysis establishes an optimal convergence rate of order $k$ in the spatial discretization, where $k$ denotes the degree of the polynomial basis functions, and $(Δt)$-order convergence in temporal dimensions. We prove that the resulting fully discrete scheme is consistent, stable, and convergent. Numerical experiments confirm the theoretical results and demonstrate the effectiveness and robustness of the proposed method.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.35343 ↗

We propose and analyze a fully discrete numerical scheme to approximate solutions to the inertial Landau-Lifshitz-Gilbert (iLLG) equation, a state-of-the-art model to describe the dynamics of the magnetization at subpicosecond time scales. The method employs first-order finite elements for the spatial discretization and the two-step backward differentiation formula (BDF2) for the time discretization, where the inertial term is treated by a convex combination of BDF2 and the backward Euler method. We prove well-posedness and unconditional stability of the scheme, and obtain explicit bounds for the error in the realization of the iLLG-inherent unit length constraint satisfied by the magnetization. Moreover, we derive the discrete energy law satisfied by the approximations, which resembles the inherent dissipative energy law of the model. Finally, with a constructive approach, we prove unconditional convergence of the approximations toward a weak solution of the problem. Numerical experiments assess the performance of the scheme and validate the theoretical findings.

comments
40 pages, 26 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2610.35382 ↗

Robust and meaningful rounding error analysis is becoming increasingly challenging as modern numerical computations involve a rapidly evolving variety of arithmetic formats, precisions, and computational kernels. We propose a trackable and modular framework for rounding error analysis, together with a new notation for bounding accumulated rounding errors. The analysis is trackable in the sense that the origin and propagation of individual error terms remain explicit in the final result, and modular in the sense that local error bounds can be replaced according to the arithmetic, precision, or computational kernel without repeating the structural analysis. We also introduce the notation $γ_n=(1-{\bm u})^{-n}-1$, which provides an alternative to the classical $γ_n^{\mathrm h}=n{\bm u}/(1-n{\bm u})$ notation. A key feature is that our notation does not require the restriction $n{\bm u}<1$ and conveniently handles errors arising from division. Using block LU factorization as a representative example, we show that the framework distinguishes the error sources of different algorithmic variants and permits improved kernels, such as compensated summation and accurate matrix multiplication, to be incorporated directly into the resulting error bounds.

comments
29 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2610.35420 ↗

Bartel, Schäfer and Ullrich investigated the BSS subsampling algorithm, which is based on the work by Batson, Spielman and Srivastava. While this algorithm works well, the bottleneck is its complexity of $\mathcal{O}(σ^2nm^3)$ for a frame of $n$ vectors of dimension $m$ and oversampling $σ^2$. We continue their work by showing that the algorithm can be implemented in $\mathcal{O}(σ^2nm^{2.5})$. Moreover, for some special cases, an even faster implementation is possible. In particular, BSS subsampling of Fourier-type frames on a full frequency cube can be implemented in essentially $\mathcal{O}(σ^2m^2(n+m^{1.5}))$.}

fields
Numerical Analysis
pdf ↗ page arXiv:2610.35474 ↗

Predictions with dynamical systems can be computationally expensive—even with reduced models—because reaching future prediction times can require many sequential time integration steps. We propose Flow-Map First-Order Trajectory Matching (FM-FTM), a nonintrusive model reduction approach that accelerates ensemble predictions of stochastic dynamical systems by learning flow maps that replace multiple time-integration steps. Our method uses first-order trajectory matching (FTM) to learn a deterministic representation of the stochastic probability-current dynamics and then reduces its evolution over time into a flow map whose evaluation directly yields predictions over long time horizons. Numerical experiments on evolution problems with stochastic forcing demonstrate that FM-FTM accelerates ensemble predictions by up to two orders of magnitude while accurately predicting time marginals and ensemble statistics.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.35504 ↗

It is well-known that certain Möbius (linear fractional) transformations provide analytic continuation of the Gauss hypergeometric function. These transformations work by exchanging the roles of the three regular singular points and $0$, $1$, and $\infty$ of the Gauss hypergeometric differential equation. Not one of these transformations, however, brings the points $e^{\pm{\rm i}π/3}$ closer to the origin, and convergence in a neighbourhood of these is also troublesome. In this work, we produce a Maclaurin series in optimal complexity after rational conformal mapping that induces pointwise convergence to any ${}_{q+1}F_q$ throughout the cut complex plane $\mathbb{C}\setminus[1,\infty)$. We show that for the optimal parameter values this series converges faster than an approximate mapped Chebyshev series obtained by the ultraspherical spectral method.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.35577 ↗

Solutions to elliptic boundary value problems on three-dimensional nonsmooth domains exhibit singular behavior near edges and vertices. Using layer potential theory, we investigate boundary integral equations for the Laplace equation and characterize the leading singular exponents of the surface density on conical domains. For two canonical geometries, we derive explicit formulas for the two families of edge singular exponents on a dihedral wedge, and characterize the modewise vertex singular exponents on an axisymmetric circular cone through the zeros of associated Legendre functions and their derivatives. Building on these two prototypes and the dilation-invariance property, we formulate the associated operator pencil for general conical domains and develop a nonlinear eigenvalue solver. This solver employs the Nyström method with graded meshes, logarithmically corrected trapezoidal rules, and Brent's method to compute these singular exponents accurately and efficiently. Numerical examples for trihedral cones, regular m-hedral cones, and droplet-type cones verify the effectiveness of our approach and illustrate the interactions between edge and vertex singularities.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.35664 ↗

We present a method for computing a specific type of matrix decomposition that combines a structured framework with data-driven adaptation. This framework allows for an efficient and stable representation of signals or images using frames by identifying sets of vectors that naturally capture the essential features of the given data. The resulting decomposition enables the development of regularization techniques that enhance the quality of reconstruction by preserving important signal characteristics while suppressing noise. We develop an optimization-based algorithm to compute the decomposition and establish convergence properties of the resulting iterates. Numerical experiments on synthetic data and tomographic image reconstruction illustrate the behavior of the proposed method and its performance compared to conventional spectral regularization methods.

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

This work proposes a new Multi-Fidelity Particle Flow Filter (MFPFF) based on a linear control variate framework and multilevel Monte Carlo methods. Conventional particle filters often suffer from weight collapse and particle degeneracy in high-dimensional spaces. Particle flow filters address this by smoothly transporting prior particles toward the posterior distribution, thereby avoiding the need for resampling. This work constructs multi-fidelity particle flow filters by augmenting a small number of expensive high-fidelity particles (full-order model runs) with a large number of inexpensive low-resolution particles (reduced-order surrogates constructed via intrusive Galerkin projection). These surrogates act as control variates to enhance the statistical estimate of the full-order posterior, yielding enhanced analysis accuracy at comparable computational cost. The work focuses on two particle flows based on log homotopy, the stochastic Gromov flow and deterministic Exact flow. Numerical experiments with the Korteweg-De Vries (KdV) and Quasi-Geostrophic (QG) test problems demonstrate that the proposed MFPFF achieves accuracy comparable to high-fidelity simulations while significantly reducing computational expense.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.35712 ↗

Information Theory39

We study the Bayesian fixed-confidence best-arm identification problem in which a learner can abstain from making a terminal recommendation. Subject to a target error probability $δ$ and an abstention budget $α$, we propose Screen-and-Confirm (S&C) and analyze its expected stopping time. We further derive the minimum expected stopping time for any algorithm that satisfies these constraints. For Gaussian priors and rewards, as $(δ,α)\downarrow(0,0)$, we establish matching upper and lower bounds up to multiplicative constants, with rate $κ_ν^2[1+\log((α+δ)/δ)]/(α+δ)$, where $κ_ν$ is the prior density of the top-two gap at zero, highlighting that nearly tied instances govern the sampling cost. When abstention is disallowed ($α=0$), S&C yields the optimal $Θ(1/δ)$ dependence for fixed model parameters, removing the additional $\log(1/δ)$ factor in the upper bound of Jang et al. (2024) under our Gaussian assumptions. We further characterize the exact multiplicative constant of the minimum expected stopping time for practical regimes including (i) fixed $α\in (0,1)$ and (ii) $α/δ\to\infty$, which are also achieved by S&C.

fields
Information Theory
pdf ↗ page arXiv:2610.30384 ↗

This paper investigates physical layer security in waveguide-based pinching antenna systems with a mobile eavesdropper. Assuming perfect knowledge of the legitimate user's location and only statistical information about the eavesdropper's position, the ergodic secrecy rate is analyzed under Gaussian and practical finite-alphabet signaling. Since the exact ergodic secrecy rate does not admit a tractable closed-form expression, a closed-form analytical upper bound is derived using Jensen's inequality. The resulting expression serves as an efficient objective for antenna position optimization without requiring exhaustive Monte Carlo simulations. Numerical results verify the tightness of the proposed upper bound and show that the optimized antenna position closely matches the optimum obtained from Monte Carlo optimization. Furthermore, practical finite-alphabet signaling is shown to exhibit secrecy-rate saturation at high SNR, identifying an effective operating SNR region. Although the antenna position is optimized using the Gaussian-based upper bound, it remains effective for practical signaling.

fields
Information Theory
pdf ↗ page arXiv:2610.33367 ↗

We study an extension of the Guided Speculative Inference (GSI) algorithm for test-time-scaling of large language models (LLMs) to a novel setting where an ensemble of smaller LLMs proposes draft reasoning steps which are later verified by a larger base model and a process reward model. Using the established framework of multiple importance sampling (MIS), we introduce weighting schemes to aggregate samples from a diverse collection of proposal distributions. We provide new bounds on the KL divergence from the optimal reward-tilted target distribution and the expected reward degradation, then demonstrate that the well-known balance heuristic is optimal. Compared to GSI with a single well-tuned drafter, combining several diverse LLMs while retaining the same total number of samples maintains competitive pass-at-$N$ downstream performance while being mathematically robust to situations where the support of a single draft model does not cover that of the target, where GSI may fail.

comments
9 pages, 1 figure. Presented at the IEEE ISIT 2026 Workshop on Information Theory for Large Language Models (IT4LLM)
fields
Information Theory
pdf ↗ page arXiv:2610.33368 ↗

We establish a reference modeling framework for random probability distributions subject to constraints. Generalizing the hyperensemble approach of Crooks, we formulate Jaynesian priors of maximal uncertainty over the unit simplex of categorical distributions. This framework is entirely general, but we primarily investigate models with constraints on physically relevant quantities, namely, average energy and Shannon entropy. A constraint on the exact value of average energy uniquely determines a Boltzmann-Gibbs equilibrium, but also defines a hyperplanar subset of the probability simplex consisting of all distributions with that value of average energy. The associated hyperensemble has a uniform probability density across all such distributions, regardless of distance to equilibrium. Such reference models make predictions of generic nonequilibrium properties such as the mean and modal microstate distributions and the expected free energy of a random distribution, which we examine analytically and via exact sampling algorithms. Moreover, introducing constraints on Shannon entropy permits parametric access to tunably nonequilibrium regimes. The approach follows conventional Jaynesian modeling logic and is compatible with standard Bayesian inference, and reduces to Boltzmann-Gibbs statistics when Shannon entropy is maximized. We examine the physical predictions of this scheme, and demonstrate its wide compatibility with other approaches to nonequilibrium modeling. We illustrate the framework in three scenarios: (i) comparison to superstatistics quasi-equilibrium modeling, (ii) generation of random nonequilibrium steady states, and (iii) Bayesian inference under a prior hyperensemble. We highlight numerous prospects for theoretical extensions and empirical application.

comments
23 pages, 5 figures
fields
Information Theory, Probability
pdf ↗ page arXiv:2610.33383 ↗

We study online inference for averaged Riemannian stochastic gradient descent (RSGD) when the unknown parameter lies on a manifold. Although the averaged RSGD iterate is asymptotically normal, practical inference requires estimating the unknown covariance operator in its limiting distribution. Existing online batch-means methods cannot be applied directly because a general Riemannian manifold lacks an addition operation, and the tangent space containing the Riemannian gradient varies across iterations. Through vector transport, we construct overlapping and non-overlapping covariance estimators that adaptively combine information from successive batches while accounting for the changing tangent spaces. The proposed estimators are online, require neither Riemannian Hessian computations nor a prespecified terminal sample size, and attain the same convergence rates as their Euclidean counterparts (Zhu et al., 2023). Together with asymptotic normality, these estimators enable online statistical inference for RSGD on manifolds. We illustrate the proposed framework through a detailed study of streaming principal component analysis on Grassmann manifolds.

comments
60 pqges, 7 figures, 2 tables
fields
Information Theory, Optimization and Control, Statistics Theory
pdf ↗ page arXiv:2610.33419 ↗

Let $\mathcal{N}=(V,A,S, R)$ be a directed network, where $D=(V,A)$ is a digraph, $S=\{s_1,s_2,\ldots,s_k\}\subseteq V$ is a set of senders, and $R=\{r_1,r_2,\ldots,r_k\}\subseteq V$ is a set of receivers. We prove that if, for each $1\le j \le k$, there exist $k$ pairwise arc-disjoint directed paths in $D$, one from each $s_i$ to $r_j$, then the underlying undirected network of ${\cal N}$, with unit capacities, admits a feasible $(s_1,s_2,\ldots,s_k)$-$(r_1,r_2,\ldots,r_k)$ multiflow of value $1$ for each pair $(s_i,r_i)$, $i=1,2,\ldots,k$. This establishes the multiple unicast conjecture proposed by Langberg and Médard in 2009.

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

Ensemble decoding improves decoding reliability by combining component decoders with complementary failure events. Existing approaches typically obtain this diversity from code-specific structure, such as code automorphisms, multiple parity-check representations, or targeted modifications of the message-passing graph. In this work, we instead learn the diversity of an ensemble of weighted belief propagation decoders by jointly optimizing trainable Tanner-graph edge weights. A central design question is how the training objective should distribute gradient among the ensemble members to promote complementary decoding behavior. To this end, we compare four ensemble objectives under direct gradient-based optimization and identify best-member training as the most effective approach. For a (64,32) progressive edge-growth (PEG) low-density parity-check (LDPC) code, the resulting ensemble outperforms the considered trained and untrained belief-propagation-based ensemble baselines. With 10 members, it provides a gain of approximately 0.66 dB over a single belief propagation decoder at a target frame error rate (FER) of $10^{-4}$. Similar behavior is observed for a (128,64) CCSDS LDPC code, indicating that the learned complementarity is not specific to PEG. Although the ensemble performance improves substantially, all trained members show a higher standalone FER. The gain therefore results from learned specialization and complementary failure events rather than uniformly improved component decoders.

comments
6 pages, 7 figures, submitted to an IEEE conference for possible publication
fields
Information Theory
pdf ↗ page arXiv:2610.33559 ↗

In communication networks, network coding allows intermediate nodes to combine messages, achieving transmission rates unattainable by routing alone in many multicast settings. In multiple unicast, where each source sends a message only to its prescribed destination, the precise capability boundary between coding and fractional routing has long remained unresolved. In this context, the Langberg-Médard conjecture asserts that if all sources in a directed network transmit independent messages at a common rate and every destination can recover all source messages by network coding, then replacing every arc by an undirected edge of equal capacity yields a network in which fractional routing can simultaneously deliver each source's message to its prescribed destination at the same common rate. We prove the Langberg-Médard conjecture for any number of source-destination pairs and arbitrary network topology. More generally, for an undirected network with a given source set and a disjoint set of allowed destinations, we establish a necessary and sufficient cut-capacity condition for simultaneous unit-rate fractional routing under every assignment of an allowed destination to each source. Networks satisfying the hypothesis of the Langberg-Médard conjecture necessarily satisfy this cut condition, so the conjecture follows as a direct corollary.

comments
14 pages, 3 figures
fields
Information Theory
pdf ↗ page arXiv:2610.33655 ↗

Fluid antenna systems (FASs) provide many candidate ports, but probing all ports for each channel realization incurs substantial online overhead. We study a complementary offline problem: compress the candidate-port space once and reuse the compressed set across future channel realizations. The method collects optimal ports from sampled training realizations, requiring only one scan of the candidate ports per realization. On a DeepMIMO 7-by-7 FAS with 49 candidate ports, 120 training realizations yield 27 representative ports on average while retaining 99.995% of the channel power gain achieved by exhaustive port selection.

fields
Information Theory
pdf ↗ page arXiv:2610.33730 ↗

Partial information decomposition (PID) splits the information that several sources carry about a target into atoms, distinguished by which collections of sources give access to them. We ask how such a decomposition should behave when some of the sources are already known. The access structure of the atoms suggests one answer: discard the atoms that the known sources provide and regroup the rest according to which further sources unlock them. The classical construction of conditional information suggests another: recompute the decomposition under the conditional distributions and average. We show that the two answers agree, atom by atom, exactly when redundant information obeys a source chain rule, an analogue of the chain rule of mutual information: when the same sources are added to several collections, the enlarged collections share everything the added sources provide and, beyond that, exactly what the original collections share once the added sources are known. The rule divides established measures of redundant information, so that adopting or rejecting it genuinely narrows the choice of measure. Our main result is a no-go theorem: for three or more sources, the source chain rule and local positivity, the requirement that all atoms be nonnegative, cannot hold together in any PID.

comments
23 pages, 3 figures, 2 tables
fields
Information Theory
pdf ↗ page arXiv:2610.33743 ↗

Improving the throughput of the weakest users is a central objective of wireless resource allocation, and the objective around which the user-centric cell-free massive multiple-input multiple-output (UC-mMIMO) architecture is built. This paper brings the two together by formulating and solving percentile programs for UC-mMIMO networks. We maximize the sum-least-qth-percentile (SLqP) rate via downlink power control, a utility that targets the user equipments (UEs) in the lowest q percentile of the rate distribution and subsumes max-min-rate and sum-rate maximization as special cases. The problem is non-convex, non-smooth and NP-hard. The cyclic maximization approach of one of the previous percentile optimization series does not carry over: the coherent joint transmission technique introduces cross terms in the powers that destroy the block-concavity on which it relies. We develop a change of variables that restores block-concavity, yielding an algorithm with closed-form auxiliary updates and a concave power update, and we give a self-contained proof of non-decreasing convergence to a directional stationary point. Simulations establish two facts: first, percentile optimization retains its value in an architecture with no cell edges; relative to the weighted minimum mean-square error benchmark, it raises the average rate of the lowest-10th-percentile UEs by 56–72% and Jain's fairness index from below 0.92 to above 0.99. Second, compared directly with massive MIMO and small cells under the same SLqP utility, UC-mMIMO delivers the highest lower-percentile rates at every access point density tested, by up to 62% and 2.7$\times$ respectively, at the same fairness, and its advantage widens with densification.

fields
Information Theory
pdf ↗ page arXiv:2610.33982 ↗

We prove the Golomb–Welch conjecture for lattice tilings: for every $n\ge3$ and $r\ge2$, the integer lattice $\Z^n$ admits no lattice tiling by Lee balls $B_n(r)$ of radius $r$. Together with the classical constructions for $n\le2$ and for $r=1$, this determines all parameters for which a lattice Lee tiling exists. Equivalently, we show that every abelian Cayley graph of even degree $2n\ge6$ and diameter $r\ge2$ has strictly fewer than $|B_n(r)|$ vertices.

fields
Information Theory
pdf ↗ page arXiv:2610.33983 ↗

Determining the cross-correlation distributions between $m$-sequences and their decimated sequences is an important problem in sequence design. For two positive integers $n$ and $k$ with $n=2k$, this paper investigates the cross-correlation function between a binary $m$-sequence $\{u(t)\}$ of period $2^{n}-1$ and its $2^{\gcd(s,k)}+1$ short-period decimated sequences $\{u(dt+l)\}$, where the decimation $d=\frac{2^s}{2^s+1}(2^k-1)+1$ satisfies $1<s<n$ and $v_2(s)>v_2(k)$. The cross-correlation function is proved to be four-valued and its value distribution is completely determined. Several previously known binary cross-correlation functions are included in our result as special cases.

fields
Information Theory
pdf ↗ page arXiv:2610.34010 ↗

Let $2\le k\le n$ and let $U\le\mathbb{F}_q^n$ be a fixed $(k-1)$-dimensional linear code. We study the $[n,k]$ maximum distance separable (MDS) codes over finite extensions of $\mathbb{F}_q$ that contain the scalar extension of $U$. Our approach constructs an auxiliary linear code from \(U\). Its full-weight words characterize the desired MDS completions. We prove that \(U\) admits an \([n,k]\) MDS completion over some finite extension of \(\mathbb{F}_q\) if and only if \(d(U)\ge n-k+1\). When this condition holds, the number of these MDS codes over $\mathbb{F}_{q^m}$ is \[\#\left\{W\le\mathbb{F}_{q^m}^n:U\otimes_{\mathbb{F}_q}\mathbb{F}_{q^m}\subseteq W,\ \dim_{\mathbb{F}_{q^m}} W=k,\ W\text{ is MDS}\right\}=\frac{χ_{δ_GM(G)}(q^m)}{q^m-1},\] where $G$ is a generator matrix of $U$, $δ_GM(G)$ is its represented derived matroid, and $χ_{δ_GM(G)}$ is its characteristic polynomial. In particular, the formula determines existence over each extension field and the least extension degree for which such an MDS code exists. Examples show that these counts may distinguish different representations of the same column matroid, while monomially inequivalent codes may have identical counts over every finite extension.

comments
17 Pages
fields
Information Theory, Number Theory
pdf ↗ page arXiv:2610.34016 ↗

In integrated sensing and communication (ISAC), when the sensed target is itself an eavesdropper, the illumination required for sensing coincides with the leakage that secrecy must suppress. This paper shows how a beyond-diagonal reconfigurable intelligent surface (BD-RIS) with movable elements decouples the two tasks in a monostatic setting, where the echo returns to the base station through the surface. We prove that a lossless reciprocal BD-RIS maps $K$ incident fields onto $K$ prescribed fields if and only if the two sets share the same Gram matrix and their bilinear Gram matrix is symmetric; unlike a diagonal RIS, it can thus steer a two-dimensional incident subspace onto any prescribed subspace. With a single stream, sensing incurs an unavoidable rate loss, whereas a closed-form zero-forcing design with a confidential and a Gaussian sensing stream nulls the data at the target and the sensing at the user, so that sensing costs only an SNR offset. Since all variables follow in closed form for any placement, the joint design reduces to a monotone search over the element positions, without alternating optimization. Simulations show that the dual-stream design loses only $1.1$ bit/s/Hz when the sensing requirement grows by $30$ dB, against $8.3$ bit/s/Hz for a single stream, while movement, interconnection, and the robust derivative-null design add up to $1.9$, $0.9$, and $2.6$ bit/s/Hz, respectively.

fields
Information Theory
pdf ↗ page arXiv:2610.34088 ↗

A long reflecting wall gives every wireless transmitter a mirror image, pairing its direct and reflected paths. Motivated by intelligent surfaces, we study the resulting signal point processes under two treatments: keeping the powers apart and superposing their point processes, or adding the powers transmitter by transmitter to form a recombined process. A threshold on inverse received power selects a region of transmitter locations, so Campbell's theorem reduces the mean measures to area calculations without assuming Poisson transmitters. For power-law path loss and paired fading marks, we derive the ratio of the recombined and superposed mean measures at large thresholds. The limit is independent of transmitter density and wall distance, but generally depends on the joint fading distribution. Under common fading, that dependence disappears and the limit depends only on the reflection coefficient and path-loss exponent. For Poisson transmitters, we derive paired count fluctuations and convergence of the count ratio. We also calculate the probability that the strongest individual path is direct. When the wall passes through the receiver, this probability has a closed form and the strongest received power has an exact Fréchet distribution. These results provide a reference model for wireless networks with reflecting surfaces.

comments
13 pages, 8 figures. Submitted to a IEEE journal
fields
Information Theory
pdf ↗ page arXiv:2610.34101 ↗

Every explicit non-cyclic crossed product space–time code for more than four antennas has relied on transcendental structure constants, and its coding gain is therefore not bounded away from zero. We explain this phenomenon and show how to avoid it. Over a number field, the commuting-generator (tensor product) construction yields a division algebra only in the cyclic case, and a division crossed product of prime-power degree requires two places with full decomposition group; in particular, no $(\Z/2)^r$, $r\ge3$, crossed product division algebra exists over $\Q(i)$. We then introduce Abelian crossed products with a commutator twist, give the general parametric form of their codewords as a $2\times2$ block matrix of cyclic-algebra codewords, and prove the division property with a centralizer argument and a tame norm-residue symbol. This yields algebraic codes over $\Q(i)$ with non-vanishing determinants and closed-form minimum determinants: an information-lossless $4\times4$ $(\Z/2)^2$ code with $δ_{\min}=1/2000$, and an infinite family of DMT-optimal $8\times8$ $\Z/4\times\Z/2$ codes indexed by primes $p\equiv5\pmod8$, whose commutator and cyclic constants are roots of unity. The member $p=5$, defined over $\Q(ζ_{40})$, has minimum determinant exactly $1/5$ before normalization, at least $34.7$ times that of the $8\times8$ perfect code at equal energy, and its rate-2 subcode for $8\times2$ systems has at least $5$ times the minimum determinant of the punctured perfect code. A determinant-spectrum analysis shows that at practical error rates the multiplicity of small determinants, rather than their minimum, governs performance, and it explains all simulated results.

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

Parallel ensembles of successive cancellation (SC)-style decoders improve error-rate performance by decoding multiple representations of the received vector. Conventional ensembles, however, keep every member active until completion. To reduce computational cost while retaining the diversity gain of ensemble decoding, we propose early ensemble selection (EES), which ranks members using intermediate decoding states and retains a prescribed numbers of members at each predefined selection stage. Within the EES framework, we propose two selection rules, namely path-metric-based selection (PM-EES) and neural-network-based selection (NN-EES). We analytically characterize the computational cost of EES through stage-dependent decoder log-likelihood ratio (LLR) update counts and provide an information-theoretically motivated criterion for choosing selection stages. Simulations on the \((128,64)\) extended BCH code and the \(\operatorname{RM}(4,8)\) code show that suitable selection schedules approach full-ensemble error-rate performance with fewer decoder LLR updates.

fields
Information Theory
pdf ↗ page arXiv:2610.34142 ↗

Fluid antenna arrays (FAAs) reconfigure their effective aperture by activating radiation ports from a dense set of candidate positions within a finite physical region, thereby offering geometry diversity beyond conventional fixed arrays. This paper studies arbitrary-direction far-field beam synthesis with a planar FAA. Since a fixed array adapts its beamforming weights on a predetermined spatial sampling structure, its ability to match desired beam patterns is limited when both the aperture and the number of active elements are constrained. To exploit the geometry diversity of the FAA, we propose a coarse-to-fine scheme that couples discrete port selection with continuous joint refinement. In the coarse stage, a fast Fourier transform (FFT) based phase retrieval step converts the amplitude-only beam specification into an aperture-compatible complex target, after which an FFT-tailored greedy method selects the active ports and least squares initializes their complex weights. In the fine stage, a projected adaptive moment estimation procedure jointly refines the continuous port positions and beamforming weights while enforcing the minimum interelement spacing. For the evaluated two-beam configuration, the proposed scheme increases the mainlobe energy fraction from 35.73% to 48.92% and reduces the peak sidelobe level from -2.30 dB to -3.83 dB relative to a fixed array with the same aperture and active-port count.

comments
12 pages, 9 figures. Submitted to IEEE Transactions on Wireless Communications
fields
Information Theory
pdf ↗ page arXiv:2610.34169 ↗

We study the minimum extension degree required for a Reed–Solomon code to admit exact $\mathbb{F}_q$-linear repair at the cut-set bound from every prescribed set of $d$ helpers. Let $s=d-k+1$, and let $Q_s(n)$ be the minimum product of $n$ pairwise coprime integers, each at least $s$. For every prime power $q$ and all $3\le k<d<n\le2d-2$, we prove that the minimum degree over $\mathbb{F}_q$ is exactly $sQ_s(n)$. When all surviving nodes are helpers, we also characterize the admissible extension degrees and bound the number of coordinates that can attain the cut-set bound. The required achievability follows from existing construction methods; we give a short existence proof using splitting subspaces. For a family of parameters with $n>2d-2$, we obtain strictly smaller extension degrees, showing that the range restriction cannot be omitted altogether. Finally, we prove that a nonlinear repair scheme attaining the cut-set bound induces an $\mathbb{F}_p$-linear repair scheme on the same code, where $p$ is the characteristic. Consequently, the extension-degree lower bounds over the prime field remain valid without a linearity assumption.

comments
21 pages
fields
Information Theory
pdf ↗ page arXiv:2610.34377 ↗

We count Boolean functions represented as the sign of a real polynomial of bounded degree on the $n$-dimensional cube. We prove that the logarithm of their number is asymptotic to that of the classical hyperplane-arrangement upper bound, uniformly over all degrees, with relative error $O((\log n)^2/n)$. We also obtain sharper additive and relative error estimates in particular degree ranges, including an additive error $O(n^2)$ between the logarithms throughout a small linear degree range and improved bounds just below the central degree. The proof combines probabilistic estimates for Reed–Muller codes with a deletion argument for sets of evaluation vectors, an entropy count, and a sharp-threshold estimate for expected rank deficiency.

comments
38 pages
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2610.34378 ↗

Fix a prime power q. We prove that deciding whether a received word y in Fnqm lies at rank distance at most n-2 from the one-dimensional Gabidulin code {{λ.g : λ in Fqm } is NP-complete. Thus maximum-likelihood decoding of Gabidulin codes is NP-hard even for k = 1, an analogue of the Guruswami-Vardy theorem for Reed-Solomon codes. In the Hamming metric, by contrast, hardness at this radius requires the dimension to grow with the length, as in the Guruswami-Vardy theorem. The reduction is deterministic; consequently Rank Syndrome Decoding (RSD) and Rank Minimum Distance (RMD) for Fqm -linear codes are NP-complete under deterministic polynomial reductions, whereas the previously known reduction was randomized. The proof goes through a pivot problem that we introduce, Twisted Square Membership (TSM): given Fq-subspaces U, W in FqN , decide whether some non-zero a in U satisfies a^(q+1) in W . Quadratic systems in d unknowns are encoded into TSM, then TSM into Gabidulin decoding. The last step views the received word as an Fq-linear map and decoding at radius n - 2 as the search for an Fq-plane on which it acts as a scalar. With support U + τ W in a cubic extension and map a + τ b to a^(q^2) + τ bq^q , two Frobenius twists force solution planes to encode the relation a^(q+1) in W . All constructions are explicit and polynomial, with N = O(qd^2 ), n less than N + d, and m = 3N .

comments
in submission
fields
Information Theory
pdf ↗ page arXiv:2610.34404 ↗

This paper develops a channel model for scattering from a broad class of integrated sensing and communication (ISAC) targets-robots, humans, and automobiles-based on a unified measurement campaign at 28~GHz. Nine targets are characterized from numerous transmitter–receiver configurations per target, spanning full bistatic and aspect angles and thus covering backward to forward scattering. Repeated acquisitions are collected for each configuration to capture target motion and dynamics, yielding nearly 117\,000 acquisitions in total. Measurements are collected with a 2~GHz-wide channel sounder equipped with a 256-element phased-array antenna, followed by digital beamforming and super-resolution processing for reliable extraction of multiple paths in delay and 2D angle, with average estimation errors of 0.1~ns and 0.2$^\circ$ respectively. From these measurements, we reduce a \emph{path-specific} channel representation in which the scattering is modeled as a cluster of paths whose center is defined by the bistatic specular \emph{geometry}; the cluster shape is described \emph{stochastically}. To ensure physically grounded spatio–temporal consistency, extracted paths are mapped to incident points on the target, each with an associated radar cross section (RCS) that is compatible with the 3GPP TR~38.901 ISAC channel model, and are subsequently mapped back to path properties for channel synthesis. The resulting statistical distributions are well behaved, physically interpretable, and consistent across targets, geometries, and motion. Comparison between measured and synthesized channel realizations demonstrates close agreement in pathloss trends and fluctuation behavior. Together, these results yield a high-fidelity, measurement-derived channel representation suitable for ISAC simulation, target modeling, and system design.

fields
Information Theory
pdf ↗ page arXiv:2610.34405 ↗

In this paper, we focus on decoding MDS linear block codes for insdel errors. Building on our recent work for two-dimensional Reed-Solomon codes, we present a decoding algorithm for bounded distance decoding for the general insertion-and-deletion scenario that can be used for any MDS code of rate at most half. Our algorithm employs a sliding window and has a time complexity smaller than brute-force decoding. In particular, for optimal Reed-Solomon codes, it corrects insdel errors up to the half-Singleton bound, which exceeds the scope of existing methods. Additionally, for the special cases of insertion-only and deletion-only insdel error patterns, we present two different algorithms with a time complexity smaller than our general algorithm.

fields
Information Theory
pdf ↗ page arXiv:2610.34511 ↗

Semantic communication is emerging as a pivotal paradigm to overcome wireless resource scarcity in 6G networks. This paper proposes a novel end-to-end framework for semantics-aware resource allocation in multi-user Edge AI. We extend the Opportunistic Information Bottleneck (OIB) to a multi-view setting, termed the Multi-view Gaussian Information Bottleneck (MGIB), by fusing complementary source views without variational approximation or network retraining. A resource allocation framework is then formulated for joint compression-level selection, transmission mode selection (i.e., the number of active sources per group), and PRB assignment. The problem is formulated as a Mixed-Integer Linear Program (MILP), solved efficiently via a proposed Lagrangian Relaxation (LR) algorithm, and benchmarked against the NP-hard optimal solution. Simulations demonstrate that the proposed LR scheme achieves near-optimal utility, and doubles PRB efficiency versus average allocation.

comments
Submitted to IEEE Wireless Communications Letters. Jiawei Luo and Hussein Saleh contributed equally to this work
fields
Information Theory
pdf ↗ page arXiv:2610.34532 ↗

Generative lossy compression combines a rate-limited representation with a stochastic decoder that preserves source-dependent information while generating unresolved detail. We ask what remains reusable when a rate-distortion-perception (RDP) system selected for one operating point is transferred to a prescribed conditional-generation task. We distinguish the single-letter RDP factorization from its block-code implementation and compare Full Redesign with three increasingly restrictive transfer strategies. Renderer-Only Transfer retains only the renderer and redesigns semantic steering. Representation-Induced Transfer additionally retains the semantic latent law induced by the original representation. Full-Model Transfer retains a compatible RDP code, marginalizing over the task conditional law to form its semantic encoder. For finite alphabets, we characterize Renderer-Only Transfer's exact compression-common-randomness rate region, renderer-hull controllability condition, and compression-rate penalty relative to Full Redesign. Under unlimited common randomness, this penalty is the minimum residual semantic information $I(S;U|X)$ forced by the inherited renderer. Representation-Induced Transfer is exact if and only if the semantic condition depends on the source only through the recurrent-class label $C$ of the end-to-end RDP test channel. Every compatible RDP code reused under Full-Model Transfer preserves $C$ and supports every task satisfying $X-C-S$. Any additionally transferable within-class semantic dependence must satisfy $I(S;X|C)\le R_0-H(C)$, where $R_0$ is the inherited compression rate. The bound is exact when $R_0=H(C)$. A scalar Gaussian specialization yields a renderer-noise controllability threshold, a closed-form transfer penalty, and examples of identical Gaussian RDP test channels with different Renderer-Only Transfer capabilities.

comments
38 pages, 2 figures. Submitted to IEEE Transactions on Information Theory
fields
Information Theory
pdf ↗ page arXiv:2610.34697 ↗

Semantic error control coding (SECC) has emerged as a promising paradigm for improving communication reliability by exploiting the inherent structure and semantic dependencies of transmitted information. This paper proposes a semantic successive cancellation list (SCL) decoder for polar codes carrying natural-language text. A fine-tuned byte-level language model provides next-byte priors, which are converted into conditional bit costs and incorporated directly into the SCL path metric before each pruning step. This allows the decoder to jointly exploit channel reliability and source structure while retaining the conventional polar coding framework. The language model can also be invoked only for bytes whose channel decisions are unreliable, trading decoding performance for latency. Simulations for length-512 polar codes show substantial block error rate (BLER) improvements over conventional CRC-aided SCL (CA-SCL) decoding. At rate R=0.75 and list size L=16, the proposed decoder achieves more than 1 dB of gain in BLER compared to CA-SCL with the same L. Moreover, with L=8, it outperforms conventional CA-SCL with L=256 in terms of BLER, while requiring about one quarter of the decoding time of the latter in the evaluated software implementation.

comments
6 pages, 6 figures, submitted to IEEE ICC for possible publication
fields
Information Theory
pdf ↗ page arXiv:2610.34729 ↗

The canonical $\mathbb{Z}_{2^s}$-linear Hadamard codes are the Gray images of the $\mathbb{Z}_{2^s}$-additive codes. Their rank, the dimension of the binary linear span, was known in closed form only for $s\le 3$, and for $s \ge 4$ only through computer computations for small lengths. We give a method that computes the rank for every $s$. We show that the rank is a binomial polynomial in the type parameters, with coefficients $ρ_s(\boldsymbol{k})$ independent of the length. We compute all the coefficients for $s\le 5$, which yields explicit rank formulas over $\mathbb{Z}_4$ and $\mathbb{Z}_8$ (recovering the known ones), and over $\mathbb{Z}_{16}$ and $\mathbb{Z}_{32}$.

fields
Information Theory
pdf ↗ page arXiv:2610.34730 ↗

The Poisson approximation theorem states that when $m$ balls are tossed uniformly and randomly into $n$ bins, the distribution of the bin loads can sometimes be approximated by $n$ independent Poisson random variables of mean $m/n$. We show that when the balls are tossed via a random $\mathbb{F}_2$-linear map, the load distribution is still governed by this Poisson distribution, albeit in a (necessarily) weaker manner. This allows us to show that a random linear map behaves like a fully random map in the following ways: 1. $\textbf{Expected loads.}$ We show that the expected value of the $r$th largest bin is governed by the $r$th largest value among $n$ independent Poisson random variables of mean $m/n$. Specializing to the canonical setting of $m=n$ and $r=1$, our bounds show that the expected maximum load when $n$ balls are hashed into $n$ bins by a random $\mathbb{F}_2$-linear map is no more than the corresponding expectation for a fully random map $\textit{plus}$ $\frac{3}2 + o(1)$. Specializing to $m\gg n\log n$, we show that the expected max load is $(1+o(1))m/n$ in this regime. 2. $\textbf{Concentration.}$ When $m\gg n\log (1/ρ)$ balls are tossed into $n$ bins randomly, we expect with $0.99$ probability that $\textit{every}$ density-$ρ$ subset of bins will contain a $(1\pm o(1) )ρ$-fraction of the balls. We show that this remains the case if the $m$ balls are tossed using a random linear map, and our bound matches the $o(1)$-factor produced by the fully random case. This gives a stronger version of the Leftover Hash Lemma for linear maps. An implication of this is that all bins have load $m/n \pm O(\sqrt{(m/n)\log n})$ with probability $0.99$. We obtain these results by showing that the average of a log-potential on the bin loads is upper bounded by the cumulant generating function of a Poisson random variable of mean $m/n$.

comments
Abstract shortened to fit character limit
fields
Information Theory, Probability
pdf ↗ page arXiv:2610.34750 ↗

Every perfect $r$-error-correcting Lee code in $\mathbb{Z}^n$ induces a finite configuration around each codeword: a family of pairwise disjoint radius-$r$ Lee spheres, all disjoint from the central sphere, that covers every lattice point at Lee distance $r+1$ from the codeword. We call such a configuration a complete covering. Under projection onto a suitable Cartesian product of cycles, a complete covering corresponds to an optimal local structure in the sense of Špacapan. The existence of a complete covering is necessary but, in general, not sufficient for the existence of a perfect Lee code, as our construction for $(n,r)=(3,2)$ shows. We prove that no complete covering exists whenever $n\ge 8$ and $r^2+\lfloor 25r/34\rfloor-3\ge 2n$. For the corresponding Cartesian products of cycles, this strengthens Špacapan's nonexistence theorem by replacing the linear radius condition $r\ge n$ with a threshold of order $\sqrt{2n}$. We also obtain an improved large-radius nonexistence bound for perfect Lee codes, strengthening the bound of Horak and Kim. Furthermore, we show that, for every $\varepsilon>0$, no complete covering exists when $n\ge 3$, $r$ is sufficiently large, and $r^2+(2/\mathrm{e}-\varepsilon)r\ge 2n$. On the positive side, we use near-optimal ternary constant-weight codes to construct almost complete coverings whose pairwise disjoint shadows cover a $1-o(1)$ proportion of the first outer Lee shell as the dimension tends to infinity, for every fixed radius.

fields
Information Theory
pdf ↗ page arXiv:2610.34805 ↗

Secure convertible codes, introduced by Zhang and Rashmi, achieve secrecy capacity under a passive eavesdropper model in which an eavesdropper is allowed to access any $\ell$ symbols from the initial and final codewords. In this paper, we construct two families of access-optimal secure convertible codes. The first family of codes based on Maximum Rank Distance (MRD) codes is constructed for all parameters in the merge and split regimes and requires a large field size. The second family of codes, constructed using Generalized Reed-Solomon codes, uses smaller fields but is applicable only for certain parameters in the merge and split regimes.

fields
Information Theory
pdf ↗ page arXiv:2610.34863 ↗

Mass formulas for prescribed hull dimensions have mainly been studied for linear codes viewed as subspaces of the whole space. We study internal enumeration for an arbitrary fixed parent code. Let $C$ be an $[n,k]_q$ linear code with an $\ell$-dimensional hull, and let $s$ be the subcode dimension. We determine the number of subcodes with prescribed dimension, hull dimension, and type over finite fields of both even and odd characteristic. We decompose the parent code into an LCD complement and its hull, and use projection to reduce enumeration to the corresponding problem inside the LCD complement. This yields explicit formulas refined by complete type and shows that the counts depend only on the relevant parameters, not on the particular parent code or its length. The known whole-space mass formulas and the enumeration of LCD subcodes of LCD codes arise as special cases. Motivated by code extension, we also study the dual containment problem: for a fixed code, we enumerate larger codes containing it with prescribed hull dimension and type. By duality, this problem is converted into the subcode enumeration problem already solved above, leading to corresponding conditional mass formulas. Finally, we investigate the asymptotic distributions arising from the exact enumeration formulas. When both the subcode dimension $s$ and $k-\ell-s$ tend to infinity, the hull distribution is governed by the LCD complement, and the limiting proportions are explicit constants determined by the field, the prescribed hull dimension, and the relevant type. When $s$ approaches or exceeds the dimension $k-\ell$ of the LCD complement, we determine the asymptotic proportion of subcodes attaining the minimum possible hull dimension and establish the associated concentration behavior. Analogous asymptotic results are obtained for the containment problem.

comments
39 pages
fields
Information Theory
pdf ↗ page arXiv:2610.34937 ↗

Additive codes generalize linear codes and play an important role in the construc?tion of quantum codes. As generalizations of linear MDS codes, additive MDS codes have received much research attention. As an important subclass of additive codes, ACD codes are widely used for quantum error correction. In this paper, we study single-twist additive generalized twisted Reed-Solomon (GTRS) codes over finite fields. We derive necessary and sufficient conditions for these codes to be MDS for arbitrary hook and twist parameters. Then we employ Schur squares to prove that such additive MDS codes are not monomially equivalent to additive Reed-Solomon codes. We also identify a class of additive GTRS codes whose duals remain additive GTRS codes, and show that, for all sufficiently large prime powers q whose characteristic avoids a finite set, such GTRS codes yield ACD codes.

fields
Information Theory
pdf ↗ page arXiv:2610.35105 ↗

This article revisits entropy and related magnitudes (entropy density, effective measure complexity, and informational distance) for the analysis of sequential data. We present their mathematical foundations within information theory and ergodic theory, establishing connections between probabilistic Shannon entropy and algorithmic Kolmogorov complexity. A central result, Zivs theorem, demonstrates the asymptotic equivalence between the normalised number of distinct words and entropy density, providing the theoretical basis for estimation via Lempel-Ziv factorisation. We examine the convergence properties of these magnitudes and introduce estimation procedures for finite sequences, including a method for the effective measure complexity and the transfer entropy rate. An open-source software library implementing parallel algorithms for efficient Lempel-Ziv factorisation is presented. The practical utility of the framework is illustrated through three case studies: functional brain connectivity analysis from fMRI data, characterisation of spatiotemporal dynamics in coupled nonlinear oscillators, and electrocardiogram-based classification of atrial fibrillation, demonstrating how entropic measures capture meaningful structural and dynamical properties across diverse domains.

fields
Information Theory
pdf ↗ page arXiv:2610.35121 ↗

In this paper, we investigate a family of trace codes over finite fields of odd characteristic defined by two quadratic trace conditions. By analyzing the quadratic forms associated with these trace conditions and evaluating the corresponding character sums, we obtain the parameters and complete weight distributions of the codes. We further exploit the natural multiplicative orbit structure of the defining sets to obtain punctured codes and determine their parameters, weight distributions and dual distances. Moreover, we establish self?orthogonality criteria and investigate divisibility and projectivity of the constructed codes. These results give a unified treatment for arbitrary odd prime fields and for extension degrees of both parities.

fields
Information Theory
pdf ↗ page arXiv:2610.35346 ↗

Minimal binary linear codes play an important role in secret-sharing schemes and in the structural study of linear codes. We study the minimality of three classes of known constructions: codes from a single complete Hamming-weight layer, codes from arbitrary unions of such layers and graph cut-space codes. For the previously studied single-layer codes C, we give a complete minimality classification: C is minimal if and only if t is even. For t = 4, we determine the minimum and maximum weights, and show that the family strictly violates the binary Ashikhmin Barg sufficient condition for every k. We also calculate the minimum distance of the dual code. For arbitrary unions of complete Hamming-weight layers, we obtain an if-and-only-if classification of minimality and uniform criteria for evenness, self-orthogonality, the doubly even property and hull dimension. We further analyze the family for odd k. Finally, using the classical bond characterization of cuts, we translate minimality of graph cut space codes into a graph-theoretic condition: a nonempty simple graph has a minimal cut code precisely when it has one edge-containing component and that component is complete. We also give a graph-function realization of the known binary tetrahedron code and explicitly identify the resulting code equivalence.

fields
Information Theory
pdf ↗ page arXiv:2610.35372 ↗

Anti-jamming capability is of paramount importance in modern wireless communications, yet conventional receivers are severely constrained by their fixed array geometries, which limit the available spatial degrees of freedom and leave performance highly susceptible to strong interference. By contrast, movable antennas (MAs) provide additional spatial degrees of freedom through antenna-position optimization. This paper investigates MA-enabled anti-jamming by jointly optimizing the antenna-position vector (APV) and receive beamformer to maximize the output signal-to-interference-plus-noise ratio (SINR). For the canonical setting with a single jammer and a single line-of-sight (LoS) propagation path on the legitimate link, we develop a damped projected-gradient descent (DPGD) algorithm with low computational complexity, which scales linearly with the number of receive MAs. We establish a generic active strict-saddle landscape for the resulting steering-coherence minimization problem and prove that DPGD converges almost surely to a local minimizer rather than merely to a Karush-Kuhn-Tucker (KKT) point. For the general setting with multiple channel paths on the legitimate link and/or multiple jammers, we derive an equivalent ridge least-squares formulation and develop a low-complexity soft-active projected-gradient (SAPG) algorithm, which also scales linearly with the number of receive MAs. We further show that the proposed antenna position optimization framework applies to both minimum variance distortionless response (MVDR) and zero-forcing (ZF) reception. Numerical results validate the proposed algorithms, demonstrating substantial gains in both anti-jamming performance and computational efficiency.

comments
13 pages, 4 figures
fields
Information Theory
pdf ↗ page arXiv:2610.35438 ↗

Dynamic metasurface antennas (DMAs) have emerged as a promising technology for realizing large-scale antenna arrays in next-generation wireless networks owing to their ability to enable dense and energy-efficient antenna architectures. However, jointly optimizing digital beamforming and DMA element weights under time-varying channel conditions remains challenging due to their coupled effects on the received signal and interference powers. We formulate this problem to maximize time-averaged energy efficiency (EE) under time-varying channel conditions, subject to transmit power constraints, Lorentzian phase limitations, and minimum rate requirements. To enable long-term planning and improve sample efficiency compared with model-free reinforcement learning, we develop a world model framework that learns latent system dynamics from interactions with the environment and jointly optimizes digital beamforming and DMA element weights through imagined trajectories. Furthermore, we incorporate feasibility-preserving action mappings and safety cost signals to ensure constraint satisfaction during policy learning. Simulation results demonstrate that the proposed framework improves the time-averaged EE by approximately 20% compared with the deep Q-network baseline, while achieving higher sample efficiency and more reliable constraint satisfaction.

fields
Information Theory
pdf ↗ page arXiv:2610.35813 ↗

In federated learning (FL), secure aggregation enables a server to compute the sum of local model updates of $N$ clients, without revealing any information on the individual model updates to the server, beyond their sum. Different clients may be subject to heterogeneous bandwidth constraints, and consequently may choose different numbers of quantization levels to represent the information they send. Most secure aggregation works require the clients to project the values of their update parameters to a common finite group (or field), which does not directly accommodate heterogeneous precision constraints on their transmitted masked updates. Existing approaches of secure aggregation with heterogeneous quantization levels reveal partial aggregates of model-updates, and can reveal segments of individual model updates, under certain dropout and client-server collusion patterns. To prevent this privacy breach, we propose an information-theoretic secure aggregation scheme that tolerates client drop-outs, and up to $T$ semi-honest clients that collude with each other and with the server, under heterogeneous quantization at clients. Our protocol utilizes the $(T+1, N)$ threshold black-box secret sharing construction, where secret shares of the client updates, despite belonging to distinct algebraic groups owing to different quantization, are generated from identical linear integer systems.

fields
Information Theory
pdf ↗ page arXiv:2610.35833 ↗

Number Theory39

We prove that the unnormalized discrepancy function of every $n$-point set in the unit square has absolute value at least $c\sqrt{1+\log n}$ on a set of measure at least $η$, with absolute constants $c,η>0$. Consequently, its $L_p$-quasinorm is bounded below by $c\,η^{1/p} \sqrt{1+\log n}$ for every $p>0$.

comments
14 pages
fields
Number Theory
pdf ↗ page arXiv:2610.33085 ↗

In this paper, we calculate the unit groups and the $2$-class numbers of the fields $ \mathbb{Q}(\sqrt{2}, \sqrt{q}, \sqrt{rs})$, where $q\equiv3\pmod4$, $r$ and $s$ are distinct prime numbers satisfying some congruent conditions. As an application of our main results, we derive the precise 2-class number for each field in our family. Furthermore, we show that Greenberg's conjecture is verified for several infinite families of real biquadratic fields.

comments
15 pages
fields
Number Theory
pdf ↗ page arXiv:2610.33110 ↗

Recently, Guo and Guo (Results Math $76:37, ~2021$) obtained curious $q$-analogues of the following two supercongruences conjectured by Guo and Schlosser \cite[Conjectures $12.6$ and $12.7$]{GuoSclssr ConstApprox 21}: \begin{align*} \sum_{n=0}^{(p-1)/3} (6n+1) \frac{\left(\frac{1}{3}\right)_n^{4}(2n)!} {(n!)^{4}\left(\frac{2}{3}\right)_{2n}} \equiv p \pmod{p^{3}} \qquad \text{for primes } p\equiv 1 \pmod{3}, \end{align*} \begin{align*} \sum_{n=0}^{(p+1)/3} (6n-1) \frac{\left(-\frac{1}{3}\right)_n^{4}(2n)!} {(n!)^{4}\left(-\frac{2}{3}\right)_{2n}} \equiv p \pmod{p^{3}} \qquad \text{for primes } p\equiv 2 \pmod{3}, \end{align*} where $(z)_n=z(z+1)\cdots(z+n-1)$ denotes the shifted factorial. In this paper, we establish a one-parameter extension of them. The main ingredients of our proofs are the creative microscoping method developed by Guo and Zudilin \cite{guo2019q} and Andrews' multi-series transformation.

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

We study the density of primes such that $a_p$ is divisible by a prime above $2$ for modular forms $f = \sum_{n \ge 1} a_n q^n$ of small levels. First, we reduce the problem to low weight and odd level, or a mod $2$ CM type form. Then, we provide calculations for the evenness of particular newforms. In particular, we provide a list of levels where this "evenness" can be computed exactly for all the forms with trivial nebentypus.

comments
11 pages, 1 figure
fields
Number Theory
pdf ↗ page arXiv:2610.33296 ↗

Let $q$ be a fixed odd prime power with $q\equiv2\pmod3$. We study the first moment of primitive cubic Dirichlet $L$-functions over $\Fq(T)$, ordered by their genus. By averaging the rational sieve variable in the double Dirichlet series of Hong and Fang, we obtain meromorphic continuation beyond the secondary polar divisor. Combining this continuation with the cubic Gauss-sum residues computed by David, Florea and Lalín gives an explicit term of order $q^{5g/6}$, with a real coefficient depending on $g$ modulo $6$, and an error $O_{q,\eps}(q^{(23/28+\eps)g})$. The periodic coefficient is not identically zero. The proof uses an exact first difference supplied by the functional equation, an Euler product for the sieve average, and Bochner's tube theorem in the Dirichlet variables.

fields
Number Theory
pdf ↗ page arXiv:2610.33505 ↗

Let $S_k(x)=1^k+\cdots+x^k$. We study perfect-power values of $S_k(x)$ by combining local valuations with finite congruence certificates. For an irregular Bernoulli pair $(p,r)$ with $e=v_p(B_r)\ge1$, we prove a valuation formula uniform for $k\equiv r+1\pmod{p^e(p-1)}$, subject to an explicit condition on $v_p(x(x+1))$. This gives explicit families of nonexistence results in which both $x$ and $k$ are unbounded. We also determine all solutions of $S_k(x)=y^n$ for $3\le x\le10^6$ with $x\equiv0,3\pmod4$, leaving $k$ and $n\ge2$ unrestricted and including squares. This extends Hajdu's fixed-$x$ classification in the same residue classes. A uniform restriction on the normalized odd part of $S_k(x)$ and finite certificates exclude every $k\ge6$; the remaining exponents are checked by exact integer arithmetic. The certificates admit independent verification. We further prove a limitation of congruence tests of bounded prime-power depth and solve the equation for every $x\equiv28\pmod{5\,110\,664}$.

fields
Number Theory
pdf ↗ page arXiv:2610.33567 ↗

Let $K$ be a number field or a function field of a curve. Let $f$ be a dominant rational self-map of a normal projective variety $X$ of dimension $d$ over $K$, and let $h_H\geq1$ be an ample Weil height. Let $λ_1(f)$ denote the first dynamical degree of $f$. We show that there is a constant $C_{f,h_H}>0$ such that, for any $n\geq1$ and any point $P\in X(\overline{K})$ with well-defined forward orbit, $h_H(f^n(P))\leq C_{f,h_H}h_H(P)n^{2(d-1)}λ_1(f)^n$ if $λ_1(f)>1$, and $h_H(f^n(P))\leq C_{f,h_H}h_H(P)n^{2d}$ if $λ_1(f)=1$. Over number fields, the proof combines a new uniform upper bound for arithmetic degrees with a uniform comparison of point heights. Over function fields, it relies on the corresponding uniform upper bound for geometric degrees on a projective model.

comments
25 pages
fields
Number Theory, Algebraic Geometry, Dynamical Systems
pdf ↗ page arXiv:2610.33570 ↗

In this paper we consider the error term in the expected count of squarefree values of a polynomial when evaluated at integers \(n\le N\). We prove a power saving on average over polynomials of fixed degree and height at most \(H\). Our results improve previous estimates of Browning and Shparlinski in that the required range of \(H\) is independent of the degree, but depends on \(N\)

comments
14 pages
fields
Number Theory
pdf ↗ page arXiv:2610.33628 ↗

Let $m\geq 2$ be an integer, and let $d\geq 2$ be an even integer. We study monic, reciprocal, non-cyclotomic polynomials $$ P(x)=x^d+a_{d-1}x^{d-1}+\cdots+a_1x+1\in\mathbb{Z}[x]. $$ For a fixed residue class $r\in\{0,1,\ldots,m-1\}$, we prove that there exists an effectively computable constant $c_{r,m}>1$ such that the Mahler measure $$ M(P)\geq c_{r,m} $$ for every irreducible polynomial $Q$ whose inner coefficients satisfy $$ a_j\equiv r\pmod m \qquad (1\leq j\leq d-1). $$ Moreover, we explicitly compute the constant $c_{r,m}$ in terms of $r$ and $m$. For the residue classes $r=2$, $r=3$, and $r=m-1$, we obtain improved lower bounds for suitable ranges of the modulus~$m$. We also consider monic, reciprocal, irreducible, non-cyclotomic polynomials whose inner coefficients belong to two distinct residue classes modulo $m$. More precisely, if the inner coefficients with odd indices are congruent to $a\pmod m$ and those with even indices are congruent to $b\pmod m$, where $a\not\equiv b\pmod m$, then we prove the existence of a constant $c_{m,a,b}>1$ such that the Mahler measure $$ M(P)\geq c_{m,a,b}. $$ These results solve Lehmer's problem for several families of polynomials. We also construct infinitely many examples in every even degree $d\geq 2$ of monic, reciprocal, irreducible, non-cyclotomic polynomials over $\mathbb{Q}$, together with explicit information about their Mahler measures. Our proofs rely on Y. Bilu's equidistribution theorem and its effective version proved by C. D'Andrea \emph{et al.}, as well as on a method developed by P. Borwein \emph{et al.} While it is natural to consider Bilu's equidistribution results in conjunction with the Borwein {\it et al}. method to Lehmer's problem, we are not aware of any previous work in the literature that employs this particular approach.

fields
Number Theory
pdf ↗ page arXiv:2610.33631 ↗

Let $X$ be a curve over $\mathbb{F}_q$. Denote by $N(X)$ and $g(X)$ the number of $\mathbb{F}_q$-rational points and the genus of $X$ respectively. The Ihara constant \begin{equation*} A(q)=\limsup_{g(X)\to\infty}\frac{N(X)}{g(X)} \end{equation*} measures the asymptotic abundance of rational points on curves over $\mathbb{F}_q$. In this paper, we study the Zassenhaus filtration of pro-$p$ groups arising from class field towers. By combining Golod–Shafarevich theorem, embedding problems and central class field theory, we establish a new criterion for the infinitude of class field towers. As an application, we obtain an improvement on the best known lower bounds of Ihara constant $A(2)$ and $A(3)$ which are explicitly given by \[ A(2)\geq 0.317779\cdots \text{ and } A(3)\geq 0.496074\cdots. \]

comments
28 pages
fields
Number Theory
pdf ↗ page arXiv:2610.33649 ↗

Fix a finite field $\mathbf{F}_q$, an integer $m\ge2$ prime to $q$, and $2\leκ\le m$. For a uniformly chosen $κ$-power-free polynomial $F\in\mathbf{F}_q[x]$ of degree $D$, we determine the limiting joint distribution of the affine point counts of $y^m=F(x)$ over $\mathbf{F}_q,\ldots,\mathbf{F}_{q^n}$ as $D\to\infty$, with $q$ and $n$ fixed. The probability generating function is a finite Euler product with explicit local factors. Equivalently, the limiting vector is a sum of independent closed-point contributions, each of which may affect several extension degrees. We obtain the formula by specializing the equidistribution and motivic Euler product formalism of Bertucci-Howe. We then compute means, covariances, and moment expansions as $q$ varies in a fixed reduced residue class modulo $m$, after the degree limit has been taken. The one-field specialization recovers the power-free affine point-count distribution of Cheong-Wood-Zaman.

comments
19 pages
fields
Number Theory, Probability
pdf ↗ page arXiv:2610.33847 ↗

Prime numbers are mathematical concepts of particular interest because of their relative rarity among integers, as well as the relative unpredictability of their occurrence and density along the integer sequence. They constitute the building blocks of all other composite numbers, giving rise to the interesting and important concept of prime factorization, a process guaranteed by the fundamental theorem of arithmetic. Among the several works that have been reported about prime numbers and their interrelationship with composite numbers, some have considered derived graphs and/or networks. In this paper, we derive some topological features of a bipartite complex network of prime factors and composite numbers. More specifically, we prove mathematically that the network's diameter is exactly five regardless of the number of nodes. In particular, we show that certain nontrivial sub-networks have minimal diameter equal to four, which is, again, independent of the number of nodes as long as the network is large enough. The last shows that this network is of small-world type. We also characterize exactly the number of boundary nodes in the network and present a couple of algorithms to identify the most important, relevant, influential, or central nodes of the network. Finally, we focus on the computation of the information dimensions on the basis of Shannon and Tsallis entropies of the studied complex network. The results show both decreasing as the number of nodes increases. Furthermore, both entropies indicate that box coverings at the diameters \(\varepsilon=[3,4]\), group nodes into roughly the same number of boxes, independent of the number of nodes in the network.

fields
Number Theory
pdf ↗ page arXiv:2610.33873 ↗

Coleman integration is an important computational ingredient of the Chabauty–Coleman method and its extensions. We extend the Balakrishnan–Tuitman algorithm to general smooth projective curves with good reduction over arbitrary finite extensions of $\mathbb{Q}_p$, allowing both ramification and nontrivial residue degree. Given a suitable plane model and integral bases, we provide explicit precision bounds and an accompanying Magma implementation. As an application, a single-prime computation at $p=19$ over the unramified quadratic extension $\mathbb{Q}_{19^2}/\mathbb{Q}_{19}$ recovers all $35$ affine sporadic quadratic divisors on $X(s3,ns5)$ over $\mathbb{Q}(\sqrt5)$. Completeness is proved in an appendix using symmetric Chabauty and a Mordell–Weil sieve.

fields
Number Theory
pdf ↗ page arXiv:2610.33970 ↗

Let $C_k=\binom{2k}{k}/(k+1)$ be the $k$-th Catalan number, and let $p$ be an odd prime. We establish exact finite-sum identities that, together with known binomial supercongruences and reductions of Sun, yield $\sum_{k=0}^{(p-1)/2}\frac{C_k^3}{16^k}\equiv2-24y^2-\frac{5p^2}{2y^2}\pmod{p^3}$ when $p=x^2+3y^2\equiv1\pmod3$, and $\sum_{k=0}^{(p-1)/2}\frac{C_k^3}{(-8)^k}\equiv-1-48y^2-\frac{33p^2}{16y^2}\pmod{p^3}$ when $p=x^2+4y^2\equiv1\pmod4$. We also evaluate the corresponding sum with denominator $16^k(k+1)^2$, and obtain two weighted Catalan supercongruences. The finite identities follow from the ratios of consecutive summands, symmetry of double sums, and telescoping. All endpoint terms are retained over the rational numbers before any modular reduction. In each bilinear identity, one endpoint denominator equals $p$; its cancellation produces the necessary term of order $p^2$. The precise arithmetic inputs are stated separately.

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

The Characterization Problem asks whether a finite abelian group with Davenport constant at least four is determined, up to isomorphism, by its system of length sets. This is a central inverse problem in non-unique factorization theory: it asks whether the possible numbers of irreducible factors retain enough information to recover the underlying class group. For rings of integers of algebraic number fields, an affirmative answer means that the ideal class group can be recovered from these factorization lengths alone. We resolve this problem for all homocyclic groups $C_n^r$: if $G$ is a finite abelian group with $\mathsf D(G)\ge4$ and $\mathcal L(G)=\mathcal L(C_n^r)$, then $G\cong C_n^r$. The cross number of a sequence is the sum of the reciprocals of the orders of its terms. This weighted measure of sequence length links zero-sum theory with half-factoriality, and determining its maximal value for minimal zero-sum sequences is a longstanding extremal problem. We also obtain an exact formula for the maximal cross number of minimal zero-sum sequences over subsets whose minimum distance is divisible by the rank of the ambient group minus one. For $G\cong C_{n_1}\oplus\cdots\oplus C_{n_r}$ with $1<n_1\mid\cdots\mid n_r$ and $r\ge\max\{2,n_r-2\}$, we prove \[ \mathsf K(G,r-1)=1+(r-1)\sum_{p\mid n_1} \left(1-p^{-\mathsf v_p(n_1)}\right), \] which is a key ingredient in resolving the Characterization Problem for homocyclic groups.

fields
Number Theory, Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2610.34288 ↗

We study three innocent-looking recurrences modulo $3$, each built from squares of two earlier terms. One of them turns out to be secretly $\textit{linear}$, and we can compute its periods exactly. One is a $\textit{permutation}$ hiding a small, perfectly orderly piece inside a large, random-looking one. The third looks thoroughly random, but it still has a few provable features. Along the way we meet open problems that need nothing beyond a first course in abstract algebra to state. This paper is a starting point, not the final word in any sense.

comments
10 pages
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2610.34300 ↗

We investigate the stability of the $2$-rank in the cyclotomic $\mathbb{Z}_2$-extension of real biquadratic number fields. We determine several families of real biquadratic fields $F$ for which the ranks of the $2$-class group $A(F)$ and the associated $2$-Iwasawa module $A_\infty(F)$ are both equal to $3$. More precisely, we provide a complete classification of all fields $F=\mathbb{Q}(\sqrt{q},\sqrt{d}),$ where $q\equiv 3\pmod{4}$ is a prime number and $d$ is an odd positive square-free integer, and all fields $F=\mathbb{Q}(\sqrt{2q},\sqrt{d}),$ where $q\equiv 3\pmod{4}$ is a prime number and $d\equiv 1\pmod{4}$ is a positive square-free integer, for which $ \operatorname{rank}(A(F))=\operatorname{rank}(A_\infty(F))=3.$

comments
13 pages
fields
Number Theory
pdf ↗ page arXiv:2610.34400 ↗

We prove a four-parameter extension of Zhao's series for $ζ(5)$. Restricting a Wilf-Zeilberger seed of Au to a hyperplane, we obtain a summand in five parameters with zero sum that is symmetric under all their permutations. Summing it from two different starting points gives two trigonometric closed forms, which we prove by Guillera's periodicity argument. The proof is self-contained, and also gives a companion series for $1/π^2$, which we have not found in the literature. Specializing the parameters at roots of unity, we obtain Borwein-Bradley-type identities whose products depend only on $x^2$, $x^3$, $x^4$ or $x^5$. Their Taylor coefficients are Apéry-like series for odd zeta values and for products of zeta values. In particular, we prove five identities conjectured by Au.

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

A prime gap $(p_n, p_{n+1})$ is \textit{frangible} if the smallest prime divisor of every integer $m$ with $p_n<m<p_{n+1}$ is strictly less than the size of the gap, $p_{n+1}-p_n$. Gafni and Tao recently proved that the number of frangible gaps up to $X$ is $\ll X/\log^2 X$, answering a question of Erdős. They also showed that under the Dickson–Hardy–Littlewood prime tuples conjecture this number is $\sim c X/\log^2 X$ for a constant $c$, for which they obtained a rough estimate. We describe improved methods for estimating this constant under the same hypothesis, and establish that its value lies in $[2.7416, 2.7984]$, confirming a speculation of Gafni and Tao. In addition, we present the results of a complete survey of frangible gaps up to $10^{17}$. An ensuing empirical measurement of $c$ matches our estimate very well.

comments
19 pages
fields
Number Theory
pdf ↗ page arXiv:2610.34525 ↗

We prove that if the smallest modulus of a covering system is a prime $q \ge 11$, then the sum of the reciprocals of the moduli is at least $1+10^{-28}$. This improves on a previous more general bound of the first two authors in this particular case. We also show that it is impossible to construct a covering system using distinct multiples of $q$ as moduli. Finally, we show as a corollary that it is impossible to construct $10$ distinct covering systems with the property that no modulus is used in more than one of the covering systems.

comments
13 pages
fields
Number Theory
pdf ↗ page arXiv:2610.34541 ↗

Let $\mathcal O_K$ be the ring of integers of a number field $K$. A finite subset $\mathcal H=\{η_1,\ldots,η_k\}\subset\mathcal O_K$ is said to be \emph{admissible} if for every prime ideal $\mathfrak p$ in $\mathcal O_K$, the reductions of the $η_i$ modulo $\mathfrak p$ do not represent every residue class. The diameter of a finite subset $S$ of $\mathcal O_K$ is defined to be \[\mathrm{diam}(S):= \max_{η_i,η_j\in S:η_i\neqη_j}|\mathcal N(η_i-η_j)|\] where $\mathcal N$ denotes the norm down to the rational field. This paper computationally investigates admissible subsets of rings of integers in imaginary quadratic fields of class number 1 (such as the Gaussian integers or the Eisenstein integers) that are large relative to their diameter. The motivation is twofold. Firstly, there is the improvement of results analogous to the question of an upper bound for the least gap between large rational primes, which has been one of the great number theoretic successes of the twenty-first century. A second motivation is that there is the opportunity to disprove a variation of the second Hardy-Littlewood conjecture. The calculations in the paper provide new records on the smallest distance between primes in the fields in question, and explicit counter-examples to a generalisation of the second Hardy-Littlewood conjecture in all bar one of the fields.

comments
16 pages, 8 figures
fields
Number Theory
pdf ↗ page arXiv:2610.34556 ↗

Motivated by Clark's work on Euclidean quadratic forms, we introduce trace Euclidean and house Euclidean quadratic lattices over totally real number fields, and relate these concepts through the $p$-norm Euclidean property. We prove that, as $F$ varies over all totally real number fields of arbitrary degree, there are only finitely many positive definite trace Euclidean $\mathcal{O}_{F}$-lattices of arbitrary rank $n\ge1$, up to isometry. For every $p\in[1,\infty]$, the same finiteness holds for positive definite $p$-norm Euclidean lattices. We also classify all positive definite trace Euclidean lattices of rank one over real quadratic fields: there are exactly six isometry classes, and every such lattice is free. As a corollary, the trace Euclidean real quadratic fields are precisely $\mathbb{Q}(\sqrt{2})$, $\mathbb{Q}(\sqrt{5})$, and $\mathbb{Q}(\sqrt{13})$.

comments
26 pages, 5 tables
fields
Number Theory
pdf ↗ page arXiv:2610.34604 ↗

For $E\subset\mathbb{F}_p^d$, let $Δ(E)=\{Q_d(x-y):x,y\in E\}$, where $Q_d(z)=z_1^2+\cdots+z_d^2$. We introduce and study the problem of the existence of nondegenerate three-term geometric progressions in the distance set $Δ(E)$ when $d$ is odd. If $M_{GP,d}(p)$ denotes the largest size of a set whose distance set contains no such progression, then, for every prime $p\geq7$ and every integer $m\geq0$, \[ p^mM_{GP,1}(p)\leq M_{GP,2m+1}(p) \leq4p^mM_{GP,1}(p). \] For all sufficiently large primes $p$, we also prove \[ p^{m+\frac{7}{26}}\leq M_{GP,2m+1}(p) \leq Cp^{m+\frac{16}{25}}, \] where $C$ is an absolute positive constant.

comments
25 pages
fields
Number Theory, Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2610.34758 ↗

Shannon, Shiue, Saito and the author \cite{SSHS2025} studied the sets $X_k=\{n\in\mathbb{N}:\varphi(n)=k\}$ in connection with Carmichael's totient conjecture, and proved that for an odd prime $p\neq3$ and $s\in\{1,2,3,4\}$, $X_{2p^s}$ is empty whenever $2p^s+1$ is not prime (with $s=1$ fully characterized in both directions), conjecturing that this persists for every $s\ge1$. We resolve that conjecture in full, obtaining a complete characterization of $X_{2p^s}$ for every $s\ge1$ and every odd prime $p\neq3$, together with a parity dichotomy: $X_{2p^s}=\varnothing$ unconditionally whenever $s$ is even, while for odd $s$ both outcomes genuinely occur, determined exactly by the primality of $2p^s+1$. We then close the one remaining gap at $p=3$, where the proof technique degenerates, with a separate, unconditional characterization of $X_{2\cdot3^s}$. Building on these results, we consider the natural generalization $X_{qp^s}$, where $q\neq p$ are distinct primes and $s\ge1$. We show that this generalization splits into three cases of very different character. If $q$ and $p$ are both odd, the problem is trivial: $qp^s$ is odd, so $X_{qp^s}=\varnothing$ by elementary parity, with no case-analysis needed. If $q=2$, the problem is exactly the family $X_{2p^s}$ resolved above. If $p=2$, giving the ``mirror'' family $X_{2^sq}$ for an odd prime $q$, the problem is genuinely different. Beyond $s=1$, we give a complete resolution for $s=2$, recovering, with an explicit proof and solution sets, the qualitative dichotomy of \cite[Thm.~2.3.1]{SSHS2025}, but the problem remains open for $s\ge3$.

fields
Number Theory
pdf ↗ page arXiv:2610.34808 ↗

We update Hartl's dictionary between $p$-adic Hodge theory and its equicharacteristic analog to include aspects related to the Hodge–Tate filtration in $p$-adic Hodge theory and its equicharacteristic analog, the Hodge–Tate–Taguchi filtration. Using this update, we establish a transcendence characterization of equicharacteristic local shtukas with abelian Tannakian structure group, matching a result of Howe–Klevdal in the $p$-adic setting. A special case of this result says that a formal Drinfeld module over an equicharacteristic local field has complex multiplication if and only if the Hodge–Tate–Taguchi filtration on its $z$-adic Tate module is algebraic.

comments
21 pages + references, comments welcome
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2610.34822 ↗

In 1965, Chowla conjectured that the mean value of the Liouville function at non-square one-variable polynomials is zero. This conjecture is a generalization of the prime number theorem (PNT). In 2022, Bergelson and Richter established a dynamical generalization of this form of the PNT. For non-square multivariate polynomials, one also expects that Chowla's conjecture is true. In this article, we extend Bergelson and Richter's result to multivariate polynomials whose Birch rank is sufficiently large in terms of their degree. We also establish analogous results for averages over integer points on algebraic varieties.

comments
31 pages
fields
Number Theory, Algebraic Geometry, Dynamical Systems
pdf ↗ page arXiv:2610.34912 ↗

We show that the number of $3\times 3$ matrices with given characteristic polynomial and entries in $\mathbb{Z}\cap [-H,H]$ is at most $c H^{3}(\log H)^{6}$ for all $H\ge 2$, where $c>0$ is an absolute constant.

fields
Number Theory
pdf ↗ page arXiv:2610.34973 ↗

Let $p\geq3$ be a prime number. We prove that the action of the Galois group on the field of norms of the $p$-adic false Tate curve extension $\mathbf{Q}_p\left(ζ_{p^\infty},p^{1/p^\infty}\right)$ of $\mathbf{Q}_p$ is not liftable to its Cohen ring with respect to any admissible coefficient field.

comments
17 pages
fields
Number Theory
pdf ↗ page arXiv:2610.35006 ↗

Let $A, B$ be infinite sets of non-negative integers with $n\in A+B$ for all sufficiently large integers $n$. We prove that if $A(x)B(x)-x$ does not tend to infinity, then $$\limsup_{x\to\infty}\frac{A(x)B(x)}{x}\in\Big[\frac{3}{2}, 2\Big].$$ The lower bound is sharp, and confirms a conjecture of Chen. Our proof is based on the weak limits and the convolution factorization theorem of Gabardo and Lai. A discrete proof of the same bound was also given by Zhang. Motivated by the known spectrum of perfect additive complements, we conjecture that the interval $(3/2, 8/5)$ is also excluded for almost perfect additive complements.

fields
Number Theory
pdf ↗ page arXiv:2610.35027 ↗

Let $K$ be a fixed number field of degree $d$. We prove two determinant-method results for integral points over $\mathcal O_K$ in boxes whose coordinates may have different size bounds: a Bombieri-Pila type estimate for affine plane curves that retains the two separate coordinate bounds, and a Salberger-Browning covering theorem for affine surfaces. If $F\in\mathcal O_K[X_1,X_2]$ is irreducible and $T=\max B_1^{e_1}B_2^{e_2}$ over the monomials occurring in $F$, then \[ N_K(F;B_1,B_2)\ll T^\varepsilon \exp\!\left(d\frac{\log B_1\log B_2}{\log T}\right). \] For an absolutely irreducible surface in three variables we obtain a covering by $O(T^\varepsilon V_{3,K})$ bounded-degree auxiliary hypersurfaces, outside $O(T^\varepsilon V_{3,K}^2)$ exceptional integral points, where \[ V_{3,K}=\exp\!\left(d \left(\frac{\log B_1\log B_2\log B_3}{\log T}\right)^{1/2}\right). \] These are the number-field analogues of determinant-method estimates for unequal coordinate ranges developed in the rational setting by Browning and Heath-Brown, Salberger, Browning, and Chow-Dietmann. We then apply them to Galois resolvents of monic degree-$n$ polynomials over $K$. Independently, a large-sieve argument, in the tradition of Gallagher's probabilistic Galois theory, gives $O_{K,n}(N^{dn-d/2}\log N)$ exceptional separable polynomials, while effective Hilbert irreducibility over global fields gives subgroup-sensitive bounds with exponent $d(n-1+1/[S_n:G])$, up to logarithms. We record the interaction with the discriminant-square equation for even groups, congruence restrictions, and rectangular coefficient boxes. All determinant estimates used in the applications are proved in the paper; no conjectural global-field determinant statement is assumed.

fields
Number Theory
pdf ↗ page arXiv:2610.35030 ↗

We study the density of uncovered sets arising from finite families of residue classes over Dedekind domains with finite residue norms. Building on the distortion method of Balister, Bollobás, Morris, Sahasrabudhe and Tiba, we prove a general weighted density criterion in which the weight attached to a prime ideal is allowed to vary. In the critical Mertens regime this yields, for every \(\varepsilon>0\), the admissible prime-ideal weight \[ 1+\frac{(\log N\mathfrak p)^3(\log\log N\mathfrak p)^{1+\varepsilon}}{N\mathfrak p}, \] up to a harmless modification at finitely many small prime ideals. This is asymptotically smaller than the fixed weight \(1+(\log N\mathfrak p)^{3+\varepsilon}/N\mathfrak p\) appearing in the earlier density theorem. The result is valid for systems of any fixed multiplicity and, for multiplicity one, requires the ideal moduli themselves to be distinct but not their norms. We then place the analytic hypotheses in Knopfmacher's Axiom~A framework. In the critical case of Axiom~A with exponent \(1\), the prime-ideal estimates needed by the weighted theorem are automatic. More generally, under Axiom~A with exponent \(ρ>0\), we prove a weighted mean-value theorem on ideals; in the subcritical range \(0<ρ<1\), a first-moment argument shows that sufficiently large moduli cover an arbitrarily small proportion of the ambient space. We also explain that the distortion construction itself only uses a compatible system of finite residue spaces with uniform fibres and a Chinese-remainder-type product structure, suggesting a possible extension beyond Dedekind domains. Finally, we show that a direct passage from the second moment to higher integer moments does not lower the logarithmic exponent \(3\) within this moment hierarchy.

fields
Number Theory
pdf ↗ page arXiv:2610.35139 ↗

For binary recurrence sequences, $\left( y_{k} \right)_{k \in \bbZ}$, arising from the solutions of generalised Pell equations, $X^{2}-dY^{2}=c$, where $y_{0}$ is any positive square and $c=-2^{\ell}p^{m}$ for an odd prime $p$ and non-negative integers $\ell$ and $m$, we show that there are at most $4$ distinct squares with $y_{k}$ sufficiently large. From this result, we also show that there are at most $7$ distinct squares when $y_{0}=1,2^{2},\ldots,7^{2}$, or once $d$ exceeds an explicit lower bound, without any conditions on the size of such squares.

comments
published, with corrections
journal
Research in Number Theory, volume 12, article 6 (2026)
fields
Number Theory
pdf ↗ page arXiv:2610.35158 ↗

Let $a_k(n)$ denote the number of partitions of $n$ in which even parts occur in one color and odd parts may occur in $k$ colors. We prove infinite families of congruences modulo powers of $7$ for $a_k(n)$ when $k \in \{4,5,7\}$. For each positive integer $α$, let $λ_{k,α}$ be the least nonnegative solution of $24λ_{k,α}\equiv-(k-2)\pmod{7^α}$. Then, we show that \[ a_k(7^αn+λ_{k,α}) \equiv 0\pmod{7^{\lfloor(α+1)/2\rfloor}} \] for every nonnegative integer $n$. These results extend congruences modulo $7$ of Hirschhorn and Sellers (2026) and complement Chen's (2025) congruences for the reciprocal crank parity function $a_3(n)$.

comments
24 pages
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2610.35292 ↗

Spectral zeta functions and zeta-regularized determinants encode the spectrum of an operator in analytic functions. Over the completion $\mathbb C_\infty$ of an algebraic closure of $\mathbb F_q((π))$, two features of characteristic $p$ break this classical picture. Complex powers have exponents that vary only continuously in $\mathbb Z_p$, not analytically. Scalar traces record eigenvalue multiplicities only modulo $p$. We develop a resolvent-based theory that treats these two obstructions separately. For the first, inverse Stieltjes duality turns suitable scalar resolvents into locally analytic spectral distributions on $\mathbb F_q[[π]]$. A single exponent of the Mellin transform already determines the distribution and the entire Mellin family. We characterize exactly which power series arise in this way, by a growth condition on Carlitz moments. The criterion depends on the support: bounded Taylor coefficients are not sufficient. For stationary digit measures, the transform is the unique fixed point of an explicit contraction. The first $q-1$ nonconstant moments recover the measure. For the second, we replace traces by the Frobenius defect $F/σ(F)$, where $σ$ raises coefficients to their $q$th powers. On power series with small coefficients, this map is a group automorphism that preserves Gauss distances, and a convergent infinite product inverts it. Polynomial defects produce entire functions. They characterize exactly the diagonal spectra that are finite unions of forward Frobenius orbits, counted with multiplicity. For the shifted Carlitz operator, the resulting Fredholm determinant is a normalized reciprocal of the Anderson–Thakur function, and its Newton polygon is determined exactly.

comments
38 pages
fields
Number Theory, Mathematical Physics
pdf ↗ page arXiv:2610.35306 ↗

We study the structure over $\mathbb{Z}_p$ of the Hecke algebra acting on ordinary cusp forms in the Eisenstein, non-$p$-distinguished case. Our results and methods draw on four complementary approaches: deformation theory, through $R=\mathbf{T}$ theorems; Iwasawa theory, through connections to Sharifi's conjecture; $p$-adic $L$-functions, through an exceptional zero formula; and computational experiments using Magma. We also obtain new results regarding the Coleman–Greenberg conjecture.

comments
56 pages. Comments welcome!
fields
Number Theory
pdf ↗ page arXiv:2610.35559 ↗

We investigate the Hasse principle for systems consisting of one form of degree $k$ which decomposes as a sum of $n$-ary forms, and one general form of degree $d < k$. By exploiting the block structure of the first form before applying Weyl differencing, we refine the method of Brandes and Parsell (arXiv:2003.04350) in this setting; in particular, for a sum of binary quartic forms and a quadratic form, the requirement $s > 516$ is relaxed to $s > 96$, which also improves on the bound $s > 100$ available for general forms.

comments
14 pages
fields
Number Theory
pdf ↗ page arXiv:2610.35639 ↗

We prove two universality theorems for neural networks consisting of a single neuron. First we prove a strong form of the Bovdi–Geche universality conjecture on neurons over finite fields, where the activation function is a certain modification of the discrete logarithm, using the Weil bound on multiplicative character sums over finite fields. Then we show a generalisation of Aizenberg's universality theorem for complex binary neurons with a weight vector independent of the target function, positively answering another question in the literature. The proof of the latter uses an equidistribution theorem for the dilates of certain maps into tori.

comments
14 pages
fields
Number Theory, Rings and Algebras
pdf ↗ page arXiv:2610.35645 ↗

We answer a question of Goncharov by showing that his Grassmannian $n$-logarithm can be recovered by integrating the Borel invariant form on the symmetric space $\mathrm{SL}_{n}(\mathbf{C})/\mathrm{SU}(n)$ over a naturally defined ideal simplex. As corollaries, we recover the finiteness of primitive canonical integrals of Brown and the evaluation for wheel graphs of Brown and Schnetz. We also compute explicitly the Gelfand-MacPherson forms for powers of the first Pontryagin class and give a general integral formula for the Gelfand-MacPherson forms associated to each component of the Pontryagin character.

comments
42 pages. Comments welcome!
fields
Number Theory, Algebraic Topology, K-Theory and Homology
pdf ↗ page arXiv:2610.35754 ↗

We strengthen the upper bound on the density of a lattice packing in small dimensions. A lattice cannot have too many short vectors; we modify the Cohn–Elkies linear program accordingly by allowing the auxiliary function to be positive on a short interval beyond the minimum distance. For $11 \leq n \leq 16$, our bound is tighter than the three-point bound of Cohn, de Laat and Salmon. For $n \in [17, 23] \cup [25, 40] \cup [43, 57] \cup [62, 75]\cup [83, 91]$, our bound lies below the published numerical values of the Cohn–Elkies bound.

comments
links to a GitHub repository with relevant numerical data
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2610.35830 ↗

Algebraic Geometry38

Let $S$ be a minimal complex surface of general type with $K_S^2=p_g(S)=1$. By a theorem of Catanese, the canonical model of $S$ is a complete intersection of two sextics in $\mathbf{P}(1,2,2,3,3)$ whose equations admit a normal form, and the global Torelli theorem fails for these surfaces. We describe $\operatorname{Aut}(S)$ in terms of the coefficients of the normal form, prove that $|\operatorname{Aut}(S)|\leq 72$, and classify the surfaces attaining the bound: two surfaces with singular canonical model and a one-parameter family $X_r$ of smooth surfaces. For the surfaces $X_r$ we compute a basis of the primitive cohomology consisting of eigenvectors of a subgroup $\mathbf{Z}/6\mathbf{Z} \times \mathbf{Z}/6\mathbf{Z}$ of $\operatorname{Aut}(X_r)$, given by residues of explicit polynomials, together with the intersection form in this basis. We then show that the natural map from $\operatorname{Aut}(X_r)$ to the group of Hodge isometries of the primitive lattice modulo $\pm1$ is injective but has image of index at least $331\,776$, so that the Torelli principle for automorphisms fails for these surfaces.

comments
29 pages. Any comments are welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.33364 ↗

Periods of projective hypersurfaces satisfy GKZ hypergeometric systems, which may have solutions that do not arise as periods. For deformations of Fermat hypersurfaces, we describe the Gauss-Manin connection in terms of images of contiguity operators between GKZ systems. These images are also realized as Fourier transforms of minimal extensions of Kummer modules.

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

We prove that the movable cone of a smooth complex projective variety is the closed cone generated by possibly singular curves with ample coherent normal sheaves, answering a question of Boucksom–Demailly–Păun–Peternell. For smooth curves, we establish the analogous equality in several geometric settings and give explicit constructions on blowups.

comments
17 pages, comments are welcome!
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2610.33724 ↗

For a quasi-projective variety $X$ defined over a number field $k$, let $X'$ be its Weil restriction with respect to a finite field extension $k/k'$. We prove that the Brauer–Manin set of $X$ agrees with the Brauer–Manin set of $X'$. We also prove the agreement for Brauer–Manin set of them given by $\mathrm{Br}_1$.

comments
14 pages
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2610.33736 ↗

We prove identifiability results for constant-width residual networks with polynomial activations and bias terms. For activations of degree at least five with generic coefficients, the fiber over a generic parameter is a singleton. For activations of degree at least three with no linear term after a suitable translation of the input, the generic fiber is given by translating biases and then scaling weights and translated biases by real roots of unity. These results specialize to networks without bias terms. With the same proof technique, we further derive necessary conditions for critical points of the ResNet parametrization, that are central in singular learning theory.

fields
Algebraic Geometry
pdf ↗ page arXiv:2610.33738 ↗

In their celebrated work on the large-genus asymptotic expansion of Weil–Petersson volumes, Mirzakhani and Zograf left open the question of whether the Weil–Petersson constant satisfies $C_{\mathrm{WP}}=π^{-1/2}$. We resolve the conjecture affirmatively. Our strategy is to consider a family of spectral curves interpolating between $y=z-4z^3$ and $y=\sin(2πz)/(2π)$. For each fixed number $n\geq2$ of marked points, we normalize the cusp coefficients using the action integral and the derivative at its first positive zero. We prove that the logarithmic derivatives of these normalized coefficients with respect to the family parameter are $O_n(g^{-1})$, uniformly along the family. The proof combines the descendant recursion, positivity, the dilaton equation, KdV, and coefficient asymptotics for the Painlevé I equation.

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

We find explicit polynomial equations in their bicanonical embeddings into $\mathbb C\mathbb P^9$ for the pairs of fake projective planes labeled by $(C18,p=3,\{2\},D_3), (C18,p=3,\{2\},(dD)_3)$ and $(C18,p=3,\{2\},(d^2D)_3)$ in the Cartwright-Steger classification. We do this by starting with the equations of the commensurable fake projective plane labeled by $(C18,p=3,\{2I\})$ that were found in arXiv:2512.03213.

comments
6 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.33823 ↗

We prove that a polynomial mapping $\mathbb{R}^2 \to \mathbb{R}^2$ with nowhere zero Jacobian determinant is a global diffeomorphism provided the preimage of large circles are connected. In higher dimensions this result fails and we present families of counterexamples. Yet, in dimension $3$, we prove that if the preimages of large spheres are connected, then the Jelonek set of the mapping is not homeomorphic to a line and, provided that it has codimension at least $2$, cannot have a single end at infinity.

fields
Algebraic Geometry, Dynamical Systems
pdf ↗ page arXiv:2610.33875 ↗

We prove that the two-dimensional Jacobian conjecture $\mathrm{JC}_2$ implies the generalized Dixmier conjecture $\mathrm{DC}'_1$ for the first Weyl algebra $A_1$, which states, in one of several equivalent formulations, that every endomorphism of the two-by-two matrix ring $\operatorname{Mat}_2(A_1)$ is invertible. For the converse, an endomorphism of $\mathbb A^2_{\mathbb C}$ with Jacobian one gives rise to a family of holonomic $A_2$-modules over finite fields. One needs to lift this family to an $A_2$-module in characteristic zero with the prescribed arithmetic support. The existence of such a lift is a special case of Kontsevich's conjecture on holonomic $\mathcal D$-modules with prescribed arithmetic support. We prove that in this special situation such a lift is unique whenever it exists. If these lifts exists for every endomorphism with Jacobian one, then $\mathrm{DC}'_1$ implies $\mathrm{JC}_2$. For every $n\ge 3$, we construct a Lagrangian subvariety of $T^*\mathbb{A}^n$ that provides a counterexample to Kontsevich's conjecture. The counterexamples arise from the graph of a noninvertible symplectic endomorphism of $\mathbb A^4$ constructed by Long. We also present a different strategy for lifting $\mathcal D$-modules associated with a Jacobian-one endomorphism of $\mathbb A^2_{\mathbb C}$ to characteristic zero via ultraproducts and show that the existence of a characteristic-zero lift in this setting is equivalent to the uniform boundedness of the Berest–Wilson invariants of these $A_2$-modules, regarded as left $A_1$-modules. Finally, we study two other conjectures of Kontsevich on arithmetic support, giving a counterexample to one and partial results on the other.

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

Using the framework of delta characters on arithmetic jet spaces, we construct a canonical sequence of filtered isocrystals associated to an abelian scheme $A$ of relative dimension $g$ over a $p$-adically complete discrete valuation ring. These isocrystals map injectively via a canonical morphism into the first (rational) crystalline cohomology group $\mathbf{H}^1_{\mathrm{cris}}(A)$ of the abelian scheme $A$, directly generalizing a prior construction due to Borger and Saha. Pandit showed that the canonical morphism is a map of isocrystals. This then implies that the image of this canonical embedding coincides with the minimal subisocrystal $F_{\mathrm{cris}}(Ω_A)$ containing the space of invariant differential forms $H^0(A,Ω_A)$. Berthelot and Ogus showed that the dimension of $F_{\mathrm{cris}}(Ω_A)$ is $g$ if and only if $A$ has an endomorphism that lifts the absolute Frobenius on the special fiber of $A$. As a primary application, for a general abelian scheme $A$, we show that the minimal subisocrystal $F_{\mathrm{cris}}(Ω_A)$ can be viewed as a module obtained from primitive delta characters of $A$ via appropriate twists by the canonical Frobenius morphism $φ$ induced from the theory of arithmetic jet spaces. As a consequence, we show that the rank of $F_{\mathrm{cris}}(Ω_A)$ depends on numerical invariants arising from the theory of delta characters of $A$. More precisely, the dimension of $F_{\mathrm{cris}}(Ω_A)$ is given by the sum of the exact orders of the primitive delta characters associated to the abelian scheme $A$.

fields
Algebraic Geometry
pdf ↗ page arXiv:2610.33948 ↗

We compute the Hodge-Deligne polynomials of the moduli spaces $\overline{\mathcal M}_{2,n}$ of stable $n$-pointed curves of genus two, together with the action of the symmetric group $S_n$ on their cohomology, for all $n$. Using Hassett's moduli spaces of weighted pointed curves, we first show that the generating function of the $S_n$-equivariant Hodge-Deligne polynomials of $\overline{\mathcal M}_{g,n}$ is obtained from that of the moduli spaces of minimally weighted pointed curves by plethysm with the explicit symmetric function $Z=h_1-\sum_{k\ge3}(x+x^2+\dots+x^{k-2})h_k$; numerically, this is an explicit change of variables. The latter spaces map to $\overline{\mathcal M}_g$, and over each boundary stratum they are built from punctured universal curves and Losev-Manin spaces. Combining the stratification by stable graphs with Burnside's formula and twisted characteristics, we obtain in genus two a closed formula whose only non-elementary input is the cohomology of symplectic local systems on $\mathcal M_{1,1}$ and $\mathscr A_2$, known by work of Eichler-Shimura and Petersen. This determines the $S_n$-representations on all $H^{p,q}(\overline{\mathcal M}_{2,n})$ for $n\le 19$ and on all even degree $H^{p,q}(\overline{\mathcal M}_{2,n})$ for every $n$. We carry out the computation in all degrees for $n\le 18$, where it agrees with an independent computation by point counts, and in even degrees for $n\le 30$. As an application, we find that the even degree cohomology of $\overline{\mathcal M}_{2,n}$ is of Hodge-Tate type if and only if $n\le 20$: the space $H^{23,1}(\overline{\mathcal M}_{2,21})$ is the multiplicity free $S_{21}$-representation with Frobenius characteristic $s_1\cdot h_2[e_{10}]$, of dimension $1939938$, so that $H^{24}(\overline{\mathcal M}_{2,21})$ is not spanned by algebraic cycle classes.

comments
28 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.33971 ↗

A rational point of the moduli space $\mathcal{M}_3$ of cubic rational maps is fine if its conjugacy class contains a map defined over $\mathbb{Q}$, and coarse otherwise. In the invariants $ξ_0,\dots,ξ_5$ that embed $\mathcal{M}_3$ in $\mathbb{P}(2,2,3,3,4,6)$, we prove that a point with trivial automorphism group is fine if and only if the quaternion algebra $(-m_{12},-2ξ_0)_{\mathbb{Q}}$ splits, where $m_{12}=\frac{1}{3}ξ_0^2ξ_1+ξ_0ξ_4-ξ_3^2$; we give the analogous criterion on the locus $\mathcal{L}_2$ of maps with an involution and show that all other strata are fine. The proof is constructive and yields an explicit descent. We prove that the obstruction class is unramified along every divisor of the compactification, that a prime $p\ge 5$ obstructs only if the point reduces modulo $p$ into the closure of one of the two codimension-two loci $\mathcal{L}_1$, $\mathcal{L}_2$ of maps with an involution, and that $\mathcal{M}_3$ has transverse $A_1$-singularities along both, above which the class ramifies; local densities predict that $\mathcal{L}_2$ is met modulo $p$ with probability $\asymp 1/p$, so that it carries the obstruction. A census of all 214,260,288 rational points of weighted moduli height at most 7 agrees with this mechanism and supports the conjecture that the proportion of fine points tends to zero like $(\log B)^{-1/2}$.

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

We prove an explicit bound for the torsion subgroup of the Néron–Severi group of a smooth projective complex variety. The proof combines the Diophantine-approximation method of Ziyang Gao and the author (https://arxiv.org/abs/2608.22285) with Lefschetz fibrations. As an application, we deduce an explicit bound for the torsion sections of a traceless abelian scheme over a complex curve.

comments
19 pages. Comments welcome!
fields
Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2610.34115 ↗

We present a tropical homotopy method for computing the numbers of ovals and unbounded components of a real plane algebraic curve, together with the pairing of its ends at infinity. Under explicit support and nondegeneracy assumptions, the homotopy starts from a tropical patchwork and encounters finitely many events. At Morse event points, the curve changes by local surgery. To determine the global attachments, we follow descending separatrices of a single gradient-like field to a fixed collection of base curves. The order of their landing points defines a finite combinatorial state, updated by local rules that also handle events at infinity and simultaneous event points. This recovers component data without tracing the intervening curves. For the dequantizing lifting, given by the negative logarithms of coefficient magnitudes, we prove an explicit event window when the lifting is generic. For fixed support and coefficient signs, with independent, identically distributed log-normal magnitudes, the expected number of events is bounded by a constant divided by the standard deviation of the logarithms. When all event points are Morse, correctness is conditional on complete, correctly classified event data, a sufficiently small starting parameter, and correctly labelled and ordered landing points. A numerical implementation illustrates its behaviour on sparse curves of high degree and on coefficients spanning many scales; these conditions are not certified.

fields
Algebraic Geometry
pdf ↗ page arXiv:2610.34392 ↗

We prove that the period map $\overline {\mathcal P}$, from the GIT moduli space of degree $d$ hypersurface $X$ in $\mathbb P^n$ to the Baily-Borel compactification of the period image associated to the middle cohomology $H^{n-1}_{\rm prim}(X,\mathbb Z)$, extends regularly to $X$ if and only if $X$ has at worst nodal singularities (resp. suspensions of slc surface singularities) when $n$ is even (resp. $n$ is odd). This verifies and generalizes Laza-O'Grady's prediction on the indeterminacy locus of the period map for quartic K3s to arbitrary hypersurfaces. For Calabi-Yau hypersurfaces, we prove that the birational map from the GIT moduli space to the BBH compactification extends regularly to $X$ if and only if $X$ has semi-log canonical singularities. The results apply to distinguish the Baily-Borel and BBH compactifications. In the process, we answer two questions of Mordant on the Griffiths height for families of hypersurfaces over curves, which are crucial to the proofs of the main results.

comments
53 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.34429 ↗

Over a noetherian scheme, classical cohomological support determines thick tensor ideals of perfect complexes. In half-bounded derived categories, complexes with the same support can generate different radical thick tensor ideals. We study how these distinctions affect the Balmer spectrum and localization. For a commutative noetherian ring $R$, we prove that $\operatorname{Spc}(\mathbf D^-_{\mathrm{fg}}(R))$ is noetherian if and only if $R$ is artinian. For a nonempty noetherian scheme $X$, the corresponding condition is $\dim X=0$. For such a ring $R$ and a finite group $G$, $\operatorname{Spc}(\mathbf D^-_{\mathrm{fg}}(RG))$ is noetherian if and only if $R$ is artinian and $|G|$ is invertible in $R$. Using the Sanders–Zhang classification over a discrete valuation ring, we compare objects whose annihilator exponents grow at different rates in different degrees. We lift the relevant generation relations before changing coefficients and obtain spectral retractions. These comparisons persist after thick quotients and algebraic localization under explicit uniform annihilation and nonvanishing conditions. A second argument uses nonnilpotent classes of positive degree and passes from cyclic subgroups to finite groups. Applications include relative results for schemes and bounded-below spectra with degreewise finitely generated homotopy. We also describe the cohomological information shared by the resulting ideals. The localization comparisons for bounded-below complexes of finitely generated modules and for bounded-below derived objects with finitely generated cohomology are established separately.

comments
41 pages
fields
Algebraic Geometry, Commutative Algebra, Algebraic Topology, Category Theory, Representation Theory
pdf ↗ page arXiv:2610.34469 ↗

We establish sharp correlation inequalities for volume polynomials associated with covers of multisets. These inequalities simultaneously generalize the Khovanskii–Teissier and reverse Khovanskii–Teissier inequalities for intersections of nef divisor classes on projective varieties. They also hold for volume polynomials arising from convex bodies and Hermitian matrices, recovering and extending classical results such as the Alexandrov–Fenchel inequality for mixed volumes of convex bodies and the Hadamard–Fischer inequality for determinants of positive semidefinite matrices. As a combinatorial application, we prove a negative correlation inequality for partitions of bases of matroids that are linearly realizable over a field.

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

In this paper, we investigate the behavior of mixed Hodge structures under square-free Grobner degenerations. We show that the weight-zero part of singular cohomology and the zeroth graded piece of the Hodge filtration are preserved under such degenerations, complementing the homological rigidity established in the seminal work of Conca and Varbaro. We use these results to settle their conjecture concerning the singularities of homogeneous coordinate rings admitting such degenerations.

comments
16 pages; comments welcome!
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2610.34641 ↗

We study two families of moduli spaces of sheaves attached to the node, namely the punctual Hilbert schemes of the non-reduced plane curve $x^uy^v=0$, and the punctual Quot schemes of the module $k[[x]]^u\oplus k[[y]]^v$ over the reduced node $xy=0$. We compute their motivic generating functions for all $u,v$ and over every field. Both are specializations of a single rational function whose numerator counts matrices by rank, and they are related by the substitution $\mathbb{L}\mapsto Q\mathbb{L}$. This proves the Hilb–Quot correspondence for the node with independent ranks on the two branches. The main geometric ingredient is an elementary modification of an ideal along a branch of the curve, whose fibres are affine spaces of dimension equal to a contact length. We also construct stratifications of the Hilbert schemes into products of affine spaces and tori, and we formulate a branchwise Hilb–Quot–HOMFLY conjecture, which we test on the colored Hopf link.

comments
Comments are welcome; 52 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.34676 ↗

We describe negative and positive elementary transformations of toric vector bundles in terms of Klyachko filtrations. We first determine the filtrations of the restriction of a toric vector bundle to an invariant prime divisor and then derive explicit formulas for the transformed bundle: only the filtration at the distinguished ray changes. As applications, we interpret adding and removing invariant boundary components of logarithmic tangent bundles as elementary transformations and recover the residue sequence for logarithmic cotangent bundles.

comments
16 pages; all comments welcome!
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.34885 ↗

Let $S$ be a noetherian scheme of finite Krull dimension and let $R$ be a commutative ring in which every positive residue characteristic of $S$ is invertible. We prove that Voevodsky's stable Nisnevich category of motives with $R$-coefficients is canonically equivalent to modules over the zeroth slice of the motivic sphere with derived $R$-coefficients. The comparison identifies the corresponding commutative coefficient algebras and is compatible with arbitrary pullback. The theorem applies to singular and nonreduced schemes, including mixed-characteristic bases, and requires no excellence or finite-type hypothesis. Its special cases include rational coefficients over arbitrary bases, arbitrary coefficients over $\mathbb Q$-schemes, and $\mathbb Z[1/p]$-algebra coefficients over $\mathbb Z_{(p)}$-schemes. The proof establishes base change for finite-cycle spectra using permutation quotients, families of cycles, and arithmetic power homotopies, then passes to general bases by universal homeomorphism invariance and continuity.

fields
Algebraic Geometry, K-Theory and Homology
pdf ↗ page arXiv:2610.34898 ↗

In this paper, we prove a sharp effective Nullstellensatz for projective Cohen-Macaulay schemes of pure dimension over an arbitrary field. In particular, if L is an ample line bundle on a smooth complex projective variety X and J is a coherent ideal sheaf with J\otimes L globally generated, then (\sqrt{J})^{°_L X}\subseteq J. This establishes the sharp bound conjectured by Ein and Lazarsfeld. More generally, we obtain sharp bounds in terms of mixed intersection numbers and a refinement involving products of powers of prime ideal sheaves associated to the irreducible components of the base locus. We also establish sharp radical power bounds for homogeneous ideals in finitely generated standard graded Cohen-Macaulay domains, extending Kollár's sharp effective Nullstellensatz for polynomial rings. The proofs combine purity and cycle preservation for leading Ext sheaves with Koszul evaluation maps compatible with successive divisor cuts.

comments
21 pages, comments are welcome!
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2610.34946 ↗

Let $X$ be an irregular threefold of Kodaira dimension two. We show that the Iitaka volume $\operatorname{Ivol}(X)$ of $X$ is at least $\frac{1}{100}$ and $\lvert mK_X\rvert$ defines the Iitaka fibration for $m\geq 32$. Both $\frac{1}{100}$ and $32$ are sharp.

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

We study $\mathbb{P}^1$-bundles over smooth projective rational surfaces over an algebraically closed field of characteristic $p>0$, together with the actions of their neutral automorphism groups. After an equivariant square birational reduction to the projective plane or a Hirzebruch surface, we classify the possible induced actions on the base and identify the families relevant to relative maximality. For $p\geq 3$, we prove that every such $\mathbb{P}^1$-bundle is equivariantly square birational to one whose neutral automorphism group is relatively maximal, and we classify all bundles with this property. We also describe all equivariant square birational maps between these relatively maximal bundles and determine which are stiff or superstiff, the analogues of rigidity and superrigidity for $\mathbb{P}^1$-bundles.

comments
84 pages, comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.35024 ↗

Let $X_2$ be a complex primitive double scheme, $X=(X_2)_{red}$. The ideal sheaf of $X$ is a line bundle on $X$. Let $E$ be a coherent sheaf on $X_2$. Then there exists a nonempty open subset $U$ of $X_2$ and integers $m_1$, $m_2$, uniquely determined by $E$, such that $E_{|U}$ is locally isomorphic to $(O_X\otimes C^{m_1})\oplus(O_{X_2}\otimes C^{m_2})$. If we can take $U=X_2$, we say the $E$ is quasi locally free. If $m_1=1$ we say that $E$ is rigid. In this case, we show that deformations of $E$ are of the same type. So locally free sheaves and rigid quasi locally free sheaves on $X_2$ play the same role on $X_2$ as locally free sheaves do on smooth schemes. In this paper we study the existence and description of quasi locally free sheaves, and flat families of such sheaves.

comments
44 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.35033 ↗

Mustafin varieties provide a framework for degenerating the projective plane together with marked points, governed by the combinatorics of Bruhat-Tits buildings. Such limit objects are parametrized by the boundary points of a projective compactification of the moduli space of $n$ points in $\mathbb{P}^2$ constructed by Schaffler-Tevelev. In this paper, we study the locus of this compactification generically parametrizing self-dual configurations, or equivalently, six points lying on a conic. We prove that this locus is a tropical compactification of the moduli space of self-dual configurations, with associated fan a refinement of the self-dual tropical Grassmannian introduced by Geiger-Hashimoto-Sturmfels-Vlad. We show that this compactification is a blow up of $\overline{\mathrm{M}}_{0,6}$ and we classify the objects it parametrizes: degenerations of $\mathbb{P}^2$ equipped with a stable $6$-pointed rational curve that records the limiting conic.

comments
36 pages. Comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.35060 ↗

For every pair $(g,n)$ with $2g-2+n>0$, we prove that $\mathcal M_{g,n}$ contains only finitely many closed algebraic curves that are totally geodesic for the Weil-Petersson metric. We show that every such curve is an arithmetic quadratic Teichmüller curve and has equal heights for all marked maximal cylinders in every periodic direction. Although there are infinitely many arithmetic Teichmüller curves, we can bound the degree of the associated torus covering by the crucial equal-height property. This leads to the desired finiteness statement. We also prove that quadratic Teichmüller curves are characterized by the existence of a holomorphic splitting of the logarithmic cotangent Kodaira-Spencer map. This result is the analogue of Möller and Viehweg's characterization of Kobayashi geodesics in $\mathcal A_g$.

comments
30 pages, comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.35086 ↗

The Jacobian of an hyperelliptic curve $C$ of genus $g$ over $\mathbb{C}$ is equipped with a symmetric theta divisor $Θ$ that defines a principal polarization. The line bundle $\mathcal{O}(2Θ)$ defines an embedding of the Kummer variety $K$ inside the projective space $\mathbb{P}^{2^g-1}$, which factorizes inside a certain orthogonal Grassmannian. We describe a minimal free resolution of $K$ inside this Grassmannian using geometric representation theory. As a consequence, we obtain a formula for the number of quartic equations defining $K$ in the projective space $\mathbb{P}^{2^g-1}$.

fields
Algebraic Geometry
pdf ↗ page arXiv:2610.35097 ↗

We study the polynomiality of combined logarithmic and ordinary Gromov-Witten invariants with a Lambda class insertion on toric surfaces $Δ(\mathbf{c},\mathbf{d})$. We show that the combined logarithmic Gromov-Witten invariants can be expressed in terms of universal relative node polynomials when the direction vector $\mathbf{c}$ and length vector $\mathbf{d}$ of the $h$-transverse lattice polygon $Δ(\mathbf{c},\mathbf{d})$ are sufficiently large and spread out. In particular, when the normal fan of the $h$-transverse lattice polygon $Δ(\mathbf{c},\mathbf{d})$ is smooth and its edges satisfy a length condition, we show that the combined Gromov-Witten invariants are equal to a universal node polynomial. We also show that the higher genus Block-Göttsche polynomials of smooth toric surfaces corresponding to these $h$-transverse lattice polygons, including toric blowups beyond Hirzebruch and toric del Pezzo surfaces, are equal to a generating function of higher genus Gromov-Witten invariants.

comments
41 pages, 5 figures
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.35122 ↗

We study fixed-determinant deformations of the logarithmic tangent bundle associated with a smooth irreducible divisor on a smooth complex projective surface. We derive numerical criteria for the existence of positive-dimensional deformation families. Using the Enriques–Kodaira classification and Miyaoka-type inequalities, we classify the minimal surface pairs whose logarithmic tangent bundle is infinitesimally rigid. We also prove monotonicity under compatible blow-ups and compute local comparison formulas for resolutions of low-multiplicity ordinary singularities of the boundary.

comments
33 pages, 2 tables
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.35127 ↗

Let $n$ be a positive integer and define $q=3^n$. It is well known that there exists a maximal function field $Z_3$ over $\mathbb{F}_{q^2}$ of genus $g_3=q(q-1)/6$ and that $g_3$ is the third largest genus a maximal function field over $\mathbb{F}_{q^2}$ can have. In this article we show that any maximal function field over $\mathbb{F}_{q^2}$ of genus $g_3$ is isomorphic to $Z_3$. This extends previously known uniqueness result for the largest and second largest genera of maximal curves.

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

There is a long tradition of constructing smooth projective varieties in positive characteristic with non-degenerate Hodge-to-de Rham spectral sequences. In this paper, we show that for any $n\geq 1$ and any spot $(i, j)$ on the $E_n$-page, except for the cases where the differential is forced to be zero for trivial reasons, there exists a smooth projective variety whose Hodge-to-de Rham spectral sequence has a non-zero differential with source $E_n^{i, j}$. Our construction is inspired by constructions of nilmanifolds in complex geometry and can be regarded as a positive characteristic analogue.

comments
50 pages; comments welcome!
fields
Algebraic Geometry, Algebraic Topology
pdf ↗ page arXiv:2610.35243 ↗

Answering a question of Kraft and the second-named author, we prove that a connected ind-group over an algebraically closed field of characteristic zero is solvable, respectively nilpotent, if and only if its Lie algebra is. Their derived lengths, respectively nilpotency classes, coincide. We also obtain bounds on the derived length and nilpotency class for regular linear representations of connected ind-groups and for subgroups generated by connected algebraic subgroups. As an application, we give a new proof of the geometric case of a theorem of Belabbas: a solvable Lie algebra of vector fields on an affine variety generated by finitely many locally finite Lie subalgebras is locally finite and finite dimensional.

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

We prove that any symplectic singularity has a structure of hyperKähler cone. In particular, it is equivalent to the vertex of a conical symplectic variety, and it is automatically K-polystable.

comments
42 pages. cf., Acknowledgements and use of AI
fields
Algebraic Geometry, Differential Geometry, Representation Theory
pdf ↗ page arXiv:2610.35510 ↗

We develop a direct analytic approach to positivity of relative pluricanonical direct images through a fixed-point Hermitian metric by direct differential curvature calculations. The curvature resolvent formula from fixed-point equation leads to two-sided estimates of entire Nakano curvature by determinant curvature. In this way, we identify generic rank of determinant curvature with birational variation dimension for a projective algebraic fibration between smooth connected projective varieties with general fiber of general type and maximal birational variation, assuming $mK_F$ is globally generated or the $m$-canonical map is birational for general fiber $F$. In the global generation case, Green–Griffiths Conjecture asks for the tautological bigness of the ordinary symmetric powers $\operatorname{Sym}^{\ell}f_*ω_{X/Y}^{\otimes m}$, without passing to reflexive hulls, for $\ell\geq P_m(F)=h^0(F,mK_F)$ whenever $m\geq 1$. We prove it for all $\ell\geq1$ at levels $m\geq 2$, also in the case of birational $m$-canonical map, but construct a counterexample at level $m=1$. Over curves, curvature and boundary estimates give a direct analytic proof of Viehweg's ampleness theorem requested by Fujino. For smooth projective families, we also establish numerical dimension and vanishing results related to the birational variation dimension.

comments
50 pages
fields
Algebraic Geometry, Complex Variables
pdf ↗ page arXiv:2610.35590 ↗

We construct algebraic curves with trivial geometric automorphism group by taking cyclic scalar quotients of curves of the form \[ y^r-y=xR(x),\qquad r=p^e. \] We give a condition on the genus under which the quotient has no nontrivial automorphism. The proof uses the ramification of a degree-$r$ morphism to the projective line, Castelnuovo–Severi, and explicit automorphisms of the covering curve. The quotient also has gonality $r$, with a unique morphism of degree $r$ to the projective line up to an automorphism of the latter. Applying the construction to maximal additive curves gives explicit maximal curves with trivial geometric automorphism group in every positive characteristic, including families defined over the prime field and of unbounded genus. To the best of our knowledge, these are the first examples of maximal curves with trivial geometric automorphism group. Every maximal curve in these families is covered by the Hermitian curve. For every odd prime $p$ and every $n\ge2$, we prove that the curve $\X_{p,n}$, maximal over $\F_{p^{4n+2}}$, is not a Galois subcover of the corresponding Hermitian curve, even over the algebraic closure. Thus every odd characteristic yields an infinite family of curves covered but not Galois covered by the Hermitian curve. To the best of our knowledge, these are the first such infinite families.

fields
Algebraic Geometry
pdf ↗ page arXiv:2610.35788 ↗

We give a fourth-order Calabi-Yau differential operator, which seems to have been missed by earlier tabulations. We draw attention to this operator because of its clear geometric interpretation and evidence that it possesses a rank-two attractor, conjecturally giving a new example of a Calabi-Yau threefold with modularity properties analogous to those of an elliptic curve over $\mathbb{Q}$.

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

We study Brantner-Taelman's canonical lifts of ordinary Calabi-Yau varieties and characterise their (quasi)canonical lifts in terms of rational $p$-adic Hodge theoretic data. We also show that these canonical lifts need not be of CM type and that the associated local Galois representations need not split as sums of twists of unramified representations, in contrast to classical results for abelian varieties and K3 surfaces.

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

Functional Analysis37

We give a complete description of the isometric isomorphisms between the $\ell^1$-crossed products of actions of discrete groups on nonempty compact Hausdorff spaces. In particular, two such crossed products are isometrically isomorphic as Banach algebras if and only if the actions are topologically isomorphic. It follows that $\ell^1(G\curvearrowright X)$ remembers not just $X$ but even the acting group and the action, and is not determined by the transformation groupoid $G\ltimes X$ alone. The proof recovers $C(X)$ from the hermitian elements and uses the geometry of $L^p$-spaces to identify the invertible isometries. We also obtain analogous results for measurable actions.

comments
18 pages
fields
Functional Analysis, Dynamical Systems, Operator Algebras
pdf ↗ page arXiv:2610.33050 ↗

We prove a weak type $(1,1)$ estimate for maximal truncations of noncommutative rough singular integrals whose angular kernels satisfy the classical $L\log L$ integrability and cancellation conditions. The main ingredient of the proof is a new linearization method for handling the maximal truncations acting on the bad functions arising from the noncommutative Calderón–Zygmund decomposition.

fields
Functional Analysis
pdf ↗ page arXiv:2610.33284 ↗

In this paper, we introduce a weak variant of the concept of unbounded Dunford-Pettis linear operators, which we call unbounded weak Dunford-Pettis operators. We investigate the properties of this new class, establish inclusion and coincidence results involving unbounded Dunford-Pettis operators, and examine its relationship with the class of unbounded absolutely weakly continuous operators.

fields
Functional Analysis
pdf ↗ page arXiv:2610.33289 ↗

We consider the Hardy inequality associated with a strongly convex Finsler norm $F$ on $\mathbb{R}^n$ and we study its optimal non-homogeneous improvements in the whole range $1<p<\infty$. We show that the anisotropic Hardy difference controls a weighted critical Sobolev norm when $1<p<n$, a weighted exponential integrability of Trudinger type when $p=n$, where the Hardy term is replaced by its Leray logarithmic correction, and a weighted Hölder seminorm when $p>n$, proving in each regime that the logarithmic weights appear with the optimal exponents. In the borderline case $p=n$ this extends to general functions the optimal exponent previously known only for anisotropically radial functions. The proofs rely on a common ground-state reduction, combined with a splitting into an $F_o$-radial and a mean-free part for $1<p\le n$, and with an anisotropic Morrey representation formula for $p>n$.

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

Let $\mathcal{B} (H)$ and $\mathcal{B} _s(H)$ be the algebra of all bounded linear operators on a complex Hilbert space $H$ and the Jordan algebra of all self-adjoint operators in $\mathcal{B} (H)$, respectively. In this paper, the orthographs by (strong) numerical radius orthogonality relation on $\mathcal{B} (H)$ or $\mathcal{B} _s(H)$ is introduced, and then the graph-theoretic properties of these orthographs, such as isolated vertices, connected components and the diameters, are discussed.

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

A consequence of implicit function theorem is that any algebraic set is a complex manifold except at some singular points which form a strictly lower dimension algebraic subset. Accordingly, an non commutative implicit function theorem of Agler-McCarthy might suggest that a nc algebraic set is generically an nc manifold. However, in this paper, a type of nc polynomials is shown, whose zero locus has larger dimension than the nc manifold given by implicit function theorem.

fields
Functional Analysis
pdf ↗ page arXiv:2610.33425 ↗

We develop quantum harmonic analysis (QHA) for operators on the parametrized Bergman space $\mathcal{A}^2_ν(Ω)$ of a bounded symmetric domain $Ω$, extending the theory previously known for the unit ball. Building on this framework, we introduce a class of differential operators acting on operators on $\mathcal{A}^2_ν(Ω)$. Combining these tools, we advance the theory of Toeplitz operators on $\mathcal{A}^2_ν(Ω)$: we establish Toeplitz approximation results via the $α$-Berezin transform, construct a differential operator $D_α$ that shifts the $α$-Berezin transform, and obtain several characterizations of the radial Toeplitz algebra -- including one via the uniformly continuous radial operators, and one via the domain of $D_α$.

comments
47 pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.33428 ↗

We resolve three questions arising from the study of coordinate systems and order convergence in Banach lattices. Firstly, every order (respectively, $σ$-order) basis $(e_n)$ for a Banach lattice $X=[e_n]$ is automatically a Schauder basis. In fact, the associated partial sum projections satisfy a maximal inequality, and hence every such basis is uniform. Secondly, we show that there is a separable Banach lattice $X$ in which the set $$ X_{\downarrow0}=\{(x_n)\in X^{\mathbb N}:x_1\geqslant x_2\geqslant\ldots\geqslant 0=\inf_nx_n\} $$ is $\mathbfΠ^1_1$-complete. Finally, we construct a separable Banach lattice $Y$ for which the set $Y^{\uparrow\infty}$ of increasing positive sequences which are not order bounded is $\mathbfΠ^1_1$-complete. It follows that neither $X_{\downarrow0}$ nor $Y^{\uparrow\infty}$ can be described in any simpler way than by the nonexistence of positive lower and upper bounds, respectively.

code
github.com/pedrotradacete/DSTBL3 ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at 47f515e, checked 2026-10-27 build details
comments
16 pages, lean code available at https://github.com/pedrotradacete/DSTBL3
fields
Functional Analysis
pdf ↗ page arXiv:2610.33462 ↗

A classical theorem due to Gleason, Kahane, and Zelazko states that every complex unital Banach algebra is ordinary, meaning that any linear functional mapping elements into their spectrum is a character. While Roitman and Sternfeld extended this property to algebras with bounded spectra-showing in particular that the algebra C(X) of continuous functions is ordinary when X is pseudocompact-the general case of C(X) for arbitrary topological spaces X appears to be open, as we could not locate any reference in this direction. In this paper, we show that the pseudocompactness condition is unnecessary, that is, C(X) is ordinary for every topological space X. This fact is obtained as a consequence of a more general result characterizing positive characters on a purely algebraic generalization of unital C*-algebras, which we introduce under the name of AC*-algebras. As applications, we obtain two necessary and sufficient conditions for a Tychonoff space X to be realcompact in terms of 1-evaluating linear functionals on C(X) and their continuity with respect to the compact-open topology. Finally, we establish a Banach–Stone type theorem showing that two realcompact spaces X and Y are homeomorphic if and only if C(X) and C(Y) are linearly isomorphic via a map that preserves invertibility.

fields
Functional Analysis
pdf ↗ page arXiv:2610.33579 ↗

Based on mixed-norm Herz spaces, we introduce a new class of mixed-norm Herz-type Triebel-Lizorkin spaces. We establish their $\varphi$-transform characterization in the sense of Frazier and Jawerth and prove Sobolev embedding theorems for these spaces. The resulting embedding theorems extend and improve several known results for mixed-norm Triebel-Lizorkin spaces.

comments
We have divided the original preprint arXiv:2406.14727 into three parts. The first part is entitled "Mixed-Norm Herz-Type Triebel-Lizorkin Spaces", the second "Mixed-Norm Herz-Type Spaces", and the third "Jawerth-Franke Embeddings of Mixed-Norm Herz-Type Besov and Triebel-Lizorkin Spaces"
fields
Functional Analysis
pdf ↗ page arXiv:2610.33618 ↗

In this paper, we present a complete characterization of the compactness of arbitrary finite linear combinations of composition operators acting on Hardy spaces of homogeneous rooted trees. In particular, we obtain a characterization of compactness for linear combinations satisfying the CNC. As an application, we give an affirmative answer to a conjecture raised by Choe et al. [Trans. Amer. Math. Soc. Ser. B 9(2022), 733–756] concerning such Hardy spaces. Furthermore, we establish the phenomenon of (double) difference cancellation for linear combinations of composition operators by constructing explicit examples.

fields
Functional Analysis
pdf ↗ page arXiv:2610.33717 ↗

Let $S:X\to Y$ be a bounded linear operator between real Banach spaces, and let $F\subset X$ be nonempty, bounded and convex. We prove $$a_{2n-1}(S,F)\le 27n\min \{ e^{\rm ran}_n (S,F), e^{\rm ada}_n (S,F)\}.$$ Here $a_k$ is the minimal worst-case error of continuous affine algorithms of rank at most $k$, and $e_n^{\rm ran}$ and $e_n^{\rm ada}$ are the minimal errors of adaptive randomized and deterministic algorithms using at most $n$ continuous linear measurements. This shows that the gain of adaption and randomization, and even nonlinearity, is limited by a factor $27n$ for approximation in convex sets. We discuss the optimality of the result by examples.

fields
Functional Analysis, Numerical Analysis
pdf ↗ page arXiv:2610.33733 ↗

We study the geometry and closure of spaces of functions realized by ReLU neural networks of fixed architecture. We first establish a general result about limits of continuous piecewise-linear (CPWL) functions: the minimum number of convex sets on which a function is affine is lower semicontinuous under pointwise convergence. The proof uses a connection to hypergraph coloring and a compactness principle, and yields quantitative bounds on the polyhedral complexity of continuous limits. We then characterize the functions realizable by shallow ReLU networks with vector-valued outputs, extending a known scalar-valued characterization. Using this and the geometry of limiting hyperplane arrangements, we prove that fixed-width shallow scalar ReLU realization spaces are closed in the weighted supremum norm on the whole input space. In contrast, we construct an explicit sequence of networks with architecture $(2,3,2\mid1)$ whose limit is not realizable by that architecture. Non-closedness holds both globally in weighted supremum norm and under uniform convergence on compact sets with nonempty interior, disproving a conjecture of Petersen, Raslan, and Voigtlaender. Finally, we show that non-closedness for a fixed scalar-output ReLU architecture necessarily involves a \emph{blow-up residue}, in which diverging output coefficients amplify an emerging linear dependence among hidden features. Together, these results provide geometric and functional-analytic tools for studying the boundaries and degenerations of ReLU realization spaces.

comments
37 pages
fields
Functional Analysis, General Topology, Metric Geometry
pdf ↗ page arXiv:2610.33779 ↗

We prove a Borsuk-Ulam theorem for adaptive measurements: if $2^n\le m$, then any $n$ adaptively chosen continuous functionals take identical values at two antipodal points of any sphere in $\mathbb{R}^m$. Consequently, at least $\lceil\log_2(m+1)\rceil$ adaptive continuous measurements are needed to learn the vectors of a ball in $\mathbb{R}^m$ with an error smaller than its radius, which matches the recently obtained upper bound up to one measurement. The bound extends to Bernstein widths in Banach spaces. The main idea of the proof was found by Claude Fable 5, an AI model developed by Anthropic, and we document the development in a last section.

comments
9 pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.33781 ↗

We construct a family of bounded, finitely additive, covariant positive operator-valued measures (POVMs) on the real line by applying generalised Banach-Cesaro asymptotic averaging to locally finite covariant POVMs. In contrast to the strictly shift-invariant case, where countably additive operator measures are restricted to scalar multiples of a single fixed operator, the introduced covariant setting allows for non-commuting averaged operator values while successfully normalising the total mass. We develop an integration theory for complex-valued functions by taking the completion of simple integrable functions with respect to the continuous operator norm induced by the positive integral of their absolute values. The integration spaces for the original and the averaged measures are shown to possess distinct null classes. Finally, we introduce the operator-valued Fourier transform on these integration spaces and analyze the core algebraic constraints imposed by the covariance property on the exponential multipliers.

comments
8 pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.33821 ↗

We study the spectrality of convolution and product measures. Let~$μ$~be a compactly supported Borel probability measure on~$\Bbb{R}^d$~such that ~$\mathcal{Z}(\widehatμ)\cup\{0\}=T$~is an additive subgroup, and let~$ν$~be a Borel probability measure on~$\Bbb{R}^d$. We prove that~$μ*ν$~is spectral if and only if~$T$~is a spectrum of~$μ$, ~$ν$~is spectral, and~$suppν$~is contained in a translate of the annihilator of~$T$. Moreover, every spectrum of~$μ*ν$~decomposes into full cosets of~$T$, and every choice of one point from each coset is a spectrum of~$ν$. We also obtain a convolution-factor criterion which strengthens a result of Wu. As applications, we characterize the spectrality of~$L_{[0,1]}*ν$~and prove that the spectrality of~$L_{[0,1]^d}*ν$~implies that of~$ν$~without a compact support assumption. For product measures, we give necessary and sufficient conditions for an orthogonal set to be a spectrum by relating its block structure to spectra of the factors. No compact support assumptions are required.

fields
Functional Analysis
pdf ↗ page arXiv:2610.33987 ↗

For every $0<p<1$, we establish maximal spaceability of the bounded operators on $\ell_p$ which fail to be $(r,s)$-absolutely summing for all $1\le s\le r<\infty$, using the coordinate-disjointization construction and Maddox's theorem. We give detailed isometric estimates and prove a corresponding maximal spaceability theorem inside the compact operators. The compact result is based on an explicit diagonal multiplier and a single weakly $1$-summable sequence witnessing the simultaneous failure of all admissible absolute summability conditions. A diagonal characterization, a logarithmic compact example, and extensions to operators with values in quasi-Banach spaces containing a copy of $\ell_p$ are also obtained. The constructed subspaces are isomorphic to $\ell_p$ and have maximal algebraic dimension whenever the ambient operator spaces have dimension $\mathfrak c$.

comments
Accepted for publication in the Journal of the Iranian Mathematical Society (JIMS)
fields
Functional Analysis
pdf ↗ page arXiv:2610.33999 ↗

In this paper, we completely characterize hyponormal dual Toeplitz operators with general bounded measurable symbols by using the Douglas theorem in [R. G. Douglas, Proc. Amer. Math. Soc. 17 (1966), 413-415]. As an application, the hyponormality of dual Toeplitz operators with radial symbols and polynomial symbols in $z$ and $\bar{z}$ is characterized concretely. Moreover, we obtain complete characterizations for both subnormal dual Toeplitz operators with harmonic polynomial symbols and $\varTheta$-class dual Toeplitz operators with bounded harmonic symbols.

fields
Functional Analysis
pdf ↗ page arXiv:2610.34017 ↗

In this paper, we study noncommutative analogues of the classical Cauchy and Lagrange mean value theorems in the setting of free noncommutative function theory. For noncommutative functions on a uniformly open noncommutative set, we prove a Cauchy-type mean value inequality involving the right noncommutative difference operator $Δ_R$ and the G-derivative, and we establish a mean value theorem for noncommutative curves. Furthermore, we characterize uniform comparison (Lipschitz-type) inequalities at all matrix levels and prove a factorization theorem for noncommutative functions. The proofs combine the Hahn–Banach theorem, the fundamental theorem of calculus along a line segment, and the direct-sum compatibility of noncommutative functions.

comments
14 pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.34032 ↗

Let C be an inhabited, bounded, open, convex subset of a Banach space, and phi the pointwise continuous mapping taking a pair of points, one inside C and one outside, to the point where the segment joining those points meets the boundary of C. We prove constructively that phi is uniformly continuous on the Cartesian product of a set well contained in C and the metric complement of C.

fields
Functional Analysis
pdf ↗ page arXiv:2610.34039 ↗

Mori and Ozawa raised a fundamental open question: whether every convex body in a normed space enjoys the strong Mankiewicz property (SMP). The SMP states that every surjective isometry from the convex body onto a convex subset of an arbitrary real normed space is necessarily real-affine, with no interior assumption imposed on the target convex set. In the present work, we settle this problem affirmatively.

fields
Functional Analysis
pdf ↗ page arXiv:2610.34113 ↗

In the description of L_1- preduals on the one hand and of Hilbert spaces, on the other, one encounters the surprising appearance of similar classes of operators in terms of their extendibility properties in the setting of these two classes of spaces. It also turns out that the extension properties are closely tied to how the two classes of spaces are positioned inside the ambient spaces. It is well known that in the case of all subspaces being positioned inside a larger space Z as a complemented subspace leads to Z being (isomorphically) a Hilbert space whereas in the case of a Banach space X which is complemented inside all its superspaces, it turns out that X is an injective Banach space. In this paper, we shall be concerned mostly with such properties as demanding that X sit inside the ambient space as a locally complemented subspace (and sometimes as a Lipchitz retract). It turns out that the class of Banach spaces X determined by the indicated properties are precisely the class of L_1- preduals in the former case and of Hilbert spaces, in the latter. As an important consequence of this approach, we are led to several new characterisations of Hilbert spaces in terms of the extendibility of bounded linear maps coming from well-known operator (nonlinear operator) ideals.

fields
Functional Analysis
pdf ↗ page arXiv:2610.34152 ↗

We study (p,q)-weighted dual curvature measures associated with a fixed nonnegative locally integrable Borel density satisfying a trace-regularity condition. These measures arise naturally from a variational formula for Wulff shapes. We establish the trace-regularity condition when g is pointwise α-homogeneous for some α\in R, or when g is radially non-increasing and continuous. For nontrivial even densities in either class, we prove existence results for the even version of the associated Minkowski problem under suitable assumptions. We also establish uniqueness when the prescribed measure has finite support, under a strict positivity assumption on the density and additional restrictions on the parameters. In the case of Lebesgue measure, our curvature measures reduce to those introduced by Lutwak, Yang, and Zhang, and our variational formulas recover their corresponding variational formula. For Gaussian measure, our results are related to those of Feng, Hu, and Xu, and Feng, Li, and Xu. Finally, we investigate the affine properties of the new measures and the associated mixed volumes.

fields
Functional Analysis, Metric Geometry
pdf ↗ page arXiv:2610.34268 ↗

We prove several variants of the Brascamp–Lieb inequality which are adapted to additional symmetries, weights, and non-Euclidean radial structures. First, an improved Brascamp–Lieb inequality for even functions yields a strengthened Prékopa–Leindler theorem for even strongly log-concave functions. We also record a Legendre-transform proof of a generalized log-Sobolev inequality for log-concave functions. Further results include a Brascamp–Lieb inequality with a concave weight, an unconditional second-order Poincaré inequality, a rotation-trick improvement for arbitrary even log-concave measures, and a Poincaré-type inequality associated with smooth norms.

comments
42 pages, the majority of the paper written before spring 2026
fields
Functional Analysis, Metric Geometry, Probability
pdf ↗ page arXiv:2610.34289 ↗

Let $1 \leqslant p \leqslant q < \infty$, let $\mathsf{X}$ be a separable $\mathcal{L}_p$-space and let $\mathsf{Y}$ be a separable $\mathcal{L}_q$-space. We show that the space $\mathfrak{L}(\mathsf{X},\mathsf{Y})$ of bounded linear operators from $\mathsf{X}$ into $\mathsf{Y}$ is isomorphic to $\mathfrak{L}(\ell_p,\ell_q)$ if, and only if, $\mathsf{Y}$ is complemented in its bidual. We also show that $\mathfrak{L}(\mathsf{Z},\ell_{\infty})$ is isomorphic to $\mathfrak{L}(c_0,\ell_{\infty})$ for every separable $\mathcal{L}_{\infty}$-space $\mathsf{Z}$. This extends and complements the earlier result of Arias and Farmer [On the structure of tensor products of $\ell_p$-spaces, Pacific J. Math.]. Based on this general result, we give a completely different proof of the main result of Astashkin, Leśnik and Maligranda [Isomorphic structure of Cesàro and Tandori spaces, Canad. J. Math.], which states that the space $\mathcal{K}$ and its sequence counterpart $\mathcal{k}$ are isomorphic. Furthermore, we complete the picture by showing that the spaces $\mathcal{k}$ and $\mathcal{K}$, although isomorphic, are not isometric. Along the way, we show that for every infinite compact metrizable space $K$ the $\ell_{\infty}$-sum of copies of the space $\mathscr{M}(K)$ of regular Borel measures on $K$ is isomorphic to $( \bigoplus_{n=1}^{\infty} L_1[0,1])_{\ell_{\infty}} \approx \mathfrak{L}(\ell_1,L_1[0,1])$. This provides an abstract blueprint for another result of Astashkin, Leśnik and Maligranda, namely that $\mathcal{K}$ is isomorphic to $( \bigoplus_{n=1}^{\infty} \mathscr{M}[0,1])_{\ell_{\infty}}$. Finally, we show that there are models of set theory without the Axiom of Choice in which the spaces $\mathcal{k}$ and $\mathcal{K}$ are no longer isomorphic. This last part was inspired by Väth's paper [The dual space of $L_{\infty}$ is $L_1$, Indag. Math. (N.S.)].

comments
46 pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.34421 ↗

For a semi-normalized Markushevich basis, we study isometric almost-greedy inequalities in which a greedy sum of $φ(m)$ terms is compared with coordinate projections onto at most $m$ terms. Here $φ$ is any strictly increasing map of the nonnegative integers into themselves with $φ(0)=0$. We sandwich $φ$-almost greediness with constant $1$ ($φ$-AG$_1$) between two levels of symmetry for largest coefficients (SLC): $$φ\mbox{-SLC}_1\ \Longrightarrow\ φ\mbox{-AG}_1\ \Longrightarrow\ \mbox{weak }φ\mbox{-SLC}_1.$$ Both implications are equivalences if and only if $φ(1)\le2$. We then characterize $φ$-AG$_1$ by the weighted weak $φ$-SLC or a single homogeneous norm inequality, called Property $(F_φ)$.

comments
18 pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.34686 ↗

In this paper we introduce a class of operators which we call $DW$-$L$-weakly compact operators. They carry disjointly weakly compact subsets of a Banach lattice onto $L$-weakly compact sets. The class of $DW$-$L$-weakly compact operators is closely related to two recently introduced classes of operators: almost $L$-weakly compact operators and order $L$-weakly compact operators. We show that $DW$-$L$-weakly compact operators are precisely those operators which are both almost $L$-weakly compact and order $L$-weakly compact. The adjoint and the order structure of $DW$-$L$-weakly compact operators are also considered.

comments
13 pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.34981 ↗

We determine the Serre closure of Banach spaces in the category of quasi-Banach spaces, that is, the smallest class of quasi-Banach spaces that contains all Banach spaces and is stable under subspaces, quotients, and extensions. Precisely, a quasi-Banach space $X$ belongs to this closure if and only if there exist constants $M$ and $k\in\mathbb N$ such that $$ \frac{\|x_1+\dots+x_n\|}{\|x_1\|+\dots+\|x_n\|}\leq M\log^k n $$ for every $n\geq 2$ and every $x_1,\dots,x_n\in X$; equivalently, $X$ is a quotient of an Orlicz sequence space $\ell(I,f_l)$, where $I$ is an index set and $f_l(t)$ is equivalent to $t\log^l(1/t)$ near zero. The proof combines geometrical estimates for quasi-Banach spaces and quasilinear maps with the study of higher order derived spaces associated to complex interpolation between $\ell_{2/3}$ and $\ell_2$. We provide examples of spaces in the Serre closure of Banach spaces that are not iterated extensions of Banach spaces and discuss some related problems.

comments
2 figures
fields
Functional Analysis, Category Theory
pdf ↗ page arXiv:2610.35259 ↗

We introduce the concept of a fractional upper gradient and employ it to characterize the $p$-Muckenhoupt weighted $s$-fractional $p$-Sobolev spaces on $\mathbb R^d$ where $d\in\mathbb N$, $1<p<\infty$ and $0<s<1$.

fields
Functional Analysis
pdf ↗ page arXiv:2610.35279 ↗

Alshehri and Lykova (\emph{J. Geom. Anal.} \textbf{33} (2023)) formulated a Schwarz lemma for the pentablock $P$, giving a criterion for the existence of an analytic map from the unit disc $\mathbb D$ into the closed pentablock $\overline P$ that sends the origin to the origin and a prescribed point $λ_0\in\mathbb D$ to a given point $x_0\in\overline P$. We show that the sufficiency direction of their criterion is false. We identify the underlying error as the extension to the open unit disc of a Fejér–Riesz identity that is valid only on the unit circle. We establish a corrected necessary and sufficient interpolation criterion when the last two components are prescribed by a fixed rational $Γ$-inner function and resolve the special case $s_0=0$. Using the Poisson integral representation of the associated outer spectral factor, we obtain a sharp comparison between the corrected bound and the bound proposed by Alshehri and Lykova, with a precise characterization of equality. We further express the logarithmic difference between these bounds as a nonnegative Green potential, thereby quantifying the discrepancy in terms of the derivative of the first coordinate of the prescribed $Γ$-inner function. Finally, we formulate a variational problem over rational $Γ$-inner interpolants satisfying the prescribed two-point conditions. We show that the supremum of the associated outer-factor quantities determines the maximal admissible modulus of the first coordinate among pentablock-valued interpolants whose last two components belong to this class. Equivalently, this extremal problem reduces to minimizing the corresponding Green potential. We conclude by discussing the remaining problem of characterizing unrestricted Schwarz interpolation for the pentablock and its connection with the Lempert function.

comments
This is the initial version. Final version will submit soon
fields
Functional Analysis
pdf ↗ page arXiv:2610.35337 ↗

We study how a functional inequality satisfied by the one-particle conditional distributions of a Gibbs measure, with a constant independent of the positions of the other particles, can be propagated to the whole N -particle system, with a constant independent of N , when the interaction is singular. Our model is the Coulomb gas on the torus T 3 in the mean-field regime. We distinguish two mechanisms. The first one is a dependent tensorization, governed by Dobrushin-Wu interdependence coefficients. It yields uniform Poincar{é} and transport-information W 2 I inequalities with fully explicit constants. We explain why this mechanism does not extend to the log-Sobolev inequality: the Zegarlinski-type coefficients, which require pointwise bounds on the interaction, are infinite. The second mechanism is a tensorization with a defect. Using a uniform bound on the partition function due to Duerinckx and Jabin, it yields a uniform log-Sobolev inequality for the Coulomb gas on T 3 at small charge. We identify the assumptions on the interaction under which each mechanism applies. All the results are then extended to the two-dimensional Coulomb gas and to periodic Riesz gases 1/|x|^s , 0 < s $\le$ 1. The extension to d $\ge$ 4 is also discussed.

fields
Functional Analysis, Mathematical Physics
pdf ↗ page arXiv:2610.35350 ↗

The symplectic interlacing theorem states that the symplectic spectrum of a $2n \times 2n$ real symmetric positive definite matrix satisfies a $2k$-step interlacing relation with the symplectic spectrum of every $2(n-k) \times 2(n-k)$ $s$-principal submatrix. We prove the converse in this paper. More precisely, given a positive global symplectic spectrum of size $n$ and a positive local symplectic spectrum of size $n-k$ satisfying the $2k$-step interlacing inequalities, we construct a $2n \times 2n$ real symmetric positive definite matrix having the prescribed global symplectic spectrum and a $2(n-k) \times 2(n-k)$ $s$-principal submatrix of it having the prescribed local symplectic spectrum. Our main tool is a reduction of $s$-principal compression to a rank-$k$ singular value perturbation. In the context of the Gaussian quantum marginal problem, our result implies that the symplectic interlacing inequalities are not merely necessary conditions on Gaussian marginals, but are also the complete spectral compatibility conditions for the global-versus-local-mode marginal problem.

fields
Functional Analysis, Mathematical Physics, Symplectic Geometry, Spectral Theory
pdf ↗ page arXiv:2610.35376 ↗

Let $A^Ψ_ω(\mathbb{D})$ be the weighted Bergman-Orlicz spaces induced by doubling weights $ω$ on the unit disk $\mathbb D$. Suppose Orlicz function $Ψ$ satisfies the $Δ_{2}$-condition. In this paper, the compactness of finite linear combination of composition operators on $A^Ψ_ω(\mathbb{D})$ are completely characterized in terms of Julia-Carathéodory type conditions and vanishing Carleson measure, respectively.

comments
30 pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.35415 ↗

We study the operator-norm approximation of Markov operators associated with finite graph coverings. Let $q:Y\to X$ be a connected covering of degree $d\geq 2$ between finite connected graphs, and let $A_q:C(Y)\to C(X)$ be its fiber-averaging operator. We show that $A_q$ is not a finite convex combination of extreme Markov operators, although such combinations approximate $A_q$ arbitrarily well in operator norm. We determine the exact distances from $A_q$ to convex combinations of at most $m$ extreme Markov operators, with arbitrary or equal convex weights. If $m=kd+r$, where $k\geq 0$ and $1\leq r\leq d$, these distances are $2(d-r+1)/[d(k(d-r+1)+1)]$ and $2r(d-r+1)/(dm)$, respectively. Both distances are attained and depend only on the covering degree $d$ and the number of terms $m$. We also determine when equal weights are optimal and quantify the additional approximation error when they are not. Our proofs use total-variation estimates and continuous rearrangements of labelled weighted atoms. In particular, the unrestricted errors have a common scaled limit, while the equal-weight errors exhibit residue-dependent asymptotic behavior.

fields
Functional Analysis
pdf ↗ page arXiv:2610.35575 ↗

For a function $ψ: \mathbb{R}^d \rightarrow \mathbb{C}$, we define the phase-corrected gradient $\nabla_{\!\circ} ψ= |ψ|^{-1} \overlineψ\,\nablaψ$ and study the regularity of the map $ψ\mapsto \nabla_{\!\circ} ψ$ on Sobolev spaces. Since $\mathrm{Re}[\nabla_{\!\circ} ψ] = \nabla |ψ|$, the phase-corrected gradient fits naturally into the framework of nonlinear composition operators. Its imaginary part $Λ= \mathrm{Im}[\nabla_{\!\circ} ψ]$, on the other hand, plays a key role in quantum hydrodynamic models. We prove that $ψ\mapsto \nabla_{\!\circ} ψ$ is bounded and continuous from $W^{s,2}(\mathbb{R}^d)$ to $W^{s-1,2}(\mathbb{R}^d)$ for $1 \leq s < \frac32$, and we show that the threshold $s = \frac32$ is sharp. In particular, this answers an open question concerning the continuity of the map $ψ\mapsto |ψ|$ on Sobolev spaces. We also show that our results remain valid for functions that do not necessarily decay at infinity, a relevant setting in the context of Ginzburg–Landau theory. Finally, we extend our analysis to more general phase-corrected gradients of the form $f(|ψ|^{-1} ψ) \nabla ψ$, where $f: \mathbb{S}^1 \rightarrow \mathbb{C}$ is Lipschitz, and discuss implications for certain parabolic PDEs.

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

Given a minimal system E for a Banach space X, Casazza, Dilworth, Kutzarova and Motakis introduced a multiplication $\otimes$ on span(E) and studied the Schauder bases for which $\|x \otimes y\|\approx \|x\|\|y\|$ asking whether every such basis is equivalent to the canonical unit vector basis of $c_0$ or $\ell_p$. We continue this study in the more general setting of minimal systems that are not assumed to be Schauder bases, and we obtain positive answers under hypotheses that are formally weaker than the ones considered so far: partial democracy instead of democracy or bidemocracy, and truncation quasi-greediness instead of quasi-greediness. Along the way we show that the above multiplicative estimate forces invariance under translations, we characterize when such a minimal system is a Schauder basis, and we give examples showing that the one-sided variants of the estimate behave very differently.

fields
Functional Analysis
pdf ↗ page arXiv:2610.35726 ↗

For finite-dimensional quantum channels compatible with a faithful conditional expectation, we show that conditional hyperboundedness and strict GNS contraction together yield a relative entropy contraction. For KMS-symmetric quantum Markov semigroups, a conditional $2\to q$ hyperboundedness at time $t_0>0$ combined with a GNS gap $λ>0$ implies a modified logarithmic Sobolev constant \[ α=\frac{λ(1-2/q)} {12(λt_0+\log M+1-2/q)},\] where $M$ is the hyperboundedness constant. As a consequence, completely bounded hyperboundedness over auxiliary systems gives complete versions of entropy contraction with the same rates.

comments
23 pages; comments are welcome
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2610.35863 ↗

Differential Geometry36

We develop the differential geometry of space curves in Hahn's quantum calculus, where the derivative is the difference quotient along the contraction $σ(t)=qt+ω$ with fixed point $ω_0=ω/(1-q)$. The Hahn Frenet frame is transported along every orbit of $σ$ by rotations through turning and torsion angles, which identifies it with the discrete Frenet frame of the inscribed orbit polygon. An embedded regular Hahn curve is determined, up to linear reparametrization about $ω_0$, by its trace and the induced contraction. We prove a sharp planarity criterion and a fundamental theorem via an infinite product of rotations and the Jackson–Nörlund integral. For smooth curves, expansions uniform in $q$ show that at $ω_0$ the Hahn curvature and torsion carry the factors $[2]_q/2$ and $[3]_q/3$. These factors, a sampling effect of geometrically decaying steps, disappear under edge-length normalization, but their quotient persists in the limiting ratio of torsion and turning angles of every polygon inscribed in a smooth curve with monotonically converging vertices and edge lengths decaying with ratio~$q$. In uniformly sampled relaxation towards a stable node, the factors can become measurable biases. We characterize generalized Hahn helices by a two-step relation between turning and torsion angles; their Lancret ratio at $ω_0$ is $\pm([2]_q/2)\cot\vartheta$, where $\vartheta$ is the helix angle. Unlike the classical case, a constant ratio of torsion and curvature does not characterize helices: curves with constant curvature and torsion are never generalized Hahn helices, and, near $ω_0$, unit-speed helices with a given ratio are unique up to similarities and linear reparametrization.

fields
Differential Geometry
pdf ↗ page arXiv:2610.33084 ↗

We construct arbitrarily large configurations of distinct points in Euclidean three-space with linearly dependent Atiyah polynomials, including planar configurations. The configurations consist of two coaxial cyclic orbits and axial points. We also obtain analogous configurations in hyperbolic three-space.

comments
20 pages, 1 figure. Earlier version on Zenodo: https://doi.org/10.5281/zenodo.22663662
fields
Differential Geometry, Metric Geometry
pdf ↗ page arXiv:2610.33090 ↗

We generalize Zoll families of hypersurfaces to Besse families of hypersurfaces, which are defined differential-topologically and may contain non-embedded and exceptional hypersurfaces. A contact-geometric discussion presents them as double Legendrian fibrations and shows that regular hypersurfaces are either spheres or real projective spaces. In analogy with the Berger conjecture on simply connected manifolds all of whose geodesics are closed, we show that every hypersurface of a Besse family on a sphere other than the 4-sphere is regular. On even-dimensional spheres other than the 4-sphere we obtain a stronger conclusion, generalizing a theorem of Gromoll and Grove about 2-spheres all of whose geodesics are closed: every hypersurface of a Besse family is regular and embedded. Moreover, building on work by Ambrozio and Guajardo, we provide metrics of non-constant curvature carrying Besse families of non-embedded minimal hypersurfaces in every odd dimension at least three, and Besse families of minimal hypersurfaces with exceptional hypersurfaces on orbifolds in every dimension at least two. We also give a short proof that manifolds admitting Zoll families of embedded hypersurfaces are homeomorphic to spheres or real projective spaces, recovering a recent result of Martins up to homeomorphism.

comments
20 pages
fields
Differential Geometry, Symplectic Geometry
pdf ↗ page arXiv:2610.33261 ↗

For the $\mathrm{PGL}_3$-Hitchin moduli space of unmarked convex $\mathbb{RP}^2$ structures on the surface $S_{g,m}$ with fixed boundary data $\mathbf L$ when $m>0$, we investigate the subset whose canonical Hilbert–Busemann area is bounded above by $t$. We show that the Goldman symplectic volume of this subset is at most $C_{g,m}(t+λ^2)^{8g-8+3m}$, where $λ$ is the largest total-root boundary length for $m>0$ and is set to $0$ for $m=0$. As a consequence, We obtain the explicit upper bound for the $e^{-s\cdot\mathrm{Area}}$-weighted volume.

comments
25 pages, 7 figures. This preprint supersedes the earlier preprint arXiv:2001.01295
fields
Differential Geometry, Mathematical Physics, Geometric Topology
pdf ↗ page arXiv:2610.33417 ↗

We prove that a smooth homotopy $9$-sphere admits a Riemannian metric of positive sectional curvature if and only if its Hitchin $α$-invariant vanishes, or equivalently if and only if it admits a Riemannian metric of positive scalar curvature.

comments
44 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.33474 ↗

In this paper, we study multi-marginal optimal transport on ideal sub-Riemannian manifolds. We establish a sub-Riemannian barycentric balance condition and prove the existence of a solution to the Monge problem under an additional assumption. We also investigate the absolute continuity of Wasserstein barycenters. Our results extend and improve upon those of Pass, Pinamonti, and Vedovato (Methods Appl. Anal. 28 (2021), 61-76) on the Heisenberg group, answering two open questions raised in their work.

comments
21 pages
fields
Differential Geometry, Metric Geometry, Optimization and Control
pdf ↗ page arXiv:2610.33721 ↗

We consider Myers–Perry spacetimes $(M,g_{\mathbf{a},\mathbf{b},\mathfrak{m}})$ in $1+4$ dimensions with two spin parameters $(\mathbf{a},\mathbf{b})\in\mathbb{R}^2$, which are a direct generalization of the well known Kerr spacetime in $1+3$ dimensions. We prove that the Hamiltonian flow associated to $g_{\mathbf{a},\mathbf{b},\mathfrak{m}}^{-1}$ is normally hyperbolically trapped for the full subextremal range \[ (|\mathbf{a}|+|\mathbf{b}|)^2<2\mathfrak{m}. \] As an application, we prove a Price law with explicit leading order terms for solutions $φ(t,x)$ of the scalar wave equation \[ \Box_{g_{\mathbf{a},\mathbf{b},\mathfrak{m}}}φ=0 \] under the assumption of real mode stability. Our precise asymptotics imply that $φ(t,x)=ct^{-3}+\mathcal{O}(t^{-4+})$, where $c\in\mathbb{C}$ is an explicitly computable constant.

comments
119 pages, 9 figures
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2610.33812 ↗

We propose a parametrization-free framework for estimating the second fundamental form and the principal curvatures of a submanifold of $\mathbb{R}^d$. The method uses the closest point projections of a few short random rays and recovers the curvature from the curves that these projections induce on the submanifold, without coordinate charts or local fitting. We analyze the geometry of the induced curves and characterize when they are geodesics. For hypersurfaces, these results give two algorithms with error bounds: a least squares reconstruction of the second fundamental form from the curvatures of the induced curves, and a direct estimate of all principal curvatures from the eigenvalues of a $d\times d$ matrix built from $d$ rays, which needs no normal information and costs $\mathcal{O}(d^3)$ besides the projections. In higher codimension, we can also recover the second fundamental form one normal direction at a time. On point clouds, where the projection becomes a nearest neighbor query, we bound the additional error. Experiments confirm the predicted rates for hypersurfaces in up to $128$ dimensions, for surfaces of codimension up to $98$, and on point clouds, demonstrating the effectiveness of the proposed framework in practice.

comments
45 pages, 9 figures
fields
Differential Geometry
pdf ↗ page arXiv:2610.33943 ↗

We establish a sharp spherical upper bound for the $σ_k$-maximal conformal volume $Λ_k$ introduced by Gursky and Viaclovsky. Let $(M^n,[g])$ be a smooth, closed, connected conformal manifold with $n\geq 3$ and $n/2<k\leq n$, and suppose that $[g]$ contains a $k$-admissible metric, we prove that $ Λ_k(M,[g]) \leq \operatorname{Vol}(\mathbb S^n,g_{\mathrm{rd}}), $ with equality if and only if $(M,[g])$ is conformally equivalent to the standard sphere. Combined with the existence and compactness theorem of Gursky and Viaclovsky below the spherical threshold, this completes their approach to the $σ_k$-Yamabe problem through maximal conformal volume in the range $k>n/2$.

fields
Differential Geometry
pdf ↗ page arXiv:2610.33986 ↗

Alpöge recently announced smooth counterexamples to the Loewner and Carathéodory conjectures. We present a simpler construction based on a trigonometric function as a seed. Using this, for every positive integer $k$, we construct a smooth real-valued function on the plane, flat at the origin, whose Hessian eigenline fields have an isolated singularity of index $1+k/2$. A support-function parametrization realizes this index as an umbilic index of a non-real analytic $C^\infty$-regular surface germ in Euclidean $3$-space. The same framework, applied to a rapidly decreasing function on the whole plane, gives a strictly convex closed smooth surface with exactly one umbilic, of index $2$. This paper is self-contained with regard to the existence of an umbilic of index $2$ and the construction of a counterexample to the Carathéodory conjecture.

fields
Differential Geometry
pdf ↗ page arXiv:2610.34036 ↗

Building on the work of Song–Waldron~\cite{SongWaldron2024}, we establish stronger regularity and refined blow-up analysis results for almost-holomorphic harmonic map flow from a closed surface into a compact Kähler manifold with nonnegative holomorphic bisectional curvature. At each finite-time singularity, we improve the outer energy scale to $O((T-t)/\sqrt{|\ln(T-t)|})$. We also prove that both the stress-energy tensor and the tension field converge strongly in $L^2$ to those of the body map, by ruling out concentration of their $L^2$ energy near the singular points. Consequently, the body map belongs to $W^{2,2}$. Finally, an explicit gap theorem for the antiholomorphic energy of nonholomorphic harmonic spheres yields an explicit admissible threshold for the initial antiholomorphic energy under which these conclusions hold.

comments
Comments welcome
fields
Differential Geometry
pdf ↗ page arXiv:2610.34132 ↗

In this paper we study coupled constant scalar curvature Kähler metrics defined by Datar-Pingali extending coupled Kähler-Einstein metrics defined by Hultgren-Witt Nyström. We consider two K-energy functionals of which one (denoted $\mathcal{M}_{\operatorname{ccscK}}$) integrates the moment map considered by Datar-Pingali and the other (denoted $\mathcal{M}'$) is designed so that its slope at infinity for subgeodesic rays for ample test configurations with reduced central fiber coincides with the Donaldson-Futaki invariant considered by Hultgren-Witt Nyström and Datar-Pingali. We also extend $\mathcal{M}_{\operatorname{ccscK}}$ to $\mathcal{H}^{1,\bar{1}}$ and the finite energy class $\mathcal{E}^1$, and prove its convexity along tuples of weak geodesics and finite energy geodesics, respectively. As a corollary, we obtain a semistability condition necessary for the existence of ccscK metrics.

fields
Differential Geometry
pdf ↗ page arXiv:2610.34145 ↗

We prove sharp amplitude and gradient comparisons for positive solutions of a class of semilinear elliptic equations on complete manifolds under a Ricci lower bound. Equality at one point characterizes hyperbolic space and the corresponding radial solution. The local estimates are uniform in the mixing coefficients and number of terms for positive mixtures of subcritical powers. For a class of conformal compactifications defined by a source equation, we obtain sharp boundary scalar-curvature bounds and hyperbolic rigidity. We also construct non-Einstein examples whose normalization persists under small compactly supported metric perturbations.

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

We study Clifford-weighted noncommutative residues associated with Dirac operators and connections. On closed spin manifolds a double commutator of the square of the Dirac operator, paired with a Clifford commutator, recovers the localized Riemann curvature tensor. We prove presentation independence for its extension to arbitrary classical one-forms, recompute four-Clifford functionals, and give explicit Weyl, Schouten and Einstein curvature combinations. For spectral triples with an admissible residue calculus we define a partial spectral curvature functional on two arbitrary represented one-forms and two exact represented one-forms. Its well-definedness is distinguished from module tensoriality: explicit flat noncommutative-torus computations exhibit both a failure of general presentation descent and nonzero partial pairings. A connection-based curvature pairing provides a separate construction, including noncentral pure Clifford-degree-two examples. We also derive ordered first- and second-derivative torsion residues on free torus modules and prove an obstruction to ordinary alternation for unrestricted noncentral inputs. All constants, coefficient orders and hypotheses are kept explicit.

fields
Differential Geometry
pdf ↗ page arXiv:2610.34256 ↗

We study ancient solutions to curve shortening flow on a class of warped product surfaces. For closed embedded ancient solutions whose curves are not null-homotopic, we prove that graphicality at every time is equivalent to a uniform length bound as $t\to-\infty$, and that these properties hold whenever the length is $o(\sqrt{-t})$. Under an additional positivity condition on the linearized height equation, every such solution with bounded length is a family of slices. We derive backward convergence to a limiting circle from the length bound and prove slice rigidity by an $L^2$ estimate for the height perturbation.

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

We obtain upper bounds for the number of small eigenvalues of complete Riemannian manifolds with negative sectional curvature and finite volume.

comments
18 pages
fields
Differential Geometry, Spectral Theory
pdf ↗ page arXiv:2610.34337 ↗

In this paper, we prove the long time existence of the pseudo-Calabi flow on a compact toric variety for any $T^n$-invariant initial Kähler metric. If the Mabuchi functional is proper modulo automorphisms, the flow converges exponentially to a constant scalar curvature Kähler (cscK) metric. In particular, this gives a flow proof that properness of the K-energy implies the existence of a cscK metric in the toric setting.

comments
55 pages
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2610.34340 ↗

We prove that the diameter of a closed embedded surface in $\mathbb{R}^3$ is always less than the integral of the magnitude of the mean curvature, divided by $π$. We also prove a sharp variant for surfaces with boundary, and apply it to address a conjecture of Miura.

fields
Differential Geometry
pdf ↗ page arXiv:2610.34367 ↗

We compare the Chern holonomy of the first and second Chern-Ricci flows on compact complex manifolds. For the first flow, we construct an explicit immortal pluriclosed solution on a complex two-torus with full and restricted holonomy $U(2)$, except at one finite time when both groups are $U(1)^2$; its smooth limit has holonomy $SU(2)$. The solution is uniformly nondegenerate and has bounds of every fixed differential order for all time. In contrast, the second Chern-Ricci flow preserves full and restricted Chern holonomy under the natural unitary identification, including the initial time and nonclosed groups. The proof combines preservation of a connection reduction, positive-time analyticity, and a path-transport comparison. As an application, the optimal minimum mean curvature on a holomorphic bundle is unchanged when metrics are restricted to any realizable full and restricted holonomy class. An explicit projected-curvature source explains the failure of the corresponding Ricci-flow holonomy argument.

fields
Differential Geometry
pdf ↗ page arXiv:2610.34665 ↗

Let $M=Γ\backslash G$ be a compact solvmanifold with a left-invariant Hermitian structure whose Lie algebra is two-step solvable. If the Chern holomorphic sectional curvature is constant, then the derived algebra is $J$-invariant and the Chern connection is flat. At the Lie-algebra level, we also prove that constant Chern holomorphic sectional curvature is impossible for a unimodular two-step solvable Hermitian Lie algebra of mixed Freibert-Swann type.

fields
Differential Geometry
pdf ↗ page arXiv:2610.34820 ↗

We classify all left-invariant affine Ricci solitons associated with the Bott connections of two fixed rank-two distributions on the seven standard families of three-dimensional Lorentzian Lie groups. The distributions are defined by a fixed orthogonal change of the spacelike frame. A universal adapted-frame calculation provides explicit connection matrices, curvature operators and the symmetrized Ricci tensor. The equation in the orthogonal-complement direction forces every left-invariant solution to be steady. The remaining equations yield elementary parameter families and finitely many real algebraic branches: four normalized branches for $G_2$, six branches for each sign parameter in $G_4$, and two quartic branches in $G_7$ in addition to its elementary families. Resultants, subresultants, exact polynomial reduction and Sturm root isolation establish necessity, sufficiency and exhaustiveness. Degenerate cases are treated separately, including all families with nonunique soliton vector fields. An invertible frame transformation relates the two distribution problems. The classification is in the stated structure parameters; no quotient by isometries, automorphisms or scaling is taken.

fields
Differential Geometry
pdf ↗ page arXiv:2610.34835 ↗

For every positive integer $g$ and every Hoffman-Osserman catenoid in $\mathbb{R}^5$, we construct a complete embedded minimal surface of genus $g$ that is not contained in any proper affine subspace of $\mathbb{R}^5$. These surfaces can be viewed as higher-codimensional analogues of the Costa-Hoffman-Meeks surfaces, associated with the union of the corresponding Hoffman-Osserman catenoid and the plane containing its waist circle. We provide explicit Weierstrass data for these surfaces. Our construction can also be interpreted as restoring conformality to a deformed Costa-Hoffman-Meeks immersion by introducing two additional harmonic coordinate functions.

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

We construct counterexamples to Ilmanen's genus-reduction conjecture for closed mean curvature flows. We prove that a compact hypersurface with a single isolated conical singularity and a power rate of convergence to its cone admits a mean curvature flow whose forward rescaled limit is a prescribed expander smoothly asymptotic to that cone. Combining this theorem with closed mean curvature flows with prescribed tangent flows (arXiv:2405.15577, arXiv:2607.23879) and the noncompact counterexample (arXiv:2605.09657) gives the desired examples.

comments
18 pages, comments are welcome!
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2610.35000 ↗

For each dimension $n\ge 2$, we construct noncollapsing sequences of metrics on $S^n$ with a uniform positive lower bound on sectional curvature whose oriented orthonormal frame bundles, equipped with the canonically induced connection metrics, converge to nonmanifold metric spaces homeomorphic to $Σ(S^{n-1}\times\SO(n))$. In even dimensions, real projective quotients give connected full frame bundles with the same limits, disproving the manifold conclusion in Yamaguchi's frame bundle conjecture. In odd dimensions, each component of the full projective frame bundle, with its intrinsic metric, converges to the quotient of the spherical limit by a free involution. The singularities are detected by local homology, and we obtain quantitative equivariant Gromov–Hausdorff estimates. We also compare the frame bundle limits with the intrinsic completions of their regular limiting frame metrics, and present and discuss alternatives to Yamaguchi's original conjecture.

fields
Differential Geometry, Metric Geometry
pdf ↗ page arXiv:2610.35146 ↗

We study global regularity properties of conformal structures on compact manifolds with applications to conformally invariant variational problems. We find sharp conditions ensuring that a manifold equipped with a Riemannian metric of Sobolev class is conformally diffeomorphic to a smooth one. In particular, we prove that $W^{2,q}$ Bach-flat four-manifolds with $q > 2$ are smooth up to conformal diffeomorphisms. We also solve the Yamabe problem for $W^{2,q}$ metrics with $q > 2$ on three-manifolds under a mild conformal condition.

comments
27 pages. Comments are welcome!
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2610.35257 ↗

We express the zeta regularized determinants of the Dirichlet and Neumann Laplacians on compact Riemann surfaces with constant curvature metrics and geodesic polygonal boundary in terms of the Laplacian determinant on their closed conical doubles. The formulae apply without restrictions on the genus or number of boundary components. They involve explicit corner angle factors and a quotient of the Reidemeister and $L^2$ norms on the determinant line of cohomology. The proof combines a relative BFK gluing formula with the comparison theorem for analytic and combinatorial torsion on manifolds with boundary, due to Lück and Vishik. As an application, we give a rigorous proof of the Aurell-Salomonson formula for Euclidean polygons. We also obtain explicit determinants for spherical and hyperbolic triangles and certain other geodesic polygons from known formulae for their doubles.

fields
Differential Geometry, Mathematical Physics, Analysis of PDEs, Spectral Theory
pdf ↗ page arXiv:2610.35383 ↗

We extend the quermassintegral inequalities of our earlier work \cite{GuanLi2009} from star-shaped domains to a substantially broader class of domains in Euclidean space, which we call spiral-star-shaped. A smooth domain is spiral-star-shaped if its boundary satisfies \[ \langle X+A X,ν\rangle>0 \] for some fixed skew-symmetric linear map $ A$, where $X$ is the position vector and $ν$ is the outward unit normal. The vector field $X+A X$ is conformal Killing, with dilation component $X$ and rotational component $A X$; its trajectories combine expansion and rotation, giving rise to the spiral terminology. When $A=0$, it reduces to ordinary star-shapedness, while nonzero $A$ allows domains that are not star-shaped in the usual radial sense. For smooth $k$-convex spiral-star-shaped domains, we prove long-time existence and exponential convergence to a round sphere for a locally constrained inverse curvature flow. The positive spiral support function provides the geometric control needed to treat initial hypersurfaces that need not be star-shaped in the usual sense. Monotonicity of the quermassintegrals along the flow yields sharp quermassintegral inequalities in this enlarged class, with equality if and only if the domain is a ball.

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

Let $V_{g,n}$ denote the Weil–Petersson volume of the moduli space of genus-$g$ hyperbolic surfaces with $n$ cusps. We obtain an asymptotic expansion in inverse powers of the genus as $g\to\infty$, uniformly for all $n\ge0$. This includes cusp counts of order $\sqrt g$ and larger, where the fixed-$n$ expansion of Mirzakhani and Zograf no longer gives a uniform approximation. The leading term is explicit and has relative error $O(g^{-1})$. Truncating the expansion at a suitably chosen order proportional to $\sqrt g$ gives relative error $O(\exp(-a\sqrt g))$ for some $a>0$, with no restriction on the growth of $n$. For fixed $n$, the leading term identifies the universal constant in the Mirzakhani–Zograf asymptotics as $1/\sqrtπ$, as conjectured by Zograf. We also answer two questions of Mirzakhani: we determine explicit asymptotic profiles for volume ratios uniformly in the number of cusps, and for adjacent coefficient ratios of the one-boundary volume polynomial uniformly over all degrees. The proof uses a positive recursion for mixed $κ_1$--$ψ$ intersection numbers, with the absolute normalization determined by comparison with the known asymptotics of pure $ψ$ intersection numbers.

comments
75 pages, no figures. An earlier version was first made publicly available on Zenodo on 16 October 2026: https://zenodo.org/records/23414478
fields
Differential Geometry, Algebraic Geometry
pdf ↗ page arXiv:2610.35492 ↗

We classify untwisted generalized hypercomplex structures on four-manifolds whose entire sphere has type one. The three Poisson tensors determine a canonical line field, and the local data are Gauduchon–Tod coframes. We determine local equivalence under diffeomorphisms, common closed real $B$-fields and constant rotations of the triple. On a closed manifold the canonical foliation is automatically Riemannian: a nonzero period obstructs the exact twist required by the non-Riemannian models. The compact structures form four families, distinguished by $b_1=1,2,3,4$: Berger quotients, flat axis quotients, nontrivial circle bundles over flat three-tori, and constant tori. We determine their parameters, equivalences and finite ordered quotients, including nonorientable canonical lines. The underlying manifolds are parallelizable, satisfy $b_2=2b_1-2$, and are symplectic exactly when the intrinsic Gauduchon–Tod invariant vanishes. A twisted Hopf example shows why the untwisted hypothesis is essential. The classification is intrinsic and assumes no initial circle action. These results address the four-dimensional untwisted case of the intermediate-type question of Fino and Grantcharov.

fields
Differential Geometry
pdf ↗ page arXiv:2610.35557 ↗

We prove that every critical spherical catenoid in a geodesic ball of hyperbolic three-space has Morse index four and nullity two. This resolves Medvedev's index conjecture throughout the parameter range of the catenoid family. The kernel consists precisely of the normal components of rotations that preserve the center of the ball and tilt the axis of the catenoid. As a consequence, the radius of the supporting ball increases strictly along the family. The proof combines a global boundary inequality obtained from a Wronskian, a positive Dirichlet eigenfunction supplied by the time component of the unit normal, and a Riccati comparison for the angular mode $k=2$. A ground-state identity then yields positivity of every angular mode $k\ge2$.

fields
Differential Geometry, Analysis of PDEs, Spectral Theory
pdf ↗ page arXiv:2610.35651 ↗

We study quermassintegral-preserving curvature flows in $\mathbb H^{n+1}$, $n\geq3$, driven by the curvature quotient $(E_k/E_\ell)^{1/(k-\ell)}$. For $1\leq\ell<k$ with $k+\ell\leq n$, we prove that positive sectional curvature is preserved. Starting from a smooth closed strictly convex hypersurface with positive sectional curvature, the flow exists for all time and converges smoothly and exponentially to a geodesic sphere. As an application, we establish sharp Alexandrov–Fenchel inequalities between $W_k$ and $W_\ell$ for smooth bounded convex domains whose boundaries have nonnegative sectional curvature, whenever $0\leq\ell<k\leq n$ and $k+\ell\leq n$. Equality holds if and only if the domain is a geodesic ball. Together with previously known cases, these inequalities give the full family of Alexandrov–Fenchel inequalities for this class of domains in $\mathbb H^6$. We also construct counterexamples showing that $k+\ell\leq n$ is the optimal range for preservation of positive sectional curvature by these flows.

comments
36 pages. Comments are welcome!
fields
Differential Geometry
pdf ↗ page arXiv:2610.35707 ↗

For stable Higgs bundles, Hermitian-Einstein metrics can be obtained as limits of the Yang-Mills-Higgs (Y-M-H) flow. We study the algebraic structure of subsequential limits of this flow for reflexive Higgs sheaves over compact Kähler manifolds, without assuming stability. We prove that the limiting reflexive Higgs sheaf is isomorphic to the double dual of the graded sheaf associated with the Harder-Narasimhan-Seshadri filtration of the initial sheaf.

comments
37 pages
fields
Differential Geometry
pdf ↗ page arXiv:2610.35742 ↗

In this paper, we study the Weyl problem for noncompact convex surfaces in hyperbolic $3$-space $\mathbb{H}^3$. We prove that any planar CBB$(-1)$ surface with countably many ends can be isometrically embedded as the boundary of a closed convex subset $X\subset\mathbb{H}^3$ such that each connected component of the ideal boundary of $X$ is either a round disk or a single point. By known rigidity results, such an embedding is unique up to isometries of $\mathbb{H}^3$. Moreover, we show that the assumption of countably many ends can be dropped if Koebe's circle domain conjecture holds.

comments
58 pages
fields
Differential Geometry, Geometric Topology, Metric Geometry
pdf ↗ page arXiv:2610.35744 ↗

We show that every open Riemann surface may be conformally properly embedded in the tangent sphere bundle of hyperbolic $3$-space as a Legendrian surface. We achieve this by constructing proper holomorphic Legendrian embeddings in $\mathrm{SL}_2 (\mathbb{C})$ whose projections to the quotient $\mathrm{SL}_2 (\mathbb{C})/ \mathrm{U}_1$ remain embeddings. As another consequence, every open Riemann surface admits a proper holomorphic Legendrian embedding in the projectivised special linear group $\mathrm{PSL}_2 (\mathbb{C})$.

fields
Differential Geometry
pdf ↗ page arXiv:2610.35812 ↗

Following Simons' seminal work in 1968, every closed, connected, embedded minimal surface in the four-sphere that is not totally geodesic has Morse index at least five. In this paper, we prove that equality holds if and only if the surface is congruent to the Veronese projective plane. Relying on recent advances by Bernstein and Ketover, this characterization settles Kusner's 1996 conjecture on the minimizers of the Willmore functional in dimension four for surfaces whose normal bundle has nonzero Euler number. This is always the case, in particular, for embeddings of nonorientable surfaces whose orientation double cover has even genus.

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

We construct $\mathrm{SU}(2)$ Yang-Mills-Higgs fields on a broad class of noncompact Riemannian manifolds, concentrating in the large-mass limit along prescribed nondegenerate minimal submanifolds of codimension three. The solutions have uniformly bounded rescaled energy. On closed manifolds with $b_1(M)=0$, adding a suitably scaled Higgs potential gives an analogous concentration result. Our construction completes one direction of the correspondence proposed by Parise, Pigati and Stern, realising prescribed minimal submanifolds of codimension three as concentration sets of $\mathrm{SU}(2)$ Yang–Mills–Higgs fields.

comments
88 pages. All comments are welcome!
fields
Differential Geometry, Analysis of PDEs
pdf ↗ page arXiv:2610.35837 ↗

Dynamical Systems36

In this paper, new uniqueness criteria for Rayleigh–Liénard systems with damping of positive odd degree in the velocity are established. Under suitable conditions, any limit cycle is unique and hyperbolic, with its stability determined by the damping signs. Neither symmetry nor monotonicity of the damping and restoring functions is required. Changes of variables and time yield further criteria for generalized Kukles systems. Applications to three polynomial families yield uniqueness and nonexistence results. In particular, we resolve an open uniqueness problem for a hybrid van der Pol–Rayleigh oscillator left open by Chen et al. (Phys. D, 2021). We also give an alternative uniqueness proof for a system with homogeneous components and obtain uniqueness and nonexistence results for a modified hybrid van der Pol–Rayleigh oscillator.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.33114 ↗

We study the Cucker–Smale model with state-dependent transmission delays arising from finite-speed information propagation. Our main contribution is a Lyapunov functional inspired by the Doppler effect, combining a delay potential with a logarithmic correction involving the receiver velocity. Its dissipation yields uniform delay bounds without relying on velocity contraction estimates. For two agents in one spatial dimension, we prove asymptotic flocking for arbitrary compatible subluminal initial histories, assuming only that the influence function has a divergent integral at infinity. A bounded geometric correction extends this result to arbitrary spatial dimension when all values of the initial velocity histories lie on one common affine line. For multiple agents in one dimension, we obtain uniform delay bounds, and thus flocking, provided that a fixed agent is leftmost for all sufficiently large times. In all these flocking regimes, the spatial diameter remains uniformly bounded and the velocity diameter decays exponentially. We also derive a conditional criterion involving logarithmic sums when the leftmost agent changes infinitely often. Finally, we construct a multidimensional analogue of the Doppler-inspired functional and identify an additional assumption needed to obtain delay bounds in the general case.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.33170 ↗

We prove the existence of maximizing measures for subadditive and almost-additive families of upper semicontinuous, bounded-above potentials $\mathcal F=\{f_n\}_{n\geq1}$ on closed subshifts over countable alphabets. Under a coercivity condition on $f_1$, we prove that every maximizing sequence, that is, $\{μ_k\}_{k\geq1}\subset\mathcal M_σ(X)$ satisfying $\bar{\mathcal F}(μ_k)\toβ(\mathcal F)$, is uniformly tight, preventing mass from escaping to arbitrarily large symbols. As a consequence, a maximizing measure exists.

comments
Submitted
fields
Dynamical Systems
pdf ↗ page arXiv:2610.33218 ↗

In this paper, we study planar polynomial vector fields admitting invariant circles. We characterize polynomial vector fields having $m$ concentric invariant circles, and we describe those having three invariant circles whose centers are not collinear. We also give a necessary and sufficient condition for the unit circle to be the unique limit cycle of a quadratic vector field. We prove that a cubic or quartic Kolmogorov vector field having the unit circle invariant has no circular limit cycle, and that a quartic vector field with two concentric circular limit cycles has at most three circular limit cycles, this bound being sharp.

comments
11 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.33226 ↗

We prove $C^1$-stability of $C^\infty$ rank-one factors for a large class of higher rank Anosov $\mathbb Z^k$-actions. If the factor is a projection of a smooth fiber bundle and the action contains an element which acts as the identity on the rank-one factor and is Anosov on every fiber, then any sufficiently $C^1$-small $C^\infty$ perturbation of the action will also have a $C^\infty$ rank-one factor. In particular, we prove the $C^1$-stability of the product structure for Anosov $\mathbb Z^2$-actions which are obtained as a (diagonal) product of two $\mathbb Z$-Anosov actions.

comments
13 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.33228 ↗

We study the question of existence and multiplicity of homogeneous Markov Gibbs measures on Cayley trees with spin space $\mathbb{Z}$. We prove that, under a natural summability assumption on the interaction function, there are always at least two homogeneous Markov Gibbs measures satisfying two natural symmetry conditions. Moreover, any two homogeneous Markov Gibbs measures satisfying a suitable non-degeneracy assumption can be superimposed and produce infinitely many other homogeneous Markov Gibbs measures. When the interaction function $Q$ has bounded support in $\mathbb{Z}$, there is a one-to-one correspondence between homogeneous Markov Gibbs measures and suitable homoclinic orbits of a symplectomorphism of $\mathbb{R}^{2n}$, where $n$ is the smallest natural number such that $Q(i)=0$ for every $i>n$. For $n=1$, results from symbolic dynamics and horseshoes imply the existence of homogeneous Markov Gibbs measures whose single-site marginal is concentrated near an arbitrary finite subset of $N\mathbb{Z}$, where $N$ is a sufficiently large integer. In the case of interaction functions with infinite support, there is a one-to-one correspondence between homogeneous Markov Gibbs measures and suitable homoclinic orbits of a Lagrangian correspondence on the cotangent bundle of a Banach space.

comments
88 pages, 6 figures
fields
Dynamical Systems, Probability
pdf ↗ page arXiv:2610.33287 ↗

It is shown that for any infinitely renormalizable quadratic polynomial $Q_c$ the intersection $K_\infty$ of all the little filled-in Julia sets (renormalization Julia sets) containing the critical value have zero area.

comments
7 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.33328 ↗

The qualitative dynamics of nonautonomous differential equations is often studied through cocycles and skew-product semiflows over a driving base. We develop a chain-recurrence reduction principle for systems admitting an equivariant attracting section and uniform asymptotic tracking. The abstract theorem determines the complete chain-attainability relation in the ambient phase space: chains may start off the attracting section, but every attainable target lies on it and is selected solely by the factor semiflow. Applied to contracting controlled skew-product semiflows, this gives exact descriptions of the chain recurrent set, chain components, Conley order, compact strictly invariant sets, attractors, basins, and dual repellers. A weighted-supremum transverse gauge yields a complete Lyapunov function for the full semiflow while preserving the recurrent values of the base. The differential hypotheses are verified through subadditive fiber-derivative growth and averaged moving-metric logarithmic norms, allowing transient expansion and non-unique ergodicity. Quantitative persistence is established for finite-window maps and smooth vector-field perturbations. The results provide a unified framework for chain recurrence, Lyapunov structure, and attractor–repeller geometry in contracting nonautonomous dynamics.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.33519 ↗

Recently, the author refuted several conjectures about the vanishing of multiple correlation sequences. The goal of this paper is to provide a counterpart for the conjectures of Frantzikinakis–Kuca and of Leibman. The significance of this manuscript is twofold: firstly, we provide a structure theorem for multiple correlation sequences on nilsystems along arithmetic progressions (in the sense of Frantzikinakis–Kuca), and a corresponding structure theorem for polynomial orbits of subnilmanifolds in connected nilmanifolds (in the sense of Leibman). Secondly, we identify null generalized nilsequences, as a notion of smallness, which provides a structured counterpart for null sequences. In particular, in the special case of ergodic nilsystems, we answer positively a question of Frantzikinakis on the structure of multiple correlation sequences.

comments
27 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.33596 ↗

Introducing a probabilistic perspective on a classical theme within the study of chaotic dynamics, we investigate the zeros of the Melnikov distance function associated to a periodically perturbed Hamiltonian system when the perturbation has random coefficients. We provide asymptotic estimates (as the period of the perturbation becomes large or small) for the average number of zeros and for the probability of no zeros.

comments
23 pages, 2 figures
fields
Dynamical Systems, Probability
pdf ↗ page arXiv:2610.33620 ↗

Let $\mathcal P$ be a finite nonempty set of primes, and let $S_{\mathcal P}$ be the multiplicative semigroup that they generate. We prove that there are an invertible weakly mixing measure-preserving transformation $T$ and a set $A$ of positive measure such that $A\cap T^{-r}A=\varnothing$ for every $r\in S_{\mathcal P}$. This gives a negative answer to Bergelson's 1996 question concerning recurrence along $\{2^m3^n:m,n\geq1\}$, and applies to every finitely generated multiplicative semigroup of positive integers. More generally, we give a sufficient condition for weakly mixing non-recurrence based on divisibility properties and separation by finitely many rotations of the circle. This criterion also applies to an infinitely generated multiplicative semigroup not contained in any $S_{\mathcal P}$ with $\mathcal P$ finite.

comments
17 pages. Comments are welcome!
fields
Dynamical Systems
pdf ↗ page arXiv:2610.33710 ↗

We study Birkhoff magnetic billiards inside convex planar domains for a constant weak magnetic field. We prove that there exists a functional family of centrally-symmetric convex billiard tables satisfying the so-called magnetic Radon property. These are tables which have a rotational invariant curves consisting of $4$-periodic orbits with the rotation numbers either $1/4$ or $3/4$. These billiard tables can be constructed in a neighborhood of circles. However in our construction we do not use perturbation methods but rather some topological argument for the system of ODEs governing the magnetic Radon property. In contrast with this result we consider the magnetic billiard tables having discrete rotational symmetry for the angle $2π/k, k\in\mathbb{Z}$. We prove that in this case a rotational invariant curve consisting of $k$-periodic orbits exists, if and only if the billiard table is circular. We develop several tools, which, we believe, are important for other aspects of magnetic billiards. The first is the "magnetic duality" which enables to work with the dual object—the outer magnetic billiard. Secondly, we find the generating functions of outer magnetic billiard, both the ''standard" and the "non-standard" ones.

comments
26 p
fields
Dynamical Systems, Mathematical Physics
pdf ↗ page arXiv:2610.33782 ↗

We study random iterations generated by infinitely many Lipschitz maps on non-compact complete separable metric spaces. We generalize classical displacement conditions ensuring the existence and uniqueness of invariant structures. We prove two main results. The first uses the graph transform operator to extend Elton's condition [A multiplicative ergodic theorem for Lipschitz maps. Stochastic Process. Appl. 34(1) (1990)] for the existence and uniqueness of invariant graphs. The second uses the Markov operator to generalize a displacement condition for stationary measures, introduced by Diaconis and Freedman [Iterated random functions. SIAM Rev. 41(1) (1999)] and by Kloeckner [Optimal transportation and stationary measures for iterated function systems. Math. Proc. Cambridge Philos. Soc. 173(1) (2022)]. We present several examples illustrating the applicability of our results.

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

We are developing some topological dynamics below a given ambit. We define and study Bohr compactifications below ambits and other related objects. We describe a natural epimorphism from the Ellis group of an ambit to the Bohr compactification below its Ellis semigroup ambit. The first main result says that, assuming tameness and hereditary amenability, this natural map is an isomorphism of topological groups. This is an abstract dynamical generalization of Newelski's conjecture, or rather a theorem of Chernikov and Simon that a natural map from the Ellis group of the flow $(S_G(M),G)$ to the definable Bohr compactification of $G$ is an isomorphism when $G$ is a definably amenable group definable in a NIP structure $M$. We give two proofs of our main result: a shorter dynamical proof and an analytic proof. In the course of the dynamical proof, we prove some results on the universal compactification flow and on the generalized Bohr compactification below a given ambit which admits a left continuous semigroup operation extending the action of $G$. The considerations around the analytic proof yield a description of the measured structure of amenable tame minimal flows, which is the second main result of this paper. We also study specializations of the above abstract topological dynamics context to model theory contexts to recover some known and to obtain some new notions and results. The main new results in the model theory contexts are: (i) a description of the Bohr compactification of the group of automorphisms of a sufficiently saturated model $\mathfrak{C}$ of a first order theory $T$ below a certain fundamental ambit associated with $\mathfrak{C}$; (ii) transfer of amenability of a NIP theory $T$ to amenability of the Ellis semigroup ambit; (iii) a version of Newelski's conjecture for spaces of local types with a description of Bohr compactifications below such spaces.

comments
54 pages
fields
Dynamical Systems, Logic
pdf ↗ page arXiv:2610.33830 ↗

We study the thermodynamic formalism of a broad class of partially hyperbolic, non-uniformly expanding endomorphisms with critical set, and show that they admit unique equilibrium states for all Hölder potentials of small variation. In particular, our results yield uniqueness of equilibrium states for Viana maps with small variation Hölder potentials, for non-uniformly expanding interval maps with finitely many critical points and hyperbolic Hölder potentials, and for Benedicks-Carleson quadratic maps with arbitrary Hölder potentials.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.34068 ↗

We study the Hausdorff and packing measures of attractors generated by infinite $β$-Lüroth iterated function systems. Let $I\subset\mathbb N$ be infinite and let $\dim_H E_I=h$. For a regular system, we first give conditions for the positivity of $\mathcal H^h(E_I)$ and the finiteness of $\mathcal P^h(E_I)$ in terms of first-level Lüroth intervals. We then introduce tail-regular partitions and the scale $R_n=\frac{B_n^\infty}{B_n}.$ Under tail-regularity, the Hausdorff and packing conditions reduce to counting conditions for $I$ on intervals of length comparable to $R_n$, together with a tail condition in the packing case. Finally, we apply these results to regularly varying partitions and stretched-exponential partitions.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.34076 ↗

We investigate differential equations defined through elements of a nonassociative five-dimensional real algebra $\mathcal A_γ$, and show that every system of quadratic differential equations $\dot p=F(p)$ on $\mathbb R^5$ can be written as a differential equation over such a non-flexible quadratic algebra. We then study quadratic differential equations and their solutions over the whole family $\{\mathcal A_γ\}_{0\leqγ\leq1}$ of algebras while varying $γ$ across the parameter interval $[0,1]$, exploiting the fact that by definition, $\mathcal A_0$ contains Hamilton's quaternion algebra and that $\mathcal A_1=\mathbb{P}$ is the real Pentarnion algebra. We construct explicit Jacobi elliptic solutions that deform a quaternion-valued solution at $γ=0$ into a Pentarnion-valued one at $γ=1$, and an algebra-valued Riccati equation whose equilibrium $p=0$ loses stability at a critical value of $γ$. Numerical experiments indicate period doubling, coexisting stable periodic orbits and irregular dynamics.

comments
29 pages, 16 figures. Companion to Part I, arXiv:2610.31485. Code and data: https://github.com/poshtkohi/pentarnion-algebra
fields
Dynamical Systems, Rings and Algebras
pdf ↗ page arXiv:2610.34201 ↗

We introduce a five-dimensional nonassociative real algebra $\mathbb{P}$ whose one-generated subalgebras are complex while its left, middle, and right nuclei are all $\mathbb{R}$. This contrast permits an unambiguous one-element functional calculus but makes polynomial ordinary differential equations sensitive to bracketing. We classify the homogeneous quadratic words containing one fixed coefficient $B$ and two copies of $p$ that preserve $\operatorname{span}_{\mathbb{R}}\{1,B,p\}$. For a fixed-coefficient family of Pentarnion ODEs interpolating between $B(pp)$ and $(Bp)p$, changing only the bracketing preserves the linearisation but changes the observed global dynamics. Exact balance identities isolate the associator contribution, while numerical diagnostics support bounded chaos at one endpoint and an attracting periodic orbit at the other. The flexibility defect $p(Bp)-(pB)p=-[p,B,p]$ also produces a rank jump: after polarisation, one-generated subalgebras have dimension three on a nonempty Zariski-open set, rather than at most two. On a canonical invariant three-dimensional space the resulting flow has two first integrals and an explicit periodic orbit on an elliptic curve. We also construct a dense five-dimensional quadratic flow with a full-affine-span Jacobi-elliptic solution. Its projective closure is an elliptic normal sextic, and representation by two ordered products selects the modulus $m=1/2$.

comments
44 pages, 6 figures. Code and data: https://github.com/poshtkohi/pentarnion-algebra
fields
Dynamical Systems, Rings and Algebras
pdf ↗ page arXiv:2610.34202 ↗

Consider a $C^{1+β}$ skew product $F$ over a topologically mixing Anosov diffeomorphism $f$, with fiber dynamics driven by a $C^{1+β}$ $\mathbb{R}^k$-action $\{ρ_{\bf t}\}$ on a closed manifold $Y$ through a $C^{1+β}$ cocycle $τ$. Suppose that the fiber action preserves an ergodic smooth measure of maximal entropy $m_{\operatorname{MME}}$. Under a nondegeneracy condition called joint nontriviality, and assuming that each element $ρ_{\bf t}$ is either of class $C^\infty$ or hyperbolic, we prove that $F$ admits only finitely many ergodic measures of maximal entropy. Moreover, every such measure is of the form $μ\times m_{\operatorname{MME}}$, where $μ$ is an ergodic equilibrium state for a Hölder potential on the base. If, in addition, the fiber action is exponentially mixing of all orders, then every ergodic MME is Bernoulli, exponentially mixing of all orders, and satisfies the Central Limit Theorem. Our main novelties are entropy formulas for skew products, obtained through the cone property and $r$-neutralized entropy, and a relative Ledrappier–Young theorem that converts the fiber entropy contribution into absolute continuity of fiberwise conditional measures. Combined with nonlinear thermodynamic formalism, rotation theory and Yomdin theory, these yield the finiteness of the base projections and the product rigidity of ergodic MMEs.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.34209 ↗

For a fixed irrational rotation number of bounded type, we prove that the locus of critically marked cubic polynomials whose two critical points lie on the boundary of the fixed Siegel disk is a quasicircle. This locus is known as the Zakeri curve. The main step is a boundary correspondence lemma for holomorphic families of disks with uniformly quasiconformal extensions. We further prove that every capture component in this family is a quasidisk, including components attached to the Zakeri curve.

comments
17 pages
fields
Dynamical Systems, Complex Variables
pdf ↗ page arXiv:2610.34225 ↗

We establish a phase reduction and a converse realization theorem for front dynamics in one-dimensional periodic reaction-diffusion-advection equations. For sufficiently large periods under local bistability, and sufficiently small periods when the homogenized equation admits a stationary front, we construct strictly ordered invariant front families that are normally exponentially attracting and locally complete for entire orbits. Modulo spatial-period translations, the dynamics on each family reduces exactly to a circle flow: rotations correspond to propagating pulsating fronts, equilibria to stationary fronts, and connecting orbits to transition fronts between stationary fronts. Conversely, every smooth circle flow can be realized, up to time-preserving topological conjugacy, as the quotient dynamics of such a family for a periodic, locally bistable equation with constant diffusion and no advection. Realizations with a Cantor set of stationary phases and a connecting orbit in each complementary interval illustrate the richness of front dynamics in these media. We also obtain first-order phase-velocity expansions in both period limits, quantitative propagation laws near zero frozen speed, and global exponential orbital stability of propagating pulsating fronts.

comments
51 pages, 6 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2610.34228 ↗

We consider the local discrepancy for the number of visits of the orbit of $0$ under a mixed-radix odometer to intervals near the origin. Both the length of the orbit and the endpoint of the visited interval are chosen independently and uniformly at random. Under a Feller-type condition and an explicit condition ensuring that the finite random-time clock can be approximated by a Haar clock on the fluctuation scale, we obtain a temporal central limit theorem for the discrepancy, with an explicit Kolmogorov-Smirnov rate of convergence. This extends and strengthens the fixed-base temporal central limit theorem of Levin and Merzbach to the mixed-radix setting.

comments
36 pages, 1 figure
fields
Dynamical Systems, Number Theory
pdf ↗ page arXiv:2610.34243 ↗

Points within a topological dynamical systems can be separated into transient and recurrent points. Most of the asymptotic properties of the dynamics is borne by the closure of the collection of recurrent points. This article presents a representation scheme for dynamics using the connectivity information in terms of the recurrent set. This representation is functorial and represents certain compositional features of dynamical systems.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.34265 ↗

We establish the first pointwise convergence result for nonconventional ergodic averages modeled along a large class of oscillating sequences, treating, for example, orbits of the form $\big(\lfloor n^d\sin(eπn)\rfloor\big)_{n\in\mathbb{N}}$, $d\in\mathbb{N}$. More specifically, for every probability space $(X,\mathcal{B},μ)$ equipped with an invertible measure-preserving transformation $T\colon X\to X$ and every $f\in L^p_μ(X)$ with $p\in(1,\infty]$, we prove that the limit \[ \lim_{N\to\infty}\frac{1}{N}\sum_{n=1}^Nf\big(T^{\lfloor P(n)ψ(αn)\rfloor}x\big)\quad\text{exists for $μ$-a.e. $x\in X$,} \] where $P$ is a non-constant polynomial with real coefficients, $ψ$ is $1$-periodic and real-analytic, and $α$ has irrationality exponent smaller than $1+\sqrt{\operatorname{deg}(P)+1}$. On the one hand, the latter assumption is satisfied by a.e. $α\in\mathbb{R}$, and, on the other hand, our result covers any of the following concrete orbits \[ \lfloor n\cos(eπn)\rfloor\text{,}\quad\lfloor n^{37}\sin(n)\rfloor\text{,}\quad\big\lfloor \sqrt{2}n^{10}e^{\sin(π(\sqrt[5]{7}+1) n)}\big\rfloor\text{,}\quad \big\lfloor \big((\log 2) n^3+e n\big)e^{e^{\cos(π\sqrt{2} n)}}\big\rfloor\text{.} \] The proof employs the so-called one-frequency circle method for estimating exponential sums with phases $\big(ξ\lfloor P(n)ψ(αn)\rfloor\big)_{1\le n\le N}$, but the major arc approximants of our exponential sums do not consist of their direct continuous counterparts. In the major arc regime we decouple the $ψ$-oscillatory part of the phase from the polynomial one, and approximate the exponential sum by $\int_0^1\big(\frac{1}{N}\int_0^Ne^{2πiξP(t)ψ( s)}dt\big)ds$. This represents a novel phenomenon for problems of this kind, and, interestingly, our proof exploits the coefficient-free variational estimates of Radon-type operators.

comments
35 pages, no figures
fields
Dynamical Systems, Number Theory
pdf ↗ page arXiv:2610.34301 ↗

We study the maximal Lyapunov exponent of random products of positive matrices, and prove that it can be calculated to arbitrary precision with arithmetic work polynomial in the number of requested digits. In nondegenerate settings, the complexity of our method depends on the intrinsic complexity of the dynamics—which we characterize—and not on the Euclidean dimension of the ambient space in which the dynamics live. As numerical applications, we determine the Hausdorff dimension of random intersections of Sierpiński gaskets, and Viswanath's constant—the growth rate of the random Fibonacci sequence. We first establish a general inequality for nonnegative matrix families showing that, if a signed measure with finite support is sufficiently close to being stationary, then it predicts the Lyapunov exponent accurately. This framework also encompasses Pollicott's Fredholm determinant approximation. We then show that, just like drawing a constellation by picking bright stars, one can construct a sequence of signed measures approximating stationarity by picking informative orbits of the projective dynamics. Furthermore, we prove that our construction uses an asymptotically optimal number of atoms, which is governed by an intrinsic quantity we call constellation dimension.

comments
58 pages, no figures. Visualization of the method: https://constellations-for-lyapunov-exponents-visualizer.nimaalibabaei.workers.dev/
fields
Dynamical Systems, Numerical Analysis
pdf ↗ page arXiv:2610.34306 ↗

Predicting dynamics across bifurcations by extrapolating trained models is crucial in diverse fields of physics. Generalized synchronization provides a framework for understanding dynamical reconstruction by neural networks, especially in the context of reservoir computing. Building on this framework, we derive a formula combining pretrained readouts to reconstruct unseen chaotic dynamics. Using classical Lagrange interpolation theory, we derive rigorous bounds on readout errors and conjugacy residuals. Numerical examples demonstrate accurate prediction of chaotic dynamics across bifurcations.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.34471 ↗

We introduce Carathéodory-Pesin structures for non-singular foliations on Riemannian manifolds and define a new notion of entropy for such foliations. Under dynamical and geometric assumptions on the corresponding holonomy pseudogroups, we establish a variational description of this new concept which relates it to the local metric entropy of measures on transversals and to the entropy of harmonic measures on the manifold.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.34557 ↗

In this paper we study the robustness of invariant Lagrangian graphs for dissipative twist maps on $\mathbb T^d\times\mathbb R^d$ in the $C^r$ category, for any $r\ge 1$, and show their persistence as invariant global attractors under quantitative sharp conditions involving both the size of dissipation parameter and the perturbation at stake. Note that when $d>1$ the geometric Lagrangian property of the invariant manifold may be destroyed, so that the graph may persist but fail to be Lagrangian. In general, additional dynamical requirements on the twist maps come into play if we intend to preserve also the Lagrangian property. In this line, we first study their persistence for general perturbations, then we restrict to the class of exact conformally symplectic twist maps and provide quantitative sharp conditions for the persistence of invariant exact Lagrangian graphs, without assuming any condition on the tangential dynamics of the manifold. The persistence result relies on a combination of a suitable multidimensional Herman–Mather formula proved in this setting and contraction estimates that provide sharp bounds on the $C^1$-norm of the perturbation to get a unique, globally attracting $C^r$ graph. In dimension $d=1$, by further assuming that that the circle map induced by the graph has irrational rotation number, we prove that every $C^1$ invariant graph of a $C^k$ map is $C^k$ for $k=2,3,\ldots,\infty$. Analytic maps with Lipschitz, non-$C^1$ invariant graphs at every prescribed irrational rotation number show that this initial regularity assumption is essential.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.35068 ↗

We show that logarithmic observables of form $φ(x)=\log(|x-b|)$ on the doubling map $T$ have exponential large deviations with respect to the invariant measure if $b$ is preperiodic but not periodic with respect to $T$ giving a counterpart to the known result of strictly stretched exponential large deviations in the case that $b$ is periodic. These results are established by showing that the topological pressure function developed for unbounded observables is differentiable at $0$.

comments
27 pages, comments welcome
fields
Dynamical Systems
pdf ↗ page arXiv:2610.35221 ↗

Floer proved that, under a sufficiently small $C^0$ perturbation, a normally hyperbolic invariant manifold gives rise to a nearby invariant set whose cohomology ring contains a subring isomorphic to that of the original manifold. Using topological conditions, expressed in terms of the so-called covering relations, we generalize this theorem to a non-perturbative context. Our result does not require the existence of an invariant manifold before perturbation, nor does it require the original map to be smooth or invertible. For the proof, we develop an additional structure on the Conley index for maps on vector bundles.

comments
28 pages, 2 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2610.35258 ↗

Tropical forests are undergoing deep changes caused by human activities, which have repercussions on the habitats of wild animal, particularly mammals. As mammals serve as a main source of blood meals for forest mosquitoes, their decline may affect the mosquitoes, as do changes in their habitats and abiotic conditions, such as rainfall, temperature, etc. Finally, along with humans come new species of mosquitoes-more generalist and more anthropophilic-that adapt to these new conditions and, moreover, serve as vectors for re-emerging diseases against which local populations have no more immunity. In this work, we derive a deterministic model which includes the effects of anthropisation, two species of mosquito that interact with one another (one is a generalist, whilst the other is sedentary and lives in the forest), and blood feeding preferences between multiple blood sources. We consider two socio-ecological areas, corresponding to a domestic area (for instance, a village), and a wild area (for instance, a tropical forest). A comprehensive analysis of the system is carried out using classical theory and monotone systems theory. We analyse the efficiency of individual protective measures, such as mosquito nets and repellents, against the domestic mosquito species. We investigate the risk of invasion of the wild area by a generalist mosquito species. We show that habitat anthropisation and high interspecific competition facilitate the invasion. When the mathematical system converges towards a periodic cycle, we provide numerical estimates for the periodic invasion threshold. Using a global sensitivity analysis, we show that the model is sensitive to the level of anthropisation, the adaptability of the invasive species to the forest area, and its fitness. The more efficient way to control the invasion is, therefore, to limit, as much as possible, the forest anthropisation.

comments
43 pages, 16 figures, 6 tables
fields
Dynamical Systems
pdf ↗ page arXiv:2610.35435 ↗

In this work we present a formal renormalization-group (RG) calculation for the weakly coupled four-dimensional elliptic Anderson model. Under a scale-independent bare-coupling convention, and with the normalization $λ_{\varepsilon}$, the bubble-chain resummation yields the geometric series $\mathcal{X}_{\mathrm{formal}}(λ)$, with a formal pole at $λ_c$. We stress that this pole is a feature of the formal bare bubble series. The argument combines Bogoliubov-Parasiuk-Hepp-Zimmermann (BPHZ) renormalization, a Hepp-sector motivated restriction to the bubble-chain subclass for explicit resummation, and an explicit summation of the resulting geometric series. Numerically, we illustrate the analytic building blocks of the formal expansion: the massive Green function, the bubble integral, the geometric resummation, the extraction of the formal pole from synthetic noisy data, a kurtosis diagnostic, and a phase diagram of the formal variance. These computations visualize the deterministic kernels and the formal resummation used above. Using spectral methods and nonlinear least-squares fitting, we verify the short-distance asymptotic behaviour of the massive Green function for $G=(1-Δ)^{-1}δ_0$, reproduce the logarithmic divergence of the bubble integral in four dimensions, compute the formal effective variance $\mathcal{X}_{\mathrm{formal}}(λ)$ arising from the bubble-chain resummation, locate the formal pole at $λ_c$, and draw a schematic phase diagram of the formal variance in the $(λ,\log\varepsilon)$ plane. The kurtosis diagnostic uses a synthetic proxy for the non-Gaussian regime; the sharp change is imposed by construction. Nonlinear fitting of synthetic data recovers the formal pole within the statistical uncertainty of the synthetic noise. Our results illustrate the analytic formulas and the fitting procedure.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.35459 ↗

We consider Hölder continuous cocycles over a hyperbolic dynamical system with values in the group of diffeomorphisms of a compact manifold. We focus on establishing conjugacy between two cocycles from conjugacy of their periodic data. We obtain such a result under bunching, or domination, assumption on the cocycles and a mild regularity assumption in $C^0$ topology on the maps conjugating the periodic data. We also obtain conjugacy to a constant cocycle assuming boundedness in $C^1$ or pre-compactness in $C^0$ for the constant cocycle and the conjugating maps.

comments
18 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2610.35460 ↗

This paper introduces a graph convolutional reinforcement learning framework for the finite-time stabilization of chaotic dynamics in a physical Chua circuit. The circuit is modeled directly in terms of capacitor voltages, inductor current, and physical component parameters. This preserves the connection between the mathematical model and the underlying electrical system. A unified, flexible terminal sliding-mode controller is developed to achieve stabilization within a finite time in the presence of uncertainties in the lumped model, external disturbances, and bounded control inputs. The controller incorporates state-dependent nonlinear exponents to provide flexible convergence characteristics while avoiding singular terms near equilibrium. To minimize dependence on manual controller tuning, the admissible controller parameters are optimized using an actor-critic reinforcement learning scheme with a graph convolutional network that leverages the circuit dynamics' coupling structure. The learned parameters are constrained to the ranges required by the theoretical stability conditions. Numerical experiments demonstrate the rapid suppression of chaotic oscillations and the finite-time convergence of the state and sliding variables while respecting the prescribed input-saturation limits. Compared to a reference control method, the proposed approach reduces the IAE, ISE, ITAE, and ITSE by 56.27\,\%, 56.40\,\%, 61.69\,\%, and 64.70\,\%, respectively. These results suggest that graph-based reinforcement learning can effectively tune parameters while retaining the robustness and analytical structure of the underlying sliding-mode controller.

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

Coherent sets-regions of phase space that resist mixing-organize transport in stochastic dynamical systems and are encoded in the leading singular functions of the stochastic Koopman operator. These are typically computed numerically and globally; a local, analytic theory near a fixed point has been missing, although fixed points and the transitions between them organize the flow. We supply the local theory for a saddle, the transition state through which probability flows between basins. Naively the construction fails-probability escapes along unstable directions, the invariant measure is non-normalizable, the singular functions leave $L^2$, and singular values exceed one. We show that conditioning on non-escape (a Doob's $h$-transform) repairs this; that the required $h$ is the unique stabilizing solution of an algebraic Riccati equation; and that the resulting slow modes decay at the escape rate along the unstable manifold. We obtain these modes in closed form-products of Hermite polynomials in canonical coordinates times the $h$-function-and use their unitary structure to derive a data-driven estimator: canonical correlation analysis on conditioned trajectories. When a single unstable direction dominates, the leading mode is the reaction coordinate, locally recovering the stable manifold and committor of transition-path theory. The construction connects coherent sets to transition-path theory, to the stabilizing Riccati solution of linear control, and to the time-reversed dynamics of generative diffusion models.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.35627 ↗

Networks of delay-coupled neural mass models alternate between synchrony and anti-phase locking as the delay between brain regions increases. The origin of these delay-dependent bands has remained unclear. Here, we show that a single function, the phase interaction function $H$ of an isolated node, predicts where the bands occur and explains why they repeat. For a Wilson–Cowan model with intra-nodal delay $τ$ and inter-nodal delay $ρ$, we compute the limit cycle and phase response, and hence $H$, by harmonic balance. Each band boundary is a zero of $H'$ shifted by the phase lag $Ωρ$, so the bands repeat in $ρ$ with the oscillation period. Simulations of the full delay-differential networks confirm these predictions, from two nodes, where predicted frequencies agree to second order in the coupling strength, to rings, where the theory also identifies coexisting stable twisted states that random initial conditions rarely reach. At weak coupling, the delays at which synchrony gains or loses stability are set by the node dynamics alone, whereas stable anti-phase states require a bipartite network. For a macaque connectome, metastability peaks at the edges of the synchrony bands, where the stability margin of phase-locking vanishes. The reduction is accurate for coupling strengths well below the slowest Floquet exponent of the node, beyond which a phase–amplitude description is needed. More broadly, vanishing phase-locking stability provides a simple route to metastability in delay-coupled oscillator networks and a candidate mechanism for the flexible coordination of brain dynamics.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.35638 ↗

Statistics Theory35

In this work, we develop a quantitative resolvent calculus for sample covariance matrices tailored to applications in high-dimensional statistics. We treat single resolvents, their derivatives, and products of two resolvents with different spectral parameters in the proportional-dimensional regime. Our bounds hold uniformly over compact subsets of $\mathbb C\setminus\mathbb R_{\geq0}$ with approximation errors of order $O_{\mathbb P}(\|Θ_n\|_F/\sqrt n)$ for deterministic test matrices $Θ_n$. These bounds require only uniformly bounded fourth moments and a uniformly bounded population covariance operator norm. Neither regular spectral edges nor convergence of the population spectral distribution is required. As a key technical ingredient, we develop an averaging argument for centered quadratic forms involving one or two leave-one-out resolvents. Applications of our results include precision-matrix shrinkage, prediction risk in ridge regression, and generalized cross-validation. For these problems, we obtain quantitative guarantees for estimation and data-driven parameter selection.

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

We study efficient, adaptive auditing of categorical labels in a fixed dataset, motivated by biodiversity-credit programs in which expert verification of species records is costly and downstream scores (e.g., payment) are more sensitive to errors on certain labels than on others. Our proposed ATLAS framework couples anytime-valid inference with a task-aware adaptive auditing policy. Representing label corrections through a confusion matrix, we prioritize which data points to inspect next based on both label uncertainty and the influence of potential label corrections on the downstream score function. For linear scores such as the mislabel rate, our priority-aware approach certifies the overall label error rate to $\pm 2$ percentage points with 24% and 11% fewer audits than random sampling on biodiversity data from Kenya and a widely used CIFAR-10N benchmark, respectively. For nonlinear scores such as the Hill-Shannon diversity, we exploit a linear-envelope representation that reduces inference to a family of linear-score audits; priority-aware sampling reaches the target precision with 36% fewer audits. When distribution-free guarantees are prohibitively costly, we develop a model-based Bayesian alternative that trades assumption-free validity for substantially fewer audits. Our biodiversity case study highlights a gap between statistical validity and practical feasibility: generic methods such as Serfling's bound and existing confidence-sequence procedures are rigorous but can require prohibitively many expert reviews in practice. Together, these results show task-aware auditing can significantly reduce the number of expert audits needed while providing finite-sample, anytime-valid guarantees.

fields
Statistics Theory
pdf ↗ page arXiv:2610.33262 ↗

We study partial identification of conditional treatment effects with a continuous treatment under unobserved confounding. We target the conditional average potential outcome (CAPO) E[Y_x|z] and the conditional average treatment effect (CATE) between two treatment levels. We assume a bounded outcome and Lipschitz continuity of the response functions and of the propensity scores given the latent confounder, and show that these conditions imply the smooth treatment response and smooth treatment selection conditions of Kim et al. (2018). The combined bound of Kim et al. uses only two reference points on the identified diagonal and is generally loose. Bounding through every diagonal reference point instead gives explicit bounds whose average is the sharp identified set of the CAPO at every treatment, inside or outside the observational support. Capping the difference between the upper and lower bounds gives sharp causal bounds on the CATE. These bounds are informative without monotonicity or overlap assumptions.

fields
Statistics Theory
pdf ↗ page arXiv:2610.33278 ↗

Estimation and inference under boundary constraints arises in many areas of statistics, but the available asymptotic theory remains limited and fragmented relative to the classical case, where the parameter lies in the interior of the parameter space. In this paper we derive a boundary-constrained analogue of the standard asymptotic expansion for a minimiser of a loss function, in which the deviation of the estimator from the population parameter is decomposed over lower-dimensional subspaces determined by the directional derivatives at the minimiser. Using this decomposition we show that the limiting distribution of the estimator is a mixture of point masses and truncated skew-normal distributions, with mixture probabilities determined by the directional derivative conditions. A consequence of this result is that the constrained and unconstrained coordinates do not separate: the presence of parameters on or near the boundary affects the sampling distribution of the unconstrained parameter estimators. We apply the expansion to obtain the asymptotic distribution of the quasi log-likelihood ratio statistic under a range of null hypotheses, and since the resulting mixture is not pivotal in the quasi-likelihood setting, we propose a simulation-based procedure for approximating critical values. The framework unifies and simplifies several existing results. We illustrate the methodology by testing for interactions in exponential family graphical models, where the parameters are subject to compatibility constraints that ensure a joint distribution exists.

comments
72 pages
fields
Statistics Theory, Optimization and Control
pdf ↗ page arXiv:2610.33321 ↗

Bayesian nonparametric regression methods have wide applications in statistics and machine learning, but inference can often be expensive or require approximations. This paper introduces a class of recursive moment function updates which are closed form, interpretable, expedient, and fully quantify Bayesian uncertainty through the martingale posterior. The proposed recursive updates can be used off-the-shelf and encompass challenging scenarios such as nonparametric heteroscedasticity, heavy-tailed or skewed noise, and importantly generalize to the multi-output case with missing outcomes without any significant loss in tractability or speed. We show frequentist consistency under weak assumptions in the aforementioned scenarios, and demonstrate empirically that our proposed method is orders of magnitude faster than competing Bayesian nonparametric approaches, with competitive or even superior prediction and estimation accuracy.

fields
Statistics Theory
pdf ↗ page arXiv:2610.33388 ↗

Synthetic data is an important data source in the AI era. This paper studies the generation of mixed-type tabular synthetic data in federated settings, where two key challenges arise: ensuring distributional fidelity and effectively handling mixed-type data. We propose Federated Integrative Two-Step Synthesis (FITS), a framework for mixed-type tabular data synthesis. At its core is a two-step federated algorithm for estimating conditional cumulative distribution functions (CDFs) using local linear regression. Building on this algorithm, we develop a federated synthesis procedure based on the probability chain rule to ensure distributional fidelity. To handle mixed-type data, FITS introduces a continualization method that lifts discrete variables into a continuous space and recovers their discrete distributions without loss at both the density-function and CDF levels. This transformation provides a unified continuous representation of mixed-type variables, facilitating the application of local linear regression and synthetic data generation. Our theoretical analysis characterizes the conditional density and cumulative distribution functions of the continualized mixed-type variables and establishes the uniform convergence of the resulting federated conditional CDF estimators. Experiments demonstrate that FITS-generated synthetic data improves downstream task performance for all clients, with the benefits depending on how the synthetic data is used.

fields
Statistics Theory
pdf ↗ page arXiv:2610.33403 ↗

Conditional generative models parameterized by triangular transport maps are widely used for conditional sampling, yet theoretical guarantees on the quality of the conditional measures they produce remain scarce. We address this question for minimum divergence estimators of triangular maps. We use MMD-based objectives as a tractable setting in which the gap between joint and conditional errors can be analyzed precisely, and we measure performance through the average conditional estimation error, defined as the squared maximum mean discrepancy (MMD) between the estimated and the true conditionals, averaged over the conditioning variable. We first show that the common practice of minimizing a joint MMD may fail to recover the conditionals: writing the joint and the conditional criteria as quadratic energies of the same conditional mean embedding residual, we prove that, for parametric classes, joint minimizers are generically inconsistent in the misspecified setting. We then analyze an estimator that directly minimizes the conditional criterion through a surrogate loss computable from joint target samples and reference samples. We prove a non-asymptotic error bound that decomposes the average conditional estimation error into approximation, estimation, and reference sampling errors, with fast rates independent of the ambient dimension in the parametric setting. Finally, for joint MMDs built from concentrating Gaussian kernels on the conditioning variable, we show that the joint criterion approximates a density-reweighted version of the conditional one, and we derive an error bound for the joint minimizer whose rate suffers from a curse of dimensionality in the conditioning variable. Our results suggest that training criteria for conditional generative models should target the conditional rather than the joint error, a principle that extends to other divergences and to dynamic transport.

comments
69 pages, 1 figure
fields
Statistics Theory
pdf ↗ page arXiv:2610.33610 ↗

Pooling many channels with a shared unknown input can leave persistent bias when each channel retains a fixed number of observations and its own incidental parameters. For heterogeneous smooth channel manifolds under isotropic noise, the second-order bias is an information-weighted regression of mean curvature on normal input velocity. A feasible correction gives centred Gaussian inference as the noise level $σ$ decreases with $Rσ^6\to0$, compared with $Rσ^2\to0$ without correction. We extend the stochastic expansion and studentization to deterministic channel arrays with densely correlated Gaussian errors of bounded covariance operator norm. General marginal covariance adds a forcing term that can bias even flat channels, while cross-channel covariance changes uncertainty. For Gaussian errors with a separable frame-by-channel covariance whose channel factor is autoregressive in a known ordering, an independent zero-mean calibration field yields a covariance estimator accurate enough for corrected inference. Boundary accumulation and fixed working population models introduce distinct bias terms; rational-multiplier and zero-count arguments connect identification to frame-integrated compartment models. Simulations test both oracle and estimated-covariance inference, including independent PET replications. Moderate-noise undercoverage, optimization ambiguity and the need to validate reconstruction covariance limit practical inference. The real-data example supports sensitivity analysis, not clinically calibrated intervals.

comments
25 pages, 5 tables. Supplementary proofs and computational details are available from the author on request
fields
Statistics Theory
pdf ↗ page arXiv:2610.33642 ↗

Very recently, Problem 2.5 stated by Mesiar and Sarkoci in \cite{MeSa} and originally formulated by Durante was answered in the negative by Šeliga \cite{Sel}. The author showed that the closed convex hull of all bivariate associative copulas is a proper subset of the family of all Schur concave copulas, and even computed the exact uniform distance of his counterexamples to the closed convex hull (so that the Hausdorff distance between the two families is at least $\frac32-\sqrt{2}$). Using the fact that every bivariate associative copula can be represented as a (finite or countably infinite) ordinal sum of Archimedean copulas and the minimum copula $M$, and working with the Markov kernels of Archimedean copulas, we first give an alternative, simple proof of the strict inclusion. We do so by showing that convex combinations of associative copulas can assign only very little mass to \new{staircase-shaped unions of small squares covering} certain line segments parallel to the main diagonal, a result we later extend to so-called chains and staircases. Building on the first observation, we then go one step further and show that, from a topological perspective, the closed convex hull of all associative copulas is a very small subset of the Schur concave family, namely a so-called $Z$-set, and that the family of associative copulas is, in turn, a $Z$-set in its closed convex hull.

fields
Statistics Theory, Functional Analysis
pdf ↗ page arXiv:2610.33646 ↗

Prediction is one of the most important research topics in statistics and machine learning. Moreover, in the domain of streaming data analysis, real-time prediction has become a rapidly growing research field in recent years, owing to the abundance of streaming data. In many fields of scientific research, such as biomedical research, weather forecasting, and traffic management, improving real-time prediction of streaming data is crucial in general. However, the complicated features of streaming data, such as large-scale and high-velocity, impose both theoretical and computational challenges to the development and evaluation of real-time prediction in this field, especially when the investigator has multiple models at hand. To overcome these challenges, we propose a novel Renewable Model Averaging method through Quadratic approximation (ReMAQ) for generalized linear model (GLM) for streaming data. By approximating the model averaging procedure for GLMs (which is typically a convex optimization problem) with a quadratic optimization formulation, ReMAQ allows us to update the model averaging prediction sequentially when a new batch of data arrives, without accessing the entire historical data. Moreover, ReMAQ is also computationally efficient as one only needs to consider a quadratic programming problem in each steps of updating. Under certain regular conditions, we also show that the proposed ReMAQ weight is asymptotically equivalent to that by the oracle model averaging based on the inaccessible full data, the asymptotic optimality of ReMAQ is then established accordingly. The proposed method is also assessed by simulation studies. We apply our proposed ReMAQ in the study of the Airline On-Time Performance Dataset and the results demonstrate the superiority our method in practical situations.

comments
26 Pages, 1 figure
fields
Statistics Theory
pdf ↗ page arXiv:2610.33665 ↗

Interpretability in Exploratory Factor Analysis is characterized by the fundamental trade-off between structural sparseness and explained common variance. Lacking formal evaluation metrics, researchers frequently sacrifice parsimony in the pattern matrix to maximize the model's explanatory coverage. For this reason, we extend Hoyer's sparseness ratio into a flexible \texorpdfstring{$\mathcal{L}_{p_1}/\mathcal{L}_{p_2}$}{Lp1/Lp2} formulation to introduce the Interpretability Index $I$, defined as the geometric mean of explained common variance and the generalized sparseness index. We analyze the asymptotic behavior of $I$ as norm orders increase, establishing that raising $p_2$ alone yields a stable limit, whereas increasing $p_1$ and $p_2$ jointly causes the measure to saturate. The canonical choice $(p_1,p_2)=(2,4)$ balances numerical stability with a smooth, tractable objective. We finally demonstrate, on five benchmark datasets from the statistical literature, how the Interpretability Index provides a systematic criterion for selecting the optimal parametrization of the latent space according to the user's analytical goals.

fields
Statistics Theory
pdf ↗ page arXiv:2610.33670 ↗

Many tomography tasks require only a low-dimensional function of the state. We study local pure-state tomography under projective-fidelity access when a parametric model, a credible center, and a differentiable downstream task are known before acquisition. The pullback Fubini–Study metric and the task metric define coordinate-invariant generalized eigendirections, which we realize as a fixed library of geodesic fidelity probes. We prove two optimality results: the probe aligned with a task coordinate is its unique variance-minimizing location up to orientation, and, when prior and measurement information are diagonal in this basis, a diminishing-return greedy rule exactly minimizes the integer-budget local task-variance surrogate over the spectral library. Under common per-shot information and the stated large-budget condition, the absolute and relative gaps to arbitrary probe directions are respectively \(O(B^{-3})\) and \(O(B^{-2})\). A closed-form local estimator is followed by a task-metric localization projection that cannot increase quadratic task loss when localization holds. In six-qubit numerical experiments, the Schmidt-spectrum design activates only one or two settings and has lower mean task error than the post hoc best adaptive results across all tested dimensions and copy budgets. For full-state tomography, it likewise has lower mean infidelity throughout the tested local regime. The fixed batch uses no feedback loops and far fewer settings; under the illustrative latency model, its acquisition cost is roughly three to four orders of magnitude lower than that of the adaptive methods.

comments
26 pages, 2 figures
fields
Statistics Theory
pdf ↗ page arXiv:2610.33723 ↗

Kerman's approximation to the median of the Beta$(α,β)$ distribution is the ratio $g(α)/(g(α) + g(β))$ with $g(x) = x - 1/3$, using the first two terms of the asymptotic expansion of the median of the standard gamma distribution. We extend this elegant ratio form to the one-parameter family with $g(x) = x - 1/3 + c_1/x$, in which $c_1 = 0$ gives Kerman's. For large shape parameters along any ray $β= rα$ with $r > 1$, the resulting approximation is eventually a lower bound on the median if $c_1 \le 8/405$ and an upper bound if $c_1 \ge 1/45$. We recommend $c_1 = 1/36$ for its simplicity: it makes $g(x) = (x - 1/6)^2/x$ a perfect square over $x$, and it is within 1% of the minimax value of $c_1$ for $α, β\ge 1$ under several error measures, while the theoretically distinguished values $8/405$ and $1/45$ are less accurate. The approximation is then $((α- 1/6)^2/α)/((α- 1/6)^2/α+ (β- 1/6)^2/β)$. Its relative error lies between -0.171% and +0.212% for all $1 \le α\le β$, compared with up to -3.8% for Kerman's. It is more accurate than Kerman's approximation wherever the latter is defined, with relative error never more than 13/32 of Kerman's, the ratio approached asymptotically. The same $g(α)$ is a useful approximation to the gamma distribution median, overestimating it by at most 0.212% for shape parameter $α\ge 1$.

comments
12 pages, 3 figures. A Python notebook (and its source module) that reproduces the figures and numbers is in the ancillary files
fields
Statistics Theory
pdf ↗ page arXiv:2610.33859 ↗

We establish asymptotic results for profile score statistics under sequences of parameters that may tend to the boundary of the parameter set. When the likelihood is profiled over a set with boundary points, the distribution of the statistic can depend, even asymptotically, on a distance to the boundary that cannot be estimated consistently. We address this in three ways. First, we give conditions under which the nuisance score has a root on an extended parameter set, and the profile score statistic formed with that root converges to a chi-squared distribution. Second, we show that the efficient score statistic converges to a chi-squared distribution under a separate condition that can hold even for estimators constrained to the original set. Both lead to confidence regions with asymptotically correct coverage probability, uniformly on sets that may contain boundary points, and the conditions allow the scores for the interest and nuisance parameters to grow at different rates or become asymptotically collinear. Third, we quantify the coverage error of applying the profile score statistic without an extended set. We approximate the distribution of the statistic and bound the error by a quantity that decays like a normal tail in the standardized distance to the boundary. The approximation also gives one-sided tests with least favorable critical values whose asymptotic size is at most the nominal level. We illustrate the results in a zero-inflated Poisson model and a one-way random effects model.

comments
46 pages, 2 figures
fields
Statistics Theory
pdf ↗ page arXiv:2610.33912 ↗

Optimal designs for regression with asymmetric errors build on the second-order least squares estimator (SLSE) of Wang and Leblanc (2008), whose gain over ordinary least squares (OLS) comes from the error skewness. With i.i.d. errors the optimally weighted SLSE solves the same estimating equation as the degree-two Polynomial Maximization Method (PMM), a family whose degree-$S$ location estimator has asymptotic variance $g_S\le1$ times that of the sample mean. We derive optimal designs for this family when the errors are independent with constant variance but have standardised cumulants of order three and higher that vary with the regressor (cumulant heteroscedasticity). For a known reduction field $g_S(x)$, the $g_S$-weighted information matrix $M_{g_S}$ obeys the Kiefer-Wolfowitz equivalence theorem. A constant field leaves the OLS-optimal design unchanged; a non-constant field can change it but need not. For symmetric errors with varying kurtosis, the PMM$_2$ and conditional-SLSE designs cannot depart from the OLS-optimal one, whereas a degree-three design can. A stratify-and-pool PMM$_S$ estimator attains $N\mathrm{Cov}(\hatθ)\toσ^2M_{g_S}^{-1}$ at every degree as all strata grow; its per-stratum reduction is below one only for symmetric errors with the symmetry imposed. For a quadratic model on $[0,1]$ with symmetric Beta errors of unit variance and dose-varying shape, the third-order design for the known field has $A$-efficiency $1.047$ relative to the OLS-optimal design, and $1.001$ under the $D$-criterion. A two-stage procedure that estimates the field from a one-third pilot builds designs of $A$-efficiency $1.014$-$1.020$ at $N=600$-$2400$; its realised mean-squared-error ratio against the OLS-optimal design ranges from $0.89$ (a loss) to $1.08$.

comments
36 pages, 4 figures, 7 tables. Companion to arXiv:2606.11421 (second-order least squares as the degree-two polynomial maximization method)
fields
Statistics Theory
pdf ↗ page arXiv:2610.33921 ↗

Causal identification under unobserved confounding typically relies on additional structure, such as a valid instrument or proxy variables. We show that heavy tailed variables offer an alternative route to identification by revealing treatment variation for which confounding becomes asymptotically negligible. Our key assumption is extreme propagation: when an unobserved confounder takes an extreme value, some observed variable in the system (called a safeguard) will become extreme with large probability. This way, selecting extreme treatment observations while safeguards remain non-extreme makes confounding asymptotically negligible relative to the treatment. We call this certification. We derive graphical conditions specifying which latent confounders must be monitored by safeguards and distributional conditions ensuring effective certification. The framework includes valid-instrument and double-proxy structures as special cases, as well as confounded instruments that are invalid in most approaches that do not exploit heavy tails. Geometrically, certification isolates the extremal ray whose slope equals the causal effect. This connects causal identification with multivariate extreme-value geometry and motivates a family of novel simple estimators. Simulations demonstrate performance gains under nonlinear confounding and heavy tails, while revealing limitations in light-tailed regimes (where cancellation can conceal extreme confounding from the safeguards). We validate our methodology in simulation studies and by recovering the ground-truth flow in a river discharge application.

fields
Statistics Theory
pdf ↗ page arXiv:2610.34002 ↗

We study the minimax regret rate for episodic kernel-based reinforcement learning, where the expected reward and transition density belong to a Sobolev reproducing kernel Hilbert space, with continuous state and action spaces, and adversarial initial states. For Sobolev smoothness parameter $ν>0$, state dimension $d_S$, and action dimension $d_A$, we prove that the minimax expected regret over $T$ episodes is $\widetildeΘ(T^{\max\{e_A,e_B\}})$, where $e_A=\frac{ν+d_A}{2ν+d_A}$, $e_B=\frac{ν+d_A+3d_S/2}{2ν+d_A+2d_S}$ with the other model parameters fixed. The two exponents reflect the distinct difficulties of action selection and learning across states. We introduce Sobolev Optimal Value Iteration (SOVI), which attains this rate from observed rewards and transitions. For fixed smoothness and reference-kernel lengthscale, its regret bound has a prefactor polynomial in the state-action dimension $d=d_S+d_A$, horizon $H$, transition and reward RKHS norm bounds $u,B_r$, and kernel norm-comparison factor $Λ$, up to logarithmic factors. The algorithm separates initial action selection from continuation-value estimation and combines local polynomial approximation with the shared RKHS structure of the approximation errors. Our matching upper and lower bounds determine the optimal dependence on the number of episodes for Sobolev kernel-based reinforcement learning. Thus, we partially address the open problem in Vakili(2024) under the condition of the Sobolev kernel setup.

fields
Statistics Theory
pdf ↗ page arXiv:2610.34045 ↗

The estimation of the extreme value index (EVI) plays a central role in extreme value theory (EVT), particularly in the statistical modelling of heavy-tailed phenomena. Classical semi-parametric estimators of the EVI are known to suffer from substantial bias, especially for moderate sample sizes and for common choices of the number of upper order statistics. In recent years, several reduced-bias (RB) methodologies have been proposed in order to improve finite-sample performance while preserving asymptotic efficiency. In this paper, we present new classes of nonlinear RB EVI-estimators based on power mean-type and Lehmer mean-type functionals of upper log-excesses. Under a unified higher-order framework, asymptotic representations are derived and bias and variance properties are compared relative to other RB EVI classes introduced in the literature. An asymptotic comparison at optimal levels is conducted to identify regions of the space parameter where the proposed estimators are more efficient. A comprehensive Monte Carlo simulation study assesses the finite sample behaviour of the new estimators for several heavy tailed models. The results show that nonlinear reduced-bias estimators can provide improvements in bias and root mean squared error, although their relative performance depends on the underlying distribution and the choice of the tuning parameter. An application to hydrological data illustrates their practical use and the importance of threshold selection in EVI estimation.

comments
33 pages, 13 figures and 6 tables
fields
Statistics Theory
pdf ↗ page arXiv:2610.34308 ↗

For the estimation of a normal mean in $\mathbb{R}^m$ under quadratic loss, Brown (1971) proved that a generalized Bayes estimator $δ_F$ is admissible if and only if a diffusion attached to the marginal $f^*$ of the prior $F$ is recurrent, and gave two radial tests: a sphere-average test for recurrence and a ray test for transience. He observed that both tests can be silent. We read his theory as the potential theory of the weighted Euclidean space $(\mathbb{R}^m,f^*\,dx)$ and ask what the modern theory of recurrence on weighted manifolds adds inside the zone where neither test applies. Three results. (A) If $f^*\,dx$ is doubling and supports a scale-invariant Poincaré inequality, the sphere test is already complete: recurrence, Brown's sphere test and the ball-volume test are equivalent, so geometric criteria can add decidable cases only on the inadmissible side. (B) They do add one. An explicit prior on $\mathbb{R}^3$ whose marginal is small along a lattice of circles at dyadic scales with spacing equal to the square root of the scale, is doubling and Poincaré, silences both of Brown's tests, and is transient by the ball-volume test; its generalized Bayes estimator is inadmissible. (C) Outside the doubling-Poincaré class the zone is two-sided: the same circles placed on one surface per scale give an admissible estimator, decided by a flux bound along a non-spherical exhaustion, and a logarithmic product prior gives an inadmissible one, decided by product heat kernels. A comparison lemma shows that any positive weight with Lipschitz logarithm is, up to constants, the marginal of a prior, so that explicit weights may be used throughout.

comments
19 pages, 8 figures
fields
Statistics Theory, Differential Geometry, Probability
pdf ↗ page arXiv:2610.34309 ↗

In longitudinal studies, repeated treatments may be followed by different sequences of mediators and time-varying covariates. We develop semiparametric inference for path-specific effects in this setting, allowing the number, type, and ordering of intermediate variables to vary across treatment occasions. Under consistency, positivity, edge consistency, and the cross-world restrictions of a nonparametric structural equation model with independent errors, path-specific means are identified by the edge g-formula. We derive two parameterizations of the efficient influence function of the identifying functional. The first follows the observed-data factorization and uses conditional intermediate-variable densities. The second uses sequential regressions to replace the corresponding integrations and Bayes' rule to express density ratios through treatment-history regressions, thereby avoiding direct estimation of intermediate-variable densities. Each yields a one-step estimator that permits flexible nuisance estimation. We establish product-rate conditions for asymptotic linearity and semiparametric efficiency. The density-based estimator has blockwise multiple robustness, generalizing triply robust estimation, while the regression-based estimator has sequential multiple robustness. We further develop a sensitivity analysis for selected violations of cross-world independence assumptions used to identify these effects. Simulations examine finite-sample performance and robustness to model misspecifications. An application to the Framingham Heart Study examines sustained-smoking effects on systolic blood pressure along pathways through repeated body mass index measurements. The proposed methods are implemented in the R package flexPaths on Gihub at xxou/flexPaths.

fields
Statistics Theory
pdf ↗ page arXiv:2610.34349 ↗

We study maximum likelihood estimation in the $β$-model for random hypergraphs, in which a group of vertices succeeds with a probability that depends on the sum of its members' parameters. The data are independent binary outcomes of experiments on groups of vertices, tested according to an arbitrary, possibly incomplete design. Suppose that every tested group has $k$ vertices and success probability in $[ε,1-ε]$. For complete designs in which every group is tested at least $r$ times, a unique maximum likelihood estimator (MLE) exists with high probability if $r\geq C_kε^{-1}\log n/n^{k-1}$, and for $m$ experiments on uniformly random groups, it suffices that $m\geq C_kε^{-1}n\log n$, where $C_k$ depends only on $k$. Both conditions are linear in $ε^{-1}$ and, for fixed $k$, cannot be improved in general beyond the constant; they follow from finite-sample bounds for arbitrary designs. We bound the mean squared error of the MLE over a parameter box by the smallest eigenvalue of the correlation matrix of the design, and show that the rate is minimax optimal for balanced complete designs. Among $k$-uniform designs with a given number of experiments, designs in which every pair of vertices takes part together in the same number of experiments maximize this eigenvalue, and uniform random designs nearly do so with high probability. Finally, the design matrix of a uniform random design has full column rank with high probability if $m\geq\max\{n,c(n/k)\log n\}$ for fixed $c>2$ and $k=o(n/\log n)$, or $m\geq n$ when $k\geq(1+ξ)\log n$. For fixed $k$, the threshold $(n/k)\log n$ is sharp, and above it rank deficiency is asymptotically as likely as some vertex taking part in no experiment.

comments
54 pages, 7 figures; based in part on the PhD thesis of Yiliu Wang, with substantial subsequent theoretical developments
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2610.34443 ↗

Two important indicators of climate change are the decline in Arctic sea ice area and the increase in average temperatures globally. Both sea ice and temperature exhibit seasonal patterns, making circular regression a natural approach for their analysis. In this paper, we construct computationally tractable Nadaraya-Watson type kernel regression estimators on the unit circle, using rate-optimal kernel density estimators. We introduce a leave-one-out cross-validation procedure for the data-driven selection of the smoothness parameter and evaluate the performance of the proposed estimators through a simulation study covering 48 scenarios, including comparisons with existing local polynomial estimators. We then apply our methodology to historical Arctic sea ice area data and daily temperature observations in Stockholm. The fitted regression functions and their derivatives or finite differences allow us to investigate changes in both the levels and seasonal dynamics of these environmental indicators. In particular, we observe a decline in fitted sea ice area and substantial changes in its seasonal rates of growth and retreat, together with higher fitted temperatures across most of the year in Stockholm during the more recent period in comparison to historical data.

fields
Statistics Theory
pdf ↗ page arXiv:2610.34476 ↗

Broad classes of deep generative models (DGMs) operate by learning to map a simple source distribution, such as a standard Gaussian, to a complex high-dimensional target distribution. Despite their success, DGMs often empirically struggle to accurately represent distributions with heavy tails or well-separated modes. In this work, we show that these difficulties reflect intrinsic properties of the underlying transport problem rather than particular neural network architectures or training procedures. We establish quantitative lower bounds on the gradients and Jacobians of pushforward mappings that transport log-concave source distributions to such targets. For heavy-tailed target distributions, the required gradient magnitude grows as the target develops increasingly large moments. For multimodal target distributions, the low-probability regions between well-separated modes similarly force large gradients in the transport map. We discuss how such large derivatives relate to trade-offs between expressivity and numerical stability. Our results hold under substantially weaker regularity conditions than previous analyses and remain stable under perturbations of the target distribution. Finally, we show that these obstructions can be mitigated when the goal is approximation of a given density rather than generative modeling. Specifically, we propose simple classes of bijective reparametrizations that can alleviate the difficult geometric structure and reduce the gradient burden placed on the learned generative map. Numerical experiments support our theoretical analysis.

comments
45 pages, 9 figures
fields
Statistics Theory
pdf ↗ page arXiv:2610.34484 ↗

We characterize the high-dimensional convergence of the arithmetic mean from the independence Metropolis-Hastings algorithm initialized at its proposal. Convergence is measured in the worst-case expected absolute error over bounded functions. We prove necessary and sufficient conditions for the mean to converge in relation to the importance weight. We precisely describe the logarithmic cutoff profile of the sharp decay to convergence where the relative entropy between the target and proposal determines the required iteration length. These results make connections between the required iterations of independence Metropolis-Hastings and importance sampling. For concentrating Bayesian posteriors, we illustrate how the required iteration time can be estimated providing concrete guidance for simulations. We justify the logarithmic cutoff analysis by showing a standard cutoff phenomenon is absent and prove that popular convergence diagnostics based on simulation output can validate inaccurate simulations.

fields
Statistics Theory
pdf ↗ page arXiv:2610.34531 ↗

Feature screening in high-dimensional classification is an important problem in statistical learning, particularly in genomics, imaging, and other scientific fields, especially when the number of predictors exceeds the sample size. Zhong et al. (2024) present a semi-distance covariance (SDCov) as a dependence measure between a categorical random variable and a multivariate continuous random vector, presenting it as a promising tool for group-wise feature screening. However, SDCov is defined using the Euclidean norm, and its performance may be affected when the data is derived from heavy-tailed distributions or when outlier observations are present, which is a common phenomenon in high-dimensional data. This study proposes a modification of SDCov by replacing the $L_2$ norm with an $L_1$ norm. This adjustment results in a dependency measure between a categorical variable and a multivariate continuous variable that maintains the independence-characterization property of the original definition. Additionally, it serves as a robust and interpretable measure, particularly in the presence of outliers in the data. We establish the fundamental theoretical properties of the proposed measure and introduce a U-statistics-based estimator along with JEL-based inference for the measure. Additionally, we have introduced a test for independence based on the proposed measure. An extensive Monte Carlo simulation is performed to evaluate the effectiveness of the proposed measure in comparison to existing measures in the literature. The proposed measure is applied in feature screening, as illustrated with the ADNI Alzheimer's disease dataset and the Iris dataset. The data analysis shows the proposed measure's effectiveness in identifying variables that facilitate strong class separation of the respective response variables.

fields
Statistics Theory
pdf ↗ page arXiv:2610.34932 ↗

We consider a bivariate contamination model in which the distribution of a gold standard is known, while the mixing weight and the distribution of the contaminant component are unknown, and we test whether the two coordinates of the unknown component are independent. Classical independence tests are meaningless here, since a mixture of product distributions is not a product distribution. Following the Inversion-Best Matching principle, we invert the model for every candidate weight and compare the inverted distribution of the unknown component with the product of its marginals. The weight is estimated where they are closest in a Cramer-von Mises sense, and the scaled minimal distance is the test statistic. An exact quadratic structure makes the estimator computable without numerical optimisation and yields a transparent asymptotic theory under both hypotheses. The null distribution is calibrated by a multiplier bootstrap. Simulations and applications to gene expression data and spam filtering illustrate the method.

fields
Statistics Theory
pdf ↗ page arXiv:2610.35028 ↗

Recently, Bachoc et al. (2026) proposed an axiomatic approach to fairness for repeated bilateral trade. Their resulting objective is a H\''older mean of seller and buyer utilities with non-positive order $λ$, interpolating between Rawlsian fairness at $λ= -\infty$ and Nash fairness at $λ= 0$. Here we study this family of H\''older means in the complementary setting of orders $λ\in (0,1]$, which constitutes a tradeoff between fairness and efficiency, with the weight of efficiency increasing with $λ$, and where $λ=1$ yields the existing gain from trade criterion, focusing solely on efficiency. We obtain an axiomatic characterization of these H\''older means, relying on a Pigou-Dalton principle of transferring from rich to poor. From an online learning perspective, we show that, contrary to the case $λ\le 0$, the problem is unlearnable in full generality, even under seller's and buyer's valuation independence. We focus on seller's and buyer's valuations with distributions having bounded densities, in which case we obtain matching lower and upper bounds on the cumulative regret, of order $\widetildeΘ(T^{2/3})$ with respect to the time horizon $T$. The upper bounds rely on a reconstruction identity where the expected objective is written as a gain-from-trade term plus a two-dimensional integral involving the seller and buyer distribution and survival functions, and a kernel function. For $0 < λ< 1/2$, the strong singularity of the kernel is addressed by two main ingredients. First, we propose a new zooming algorithm that sequentially rejects or refines layers of the set of prices. Second, we propose a tailored decomposition of the two-dimensional integral, enabling us to truncate it with a controlled impact on the truncation error. For $1/2 \le λ\le 1$, the singularity of the kernel is mild enough, so that the existing scouting bandit algorithm, already proposed for the case $λ=1$, can be extended.

fields
Statistics Theory
pdf ↗ page arXiv:2610.35141 ↗

We study the asymptotic behaviour of the solutions to the unconstrained generalized variational inference problem regularized by an $α$-divergence. Under mild conditions, the minimizer is explicit up to a scalar normalizing constant, and we show that it admits a rescaling under which it converges in $L^1$ to a fixed non-Gaussian law, at a concentration scale around the empirical loss minimizer that departs from the typical $n^{-1/2}$ in the classical Bernstein–von Mises theorem. For $α\in(0,1)$ and $d<2/(1-α)$ the limit is a Student-$t$ distribution and the posterior width shrinks faster than the sampling error of the empirical minimizer. Conversely, for $α>1$ the limiting distribution is a compactly supported Pearson type-II distribution, and the posterior width shrinks more slowly than the sampling error. The KL divergence ($α=1$) is the unique member of the $α$-divergence family whose posterior width matches the sampling scale and whose limit is Gaussian. We discuss the implications of these qualitatively different regimes for the frequentist coverage of credible regions, and a toy example on intercept-only logistic regression illustrates the theoretical claims.

fields
Statistics Theory
pdf ↗ page arXiv:2610.35330 ↗

Accurate forecasting often relies on both past target values and exogenous variables as inputs. In many applications, however, the time series of interest are non-stationary and the relationship between target and inputs evolves over time, requiring forecasters that adapt online. Moreover, inputs affect the target not only through their current values but also through their recent joint dynamics. We address these challenges in three steps. First, to encode the series dynamics, we rely on signatures of the input paths over sliding windows. Motivated by the universality of linear functionals of signatures, we fit a regularized linear regression on these features to capture nonlinear, path-dependent effects. Second, the simplicity of the linear model allows us to update it online as new data arrives, using a Kalman filter to track dynamic effects. Third, to capture dependencies at several time scales, we combine forecasters built on different window lengths through online aggregation. For French national electricity load forecasting, our method outperforms various state-of-the-art approaches. It also remains competitive across several benchmark datasets with exogenous variables.

fields
Statistics Theory
pdf ↗ page arXiv:2610.35367 ↗

We study minimax rates for conditional generative learning under integrated Wasserstein loss, with Hölder continuous conditional laws and an unrestricted covariate distribution. We evaluate unrestricted generators through their conditional output distributions. For expected Wasserstein loss, the minimax rate agrees with the rate under uniform covariates and follows from balancing localization bias against unconditional distribution estimation error. Higher moments of the loss can instead be dominated by unobserved covariate regions, which force an additional risk contribution of order $n^{-1}$, where $n$ is the sample size. An adaptive localization argument gives matching upper bounds. The results cover unrestricted response laws and possibly vanishing Besov densities for $W_1$, and extend to higher Wasserstein orders under uniform response density bounds and integrability conditions. A multiscale lower bound closes the logarithmic gap in unconditional $W_1$ minimax rates in dimension two for both unrestricted distributions and Besov density classes. We also establish minimax rates for conditional Brenier maps under density, integrability, and uniform curvature conditions.

fields
Statistics Theory
pdf ↗ page arXiv:2610.35490 ↗

We study the problem of predictive inference with outcomes missing not at random, when instrumental variables are available. While conformal prediction and weighted conformal prediction provide valid distribution-free inference when outcomes are missing completely at random and missing at random, respectively, inference is generally not possible without additional assumptions when outcomes are missing not at random. In this work, we consider a setting where we remain within the distribution-free framework but instead have access to an instrumental variable (IV). We explore the theoretical possibility of IV predictive inference and establish that it is characterized by a parameter that we refer to as the identification index. We derive an impossibility result for the case where the identification index is not sufficiently large, showing that any distribution-free approach fails to provide informative inference in this case. For the case where the identification index is sufficiently large, we introduce a practical method that achieves informative predictive inference. Our method leverages modern semiparametric efficiency theory which involves deriving the efficient influence function of the identifying functional for sharp IV bounds of the quantiles of the missing outcome, delivering a double robustness property in the coverage guarantee of the proposed framework for IV-based predictive inference. We illustrate the theoretical results and the performance of the proposed procedure through simulations and two real-data applications—FES wages and NHANES III self-reported heights.

fields
Statistics Theory
pdf ↗ page arXiv:2610.35605 ↗

Standard reinforcement learning (RL) algorithms based on Markov Decision Processes (MDPs) are vulnerable to sim-to-real gaps. To address this issue, distributionally robust RL algorithms based on robust MDPs (RMDPs) have been proposed, for ensuring that agents can perform reliably to unpredictable conditions in real-world environments. Despite of the rich literature, \revision{an efficient model-free method is still lacking} for robust RL, particularly for Markovian data, which is more relevant in practical applications. In this work, we take a step towards settling this problem by proposing a sample efficient (asynchronous Q-learning) algorithm for robust RL. In particular, consider a $γ$-discounted infinite-horizon RMDP with state space $\mathcal{S}$ and action space $\mathcal{A}$, where the uncertainty set is specified by the total variation (TV) distance with uncertainty level $σ$. Assuming access to a single trajectory of Markovian samples induced by a behavior policy and the nominal transition kernel, the sample complexity of the proposed Q-learning algorithm --- to achieve an entrywise $\varepsilon$-approximation of the optimal Q-function --- is bounded by $$ \frac{1}{μ_{\mathsf{min}}\varepsilon^2(1-γ)^3\max\{1-γ,σ\}} + \frac{t_{\mathsf{mix}}}{μ_{\mathsf{min}}(1-γ)} $$ up to logarithmic factors. Here, $t_{\mathsf{mix}}$ and $μ_{\mathsf{min}}$ denote the mixing time and the minimum state-action occupancy probability of the sample trajectory, respectively. This result is nearly minimax optimal, with an additional factor of $\frac{1}{1-γ}$. Moreover, it achieves a significant improvement over existing bounds.

fields
Statistics Theory
pdf ↗ page arXiv:2610.35656 ↗

Isotropic Gaussian processes on networks have a covariance that is a function of a distance between locations, but valid constructions have so far required graphs with Euclidean edges and the resistance metric. We introduce a one-parameter family of metrics $d_κ$, $κ\ge0$, on arbitrary compact metric graphs, including those with loops and parallel edges, defined as the variograms of first-order Whittle–Matérn fields, where $κ=0$ corresponds to an intrinsic limiting field. We show that these Whittle–Matérn metrics are invariant under insertion and removal of vertices of degree two, that they decrease monotonically in $κ$, and that they can be evaluated by sparse linear solves. The metric $d_0$ coincides with the resistance metric on graphs with Euclidean edges, and thus extends it to general compact metric graphs without any modification of the graph. For every completely monotone function $r$ and every $κ\ge0$, we show that $r(d_κ)$ is a positive semidefinite function. This yields isotropic Gaussian processes on general compact metric graphs. For $κ>0$ the metric levels off beyond the screening length $κ^{-1}$, which can be used to induce long-range dependence in short-range covariance models, and $κ$ can be estimated from data together with the parameters of $r$. The models are compared on daily traffic maps from the street network of Paris and the motorway network around London. For both, $κ$ is estimated to be positive, $d_κ$ increases the maximised log-likelihood relative to $d_0$ for every covariance function, and it gives the best predictions at randomly held-out locations.

comments
20 pages, 4 figures
fields
Statistics Theory
pdf ↗ page arXiv:2610.35732 ↗

Statistical procedures often control expected loss at a prescribed level while leaving part of their risk budget unused. Building on the e-value representation of risk-controlled decisions and the e-closure principle for multiple testing, we formulate recertification, a general paradigm for improving procedures by exploiting computable slack in their validity certificates. A valid procedure's losses normalized by their risk budgets form a state-indexed e-value collection; conversely, decisions whose normalized losses are bounded by this collection inherit its risk guarantees. Recertification uses distributional structure to quantify slack, enlarge the certifying e-values while preserving validity, and construct less conservative decisions. We develop two applications. For conformal risk control (CRC) with a known loss family, recertification redistributes unused risk budget among the held-out points of each hypothetical augmented sample. The resulting controller is valid under every finite exchangeable law and no more conservative than CRC on any calibration sample. For convex losses on an interval of actions, repeated recertification converges geometrically to an admissible controller. For false discovery rate control with arbitrarily dependent e-values, recertification exploits unused conditional budgets in randomized e-BH. It yields a closed-form randomized procedure whose rejection set contains that of randomized e-BH for every realization of the shared randomization and whose expected number of rejections is maximal subject to the same conditional budget constraints. Recertifying with the larger e-collection of closed e-BH gives a second closed-form procedure whose rejection set contains that of the first. Experiments on CIFAR-100 hierarchical classification and multiple testing simulations demonstrate improved budget utilization, informativeness and power over the baselines.

fields
Statistics Theory
pdf ↗ page arXiv:2610.35821 ↗

While the goal of classical statistical theory is to minimize the variance of unbiased estimators, an additional goal of some recent research is to minimize or constrain other notions of the instability of estimators. In particular, a subset of the authors recently introduced a notion of instability termed "sensitivity", which represents the expected amount that an estimator would change if its inputs were infinitesimally perturbed. In this work, we study the multiobjective problem of minimizing both the variance and sensitivity over unbiased estimators in a given statistical model, and we aim to determine Pareto optimal tradeoffs between these two objectives. Our main results show that the Pareto front for these tradeoffs is precisely determined by endowing the statistical model with the Hellinger-Kantorovich geometry, which interpolates between the Hellinger and Wasserstein geometries that are known to be associated, respectively, with the separate minimization of variance and sensitivity. We also develop a $Z$-estimation technique which constructs estimators that asymptotically achieve Pareto optimal pairs of variance and sensitivity. While computing the Pareto front and constructing the resulting estimators in practice requires solving a continuum of partial differential equations, we fully execute this program in some parametric examples of interest where the analysis is already non-trivial. Our results also shed light on some classical statistical problems, for example by showing that the maximum likelihood estimator achieves the smallest asymptotic sensitivity among all estimators achieving the optimal asymptotic variance.

comments
76 pages, 8 figures; comments welcome
fields
Statistics Theory, Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2610.35858 ↗

Representation Theory20

This paper explores the failure of induction from all proper subgroups to generate the full representation ring, measured by a quotient group $Q_k(G)$. We extend existing results for cyclic groups to all finite abelian groups and calculate this quotient for all finite groups over fields of characteristic 0 by reducing to the abelian case. We briefly discuss extensions to positive characteristics via modular representation theory. Finally, we detail our result for certain well-known families of groups.

comments
17 pages. Comments welcome
fields
Representation Theory
pdf ↗ page arXiv:2610.33086 ↗

Let $G$ be a split connected reductive algebraic group over a non-archimedean local field $F$ of characteristic zero. The stable center conjecture asserts that the subspace of stable elements in the Bernstein center of $G(F)$ is a sub-algebra, and this subring is conjecturally isomorphic to the regular functions on the moduli of semi-simple Langlands parameters. Bezrukavnikov-Kazhdan-Varshavsky suggested an approach towards the stable center conjecture by explicitly constructing elements and proving their stability directly without assuming LLC, and proved the stability of the depth-$r$ projectors. Following the idea, the first author and Tsao-Hsien Chen produced a family of elements in the center which are conjecturally stable using Deligne-Lusztig parameters attached to irreducible representations. This paper proves the stability of the projectors corresponding to strongly regular Deligne-Lusztig parameters in depth-zero, and for all the positive depth elements with some restrictions on the residue characteristic.

comments
21 pages, 1 figure
fields
Representation Theory, Number Theory
pdf ↗ page arXiv:2610.33327 ↗

Given a Coxeter system $(W,S)$ and a subset $I\subset S$. Let $W_I=\langle I\rangle$ be the standard parabolic subgroup of a Coxeter group $W$, and ${}^IW$ be the set of representatives of minimal length in the coset $W_I\backslash W$. We construct a parabolic version of Soergel's standard filtration, and show that, given any Soergel bimodule, each subquotient of its parabolic filtration is a direct sum of grading shifts of $B_x^I\otimes_R R_y$ with $x\in W_I$ and $y\in {}^IW$. By applying the character theorem of Elias and Williamson, we deduce the positivity of coefficients in the expansion of $C_w$ with respect to the hybrid basis $\{C_xT_y:x\in W_I,y\in {}^IW\}$. This generalizes Grojnowski and Haiman's result to any Coxeter group.

comments
14 pages
fields
Representation Theory
pdf ↗ page arXiv:2610.33490 ↗

We classify the representation-finite, tame, and wild contraction algebras arising from 3-fold flopping contractions of isolated cDV singularities with at worst Gorenstein terminal sources. To achieve this, we first determine the representation type of all contracted preprojective algebras of Dynkin types $\mathsf{A}$, $\mathsf{D}$, and $\mathsf{E}$, and then use the representation type invariance under iterated flops and the radical structure of contraction algebras.

comments
53 pages. Comments are welcome
fields
Representation Theory
pdf ↗ page arXiv:2610.33673 ↗

Let $U$ be a support $τ$-tilting module over a finite-dimensional algebra $A$, and let $\mathcal{V}\subseteq\operatorname{Fac}U$ be any torsion class. The exact heart $\mathcal{H}=\operatorname{Fac}U\cap\mathcal{V}^{\perp}$ has an Ext-progenerator $P$. We prove that $\operatorname{Hom}_A(P,-)$ realizes $\mathcal{H}$ as a submodule-closed exact subcategory of $\operatorname{mod}B$, where $B=\text{End}_A(P)$, and preserves minimal syzygies. The global relative $k$-delooping levels are independent of $k\geq1$. Writing $g=\operatorname{glo}\text{-}\operatorname{dell}\mathcal{H}$, we obtain the sharp comparison $g\leq\operatorname{glo}\text{-}\operatorname{dell}B\leq g+1$ and $\operatorname{findim}B^{\mathrm{op}}\leq g+1$. Thus the two global levels are finite simultaneously. For wide hearts the relative levels equal their classical counterparts. We also characterize syzygy finiteness of $B$ by a finite relative syzygy stratum and obtain explicit bounds for both finitistic dimensions. If the heart is Frobenius, it is exactly the category of finitely generated Gorenstein-projective $B$-modules under this realization, and both self-injective dimensions of $B$ are at most one. We also give examples to show the main results.

fields
Representation Theory
pdf ↗ page arXiv:2610.33762 ↗

In this paper we study (the positive half of) the elliptic Hall category, a categorical version of the elliptic Hall algebra. Our main result is a computation of categorical versions of the generators in the coherent realization of the elliptic Hall category, i.e., via coherent sheaves on commuting stacks for $\operatorname{GL}_n\times \mathfrak{gl}_n$: we realize them as Hodge associated graded sheaves of certain twisted equivariant $D$-modules on the groups $\operatorname{GL}_n$.

fields
Representation Theory
pdf ↗ page arXiv:2610.33992 ↗

Let $\Bbbk$ be an algebraically closed field of characteristic different from $2$. We realize the four-dimensional selfinjective algebra $Ω(1)$ as an admissible infinite cyclic orbit algebra of the repetitive Kronecker category. Thus an algebra long stated to be nonstandard is of Euclidean type in the orbit-algebra sense. We also identify a gap in an earlier proof of its nonstandardness and give an independent proof by determining all connected Galois covering sources of $Ω(1)$. Together, these results disprove the implication from Euclidean type to standardness in the equivalence explicitly stated by Bocian–Holm–Skowroński (2004) and Bocian–Skowroński (2005). They also contradict the standardness conclusion of the Proposition in \S2.1 of Skowroński (1989); its main theorem in \S1.5 assumes standardness and is not contradicted by this example.

comments
16 pages
fields
Representation Theory, Category Theory, Rings and Algebras
pdf ↗ page arXiv:2610.34119 ↗

We extend the framework of deep level Deligne-Lusztig varieties to the case of arbitrary residue characteristics $p > 0$. As an application, we provide a construction of a large class of (new) supercuspidal representations for unramified $p$-adic groups with arbitrary residue fields, in a purely geometric way.

comments
26 pages, comments welcome!
fields
Representation Theory
pdf ↗ page arXiv:2610.34326 ↗

We study the behaviour of $τ$-exceptional sequences under passage from a finite-dimensional algebra $Λ$ to a factor algebra $Λ/I$. Assuming that $Λ$ is $τ$-tilting finite and that $I\subseteq \operatorname{rad}Λ$, we construct, for every $r$ less than or equal to the number of simple $Λ$-modules, an injective map from the $τ$-exceptional sequences of length $r$ over $Λ/I$ to those over $Λ$. The construction is recursive and is based on lifting indecomposable $τ$-rigid modules and comparing their associated $τ$-perpendicular categories. At each stage, we construct a right exact functor between the relevant $τ$-perpendicular categories which, after identifying them with module categories, is naturally isomorphic to extension of scalars along a quotient $Γ\toΓ/J$, where $J\subseteq \operatorname{rad}Γ$. These functors send each lifted term to an object in the additive closure of the corresponding original term. Finally, we conjecture connections with known bijections for representations of quivers over local algebras and for Nakayama algebras.

comments
24 pages
fields
Representation Theory
pdf ↗ page arXiv:2610.34398 ↗

In this paper, we study when a stability data on an abelian length category is induced by a stability function. We give an intrinsic characterization of such stability data. For at most six phases, an inducing function exists if and only if every semistable subcategory is wide. An example with seven phases shows that this bound is sharp. For finite phase sets and finite rank, an inducing function exists if and only if an inducing red path exists. We also give a maximal green sequence of length eleven in type $D_4$ that no stability function induces. This disproves the red-path conjecture of Brüstle–Smith–Treffinger.

comments
26 pages
fields
Representation Theory
pdf ↗ page arXiv:2610.34657 ↗

We give a resolution-quiver-theoretic proof of the QF-1 conjecture of Cruz and Marczinzik for higher Auslander Nakayama algebras of positive even global dimension. The proof combines syzygy calculations in Kupisch coordinates, which show that the projective dimensions of quotients of a fixed projective module with cyclic top strictly decrease as their lengths increase, with a torsion-pair argument and Morita's criterion.

comments
14 pages
fields
Representation Theory, Rings and Algebras
pdf ↗ page arXiv:2610.34716 ↗

Using webs, we prove that Kazhdan-Lusztig mu-coefficients for symmetric groups grow at least exponentially with the rank, already for pairs labeled by a three-row rectangle.

comments
44 pages, many figures, comments welcome
fields
Representation Theory, Combinatorics, Quantum Algebra
pdf ↗ page arXiv:2610.34982 ↗

Su and Zhang proved a formula for the decomposition of characters of irreducible finite dimensional modules over Lie superalgebra $\frak q(n)$ as the sum of Euler characters. They gave a combinatorial formula for the coefficients in that decomposition by generalasing of weights and caps diagrams introduced by J. Brundan and C. Ctroppel. In the present paper we give a correct version of their combinatorial formula. Our main technical tool is a family of creation operators.

comments
15 pages
fields
Representation Theory
pdf ↗ page arXiv:2610.35050 ↗

We classify the reduced decompositions of the longest element $w_0$ of the Weyl group of a semisimple Lie algebra $\mathfrak{g}$ for which the corresponding Lusztig quantum root vectors span a quantum tangent space in $U_q(\mathfrak{g})$. We introduce a combinatorial condition on the convex order induced by a reduced decomposition, tangency, and prove that a reduced decomposition gives rise to a quantum tangent space if and only if it is tangent. The proof relies on a description of the coproduct of quantum root vectors in terms of the convex order, and on a projection in the right weak order attached to each positive root. Up to commutation, tangent reduced decompositions are obtained by concatenating the longest minimal coset representatives along a chain of cominuscule parabolic quotients; in particular there are none in types $E_8$, $F_4$ and $G_2$.

comments
Latex file, 42 pages
fields
Representation Theory, Combinatorics, Quantum Algebra
pdf ↗ page arXiv:2610.35091 ↗

Using computational methods, we determine the irreducible $3$- and $5$-modular characters of the symplectic group $\text{Sp}_{10}(2)$ for blocks with non cyclic defect groups, with one ambiguity in the principal $3$-block.

fields
Representation Theory
pdf ↗ page arXiv:2610.35185 ↗

Let $p$ be an odd prime and let $G$ be a non-abelian group of order $p^4$. The classification of groups of order $p^4$ provides a natural setting for studying the structure of their complex group algebras. In this paper, we consider a non-abelian group G of order $p^4$ and determine the primitive central idempotents of the complex group algebra $\mathbb{C}G$. Using these idempotents, we obtain the corresponding decomposition of $\mathbb{C}G$ into simple components and describe the irreducible representations of $G$. The results provide an explicit description of the representation-theoretic structure of the chosen non-abelian group of order $p^4$ and illustrate the role of primitive central idempotents in the Wedderburn decomposition of its complex group algebra.

fields
Representation Theory
pdf ↗ page arXiv:2610.35198 ↗

Unitary representations of the infinite dihedral group arise naturally and play an important role in a wide range of areas including mathematics, physics, and engineering. CMV matrices, introduced by Cantero, Moral, and Velázquez, are five-diagonal unitary matrices that are standard tools in the theory of orthogonal polynomials on the unit circle. It is known that every unitary representation of the infinite dihedral group on a separable Hilbert space admits a discrete direct-sum decomposition into representations arising from the natural factorizations of real CMV matrices and copies of two exceptional one-dimensional irreducible representations. We prove that such a decomposition is unique up to unitary equivalence when the summands arising from real CMV matrices are grouped according to their multiplicities and the spectral measures of the corresponding matrices are mutually singular across distinct multiplicities. Furthermore, we show that the representation associated with each such real CMV matrix $C$ admits a direct integral decomposition into irreducible unitary representations with respect to the push-forward of the restriction of the spectral measure of $C$ to the closed upper half circle. These results make it possible to study the structure of unitary representations of the infinite dihedral group using CMV matrices and the theory of orthogonal polynomials on the unit circle.

fields
Representation Theory, Functional Analysis
pdf ↗ page arXiv:2610.35371 ↗

We give a geometric description of the formal local data of holonomic modules over the first Weyl algebra, the algebra of differential operators in one variable. The exponential part of the associated formal meromorphic connection is encoded by a truncated jet of an affine plane curve at infinity, and the regular part by a regular formal meromorphic connection. We prove that these geometric data uniquely determine the `elementary' blocks in the formal decomposition of holonomic modules. The resulting correspondence is equivariant under automorphisms of the first Weyl algebra, including the Fourier transform.

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

We settle Tam's star-shapedness conjecture for numerical ranges associated with compact adjoint orbits of complex reductive Lie algebras, including its original formulation in terms of the inner product $B_θ$. Let $\mathfrak{g}$ be a complex semisimple Lie algebra, and let $K$ be a connected compact Lie group whose Lie algebra is a compact real form of $\mathfrak{g}$. For any $x\in\mathfrak{g}$ and any complex linear functional $f\in\mathfrak{g}^*$, we prove that $\{ f( \operatorname{Ad} (k) x): k \in K \}$ is star-shaped about zero. In the reductive case, the star center is given by the value of $f$ on the central component of $x$, which coincides with the $B_θ$-pairing of the central components in Tam's original formulation. Our proof is uniform for all complex semisimple Lie algebras. Indeed, using the adjoint Casimir operator, we show that all coordinate functions of the orbit map share a common Laplace eigenvalue; we then use a nodal-hypersurface argument to prove star-shapedness for complex-valued functions in a single eigenspace. The geometric argument relies on a two-sided hypersurface-separation property, which holds whenever the first real cohomology group vanishes. In particular, we do not need simple connectivity or real analyticity. More generally, for finite-dimensional representations of compact connected semisimple Lie groups, we establish star-shapedness whenever the nonfixed component of the orbit vector belongs to a single positive Casimir eigenspace.

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

We prove Shi's conjecture that the number of left cells in the second lowest two-sided cell of the affine Weyl group attached to a simply connected simple complex group $G$ is exactly $|W_0|/2$, where $W_0$ is the corresponding finite Weyl group. The same formula holds for the corresponding extended affine Weyl group. The key step is to show that the reductive centralizer in $G$ of a minimal nilpotent element has identity component with simply connected derived subgroup and admits no nontrivial algebraic central extensions by $\mathbb G_m$. This gives an isomorphism of based rings between the asymptotic ring of the extended cell and a matrix ring over the representation ring of the centralizer, with matrix size equal to the Euler characteristic of the Springer fiber, namely $|W_0|/2$.

comments
16 pages
fields
Representation Theory
pdf ↗ page arXiv:2610.35795 ↗

Group Theory16

We use the linear cycle set cohomology in order to compute extensions of a non trivial linear cycle sets whose underlying additive group is a product of two cyclic groups.

fields
Group Theory, Quantum Algebra
pdf ↗ page arXiv:2610.33192 ↗

We study the quotient of the framed braid group $FB_n$ by the commutator subgroup of the framed pure braid group $FP_n$. We prove that $$ \frac{FB_n}{[FP_n,FP_n]}\cong\mathbb Z^n\rtimes\frac{B_n}{[P_n,P_n]}, $$ and, for $n\geq3$, that this quotient is a crystallographic group of dimension $n(n+1)/2$ with holonomy group $S_n$. We investigate its finite-order elements and conjugacy classes, prove that it has no elements of finite even order, and construct Bieberbach subgroups with prescribed finite $2$-group holonomy. Starting from suitable Bieberbach subgroups of $\frac{B_n}{[P_n,P_n]}$, we then construct Bieberbach subgroups of the framed quotient whose associated compact flat manifolds are torus bundles over the corresponding unframed flat manifolds. We describe these bundles through the generalized Calabi construction and determine their orientability, first Betti numbers, and the centers of their fundamental groups. As an application, we study a family with cyclic holonomy of odd order, obtaining a criterion for the existence of flat Kähler structures, and indicate how the same construction applies to cyclic holonomy of $2$-power order.

fields
Group Theory
pdf ↗ page arXiv:2610.33308 ↗

Let $G$ be a split Chevalley group of type $B_n$ ($n \geq 3$) or $D_n$ ($n \geq 4$), let $L$ be its Lie algebra and $Γ$ its long-root geometry, namely $Γ$ is the line-grassmannian of the polar space associated to $G$. It is well known that $L$ hosts a projective embedding of $Γ$, called the adjoint embedding, which realizes $Γ$ as a projective variety in the projective geometry of the underlying vector space of $L$. It is also known that $Γ$ admits the absolutely universal projective embedding, which is such that all projective embeddings of $Γ$ can be obtained from it as projections. When the field $F$ over which $G$ is defined is finite, the universal embedding of $Γ$ is just the same as the adjoint embedding. The same is not necessarily true when $F$ is infinite. Indeed, as we shall prove in this paper, the universal projective embedding of $Γ$ lives in a direct sum $K\oplus L$ for an $F$-vector space $K$, the dual of which is isomorphic to the derivation space $\mathrm{Der}(F)$ of $F$, which in general is non-trivial. Accordingly, the adjoint embedding of $Γ$ is universal if and only if $\mathrm{Der}(F)$ is trivial, namely $F$ is either perfect of positive characteristic or algebraic over its minimum subfield.

fields
Group Theory
pdf ↗ page arXiv:2610.33384 ↗

Let $K$ be a conjugacy class of a finite $p$-group $G$. Héthelyi, Külshammer and the author asked whether the number of conjugacy classes contained in $KK^{-1}$ is always congruent to $1$ modulo $p-1$, and whether, dually, the number of irreducible constituents of $χ\overlineχ$ is congruent to $1$ modulo $p-1$ for every $χ\in\mathrm{Irr}(G)$. We construct a group of order $7^7$ for which both congruences fail.

comments
3 pages
fields
Group Theory, Representation Theory
pdf ↗ page arXiv:2610.33615 ↗

A finite group $G$ is called a DCI-group provided any two Cayley digraphs $Cay(G,S)$ and $Cay(G,T)$ are isomorphic iff the two connection sets $S$ and $T$ are images of each other via automorphisms of the group $G$. Building on the vast literature on CI- and DCI-groups we present an updated list of possible DCI-groups. In addition, we give an alternative proof that does not rely on deep results from group theory. We also point out the three most important open problems related to the classification of DCI-groups.

comments
7 pages
fields
Group Theory, Combinatorics
pdf ↗ page arXiv:2610.33692 ↗

The classification of symmetric Cayley graphs has attracted considerable attention. Results have been obtained for finite abelian groups and nonabelian simple groups. However, the problem remains open for finite nonabelian characteristically simple groups, although some results on normality for small valencies are known. In this paper, we determine the possible structures of automorphism groups $X$ of connected 2-arc-transitive Cayley graphs $Γ$ of $G\cong T^k$, where $T$ is a finite nonabelian simple group and $k\geqslant2$. In the quasiprimitive case, we prove that $G\unlhd X$, $Γ$ is complete, or $X$ is of product action type with restricted parameters. For the non-quasiprimitive case, we determine the possible structures of the quasiprimitive normal quotients of $Γ$.

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

The differential neural tangent kernel (DNTK) is a tool for analyzing the training dynamics of overparameterized physics informed neural networks. In this work, we investigate the symmetry of the infinite DNTK under an orthogonal group, for two layer and deep neural networks separately, based on the explicit expression of the DNTK and recursive formula, respectively. The results are for all activations with or without a bias term, and shed insight into the structure of the infinite width DNTK. Then we prove that the integral operators over the unit sphere induced by operators from the same group orbit share the spectrum, and their reproducing kernel Hilbert spaces differ only by an orthogonal transformation, and that the operator fixed DNTK exhibits zonal symmetry on the unit sphere for symmetric operators. Thus the eigenvalue decay rate of the associated integral operator can be derived for shallow networks with RePU activation and zero bias initialization.

comments
25 pages, 2 figures
fields
Group Theory
pdf ↗ page arXiv:2610.34023 ↗

We compute the expected value of the product of traces for a finite set of words within any compact subgroup of $\mathcal(N)$. Furthermore, we establish a sufficient condition under which these values determine that the product of the conjugacy classes of the words contains the identity.

fields
Group Theory, Operator Algebras
pdf ↗ page arXiv:2610.34213 ↗

In this article we show that all the nonamenable Baumslag-Solitar groups with nonunimodular Bass-Serre tree, i.e., $\mathrm{BS}(p,q)$ with $|p|,|q| \neq 1$ and $|p|\neq |q|$, are measure equivalent to each other, thereby completing the measure equivalence classification of Baumslag-Solitar groups: each $\mathrm{BS}(p,q)$ belongs to one of three measure equivalence classes according to whether it is amenable ($|p|=1$ or $|q|=1$), virtually isomorphic to $\mathbf{F}_n \times \mathbf{Z}$ ($|p|=|q|\neq 1$), or is nonamenable with nonunimodular Bass-Serre tree ($|p|,|q| \neq 1$ and $|p| \neq |q|$). More generally, we obtain the similar classification of the generalized Baumslag-Solitar groups of rank $1$ (i.e., groups that act cocompactly on a tree with edge and vertex stabilizers infinite cyclic). Our proof also establishes a classification of all treeable lcsc groups into exactly six measure equivalence classes. Our new contribution which completes this taxonomy is: all nonunimodular nonamenable treeable lcsc groups are measure equivalent. Along the way we obtain several results about type $\mathrm{III}$ equivalence relations and graphings of independent interest. For example, we show that every ergodic type $\mathrm{III}_0$ graphing admits an ergodic hyperfinite subgraph for which the natural factor map of Krieger flows is an isomorphism.

comments
43 pages, comments welcome
fields
Group Theory, Dynamical Systems, Logic
pdf ↗ page arXiv:2610.34323 ↗

We show that the chain flare condition introduced by Clay fails for every topological representative on the topological $n$-rose of every power of an atoroidal irreducible automorphism of $F_n$.

comments
7 pages
fields
Group Theory
pdf ↗ page arXiv:2610.34571 ↗

Keller and Yang formulated two conjectures relating abelian quotients of subgroups of finite linear groups to largest orbit sizes. After counterexamples were found to the original conjectures, two revised versions were proposed. We prove both revised conjectures for every finite group $G$ satisfying $F(G)=F^*(G)$. We also extend a regular-orbit theorem for nilpotent subgroups to completely reducible modules of mixed characteristic under the same hypothesis.

fields
Group Theory
pdf ↗ page arXiv:2610.34680 ↗

The Quadratic Conjecture for finite p-groups, which is equivalent to the Strong Oliver Conjecture, asserts that if a finite p-group G acts faithfully on an F-module V, then the center Z(G) contains a quadratic element. In this paper, we investigate the structure of maximal class p-groups and establish that they satisfy the Quadratic Conjecture.

fields
Group Theory
pdf ↗ page arXiv:2610.34718 ↗

In this paper, we study complex hyperbolic triangle groups of type $(p_1,p_2,p_3;p_4)$ with $3\le p_1\le p_2\le p_3\le p_4\le \infty$. We show that if the element $R_1R_2R_3$ is elliptic, then the group is either non-discrete or it belongs to a short list of known discrete groups.

comments
19 pages
fields
Group Theory, Geometric Topology
pdf ↗ page arXiv:2610.35197 ↗

Let $M$ be a module over a commutative ring with unity $R$, and let $φ:M \to R$ be an $R$-linear map. Then the product $mn = m + (1+φ(m))n$ defines a monoid $Mon(φ)$ on $M$. We show that if $G$ is a group, then $G$ arises as the group of invertible elements of some such monoid $Mon(φ)$ if and only if $G$ is metabelian.

comments
11 pages
fields
Group Theory
pdf ↗ page arXiv:2610.35603 ↗

Let m_p(G) be the number of elements of order p in a finite group G, p prime. We prove that there is no finite simple group G with m_p(G) = 2p^2-p-1, and that a finite group with this property exists if and only if 2p+1 is prime or 3^f with f an odd prime. This concerns an open problem and extends the classification of finite groups with few elements of prime order.

fields
Group Theory
pdf ↗ page arXiv:2610.35643 ↗

We prove that the group $G=\mathbb{Z}[1/2]^3\rtimes(\operatorname{SL}_3(\mathbb{Z})\times\mathbb{Z})$ is finitely presented and residually finite, but is not stable in finite actions, answering a question of Gohla and Thom. The proof uses the infranormal Kazhdan subgroup $H=\mathbb{Z}^3\rtimes\operatorname{SL}_3(\mathbb{Z})$ and its normal closure $N$ in $G$. A Kazhdan projection estimate shows that, in any $G$-action weakly contained in finite actions, every $H$-invariant measurable subset is also $N$-invariant. We construct an explicit sofic approximation of $G$ whose limit action contains a measurable subset that is $H$-invariant but not $N$-invariant.

comments
10 pages
fields
Group Theory
pdf ↗ page arXiv:2610.35841 ↗

Classical Analysis and ODEs15

We prove that four cosines with distinct positive integer frequencies have the same sign on at least $1/33$ of a period, with equality precisely for positive integer dilates of $\{1,3,11,33\}$. If both odd and even frequencies occur, the optimal proportion is $1/24$; equality holds precisely for odd positive integer dilates of $\{1,3,4,12\}$ and $\{2,4,5,15\}$. For arbitrary $n$, we establish the universal lower bound $4^{1-n}$ and construct frequency sets for which this proportion is at most $16n^\theta4^{-n}$, where $θ=\log_2(3/2)$. These bounds determine the optimal exponential decay rate $1/4$.

comments
47 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.33190 ↗

We study sets in R^n that contain a unit k-dimensional disk in each direction from a subset of the Grassmannian G(n,k) of Hausdorff dimension at least t; we call them (n,k,t)-sets. In the range 2k>n, we prove that every (n,k,t)-set has positive Lebesgue measure whenever t>k(n-k-1)+1. This follows from a sharp Sobolev-to-L^2 estimate for the k-plane maximal operator over a Frostman measure on G(n,k), which also yields an L^p-L^2 estimate for every p>n/k with respect to Haar measure. In the range 2k<=n, where translations can no longer be ignored, we obtain the same threshold via a lifting argument, conditional on the quantitative Kakeya estimate in dimension n-k+1. Using the quantitative Kakeya estimate of Wang and Zahl in dimension 3, we deduce that (4,2,t)-sets have positive measure for t>3. The threshold t>k(n-k-1)+1 is sharp, in the sense that (n,k,t)-sets of measure zero exist at t=k(n-k-1)+1. These results improve the previous threshold t>n/2+k(n-k-1) of Fraser, Harris and Kroon, and give the first restricted-direction results in the range 2k<=n.

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

We investigate the boundedness of the Hardy-Littlewood maximal operator $M$ on variable Lebesgue spaces $L^{p(\cdot)}(Ω,d,μ)$ over spaces of homogeneous type, focusing on the endpoints $p_-=1$ and $p_+=\infty$. At the lower endpoint, we prove that the boundedness of $M$ forces $p_->1$ for all exponents if and only if the space $(Ω,d,μ)$ is non-atomic. At the upper endpoint, we generalize the Muckenhoupt-Nekvinda sufficient condition of Adamadze, Diening, and Kopaliani. On bounded spaces of homogeneous type, whenever $p_->1$, this yields a boundedness criterion based on the Muckenhoupt condition alone. We also construct an unbounded space where the Muckenhoupt condition suffices for the maximal operator's boundedness.

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

In this article, we establish sharp quantitative weighted estimates for the lifted Hardy–Littlewood (resp Sobolev sharp) maximal operators $\{\mathcal M_θ\}_{θ\in(0,\infty)}$ (resp $\{\mathcal M_θ^\sharp\}_{θ\in(0,\infty)}$). Specifically, for $p\in(1,\infty)$, $γ\in\mathbb R\setminus\{0\}$, $\upsilon\in A_p$, and $f\in L^p_\upsilon$, we prove that \begin{align*} \sup_{θ,λ\in(0,\infty)}λ^p \underset{\mathcal M_θ(f)(x,t)>λt^γ} {\int_{\mathbb R^n}\int_0^\infty} t^{γp-1}\,dt\,\upsilon(x)\,dx \lesssim [\upsilon]_{A_p}^{α_{p,γ}} \|f\|_{L^p_\upsilon}^p, \end{align*} where $α_{p,γ}:=\frac{p}{p-1}$ for $γ\in[-n,0)$ and $α_{p,γ}:=1$ otherwise and where the implicit positive constant depends only on $n$, $p$, and $γ$. For $\mathcal M_θ^\sharp$, the corresponding estimate holds with $\|f\|_{L^p_\upsilon}^p$ replaced by $\|\nabla f\|_{L^p_\upsilon}^p$ for any $f\in\dot W^{1,p}_\upsilon$, and with $α_{p,γ}:=\frac{p}{p-1}$ for $γ\in[-1,0)$ and $α_{p,γ}:=1$ otherwise. We show that, for an $A_1$ weight $\upsilon$, the weight constant in the above estimates becomes $[\upsilon]_{A_1}$ for the sharp ranges $p\in(1,\infty)$ and $γ\in\mathbb R\setminus\{0\}$, or $p=1$ and $γ\in\mathbb R\setminus[-n,0]$ (resp. $γ\in\mathbb R\setminus[-1,0]$). We also prove that $α_{p,γ}$ is sharp, and we establish exact limiting formulae and characterize Muckenhoupt weights via weak-type bounds. As applications, we characterize the weighted Hardy(--Sobolev) space $H^1_\upsilon$ with $\upsilon\in A_1$ in terms of the truncated Riesz transforms with optimal range $γ\in \mathbb R\setminus\{0\}$. More applications include the sharp weighted Caffarelli–Silvestre extension and the generalization to ball Banach function spaces.

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

We obtain analogues of the first Miller–Paris transformation for three classes of Kampé de Fériet functions with unit parameter differences associated with the Appell function $F_1$. We also derive representations of the Appell function $F_1$ in terms of Kampé de Fériet functions and reduction formulas expressing certain Kampé de Fériet functions with integral parameter differences in terms of univariate generalized hypergeometric functions with integral parameter differences.

comments
16 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.34066 ↗

We give an affirmative answer to Muckenhoupt's $C_p$ conjecture: for $1<p<\infty$, the $C_p$ condition is necessary and sufficient for the weighted $L^p(w)$ norm inequality relating the Hilbert transform and the Hardy–Littlewood maximal operator. We also show that the $C_p$ condition is necessary and sufficient for the weighted Fefferman–Stein inequality.

comments
24 pages
fields
Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2610.34099 ↗

We construct a probability measure on the circle with independent convolution powers and uniformly bounded symmetric Fourier partial sums in $L^1$. Every positive convolution power is therefore singular with respect to Haar measure. The measure is Rajchman. The construction answers a question of Andersson concerning measures with bounded Fourier partial sums outside the radical of $L^1$, and contrasts with his theorem that the classical examples of Weiss, Katznelson, and Brown-Hewitt have convolution squares in $L^2$. Our proof combines sparse probability blocks, an endpoint $L\log L$ estimate, and a diagonal generalized Riesz product. Exact factorization of local moments permits the simultaneous separation of all convolution powers by Brown's singularity criterion. By the classical spectral theory of independent-power measures, its spectrum is the closed unit disc. In particular, it has non-natural spectrum and induces a non-decomposable convolution operator on $L^1$. The image of the measure in $M(\mathbb T)/L^1(\mathbb T)$ has spectral radius one, and the closed unital algebra it generates in $M(\mathbb T)$ is isometrically isomorphic to $\ell^1(\mathbb N_0)$.

comments
19 pages, no figures
fields
Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2610.34587 ↗

We study $L^p$--$L^q$ boundedness of the strong circular maximal operator $\M$, the maximal function over axis-parallel ellipses centered at the origin whose two semiaxes range independently over $[1,2]$. We prove that $\M$ is bounded from $L^p$ to $L^q$ whenever $(1/p,1/q)$ lies in the interior of the triangle with vertices $(0,0)$, $(2/7,1/7)$, and $(1/3,1/3)$, the two-parameter analogue of the triangle with vertices $(0,0)$, $(2/5,1/5)$, and $(1/2,1/2)$ obtained by Schlag and Schlag–Sogge for the circular maximal function. The range is sharp up to the boundary; in particular, weak type $(p,q)$ bounds fail for every $p\le3$. The proof is based on a bilinear estimate for frequencies in separated angular sectors, uniform as the sectors approach the coordinate axes. We also prove the analogous sharp result for axis dilations of a translated circle $c+\mathbb S^1$ with fixed $c\ne0$, where the vertex $(2/7,1/7)$ is replaced by $(1/4,1/8)$.

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

The main purpose of this paper is to develop the duality theory of the homogeneous Triebel–Lizorkin spaces associated with the Euclidean flag, using the discrete Littlewood–Paley–Stein analysis. After establishing bounded analysis and synthesis maps, we describe the continuous duals by Carleson conditions. In the Hardy spatial range, the representing distributions satisfy an open-set Carleson condition when the sequence exponent is greater than one and a coefficient supremum condition when the sequence exponent is at most one; in the Banach spatial range the dual is a conjugate-exponent or a supremum space. At the supremum sequence endpoint, the closure of the flag test functions is characterized by a pointwise scale tail measured in $L^p$, and a coefficient pairing decomposes every functional on the full space into a regular part and a part that annihilates the closure. By means of a fixed-envelope modulation construction we show that this closure is proper for every finite spatial exponent and that the annihilator is nonzero when the spatial exponent is at least one. The same analysis and synthesis framework also yields complex interpolation, real interpolation in the spatial exponent, the lifting property and the standard mixed-norm embeddings.

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

We prove the Falconer-type bound $\dim_{\mathrm H}F\geq u+1$ for planar circular $(u,v)$-Furstenberg sets whenever $0<u\leq1$, $0<v\leq3$, and $2u+v\geq3$. The same bound holds for smooth cinematic curve families. This resolves the circular Furstenberg conjecture of Green, Harris, Ou, Ren, and Tammen in its full Falconer range $2u+v\geq3$.

comments
40 pages, 3 figures
fields
Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2610.35213 ↗

We solve an open problem on the multilinear Rubio de Francia extrapolation on Banach function spaces. The first result states that, under the assumption of boundedness of the multisublinear Hardy-Littlewood maximal operator, the multivariable boundedness on Banach function spaces can be extrapolated from some weighted Lebesgue space, including the cases where some exponents may be infinite. Under the same assumption, the second result asserts that if a multilinear operator is bounded on some weighted Lebesgue space, then its compactness can be extrapolated from some unweighted Lebesgue space to Banach function spaces. Our results do not require any convexity or concavity conditions on Banach function spaces. The main ingredients in the proof are a multilinear version of the Rubio de Francia algorithm, a stopping-time argument, convex analysis, and a compactness criterion on Banach function spaces. As applications of extrapolation theorems, we obtain multilinear extrapolation for the boundedness and compactness of commutators on Banach function spaces. These results can be further applied to specific operators, which cover both the full range case including multilinear Calderón-Zygmund operators, multilinear pseudo-differential operators, and bilinear paraproducts, and the limited range case including the bilinear Hilbert transform, multilinear rough singular integrals, and bilinear oscillatory Fourier multipliers.

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

We overview recent results quantifying the Besicovitch projection theorem, focusing on the theory of quantitative rectifiability and connection to Vitushkin's conjecture.

comments
47 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.35502 ↗

We establish the endpoint gradient estimate for centered homothetic maximal averages in every dimension $d\ge2$ over each fixed convex body with $C^{1,θ}$ boundary, $0<θ\le1$. In particular, the centered ball maximal operator satisfies the $W^{1,1}$ gradient bound in every dimension. Neither strict convexity nor a lower bound on the support gap is required. The geometric argument combines concentration in gradient values with nonhomogeneous calibrated rows and a summable radial correction. It extends the scalar refinement, direction-history construction and global assembly of the planar centered-disk proof of OpenAI. A separate transfer theorem gives sharp singular-derivative identities for bounded compact probability kernels once local BV output is known, and gradient continuity under an additional spatial-tail condition. Quantitative contact and translation estimates yield further profile and kernel examples. The estimates retain the fixed body's regularity data; the endpoint for arbitrary $C^1$ and nonsmooth convex bodies remains open here.

comments
62 pages, including technical appendices
fields
Classical Analysis and ODEs, Functional Analysis, Probability
pdf ↗ page arXiv:2610.35760 ↗

In this paper, we establish a sufficient condition for weak Hurwitz stability of extended Turán expressions for the Stirling–Whitney–Riordan polynomials. The proof uses polynomial transformations that preserve zeros in a real interval and in the unit disk. As an application, we prove that the extended Turán expressions for the Bell polynomials are weakly Hurwitz stable. We also prove the corresponding result for the reflected Laguerre polynomials using polynomial approximations. These results settle two conjectures of Chasse, Grabarek, and Visontai.

comments
15 pages
fields
Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2610.35783 ↗

Given a positive, non-increasing sequence $a$ with sum $1$, we consider the family $\mathcal{C}_a$ of closed subsets of $[0,1]$ whose complementary open intervals have lengths given by the terms of $a$. We study which functions $θ\mapsto\overline{\dim}_{\,θ}E$ arise as the upper intermediate dimensions of sets $E\in\mathcal{C}_a$. Under a natural condition on the decay of $a$, we show that these are exactly the functions in the class introduced by Banaji and Rutar that take the value $\overline{\dim}_{\rm B}C_a$ at $θ=1$ and are bounded above by the upper intermediate dimensions of the decreasing Cantor set $C_a$. We also show that the lower bound given by the countable set $D_a$ is rigid: if it is attained at one value of $θ$, then it is attained at all larger values.

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

Geometric Topology14

We prove that a compact right-angled polytope in hyperbolic 4-space has at least 120 facets, with equality only for the right-angled 120-cell. This answers a question of Potyagailo and Vinberg. As a consequence, the right-angled 120-cell is the unique compact right-angled 4-polytope of minimal volume and f-vector.

comments
34 pages, 9 figures, 8 tables. Programs and data are available at https://github.com/Lizi-Guo/120cell-minimality
fields
Geometric Topology, Combinatorics, Metric Geometry
pdf ↗ page arXiv:2610.33053 ↗

For a null-homologous fibered knot $K$ in a rational homology sphere, Baldwin and Vela-Vick define a refinement $b(K)$ of the Ozsváth-Szabó contact invariant. We prove that if the Ozsváth-Stipsicz-Szabó concordance invariant Upsilon has slope $Υ'_K(t)=-g(K)$ for some $t\in[0,\frac{2}{n+1})$, where $g(K)$ is the genus of $K$, then $b(K)>n$. This extends a result of He, Hubbard, and the author on the Upsilon invariant and right-veering monodromies. We also prove that the knot Floer homology of a fibered knot in the $g(K)-b(K)$ Alexander grading is nonvanishing. As an application, we give many families of fibered cable knots whose $b(K)$ invariant grows arbitrarily large. Finally, we prove that if a monodromy of a fibered knot is neither right-veering nor left-veering, then the third-to-top term of knot Floer homology is nonvanishing.

comments
12 pages, 1 figure
fields
Geometric Topology
pdf ↗ page arXiv:2610.33280 ↗

We establish a Delambre–Gauss matrix identity for oriented right-angled hexagons in the complex hyperbolic plane. The six complex length parameters of a hexagon determine two alternating \(3\times3\) matrices whose product is central in (\mathrm{SU}(2,1)\). The resulting nine entry-wise equations extend the Delambre-Gauss formula of Tan, Wong, and Zhang in 4-dimensional hyperbolic geometry to this complex hyperbolic setting.

comments
22 pages, 2 figures
fields
Geometric Topology, Differential Geometry
pdf ↗ page arXiv:2610.33468 ↗

Recent results on diffeomorphisms of $4$-manifolds make essential use of families of embeddings of $1$-manifolds into $4$-manifolds. We survey what is currently known about such families.

comments
26 pages, 9 figures. To appear in the Proceedings of the 2025 Georgia International Topology Conference
fields
Geometric Topology
pdf ↗ page arXiv:2610.33867 ↗

This paper is the second in a series of two which aims at introducing a new family of groups called $k$-shuffle braid groups, denoted $\mathcal{B}_{n}(k)$. We focus here on the geometrical origins of these groups, as first observed by Calegari in arXiv:2105.11265. The spaces we are interested in are spaces of complex monic polynomials of degree $n$ whose critical values lie in $\mathbb{C} \setminus \{1, e^{\frac{2πi}{k}}, \dots, e^{\frac{2πi (k-1)}{k}}\}$. We show that the $k$-shuffle braid groups are the fundamental groups of those spaces, which correspond geometrically to complements of $k$ translates of the discriminant variety. Moreover, we show that the $k$-shuffle braid groups $\mathcal{B}_n(k)$ inject into the larger braid groups $\mathcal{B}_{nk}$.

comments
47 pages, 37 figures. This paper is the second one in a series of two. The first paper is available at arXiv:2610.28986
fields
Geometric Topology, Combinatorics, Complex Variables, Group Theory
pdf ↗ page arXiv:2610.33890 ↗

We construct the first examples of contact $3$-manifolds admitting infinitely many pairwise non-homeomorphic Stein fillings which are rational homology balls. Our examples are planar. They are obtained by a simple modification of Baykur's recent planar contact $3$-manifold $(Y,ξ)$ with infinitely many pairwise non-homeomorphic Stein fillings, and the fillings are distinguished by their fundamental groups. For one of these rational homology balls we give an explicit Kirby diagram, with a single $1$-handle and a single $2$-handle attached along a trefoil, which exhibits its boundary as $(0,-8)$-surgery on a two-component link. We also identify the smooth topology of Baykur's example: $Y$ is obtained by $(0,-8)$-surgery on the link $7^2_4$, and it is Seifert fibered over the Klein bottle with one exceptional fiber. Finally, we construct further Stein fillings of $(Y,ξ)$, which realize all the groups $\mathbb Z/m\rtimes_{-1}\mathbb Z$, $m\ge0$, as their fundamental groups.

comments
22 pages, 13 figures
fields
Geometric Topology, Symplectic Geometry
pdf ↗ page arXiv:2610.34381 ↗

We show that the Khovanov homology of virtual knots defined by V.O. Manturov and the Khovanov homology defined by D. Tubbenhauer coincide.

comments
14 pages
fields
Geometric Topology
pdf ↗ page arXiv:2610.34438 ↗

We study the twelve-vertex flag triangulation $T_{12}$ of $S^3$ and the Davis $4$-manifold $M(T_{12})$ associated with it. We prove that $T_{12}$ is, up to isomorphism, the unique flag triangulation of $S^3$ with twelve vertices in which every edge is contained in a square; this proves Milizia's Conjecture~6.31. We also prove a general criterion for the tangent Euler class of a Davis $4$-manifold to be bounded, and we verify it for $T_{12}$ by means of an explicit symmetric form. Since the Euler class takes the value $256$ on the fundamental class of $M(T_{12})$, the duality between bounded cohomology and simplicial volume gives $\|M(T_{12})\|>0$. This answers Milizia's Question~1.7.

fields
Geometric Topology
pdf ↗ page arXiv:2610.34743 ↗

Morrison, Walker and Wedrich used Khovanov homology to define the skein lasagna module for a 4-manifold with a link in its boundary. The skein lasagna module was shown to be a deep and powerful invariant; in particular, Ren and Willis proved that it detects exotic smooth structures. Still, computing the skein lasagna module outside some carefully chosen grading range remains an important open problem. Motivated by this construction, Chen defined the Floer lasagna module using Heegaard Floer link homology. In this paper, we give a complete, but partially conjectural description of Floer lasagna modules for a class of 4-manifolds obtained by adding 2-handles along plumbed L-space knots (with certain framing constraints). In particular, we prove that for $\overline{\mathbb{CP}^2}$ it is infinite-dimensional, and conjecture that for $\mathbb{CP}^2$ it is infinite-dimensional as well. We compute this module for $\overline{\mathbb{CP}^2}$ (and conjecturally for $\mathbb{CP}^2$) in all Alexander and Maslov gradings. This strengthens and extends the recent results of McCulloch.

comments
52 pages
fields
Geometric Topology
pdf ↗ page arXiv:2610.34744 ↗

A twisted torus knot T(p,q;r,s) is obtained from the flat-torus diagram of T(p,q) by inserting s full twists along a disk meeting r adjacent strands. Our previous work determined its Alexander polynomial for 1<r<=max{|p|,|q|}. In this paper, we compute it in the complementary range max{|p|,|q|}<r<=|p|+|q| by placing the knot on a standard genus-two Heegaard surface and applying Fox calculus. We then combine the two calculations into a unified Alexander-polynomial formula valid for 1<r<=|p|+|q|. In the complementary range, we prove monicity and give an explicit formula for the breadth. This determines the Seifert genus for nonnegative twists and gives a genus lower bound for negative twists. We also exhibit infinite two-parameter families of non-L-space knots in the complementary range.

comments
21 pages, 4 figures. Comments and suggestions are welcome
fields
Geometric Topology
pdf ↗ page arXiv:2610.34813 ↗

We study oriented $t_3$- and $\bar t_6$-moves through the problem of lifting Fox $3$-colorings to colorings by a nine-element Alexander quandle. We define a nonnegative integer lifting defect $δ$ for oriented links and prove that it is invariant under these moves. For knots, the defect equals the rank of an alternating bilinear form obtained from a Seifert matrix, so it is even. We also prove that it is additive under connected sum. Let $K_s$ be the connected sum of $s\geq 1$ copies of $9_{46}$. Then $δ(K_s)=2s$, so these knots represent infinitely many distinct equivalence classes under the oriented moves, and none is equivalent to an unlink. After forgetting orientation, each $K_s$ can be transformed into an unlink with $2s+1$ components by $3s$ ordinary $3$-moves.

comments
24 pages, 4 figures
fields
Geometric Topology
pdf ↗ page arXiv:2610.34831 ↗

An R-link is an n-component link L in S^3 such that Dehn surgery on L yields #^nS1 \times S2. Adapting work of Gompf, Scharlemann and Thompson, Meier and Zupan produced a family of R-links L(p, q; c/d), where the pairs (p, q) and (c, d) are relatively prime and c is even. For most of link in this family, whether it is handle-slide trivial remains open. In this work, we show one subfamily, L(3, 2; 4/d), are stably handle-slide trivial for all d.

comments
23 pages, 22 figures, comments welcome
fields
Geometric Topology
pdf ↗ page arXiv:2610.35120 ↗

In this paper, we study height 4 knots, which generalize L-space knots and almost L-space knots studied by Ozsváth–Szabó, Baldwin–Sivek, and Binns. A knot $K\subset S^3$ is called a height $m$ knot if $\operatorname{rank} \widehat{HF}(S^3_n(K))-n=m$ for all integers $n\geq 2g(K)-1$, where $\widehat{HF}$ is the hat version of Heegaard Floer homology introduced by Ozsváth–Szabó. In particular, height 0 and height 2 knots are exactly L-space knots and almost L-space knots, respectively. We prove that the knot Floer complex $CFK^\infty(S^3,K)$ of a height 4 knot $K$ admits a basis that is horizontally and vertically simplified–an hv-basis for short. Moreover, we show that under such an hv-basis, the horizontal and vertical differentials fall into six cases, generalizing the results for L-space knots and almost L-space knots. The hv-basis of the knot Floer complex of $K$ can determine, via an explicit algorithm, the immersed curve of Hanselman-Rasmussen-Watson for the knot complement of $K$. Consequently, our results facilitate further exploration of computations of $\widehat{HF}$ for the gluing of two height 4 knot complements.

comments
89 pages, 122 figures, 26 tables. Most figures depict subquotient complexes by displaying their generators and differentials
fields
Geometric Topology
pdf ↗ page arXiv:2610.35305 ↗

Lie quandles were defined by T. Fritz as a nonlinear generalization of Lie algebras, to serve as a nonlinear algebras of observables in generalized form of Hamiltonian mechanics. These objects were subsequently generalized in a prequel article to objects referred to as smooth Lie group families of smooth racks by the authors. In this article, we investigate a particular system of nonlinear functional differential equations whose solution in general provides a pathway to the classification of smooth Lie group families of smooth rack structures on any given smooth manifold. We then discuss a particularly practical ansatz for solving these equations, and use it to construct new families of examples, as well as prove a result on the sense in which the Bloch sphere is the unique Lie quandle structure on the sphere.

comments
29 pages. Comments are welcome
fields
Geometric Topology, Mathematical Physics, Category Theory, Differential Geometry
pdf ↗ page arXiv:2610.35534 ↗

Operator Algebras13

We embed skew fields of meromorphic functions in several non-commuting variables into the topological $*-$algebra of closed linear operators affiliated to a finite von Neumann algebra, $\mathfrak{M}$, with faithful, normal tracial state, $τ$. Namely, let $\mathscr{O} _d (r)$, $r \in (0, +\infty]$, denote the rings of formal power series in $d \in \mathbb{N}$ non-commuting variables with "radius of convergence" at least $r$ and let $Ξ\in \mathfrak{M} ^{1\times d}$ be a tuple of row-norm $<r$ with the property that there exist no non-zero trace-class operators $T_1, \cdots, T_d \in \mathscr{B} (L^2 (\mathfrak{M}, τ))$ obeying $\sum _j [T_j , Ξ_j] =0$. Then the unital homomorphism $\mathscr{O} _d (r) \rightarrow \mathfrak{M}$ defined by the evaluation, $\mathfrak{z} _j \mapsto Ξ_j$, extends to an embedding of the universal skew field of fractions of $\mathscr{O} _d (r)$ into the $*-$algebra of closed operators affiliated to $\mathfrak{M}$. In their $L^2-$homology theory of von Neumann algebras, Connes and Shlyakhtenko defined a certain quantity, $0 \leq Δ(Ξ) \leq d$, as the Murray-von Neumann co-dimension of the Hilbert module generated by all $d-$tuples of finite rank operators obeying the above commutator condition with $Ξ\in \mathfrak{M} ^{1\times d}$. As demonstrated by Mai, Speicher and Yin, this $Δ$ measures, in a certain precise sense, the algebraic independence of the components of $Ξ$. Connes-Shlyakhtenko proved that $Δ$ is an upper bound for Voiculescu's non-microstates free entropy dimension, $δ^* (Ξ)$, and remark that it is of interest to determine whether these two quantities are equal. Using non-commutative function theory, we show that this is generally not the case, by constructing a triple of self-adjoint operators, $Ξ= (Ξ_1,Ξ_2,Ξ_3)$, for which this inequality is strict, $δ^*(Ξ) < Δ(Ξ)$.

fields
Operator Algebras, Rings and Algebras
pdf ↗ page arXiv:2610.21004 ↗

In this short paper, we establish the following Galois-type property for all measure-preserving, weakly compact actions $G \curvearrowright (X,μ) $ of a non-inner amenable group $G$ on a standard probability space $X$: for any intermediate von Neumann subalgebra $\mathcal L(G)\subseteq \mathcal N \subseteq L^\infty (X)\rtimes G$, there is a factor $G\curvearrowright Y$ of $G \curvearrowright X$ such that $\mathcal N= L^\infty(Y)\rtimes G$. In particular, this holds for all pmp distal actions $G\curvearrowright X$, thereby answering positively an open problem from \cite{BCCMSW24} (which can also be traced back to \cite{CD20}). We also provide an example showing our result is optimal.

comments
14 pages; preliminary version; comments are welcome!
fields
Operator Algebras
pdf ↗ page arXiv:2610.33320 ↗

In this paper, we establish the sharp $2$-logarithmic Sobolev inequality for $q$-Araki-Woods Ornstein-Uhlenbeck semigroups with $-1<q<1$ and obtain hypercontractivity along the Gross curve with the optimal coefficient, and determine the exact hypercontractive time for $1<p\le2\le r<\infty$. Reverse hypercontractivity holds in the two separate ranges $0<p<r<1$ and $-\infty<p<r<0$. An explicit counterexample rules out the proposed universal reverse curve across zero. We also obtain the complete modified logarithmic Sobolev inequality via the intertwining property.

fields
Operator Algebras
pdf ↗ page arXiv:2610.33686 ↗

We investigate the regularity properties of C*-algebras admitting a weakly selfless unital completely positive map.

fields
Operator Algebras
pdf ↗ page arXiv:2610.34000 ↗

We study operator systems arising from positivity domains of étale groupoids with compact unit space. Extending Kavruk's enough unitaries principle we show that such operator systems are hyperrigid in the C$^*$-algebra they generate. We focus on operator systems of positivity domains in UHF algebras and, by identifying them with Cantor graph operator systems, we show that they are hyperrigid. Furthermore, we show that in general, such a characterization is not possible when the étaleness condition of the underlying groupoid is removed, due to the failure of reduced spectral and compact operator synthesis.

comments
17 pages
fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2610.34269 ↗

Collins, Hayden, and Nechita used free probability to construct families of $k$-positive but not $(k+1)$-positive maps and applied them to entanglement detection. We prove that positive free maps associated with compactly supported freely infinitely divisible distributions are no stronger than the reduction criterion in every ancillary dimension. In particular, these maps cannot detect positive partial transpose entanglement. The proof combines a joint Fock realization with an operator positivity certificate derived from free Lévy data.

fields
Operator Algebras
pdf ↗ page arXiv:2610.34338 ↗

A positive functional is a trace if and only if it satisfies any one of many inequalities, the first being Gardner's $|\varphi(X)|\le\varphi(|X|)$; positive central elements are characterised similarly. We ask how strongly these characterisations fail. For $\varphi=\mathrm{Tr}(ρ\,\cdot)$ on a matrix algebra the natural scale is the Michelson contrast $δ$ of the density. For Gardner's inequality the sharp constant depends on $δ$ and on the contrast $δ'$ of $|X|$ only through their product: it is $(1-δ^2δ'^2)^{-1/2}$, the secant of the angle whose sine is $δδ'$. On a finite von Neumann algebra the contrast is the wrong parameter, since every central density gives a trace; the governing parameter is the noncentrality, defined through the central condition number $κ_Z(ρ)$ of the central envelopes of $ρ$ (the largest and smallest elements of Halpern's central spectrum). A transfer principle lifts sharp matrix constants to exact constants in terms of $κ_Z$ in every finite von Neumann algebra. For 38 trace characterisations the constant is exact in 23 cases, has proved bounds in 13 and is known only numerically in two; for instance it is $\cosh(\frac12\lnκ_Z)$ for Gardner's inequality and for the subadditivity of the modulus. On matrix algebras the finite exact violations vanish at the trace to the orders $δ$, $δ^2$ or $δ^4$, and outside factors and abelian algebras no function of the contrast describes the constants. We also find the sharp constants of the Novikov-Tikhonov characterisations of central elements, sharp bounds for three unnormalised trace functionals, and sharp contrast thresholds below which subadditivity of the square root and the power-mean inequality cannot fail. A numerical search, certified as a lower bound for each supremum, supports conjectured values for the remaining inequalities.

fields
Operator Algebras, Mathematical Physics, Spectral Theory
pdf ↗ page arXiv:2610.34388 ↗

We prove that, for every countable non-exact discrete group $H$ and every nontrivial countable discrete group $K$, the reduced group $C^*$-algebra $C_r^*(K\wr H)$ is not locally reflexive. These provide the first known examples of non-locally reflexive reduced group $C^*$-algebras, settling a longstanding existence question. Moreover, for every nontrivial countable exact discrete group $K$, we establish that local reflexivity of $C_r^*(K\wr H)$ is equivalent to exactness of $H$, and hence to exactness of $C_r^*(K\wr H)$. This gives a partial affirmative answer to Kirchberg's question of whether local reflexivity implies exactness for $C^*$-algebras. As applications, we construct finitely generated groups with the Haagerup property, as well as finitely generated residually finite groups, whose reduced group $C^*$-algebras are not locally reflexive. In particular, neither the Haagerup property nor coarse embeddability into Hilbert space guarantees local reflexivity of the associated reduced group $C^*$-algebra.

comments
12 pages
fields
Operator Algebras, Group Theory
pdf ↗ page arXiv:2610.34695 ↗

The classical Lebesgue dominated convergence theorem (DCT) is a cornerstone in commutative measure theory, while its extension to the noncommutative setting has remained a longstanding challenge due to the barriers posed by the noncommutative structure. Let \(α\) be a unitarily invariant norm defined on a diffuse tracial von Neumann algebra \((\mathcal{M}, τ)\), let $L^α(\mathcal M, τ)$ be the completion of $\mathcal M$ with respect to the norm $α$(which includes all $L^p(\mathcal M, τ)$ as special cases). In this paper, by replacing ``almost everywhere convergence" with Nelson's convergence in measure, we establish a noncommutative analog of the dominated convergence theorem for $L^α(\mathcal M, τ)$ under a { significantly weaker dominating condition} than those previously considered. For instance, in a \(II_1\) factor \(\mathcal{M}\), if \(P\) is a projection with \(τ(P)=\frac{1}{n}\), then \(n^2 P\) ``dominates" every operator of norm \(\leq n\). As an application, we obtain a complete characterization of center-preserving $*$-automorphism of finite von Neumann algebras, which unifies and extends the earlier works of Kadison and Haagerup on the structure of automorphisms.

comments
19 pages
fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2610.34776 ↗

We show how a simple metric condition in terms of the C$^*$-norm of an arbitrary C$^*$-algebra $A$ can be employed to determine those norm-one positive elements which are projections. Concretely, if we write $S_{A^+}$ for the intersection of the positive cone and the unit sphere of $A$, we establish that an element $a \in S_{A^+}$ is a projection if, and only if, $$\{a\} = \left\{x\in S_{A^+}: \|x-z\| = 1 \hbox{ for all } z\in S_{A^+}\hbox{ with } \|a-z\|=1 \right\}.$$ This proves a conjecture which has been previously confirmed for von Neumann algebras and unital C$^*$-algebras. In the setting of not necessarily unital JB$^*$-algebras, the Shirshov–Cohn theorem is invoked to obtain a similar metric characterisation of projections. In the wider setting of JB$^*$-triples, we show how a metric characterisation in terms of inner ideals can be established to determine non-zero tripotents.

comments
10 pages
fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2610.35290 ↗

Let $D$ be a unital separable $C^*$-algebra with a faithful state $σ$ and $G$ be a discrete group. We introduce a property called relative norm averaging property (RNA) for almost periodic $σ$-preserving actions by $G$ on $(D,σ)$. We prove that if an almost periodic $σ$-preserving action $α$ satisfies that $\overline{α(G)} \subseteq \text{Aut}(D,σ)$ is connected and nontrivial, then $α$ satisfies (RNA). As an application, we prove that if $G$ has property PHP of Ozawa and $α:G\curvearrowright (D,σ)$ is an ergodic (i.e. $D^G=\mathbb{C}$) almost periodic $σ$-preserving action with $\overline{α(G)}$ being connected, then $D\rtimes_r G$ is selfless. This includes certain paradoxical isometric actions of $\mathbb{F}_2$ on the sphere. In non-ergodic case, we prove that the relative norm averaging property implies that $D\rtimes_r G$ satisfies the $D^G$-valued selfless, if $G$ satisfies PHP.

fields
Operator Algebras
pdf ↗ page arXiv:2610.35644 ↗

Building on OpenAI's preprint, we construct, for every real number $r\in(0,1)$, a finitely generated discrete group $G_r$ and a projection $e_r\in C_r^*(G_r)$ whose canonical trace is $r$. The construction encodes the geometry of expanders in the dynamics of a semidirect product of groups. For irrational $r$, the $K$-theory class $[e_r]$ is not in the image of the reduced Baum–Connes map. The groups $G_r$ have torsion and satisfy the maximal strong Novikov conjecture.

comments
57 pages. Comments welcome
fields
Operator Algebras, Group Theory
pdf ↗ page arXiv:2610.35674 ↗

We prove that a weight on a C$^*$-algebra is lower semi-continuous if it is lower semi-continuous on commutative C$^*$-subalgebras. This can be used to prove a von Neumann algebraic counterpart that a weight on a von Neumann algebra is normal if it is normal on commutative von Neumann subalgebras. This provides an affirmative solution to Haagerup's second problem (Problem 1.11) on normal weights posed in 1975.

comments
9 pages, comments are welcome!
fields
Operator Algebras, Functional Analysis
pdf ↗ page arXiv:2610.35774 ↗

Rings and Algebras13

We study congruence lattices of finite algebras whose basic operations are unary and have exactly two values. We prove that the class of finite lattices representable in this way is closed under taking filters, glued sums and ordinal sums, and direct products with finite distributive lattices, but it is not closed under taking ideals or arbitrary direct products. A classification of lattices with at most seven elements with respect to representability is also presented.

comments
31 pages, 14 figures
fields
Rings and Algebras
pdf ↗ page arXiv:2610.33305 ↗

An affinization of a concept of a Rota-Baxter operator or Rota-Baxter affgebras are discussed. Rota-Baxter Lie affgebras and their relation to Rota-Baxter Lie algebras are treated in more detail. In particular it is shown that every Rota-Baxter Lie affgebra is isomorphic to a Rota-Baxter Lie affgebra with a Lie algebra fibre over which the affine Rota-Baxter operator is linear.

comments
10 pages; submitted to the proceedings of XLIII Workshop on Geometric Methods in Physics, Białystok 2026
fields
Rings and Algebras, Quantum Algebra
pdf ↗ page arXiv:2610.33573 ↗

In this paper, we introduce the notion of an omni-representation of a Leibniz conformal algebra $\mathfrak{g}$ on a $\mathbb{C}[\partial]$-module $M$ as a Leibniz conformal algebra homomorphism from $\mathfrak{g}$ to the conformal omni-Lie algebra $\mathfrak{gc}(M)\oplus M$. We show that the right $λ$-action of a representation induces a Maurer–Cartan element. When $M$ is a free $\mathbb{C}[\partial]$-module of finite rank, it also defines, via the conformal dual $M_c^*$, a $1$-cocycle with values in $M_c^*\otimes M\cong\mathfrak{gc}(M)$. Consequently, every such representation gives rise to an omni-representation on $M_c^*\otimes M$. We characterize omni-representations with values in the graph of a conformal embedding tensor. Finally, we introduce the omni-cohomology theory of Leibniz conformal algebras and establish the relation between omni-cohomology groups and the usual cohomology groups.

fields
Rings and Algebras
pdf ↗ page arXiv:2610.33856 ↗

In this paper, zeon matrix groups are discussed for the first time. Extending the concept of unitary complex matrices (i.e., matrices $A$ such that $A^\dagger A=\mI$) to matrices having entries in the complex zeon algebra $\CZ$, a ``zeon dagger'' operator $\zdag$ is defined and used to declare a zeon matrix $Ξ$ to be {\em unitary} if $Ξ^\zdagΞ=\mI$. The unitary zeon matrices of order $n$ form a subgroup $\U_n$ of all invertible order-$n$ zeon matrices. A more interesting notion is that of ``weak unitarity'' of a zeon matrix. In particular, a zeon matrix $Ξ$ will be said to be {\em weakly unitary} if $Ξ^\zdagΞ=\mI+Γ$, where $Γ$ is a diagonal nilpotent zeon matrix. The weakly unitary matrices of order $n$ form a group $\W_n$, of which $\U_n$ is a subgroup. It is further shown that the exponential of a graph's nilpotent adjacency matrix has a natural orthogonal decomposition into the sum of a weakly unitary zeon matrix and a nilpotent zeon matrix. Eigenvalues of the weakly unitary zeon matrix reveal information about the graph's cycles and paths.

comments
15 pages, 1 figure
fields
Rings and Algebras, Operator Algebras
pdf ↗ page arXiv:2610.33891 ↗

Let $G$ and $H$ be torsion-free nilpotent groups of arbitrary cardinality, without any uniform upper bound imposed on their cardinality, torsion-free rank, number of generators, or nilpotency class. We prove that if the classical Ore division rings of fractions of their rational group algebras are isomorphic as rings, namely \[ D_{\mathbb{Q}}(G) := \operatorname{Frac}_{\mathrm{Ore}} \mathbb{Q}[G] \cong \operatorname{Frac}_{\mathrm{Ore}} \mathbb{Q}[H] =: D_{\mathbb{Q}}(H), \] then $G$ and $H$ are isomorphic as groups ($G \cong H$). This result extends directly to $k$-algebra isomorphisms $D_k(G) \cong_k D_k(H)$ over any base field $k$ of characteristic zero, as well as to arbitrary torsion-free hypercentral groups (and, more generally, to torsion-free groups satisfying bi-orderability, the Ore condition, and nontrivial intersection of normal subgroups with the center). A key tool in our proof is a weight-preserving isomorphism theorem for rational function fields of free abelian groups: let $P$ and $Q$ be free abelian groups of arbitrary rank equipped with surjective homomorphisms onto a common abelian group $B$; if their rational function fields over a field $k$ containing an algebraically closed subfield of characteristic zero admit a $B$-weight-preserving field isomorphism $k(P) \cong_B k(Q)$, then there exists a weight-preserving group isomorphism $P \cong_B Q$. By combining the Malcev–Neumann power series division ring, lowest-degree coset extraction over central localizations, the lowest-term rational coefficient homomorphism, and an embedding into a torsion-free abelianized auxiliary function field, we reduce the division ring isomorphism to a weight-preserving rational function field isomorphism between the quotients $G/L$ and $H/L$, and explicitly construct a group isomorphism $G \cong H$ via a central modification.

comments
39 pages, 0 figures
fields
Rings and Algebras
pdf ↗ page arXiv:2610.34116 ↗

Let $R$ be an arbitrary associative ring with an identity. In this paper, we show that the equality $\silp(R)=\spli(R)$ implies $\silp(RG)=\spli(RG)$ for any group $G$.

fields
Rings and Algebras
pdf ↗ page arXiv:2610.34406 ↗

For every field~$\Bbbk$, we construct a non-nilpotent nil algebra~$A$ whose Lie algebra $A^{(-)}$ is generated by ten elements. For $\Bbbk = \mathbb Z_p$, its adjoint group can also be generated by ten elements. Moreover, for every field $\Bbbk$ algebraic over its prime subfield, we construct a finitely presented algebra $B$ over $\Bbbk$ whose Jacobson radical is not nil. These results were found with the assistance of Aristotle (Harmonic).

comments
8 p.; Aristotle was used
fields
Rings and Algebras
pdf ↗ page arXiv:2610.34463 ↗

We give a complete classification of finite-dimensional simple Novikov algebras over an algebraically closed field of characteristic $p>2$, including families missing from earlier classifications in \cite{Osborn1992, Xu1996}. We determine explicit normal forms and all isomorphisms between them, and classify all nontrivial irreducible bimodules over these algebras.

fields
Rings and Algebras, Mathematical Physics
pdf ↗ page arXiv:2610.34896 ↗

Idempotent (hereditary/cohereditary) (pre)radicals on the category of left modules over an associative ring with unity are described in terms of factorization systems. For radicals of the aforementioned kind, this is done in two different ways.

fields
Rings and Algebras
pdf ↗ page arXiv:2610.34969 ↗

Jacobson's classical theorem asserts that every nilpotent Lie algebra admits a non-inner derivation. This result, however, does not extend to Leibniz algebras: there exists an eight-dimensional complex nilpotent Leibniz algebra whose every derivation is inner. In this paper, we present a systematic investigation of this algebra, with particular emphasis on the absence of outer derivations and its structural properties. We describe its lower central series, annihilators, center, and Leibniz kernel, and prove that its derivation algebra is a six-dimensional nilpotent Lie algebra isomorphic to the quotient of the algebra by its Leibniz kernel. We further show that its automorphism group is a connected six-dimensional unipotent group obtained by exponentiating inner derivations; in particular, it contains no nontrivial elements of finite order. In addition, we provide a complete classification of the quasiderivation, generalized derivation, and $σ$-derivation of the algebra. Finally, we show that, among the four linearly independent infinitesimal deformations, exactly one is integrable, giving rise to a one-parameter family of pairwise non-isomorphic algebras which, with a single exception, also admit only inner derivations.

comments
13
fields
Rings and Algebras
pdf ↗ page arXiv:2610.35015 ↗

We study the interaction between the Lie and Poisson subalgebras of a Poisson algebra. Given a Lie subalgebra $U$ of the underlying Lie algebra $\mathcal P_L$, we consider the Poisson subalgebra generated by $U$, called its {Poisson closure}, and investigate when Lie-theoretic properties such as nilpotency and solvability are preserved under this construction. We also study the stability under Poisson closure of several distinguished Lie subalgebras, including maximal nilpotent and solvable subalgebras, Engel and Cartan subalgebras and the derived algebra. As an application, we investigate Poisson $A$-algebras, defined by the condition that every nilpotent subalgebra is a zero algebra. In the finite-dimensional case, we obtain structural results relating Poisson $A$-algebras to Lie $A$-algebras and to the associative structure of the algebra.

fields
Rings and Algebras
pdf ↗ page arXiv:2610.35463 ↗

We prove that a quiver potential over a field of characteristic zero is finitely determined if and only if the trace space of its Jacobian algebra is finite dimensional. In particular, Jacobi-finite potentials are finitely determined. We further prove that rigid potentials are finitely determined and, over an algebraically closed field, unique up to right equivalence on a fixed quiver. For finitely determined weighted-homogeneous potentials, we give an explicit bound on the jet order sufficient for finite determinacy in terms of the arrow weights, the weight of the potential, and the highest nonzero weight of the trace space of its Jacobian algebra. We also establish new invariance results for weighted-homogeneous potentials under right equivalence.

comments
29 pages, comments are welcome!
fields
Rings and Algebras
pdf ↗ page arXiv:2610.35466 ↗

In this article, we prove that every split simple Chevalley Lie algebra over a finite field of characteristic $p\neq 2$ of classical types $B_n$, $C_n$, and $D_n$, and exceptional types $G_2$, $F_4$, $E_6$, $E_7$, and $E_8$, is $2$-generated. Combined with the result of Cantor, Jezernik, and Zozaya for the classical type $A_n$ [Two-generation of traceless matrices over finite fields, Linear Algebra Appl. (2025)], this establishes $2$-generation for all split simple Chevalley Lie algebras over finite fields of characteristic $p\neq 2$.

fields
Rings and Algebras, Group Theory
pdf ↗ page arXiv:2610.35537 ↗

Complex Variables12

In this paper, we introduce and investigate a parameterized Hankel-type functional $$H_{2,2}^μ(f)=μa_2a_4-a_3^2,\qquad μ\in[0,1], $$ which reduces to the classical second-order Hankel determinant $H_{2,2}(f)$ when $μ=1$. We obtain estimates for $H_{2,2}^μ(f)$ over the class of starlike mappings of order $α$ on the unit ball of a complex Banach space and on the unit polydisk $\mathbb{U}^n$ in $\mathbb{C}^n$. We also establish estimates for $H_{2,2}^μ(f)$ over the class of quasi-convex mappings of type $B$ on the unit ball of a complex Banach space and on the unit polydisk $\mathbb{U}^n$. For $μ=1$, our results recover the corresponding estimates for the classical Hankel determinant and extend the known one-dimensional results of Cho et al. \cite{Cho-2018} and Thomas et al. \cite{Thomas-Tuneski} to higher-dimensional settings.

fields
Complex Variables
pdf ↗ page arXiv:2610.33031 ↗

In this note, we introduce three BMO-type spaces on a locally rectifiable Jordan curve and prove that it is a chord-arc curve if and only if these spaces coincide with equivalent norms.

comments
3 pages
fields
Complex Variables
pdf ↗ page arXiv:2610.33067 ↗

We study quaternionic polynomials whose coefficients may occur on both sides of the variable, using their degree in the four real coordinates. Such polynomials can have no roots, or many more isolated roots than their degree. A simple root has an invertible real derivative, and its sign is the sign of that derivative's determinant. For a radial family, the roots over a non-real target reduce to one real equation. We obtain a sharp root bound and follow a change in the signed root count as roots escape to infinity. The main results concern spherical root sets for which the polynomial derivative is invertible in the two normal directions. Under a small polynomial perturbation, a sphere splits into simple roots corresponding to the zeros of a tangent vector field, when the derivative of that field is invertible at every zero. We obtain a sharp bound in terms of the perturbation degree and a signed count of two or of minus two. For even degrees, the construction yields polynomials with a single leading power and lower-degree terms whose simple root counts, divided by the fourth power of the degree, tend to one as the degree grows. An explicit quartic has 132 simple roots, and this count persists under small coefficient perturbations. For gradient perturbations, the roots correspond to equilibrium directions of an energy on the sphere. This correspondence gives energy thresholds for root disappearance and bounds the critical directions of polynomial orientation profiles in diffusion magnetic resonance imaging.

comments
40 pages, 3 figures, methods and AI statement
fields
Complex Variables
pdf ↗ page arXiv:2610.33082 ↗

We study commutators of Berezin transforms $\mathcal B_α$ associated with radial weighted Fock spaces with exponential weights $e^{-α|z|^{m}}$ on the complex plane. We prove that when $m>2$, the commutator $[\mathcal B_α,\mathcal B_β]$ is compact on the space $L^{2}(\mathbb C, dA)$ whenever $α,β>0$. We further show that if $m>2$ and $α\neqβ$, then the commutator is never of finite rank.

fields
Complex Variables
pdf ↗ page arXiv:2610.33937 ↗

We study the hyperbolically weighted distortion energies \[ \mathcal{I}_p(f)=\int_\mathbb{D} \frac{|μ_f|^p}{(1-|μ_f|^2)^{\max\{2,p\}/2}}\,dA_η\] for finite-distortion disk homeomorphisms with prescribed boundary values, together with the associated inverse problem in the monotone Sobolev class. For $1<p\leq2$, the inverse density is polyconvex precisely when $p\geq p_{\mathrm c}=1+1/\sqrt2$. In this range, quasisymmetric data with finite-energy monotone barriers yield minimisers with holomorphic Ahlfors–Hopf differentials and strong local Sobolev convergence of minimising subsequences. For $p_{\mathrm c}<p<2$, a finite-energy finite-distortion barrier yields a unique absolute monotone minimiser, which is a quasiconformal diffeomorphism and is asymptotically conformal. Together with the boundary-class theorem of Part~I, this characterises the admissible boundary data as $T^p$. The proof combines a selected barrier approximation, uniform scalar gradient estimates and a weighted Reich–Strebel comparison. For $1<p<p_{\mathrm c}$, finite rank-one comparisons bound distortion on the positive-Jacobian set by a cutoff strictly below the ellipticity cutoff. An attained monotone minimum is either a quasiconformal diffeomorphism or has nonzero rank-one derivatives on a set of positive area. For $0<p\leq1$, minimisers with finite distortion, or homeomorphic minimisers with a locally Sobolev inverse, are Möbius maps. We also obtain energy-dependent quasiconformal bounds for regular minimisers when $p>2$. \

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

We construct a smooth embedding of $S^4$ into $\mathbb C^4$ whose CR-singular locus is a connected surface of genus two consisting entirely of nondegenerate hyperbolic points. Its image is locally polynomially convex and admits a basis of smoothly bounded, strongly pseudoconvex Stein tubular neighbourhoods.

comments
12 pages
fields
Complex Variables
pdf ↗ page arXiv:2610.34219 ↗

Let $Ω\subset\mathbb{C}^n$ be a bounded hyperconvex domain admitting a negative plurisubharmonic exhaustion function $u$ such that $-u(z)\le C\exp[-η(\log(1/δ_Ω(z)))]$ near the boundary, where $η$ is nondecreasing with $\lim_{t\rightarrow+\infty}η(t)=+\infty$. We present a lower bound for the Bergman distance $d_{B,Ω}(z_0,z)$ by counting the iterates of a function determined by the generalized inverse of $η$. The bound tends to infinity as $z\rightarrow\partialΩ$ for every such $η$; moreover, it recovers several known estimates. The proof combines a one-sided localization of Green sublevel sets with boundary estimates for the Bergman kernel and a capacity–volume inequality. We also obtain an upper bound for the Bergman distance along the axis of a family of complete Hartogs domains whose fiber radii decay faster than every positive power of the boundary distance in the base disc.

fields
Complex Variables
pdf ↗ page arXiv:2610.34339 ↗

In this note, we give complete description of the Lempert left inverses of the royal and flat geodesics of the symmetrized bidisc. It is further proved that the collection of all such Lempert left inverses to the royal and flat geodesics is path connected. This, in particular, answers a question asked by Zwonek \cite[~Remark 4.4, 4.5]{zwonek}.

comments
Preliminary draft, comments are welcome!
fields
Complex Variables
pdf ↗ page arXiv:2610.34355 ↗

We study a holomorphic analogue of Tischler approximation for closed differential forms normalized by a prescribed holomorphic vector field. The main setting consists of connected normal Stein spaces satisfying a degree-one reflexive Poincaré property, with finitely generated first integral homology and a holomorphic $\mathbb C^*$-action admitting a closed normalized reflexive one-form. Under these hypotheses, the given form can be approximated on compact subsets of the regular locus by closed normalized reflexive forms with discrete period groups. When the first Betti number is at least two, the approximating forms may be chosen with rank-two lattice periods. We relate these approximations to holomorphic locally trivial fibrations over quotients of $\mathbb C$, with connected Stein analytic fibers that may be singular. We also establish a finite-equivariant version for suitable Stein quotients and discuss the associated normalization obstructions, including those arising from local singularity topology. Further results concern closed holomorphic time forms, transverse foliations, and the relation between the period groups and the dynamics of complete holomorphic flows. Examples illustrate both the applicability and the limitations of the hypotheses.

fields
Complex Variables
pdf ↗ page arXiv:2610.34383 ↗

We prove that if $M$ is a connected Stein manifold of complex dimension at least three with the density property, then $M\setminus K$ is a connected Oka manifold for every nonempty compact $K\Subset M$ with smooth boundary whose Levi form has at least two nonnegative eigenvalues at every boundary point for local defining functions negative on $\operatorname{int}K$. For compact sets in $\mathbb{C}^n$ with smooth boundary, this settles both implications between pseudoconvexity of $\partial K$ and the Oka property of $\mathbb{C}^n\setminus K$: pseudoconvexity is sufficient but not necessary for $n\geq3$, and necessary but not sufficient for $n=2$. In dimension two, we give an explicit compact set in $\mathbb{C}^2$ with strongly pseudoconvex boundary and non-Oka complement.

fields
Complex Variables
pdf ↗ page arXiv:2610.34426 ↗

The univalent Bloch-Landau constant $\mathcal{U}$ is the largest number such that, for every univalent function $f$ on the unit disk, $f(\mathbb{D})$ contains a disk of radius $\mathcal{U} |f'(0)|$. We prove $0.612242\le\mathcal{U}<0.6562681$. The previous lower bound, $0.57088586$, came from growth estimates, which control disks centered at $f(0)$. Our improvement rests on a different mechanism. After Landau's normalization, a $2\times2$ compression of the Grunsky matrix constrains every omitted value through the same two coefficients, and choosing the center of the disk from these coefficients exploits this shared information. A short analytic proof based on this idea gives $\mathcal{U}\ge0.592$; it has been formalized in Lean, with the classical Grunsky and Fekete-Szegő inequalities as the only external inputs. Retaining complex quadratic forms of the matrix gives $\mathcal{U}\ge0.612242$ through a finite interval certificate, and this bound holds for every normalized univalent function with $a_2=0$ and $|a_3|\le1/3$. We also show that no argument based on disks centered at $f(0)$ can give a bound above $0.6$. For the upper bound we construct an explicit domain, bounded by Goodman's first two slit generations, thirty analytic arcs and a circle. We certify $\mathcal{U}<0.6562681$ with a capacity estimate for almost critical arcs, improving the best published bound $0.6563937$.

comments
20 pages, 4 figures. Verifiers, data and Lean formalization: doi:10.5281/zenodo.23650159
fields
Complex Variables
pdf ↗ page arXiv:2610.34580 ↗

We prove the Modular Existential Closedness conjecture for the modular $j$-function extended from the upper half-plane to $\mathbb{C} \setminus \mathbb{R}$ by Schwarz reflection. Specifically, we show that any system of equations involving the field operations and $j$ has solutions in the complex numbers unless it is overdetermined. Such a system is overdetermined if, roughly, there are more independent equations than variables, possibly after applying the transformation rules of the $j$-function under the linear fractional action of $\rm{PGL}_2(\mathbb{Q})$ on $\mathbb{C} \setminus \mathbb{R}$. In general, we do not expect overdetermined systems of equations to have solutions due to the algebraic and transcendental properties of the $j$-function captured by the modular analogue of Schanuel's conjecture. In geometric terms, Modular Existential Closedness states that given a broad and free irreducible algebraic variety $V \subseteq \mathbb{C}^n \times \mathbb{C}^n$ -- where broadness and freeness are geometric conditions guaranteeing that the system is not overdetermined -- there is a point of the form $(τ_1, \ldots, τ_n, j(τ_1), \ldots, j(τ_n)) \in V$ with $τ_i \in \mathbb{C} \setminus \mathbb{R}$. The proof uses Ratner's theorems on the closure and equidistribution of the orbits of unipotent flows in powers of $\rm{PGL}_2(\mathbb{R})$ to describe the asymptotic behaviour of the orbits of certain analytic maps. This is then applied to approximate a relatively simple system of equations using the original system and the action of $\rm{PGL}_2(\mathbb{Z})$. The construction of the limiting system makes use of the Ax–Schanuel theorem and guarantees an isolated solution. Rouché's theorem then establishes the existence of solutions for the original system of equations.

comments
36 pages, 5 figures
fields
Complex Variables, Dynamical Systems, Logic, Number Theory
pdf ↗ page arXiv:2610.35409 ↗

Quantum Algebra10

We realize classical cumulants and their fixed-point equations in the double tensor unshuffle Hopf algebra introduced by Ebrahimi-Fard and Patras, placing classical, free, Boolean, and monotone cumulants in a common algebraic framework. A concatenation perturbation of the functionals yields left and right half-shuffle equations on ordinary words without changing the coproduct or either half-coproduct. Both equations are equivalent to the classical moment–cumulant formula and uniquely determine the classical cumulants. We also obtain a Hopf-algebraic realization of the classical-to-free cumulant transform through convolution exponentiation and the left half-shuffle logarithm. A commutative diagram identifies its partition-level action with summation over non-crossing closure fibers, recovering Lehner's closure-fiber formula within the framework of the double tensor unshuffle Hopf algebra.

comments
29 pages
fields
Quantum Algebra
pdf ↗ page arXiv:2610.33382 ↗

An $SU_q(2)$-covariant first-order differential calculus on the non-standard quantum Podleś two-sphere is constructed. The module of one-forms is explicitly given in terms of modules of sections of charge $\pm 2$ line bundles associated to the quantum Hopf fibration.

comments
10 pages; submitted to the proceedings of XLIII Workshop on Geometric Methods in Physics, Białystok 2026
fields
Quantum Algebra
pdf ↗ page arXiv:2610.33572 ↗

Let $V$ be a strongly rational vertex operator algebra and $G\leq\operatorname{Aut}(V)$ a finite group. Using the $G$-crossed braided fusion structure of twisted modules constructed in \cite{Crossed}, we prove that the conformal twist $e^{2πiL(0)}$ gives a crossed ribbon structure and that the crossed category is modular in Kirillov's sense. Consequently, its equivariantization is a modular tensor category. We also obtain dimension and simple-object counting formulas for the twisted sectors.

fields
Quantum Algebra
pdf ↗ page arXiv:2610.34193 ↗

We prove that the cofree Hopf algebra on a cocommutative bialgebra is again cocommutative, and in fact coincides with the latter's largest Hopf subalgebra. This answers a question of Ardizzoni-Menini-Saracco and provides a proof for a statement to the same effect in the literature, whose original justification contains an apparent gap. The result relies on (and is in fact equivalent to) the observation that cocommutative bialgebra quotients of arbitrary Hopf algebras are automatically Hopf. This latter statement strengthens the analogue due to Newman, which assumes cocommutativity for the Hopf domain. One application of the above is the following quantum-rigidity result for Hopf algebras acted upon by a covariant quantum group: an action by one Hopf algebra on another which preserves the unital-algebra structure and the comultiplication factors through an action by a cocommutative Hopf algebra which moreover preserves the entire Hopf structure.

comments
3 pages + references
fields
Quantum Algebra, Category Theory, Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2610.34332 ↗

We establish a Faithfulness Theorem for vertex algebra modules, showing that two complementary geometric localizations can jointly detect global algebraic structure. We apply this principle to vertex algebras obtained by BRST reduction from classical invariant theory and identify them, under natural geometric hypotheses, with global sections of sheaves of chiral differential operators. As consequences, we prove vanishing of BRST cohomology in nonzero degrees and simplicity, and show that every finitely strongly generated module is a finite direct sum of copies of the vacuum module. In particular, the corresponding module category is equivalent to the category of finite-dimensional vector spaces. For families associated with classical groups, we identify the associated varieties with Hamiltonian reductions, proving quasi-lisse-ness and the predicted identification with Higgs branches of the corresponding supersymmetric gauge theories. This provides geometric realizations of a broad class of vertex algebras arising from three- and four-dimensional quantum field theories.

comments
40 pages, Comments are welcome!
fields
Quantum Algebra, Mathematical Physics, Algebraic Geometry, Representation Theory, Symplectic Geometry
pdf ↗ page arXiv:2610.34953 ↗

We study the Duflo–Serganova functor for vertex algebras of chiral differential operators on classical invariant rings, introduced in \cite{ADS}. Our main result is a general cancellation theorem showing that a common bosonic and fermionic summand can be removed by Duflo–Serganova reduction. We apply this theorem to obtain Duflo–Serganova reduction isomorphisms for two families of simple orthosymplectic affine vertex superalgebras at levels $-2n$ and $n$, which are not covered by the existing results of Gorelik and Serganova. As a consequence, we obtain supercharacter identities, including the conjecture of Adamović and Milas as a special case.

comments
7 pages, comments are welcome
fields
Quantum Algebra
pdf ↗ page arXiv:2610.34954 ↗

Deformation quantizations of the moduli space of framed flat bundles live naturally in the Drinfeld category. Such quantizations were constructed using the so-called quantum fusion by Li-Bland and Ševera. We give a complete characterization of the dependence of this quantization on combinatorial choices, and prove that these quantizations are all isomorphic, forming vertices of an explicitly constructed complete commuting graph of algebra isomorphism. To this end, we extend the Kontsevich integral methods of Le and Murakami from even associators to all associators. Finally, we also prove that bi-invariant Haar measures provide traces on these quantizations.

comments
42 pages, many figures. First version, comments are welcome
fields
Quantum Algebra, Mathematical Physics, Symplectic Geometry
pdf ↗ page arXiv:2610.35446 ↗

We study circle relations in the higher-level Zhu algebra of a vertex operator algebra $V$. For regular vacuum words in homogeneous letters, we prove the termwise correction-residue conjecture of Part I: every correction in the one-sided iterate expansion belongs separately to the finite-length plus subspace. The first correction formed with the left truncated field vanishes identically. Multiplying the diagonal commutator kernel by a power of $1+x$ turns it into a Laurent polynomial. This proves the vanishing and writes every other correction as a finite combination of product residues with fewer $Y_L$ factors, coming from the word obtained by replacing one negative mode by a nonnegative one. These results hold at all levels $n\ge0$, without an auxiliary-degree hypothesis. For $n\ge1$ and a homogeneous ordered pair $(u,v)$, two explicit triangular families span the quadratic residue operators modulo the length-one and singular-iterate relations, giving $\dim\mathcal{Q}_n((u,v))\le n(n+1)$. The universal product-coefficient arrays have dimension exactly $n(n+1)$ and three natural bases; restriction to the regular mode square is an isomorphism. This proves operator spanning and gives invertible matrices for two complementary diagonal eliminations. For equal inputs, mode interchange reduces the families to their odd-indexed members, giving $\dim\mathcal{Q}_n((u,u))\le 2\lfloor (n+1)^2/4\rfloor$. The pairwise estimates give an explicit global quadratic bound for any finite homogeneous strong generating set. Heisenberg, Virasoro, and affine $\mathfrak{sl}_2$ examples illustrate equality and strict inequality in the operator bounds.

comments
43 pages. Companion paper to arXiv:2610.19501 (Part I). Ancillary files: exact-arithmetic Python checks and a note with explicit quadratic recurrences
fields
Quantum Algebra
pdf ↗ page arXiv:2610.35527 ↗

We determine the Grothendieck rings of fusion categories over $\mathcal{C}$ containing a nonpointed Tambara–Yamagami fusion subcategory and exactly one further simple object. The subcategory necessarily has rank five, its invertible objects form the Klein four-group, and the coefficient $κ$ of the additional simple object in its tensor square belongs to $\{0,2,7\}$. Each of these three based rings is categorifiable. For $κ=0$, every category belongs, up to tensor equivalence, to the rank-one odd-component extension list of Choi–Lu–Sun. For $κ=2$ we construct an explicit unitary group-theoretical realization, and for $κ=7$ a realization is $\rm{Rep}(\rm{PSU}(3,2))$.

comments
31 pages
fields
Quantum Algebra, Mathematical Physics
pdf ↗ page arXiv:2610.35574 ↗

It is known due to a result of Miyamoto that zero mode correlators of weight $1$ vectors of vertex operator algebras are quasi-modular forms, and that their generating series are Jacobi forms. In this article we generalize this to higher weight vectors. We consider weight 2 vectors that generate what we call heavy Heisenberg algebras. We prove that their zero mode correlators are a specific type of quasi-modular forms. As a consequence, they too can be summed up into a generating series with Jacobi-like modular transformation properties. As an application of our results, we sketch an argument that gives the asymptotic behavior of the dimensions of states of our VOAs.

fields
Quantum Algebra
pdf ↗ page arXiv:2610.35749 ↗

Algebraic Topology8

Motivated by Teleman's study of gauged topological quantum field theories, our main result is an analog of Elmendorf's theorem in the setting of simplicial group actions on $\infty$-categories. In particular, we prove that if $G$ is a simplicial group, there is a Quillen equivalence between the homotopy category of $\infty$-categories with $G$-action and the homotopy category of $\infty$-category-valued presheaves on the orbit category of $G$. We also show an analog of Whitehead's theorem in this setting.

comments
20 pages
fields
Algebraic Topology, Representation Theory
pdf ↗ page arXiv:2610.33183 ↗

For an $\mathbb{E}_{\infty}$-ring spectrum $R$ of chromatic height $k$, the trace method and the chromatic redshift imply that $T^n$-fixed point of $n$-fold iterated topological Hochschild homology of $R$ has chromatic height at most $k+n$. In this paper, we compute these heights for $H\mathbb{F}_p$, $H\mathbb{Z}$ and the $p$-complete connective image-of-$J$ spectrum $j_p$ for all primes and $n\geq1$, which are exactly $n-1$, $n$ and $n+1$, respectively. Our method is based on properties of Wilson spaces and relative topological Hochschild homology over $\mathrm{MU}$.

comments
13 pages
fields
Algebraic Topology
pdf ↗ page arXiv:2610.33534 ↗

We study $\mathbf{E}_n$-algebras with ramification in their $π_0$ and in particular show that the existence of ramification places strong limitations on their chromatic behavior. In particular, we show that $π_0$ of nonzero $K(1)$-local $\mathbf{E}_4$-$\mathrm{KU}$-algebras cannot have a map from the ring of integers in a ramified extension of $\mathbf{Q}_p$, and we show that a $p$-complete $\mathbf{E}_2$-ring with a map from a perfectoid ring into its $π_0$ is an associative $\mathbf{Z}_p$-algebra.

comments
10 pg
fields
Algebraic Topology, Algebraic Geometry
pdf ↗ page arXiv:2610.33754 ↗

We recast the theory of power operations in chromatic height $1$ using higher semiadditivity. In particular, we show that if the height $1$ cyclotomic extension of a commutative algebra $R$ is Galois, then power operations on $R$-algebras are exactly $δ$-ring operations. We also show that semiadditive power operations on chromatically localized algebraic $K$-theory agree with power operations defined using polynomial functoriality. As an application, we deduce that the map from the $K$-theory of a $\mathbb{Q}$-linear symmetric monoidal category to its $K(1)$-localization is a $δ$-ring homomorphism on the level of underlying spaces. It is well known that operations on the $K$-theory of $\mathbb{Q}$-linear symmetric monoidal categories are $λ$-ring operations, and since $δ$-rings are `$p$-typical' $λ$-rings, this is an instance of the redshift philosophy.

comments
38 pages, comments are welcome!
fields
Algebraic Topology
pdf ↗ page arXiv:2610.34992 ↗

Based on the theory of multicomplexes and other ideas by Gromov, we describe the flipping principle. This is an easy geometric criterion that forces the vanishing of the Gromov norm of homology classes. We use it to provide proofs based on a common geometric principle of the Vanishing Theorem and the Amenable Reduction Lemma by Gromov in the case of amenable and boundedly acyclic covers and colorings. We also strengthen the conclusion of the Amenable Reduction Lemma by showing that it implies the $\ell^1$-invisibility of the homology classes and not only the vanishing of their Gromov norm.

comments
28 pages
fields
Algebraic Topology, Group Theory, Geometric Topology
pdf ↗ page arXiv:2610.35222 ↗

Generalizing known results for $G=C_2$ and constant $\underline{\mathbb{F}}_2$-coefficients, we show the $RO(G)$-graded Bredon cohomology of a point with constant $\underline{k}$-coefficients is self-injective whenever $G$ is a finite subgroup of $SO(3)$ and $k$ is a finite field. Self-injectivity holds more generally for the $RO(G)$-graded homotopy of the Eilenberg–MacLane spectrum associated to a $k$-linear commutative Green functor $M$, whenever the spectrum $HM$ is Anderson self-dual.

comments
14 pages
fields
Algebraic Topology
pdf ↗ page arXiv:2610.35351 ↗

In this paper, we give complete classifications of the finite groups $G$ for which the constant Eilenberg–Mac Lane spectra $H\underline{\mathbb Z}$ and $H\underline{\mathbb F}_2$ are Anderson self-dual up to a virtual representation shift, and we determine all such shifts. For both of these spectra, we determine the representation periodicity lattice for every finite group. As applications, we obtain $RO(G)$-graded universal coefficient theorems relating equivariant homology and cohomology, together with formulas for the Anderson duals of $H\underline{\mathbb Z}$-modules. In the $H\underline{\mathbb F}_2$ self-dual cases, we identify the graded $\mathbb F_2$-linear dual of the coefficient ring $π_\star^G H\underline{\mathbb F}_2$ with a representation shift of the ring as a module over itself. This gives perfect multiplication pairings and graded self-injectivity.

comments
54 pages, comments welcome!
fields
Algebraic Topology
pdf ↗ page arXiv:2610.35796 ↗

We demonstrate that higher categories with adjoints behave like homotopy types. By the homotopy hypothesis, homotopy types can be regarded as higher categories in which all cells are invertible. We show that replacing invertibility by the existence of higher adjoints still supports a homotopy theory that is at least as rich as classical homotopy theory. The basic invariants of this theory are the homotopy monoidal categories \[ Π_n(X,x)=\operatorname{Ho}\bigl(Ω^n(X,x)\bigr) \] associated to a based $(\infty,\infty)$-category with adjoints $(X,x)$. These invariants are monoidal categories with duals and replace iterated loops with iterated endomorphisms. The classical homotopy groups of the classifying space are recovered as the isomorphism classes of objects in the groupoid completion. We prove a Whitehead theorem for homotopy monoidal categories and show that fibrations of higher categories give rise to long oriented exact sequences of homotopy monoidal categories. To develop homological algebra of higher categories with adjoints, we prove an equivalence between skeletal sequences of categorical spectra with adjoints and categorical chain complexes, extending a result outlined by Lurie in the proof of the cobordism hypothesis.

fields
Algebraic Topology
pdf ↗ page arXiv:2610.35861 ↗

Commutative Algebra6

A finite poset is the prime spectrum of a Noetherian ring exactly when it has no chain of three elements, that is, it is the poset of a finite bipartite graph. This answers Conjecture 5.3 of Alkass. The substance is a construction: minimal elements become curves y=g_i(x), maximal elements points, edges the incidences, arranged by interpolation. The coordinate ring of the union of the curves, localized at the chosen points, is essentially of finite type over Q and of dimension at most one. Dropping finiteness costs two conditions, both isolated by Colbert: a poset with no chain of three elements is a Noetherian spectrum exactly when it has finitely many minimal elements and any two distinct ones have finitely many common upper bounds. A variant keeping the shape of the ideals of Alkass but changing their exponents shows why that construction produces only nested neighborhoods. Constraining the ring destroys most of this freedom: normal rings leave finite disjoint unions of stars, domains a single star, local rings a point or a finite co-star. In height two the question is open in general, but the conditions conjectured by Wiegand and Wiegand are not sufficient

comments
23 pages, 1 figure
fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2610.33675 ↗

We give a combinatorial characterization of the $\rm{v}$-number of a $t$-closed neighborhood ideal associated to a graph $G$, and investigate its relation with other invariants such as the $t$-domination number and the smallest size of a ball of radius $t$ in the graph $G$. We present several new cases where it is satisfied that the $\rm{v}$-number is bounded above by the Castelnuovo-Mumford regularity. We analyze the behavior of the $\rm{v}$-number of a $t$-closed neighborhood ideal with respect to the parameter $t$. Lastly, we compute explicit formulas for the $\rm{v}$-number in the case of paths, cycles, and caterpillars, and analyze the case of Hamming graphs.

comments
Comments are welcome
fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2610.33858 ↗

We establish a finite-basis theorem for radical well-mixed difference ideals in a difference polynomial ring with one endomorphism over an arbitrary difference field. The result extends to every finitely difference-generated difference algebra over such a field and is equivalent to the ascending chain condition for radical well-mixed difference ideals, hence resolving a long-standing open problem in difference algebra. The proof proceeds in two stages. Over an inversive difference coefficient field, we establish a uniform inverse-transform bound relating the perfect closure of a finite system to its radical well-mixed closure. This uses Noetherian induction in a fixed truncated polynomial ring, together with generic freeness and going-down for flat ring homomorphisms. We then prove that the radical well-mixed closure of a system over a difference field $K$ is the contraction of its radical well-mixed closure over the inversive closure of $K$. This contraction result follows from successive prime lifting along flat extensions and removes the inversiveness assumption without requiring the coefficient-field extension to be finitely generated.

comments
15 pages
fields
Commutative Algebra, Rings and Algebras
pdf ↗ page arXiv:2610.34389 ↗

Hyperplane arrangements are rich combinatorial, topological, and geometric objects with numerous applications. Apolarity is a method of turning a homogeneous polynomial into a finite graded Gorenstein algebra. Invariants of the apolar algebra of the defining equation of a hyperplane arrangement are invariants of the arrangement itself. We investigate such invariants, including the Hilbert function, minimal generators of the apolar ideal, and Lefschetz properties. The main focus of the article is on combinatorially general arrangements of degree d in dimension n with d between n and 2n-2. In this range, we determine the Hilbert function and conjecture that the same formula is valid for larger values of d too. Minimal generators of the apolar ideal in the initial degree are in natural bijection to the lines of the arrangement. The initial degree characterizes arrangements that are combinatorially general. Finally, we prove that the apolar algebra has the Weak Lefschetz Property and precisely characterize the Weak Lefschetz elements.

comments
33 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2610.34517 ↗

Let f $\in$ C[x, y] be a trinomial and let g $\in$ C[x, y] be a sparse polynomial with N monomials (N $\ge$ 1). We address the problem of bounding the local intersection multiplicity of the bivariate polynomial system f = g = 0 at an isolated root q $\in$ (C * )^ 2 only in terms of N . Our main result establishes that the local multiplicity of the system at any isolated solution q $\in$ (C * ) ^2 is at most (N -1)(N +2)/ 2 , independently of the degrees of f and g. Furthermore, we know that this bound is sharp for N = 3.

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

In this paper we give positive criteria and counterexamples to a question of Cid-Ruiz on whether intrinsic polar multiplicities detect reductions of modules. Over an excellent regular local surface with infinite residue field, we compute the entire polar sequence of every finite-colength submodule of a free module, showing that its only variable entry is the order of the determinant ideal. This computation yields classes for which equality of polar multiplicities characterizes reduction, while also producing counterexamples in every positive rank, including integrally closed modules with identical intrinsic Hilbert functions and arbitrarily large relative Buchsbaum–Rim multiplicity. In arbitrary dimension, we prove that, under equidimensionality and a sharp dimension bound on the kernel of the induced map of associated graded Rees algebras, equality of the sums of the polar multiplicities characterizes reduction.

fields
Commutative Algebra
pdf ↗ page arXiv:2610.35281 ↗

Logic6

Let $λ$ be a Magidor cardinal and let $α\in[α_M,λ)$. We show that $λ\rightarrow[λ]^{\aleph_0-bd}_{α,<α}$. We prove the consistency of a similar statement for Jónsson cardinals.

fields
Logic, Combinatorics
pdf ↗ page arXiv:2610.34189 ↗

We propose a typed lambda calculus based on quantum logic. We first present a natural deduction system for quantum logic with the Sasaki hook as its implication operation and then formulate a typed lambda calculus connected to this system through the Curry-Howard correspondence. We prove soundness and completeness of the former with respect to orthomodular lattices and strong normalization of the latter. The resulting lambda calculus has the characteristic feature that only one assumption is available in the typing derivation that serves as the premise of $λ$-abstraction. Under this restriction, ordinary currying is not available in general, but it is still possible to perform $λ$-abstraction by combining multiple assumptions into a single argument of product type and to construct a term corresponding to a deduction using the Sasaki projection.

fields
Logic
pdf ↗ page arXiv:2610.34266 ↗

What does a recursive definition mean when the logic is grounded, so a sentence is true only if a terminating process makes it so? Kripke's answer for the special case of truth was the least fixed point. This paper takes that answer as a rule. Reflective Grounded Arithmetic (RGA) already writes any recursive definition as one self-referential term, paradoxes included. Inductive Grounded Arithmetic (IGA) adds the elimination rule for every positive one, so that accessibility, the winning positions of a game, and grounded truth itself each come with their own induction principle. The rule is sound for the omega model and the system is consistent, both machine-checked in Isabelle/HOL. With the rule, IGA proves Goodstein's theorem outright, in a logic without implication at an undecided hypothesis, and the Kirby-Paris hydra game for primitive recursive strategies, both with every step of the arithmetic a grounded derivation. It proves the Cantor normal forms well-founded, from which the well-foundedness of the standard $\varepsilon_0$ notation system in HOL follows, and it certifies the Veblen notation as an ordinal below every $\varphi(n,0)$. It defines Kripke truth for RGA's own language as one fixed point that agrees with the omega model exactly. Two equivalences locate what the classical world has and the grounded one does not. IGA proves the whole Veblen notation well-founded exactly when it admits bivalence of accessibility for that order, and bivalence of accessibility for an order is sound exactly when the order is well-founded; so $Γ_0$ lies at most one instance of excluded middle away, at the accessibility predicate of the notation, and that instance, the well-foundedness sentence and one membership claim in a primitive-recursive form of Kleene's $\mathcal O$ are interderivable over IGA.

fields
Logic
pdf ↗ page arXiv:2610.34548 ↗

We show that if $κ^{<κ} = κ$, then there is a $κ$-strategically closed, $κ^+$-c.c.\ partial order that forces $\square_κ$. We discuss consequences for generic large cardinals.

fields
Logic
pdf ↗ page arXiv:2610.34900 ↗

We determine the Borel-reducibility comparison of each pair of $\mathbfΠ^0_3$ benchmark equivalence relations in Gao's monograph. The additional comparisons we prove are $E_\infty\leq_B c_0$, $E_\infty\nleq_B\ell_p$ for $2<p<\infty$, $\ell_p\nleq_B{\equiv_m}$ for $2<p<\infty$, $c_0\nleq_B{\equiv_m}$, $c_0\nleq_B\ell_\infty^+$ and $\equiv_m\nleq_B\ell_\infty^+$. Together with the previous positive direction, these give $\ell_p\leq_B{\equiv_m}$ if and only if $p\leq2$. These answer several questions in Gao's monograph and Kanovei' monograph. We also prove that unitary equivalence of all bounded linear operators is not Borel reducible to $\equiv_m$. This answers a question of Ding and Gao. Equivalently, unitary equivalence of arbitrary representations of $F_\infty$ is strictly more complicated than that of arbitrary representations of $\mathbb Z$. This answers a question of Thomas.

comments
41 pages
fields
Logic, Functional Analysis
pdf ↗ page arXiv:2610.35025 ↗

The validity problem for first-order logic is a well-known undecidable problem. The undecidability also holds even for $\mathsf{FO}3$ and (equational formulas of) the calculus of relations. In this paper we tighten these undecidability results to the following: (1) $\mathsf{FO}3$ with just one binary relation is undecidable even without equality; and (2) the calculus of relations with just one character and with only composition, union, and complement is undecidable. Additionally we prove that the finite validity problem is also undecidable for the above two classes.

comments
Long version of the paper at ICLA'19, with (Ax.1) and (Ax.2) in Section 3 corrected
fields
Logic
pdf ↗ page arXiv:2610.35770 ↗

Symplectic Geometry6

We construct an elliptic analogue of the Alekseev-Meinrenken path fibration \cite{alekseev2009atiyah} for a simply connected complex Lie group with a nondegenerate invariant symmetric bilinear form. A natural $2$-form on the correspondence space induces a holomorphic symplectic groupoid over the space of $(0,1)$-connections and a holomorphic quasi-symplectic groupoid over the holomorphic loop group. The correspondence space defines a principal holomorphic Morita bibundle with compatible differential forms.

fields
Symplectic Geometry, Differential Geometry
pdf ↗ page arXiv:2610.33793 ↗

For a Hermitian line bundle $E\to Y$ over a Riemannian manifold $(Y^n,g)$, the self-dual Abelian–Higgs energy is defined by $ \En^Y_{\eps,g}(u,a)=\frac1{2π}\int_Y \left(|\nabla_a u|_g^2+\eps^2|F_a|_g^2+ \frac{(1-|u|^2)^2}{4\eps^2}\right)dV_g, $ where $u$ is a smooth section of $E$, $a$ is a unitary connection, and $F_a$ is its curvature. Pigati and Stern studied the energy as a codimension-two analogue of the Allen–Cahn energy to study minimal submanifolds in a Riemannian manifold. In this paper, we use this functional to define a nondecreasing sequence of symplectic capacities $\{c_k^{\AH}\}_{k\ge1}$ in dimension four by a min–max construction. In particular, we prove that $c_1^{\AH}$ is normalized on the ball and the cylinder. For the upper bound on the cylinder, we combine Gromov's theory of families of $J$-holomorphic spheres with Taubes's planar vortex. For the lower bound on the ball, we use the properties of the Abelian–Higgs theory developed by Pigati–Stern, together with a geometric estimate on smooth approximations to the double of the ball and an equivariant deformation of low energy sublevels. These estimates give the normalization without Seiberg–Witten theory. We then use Seiberg–Witten moduli spaces on $\CP^2$ and $S^2\times S^2$ to prove an upper bound on the higher capacities of balls and the formula $c_k^{\AH}(Z^4(a),ω_0)=ka$. We also prove Euclidean Weyl laws for the capacity sequence and for the min–max sequence with the standard Euclidean metric. For these results, we construct AH sweepouts from moduli spaces of the solutions to the perturbed Seiberg–Witten equations.

comments
47pages
fields
Symplectic Geometry, Differential Geometry
pdf ↗ page arXiv:2610.34062 ↗

We construct several families of torus equivariant Poisson structures on moment-angle manifolds and their quotients such as quasitoric manifolds. We study the symplectic foliation and Poisson cohomology groups associated with these structures.

comments
41 pages, comments are welcome
fields
Symplectic Geometry, Differential Geometry
pdf ↗ page arXiv:2610.34090 ↗

For every integer $n\ge5$, we construct a closed aspherical symplectic manifold of real dimension $2n$ with positive first Chern degree. Each example is a flat torus bundle over the same compact hyperbolic surface, with arithmetic monodromy arising from an explicit indefinite quaternion division algebra over $\mathbb{Q}$. We identify its symplectic first Chern class with the pullback of the canonical class of the base and compute its degree explicitly. Asphericity rules out nonconstant pseudoholomorphic spheres for every tame almost complex structure. Thus these examples give a negative answer to the symplectic uniruledness question of Boucksom–Demailly–Păun–Peternell in every even real dimension at least ten.

comments
10 pages, comments are welcome!
fields
Symplectic Geometry, Differential Geometry, Geometric Topology
pdf ↗ page arXiv:2610.34998 ↗

The topological vertex computes all genus amplitudes for the open topological A-model in $\mathbb{C}^3$ with branes on three toric Lagrangians and, via gluing, both open and closed string amplitudes on any toric Calabi-Yau threefold. In this note we show that the topological vertex is generated by boundary interactions of three disks and three annuli. A generalization of this result is shown to hold for the refined topological vertex.

comments
7 pages
fields
Symplectic Geometry
pdf ↗ page arXiv:2610.35719 ↗

We introduce a notion of size for an overtwisted disk, defined in terms of the Shelukhin-Hofer energy required to stabilise Legendrians in its vicinity. We compute this size for the standard $3$-dimensional overtwisted disk, which we use to prove that certain explicit product hyperdisks in higher-dimensional contact manifolds are overtwisted (and their overtwisted size can be computed explicitly as well). We then use the overtwisted size to establish a number of quantitative results on contact flexibility. Concretely, we (1) obtain quantitative $h$--principles for Legendrians in the complement of an overtwisted disk, (2) construct overtwisted-at-infinity contact manifolds whose Legendrian Shelukhin-Hofer metric vanishes, (3) estimate overtwisted size under contact products and under products with Liouville manifolds, and (4) derive action bounds for contractible Reeb orbits in closed overtwisted contact manifolds.

comments
45 pages
fields
Symplectic Geometry
pdf ↗ page arXiv:2610.35755 ↗

Category Theory5

We generalize to the enriched setting the classical theorem of Freyd, that the free cocompletion ${\mathscr PA}$ of a category ${\mathscr A}$ is complete if and only if ${\mathscr A}$ is approximately complete. The work of Day and Lack, arXiv:math/0610439, has laid the foundations for such a generalization and has had multiple applications in homotopy theory and in category theory. Our result allows us to expand on some of these applications.

comments
14 pages
fields
Category Theory, Algebraic Topology
pdf ↗ page arXiv:2610.33543 ↗

In this paper, we show how to associate a family of binary linear block codes to the class of admissibly cofinitary objects in any proto-exact category with rank function. This family naturally generalizes the well-studied family of binary Reed-Muller codes, and recovers this classical family for suitable choices of category. We also expand the list of known examples of proto-abelian categories to include incidence categories of posets. As an application of this result, we construct a binormal, combinatorial, proto-abelian category of Kashiwara crystals associated to any root system. In the case that the proto-exact category is a category of $\mathbb{F}_1$-representations of quivers, we show how to reconstruct our family via the language of algebraic geometry codes, in particular motivating an extension to arbitrary finite fields. We provide explicit computations of the dimension and minimum distance for select families of $\mathbb{F}_1$-representations of quivers.

comments
32 pages
fields
Category Theory, Combinatorics, Representation Theory
pdf ↗ page arXiv:2610.33903 ↗

From the perspective of homological algebra, exact categories are interesting because they possess derived categories. Typically, an additive category admits many exact structures. If the original category is sufficiently nice (for example, quasi-abelian), a classification of exact structures can be given in terms of certain Serre subcategories in the category of contravariant functors. It turns out that the derived categories of different exact structures are functorially related. This work is concerned with sufficient conditions for the derived equivalence of different exact structures on certain categories.

journal
Advances in Systems Science and Applications, 2026(1), 97-117
fields
Category Theory, Representation Theory
pdf ↗ page arXiv:2610.34363 ↗

We compare homological and homotopical epimorphisms of associative algebras in monoidal $\infty$-categories. Assume that geometric realizations and pushouts of associative algebras exist and that tensoring preserves geometric realizations. Then every homological epimorphism is homotopical. If, in addition, the ambient category is additive and tensoring preserves finite coproducts, the converse holds. This extends the result of Chuang and Lazarev for dg-algebras. In the symmetric monoidal setting, we discuss consequences for centers and commutative refinements, as well as applications to derived analytic geometry.

fields
Category Theory, Algebraic Geometry, Rings and Algebras
pdf ↗ page arXiv:2610.34592 ↗

We introduce a new secondary cohomology operation, the naturality defect product, associated with a graded natural transformation between the cohomology functors of two differential graded functors, and study its main properties. We then prove that a pretriangulated category satisfies the octahedral axiom if and only if the naturality defect product associated with the natural isomorphism given by a theorem of Heller vanishes on the homotopy category of acyclic complexes over it. This characterization extends immediately to n-angulated categories. As an application, we exhibit non-vanishing instances for the recently found examples of pretriangulated categories which are not triangulated. Finally, we show that horizontal composition of these natural isomorphisms preserves n-angulated structures, and we use it to obtain, from each of these examples and for every r >= 1, a pre-3r-angulated category which is not 3r-angulated.

comments
32 pages
fields
Category Theory, K-Theory and Homology, Representation Theory
pdf ↗ page arXiv:2610.35232 ↗

History and Overview5

John Dee's Monas Hieroglyphica (Antwerp, 1564) contains twenty-four numbered theorems about a single composite alchemical glyph, presented in the manner of Euclid: theorem, demonstration, corollary. In this note the following question is considered: which of Dee's theorems can be stated precisely in a proof assistant, and which of them can then be proved? Working in Lean 4 (v4.35.0) with the core library only (without Mathlib), we divide the treatise into three layers: the syntax of the glyph, encoded as inductive data; Dee's arithmetic, verified by kernel computation; and the geometry of the final theorems, in connection with which we prove a classical result not stated by Dee: no ratio of whole numbers doubles the cube, that is, the cube root of two is irrational (the Delian obstruction). The accompanying file Monas.lean compiles with no errors and no sorry. Two observations are made. The cabalistic computation of Theorem XVII, according to which the Cross, "by the best kabbalistic computation," signifies the number 252, is verified, and its proof depends on no axioms: it is a pure computation. The only theorem of the formalisation with genuine mathematical content, the Delian obstruction, is proved constructively and depends only on the axioms propext and Quot.sound.

comments
13 pages, 3 figures. The Lean 4 source is included as an ancillary file
fields
History and Overview
pdf ↗ page arXiv:2610.33104 ↗

This expository paper grew out of two lectures in Miller's Math 409: The little Questions (Williams College, Fall 2026). We explore fractional derivatives by asking what a ``half-derivative'' might mean if applying it twice is to recover an ordinary derivative. Linearity and a natural guess for the half-derivative of a power function lead to a functional equation related to the classical factorial recurrence. Choosing the familiar Gamma-function extension gives the classical formula \[ \mathscr{D}^{1/2}(x^n) \ =\ \frac{Γ(n+1)}{Γ(n+\tfrac12)}x^{n-1/2}. \] We derive $Γ(n+1)=n!$, evaluate $Γ(1/2)=\sqrtπ$ using the Gaussian integral, and verify the half-derivative formula with an elementary integral. Along the way, we explore how the Gamma function generalizes factorials and binomial coefficients beyond their classical domains, encounter the double factorial, see why the usual product rule fails, and examine the half-derivative of $e^x$. We also explain why the original requirements do not determine a unique operator. The treatment emphasizes motivation, the benefits of experimentation through accessible calculations in test cases, rather than the general theory of fractional calculus.

comments
21 pages, 0 figures
fields
History and Overview
pdf ↗ page arXiv:2610.34546 ↗

Asked what an event is, pupils often answer with a fraction. This paper argues that school probability should separate two learnings and order them: the algebra of events (random experiment, outcomes, sample space, events as sets of outcomes, the operations not, or, and) and the probability measure, which attaches a number to each event. Before learning to compute the probability of an event, pupils should learn to build, identify and handle the event. The thesis rests on the structure of finite probability, in which the rules are facts about events carried over by an additive function, and on the history of the subject, in which errors such as d'Alembert's two tosses concerned the weighting of outcomes and were resolved by refining events into equally likely outcomes. Five design principles are stated: two objects with two names; the event before its probability; modal judgements (certain, possible, impossible) on sets before numbers; the algebra of events taught as such, with the rules derived from it; the sample space as a modelling choice, with frequencies last, as statistical estimates, and the separation repeated for conditional probability and random variables. They are confronted with the probability chapters, from age 9 to 18, of the French-curriculum courses published at https://commeunjeu.org, with research and other curricula. In primary school events precede probabilities without set notation, which comes at age 12; the lessons apply the principles and prove the rules from events in lower secondary school. But, in the version analysed, events account for 18 to 44 percent of the exercises, proofs are hidden in upper secondary school, and automatically corrected calculations record only the number. It proposes number-free tasks on events for ages 6 to 8 and changes to the International Baccalaureate curriculum. No empirical evaluation is reported; hypotheses are stated.

comments
30 pages, 5 figures, 7 tables. CC BY 4.0
fields
History and Overview
pdf ↗ page arXiv:2610.34803 ↗

In the autumn of 2026, mathematics is facing what may be the deepest crisis in its history. The entire ecosystem through which mathematical knowledge is produced, validated, communicated, and assessed is beginning to break down. Mathematics departments, those usually quiet and civilized places, are suddenly in turmoil -- the unlikely theaters of a new Battle of the Ancients and the Moderns. The source of the crisis is clear: AI systems have become better than even the best human mathematicians at proving and validating mathematical results. This document proposes a metaphor for mathematical activity: we once thought of ourselves as mountain climbers; soon, we may become miners digging in the mathematical mine, either collaborating or competing with mathematical AI machines. Publications would then be seen primarily as a means of helping humans understand mathematics, while the measurement of mathematical progress would be entrusted to a Mathematical Universal Machine. In nontechnical terms, we explore what this brave new world of mathematics might look like and how we might collectively shape its future.

fields
History and Overview
pdf ↗ page arXiv:2610.35263 ↗

We give a summary of a large group activity presented to primary school children as part of a STEAM (STEM plus The Arts) event. We describe the routine we demonstrated, this was based upon the tutting dance form, and the murmuration of starlings. Indeed, this demonstrates movement/dance as both a viable and engaging form of teaching mathematics.

comments
7 pages
fields
History and Overview
pdf ↗ page arXiv:2610.35487 ↗

Spectral Theory5

A spectral configuration specifies the Fredholm set, the Fredholm index on each of its components, and, on zero-index components, either the whole component or a locally finite set of discrete eigenvalues with prescribed algebraic multiplicities. We show that any two spectral configurations with the same Fredholm set and index can be realized by a suitable closed operator \(A\) and a rank-one perturbation \(A+K\). This remains true even when the rank-one operator \(K\), acting on a given separable infinite-dimensional Hilbert space, is prescribed in advance. In particular, for any such prescribed \(K\), one can choose \(A\) such that the discrete eigenvalues of \(A+K\) accumulate at the common essential spectrum at any prescribed rate. The proof is inspired by classical linearization theory. The main tool is the fact that arbitrary holomorphic functions can be represented as rank-one perturbation determinants.

comments
31 pages. Generative AI was used in the development of this paper
fields
Spectral Theory
pdf ↗ page arXiv:2610.33630 ↗

Let $(M^n,g)$ be a closed spin manifold of dimension $n\geq 3$ with positive Yamabe constant. We prove that critical metrics for the mixed eigenvalue ratio $\mathcal H(g)=\frac{λ_1(D_g)^2}{λ_1(L_g)},$ where $D_g$ is the Dirac operator and $L_g$ is the conformal Laplacian are characterized by a harmonic section whose energy-momentum tensor satisfies an Einstein–Dirac equation. We discuss consequences of this result for Hijazi's inequality, and we construct an example to prove that $\mathcal H$ is unbounded above within the conformal class of the round sphere.

fields
Spectral Theory, Differential Geometry
pdf ↗ page arXiv:2610.33825 ↗

We are interested in whether the Riesz means of the eigenvalues of the Coulomb Hamiltonian can be bounded by the corresponding semiclassical phase space integral. In dimensions two and three we determine the optimal Riesz exponent above which this bound holds.

comments
20 pages
fields
Spectral Theory, Mathematical Physics, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.34181 ↗

We consider the Robin Laplacian on a planar exterior domain with a negative boundary parameter. For a negative boundary parameter of a sufficiently large absolute value this operator has at least two negative eigenvalues below the bottom of the essential spectrum. We prove that under a fixed area constraint and convexity assumption on the bounded complement of the exterior domain the second Robin eigenvalue is maximized by the exterior of the disk. The inequality is strict for every exterior of a non-circular domain whenever the comparison disk has a negative second eigenvalue. The proof modifies the parallel-coordinate method by allowing the angular phase of a trial function to vary with the distance from the boundary. This result resolves the first item in a 2024 conjecture by the authors under an additional convexity assumption. Relaxing the convexity and the perimeter constraint remain open problems.

comments
12 pages
fields
Spectral Theory
pdf ↗ page arXiv:2610.34320 ↗

We develop scattering theory for Dirichlet-to-Neumann (DtN) maps on asymptotically conic, unbounded domains $Ω\subset \mathbb{R}^d$, that are only Lipschitz inside a compact set and whose boundary extends to infinity. Specifically, we prove a limiting absorption principle and demonstrate existence of the scattering matrix. As an application of the theory, we show that the eigenvalues of Steklov-type problems on curvilinear polygons, $\mathcal{P}$, are well approximated by the eigenvalues of a Dirac operator on $\partial\mathcal{P}$ whose transmission coefficients between edges meeting at a corner are given by the scattering matrix for DtN maps on asymptotically conic domains associated to the corners. Up to an arbitrary loss in the power of the eigenvalue, the error in the approximation is optimal among all possible asymptotics that use only local information about $\partial\mathcal{P}$.

comments
181 pages, 14 figures
fields
Spectral Theory, Mathematical Physics, Analysis of PDEs
pdf ↗ page arXiv:2610.34588 ↗

General Mathematics4

In this paper, we establish several identities involving Bernoulli numbers, harmonic numbers, and Stirling numbers. Our approach extends the method developed by Kargin and Mutluer.

fields
General Mathematics
pdf ↗ page arXiv:2610.33073 ↗

We define packaged structures through carriers, internal units, incidence, candidate spaces, and selected families. A realized packaging system additionally retains a context and formation datum related to its output by a possibly partial, multivalued realization relation. We establish comparison-relative recoverability and non-collapse criteria and an intrinsic refinement-completion theory. For atlas specializations, exact extension becomes a specialization-relative packaging completion problem. Under additional recovery and elimination axioms, we establish general globalization sufficiency criteria and sharp classifications for three classes of compatible finite atlases on a fixed cover $\mathcal H$. A geometric obstruction rank $ν(\mathcal H)$ yields thresholds $2k+1<ν(\mathcal H)$ for empty-preserving closures of local Carathéodory number at most $k\ge1$; $d<ν(\mathcal H)$ for complete functional-dependency theories of local minimum Armstrong size at most $d\ge3$; and $3<ν(\mathcal H)$ for transitive relations, including equivalence relations. For nonempty finite label sets and empty-preserving closures, minimum commutant realization dimension equals minimum Armstrong size. We also determine intrinsic recovery ranks and construct canonical clique completions under bounded conformality without chordality. Explicit obstructions establish sharpness; a transport hypothesis is essential for the general recovery–obstruction converse. Complexity bounds apply locally, not necessarily to global extensions.

comments
177 pages
fields
General Mathematics
pdf ↗ page arXiv:2610.33092 ↗

In this work we present an extension of the classical trigonometric functions which include, amongst others, the Lindqvist p-trigonometric functions. Additionally, we show their relevance in the study of certain versions of the nonlinear harmonic oscillator equation. Furthermore, we study their more important mathematical properties and obtain their corresponding Pythagorean-like relations. We also define a new extension of the Beta and Ateb sine functions using these new $χ$-trigonometric functions. Indeed, these new Beta and Ateb functions are involved in the closed form expressions obtained for the solutions of the nonlinear oscillator under certain constraints.

fields
General Mathematics
pdf ↗ page arXiv:2610.33121 ↗

We study the cyclic inequality \[ \sum_{i=1}^n x_i\,\sum_{i=1}^n x_i^a x_{i+1}^b\;\le\;\Big(\sum_{i=1}^n x_i^{(1+a+b)/2}\Big)^2, \] where $x_1,\dots,x_n\ge 0$ and indices are taken modulo $n$. Let $N(a,b)$ be the largest $n$ for which the inequality holds for all nonnegative $x_i$. We show that $N(a,b)$ is bounded above by an explicit quantity $N^*(a,b)$ obtained from the second variation at the constant vector, and we conjecture that $N(a,b)=N^*(a,b)$. For $a=b=1$ we prove that the inequality holds if and only if $n\le 8$, which settles the case left open in the original version of this paper. For $n=4$ the inequality holds whenever $1,a,b$ are the sides of a triangle, with an explicit remainder term. We show that $N$ is monotone along rays emanating from the line $a+b=1$; this corrects and extends an earlier monotonicity statement. Finally, any $n$ nonnegative numbers can be arranged so that the inequality holds; for $n\neq 6$ this is achieved by one of $n-1$ prescribed arrangements, which yields a volume bound for every such $n$.

comments
This is a revised and extended version of an earlier published version
journal
M. Javaheri, A new arrangement inequality, J. Inequal. Pure Appl. Math. 7 (2006), no. 5, Article 162
fields
General Mathematics
pdf ↗ page arXiv:2610.33653 ↗

Metric Geometry4

The Pythagoras tree of A. E. Bosman (1942) is drawn with squares in the plane and, in the three-dimensional versions we know of, with cubes. This article documents a tree built instead from regular dodecahedra: each dodecahedron carries five smaller copies, one on each edge of a single pentagonal "crown" face, scaled by $g \approx 0.4346$ and twisted by $45^\circ$ about the edge. The construction first existed only as a pair of rendered images and two undocumented C++ programs. We recover its exact parameters from the original Blender scene, reformulate it as an iterated function system with condensation, and prove with a short computer-assisted argument that it never collides with itself: two of its dodecahedra overlap only when one is the parent of the other. A Pythagorean identity for the six face axes of the dodecahedron singles out the scale $1/\sqrt{5}$ and the twist $\arccos(1/\sqrt{5})$. With these values each child rests flat against a face of its parent, the five children together have exactly the parent's surface area, and the crown of the tree is a fractal of Hausdorff dimension exactly 2. Finally we ask whether the tree can grow on all twelve faces at once. A parity argument shows that at the artwork's proportions it cannot, but smaller scale factors admit certified clash-free all-faces trees.

comments
11 pages, 7 figures. Code and data: https://github.com/MiguelPerezI/dodecahedron-pythagoras-tree
fields
Metric Geometry, History and Overview
pdf ↗ page arXiv:2610.33975 ↗

We derive Makai's inequality $\vol_n(K)\vol_n((K-K)^\circ)\ge(n+1)/n!$ in every dimension from the symmetric Mahler theorem in one higher dimension, with equality precisely for simplices. The proof uses a classical two-layer construction, an identity for its polar volume, and a Rogers–Shephard volume estimate. We then record basic consequences of the Mahler and Makai inequalities for polar successive minima, successive minima at the Santaló point, critical determinants, first covering minima, and non-separable lattice arrangements. We also combine Alexandrov–Fenchel with the volume-product inequalities to obtain sharp bounds for paired mixed volumes.

comments
9 pages
fields
Metric Geometry
pdf ↗ page arXiv:2610.34396 ↗

We determine the sharp dimensional dependence of the asymptotic approximation error for the Euclidean unit ball $B_2^d\subset\mathbb{R}^d$ by polytopes with a prescribed number of vertices in the relative symmetric difference metric. Specifically, we prove that $$\lim_{N\to\infty}N^{2/(d-1)}\inf_{P\in P_d(N)}\frac{\operatorname{vol}_d(P\triangle B_2^d)}{\operatorname{vol}_d(B_2^d)}=Θ(d^{-1/2}),$$ where $P_d(N)$ consists of polytopes with at most $N$ vertices and no containment restriction. Equivalently, the classical Laguerre-Delone triangulation numbers satisfy $\operatorname{ldel}_{d-1}=Θ(d^{-1/2})$. This improves the lower bound $Ω(d^{-1})$ of Böröczky (2000) and the upper bound $O(1)$ of Ludwig, Schütt and Werner (2006). In contrast, the corresponding asymptotic coefficient for approximation with a prescribed number of facets has order one, as shown by Kur (2020). We also establish non-asymptotic bounds showing that, for every fixed $\varepsilon\in(0,1)$, the ball admits an $\varepsilon$-approximation with at most $\exp(C(\varepsilon)\sqrt d)$ vertices, whereas approximating the hypercube to the same accuracy requires at least $\exp(c(\varepsilon)d)$ vertices. Consequently, the ball does not maximize the optimal relative approximation error among convex bodies, even up to an absolute multiplicative constant at the same vertex budget. Thus Macbeath's theorem (1951) on the extremality of the ball for inscribed approximation does not extend to polytopes in arbitrary position.

comments
72 pages
fields
Metric Geometry
pdf ↗ page arXiv:2610.34651 ↗

The Gromov-Hausdorff space is a certain metric space induced by the Gromov-Hausdorff convergence, and we study an isometric embedding into this space. While the subspace of non-negative real numbers in the Euclidean space admits an isometric embedding, we prove that the subspace of $\ell^\infty$ consisting of non-increasing sequences with non-negative terms can be isometrically embedded into the Gromov-Hausdorff space.

fields
Metric Geometry, General Topology
pdf ↗ page arXiv:2610.34727 ↗

K-Theory and Homology3

We compute derived products and inverse limits in Grothendieck categories by exact coresolutions. For the product of $r$ doubled affine lines over $B[s]$, where $B$ is any nonzero commutative ring,the exact dimensions of products, epimorphic countable limits, and arbitrary countable limits are $r$, $r$, and $r+1$. We identify the top derived functors for every $B$-module of coefficients. Both obstruction modules contain the countable reduced product as a natural $B$-module direct summand, and a formal-series map relates them by an explicit cokernel sequence. A relative cofree coresolution gives degree shifts over an arbitrary Grothendieck category and computes the localization defect for arbitrary locally nilpotent diagrams. We also construct transfinite scalar extensions preserving a prescribed kernel and its derived limit;these give nonzero completion defects beyond any fixed ordinal.The general epimorphic top-degree vanishing question is not settled by these constructions.

comments
29 pages,preliminary version
fields
K-Theory and Homology
pdf ↗ page arXiv:2610.34022 ↗

We introduce quantitative $K$-homology for uniform Roe algebras of discrete proper metric spaces with bounded geometry, based on the controlled $KK$-theory of Willett and Yu. We construct a comparison map from Lipschitz $K$-theory and prove that, for chain geodesic spaces, it is an isomorphism in a quantitative sense; in particular, quantitative $K$-homology is isomorphic to the inverse limit of the Lipschitz $K$-theory groups as the Lipschitz constant tends to zero. We also establish a pairing between quantitative $K$-homology and quantitative $K$-theory.

comments
35 pages
fields
K-Theory and Homology, Operator Algebras
pdf ↗ page arXiv:2610.34050 ↗

We define the higher Dehn invariant on the Euclidean, hyperbolic, and spherical variants of scissors congruence $K$-theory, and prove that it makes these spectra into comodules over the spectral Sah algebra. This allows us to make the first formulation of the conjecture that the higher volume and Dehn invariants are jointly injective.

comments
Comments welcome!
fields
K-Theory and Homology, Algebraic Topology
pdf ↗ page arXiv:2610.35567 ↗

General Topology1

In this paper, we obtain some bounds for cardinal invariants such as character, pseudocharacter, tightness, {L}indelöf number, hereditary {L}indelöf number, hereditary density and spread of $Q_p(X,Y)$, the space of all quasicontinuous functions from $X$ to $Y$ equipped with the topology of pointwise convergence. We prove that the tightness, hereditary {L}indelöf number, hereditary density and spread of the space $Q_p(\mathbb{R},\mathbb{R})$ are equal to the cardinality of $\mathbb{R}$.

comments
Quasicontinuous functions, topology of pointwise convergence, cardinal invariants
fields
General Topology
pdf ↗ page arXiv:2610.33506 ↗

Revised papers548

We give a description of $δ$-derivations of $(n+1)$-dimensional $n$-ary Filippov algebras and, as a consequence, of simple finite-dimensional Filippov algebras over an algebraically closed field of characteristic zero. We also give new examples of non-trivial $δ$-derivations of Filippov algebras and show that there are no non-trivial $δ$-derivations of the simple ternary Malcev algebra $M_8$.

comments
Corrected version verified in Lean
journal
I. Kaygorodov, On $δ$-derivations of n-ary algebras, Izv. Math. 76 (2012), no. 6, 1150-1162
fields
Rings and Algebras, Quantum Algebra
pdf ↗ page arXiv:1107.4427 ↗

We characterize by pattern avoidance the Schubert varieties for GL_n which are local complete intersections (lci). For those Schubert varieties which are local complete intersections, we give an explicit minimal set of equations cutting out their neighborhoods at the identity. Although the statement of our characterization only requires ordinary pattern avoidance, showing that the Schubert varieties not satisfying our conditions are not lci appears to require more general notions of pattern avoidance. The Schubert varieties defined by inclusions, originally introduced by Gasharov and Reiner, turn out to be an important subclass, and we further develop some of their combinatorics. Applications include formulas for Kostant polynomials and presentations of cohomology rings for lci Schubert varieties.

comments
54 pages, 6 figures. This is the accepted version of the following article: Henning Ulfarsson and Alexander Woo, Which Schubert varieties are local complete intersections?, Proc. London Math. Soc. (3) 107 (2013) 1004-1052, which has been published in final form at https://doi.org/10.1112/plms/pdt004
journal
Proceedings of the London Mathematical Society 107 (2013) 1004-1052
fields
Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:1111.6146 ↗

In this paper, we show the absence of nontrivial $δ$-derivations of semisimple finite-dimensional structurable algebras over an algebraically closed field of characteristic not equal to $2,3,5$.

comments
Corrected version verified in Lean
journal
I. Kaygorodov, E. Okhapkina, $δ$-derivations of semisimple finite-dimensional structurable algebras, J. Algebra Appl. 13 (2014), no. 4, 1350130
fields
Rings and Algebras
pdf ↗ page arXiv:1212.0618 ↗

When f : R power n to R power p, is a surjective real analytic map with isolated critical value, we prove that the (m)-regularity condition (in a sense we define) ensures that f ||f|| is a fibration on small spheres, f induces a fibration on the tubes and both fibrations are equivalent. In particular, we make the statement of [12] more precise in the case of isolated critical point and we extend it to the case of an isolated critical value.

comments
The manuscript is withdrawn due to an error in the proof of a main theorem, which affects the validity of the result as originally stated. The issue was subsequently addressed in a revised mathematical treatment
fields
Differential Geometry
pdf ↗ page arXiv:1604.05290 ↗

We give an abstract formulation of the formal theory partial differential equations (PDEs) in synthetic differential geometry, one that would seamlessly generalize the traditional theory to a range of enhanced contexts, such as super-geometry, higher (stacky) differential geometry, or even a combination of both. A motivation for such a level of generality is the eventual goal of solving the open problem of covariant geometric pre-quantization of locally variational field theories, which may include fermions and (higher) gauge fields. (abridged)

comments
72 pages, xypic and tikzcd commutative diagrams; v2: minor technical revisions, close to published version
journal
Journal of Geometry and Physics v.231 (2027) p.106025
fields
Differential Geometry, Mathematical Physics, Category Theory
pdf ↗ page arXiv:1701.06238 ↗

We develop the local Morse theory for a class of non-twice continuously differentiable functionals on Hilbert spaces, including a new generalization of the Gromoll-Meyer's splitting theorem and a weaker Marino-Prodi perturbation type result. They are applicable to a wide range of multiple integrals with quasi-linear elliptic Euler equations and systems of higher order.

comments
Differences between this version and the published version [Calc. Var. Partial Differential Equations 58 (2019), no. 4, Paper No. 134] are as follows: in addition to the passage from inequalities (2.7)-(2.8) through the end of the proof of Lemma 2.10, several typographical errors in other parts of the paper have also been corrected
journal
Calc. Var. Partial Differential Equations 58 (2019), no. 4, Paper No. 134
fields
Functional Analysis, Analysis of PDEs
pdf ↗ page arXiv:1709.02337 ↗

We show that for any regular matroid on $m$ elements and any $α\geq 1$, the number of $α$-minimum circuits, or circuits whose size is at most an $α$-multiple of the minimum size of a circuit in the matroid is bounded by $m^{O(α^2)}$. This generalizes a result of Karger for the number of $α$-minimum cuts in a graph. As a consequence, we obtain similar bounds on the number of $α$-shortest vectors in "totally unimodular" lattices and on the number of $α$-minimum weight codewords in "regular" codes.

comments
Fixed an error in Claim 6.11 of the earlier version. Paper has been shortened
fields
Combinatorics
pdf ↗ page arXiv:1807.05164 ↗

Let $\mathcal{X}$ be a genus 2 curve defined over a field $K$, $\mathrm{char}\, K = p \geq 0$, and $\mathrm{Jac}(\mathcal{X}, ι)$ its Jacobian, where $ι$ is the principal polarization of $\mathrm{Jac}(\mathcal{X})$ attached to $\mathcal{X}$. Assume that $\mathrm{Jac}(\mathcal{X})$ is geometrically $(n,n)$-reducible with $E_1$ and $E_2$ its elliptic components. When $K$ is a number field, we count such curves up to geometric isomorphism, among those admitting a model over $K$. For $n=2$ and $\mathrm{Aut}(\mathcal{X}) \cong V_4$ we prove that, for each $N=2,3,5,7$, there are infinitely many curves $\mathcal{X}$ for which $E_1$ and $E_2$ are $N$-isogenous. For $n=2$ and $\mathrm{Aut}(\mathcal{X}) \cong D_4$ the elliptic quotients from the two classes of nonhyperelliptic involutions are always $2$-isogenous, and for each $N=3,5,7$ only finitely many curves have them $N$-isogenous. For $n=3$ there are infinitely many curves with $N$-isogenous elliptic components for each $N=2,3,5$, while for $N=7$ there are only finitely many such curves with a model over $\mathbb{Q}$. Furthermore, we determine the Kummer and the Shioda-Inose surfaces for the above $\mathrm{Jac}(\mathcal{X})$ and show how such results in positive characteristic $p>2$ suggest nice applications in cryptography.

comments
29 pages. Corrected version of the article published in Eur. J. Math. 6 (2020) 1276-1302. Several finiteness statements there were false because of incorrect genus computations. All computations redone and verified; verification scripts in the ancillary files
journal
Eur. J. Math. 6 (2020), no. 4, 1276-1302
fields
Algebraic Geometry
pdf ↗ page arXiv:1902.06372 ↗

In this paper, we prove that an immersed annular capillary minimal surface outside the unit ball in $\mathbb{R}^3$ with one complete embedded end and finite total curvature must be either part of the plane or part of the catenoid. The proofs are based on the use of the Weierstrass data through the Hopf differential and associated holomorphic functions. For a planar end, we control the second fundamental form, while for a catenoidal end, we analyze the Gauss map in more detail using the boundary condition. We also prove nonexistence results for annular free boundary minimal surfaces with one end asymptotic to the end of Enneper's surface, under appropriate conditions. Finally, we establish an exterior analogue of Choe's result on capillary minimal surfaces with vertices.

comments
16 pages, 1 figure. In response to referee comments, an issue with a reference used in Theorem 1.1 has been corrected, and the proof has been revised accordingly. The statement of Theorem 1.2 has been revised to exclude certain boundary umbilic cases. This revision was posted as arXiv:2610.32447 by mistake. Withdrawal of that duplicate submission has been requested
fields
Differential Geometry
pdf ↗ page arXiv:1905.07887 ↗

We give a simple, straightforward proof of the non-hypercyclicity of an arbitrary normal operator $A$ (bounded or unbounded) in a complex Hilbert space as well as of the collection $\left\{e^{tA}\right\}_{t\ge 0}$ of its exponentials, which, under a certain condition on the spectrum of $A$, is the $C_0$-semigroup generated by it. We also establish non-hypercyclicity for symmetric operators.

comments
Various modifications
fields
Functional Analysis
pdf ↗ page arXiv:1908.01935 ↗

When finding an original proof to a known result describing expansions on compact metric spaces as surjective isometries, we reveal that relaxing the condition of compactness to total boundedness preserves the isometry property and nearly that of surjectivity. While a counterexample is found showing that the converse to the above descriptions do not hold, we are able to characterize boundedness in terms of specific expansions we call anticontractions.

comments
Modified title, updated bibliography
fields
Functional Analysis
pdf ↗ page arXiv:1908.04916 ↗

Let $X\to(C,c)$ be a flat family over a smooth curve germ over an algebraically closed field of characteristic $p>0$, with geometrically integral generic fiber. We show that the fiber pair stays log canonical after every finite dominant base change by a smooth curve if and only if it is log canonical after every finite Frobenius base change, including the original stage. More specifically, under iterated Frobenius pullback, a negative log discrepancy of a vertical divisor goes to minus infinity. For any fixed separable cover, however, log canonicity along the Frobenius tower of the original family gives a uniform lower bound instead. Putting these two bounds side by side gives the result for separable covers of arbitrary degree. We also illustrate that the single first Frobenius base change does not suffice in our criterion by an example. Finally, we include two more examples related to the main problem. Neither resolution of singularities nor inversion of adjunction is used.

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

We study the dimension of the solution set of a variational inequality whose operator is polynomial and whose constraint set is defined by finitely many convex polynomial inequalities and affine equations. Under the Abadie constraint qualification, we bound this dimension from above in terms of the ranks of the Jacobian matrices of the associated Karush–Kuhn–Tucker maps; the bound is attained in nontrivial examples and yields a sufficient condition for finiteness of the solution set. For polynomial complementarity problems, the bound is expressed through principal submatrices of the Jacobian matrix of the operator, and the resulting finiteness criterion extends the classical nondegeneracy condition for linear complementarity problems.

fields
Optimization and Control
pdf ↗ page arXiv:2001.09435 ↗

We present the Robust Newton Method (RNM) for a complex polynomial $p$ of degree $n\geq2$, with continuous map $F(z)=z-p(z)\overline{p'(z)}/(9A(z)^2)$, where $A(z)=\max_{0\leq j\leq n}|p^{(j)}(z)|/j!$. Its fixed points are the roots and critical points; elsewhere it strictly decreases $|p|$ along the Newton direction. The Geometric Modulus Principle inspires the construction and supplies an escape step at nonroot critical points. Every root has an open basin. When nonroot critical points are simple, almost every seed converges to a root, and root-basin boundaries lie in countably many Lipschitz curves with Hausdorff dimension one when nonempty. These conclusions apply after any sufficiently small nonzero linear perturbation $p(z)+δz$. Every RNM orbit, with or without escapes, converges to a root or critical point. A hybrid enforcing one RNM update every $T$ iterations retains convergence and reaches $|p(z)p'(z)|\leq\varepsilon$ in $O(T/\varepsilon^2)$ updates, with constants depending on the polynomial and seed; $T=1$ gives RNM. Orbits approaching simple roots eventually reach Smale's $α$-certification, permitting a permanent Newton switch and $O(\log\log(1/\varepsilon))$ further steps for absolute root error $\varepsilon$. For cubics, deterministic critical-point initialization yields an explicit preparatory bound, retained by an RNM-guided Newton refinement. Illustrative computations cover cubics and degree-ten polynomials. For $p(z)=z^n-1$, the basins are exactly the open Voronoi regions, with boundary points converging to the origin. Polynomiographs illustrate basin geometry and iteration-based coloring.

comments
25 pages, 2 figures. Substantially revised and expanded; title and abstract changed. Includes revised convergence proofs, new basin geometry results, and Newton-RNM refinements
fields
Numerical Analysis
pdf ↗ page arXiv:2003.00372 ↗

It is known that the number of homomorphisms from a group $F$ to a group $G$ is divisible by the greatest common divisor of the order of $G$ and the exponent of $F/[F,F]$. We investigate the number of homomorphisms satisfying some natural conditions such as injectivity or surjectivity. The simplest nontrivial corollary of our results is the following fact: {\it in any finite group, the number of generating pairs $(x,y)$ such that $x^3=1=y^5$, is a multiple of the greatest common divisor of 15 and the order of the group $[G,G]\cdot\{g^{15}\;|\;g\in G\}$.

comments
5 pages. A Russian version of this paper is at http://halgebra.math.msu.su/staff/klyachko/papers.htm . V3: an inaccuracy in Theorem 1 has been fixed
journal
Izvestiya: Mathematics, 86:2 (2022), 243-251
fields
Group Theory
pdf ↗ page arXiv:2012.03123 ↗

We establish an isomorphism between the moduli space of homologically trivial parabolic (Higgs) bundles on $\mathbb{P}^1$ and the quiver variety associated to a star-shaped quiver. As an application, we give a Hitchin-theoretic construction of irreducible solutions to the nilpotent additive Deligne-Simpson problem under explicit numerical assumptions.

journal
SIGMA 22 (2026), 101, 24 pages
fields
Algebraic Geometry
pdf ↗ page arXiv:2101.01913 ↗

Approximate Bayesian Computation (ABC) replaces intractable likelihood evaluations with comparisons between observed and simulated data. We formulate discrepancy-based inference through nonnegative compatibility weights. Prior-integrated convergence of rescaled weights gives total variation convergence as the tolerance vanishes. For a fixed positive tolerance and increasing sample size, we give a general representation-based formulation of the conditional-prior limit known from ABC and coarsened Bayesian inference, and establish convergence in expected total variation under stabilization in probability and a prior-null boundary condition. We also derive acceptance-persistence bounds under partial stabilization. The Gibbs variational identity yields convergence of minimum values and stability of approximate minimizers; the fixed-tolerance limit is characterized separately by constrained relative-entropy minimization. For additional penalty-based functionals of the limiting Wasserstein discrepancy, we prove an exact reduction to distributions over model laws and, under a geodesic assumption, a representation by distances from a Wasserstein ball. These penalty-based updates are distinguished from the original fixed-tolerance ABC limit and illustrated through a Gaussian comparison.

comments
2 figures
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2105.01962 ↗

We prove that the invariant locus of the involution associated to a general double EPW sextic is a constant surface and introduce a filtration on $\CH_1$ of a Gushel-Mukai fourfold. We verify the sheaf/cycle correspondence for sheaves supported on low degree rational curves, parallel to the cubic fourfolds case.

comments
Revised version. A gap in Lemma 4.12 was discovered and corrected by Carl Mazzanti, whose independently authored appendix is included. Also corrected the definition of theta
fields
Algebraic Geometry
pdf ↗ page arXiv:2202.09811 ↗

This paper introduces a comprehensive benchmarking framework that includes: (i) a suite of analytical benchmark optimization problems designed to stress-test and validate multifidelity methods; (ii) a set of assessment metrics for quantifying and comparing performance over measurable objectives; and (iii) the classification, evaluation, and comparison of several families of multifidelity optimization methods and frameworks using the proposed benchmarks to identify their respective strengths and weaknesses in real-world scenarios. The proposed benchmark problems are analytically defined functions carefully selected to capture mathematical challenges commonly encountered in real-world applications, including high dimensionality, multimodality, discontinuities, and noise. Their closed-form nature ensures computational efficiency, high reproducibility, and a clear separation of algorithmic behavior from numerical artifacts. The accompanying performance metrics support the systematic evaluation of multifidelity methods, measuring both optimization effectiveness and global approximation accuracy. By providing a rigorous, reproducible, and accessible benchmarking framework, this work aims to enable the broader community to understand, compare, and advance multifidelity optimization methods for complex problems in science and engineering.

journal
Mainini, L., Serani, A., Pehlivan-Solak, H. et al. Analytical benchmark problems and methodological framework for the assessment and comparison of multifidelity optimization methods. Arch Computat Methods Eng 33, 2969-3000 (2026)
fields
Optimization and Control
pdf ↗ page arXiv:2204.07867 ↗

In this paper, we use nonabelian Hodge theory to study Kodaira-type vanishings. In particular, we generalize Saito vanishing using mixed twistor $\sD$-modules. We also generalize it to a Kawamata-Viehweg type vanishing using $\Q$-divisors, and prove an effective global generation theorem, as an application. We also prove a relative vanishing for a projective morphism in the mixed twistor $\sD$-module setting.

comments
KMS admissibility gaps are fixed; 33 pages, accepted by JPAA
fields
Algebraic Geometry, Differential Geometry
pdf ↗ page arXiv:2207.09064 ↗

Let $K$ be a number field with ring of integers $R$, let $f_{d,c}(x)=x^d+c\in K[x]$ be a unicritical polynomial of degree $d\ge2$, and let $\varrho_d(n,c)$ denote the number of primitive prime divisors of $f_{d,c}^n(0)$, the $n$-th term of the critical orbit of $f_{d,c}$. We show that $\varrho_d(n,c)$ admits no uniform bound, that is, no bound depending only on $d$ and $n$. More precisely, for all $n\ge1$ and $t\ge1$ there is $c\in R$ for which $f_{d,c}^n(0)$ has at least $t$ primitive prime divisors, and these primes may be prescribed to occur with any given multiplicities. This can be done simultaneously for any finite set of iterates. The construction rests on a density computation. Namely, the set of primes occurring as a primitive prime divisor of $f_{d,c}^n(0)$ for some $c$ has positive density. We compute that density explicitly for $d=2$ over $\mathbb{Q}$, under a hypothesis on the Galois group of the associated Gleason polynomial, verified for $n\le16$. As an application, we produce, for every $m\ge1$, a parameter $c\in R$ (in fact, a whole residue class of them), for which the splitting field of $f_{d,c}^m(x)$ has the maximal possible degree over $K$.

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

A class of optimal control problems governed by linear fractional diffusion equation with control constraint is considered. We first establish some results on the existence of strong solution to the state equation and the existence of optimal solutions for the optimal control problem. Then we derive first-and second-order optimality conditions for locally optimal solutions to the problem.

comments
The authors wish to withdraw this manuscript because some of its main conclusions require further verification
fields
Optimization and Control
pdf ↗ page arXiv:2210.16818 ↗

We prove that the average size of the squares of differences between consecutive primes less than $x$ is $O(x^{0.23+\varepsilon})$ for any fixed $\varepsilon>0$. This improves on a result of Peck, who gave bound $O(x^{0.25+\varepsilon})$ in the place of $O(x^{0.23+\varepsilon})$. Key ingredients are Harman's sieve, Heath-Brown's mean value theorem for sparse Dirichlet polynomials and Heath-Brown's $R^*$ bound.

comments
71 pages. Revised version, accepted for publication in Mathematische Zeitschrift
fields
Number Theory
pdf ↗ page arXiv:2212.10867 ↗

In this work we consider the KAM renormalizability problem for small pseudodifferential perturbations of the semiclassical isochronous transport operator with Diophantine frequencies on the torus. Assuming that the symbol of the perturbation is real analytic and globally bounded, we prove convergence of the quantum Lindstedt series and describe completely the set of semiclassical measures and quantum limits of the renormalized system. Each of these measures is given by symplectic deformation of the Haar measure on an invariant torus for the unperturbed classical system.

comments
35 pages, 7 figures. Article being revised by the author due to an error in the estimate of the coefficient $χ(\mathbf{J})$ in Lemma 9. This affects the proof of Theorem 1, which is not correct in its current form
fields
Mathematical Physics, Analysis of PDEs, Dynamical Systems, Spectral Theory
pdf ↗ page arXiv:2301.12728 ↗

We improve the large sieve inequality with $k$th-power moduli, for all $k\ge 4$. Our method relates these inequalities to a restricted variant of Waring's problem. Firstly, we input a classical divisor bound on the number of representations of a positive integer as a sum of two $k$th-powers. Secondly, we input a recent and general result of Wooley on mean values of exponential sums. Lastly, we state a conditional result, based on the conjectural Hardy-Littlewood formula for the number of representations of a large positive integer as a sum of $k+1$ $k$th-powers.

comments
Corrected typos and clarified a reference. The results are unchanged
journal
Proc. Amer. Math. Soc. 152 (2024), 4593-4605
fields
Number Theory
pdf ↗ page arXiv:2303.07613 ↗

In the literature, frames generated by unitary representations of groups (known as group-frames) have been studied only for Hilbert spaces. We conduct the first study of frames for Banach spaces generated by isometrically invertible representations of discrete groups on Banach spaces. These frames are characterized using left-regular and right-regular representations, Gram matrices, and group matrices on classical sequence spaces. A sufficiently large collection of functional-vector pairs using the double commutant of the representation is identified to generate group-frames for Banach spaces. Subsequently, we study Schauder frames generated by time-frequency shift operators on finite-dimensional Banach spaces. We derive the Moyal formula, the fundamental identity of Gabor analysis, the Wexler-Raz criterion, and the Ron-Shen duality in functional form.

comments
22 Pages, 0 Figures
fields
Functional Analysis, Group Theory, Operator Algebras, Representation Theory
pdf ↗ page arXiv:2305.01499 ↗

Stochastic gradient descent (SGD) methods have gained widespread popularity for solving large-scale optimization problems. However, the inherent variance in SGD often leads to slow convergence rates. We introduce a family of unbiased stochastic gradient estimators that encompasses existing estimators from the literature and identify a gradient estimator that not only maintains unbiasedness but also achieves minimal variance. Compared with the existing estimator used in SGD algorithms, the proposed estimator demonstrates a significant reduction in variance. By utilizing this stochastic gradient estimator to approximate the full gradient, we propose two mini-batch stochastic conjugate gradient algorithms with minimal variance. Under the assumptions of strong convexity and smoothness on the objective function, we prove that the two algorithms achieve linear convergence rates. Numerical experiments validate the effectiveness of the proposed gradient estimator in reducing variance and demonstrate that the two stochastic conjugate gradient algorithms exhibit accelerated convergence rates and enhanced stability.

fields
Optimization and Control
pdf ↗ page arXiv:2306.00459 ↗

The complement of plane algebraic curves are well studied from topological and algebro-geometric viewpoints. In this paper, we will describe the explicit handle decompositions and the Kirby diagrams for the complement of plane algebraic curves. The method is based on the notion of braid monodromy. We refined this technique to obtain handle decompositions and Kirby diagrams.

comments
23 pages, 31 figures
fields
Geometric Topology, Algebraic Geometry
pdf ↗ page arXiv:2306.10519 ↗

This paper investigates a category of constrained fractional optimization problems that emerge in various practical applications. The objective function for this category is characterized by the ratio of a numerator and denominator, both being convex, semi-algebraic and differentiable with Lipschitz continuous gradients over the constraint sets. The constrained sets associated with these problems are closed, convex, and semi-algebraic. We propose an efficient algorithm that is inspired by the proximal gradient method, and we provide a thorough convergence analysis. Our algorithm is shown to converge to a critical point without the typical need for a nonnegative numerator, and this critical point becomes a globally optimal solution whenever the numerator is nonpositive at the initial point. Our approach is adaptable to unbounded constraint sets as well. Therefore, our approach is viable for many more practical models. Numerical experiments show that our method not only reliably reaches ground-truth solutions in some model problems but also outperforms several existing methods in maximizing the Sharpe ratio with real-world financial data.

comments
24 pages, 2 figures
fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2306.11286 ↗

For $g\ge 2$ and $n\ge 0$, let $\mathcal{H}_{g,n}\subset \mathcal{M}_{g,n}$ denote the complex moduli stack of $n$-marked smooth hyperelliptic curves of genus $g$. A normal crossings compactification of this space is provided by the theory of pointed admissible $\mathbb{Z}/2\mathbb{Z}$-covers. We explicitly determine the resulting dual complex, and we use this to define a graph complex which computes the weight zero compactly supported cohomology of $\mathcal{H}_{g, n}$. Using this graph complex, we give a sum-over-graphs formula for the $S_n$-equivariant weight zero compactly supported Euler characteristic of $\mathcal{H}_{g, n}$. This formula allows for the computer-aided calculation, for each $g\le 7$, of the generating function $\mathsf{h}_g$ for these equivariant Euler characteristics for all $n$. More generally, we determine the dual complex of the boundary in any moduli space of pointed admissible $G$-covers of genus zero curves, when $G$ is a cyclic group of prime order, as a symmetric $Δ$-complex. We use these complexes to generalize our formula for $\mathsf{h}_g$ to moduli spaces of $n$-pointed smooth prime cyclic covers of genus zero curves. This version contains corrections to the published version: see the attached erratum.

comments
Added corrections to the published version and attached erratum
fields
Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2307.01819 ↗

We compute the contact homology algebra of a neighborhood $(\mathbb{R}_τ \times W, ξ)$ of a convex hypersurface $W$ of any even dimension. This algebra is the derived tensor product of the augmentations of the chain-level contact homology of the dividing set, determined by the positive and negative regions of $W$. We describe methods for determining when the contact homology of $(\mathbb{R}_τ \times W, ξ)$ is non-zero in certain cases, which can be used to infer tightness of $ξ$. Full computations of contact homology are carried out in the case $\dim W = 2$.

comments
111 pages, 12 figures. v4: Corrected algebraic statements, new results on admissible sequences of contact forms, various typo corrections
fields
Symplectic Geometry
pdf ↗ page arXiv:2307.09068 ↗

Lustig gave an infinite product formula for the zeta function of a commutative two-dimensional regular local ring with finite residue field. We extend this to the noncommutative setting with a method based on filtration by an invertible ideal. One application gives an abstract two-dimensional analogue of Hey's formula. Another application provides effective formulae for zeta functions over Rump's two-dimensional regular semiperfect rings. In the appendices, we supplement these two-dimensional applications with requisite one-dimensional calculations.

comments
Corrected typos in the hypotheses of Theorem 3.5 and Corollaries 3.6 and 4.2. Supplemented Definition B.1. Fixed other typos. Applications and proofs remain unchanged
journal
Journal of Number Theory 280 (2026), 1-34
fields
Number Theory
pdf ↗ page arXiv:2310.15545 ↗

The Lichtenbaum-Quillen conjecture for smooth complex varieties states that algebraic and topological K-theory with finite coefficients become isomorphic in high degrees. We define the "Lichtenbaum-Quillen dimension" of a variety in terms of the point where this happens, show that it is surprisingly computable, and analyze many examples. It gives an obstruction to rationality, but one that turns out to be weaker than unramified cohomology and some related birational invariants defined by Colliot-Thélène and Voisin using Bloch-Ogus theory. Because it is compatible with semi-orthogonal decompositions, however, it allows us to prove some new cases of the integral Hodge conjecture using homological projective duality, and to compute the higher algebraic K-theory of the Kuznetsov components of the derived categories of some Fano varieties.

comments
60 pages. v5: caught a couple more typos. final version to appear in J Eur Math Soc
fields
Algebraic Geometry, Algebraic Topology, K-Theory and Homology
pdf ↗ page arXiv:2312.06930 ↗

The fundamental theorem of tropical differential algebra has been established for formal power series solutions of systems of algebraic differential equations. It has been shown that the direct extension to formal Puiseux series solutions fails. In this paper, we overcome this issue by transforming the given differential system and such a generalization is presented. Moreover, we explain why such transformations do not work for generalizing the fundamental theorem to transseries solutions, and show that one inclusion still holds for this case even without using any transformation.

fields
Algebraic Geometry
pdf ↗ page arXiv:2312.10036 ↗

Disability insurance claims are often affected by lengthy reporting delays and adjudication processes. The classic multistate life insurance modeling framework is ill-suited to handle such information delays since the cash flow and available information can no longer be based on the biometric multistate process determining the contractual payments. We propose a new individual reserving model for disability insurance schemes which describes the claim evolution in real-time. Under suitable independence assumptions between the available information and the underlying biometric multistate process, we show that these new reserves may be calculated as natural modifications of the classic reserves. For estimation of the model constituents, we employ the procedure proposed in [Buchardt, K., Furrer, C., & Sandqvist, O. L. (2025). Estimation for multistate models subject to reporting delays and incomplete event adjudication. The Annals of Applied Statistics, 19(4), 2782-2802. https://doi.org/10.1214/25-AOAS2068]. A real data application illustrates how the proposed estimation and reserving methods can be implemented and compares the resulting reserves with simpler reserving approaches.

fields
Probability
pdf ↗ page arXiv:2312.14324 ↗

Radical subgroups play an important role in both finite group theory and representation theory. This is the first of a series of papers of ours in classifying radical $p$-subgroups of finite reductive groups and in verifying the inductive blockwise Alperin weight condition for them, contributing to the program of proving the Alperin weight conjecture by verifying its inductive condition for finite simple groups. In this paper we present a uniform method for classifying radical subgroups of finite reductive groups. As applications, we investigate the inductive blockwise Alperin weight condition for classical groups, as well as groups of type $F_4$.

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

We investigate the geometric properties of the variable mixed Lebesgue sequence space \(\ell^{q(\cdot)}(L^{p(\cdot)})\). Assuming that \(q_->1\), \(p_+<\infty\), and \(q(\cdot)\le p(\cdot)\) almost everywhere, we prove that both \(\ell^{q(\cdot)}(L^{p(\cdot)})\) and its dual space are strictly convex and smooth. Moreover, we establish that \(\ell^{q(\cdot)}(L^{p(\cdot)})\) is uniformly convex under these assumptions. We further show that the condition \(q_->1\) is sharp: when \(q_-=1\), the space fails to be uniformly convex, and its modular is not uniformly convex either. Finally, we apply these geometric results to the renormability of the associated variable-exponent Besov space \(B_{p(\cdot),q(\cdot)}^{α(\cdot)}\).

comments
Revised version. The abstract and introduction have been revised, and the presentation of the main results has been improved
fields
Functional Analysis
pdf ↗ page arXiv:2401.03211 ↗

In the last two decades a number of structures on the classical space of translation invariant valuations on convex bodies were discovered, e.g. product, convolution, a Fourier type transform. In this paper a non-Archimedean analogue of the space of such (even) valuations with similar structures is constructed. It is shown that, like in the classical case, the new space equipped with either product or convolution satisfies Poincaré duality and hard Lefschetz theorem.

comments
61 pages. Major corrections: several proofs are corrected. Minor corrections
fields
Differential Geometry
pdf ↗ page arXiv:2401.09131 ↗

The purpose of the paper is twofold. Firstly, we want to present an abstract existence Theorem to show the existence of a martingale solution for coupled systems of non-linear stochastic partial differential equations. The idea is first to split the system by rewriting the nonlinear part in a linear part acting on a given process. This is done in such a way that the fixed point with respect to the given process would be the solution of the original Stochastic Partial Differential Equation (SPDE). However, it may be necessary to show the well-posedness of the linearized system using a cut-off argument, which may impose additional constraints. We work out under which conditions on the underlying spaces and the cut-off argument one gets a martingale solution of the original SPDE. A similar strategy was applied by Hausenblas and Tolle in [E. Hausenblas and J. Tolle. The stochastic Klausmeier system and a schauder tychonoff type theorem. Potential Analusis, 310:506-554, 2022] to investigate the stochastic Klausmeier system. Secondly, we want to verify the full applicability of the existence Theorem by showing the existence of a martingale solution of a highly nonlinear chemotaxis system with underlying fluid dynamics.

comments
53 pages
fields
Probability
pdf ↗ page arXiv:2401.17668 ↗

We derive the asymptotic behavior of hitting probability at small target of size $O(ε)$ for reflected Brownian motion in domains with suitable smooth boundary conditions, where the boundary of domain contains both reflecting part, absorbing part and target. In this case the domain could be localized near the target and explicit computations are possible. The asymptotic behavior is only related to $ε$ up to some multiplicative constants that depends on the domain and boundary conditions.

comments
23 pages, 7 figures
fields
Probability
pdf ↗ page arXiv:2402.00997 ↗

The HOMFLY polynomial of the $(m,n)$ torus knot $T_{m,n}$ can be extracted from the doubly graded character of the finite-dimensional representation $L_{m/n}$ of the type $A_{n-1}$ rational Cherednik algebra as observed by Gorsky, Oblomkov, Rasmussen and Shende. It is furthermore conjectured that one can obtain the triply-graded Khovanov-Rozansky homology of $T_{m,n}$ by considering a certain filtration on $L_{m/n}$. In this paper, we show that two of the proposed candidates, the algebraic filtration and the inductive filtration, are equal.

comments
Accepted version; 31 pages
journal
Int. Math. Res. Not. 2026, no. 10
fields
Representation Theory, Combinatorics
pdf ↗ page arXiv:2402.18770 ↗

The $r$-neighbor bootstrap percolation is a graph infection process based on the update rule by which a vertex with $r$ infected neighbors becomes infected. We say that an initial set of infected vertices propagates if all vertices of a graph $G$ are eventually infected, and the minimum cardinality of such a set in $G$ is called the $r$-bootstrap percolation number, $m(G,r)$, of $G$. In this paper, we study percolating sets in direct products of graphs. While in general graphs there is no non-trivial upper bound on $m(G\times H,r)$, we prove several upper bounds under the assumption $δ(G)\ge r$. We also characterize the connected graphs $G$ and $H$ with minimum degree $2$ that satisfy $m(G \times H, 2) = \frac{|V(G \times H)|}{2}$. In addition, we determine the exact values of $m(P_n \times P_m, 2)$, which are $m+n$ if $m$ and $n$ are both even, and $m+n-1$ otherwise.

comments
17 pages, 6 figures
fields
Combinatorics
pdf ↗ page arXiv:2403.10957 ↗

Let $X$ be a compact metric space and $Φ=\{\varphi_t\}_{t\in\mathbb{R}}$ be a continuous flow on $X$. We introduce two types of topological pressure for family of discontinuous potentials $a=\{a_t\}_{t>0}$. First, define the topological pressure of family of measurable potentials $a=\{a_t\}_{t>0}$ on a subset $Z$ for flow and proof its invariant principle. The second topological pressure is defined on a invariant subset having a nested family of subsets, we also proof its invariant principle.

comments
18 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2403.15753 ↗

We give a categorical formulation of Kraus' "magic trick" for recovering information from truncated types. Rather than type theory, we work in Van den Berg-Moerdijk path categories with a univalent universe, and rather than propositional truncation we work with arbitrary cofibrations, which includes truncation as a special case. We show, using Kraus' argument that any cofibration with homogeneous domain is a monomorphism. We give some simple concrete examples in groupoids to illustrate the interaction between homogeneous types, cofibrations and univalent fibrations.

fields
Category Theory, Logic
pdf ↗ page arXiv:2403.17961 ↗

Monograph "B. Grechuk, Polynomial Diophantine equations. A systematic approach" suggests solving Diophantine equations systematically in certain order. Many hundreds of the equations are left to the reader. Here, we provide complete solutions to all these equations. The difficulties of solved equations range from elementary to research level. In the last section, we present a summary table of all solved equations ordered by their size, which makes them easy to find. As a result, this document may be used as a database of solved Diophantine equations of small size, to which more difficult equations can be reduced.

fields
General Mathematics
pdf ↗ page arXiv:2404.08719 ↗

Given two smooth manifolds with tangent subbundle distributions, an embedding is Pfaffian if its differential sends the distribution on the source into the distribution on the target. In this paper, we consider the question of existence of Pfaffian embeddings in the specific case where the source is a (2,3,5)-manifold, the target is the 7-dimensional space of isotropic 2-planes in a 6-dimensional symplectic vector space, and the Pfaffian condition is that the derived 3-distribution on the source be mapped into the natural 4-distribution on the target. This is one of the simpler non-trivial cases of the general question on existence of Pfaffian embeddings, but already the answer here requires solution of an interesting differential equation. It turns out that a generic (2,3,5)-manifold does not embed, the first obstruction being the fact that a Pfaffian embeddable (2,3,5)-manifold necessarily has a double root for its Cartan quartic at each point. We determine a complete characterization of embeddable (2,3,5)-manifolds in terms of their associated Cartan geometries, which characterization depends on higher order (non-harmonic) curvature as well.

comments
34 pages; Comments welcome
fields
Differential Geometry
pdf ↗ page arXiv:2404.14988 ↗

We analyze a recently proposed class of algorithms for the problem of sampling from probability distributions $μ^\ast$ in $\mathbb{R}^d$ with a Lebesgue density of the form $μ^\ast(x) \propto \exp(-f(Kx)-g(x))$, where $K$ is a linear operator and $f,g$ convex and non-smooth. The method is a generalization of the primal-dual hybrid gradient optimization algorithm to a sampling scheme. We give the iteration's continuous time limit, a stochastic differential equation in the joint primal-dual variable, and its mean field limit Fokker-Planck equation. Under mild conditions, the scheme converges to a unique stationary state in continuous and discrete time. Contrary to purely primal overdamped Langevin diffusion, the stationary state in continuous time does not have $μ^\ast$ as its primal marginal. Thus, further analysis is carried out to bound the bias induced by the partial dualization, and potentially correct for it in the diffusion. Time discretizations of the diffusion lead to implementable algorithms, but, as is typical in Langevin Monte Carlo methods, introduce further bias. We prove bounds for these discretization errors, which allow to give convergence results relating the produced samples to the target. We demonstrate our findings numerically first on small-scale examples in which we can exactly verify the theoretical results, and subsequently on typical examples of larger scale from Bayesian imaging inverse problems.

fields
Optimization and Control
pdf ↗ page arXiv:2405.18098 ↗

Given i.i.d. sample from a stratified mixture of immersed manifolds of different dimensions, we study the minimax estimation of the underlying stratified structure. We provide a constructive algorithm allowing to estimate each mixture component at its optimal dimension-specific rate adaptively. The method is based on an ascending hierarchical co-detection of points belonging to different layers, which also identifies the number of layers and their dimensions, assigns each data point to a layer accurately, and estimates tangent spaces optimally. These results hold regardless of any ambient assumption on the manifolds or on their intersection configurations. They open the way to a broad clustering framework, where each mixture component models a cluster emanating from a specific nonlinear correlation phenomenon.

fields
Statistics Theory, Differential Geometry
pdf ↗ page arXiv:2405.20066 ↗

In this paper, we introduce mixed-norm Herz-type Besov spaces and establish their $\varphi$-transform characterization in the sense of Frazier and Jawerth. We also prove Sobolev embedding theorems for these spaces. The resulting embeddings extend and improve several known embedding results for mixed-norm Besov spaces.

comments
Due to the technical nature of the subject, we have divided the work into three parts: "Mixed-Norm Herz-Type Besov Spaces", "Mixed-Norm Herz-Type Triebel-Lizorkin Spaces", and "Jawerth-Franke Embeddings for Mixed-Norm Herz-Type Besov and Triebel-Lizorkin Spaces". This division allows for a clearer and more systematic presentation of the results and proofs
fields
Functional Analysis
pdf ↗ page arXiv:2406.14727 ↗

We prove a rational generalization of Haiman's master formula, conjectured by Gorsky and Neguţ: the bigraded Frobenius character of the associated graded of the finite-dimensional representation $L_{m/n}$ of the rational Cherednik algebra at slope $m/n$ can be expressed using the generator of the same slope in the elliptic Hall algebra acting on its polynomial representation. The filtration on $L_{m/n}$ is induced by the Hodge filtration on the cuspidal character $D$-module. As a corollary, we relate the triply-graded Khovanov-Rozansky homology of the torus knot to the sum of hook multiplicity spaces of $L_{m/n}$, proving a conjecture of Gorsky, Oblomkov, Rasmussen and Shende. We further provide a realization of the torus knot homology in terms of explicit coherent sheaves on Hilbert schemes of points in the plane.

comments
Major revisions. A gap in the previous version is filled in: the conclusion drawn from a K-theoretic identity is replaced by a direct computation of characters via shuffle algebras. Results towards cohomology vanishing of relevant sheaves on Hilbert schemes of points on the plane are also added
fields
Representation Theory, Algebraic Geometry, Combinatorics, Quantum Algebra
pdf ↗ page arXiv:2407.00971 ↗

In this paper, we address one of the most basic and fundamental problems in the theory of foliations and ODEs, the topological invariance of the algebraic multiplicity of a holomorphic foliation. For instance, we prove an adapted version of A'Campo-Lê's Theorem for foliations, i.e., the algebraic multiplicity equal to one is a topological invariant in dimension two. This result is further generalized to higher dimensions under mild conditions; as a consequence, we prove that saddle-nodes are topologically invariant. We prove that the algebraic multiplicity is a topological invariant in several classes of foliations that contain, for instance, the generalized curves and the foliations of second type. Additionally, we address a fundamental result by Rosas-Bazan, which states that the existence of a homeomorphism extending through a neighborhood of the exceptional divisor of the first blow-up implies the topological invariance of the algebraic multiplicity. We show that the result holds if the homeomorphism extends locally near a singularity, even if it does not extend over the entire divisor.

comments
A gap was identified in the proof of the theorem asserting the topological invariance of multiplicity one. Consequently, the theorem has been withdrawn from this version
fields
Complex Variables, Algebraic Geometry
pdf ↗ page arXiv:2407.09306 ↗

We study nonparametric regression using an over-parameterized two-layer neural network trained with algorithmic guarantees in this paper. We consider the setting where the training features are drawn uniformly from the unit sphere in $\RR^d$, and the target function lies in an interpolation space commonly studied in statistical learning theory. We demonstrate that training the neural network with a novel Preconditioned Gradient Descent (PGD) algorithm, equipped with early stopping, achieves a sharp regression rate of $\cO(n^{-\frac{2αs'}{2αs'+1}})$, where $α$ parametrizes the polynomial eigenvalue decay of the regular Neural Tangent Kernel (NTK), $λ_j\asymp j^{-2α}$, and $2α=d/(d-1)$ under the spherical uniform design considered here. The target function is assumed to belong to the interpolation space $\bth{\cH_K}^{s'}$ with $s'\ge3$. This rate is even sharper than the currently known nearly-optimal rate of $\cO(n^{-\frac{2αs'}{2αs'+1}})\log^2(1/δ)$~\citep{Li2024-edr-general-domain}, where $n$ is the size of the training data and $δ\in (0,1)$ is a small probability. Our analysis is based on two key technical contributions. First, we present a principled decomposition of the network output at each PGD step into a function in the reproducing kernel Hilbert space (RKHS) of a newly induced integral kernel, and a residual function with small $L^{\infty}$-norm. Second, leveraging this decomposition, we apply local Rademacher complexity theory to tightly control the complexity of the function class comprising all the neural network functions obtained in the PGD iterates. Our results show how PGD changes the effective kernel in the reference training dynamics, inducing an integral kernel with lower complexity than the regular NTK arising from vanilla GD.

comments
Published in the Journal of Machine Learning Research (JMLR), 2026
fields
Statistics Theory
pdf ↗ page arXiv:2407.11353 ↗

In this paper, we present high-performance computing for the BGK model of the Boltzmann equation with a mesh-free method. For the numerical simulation of the BGK equation, we use an Arbitrary-Lagrangian-Eulerian (ALE) method developed in previous work, where the approximation of spatial derivatives and the reconstruction of a function are based on the weighted least squares method. A Graphics Processing Unit (GPU) is used to accelerate the code. The result is compared with sequential and parallel versions of the CPU code. Two- and three-dimensional driven cavity problems are solved, where a speed-up of several orders of magnitude is obtained compared to a sequential CPU simulation. The transport step is implemented as a node-parallel CUDA kernel for both two- and three-dimensional physical space: one GPU thread advances one particle-velocity-node pair by tracing its characteristic foot point and reconstructing the distribution there with a register-resident weighted least squares solve. For the three-dimensional case, no velocity reduction is applicable: a single distribution function $f$ is evolved on the full $N_v^3$ velocity grid, so the transport in every coordinate direction follows the resolved velocity node. The device memory footprint is kept at exactly twice the distribution storage by a structure-of-arrays layout with a single transport buffer; particle management runs on the host, so no device-side scratch copies of the cloud are required.

comments
arXiv admin note: text overlap with arXiv:2109.05822
fields
Numerical Analysis
pdf ↗ page arXiv:2408.02350 ↗

This paper establishes various variational properties of parametrized versions of two convexity-preserving constructs that were recently introduced in the literature: the proximal composition of a function and a linear operator, and the integral proximal mixture of arbitrary families of functions and linear operators. We study in particular convexity, Legendre conjugacy, differentiability, Moreau envelopes, coercivity, minimizers, recession functions, and perspective functions of these constructs, as well as their asymptotic behavior as the parameter varies. The special case of the proximal expectation of a family of functions is also discussed.

fields
Optimization and Control
pdf ↗ page arXiv:2408.07235 ↗

We investigate the zero-temperature large deviation principle for equilibrium states in the context of distance-expanding maps. The logarithmic-type zero-temperature limit in the large deviation principle induces a tropical algebra structure, which motivates our study of the tropical adjoint Bousch operator $\mathcal{L}_A^{*}$ since the Bousch operator $\mathcal{L}_A$ is tropical linear and corresponds to the Ruelle operator $\mathcal{R}_A$. We extend tropical functional analysis, define the adjoint operator $\mathcal{L}_A^{*}$ as a tropical analog of the adjoint Ruelle operator $\mathcal{R}_A^{*}$, and establish the existence and generic uniqueness of tropical eigendensities of $\mathcal{L}_A^{*}$ associated with the maximal eigenvalue. The Aubry set and the Mañé potential, both originating from weak KAM theory, serve as important tools in the representations of tropical eigendensities. With our notion of tropical completeness and our tropical Riesz representation theorem, $\mathcal{L}_A^{*}$ can also be seen as a version of the tropical Koopman operator.

comments
68 pages. Minor polish, reformatted, final published version
journal
Adv. Math. 491 (2026), 110864. 69 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2408.10169 ↗

We prove a restricted projection theorem for a certain one dimensional family of projections from $\mathbb R^n$ to $\mathbb R^k$. The family we consider here arises naturally in the study of quantitative equidistribution problems in homogeneous dynamics.

comments
22 pages, to appear in Canadian Mathematical Bulletin
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2408.11159 ↗

In this work, we establish the large deviation principles of random walk in strongly mixing environments. We show that the quenched and annealed rate functions share the same zero-set whose shape is either a singleton point or a line segment, with an illustrative example communicated and given by F. Rassoul-Agha. Furthermore, this paper reveals that under sufficiently low disorder, the two rate functions match on compact sets of both the interior and the boundary of the domain under finitely strongly mixing condition.

comments
To appear on Electronic Journal of Probability
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2409.06581 ↗

We define a class of skeletons on Berkovich analytic spaces, which we call "accessible", which contains the standard skeleton of the n-dimensional torus for every n and is preserved by G-glueing, by taking the inverse image along a morphism of relative dimension zero, and by taking the direct image along a morphism whose restriction to the involved skeleton is topologically proper.

comments
in French language, 70 pages; this version is the final one, to appear in EPIGA
fields
Algebraic Geometry
pdf ↗ page arXiv:2409.08755 ↗

Let $S/R$ be a Frobenius extension with $_RS_R$ centrally projective over $R$. We show that if $_Rω$ is a Wakamatsu tilting module then so is $_SS\otimes_Rω$, and the natural ring homomorphism from the endomorphism ring of $_Rω$ to the endomorphism ring of $_SS\otimes_Rω$ is a Frobenius extension provided that pd$(ω_T)$ is finite, where $T$ is the endomorphism ring of $_Rω$. We also show that the relative $n$-torsionfreeness of modules is preserved under Frobenius extensions. Furthermore, we give an application, which shows that the generalized G-dimension with respect to a Wakamatsu tilting module is invariant under Frobenius extensions.

comments
arXiv admin note: text overlap with arXiv:2301.01903
fields
Rings and Algebras
pdf ↗ page arXiv:2409.11892 ↗

The special Galilean group, usually denoted SGal(3), is a 10-dimensional Lie group whose important subgroups include the special orthogonal group, the special Euclidean group, and the group of extended poses. We briefly describe SGal(3) and its Lie algebra and show how the group structure supports a unified representation of uncertainty in space and time. Our aim is to highlight the potential usefulness of this group for several robotics problems.

comments
In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) Workshop From Geometry to General Autonomy of Robotic Systems, Abu Dhabi, United Arab Emirates, October 15, 2024. 3 pages, 1 figure
fields
Group Theory
pdf ↗ page arXiv:2409.14276 ↗

Tensor networks are a compressed format for multi-dimensional data. One dimensional tensor networks -- often referred to as tensor trains (TT) or matrix product states (MPS) -- are increasingly being used as a numerical ansatz for continuum functions by ``quantizing'' the inputs into discrete binary digits. Here we demonstrate the power of more general tree tensor networks (TTNs) for this purpose. We provide direct constructions of a number of elementary functions as generic tree tensor networks and interpolative constructions for more complicated functions via a generalization of the tensor cross interpolation algorithm. For a range of multi-dimensional functions we show how more structured tree tensor networks offer a significantly more efficient ansatz than the commonly used tensor train. Finally, we demonstrate how the methods introduced in this work can be used to realize a TTN-based solver for multi-dimensional, non-linear Fredholm equations.

comments
Published Version
journal
SciPost Phys. 21, 095 (2026)
fields
Numerical Analysis
pdf ↗ page arXiv:2410.03572 ↗

We say that a countable discrete group action $α$ on a C$^*$-algebra $A$ is \textit{$\mathcal{W}$-absorbing} if there exist a C$^*$-algebra $B$ and an action $β$ on $B$ such that $α$ is cocycle conjugate to $β\otimes \mathrm{id}_{\mathcal{W}}$ on $B\otimes \mathcal{W}$ where $\mathcal{W}$ is the Razak-Jacelon algebra. In this paper, we completely classify outer $\mathcal{W}$-absorbing actions of finite groups on $\mathcal{W}$ up to conjugacy and cocycle conjugacy.

comments
29 pages, to appear in J. Operator Theory, The style has slightly changed
fields
Operator Algebras
pdf ↗ page arXiv:2410.11213 ↗

In a recent paper, the discrete Gabor transform was connected to a Gabor transform with a time frequency domain given by the flat torus. We show that the corresponding Bargmann-Fock spaces can be expressed as theta functions (or equivalently line bundles on Abelian varieties). We give applications of this viewpoint to frame results for the discrete Gabor transform. In particular, we get necessary conditions which hold in higher dimensions and can expand the known results in the one dimensional case, the primary tool being the theorem of the square. We also give an application to asymptotics of restriction operators which arises via the asymptotic behavior of Bergman kernels and Toeplitz operators for high tensor powers of line bundles and find that discrete time frequency restriction operators will exhibit "plunge" behaviors similar to those of time frequency restriction operators in other contexts.

comments
24 pages, 3rd version, Theorem B has been changed from the last version
fields
Functional Analysis, Complex Variables
pdf ↗ page arXiv:2410.15170 ↗

We prove sharp bounds on the virtual degrees introduced by Larsen and Shalev. This leads to improved bounds on characters of symmetric groups. We then sharpen bounds of Liebeck and Shalev concerning the Witten zeta function. Our main application is a characterization of the fixed-point free conjugacy classes whose associated random walk mixes in 2 steps.

comments
v4: 50 pages, 13 figures. Asymptotic equivalents of the Witten zeta function were added. v3: 50 pages, 12 figures. More general bounds and an application to random maps were added. v2: 44 pages, 12 figures. We added character bounds in terms of the number of cycles and two applications. v1: 37 pages, 11 figures. Comments welcome!
fields
Representation Theory, Combinatorics, Probability
pdf ↗ page arXiv:2411.04347 ↗

In this paper, we use the theory of nonlinear semigroups to establish the existence and uniqueness of both local and global solutions for a partial differential-algebraic equation (PDAE) of index one. This method is applied to a reaction-diffusion system coupled with an elliptic equation in one dimension by transforming the PDAE into a system of linear evolution equations with a Lipschitz-continuous perturbation

comments
The authors are withdrawing this manuscript to revise the theoretical framework and correct incomplete proofs. Further validation and thorough auditing of the mathematical results are required
fields
Analysis of PDEs
pdf ↗ page arXiv:2411.15658 ↗

A standard assumption in the study of logarithmic structures is "fineness", but this assumption is not preserved by intersections, fiber products, and more general limits. We explain how a coherent logarithmic scheme $X$ has a natural decomposition into "fine faces" -- a collection of fine logarithmic subschemes. This allows for importation of the techniques of tropical geometry into the study of more general logarithmic schemes. We explain the relevance of the construction in enumerative geometry and moduli via a range of examples. Techniques developed in the study of binomial schemes lead to effective algorithms for computing the fine faces.

comments
30 pages. v2: minor changes and corrections. Final version to appear in Mathematische Zeitschrift
fields
Algebraic Geometry
pdf ↗ page arXiv:2412.12078 ↗

An ordered graph is a graph with a total order over its vertices. A linear layout of an ordered graph is a partition of the edges into sets of either non-crossing edges, called stacks, or non-nesting edges, called queues. The stack (queue) number of an ordered graph is the minimum number of required stacks (queues). Mixed linear layouts combine these layouts by allowing each set of edges to form either a stack or a queue. The minimum number of stacks plus queues is called the mixed page number. It is well known that ordered graphs with small stack number are characterized, up to a function, by the absence of large twists (that is, pairwise crossing edges). Similarly, ordered graphs with small queue number are characterized by the absence of large rainbows (that is, pairwise nesting edges). However, no such characterization via forbidden patterns is known for mixed linear layouts. We address this gap by introducing patterns similar to twists and rainbows, which we call thick patterns; such patterns allow a characterization, again up to a function, of mixed linear layouts of bounded-degree graphs. That is, we show that a family of ordered graphs with bounded maximum degree has bounded mixed page number if and only if the size of the largest thick pattern is bounded. In addition, we investigate an exact characterization of ordered graphs whose mixed page number equals a fixed integer $ k $ via a finite set of forbidden patterns. We show that for every $ k \ge 2 $, there is no such characterization, which supports the nature of our first result.

comments
An extended abstract of this paper appears in the proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)
fields
Combinatorics
pdf ↗ page arXiv:2412.12786 ↗

In this work, we introduce the notion of a partial action of a group on a strict monoidal category. We propose, in the context of Monoidal categories, new constructions analogous to those existing for partial group actions over an algebra such as the globalization, the subalgebra of partial invariants, and the partial smash product.

comments
50 pages
fields
Category Theory, Representation Theory
pdf ↗ page arXiv:2412.13123 ↗

We study the Monopolist's problem with a focus on the free boundary separating bunched from unbunched consumers, especially in the plane, and give a description of $C^{1,1}(\overlineΩ)$ solutions for the family of square domains $\{(a,a+1)^2\}_{a \ge 0}$. The Monopolist's problem is fundamental in economics, yet widely considered analytically intractable when both consumers and products have more than one degree of heterogeneity. Mathematically, the problem is to minimize a smooth, uniformly convex Lagrangian over the space of nonnegative convex functions. What results is a free boundary problem between the regions of strict and nonstrict convexity. We study both the structure of the free boundary problem on convex domains in $\mathbf{R}^n$ showing that each bunch extends to this boundary and providing a proof in $\mathbf{R}^2$ that the interior free boundary can only fail to be smooth in one of four specific ways (cusp, high frequency oscillations, stray bunch, nontransversal bunch); in addition we offer a description of $C^{1,1}(\overlineΩ)$ solutions to Rochet and Choné's example on the family of squares $Ω= (a,a+1)^2$, where we discover bifurcations first to targeted and then to blunt bunching as the distance $a \ge 0$ to the origin is increased. To do this, we extend the localization for measures in convex-order to accommodate potential discontinuities in the product allocation map at the fixed boundary. We also employ techniques from the study of the Monge–Ampère equation and the obstacle problem.

comments
63 pages. Addition of a C^{1,1} assumption and small changes to the classification result
fields
Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2412.15505 ↗

We consider overdamped Langevin diffusions in Euclidean space, with curvature equal to the spectral gap. This includes the Ornstein–Uhlenbeck process as well as non-Gaussian and non-product extensions with convex interaction, such as the Dyson process from random matrix theory. We show that a cutoff phenomenon or abrupt convergence to equilibrium occurs in high dimension, at a critical time equal to the logarithm of the dimension divided by twice the spectral gap. This cutoff holds for Wasserstein distance, total variation, relative entropy, and Fisher information. A key observation is a relation to a spectral rigidity, linked to the presence of a Gaussian factor. A novelty is the extensive usage of functional inequalities, even for short-time regularization, and the reduction to Wasserstein. The proofs are short and conceptual. Since the product condition is satisfied, an Lp cutoff holds for all finite p. We moreover discuss a natural extension to Riemannian manifolds, a link with logarithmic gradient estimates in short-time for the heat kernel, and ask about stability by perturbation. Finally, beyond rigidity but still for diffusions, a discussion around the recent progress on the product condition for non-negatively curved diffusions leads us to introduce a new curvature product condition.

comments
19 pages, post-publication version, fix some problems
journal
Comptes Rendus. Mathématique 2025, Vol. 363, p. 1103-1121
fields
Probability, Differential Geometry, Functional Analysis
pdf ↗ page arXiv:2412.15969 ↗

We study the occurrence of historical behavior for almost every point in the setting of skew products with one-dimensional fiber dynamics. Under suitable ergodic conditions, we establish that a weak form of the arcsine law leads to the non-convergence of Birkhoff averages along almost every orbit. As an application, we show that this phenomenon occurs for one-step skew product maps over a Bernoulli shift, where the stochastic process induced by the iterates of the fiber maps is conjugate to a random walk. Furthermore, we revisit known examples of skew products that exhibit historical behavior almost everywhere, verifying that they fulfill the required ergodic and probabilistic conditions. Consequently, our results provide a unified and generalized framework that connects such behaviors to the arcsine distribution of the orbits.

fields
Dynamical Systems
pdf ↗ page arXiv:2501.00266 ↗

The exact minimum-degree thresholds that guarantee the existence of $k$ vertex-disjoint copies of the complete graph $K_r$ in an $n$-vertex graph were determined in the celebrated theorems of Dirac (1952) for $r=2$, Corrádi–Hajnal (1963) for $r=3$, and Hajnal–Szemerédi (1970) for general $r \ge 4$. A natural and fundamental problem is to determine the corresponding average-degree (or density) thresholds. This problem turns out to be substantially more difficult. The seminal theorem of Erdős–Gallai (1959) resolved the case $r=2$. The case $r=3$ was settled for large $n$ by Allen, Böttcher, Hladký, and Piguet~\cite{ABHP15}, who remarkably identified four distinct classes of extremal constructions arising in different ranges of $k$. They further posed the problem of establishing a density analogue of the Hajnal–Szemerédi theorem, noting that ``We are not even sure what the complete family of extremal graphs should be.'' In this paper, we establish an asymptotic density Hajnal-SzemerHedi theorem for \(K_4\) by determining \(\mathrm{ex}(n,(k+1)K_4)\) up to an additive \(O(n)\) term for all integers \(n\ge 4k\ge 0\). Five families of constructions show that this bound is sharp up to an additive \(O(n)\) term. For general \(r\ge 5\), we propose a candidate family consisting of \(r+1\) extremal construction classes.

comments
2 tables, 50-ish figures, comments are welcome
fields
Combinatorics
pdf ↗ page arXiv:2501.00801 ↗

Approximate Leave-One-Out Cross-Validation (ALO-CV) is a method that has been proposed to estimate the generalization error of a regularized estimator in the high-dimensional regime where dimension and sample size are of the same order, the so-called ``proportional regime''. A new analysis is developed to derive the consistency of ALO-CV for non-differentiable regularizers under Gaussian covariates and strong convexity. Using a conditioning argument, the difference between the ALO-CV weights and their counterparts in mean-field inference is shown to be small. Combined with upper bounds between the mean-field inference estimate and the leave-one-out quantity, this provides a proof that ALO-CV approximates the leave-one-out quantity up to negligible error terms. Linear models with square loss, robust linear regression and single-index models are explicitly treated.

fields
Statistics Theory
pdf ↗ page arXiv:2501.02624 ↗

We give a sufficient condition for a Borel subset $E\subset X$ of a complete metric space with $\mathrm{H}^n(E)<\infty$ to be $n$-rectifiable. This condition involves a decomposition of $E$ into rectifiable curves known as an \emph{Alberti representation}. Precisely, we show that if $\mathrm{H}^n|_E$ has $n$ independent Alberti representations, then $E$ is $n$-rectifiable. This is a sharp strengthening of prior results of Bate and Li. It has been known for some time that such a result answers many open questions concerning rectifiability in metric spaces, which we discuss.

comments
1. Parts of the introduction have been shortened or rewritten. 2. The level of abstraction in the proof has been reduced in some places and the notation simplified, with the proof ideas remaining essentially identical. 3. The sections have been restructured. 4. The title has been adjusted and most secondary content regarding the quantitative PDE result has been removed
fields
Metric Geometry
pdf ↗ page arXiv:2501.02948 ↗

Mirzakhani-Zograf proved the large genus asymptotic expansions of Weil-Petersson volumes and showed that the asymptotic coefficients are polynomials in $\mathbb Q[π^{-2},π^2]$. They also conjectured that these are actually polynomials in $\mathbb Q[π^{-2}]$. In this paper, we prove Mirzakhani-Zograf's conjecture.

comments
I am withdrawing arXiv: 2501.06421 because the referees identified a substantive gap in the proof of the key lemma; the claimed result is not established. I apologize for any inconvenience caused. I thank the referees for their careful reading
fields
Algebraic Geometry, Mathematical Physics, Combinatorics
pdf ↗ page arXiv:2501.06421 ↗

We introduce a method to embed edge-colored graphs into families of expander graphs, which generalizes a framework developed by Draganić, Krivelevich, and Nenadov (2022). As an application, we show that each family of sufficiently pseudo-random graphs on $n$ vertices contains every edge-colored subdivision of $K_Δ$, provided that the distance between branch vertices in the subdivision is large enough, the average degree of each graph in the family is at least $(1+o(1))Δ$, and the number of vertices in the subdivision is at most $(1-o(1))n$. This extends the subdivision-embedding results of Draganić, Krivelevich, and Nenadov to the colorful setting. Even in the monochromatic case, our work extends the earlier result, which only applied to graphs with average degree at most $O(n^{1/5})$. This work is motivated in part by the problem of finding structures in distance graphs defined over finite vector spaces. In particular, we obtain nearly spanning subdivisions of complete graphs with arbitrary prescribed nonzero edge distances in sufficiently large subsets of these spaces.

fields
Combinatorics
pdf ↗ page arXiv:2501.14286 ↗

A pure snake configuration is a bijection $σ:\mathbb{Z}^2 \to \mathbb{Z}^2$ containing no two-cycles and such that for each $x \in \mathbb{Z}^2$ we have $σ(x) \in \{ x , x+ \mathbf{e}^1, x+\mathbf{e}^2 , x- \mathbf{e}^2 \}.$ The non-trivial cycles of a pure snake configuration may be regarded as a collection of non-intersecting paths in $\mathbb{Z}^2$ that may travel right, up, or down (but not left) from a given vertex. Pure snake configurations are a generalisation of lozenge tilings, which are in natural correspondence with paths that only travel right or up. We introduce a partition function on a finite version of this model and study the probabilistic properties of random pure snake configurations chosen according to their contribution to this partition function. Under a suitable weighting, the model is integrable in the sense that we have access to explicit formulas for its partition function and correlation function. We utilise the integrable structure of this model in several applications through its various scaling limits, such as to prove a traffic representation of ASEP on the ring, generalising the analogous result for TASEP by the first author.

comments
47 pages. To appear in the Annals of Probability
fields
Probability, Combinatorics
pdf ↗ page arXiv:2501.15483 ↗

This paper lays the foundation of a theory for bias tuning in neuromorphic cameras, a novel sensing technology also known as "event cameras". We begin by formulating the high-level effect of the sensitivity biases on the camera's event rate in mathematical terms. We then show that, as a corollary of the Poincare-Miranda theorem, the commonly used tuning principles of rate budgeting and polarity balancing lead to a unique configuration of the sensitivity biases. As a corollary, we show how by adopting these principles, the multi-variable bias-tuning problem reduces to a two-parameter problem that can be resolved experimentally.

comments
17 pages, 4 figures
journal
Ben-Ezra, D.E.C., Brisk, D. and Tal, A., 2026. On the theory of bias tuning in event cameras. Optics & Laser Technology, 204, p.116681
fields
Optimization and Control
pdf ↗ page arXiv:2501.18788 ↗

We use a Gröbner basis technique first introduced by Knutson, Miller and Yong to study the interplay between properties of a graph $G$ and algebraic properties of the toric ideal that it defines. We first recover a well-known height formula for the toric ideal of a graph $I_G$ and demonstrate an algebraic property that can detect when a graph deletion is bipartite. We also bound the chromatic number $χ(G)$ using information about an initial ideal of $I_G$.

comments
12 pages, 1 figure
fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2502.08069 ↗

We investigate the Randomized Stochastic Accelerated Gradient (RSAG) method, utilizing either constant or adaptive step sizes, for stochastic optimization problems with generalized smooth objective functions. Under relaxed affine variance assumptions for the stochastic gradient noise, we establish high-probability convergence rates of order $\tilde{O}\left(\sqrt{\log(1/δ)/T}\right)$ for function value gaps in the convex setting, and for the squared gradient norms in the non-convex setting. Furthermore, when the noise parameters are sufficiently small, the convergence rate improves to $\tilde{O}\left(\log(1/δ)/T\right)$, where $T$ denotes the total number of iterations and $δ$ is the probability margin. Our analysis is also applicable to SGD with both constant and adaptive step sizes.

comments
The first version was posted on arXiv in February 2025, and the paper was accepted by JOTA in September 2026. This version includes additional numerical experiments and minor editorial revisions
journal
Journal of Optimization Theory and Applications (2026)211:27
fields
Optimization and Control
pdf ↗ page arXiv:2502.11125 ↗

We investigate and compare the behaviors of complex curves on two major types of compact Shimura surfaces: compact variants of Picard and Hilbert modular surfaces. They are quotients of complex hyperbolic balls corresponding to moduli problems for abelian varieties with certain endomorphism types. We prove that if we fix a genus bound, then when the defining discriminant is large enough, low genus curves on the compact variant of Picard modular surfaces do not exist, while low genus curves may persist on the compact variant of Hilbert modular surfaces only if they are special curves, which parametrize those with extra endomorphisms. These results are special cases of a complex function field analogue of uniform boundedness on endomorphism types of abelian varieties. The proof requires understanding the repulsion of special subvarieties and relies on volume estimates in hyperbolic geometry.

comments
48 pages. Major updates compared to the previous version: the case of compact variant of Hilbert modular surfaces is included and it shows different geometric patterns; many of the proofs are upgraded to a more general setting. I will upload a more polished version soon
fields
Algebraic Geometry, Differential Geometry, Number Theory
pdf ↗ page arXiv:2502.11582 ↗

Let M be the generic poset, defined as the Fraïssé limit of the class of finite posets. We show that every countably infinite poset A can be embedded with coinfinite image into M so that each automorphism of the image of A extends uniquely to an automorphism of M.

comments
final version, accepted to the Journal of Symbolic Logic
fields
Logic
pdf ↗ page arXiv:2502.16695 ↗

Let $p$ be a prime and $\mathbb{Z}_p$ the ring of $p$-adic integers. Let $G$ denote the simple group of order 168, 504 or 360. In this paper, we study the structure of the $χ$-part of a $\mathbb{Z}_p[\mathrm{Im}(χ)][G]$-module come from ideal class groups, Artin $L$-functions and Iwasawa theory. After this manuscript was posted, it was pointed out to the author that the main theorem holds for an arbitrary finite group and follows directly from the structure theorem for group rings; see the note added after Theorem 1.1.

comments
We proved that Theorems 1.1 and 1.2 also hold for the character of degree 8 of $A_6$, and corrected some errors. After Theorem 1.1, we added a note that Theorem 1.1 holds for general finite groups using an alternative method
fields
Number Theory, Rings and Algebras, Representation Theory
pdf ↗ page arXiv:2502.20800 ↗

We study the equidistribution of integers of the form $n= x_1^2 + \cdots + x_d^2$ under the arithmetic constraints given by $(\mathbb{Z}/p\mathbb{Z})^d$. The first step in addressing this problem is to construct modular forms whose Fourier expansion coefficients correspond to the counting problem over the quadric in $\mathbb{Z}^d$ induced by the standard quadratic form, subject to the aforementioned arithmetic constraints. The weak modular property of these modular forms allows us to use representation theory to identify the congruence subgroup to which our modular forms correspond. We then establish a necessary and sufficient condition for functions on $(\mathbb{Z}/p\mathbb{Z})^d$ that defines a cusp form. Finally, we conclude that the equidistribution phenomenon occurs locally on $p+1$ orbits for $d \geq 4$.

comments
35 pages, published in Forum Math
fields
Number Theory, Representation Theory
pdf ↗ page arXiv:2503.03873 ↗

We study centralized two-way dynamic matching markets in which agents arrive stochastically over time and wait in queues associated with their types. We focus on static priority policies that assign each agent type a fixed ranking over its neighbors and make online matching decisions using only queue availability. We propose the General Priority ($\mathbf{GP}$) policy, which builds on the Tree Priority ($\mathbf{TP}$) policy introduced in [KAG25]. Under the general position gap condition, $\mathbf{GP}$ selects matches using a nondegenerate optimal basic solution of the fluid relaxation. It prioritizes children over parents within trees and consistently gives clockwise neighbors priority over counterclockwise neighbors on each cycle. We establish the optimal all-time regret scaling $O(ε^{-1})$ for $\mathbf{GP}$ on general two-way matching networks, where the general position gap $ε$ measures the fluid relaxation's distance from degeneracy. In particular, this resolves the conjecture by [KAG25] on the optimal $ε$-dependence for $\mathbf{TP}$.

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

The cutoff phenomenon, conceptualized at the origin for finite Markov chains, states that for a parametric family of evolution equations, started from a point, the distance towards a long time equilibrium may become more and more abrupt for certain choices of initial conditions, when the parameter tends to infinity. This threshold phenomenon can be seen as a critical competition between trend to equilibrium and worst initial condition. In this note, we investigate this phenomenon beyond stochastic processes, in the context of the analysis of nonlinear partial differential equations, by proving cutoff for the fast diffusion and porous medium Fokker-Planck equations on the Euclidean space, when the dimension tends to infinity. We formulate the phenomenon using quadratic Wasserstein distance, as well as using specific relative entropy and Fisher information. Our high dimensional asymptotic analysis uses the exact solvability of the model involving Barenblatt profiles. It includes the Ornstein-Uhlenbeck dynamics as a special linear case.

comments
14 pages, fixes some problems
fields
Analysis of PDEs, Functional Analysis, Probability
pdf ↗ page arXiv:2503.11770 ↗

In this paper we introduce and study several multivariate, heavy-tailed distribution classes, and we explore their closure properties and their applications. We consider the class of multivariate positively decreasing distributions, and its intersection with other multivariate distribution classes.

fields
Probability
pdf ↗ page arXiv:2503.12842 ↗

This paper studies convex nonsmooth composite multiobjective optimization problems, whose objectives combine a convex term admitting a smooth approximation with a proper, closed, and convex term. A natural way is to smooth the nonsmooth term and apply proximal gradient method, but reducing the smoothing parameter shrinks step sizes, and solving successive smooth approximations to approach the original solution is computationally expensive. To address this issues, we propose a smoothing accelerated proximal gradient method with nonmonotone backtracking strategy. Each outer iteration starts from a reduced base smoothness estimate, which is increased only if the criterion fails, while the momentum update is linked to the estimate through an exact identity used in the convergence analysis. Under a compact level-set assumption and bounds of parameters, we use merit function to establish rates of $\mathcal{O}(k^{-σ})$, $\mathcal{O}((\log k)/k)$, and $\mathcal{O}(k^{σ-2})$ for different smoothing parameters. Then quasi-Fejér monotonicity yields convergence of the full sequence to a weak Pareto solution. Numerical experiments show that the method can reduce computational cost while preserving high-quality Pareto fronts and examine how the smoothing parameter affects performance.

fields
Optimization and Control
pdf ↗ page arXiv:2503.12915 ↗

We study two important numerical invariants, Hilbert–Kunz multiplicity and $F$-signature, on the spectrum of a Noetherian $\mathbf{F}_p$-algebra $R$ that is not necessarily $F$-finite. When $R$ is excellent, we show that the limits defining the invariants are uniform. As a consequence, we show that the $F$-signature function (of the ring, pairs, and triples) is lower semi-continuous, and the Hilbert–Kunz multiplicity function is upper semi-continuous provided $R$ is locally equidimensional. Uniform convergence is achieved via a uniform version of Cohen–Gabber theorem. We prove the results under weaker conditions than excellence.

comments
38 pages. v5 -- substantial new materials, mainly by the new author Cheng Meng, are introduced to deal with the pair and triple cases
fields
Commutative Algebra
pdf ↗ page arXiv:2503.13846 ↗

We study quadratically regularized unbalanced optimal transport with Pearson marginal penalties and a lower bound $δ\ge0$ on the plan, including the sparse case $δ=0$. We organize the analysis around the active interface, where the plan switches from its lower bound to larger values. We prove a Newton remainder estimate that depends linearly on the marginal measure of the boundary layer around this interface, and a maximum-norm inverse estimate uniform over all Newton derivatives and cell volumes. Together they give local superlinear convergence of semismooth Newton iteration in function space, of q-order at least $1+α$ when the boundary-layer measure is $O(t^α)$, and a common convergence neighborhood along each refinement sequence whose data converge uniformly. Transverse interfaces give second-order supercloseness of the discrete potentials to the cell averages of the continuum potentials. A directional curvature condition on the input data verifies the interface condition before the solution is known and yields an explicit Newton convergence radius on all sufficiently fine meshes, uniformly in the lower bound. A globalized inexact semismooth Newton iteration has mesh-independent numbers of outer iterations and of full-array operations, that is, passes over the plan array. Its output satisfies an a posteriori error bound relative to the continuum optimal plan. Experiments test the rates at transverse interfaces and at interfaces with tangencies, the curvature criterion, and the algorithmic work. All estimates hold for a fixed regularization parameter and a fixed lower bound on the densities.

comments
The paper is a more focused version of the previous one "Control, Optimal Transport and a Sinkhorn-inspired algorithm for Neural Differential Equations". In this version, we focus on the UOT scheme with Pearson penalties, that is, we provide a much deeper analysis, and leave the other contents out for deeper studies in the future
fields
Numerical Analysis, Optimization and Control
pdf ↗ page arXiv:2503.15105 ↗

Non-Hermitian systems have attracted significant interest because of their intriguing properties, including exceptional points (EPs), where eigenvalues and the corresponding eigenstates coalesce. In particular, quantum systems with EPs exhibit an enhanced sensitivity to external perturbations, which increases with the order of the EP. Therefore, higher-order EPs hold significant potential for advanced sensing applications, but they are challenging to achieve due to stringent symmetry requirements. In this work, we study the dynamics of a generalized lossy waveguide beam splitter with asymmetric coupling by introducing non-reciprocity as a tunable parameter to achieve higher-order EPs even without dissipation. Moreover, we analyze the evolution of NOON-states under activated non-reciprocity, highlighting its impact on quantum systems. Our results open new pathways for realizing higher-order EPs in non-reciprocal open quantum systems.

comments
13 pages, 7 figures
journal
Optics Express 33, 26329-26341(2025)
fields
Mathematical Physics
pdf ↗ page arXiv:2503.21445 ↗

Accurate finite element analysis of refined shell theories is crucial but often hindered by membrane and shear locking effects. While various element-based locking-free techniques exist, this work addresses the problem at the theoretical level by utilizing results from asymptotic analysis. A formulation of a 2D refined shell theory incorporating transverse shear is developed using rescaled coordinates and angles of rotation, ensuring equal asymptotic orders of magnitude for extension, bending, and rotation measures and their respective stiffnesses. This novel approach, implemented via isogeometric analysis, is shown to be both asymptotically accurate relative to the underlying refined shell theory and inherently free from membrane and shear locking. Numerical simulations of semi-cylindrical shells show excellent agreement between the analytical solutions, 2D refined shell theory predictions, and 3D elasticity theory, validating the effectiveness and accuracy of the proposed formulation.

comments
49 pages, 23 figures
journal
Computer Methods in Applied Mechanics and Engineering 446 (2025) 118327
fields
Numerical Analysis
pdf ↗ page arXiv:2503.23369 ↗

We study feedforward neural networks with inputs from a topological space (TFNNs). We prove a universal approximation theorem for shallow TFNNs, which demonstrates their capacity to approximate any continuous function defined on this topological space. As an application, we obtain an approximative version of Kolmogorov's superposition theorem for compact metric spaces.

comments
Published version with two minor corrections. Namely, in Theorem 2.1, C(K) was replaced with C(X), and in the proof of Proposition 2.1, the formula for τ(t) was corrected. The results remain unchanged
journal
V.E. Ismailov, Ann. Math. Artif. Intell. (2026)
fields
Functional Analysis
pdf ↗ page arXiv:2504.02321 ↗

Motivated by the recent work of Xiao and Zhong [AIMS Math. 9 (2024), 35125–35150: MR4840882], we propose a generalized inverse for a hyper-dual matrix called hyper-dual group generalized inverse (HDGGI). Firstly, we characterize the existence of the HDGGI of a hyper-dual matrix and we show that it is unique, whenever exists. The HDGGI is then used to solve a linear hyper-dual system. We discuss the minimal $P$-norm least-squares properties of hyper-dual group inverse. We also exploit some sufficient conditions under which the reverse and forward-order laws for a particular form of the HDGGI and hyper-dual Moore-Penrose generalized inverse (HDMPGI) hold. Using the definition of dual matrix of order $n$, we finally establish necessary and sufficient condition for the existence of the group inverse of a dual matrix of order $n$.

comments
We propose a generalized inverse for a hyper-dual matrix called hyper-dual group generalized inverse (HDGGI). Under certain necessary and sufficient conditions, we establish the existence of the HDGGI of a hyper-dual matrix. We then show that the HDGGI is unique (whenever exists)
fields
Rings and Algebras, Commutative Algebra, Functional Analysis
pdf ↗ page arXiv:2504.05264 ↗

We consider the Mathematical Program with Complementarity Constraints (MPCC). One of the main challenges in solving this problem is the systematic failure of standard constraint qualifications. Carefully accounting for the combinatorial nature of the complementarity constraints, tractable versions of the Mangasarian-Fromovitz Constraint Qualification (MFCQ) have been designed and widely studied in the literature. This paper looks closely at two such MPCC-MFCQs and their influence on MPCC algorithms. As a key contribution, we introduce a third MPCC-MFCQ, lying between these two, under which we prove the convergence of the inexact sequential penalisation and Scholtes relaxation algorithms. This significantly weakens the assumptions currently used in the literature. We then form the problem of tuning hyperparameters of a nonlinear Support Vector Machine (SVM), a fundamental machine learning problem for classification, as an MPCC. For this application, we establish that the aforementioned new qualification holds under very mild restrictions. Moreover, we program robust implementations and carry out comprehensive numerical experiments on real-world data sets, where we show that the sequential penalisation method applied to the MPCC formulation for tuning SVM hyperparameters can outperform both the Scholtes relaxation technique and the derivative-free methods from the machine learning literature.

fields
Optimization and Control
pdf ↗ page arXiv:2504.13006 ↗

The topological dynamics of the horocyclic flow h_R on the unit tangent bundle of a geometrically finite hyperbolic surface is well known. In particular on such a surface the flow h_R is minimal or the minimal sets are the periodic orbits. When the surface is geometrically infinite, the situation is more complex and the presence of possible irregular orbits makes the description of minimal sets complicated. In this text, we construct a family of infinite hyperbolic surfaces for which the horocyclic flow defined on the unit tangent bundle is not minimal.

comments
8 pages et 2 figure
fields
Dynamical Systems, Geometric Topology
pdf ↗ page arXiv:2504.20274 ↗

We establish compatibility of Lie structures that appear in homotopy calculus of functors and isotopy calculus of embeddings. On one hand, we give a new proof of the Johnson–Arone–Mahowald result describing the layers of the Goodwillie tower of the identity functor, and we directly compare the spectral Lie bracket with the classical Whitehead bracket on spaces. On the other hand, we geometrically define a bracket on the layers of the embedding calculus tower for embeddings of arcs. These results are unified through the same technical tool, a newly defined bracket on total homotopy fibres of collapsing cubes of wedge sums.

comments
v1: 21 pages, 1 figure v2: Accepted version, substantially revised after the referees' reports, for which I am deeply grateful. 25 pages, 1 figure
fields
Algebraic Topology, Geometric Topology
pdf ↗ page arXiv:2505.01375 ↗

In this article, we study the spectra of matrix-valued contractions of the Gaussian Orthogonal Tensor Ensemble (GOTE). Let $\mathcal{G}$ denote a random tensor of order $r$ and dimension $n$ drawn from the density \[ f(\mathcal{G}) \propto \exp\bigg(-\frac{1}{2r}\|\mathcal{G}\|^2_{\mathrm{F}}\bigg). \] For $\mathbf{w} \in \mathbb{S}^{n - 1}$, the unit-sphere in $\mathbb{R}^n$, we consider the matrix-valued contraction $\mathcal{G} \cdot \mathbf{w}^{\otimes (r - 2)}$ when both $r$ and $n$ go to infinity such that $r / n \to c \in [0, \infty]$. We obtain semicircle bulk-limits in all regimes, generalising the works of Goulart et al. (2022); Au and Garza-Vargas (2023); Bonnin (2024) in the fixed-$r$ setting. We further study the edge-spectrum. We obtain a Baik-Ben Arous-Péché phase-transition for the largest and the smallest eigenvalues at $r \ge 4$, generalising a result of Mukherjee et al. (2024) in the context of adjacency matrices of random hypergraphs. For $r = 3$, the fluctuations of the extreme eigenvalues are given by the eigenvalues of a stochastic Airy operator, whereas for $r \ge 4$, the fluctuations are Gaussian. Finally, we report some results, in the case $r = 4$, on mixed contractions $\mathcal{G} \cdot \mathbf{u} \otimes \mathbf{v}$, $\mathbf{u}, \mathbf{v} \in \mathbb{S}^{n - 1}$. While the total variation distance between the joint distributions of the entries of $\mathcal{G} \cdot \mathbf{u} \otimes \mathbf{v}$ and $\mathcal{G} \cdot \mathbf{u} \otimes \mathbf{u}$ goes to $0$ when $\|\mathbf{u} - \mathbf{v}\| = o(n^{-1})$, the bulk and the largest eigenvalues of these two matrices share the same limit profile as long as $\|\mathbf{u} - \mathbf{v}\| = o(1)$. Furthermore, it turns out that there are no outlier eigenvalues in the spectrum of $\mathcal{G} \cdot \mathbf{u} \otimes \mathbf{v}$ when $\langle \mathbf{u}, \mathbf{v} \rangle = o(1)$.

comments
64 pages, 2 figures; abstract shortened to meet arXiv requirements
fields
Probability
pdf ↗ page arXiv:2505.10555 ↗

For $a\in R$, let $P_a$ denote the intersection of all minimal prime ideals of $R$ containing $a$. An ideal $I$ of a ring $R$ is called a $z^{\circ}$-ideal if $P_a\subseteq I$ for all $a\in I$. In this paper, we first investigate the class of $z^{\circ}$-ideals in non-commutative rings. We provide characterizations of $z^{\circ}$-ideals in 2-by-2 generalized triangular matrix rings, full and upper triangular matrix rings, and semiprime rings. Next, we explore new properties of the lattice $rAnn(id(R))$, the set of right annihilator ideals of $R$. We prove that $rAnn(id(R))$ forms an algebraic frame when $R$ is semiprime and a coherent frame when $R$ is a reduced ring. Furthermore, we characterize the smallest (resp., largest) right annihilator ideal containing (resp., contained in) an ideal $I$ of an $SA$-ring $R$.

journal
Journal of Advanced Mathematical Modeling, 2026
fields
General Topology
pdf ↗ page arXiv:2505.13647 ↗

The aim of this work is to present the black hole information problem and discuss the assumptions and hypotheses necessary for its formulation. As the problem arises in the framework of semiclassical gravity, we first review the necessary notions to describe Lorentzian manifolds equipped with physical properties, as well as the physical concepts of the theory that describes the gravitational interaction as the curvature of spacetime, general relativity. From its classical perspective, we develop the formalism to study the dynamical aspects of black holes in spacetimes obeying suitable causality conditions. Equipped with conjectures that nature censors naked singularities and that black holes reach a stationary configuration after they form, the black hole uniqueness theorems allow us to review several relations for the geometrical quantities associated with them. Following considerations of the other fundamental interactions, which are described by quantum field theory, we review the arguments in the formalism of quantum field theory in curved spacetime that give rise to the effective particle creation effect, its approximately thermal character, and the concept of black hole evaporation. With a precise quantification of information in quantum mechanics and assuming that the condition for physically acceptable states is given by the Hadamard condition, we review the result that entanglement between causally complementary regions is an intrinsic feature of quantum field theory. As a consequence, we discuss how the formation and complete evaporation of black holes leads to information loss. Conscious that such a prediction follows if no deviations from the semiclassical picture occur at the Planck scale, we discuss alternatives to this nonunitary dynamical evolution and formulate the black hole information problem. Lastly, we analyze the assumptions and hypotheses that lead to the problem.

comments
MSc dissertation defended at University of Sao Paulo (Brazil) on May 7th 2024. Minor typos corrected
fields
Mathematical Physics
pdf ↗ page arXiv:2505.17220 ↗

We present an optimization-based approach for fuel-efficient spacecraft rendezvous to Gateway, a lunar space station architecture based on a near rectilinear halo orbit (NRHO) around the Earth-Moon L2 point. Our main contribution is a method that ensures safety at all times in the presence of Gaussian uncertainty while incorporating disturbance compensation feedback through correction maneuvers. Specifically, the approach: i) ensures passive safety and satisfies path constraints at all times, ii) satisfies the specifications for critical decision points along the trajectory, and iii) accounts for common uncertainties arising from orbital insertion maneuvers, actuation, and navigation measurements. To account for these uncertainties, we use both chance constraints and disturbance compensation feedback to bound the effects of errors. We leverage sequential convex programming (SCP) together with an isoperimetric reformulation of continuous-time path constraints, including passive safety, to eliminate the risk of inter-sample constraint violations common in existing methods. This enables sparse time discretization that supports efficient offline mission design and analysis and aligns with operational preferences for less frequent control actions. We demonstrate the method on a case study representative of Gateway rendezvous operations.

comments
Accepted to Journal of Guidance, Control, and Dynamics
fields
Optimization and Control
pdf ↗ page arXiv:2505.17251 ↗

This paper considers the stochastic convex composite optimization problem and presents multi-cut stochastic approximation (SA) methods for solving it, whose models in expectation overestimate its objective function. The multi-cut model obtained by taking the maximum of a finite number of linearizations of the stochastic objective function provides a biased estimate of the objective function, with the error being uncontrollable. Instead, our proposed SA method uses models obtained by taking the maximum of a finite number of one-cut models, i.e., suitable convex combinations of linearizations of the stochastic objective function. It is shown that the proposed methods achieve nearly optimal convergence rate and have computational performance comparable, and sometimes superior, to other SA-type methods.

fields
Optimization and Control
pdf ↗ page arXiv:2505.17463 ↗

Deep learning models are increasingly subject to explicit requirements, or constraints, such as safety levels, fairness limits, and sparsity budgets. In practice, such requirements are often handled through fixed weighted-sum penalization: the constraints are added to the task loss with fixed coefficients, and the resulting scalarized objective is minimized. This position paper argues that fixed penalization is often ill-suited to deep learning problems with non-negotiable requirements, for three main reasons. First, in non-convex settings, the penalized and constrained problems are not, in general, equivalent, so a minimizer of the penalized objective need not solve the constrained problem. Second, a penalty coefficient sets an objective-constraint trade-off rather than the constraint level, so finding an acceptable coefficient often takes trial and error, each trial a full training run. Third, fixed penalization weakens hard requirements into soft penalties to be traded off against task performance. As a result, compliance is no longer built into the problem, and requirements can be quietly relaxed. We therefore argue that, when a deep learning problem specifies non-negotiable requirements, one should solve the constrained problem itself instead of a surrogate defined by fixed penalization.

comments
Accepted at NeurIPS 2026 (Position Paper Track). 10 pages of main text plus appendix; 3 figures, 4 tables. Code: https://github.com/merajhashemi/constraints-vs-penalties
fields
Optimization and Control
pdf ↗ page arXiv:2505.20628 ↗

In this survey article, we give an introduction to the notion of a 2-Segal set and prove that 2-Segal sets are equivalent to pseudomonoids in the bicategory of spans. The proof utilizes graphical techniques for 2-Segal sets and spans that should be useful in more general settings. There are procedures for obtaining an associative algebra from a 2-Segal set (satisfying finiteness conditions). We describe these procedures and give several examples of algebras arising from 2-Segal sets. Wherever possible, we avoid higher category theory so as to make the paper accessible to a wide audience.

comments
v2: Numerous changes, incorporating referee comments. Most notable changes are the addition of Section 6.1 and Example 6.6. To appear in Boletín de Matemáticas
fields
Category Theory, Algebraic Topology
pdf ↗ page arXiv:2505.22832 ↗

Let ${\mathbf U}_q^-$ be the negative half of a quantum group of finite type. Let $P$ be the transition matrix between the canonical basis and a PBW basis of ${\mathbf U}_q^-$. In the case ${\mathbf U}_q^-$ is symmetric, Antor gave a simple algorithm of computing $P$ by making use of monomial bases. By the folding theory, ${\mathbf U}_q^-$ (symmetric, with a certain automorphism) is related to a quantum group $\underline{\mathbf U}_q^-$ of non-symmetric type. In this paper, we extend the results of Antor to the non-symmetric case, and discuss the relationship between the algorithms for ${\mathbf U}_q^-$ and for $\underline{\mathbf U}_q^-$.

comments
52 pages, the final version, to appear in Journal of Algebra
fields
Quantum Algebra
pdf ↗ page arXiv:2506.00793 ↗

The main aim of this article is to give new classes of smooth projective varieties over characteristic $p>0$ that admit flat liftings over the Witt vectors together with additional data (logarithmic structure and the Frobenius morphism) by showing a descending property of such Frobenius liftability. We establish a refined form of the classical result due to Mehta-Srinivas on the existence of canonical liftings. For this purpose, we also establish a result on the algebraization of certain $p$-adic formal schemes.

comments
revised upon the referee's report
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2506.01345 ↗

In this paper, we work in the framework of Hilbert-valued Wiener structures and derive a functional version of the second-order Gaussian Poincaré inequality that leads to abstract bounds for Gaussian process approximation in $d_2$ distance used by Bourguin and Campese (Electron. J. Probab., 2020). As pointed out by Bassetti, Bourguin, Campese, and Peccati (Statist. Probab. Lett., 2026) this distance alone does not imply weak convergence in infinite dimensions, we also consider $d_2^\dagger$, obtained by adding the absolute difference of the second moments. This metric metrizes $2$-Wasserstein convergence and agrees with $d_2$ for centered variables with matching covariance operators. Our abstract bounds are flexible and can be applied in various examples including functional Breuer-Major central limit theorems, shallow neural networks, and spatial statistics of SPDE solutions. In these applications, the covariance estimates also give the second-moment convergence needed for weak convergence in the corresponding Hilbert spaces.

comments
36 pages, v3: d_2^\dagger distance introduced to characterize the weak convergence [Prop. 2.2]
fields
Probability
pdf ↗ page arXiv:2506.13571 ↗

We construct explicit differential operators on hermitian modular forms, extending methods developed for Siegel modular forms. These differential operators are closely related to the two-variable spherical pluriharmonic polynomials. We construct explicit bases for the space of such polynomials and use them to build concrete operators. As an application, we derive an exact pullback formula for hermitian Eisenstein series.

comments
39 pages
fields
Number Theory
pdf ↗ page arXiv:2506.18236 ↗

We propose a practical randomized algorithm for solving large sparse systems of linear equations. The algorithm, termed fastGMRES, uses flexible GMRES as an outer wrapper for sketched GMRES together with a practical residual bound to terminate the inner iteration. We demonstrate that fastGMRES requires very little parameter tuning, while still being efficient and robust in the sense of generating non-increasing residual norms. We observe that the inner sketched GMRES method can be run without any inner product computations and vector–vector updates on high-dimensional vectors, yielding significant speedup for many problems.

fields
Numerical Analysis
pdf ↗ page arXiv:2506.18408 ↗

We study online learning in linear dynamical games where multiple strategic agents act on a shared state evolving according to a linear dynamical system subject to adversarial disturbances. This setting lies beyond both single-agent nonstochastic online control and classical linear-quadratic games, which typically focus on quadratic objectives and noiseless or stochastic dynamics. Each agent seeks to minimize its own sequence of convex losses under full-state observability. Following the stabilizing-baseline paradigm in nonstochastic online control, we assume access to linear controllers that stabilize the noiseless system and focus on online adaptation by learning disturbance-action corrections. This extends adversarial online control to strategic multi-agent shared-state systems, where each agent's actions shape the state trajectory and hence the realized losses of all learners. Under state-only and aggregate-input feedback models, we analyze agents running online gradient descent with memory to update their own disturbance-action policies. We prove per-agent regret bounds that are sublinear and near-optimal in the time horizon, with population dependence that varies under the specified feedback, opponent policy, and stability assumptions. In the common-interest case, where all agents have identical cost functions, we show that the induced online problem forms a time-varying potential game and derive equilibrium tracking guarantees. Together, our results provide a theoretical framework for adversarial online learning in stabilized linear dynamical games, connecting online control with learning in games.

comments
NeurIPS 2026
fields
Optimization and Control
pdf ↗ page arXiv:2506.18814 ↗

This work presents a hardware-efficient and fully parallelizable decoder for quantum LDPC codes that leverages belief propagation (BP) with a speculative post-processing strategy inspired by classical Chase decoding algorithm. By monitoring bit-level oscillation patterns during BP, our method identifies unreliable bits and generates multiple candidate vectors to selectively flip syndromes. Each modified syndrome is then decoded independently using short-depth BP, a process we refer to as BP-SF (syndrome flip). This design eliminates the need for costly Gaussian elimination used in the current BP-OSD approaches. Our implementation achieves logical error rates comparable to or better than BP-OSD while offering significantly lower latency due to its high degree of parallelism for a variety of bivariate bicycle codes. Evaluation on the $[[144,12,12]]$ bivariate bicycle code shows that the proposed decoder reduces average latency to approximately 70% of BP-OSD. When post-processing is parallelized the average latency is reduced to 55% compared to the single process implementation, with the maximum latency reaching as low as 18%. These advantages make it particularly well-suited for real-time and resource-constrained quantum error correction systems.

journal
2026 IEEE International Symposium on High Performance Computer Architecture (HPCA), pp. 1-14, 2026
fields
Information Theory
pdf ↗ page arXiv:2507.00254 ↗

We provide a full resolution of the Yamabe problem on closed 3-manifolds for Riemannian metrics of Sobolev class $W^{2,q}$ with $q > 3$. This requires developing an elliptic theory for the conformal Laplacian for rough metrics and establishing existence, regularity and a delicate blow-up analysis for its Green function. Most of the analytical work is carried out in dimensions $n \geq 3$ and for $W^{2,q}$ Riemannian metrics with $q>\tfrac{n}{2}$ and should be of independent interest.

comments
63 pages. Minor changes with respect to v1
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2507.01674 ↗

We first study crossing statistics in random connection models (RCM) built on marked Poisson point processes on $\mathbb R^d$. Under general assumptions, we show exponential tail bounds for the number of crossings of a box contained in the infinite cluster for supercritical intensity of the point process, and percolation in slabs, in analogy with the Grimmett-Marstrand theorem. We then present several applications to transport and diffusion phenomena. In particular, we prove the non-degeneracy of the effective homogenized matrix arising in the large-scale limit of random walks, exclusion processes, and resistor networks on the RCM, and the non-degeneracy of the effective diffusion constant for one-dimensional diffusion operators on the Euclidean graph associated with the RCM. As examples, we apply our results to Poisson-Boolean models and Mott variable range hopping random resistor network, providing a fundamental ingredient used in the derivation of Mott's law.

comments
33 pages, 2 figures. Minor improvements to the presentation
fields
Probability
pdf ↗ page arXiv:2507.03965 ↗

The goal of this note is to show that the standard BV formulation of gravity in the Palatini-Cartan formalism is equivalent, using a BV pushforward, to an AKSZ-like version compatible with BFV data on the boundary.

comments
32 pages, close to published version
journal
Lett Math Phys 116, 142 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2507.06279 ↗

The recurrence for the $k$-Fibonacci polynomials is usually iterated upwards to positive values of $n$ only. When the recurrence is iterated downwards to $n<0$, there are indices where the polynomials vanish identically. This fact does not seem to have been noted in the literature. We derive the set of such indices. We establish the connection of our results to the solution of the Skolem problem for the $k$-Fibonacci numbers. For $k\ge3$ and $n<0$, we show that the degree of the polynomial does not increase monotonically with $|n|$. The so-called `left-justified $k$-nomial triangle' is extended to treat negative indices. We derive expressions for the individual polynomial coefficients (the elementary symmetric polynomials of the roots). We present results for the properties of the polynomials, for both $n>0$ and $n<0$, including factorization of the polynomials and properties of the roots. Results are also derived for real roots. We present new, tighter, bounds on the amplitudes of the nonzero roots. We derive new combinatorial sums for the polynomial coefficients, which are more concise and computationally efficient than previously published expressions.

comments
35 pages, 6 tables, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2507.11596 ↗

We propose a novel modal study of bisimulations. Our contribution is threefold. First, we extend the basic modal language with a new modality $\nbi$, whose intended meaning is universal quantification over all states that are bisimilar to the current one under a given bisimulation. We show that bisimulations are definable in this object language via frame validity (for the forth and back conditions) and model validity (for the atomic harmony condition). Additionally, some other related notions (refinements, simulations, bisimulations for a restricted set of variables, and $n$-bisimulations) are also shown to be definable. Second, we provide a sound and complete axiomatisation of the class of all pairs of Kripke models that are bisimulation-related. Third, we show that the satisfiability problem of this logic is decidable and PSPACE-complete via a translation to standard modal logic $K$ under a simple frame condition. All our results are encoded and verified by Isabelle/HOL.

comments
22 pages
fields
Logic
pdf ↗ page arXiv:2507.15117 ↗

Let G be the group of rational points of a connected reductive group over a finite field. Based on work of Lusztig and Yun, we make the Jordan decomposition for irreducible G-representations canonical. It comes in the form of an equivalence between the category of G-representations with a fixed semisimple parameter s and a category of essentially unipotent representations of an endoscopic group of G, enriched with an equivariant structure with respect to the component group of the centralizer of s. Next we generalize these results, replacing the connected reductive group by a smooth group scheme with reductive neutral component. Again we establish canonical equivalences for both the rational and the geometric series of G-representations, in terms of essentially unipotent representations of endoscopic groups.

comments
Second version: completely rewritten and tripled in size. The first version used reduction to unipotent representations of endoscopic groups, but it turned out that is not canonical and cannot be generalized to disconnected groups in general
fields
Representation Theory
pdf ↗ page arXiv:2507.16304 ↗

Let $p$ be a prime and $\Bbbk$ an algebraically closed field of characteristic $p$. Two invariants worthy of study for a $p$-divisible group $X$ over $\Bbbk$ are its isogeny cutoff $b_X$, which measures the amount of $p$-torsion necessary to determine the Newton polygon of $X$, and its minimal height $q_X$, which measures its distance to the closest minimal $p$-divisible group (in the sense of Oort). Traverso's Isogeny Conjecture predicts a bound on $b_X$ in terms of its height and dimension. The conjecture was proved in [NV07] and a refinement was given in [LNV13]; the latter also gives a bound on $q_X$. In this paper, we study these invariants when restricting to the class of supersingular unitary $p$-divisible groups $X$ of signature $(a,g-a)$, where $0 < a < g$, for $p > 2$, and prove further refinements on their bounds purely in terms of $a$. In particular, we provide a complete description of the possible values of $q_X$. Finally, we rephrase our results in the language of the $\mathrm{BT}_m$ stratifications of characteristic-$p$ fibers of Shimura varieties for $\mathrm{GU}(a, g-a)$ in the case of an inert prime $p > 2$.

comments
New title and abstract. Revised introduction and exposition, including proofs of some claims for completeness (Lemma 3.2 and Lemma 4.4); minor errors corrected. A new construction (Example 5.6) yields a strengthening of Theorem 5.6 of v1 (now Theorem 5.8). Statement and proof of Corollary 6.2 of v1 (now Corollary 6.3) clarified
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2507.19708 ↗

With direct computation of moments through order $L$ in $d$ dimensions, standard method of moments (MM) incurs $Ω(d^L)$ computation and storage costs, and standard generalized method of moments (GMM) additionally requires estimating and inverting an often ill-conditioned covariance matrix of size $Ω(d^L)$-by-$Ω(d^L)$ to obtain the optimal weighting matrix. Pereira, Kileel, and Kolda [arXiv:2202.06930 (2022)] avoid the tensor computation cost of MM through implicit moment computation. Despite this progress, incorporating statistically principled weighting while preserving computational efficiency remains an important challenge, particularly at low signal-to-noise ratio (SNR), where sampling variances can differ substantially across moment orders. We introduce diagonally-weighted GMM (DGMM), which assigns one adaptive weight to each moment order through a structured approximation of the optimal weighting matrix while avoiding the covariance inversion, thereby balancing statistical efficiency, computational complexity, and numerical stability. For general parametric models, we prove that DGMM is consistent, asymptotically normal, and near-efficient under explicit structural conditions. For heteroscedastic low-rank Gaussian mixtures, we design a computationally efficient and numerically stable algorithm that extends the implicit moment computation to the DGMM objective, gradients, and weights and incorporates Nyström approximations of the kernel sums. In low-SNR experiments with $d=100$ and $L=4$, where standard MM and GMM are infeasible, controlled weighting comparisons show that DGMM achieves consistently small parameter errors across tested initializations, including the challenging starts where alternative weightings struggle, with shorter median runtimes and fewer iterations. The code and data will be available upon publication at https://github.com/liu-lzhang/dgmm.

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

There is growing interest in the so-called Bayesian Predictive Inference approach, which enables Bayesian inference without specifying a likelihood function or prior distribution and without resorting to MCMC methods. Instead, only a sequence of predictive distributions for the observations is required, and inference on the unknown estimand can be performed, cheaply in parallel, using bootstrap-type schemes. Understanding which classes of predictive distributions can be used within this framework, is still a key open question. We relax commonly used probabilistic assumptions on the observations, namely exchangeability and conditionally identical distribution, and on their predictive distributions, which are measure-valued martingales, by introducing the new class of Almost Conditionally Identically Distributed (a.c.i.d.) random variables. This class assumes that the predictive distributions are measure-valued almost supermartingales, and is parametrized by a sequence of parameters $(ξ_{n})_{n\geq 0}$, which regulate the decay of conditional dependence among future observations. Under mild summability assumptions on $(ξ_{n})_{n\geq 0}$, the resulting sequence of observations is shown to be asymptotically exchangeable, hence amenable to Bayesian Predictive Inference techniques. A.c.i.d. random variables arise naturally in recursive algorithms, and include classic approaches in Statistics and Learning Theory, such as kernel estimators, and more novel ones, such as the parametric Bayesian bootstrap.

fields
Statistics Theory
pdf ↗ page arXiv:2507.21874 ↗

A $2$-distance-transitive graph is a vertex-transitive graph whose vertex stabilizer is transitive on both the first- and second-step neighborhoods. This concept simultaneously generalizes both distance-transitive graphs and $2$-arc-transitive graphs. In this paper, we first determine the vertex-quasiprimitive types of $2$-distance-transitive graphs of odd order, partially answering a question posed by A. Devillers, M. Giudici, C. H. Li and C. E. Praeger in 2012. We then prove that a $2$-distance-transitive graph of valency $p+1$, where $p$ is a prime, is $2$-arc-transitive if and only if it has girth at least $4$. We also show that every locally-primitive $2$-distance-transitive graph of valency at most $8$ is $2$-arc-transitive, with the icosahedron as the unique exception. Finally, we prove that if $Γ$ is a $G$-locally-primitive, $(G,2)$-distance-transitive graph of valency at least $3$ and $G$ is soluble, then either $Γ\cong \K_{p,p}$ for some prime $p$, or the order of $Γ$ is not square-free.

fields
Combinatorics
pdf ↗ page arXiv:2508.02010 ↗

We develop a bialgebraic framework for Nijenhuis operators on pre-Lie algebras and coalgebras. Starting from dual triangular pre-Lie bialgebras and weak pseudo-Hessian structures, we construct Nijenhuis operators on pre-Lie algebras and establish the corresponding coalgebraic construction. We introduce Nijenhuis pre-Lie bialgebras, characterize them through matched pairs, and identify compatibility conditions linking the two constructions. For triangular structures, we formulate the $S$-Nijenhuis $\mathbb{S}$-equation, give an operator characterization, and obtain constructions using relative Rota-Baxter operators. We also show that balanced Nijenhuis pre-Lie bialgebras give rise to Nijenhuis Lie bialgebras. Finally, we introduce crossed modules and braided Nijenhuis pre-Lie bialgebras, and characterize when compatible algebraic and coalgebraic data assemble into a Nijenhuis pre-Lie biproduct. These results connect Nijenhuis operators with pre-Lie bialgebra structures, Yang-Baxter-type equations, and constructions on representations.

comments
33 pages
fields
Quantum Algebra, Representation Theory
pdf ↗ page arXiv:2508.02983 ↗

To meet the increasingly demanding quality-of-service requirements of the next-generation multi-carrier mobile networks, it is essential to design multi-functional signalling schemes facilitating efficient, flexible, and reliable communication and sensing in complex wireless environments. As a compelling candidate, we advocate chirp signalling, beneficially amalgamating sequences (e.g., Zadoff-Chu sequences) with waveforms (e.g., chirp spread spectrum and frequency-modulated continuous wave (FMCW) radar), given their resilience against doubly selective channels. Besides chirp sequences, a wide range of chirp waveforms is considered, ranging from FMCW to affine frequency-division multiplexing (AFDM), to create a promising chirp multicarrier waveform. This study also highlights the advantages of such waveforms in supporting reliable high-mobility communications, plus integrated sensing and communications (ISAC). Finally, we outline several emerging research directions for chirp signalling designs.

comments
9 pages, 6 figures, submitted to IEEE Wireless Communications
fields
Information Theory
pdf ↗ page arXiv:2508.06022 ↗

It is well known that the global well-posedness of the Navier-Stokes equations with temperature-dependent coefficients is a challenging problem, especially in multi-dimensional space. In this paper, we study the 3D Navier-Stokes equations with temperature-dependent coefficients in the whole space. When the initial density and the initial temperature are linearly equivalent to some large constant states, we establish the first result on the global existence of large strong solution. Moreover, the optimal decay rates of the solution to its associated equilibrium are established when the initial data belong to $L^{p_0}(\mathbb{R}^3)$ for some $p_0\in[1,2]$.

comments
83 pages, all comments are welcome
fields
Analysis of PDEs
pdf ↗ page arXiv:2508.06933 ↗

Let $F$ be a subfield of $\mathbb R$ and let $K$ be a basic closed semi-algebraic set in $\mathbb R$ with $\partial K\subset F$. Let $\mathcal N$ be the natural choice of generators of $K$. We show that if $f\in F[x]$ is $\geq 0$ on $K$, then $f$ can be written as $$f=\sum_{e\in\{0,1\}^s } a_eσ_e g^e $$ where $a_e\in F_{\geq 0}$, $σ_e\in \sum F[x]^2$ and $g^{e}=g_1^{e_1} \cdots g_s^{e_s}$. In other words, the preordering $T_{\mathcal N}$ of $F[x]$ is saturated. In case $F=\mathbb R$, this result is due to Kuhlmann and Marshall. As an application, we prove that if $K$ is compact, then $M_{\mathcal N}=T_{\mathcal N}=Pos(K)$. In other words, the quadratic module $M_{\mathcal N}$ of $F[x]$ is saturated.

comments
32 page, Comments welcome
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2508.07060 ↗

We show that given a monadically stable theory $T$, a sufficiently saturated $\mathbf M \models T$, and a coherent system of probability measures on the $σ$-algebras generated by parameter-definable sets of $\mathbf M$ in each dimension, we may produce a totally Borel $\mathbf B \prec \mathbf M$ realizing these measures. Our main application is to prove that every FO-convergent sequence of structures (with countable signature) from a monadically stable class admits a modeling limit. As another consequence, we prove a Borel removal lemma for monadically stable Lebesgue relational structures.

comments
final journal version; various local corrections
fields
Logic, Combinatorics
pdf ↗ page arXiv:2508.08960 ↗

Let ${\rm EX}(n,H)$ and ${\rm SPEX}(n,H)$ denote the families of $H$-free graphs of order $n$ with maximum size and maximum spectral radius, respectively. A graph $H$ is called spectral-consistent if ${\rm SPEX}(n,H)\subseteq {\rm EX}(n,H)$ holds for all sufficiently large $n$. Cioabă, Desai, and Tait put forward the following conjecture: Let $H$ be a graph for which every graph in ${\rm EX}(n,H)$ is a Turán graph plus $O(1)$ edges. Then $H$ is spectral-consistent. Wang, Kang, and Xue settled this conjecture. Recently, Liu and Ning raised a general problem in spectral extremal graph theory: Characterize all graphs that are spectral-consistent. In this paper, we establish that for any finite graph $H$, if its decomposition family is matching-good, then $H$ is necessarily spectral-consistent. Notably, this structural condition is strictly weaker than the condition for spectral-consistency established by Wang, Kang, and Xue in their earlier work, thereby broadening the class of graphs known to satisfy the spectral-consistency property. Our main result enables us to fully characterize spectral consistency for several important families of forbidden graphs $H$, including generalized color-critical graphs, odd-balloonings of nontrivial trees and complete bipartite graphs $K_{s,t}$ with $t\geq s\geq 2$ and $(s,t)\neq(2,3)$, as well as edge blow-ups of non-bipartite graphs and even cycles. Furthermore, we present a streamlined proof of the Chen–Lei–Li theorem on the spectral-consistency of disjoint unions of suspensions of unions of color-critical graphs. Finally, we propose an open problem to motivate future research in this area.

fields
Combinatorics
pdf ↗ page arXiv:2508.12070 ↗

In the first part of this article, we study linear cones over totally ordered fields. We show that for each such cone there uniquely exists a universal vector space (called its spanned vector space) into which it embeds as a generating convex cone. Moreover, we investigate topologies on cones for which the natural cone operations are continuous, and study how these topologies carry over to the spanned vector space. In the second part, we deal with hyperbolic norms which satisfy a polarization identity and are defined on cones over the real numbers. We show that, under reasonable assumptions, such hyperbolic norms induce a Lorentzian inner product on the spanned vector space. Finally, we establish a link between completeness under the Wick rotation of a Lorentzian inner product and order-theoretic completeness.

comments
25 pages, to appear in Monatshefte Math
fields
Metric Geometry, Functional Analysis, General Topology
pdf ↗ page arXiv:2508.17052 ↗

We compare different periodic point invariants for families of maps parameterized over a compact manifold. Malkiewich and Ponto showed that, in the case of a single map, the Fuller trace is equivalent to the collection of Reidmeister traces of iterates. In this paper, we show that, in contrast to the case of a single map, the fiberwise Fuller trace is a strictly more sensitive invariant than the collection of fiberwise Reidemeister traces of iterates. This resolves a conjecture of Malkiewich and Ponto. We also prove that our construction gives a geometric representation of elements of the kernel of the ghost map out of topological restriction homology.

comments
23 pages, 8 figures, comments welcome!
fields
Algebraic Topology, Dynamical Systems
pdf ↗ page arXiv:2508.18339 ↗

We study the one-dimensional spin-$J$ Fermi gas, interacting through a general repulsive 2-body potential, and prove asymptotics of the ground state energy in the dilute limit. The asymptotic behaviour is given in terms of the ground state energy of a spin chain, which is the Heisenberg antiferromagnet in the case of spin-1/2 fermions. We determine similar asymptotics for the Lieb-Liniger-Heisenberg model, showing that a product trial state used by Girardeau is not optimal.

comments
60 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2509.00536 ↗

Let $k$ be an algebraically closed field of characteristic $p>0$, and let $X\subseteq\mathbb{P}^n_k$ be a quasi-projective variety that is $F$-rational and $F$-pure. We prove that if $H \subseteq \mathbb{P}^n_k$ is a general hyperplane, then $X \cap H$ is also $F$-rational and $F$-pure. Of related but independent interest, we present a relationship between the characteristic and index of a $\mathbb{Q}$-Gorenstein variety with isolated non-$F$-regular locus which is $F$-pure but not $F$-regular.

comments
17 pages, final version
fields
Algebraic Geometry, Commutative Algebra
pdf ↗ page arXiv:2509.04433 ↗

Anyons, unique to two spatial dimensions, underlie extraordinary phenomena such as the fractional quantum Hall effect, but their generalization to higher dimensions has remained elusive. The topology of Eilenberg-MacLane spaces constrains the loop statistics to be only bosonic or fermionic in any dimension. In this work, we introduce the novel anyonic statistics for membrane excitations in four dimensions. Analogous to the $\mathbb{Z}_N$-particle exhibiting $\mathbb{Z}_{N\times \gcd(2,N)}$ anyonic statistics in two dimensions, we show that the $\mathbb{Z}_N$-membrane possesses $\mathbb{Z}_{N\times \gcd(3,N)}$ anyonic statistics in four dimensions. Given unitary volume operators that create membrane excitations on the boundary, we propose an explicit 56-step unitary sequence that detects the membrane statistics. We further analyze the boundary theory of $(5{+}1)$D 1-form $\mathbb{Z}_N$ symmetry-protected topological phases and demonstrate that their domain walls realize all possible anyonic membrane statistics. We then show that the $\mathbb{Z}_3$ subgroup persists in all higher dimensions. In addition to the standard fermionic $\mathbb{Z}_2$ membrane statistics arising from Stiefel-Whitney classes, membranes also exhibit $\mathbb{Z}_3$ statistics associated with Pontryagin classes. We explicitly verify that the 56-step process detects the nontrivial $\mathbb{Z}_3$ statistics in 5, 6, and 7 spatial dimensions. Moreover, in 7 and higher dimensions, the statistics of membrane excitations stabilize to $\mathbb{Z}_{2} \times \mathbb{Z}_{3}$, with the $\mathbb{Z}_3$ sector consistently captured by this process.

comments
v1: 31 pages, 2 figures, 1 table. v2: format changed. v3: 26 pages, 2 figures, 1 table; revised presentation, clarified derivations, and corrected typos
journal
Phys. Rev. Lett. 136, 086601 (2026)
fields
Mathematical Physics, Quantum Algebra
pdf ↗ page arXiv:2509.14314 ↗

Let $G=(V, E)$ be a graph. A subset $S \subseteq V$ is called a global dominating set of $G$ if it is a dominating set of both $G$ and its complement $\overline{G}$. Two disjoint subsets $V_1, V_2 \subseteq V$ form a global coalition if neither $V_1$ nor $V_2$ is a global dominating set, but their union $V_1 \cup V_2$ is. A global coalition partition (abbreviated $gc$-partition) of $G$ is a vertex partition $π$ of $V(G)$ such that every class of $π$ forms a global coalition with some other class of $π$. The global coalition number $GC(G)$ is the maximum cardinality of a $gc$-partition of $G$. In this paper, we initiate the study of these concepts. We prove that every graph of order at least two admits a $gc$-partition, give general lower bounds on $GC(G)$, and bound the number of global coalitions in which a single class of a $gc$-partition can be involved. We show that $GC(G)$ coincides with the coalition number $C(G)$ whenever $G$ is disconnected or has radius at least three, and consequently that $GC(G)=C(\overline{G})$ for every join of two graphs. We determine the global coalition number of complete multipartite graphs with at most three parts, wheels, fans, paths, cycles and trees of radius two, characterise the graphs $G$ with $GC(G)=|V(G)|$ in terms of antitwins, relate global coalitions to perfect coalitions, and study unicyclic graphs of radius at most two. Finally, we interpret $gc$-partitions in the language of fair division of indivisible goods and pose several open problems.\\ \textbf{2020 Mathematics Subject Classification:} 05C69, 91B32.\\ \textbf{JEL Classification:} C72, C78, D63.\\ \textbf{Keywords}: Global domination, coalition, global coalition partition, antitwins, trees, unicyclic graphs, fair division.

comments
32 pages
fields
Combinatorics
pdf ↗ page arXiv:2509.15386 ↗

In 2025, Lin, Wu, Xie and Zhang extend Dax invariant from embedded disks to embedded surfaces and show that there is surjective homomorphism from $MCG(M)$ to $\mathbb{Z}^{\infty}$ for $M= Σ\times S^2$. Let $Σ$ be a closed surface with positive$(g>1)$ genus, in the paper we show that for any nontrivial $S^2$ fiber bundles $X= Σ\ltimes S^2$, whether $X$ orientable or nonorientable, there is a surjective homomorphism from $MCG(X)$ to $\mathbb{Z}^{\infty}$. The proof is an application of generalization of Dax invariants for embedded surfaces and the restriction on pseudo-isotopy subgroup $MCG_0(X)$ also surjects on $\mathbb{Z}^{\infty}$. The property of $MCG(X)$ inherits from trivial fiber bundle $Σ\times S^2$ and main theorem shows that the algebraic size of the smooth mapping class group of $S^2$-fiber bundles does not depend on the triviality of the bundle.

comments
15 pages
fields
Geometric Topology
pdf ↗ page arXiv:2509.16520 ↗

For finite graphs, path-width is an interesting and useful concept, but if we extend it to infinite graphs in the most obvious way (by making the indexing path infinite), it does not work nicely. The simplest extension that works nicely is to allow the indexing set to be any totally-ordered set, and then the corresponding decomposition is called a ``line-decomposition'', and the maximum bag size needed is called ``line-width''. In particular, the indexing set need not be a well-order; but the corresponding decomposition would be easier to use if it was. We show that if a graph has line-width at most $k$, it admits a well-ordered line-decomposition with width at most $2k$, and this is best possible.

comments
13 pages, revised according to the referees' comments
fields
Combinatorics
pdf ↗ page arXiv:2509.16786 ↗

The inverse Robin problem consists in determining the Robin parameter in an elliptic partial differential equation posed on a domain $Ω$. In this work it is assumed that the right-hand sides of the elliptic problem are known, that the associated solution is available on a subdomain $ω\subset Ω$ and that this solution vanishes at most at isolated points on the boundary $\partial Ω$. Within this framework, a computational method for the reconstruction of the Robin parameter is established, which is inspired by a unique continuation method. The proposed scheme relies solely on first-order Lagrange finite elements ensuring a straightforward implementation. Under the main assumption that the Robin parameter is in a finite dimensional space of continuously differentiable functions it is shown that the numerical method is second order convergent in the finite element's mesh size. For noisy data this convergence rate is shown to hold true until the noise term dominates the error estimate. Numerical experiments are presented that highlight the feasibility of the Robin parameter reconstruction and that confirm the theoretical convergence results numerically.

comments
Revised and updated version
fields
Numerical Analysis
pdf ↗ page arXiv:2509.17571 ↗

Schwarz methods and preconditioners, where the approximate solution of the local problems is performed at a lower precision, i.e., with fewer digits of accuracy than in the underlying (double precision) computation. Conditions for the appropriate round-off criteria for the lower precision are presented. It is found experimentally that for the model problems about 5 digits of accuracy are sufficient to achieve the theoretical restrictions, and thus, single precision suffices for the local solves. Several numerical experiments illustrate the obtained results.

fields
Numerical Analysis
pdf ↗ page arXiv:2509.20937 ↗

We study zero forcing and $\ell$-leaky zero forcing on Diamond rectangle graphs $DR(a,b)$, a family of induced subgraphs of 2-dimensional grid graphs. Motivated by this family, we develop more general results for subgraphs of $d$-dimensional grid graphs. Using $\ell$-leaky forts, we show that for $\ell\leq 2d-1$, every nonempty $\ell$-leaky fort in a subgraph of $P_{n_1}\square\cdots\square P_{n_d}$ must contain a vertex of degree at most $2d-1$. This gives bounds and, in certain cases, exact values for the $\ell$-leaky forcing number of such subgraphs. We then apply these results to Diamond rectangle graphs, for which we show that the zero forcing number equals the maximum nullity and completely characterize the $\ell$-leaky forcing number for all $\ell\geq 1$.

comments
Major revision: added results on the structure of Diamond Rectangle Graphs, changed wording from "induced subgraphs" to only "subgraphs" and adjusted results accordingly
fields
Combinatorics
pdf ↗ page arXiv:2509.21529 ↗

Let $\mathcal H_{\infty}^δ$ denote the Hausdorff content of dimension $δ\in(0,n]$ defined on subsets of $\mathbb R^n$. The principal problem, considered in this paper, is to characterize the non-negative function $w$ for which the weighted $L^p$ inequality with $p\in(1,\infty)$ and the weighted weak $L^1$ inequality on Hardy-Littlewood maximal operators associated with Hausdorff content hold true. To achieve this, we introduce a class of Hausdorff content $A_p$ weights, denoted as $\mathcal A_{p,δ}$, and then show that, for any $p\in(1,\infty)$ and $δ\in(0,n]$, the weighted $L^p$ maximal inequality holds true if and only if $w\in\mathcal A_{p,δ}$, and the weighted weak $L^1$ maximal inequality holds true if and only if $w\in\mathcal A_{1,δ}$ by proposing a novel approach. As the second objective, applying this approach, the seminal structural properties of classical Muckenhoupt $A_p$ weights, such as the reverse Hölder inequality [R. R. Coifman and C. Fefferman, Studia Math. 51 (1974), 241-250], the self-improving property [B. Muckenhoupt, Trans. Amer. Math. Soc. 165 (1972), 207-226], and Jones' factorization theorem [P. W. Jones, Ann. of Math. (2) 111 (1980), 511-530], are all established for $\mathcal A_{p,δ}$. The main novelties of this paper lies in: (i) we discover $\mathcal A_{p,δ}$ weights with rich structural properties, that increase strictly on dimension exponent and hence reduce to the classical $A_p$ class at the endpoint dimension, forming proper subsets of it for smaller dimension exponent; (ii) by proposing a novel approach, this work naturally extends the classical theory beyond measure-theoretic frameworks, while also provides novel insights even when reduced to the classical $A_p$ weight case.

comments
52 pages
fields
Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2509.23839 ↗

Continuous casting is a widely adopted process in the steel industry, where maintaining high steel quality is paramount. Efficient prediction of grade intermixing during ladle changeover operations is critical for maintaining steel quality and minimizing material losses in the continuous casting process. Among various factors influencing grade intermixing, operating parameters play a significant role, in addition to tundish geometry and flow control devices. In this study, three-dimensional, transient, two-phase turbulent flow simulations are conducted to investigate the ladle changeover operation. During this process, the molten steel level in the tundish typically varies over time, significantly affecting the grade intermixing phenomena. The influence of ladle change time on intermixing time has been presented. However, high-fidelity full-order simulations of such complex transient phenomena are computationally expensive and are impractical for real-time monitoring or design-space exploration in industrial-scale applications. To address this issue, a reduced order modelling approach based on proper orthogonal decomposition (POD) and reservoir computing (RC) is employed to efficiently predict intermixing time. The proposed reduced order model (ROM) demonstrates excellent predictive accuracy using limited training data while requiring significantly less computational resources and training time. The results demonstrate the potential of the proposed methodology as a fast, reliable tool for real-time process monitoring and optimization in industrial continuous casting operations.

fields
Numerical Analysis
pdf ↗ page arXiv:2509.26293 ↗

Let $A_1$ and $A_2$ be polynomials of degree at least two over $\mathbb C$. We say that $A_1$ and $A_2$ are intertwined if the endomorphism $(A_1, A_2)$ of $\mathbb C\mathbb P^1 \times \mathbb C\mathbb P^1$ given by $(z_1, z_2) \mapsto (A_1(z_1), A_2(z_2))$ admits an irreducible periodic curve that is neither a vertical nor a horizontal line. For a polynomial $A$, we denote by $\mathrm{Inter}(A)$ the set of all polynomials $B$ such that some iterate of $B$ is intertwined with some iterate of $A$. In this paper, we prove a conjecture of Favre and Gauthier describing the structure of $\mathrm{Inter}(A)$. We also obtain a sharp bound on the periods of periodic curves for endomorphisms $(A_1, A_2)$ in terms of the sizes of the symmetry groups of the Julia sets of $A_1$ and $A_2$.

comments
The results are improved and the proofs are simplified
fields
Dynamical Systems
pdf ↗ page arXiv:2510.01877 ↗

Over the last four decades, the Arctic has warmed nearly four times faster than the rest of the planet, with anthropogenic aerosols among the major forcings. Greenland Summit Station has collected size-resolved particulate matter year-round since 2003, yet these records remain underutilized. Attributing multipollutant measurements to their sources (source apportionment) can be cast as a non-negative matrix factorization (NMF) problem. Because NMF is non-unique, source apportionment imposes often unverifiable constraints such as structural sparsity or rotations tuned using prior scientific knowledge, which is scarce for remote regions like the Arctic. Geometric NMF approaches offer a more data-driven route to identification, but many suffer from scaling ambiguity, assume exact separability, and lack a statistical framework for consistent estimation. We address these limitations by formally establishing statistical identifiability of the source attribution matrix under a stochastic framework that replaces hard separability with soft probabilistic relaxations. We then present a scalable geometric algorithm to estimate this matrix and prove its consistency, to our knowledge the first such result requiring no exact sparsity, no parametric distributional assumptions, and accommodating spatio-temporal dependence. Analyzing the 2003–2016 Summit record with our framework and HYSPLIT trajectories, we characterize long-range transport of anthropogenic and natural species into the Arctic.

fields
Statistics Theory
pdf ↗ page arXiv:2510.03616 ↗

We define symmetric and asymmetric branching trees, a class of processes particularly suited for modeling genealogies of inhomogeneous populations where individuals may reproduce throughout life. In this framework, a broad class of Crump-Mode-Jagers processes can be constructed as (a)symmetric Sevast'yanov processes, which count the branches of the tree. Analogous definitions yield reduced (a)symmetric Sevast'yanov processes, which restrict attention to branches that lead to extant progeny. We characterize their laws through generating functions. The genealogy obtained by pruning away branches without extant progeny at a fixed time is shown to satisfy a branching property, which provides distributional characterizations of the genealogy.

comments
39 pages, 4 figures
fields
Probability
pdf ↗ page arXiv:2510.07921 ↗

Many physical systems, such as vibrating elastic bodies, acoustic media and electromagnetic fields, are governed by second-order evolution equations $\ddot x+D\dot x+Sx=0$ and interact with their environment through their boundary. The classical analysis via the operator matrix $\mathcal{A}=\left[\begin{smallmatrix}0&I\\-S&-D\end{smallmatrix}\right]$ requires $S$ to be self-adjoint, which typically fixes a boundary condition a priori and thus excludes boundary control. We therefore use $S$ only to define the energy space and govern the dynamics by a maximal operator $S_{\max}\supset S$ whose domain carries no boundary condition. Based on a factorization $S=A^*A$, we construct a boundary triplet for the associated operator matrix and define boundary inputs and outputs of Robin type, parametrized by an operator $P$ on the boundary space. We show that the resulting system is impedance passive and internally well-posed if $P$ is a contraction, and that for $D=0$ this covers all boundary conditions under which the free dynamics generate a contraction semigroup. Moreover, we show that the position-momentum formulation (e.g., $\left[\begin{smallmatrix}0&I\\Δ&0\end{smallmatrix}\right]$ for the wave equation) and the strain-momentum formulation (e.g., $\left[\begin{smallmatrix}0&\nabla\\\operatorname{div}&0\end{smallmatrix}\right]$) describe the same open system, including its boundary inputs and outputs. We illustrate our results by an $n$-dimensional wave equation and Maxwell's equations.

journal
Evol. Equ. Control Theory 27 (2027) 100835
fields
Analysis of PDEs
pdf ↗ page arXiv:2510.10363 ↗

We study the asymptotics of the Schrödinger equation with time-dependent potential in dimension one. Assuming that the potential decays sufficiently rapidly as $|x| \to \infty$, we prove that the solution can be written as the sum of a free wave $e^{-itΔ} u_+$ and a weakly bound component $u_{\text{wb}}(t)$. Moreover, we show that the weakly bound part decomposes as $u_{\text{wb}}(t) = u_{\text{loc}}(t) + o_{\dot{H}^1}(1)$, where $\partial_x u_\text{loc}(t)$ is localized near the origin uniformly in time. Since decay conditions on the potential do not preclude resonances unless $d \geq 5$, our results can be seen as a natural extension of [Terence Tao. Dynamics of Partial Differential Equations, 5(2), 2008] and [Avy Soffer, Xiaoxu Wu. arXiv:2304.04245] to the lower-dimensional case.

comments
37 pages, edited to address reviewer comments. To appear in MCRF
fields
Analysis of PDEs
pdf ↗ page arXiv:2510.16283 ↗

We develop a framework of motivic integration in the style of Hrushovski–Kazhdan in arbitrary Hensel minimal fields of equicharacteristic zero. Hence our work generalizes that of Hrushovski–Kazhdan and Yin, but applies more broadly to discretely valued fields, almost real closed fields with analytic structure, pseudo-local fields, and coarsenings. In more detail, we obtain isomorphisms of Grothendieck rings of definable sets, with or without volume forms, in the valued field sort and in the leading term sort. Along the way we develop a theory of effective 1-h-minimal structures, where finite definable sets can be lifted from the leading term sort to the valued fields sort. We show that many natural examples of 1-h-minimal structures are effective, and develop dimension theory and a theory of differentiation in $\mathrm{RV}$ for effective structures.

comments
74 pages
fields
Logic, Algebraic Geometry
pdf ↗ page arXiv:2510.19659 ↗

The classical Kantorovich-Rubinstein duality guarantees coincidence between metrics on the space of probability distributions defined on the one hand via transport plans (couplings) and on the other hand via price functions. Both constructions have been lifted to the level of generality of set functors, with the construction based on couplings referred to as the Wasserstein or simply the coupling-based lifting, and the price-function-based construction as the Kantorovich or codensity lifting, both based on a choice of quantitative modalities for the given functor. It is known that every coupling-based lifting can be expressed as a price-function-based lifting; however, the latter in general needs to use additional modalities. We give an example showing that this cannot be avoided in general. We refer to cases in which the same modalities can be used as satisfying the generalized Kantorovich-Rubinstein duality. We establish the generalized Kantorovich-Rubinstein duality in this sense for two important cases: The Lévy-Prokhorov distance on distributions, which finds wide-spread applications in machine learning due to its favourable stability properties, and the standard metric on convex sets of distributions that arises by combining the Hausdorff and Kantorovich-Rubinstein distances. Furthermore we generalize (coupling-based) functor liftings from set functors to functors which act on (pseudo-)metric spaces, thus incorporating new example functors that map to closed subsets respectively Radon measures.

fields
Probability
pdf ↗ page arXiv:2510.23552 ↗

We consider the geometry of a general polarized K3 surface $(S,h)$ of genus 16 and its Fourier-Mukai partner $(S',h')$. We prove that $S^{[2]}$ is isomorphic to the moduli space $M_{S'}(2,h',7)$ of stable sheaves with Mukai vector $(2,h',7)$ and describe the embeddings of the projectivization of the stable vector bundle of Mukai vector $(2,-h',8)$ over $S'$ into these two isomorphic hyper-Kähler fourfolds. Following the work of Frédéric Han \cite{Frederic}, we explicitly construct a 3-form $t_1\in \wedge^3 V_{10}^*$, such that $S^{[2]}$ is isomorphic to the Debarre-Voisin fourfold in $G(6,V_{10})$ associated to $t_1\in \wedge^3 V_{10}^*$. Then the reconstruction program is also explained from two perspectives, i.e. in terms of families of stable representations and families of twisted cubics.

fields
Algebraic Geometry
pdf ↗ page arXiv:2510.26488 ↗

The quantity of interest in the classical Cramér-Rao theory of unbiased estimation (e.g., the Cramér-Rao lower bound, its exact attainment for exponential families, and asymptotic efficiency of maximum likelihood estimation) is the variance, which represents the instability of an estimator when its value is compared to the value for an independently-sampled data set from the same distribution. In this paper we are interested in a quantity which represents the instability of an estimator when its value is compared to the value for an infinitesimal additive perturbation of the original data set; we refer to this as the "sensitivity" of an estimator. The resulting theory of sensitivity is based on the Wasserstein geometry in the same way that the classical theory of variance is based on the Fisher-Rao (equivalently, Hellinger) geometry, and this insight allows us to determine a collection of results which are analogous to the classical case: a Wasserstein-Cramér-Rao lower bound for the sensitivity of any unbiased estimator, a characterization of models in which there exist unbiased estimators achieving the lower bound exactly, and various results on the asymptotic achievement of the lower bound. More precisely, we show that Wasserstein projection estimators (and one-step approximations thereof) are asymptotically sensitivity-efficient under suitable assumptions, and that there exist Hodges-type estimators which exhibit super-sensitivity-efficiency. We use these results to treat many statistical examples, sometimes revealing new optimality properties for existing estimators and other times revealing entirely new estimators.

comments
60 pages, 5 figures, 2 tables; comments welcome
fields
Statistics Theory, Optimization and Control
pdf ↗ page arXiv:2511.07414 ↗

We prove a Fejér-Riesz type factorization for positive matrix-valued noncommutative trigonometric polynomials on $\mathscr{W}\times\mathfrak{Y}$, where $\mathscr{W}$ is either the free semigroup $\langle x \rangle_g$ or the free product group $\mathbb{Z}_2^{g}$, and $\mathfrak{Y}$ is a discrete group. More precisely, using the shortlex order, if $A$ has degree at most $w$ in the $\mathscr{W}$ variables and is uniformly strictly positive on all unitary representations of $\mathscr{W}\times\mathfrak{Y}$, then $A=B^{*}B$ with $B$ analytic and of $\mathscr{W}$-degree at most $w$; this degree bound is optimal, and strict positivity is essential. As an application, we obtain degree-bounded sums-of-squares certificates for Bell-type inequalities in $\mathbb{C}[\mathbb{Z}_2^{*g}\times \mathbb{Z}_2^{*h}]$ from quantum information theory. In the special case $\mathscr{W}=\mathbb{Z}^h$ we recover, in the matrix-valued setting, the classical commutative multivariable Fejér-Riesz factorization. For trivial $\mathfrak{Y}$ we obtain a ``perfect'' group-algebra Positivstellensatz on $\mathbb{Z}_2^{*g}$ that does not require strict positivity; this result is sharp, as demonstrated by counterexamples in $\mathbb{Z}_2*\mathbb{Z}_3$ and $\mathbb{Z}_3^{*2}$. To establish our main results two novel ingredients of independent interest are developed: (a) a positive-semidefinite Parrott theorem with entries given by functions on a group; and (b) solutions to positive semidefinite matrix completion problems for $\langle x \rangle_g$ or the free product group $\mathbb{Z}_2^{*g}$ indexed by words in $\mathscr{W}$ of length $\le w$.

comments
V3 minor corrections
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2511.09267 ↗

We study the martingale dimension of diffusion processes associated with strongly local regular Dirichlet forms on metric measure spaces. The martingale dimension is an intrinsic quantity describing the probabilistic complexity of a diffusion, but its precise determination in non-smooth settings is highly nontrivial. In this paper, we establish a purely analytic criterion, formulated in terms of energy measures and relative capacities, which guarantees that the AF-martingale dimension equals one. Our approach does not rely on self-similarity, heat kernel estimates, or global geometric assumptions, and applies to settings where such structures are unavailable. The proof is based on a blow-up analysis of harmonic functions combined with a push-forward argument for energy measures, which excludes the coexistence of multiple independent martingale directions. As applications, we verify the assumptions of the theory for a class of inhomogeneous Sierpinski gaskets, including genuinely non-self-similar examples, and for the two-dimensional standard Sierpinski carpet, where the criterion yields a new capacity-based proof of the one-dimensionality of the martingale structure. In these examples, self-similarity or local symmetry enters only in verifying the hypotheses; the mechanism that forces the one-dimensionality is the analytic balance condition itself.

comments
57 pages, 4 figures. Major revision
fields
Probability
pdf ↗ page arXiv:2511.09930 ↗

This paper introduces new empirical process tools for analyzing a broad class of statistical learning models under heavy-tailed noise and complex function classes. Our primary contribution is the derivation of two Dudley-type maximal inequalities for expected empirical processes that remove restrictive assumptions such as light tails and uniform boundedness of the function class. These inequalities enlarge the scope of empirical process theory available for statistical learning and nonparametric estimation. Exploiting the new bounds, we establish robustness guarantees for deep ReLU network estimators in Huber and quantile regression. In particular, we prove a unified non-asymptotic sub-Gaussian concentration bound that remains valid even under infinite-variance noise and provide a comprehensive analysis of non-asymptotic robustness for deep Huber estimators across all noise regimes. For deep quantile regression, we provide the first non-asymptotic sub-Gaussian bounds without requiring moment assumptions. As an additional application, our framework yields estimation error bounds for nonparametric least-squares estimators that simultaneously accommodate infinite-variance noise, non-Donsker function classes, and approximation error. Moreover, unlike prior approaches based on specialized multiplier processes, our framework extends to broader empirical risk minimization problems, including the nonparametric generalized linear models and the ``set-structured'' models.

fields
Statistics Theory
pdf ↗ page arXiv:2511.15841 ↗

We introduce and study two new relations between function spaces over measure spaces of infinite measure, motivated by the question of establishing compactness. The first relation captures the uniform decay of function (quasi-)norms ``at infinity''. It appeared implicitly in the first author's recent work on the compactness of Sobolev embeddings of radially symmetric functions on $\mathbb{R}^n$. The second is a suitably localized version of the relation of almost-compact embeddings, which has been successfully used to study compactness in function spaces over measure spaces of finite measure, but becomes of no use in the case of infinite measure. Our framework is that of quasi-Banach function spaces, which need not be normable or rearrangement invariant. This level of generality leads us to introduce the notion of extremal fundamental functions associated with a (quasi-)Banach function space. We provide several concrete examples and establish an abstract compactness principle involving the new relations. Finally, we demonstrate a possible application of this principle to embeddings of inhomogeneous Sobolev spaces on $\mathbb{R}^n$.

comments
37 pages, published in the Journal of Geometric Analysis
journal
J. Geom. Anal. 36 (2026), no. 12, paper no. 396, 43 pp
fields
Functional Analysis
pdf ↗ page arXiv:2511.19000 ↗

In this article, we establish necessary and sufficient viability conditions for continuity inclusions over the 1-Wasserstein space. Depending on the regularity properties of the dynamics, we derive two results which are based on fairly different proof strategies. When the admissible velocities are Lipschitz in the measure variable, we characterise viability by the nonemptiness of the intersections of the velocity sets with the graphical derivatives of the constraint map. On the other hand, when the admissible velocities are merely upper semicontinuous in the measure variable, we provide a sufficient condition for viability involving the infinitesimal behaviour of their Aumann integral in time over a neighbouring set of measures.

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

In this article, we develop a comprehensive ODE-theory for structured continuity equations in fibred probability spaces, which represent a class of heterogeneous PDEs arising as the meanfield limit of nonexchangeable particle systems. After investigating in depth the topologies induced by the so-called fibred (or conditional) and classical Wasserstein metrics on such probability spaces, we establish quantitative Cauchy-Lipschitz and qualitative Carathéodory-Peano well-posedness results for structured continuity equations, along with precise correspondences between this class of evolutions, classical Lagrangian dynamics, and continuity equations. In keeping with what has long been known for exchangeable dynamics, we derive a general meanfield approximation result by solutions of nonexchangeable particle systems, along with a quantitative variant thereof under practically reasonable regularity assumptions on the driving field and initial data.

comments
74 pages
fields
Analysis of PDEs, Probability
pdf ↗ page arXiv:2511.19784 ↗

Let $G$ be a reductive group over a local field $F$ and let $ρ:{}^LG \to \mathrm{GL}_{V_ρ}(\mathbb{C})$ be a representation of its $L$-group satisfying suitable assumptions. Braverman, Kazhdan and Ngô conjectured that one has a $ρ$-Fourier transform satisfying certain desiderata. We give a uniform construction of the Fourier transform for arbitrary local fields. This complements work of L.~Lafforgue in the non-Archimedean case, and proves a portion of the conjectures of Braverman, Kazhdan and Ngô. Our methods are spectral in nature.

comments
Added references to related work of L.~Lafforgue. Added a proof of compatiblity with the Fourier transform in the special case of matrices. Revised section 6 in view of the recent work of Hsu and Yao https://arxiv.org/abs/2607.28507
fields
Number Theory, Representation Theory
pdf ↗ page arXiv:2512.00182 ↗

Movable antenna (MA) technology exhibits great promise for enhancing the sensing capabilities of future sixth-generation (6G) networks due to its capability to alter antenna array geometry. With the growing prevalence of near-field propagation at ultra-high frequencies, this paper focuses on the application of one-dimensional (1D) and two-dimensional (2D) MA arrays for near-field sensing to jointly estimate the angle and distance information about a target. First, for the 1D MA array scenario, to gain insights into MA-enhanced near-field sensing, we investigate two simplified cases with only angle-of-arrival (AoA) or distance estimation, respectively, assuming that the other information is already known. The worst-case Cramer Rao bounds (CRBs) on the mean square errors (MSEs) of the AoA estimation and the distance estimation are derived in these two cases. Then, we jointly optimize the positions of the MAs within the 1D array to minimize these CRBs and derive their closed-form solutions, which yield an identical array geometry to MA-enhanced far-field sensing. For the more challenging joint AoA and distance estimation, since the associated worst-case CRB is a highly complex and non-convex function with respect to the MA positions, a discrete sampling-based approach is proposed to sequentially update the MA positions and obtain an efficient suboptimal solution. Furthermore, we investigate the worst-case CRB minimization problems for a 2D MA array under various conditions and extend our proposed algorithms to solve them efficiently. Numerical results demonstrate that the proposed MA-enhanced near-field sensing scheme dramatically outperforms conventional fixed-position antennas (FPAs). Moreover, the joint angle and distance estimation results in a different array geometry from that in the individual estimation of angle/distance or far-field sensing.

fields
Information Theory
pdf ↗ page arXiv:2512.00758 ↗

The positive part $U_q^+$ of the quantized enveloping algebra $U_q(\widehat{\mathfrak{sl}}_2)$ has a reflection equation presentation of Freidel-Maillet type (Baseilhac 2022). Its defining K-matrix has size $2 \times 2$ and can be expressed, using Rosso's embedding of $U_q^+$ into a $q$-shuffle algebra, as generating functions whose coefficients are Terwilliger's alternating PBW basis elements. This and older PBW bases of $U_q^+$ due to Damiani and Beck are unified by linear combinations of Catalan words (Ruan 2025). In this paper, we use this unification to define K-operators of any dimension $\geq 2$ in matrix form; the entries are explicit generating functions over $U_q^+$. Our main result is that any pair of such K-matrices, possibly of different dimensions, satisfy a Freidel-Maillet type equation. This yields a family of algebraic relations over $U_q^+$ that generalize Baseilhac's equation and can be used to study integrable systems or higher-spin representations. We conjecture that, for every spin, these K-matrices coincide with Lusztig's quasi R-matrix evaluated with its first leg on the corresponding finite-dimensional irreducible module.

comments
25 pages; abstract slightly modified; additional contents in Introduction and Appendix D
fields
Quantum Algebra, Mathematical Physics, Combinatorics
pdf ↗ page arXiv:2512.00819 ↗

Grouped multiple testing arises in many high-dimensional applications, where hypotheses may differ across groups and valid p-values are unavailable. Applying competition-based procedures separately within groups can inflate the global false discovery rate (FDR), while conservative corrections may substantially reduce power. We extend the competition test framework to the grouped setting and propose two procedures. The group competition (GC) test provides finite-sample FDR bounds under arbitrary inter-group dependence. For homogeneous groups, the required correction has logarithmic order in the number of groups, and this order is unavoidable for the GC test. The consistent group competition (CGC) filter instead couples group-specific thresholds through a single global normalization. Under the stated basic-independence conditions, it controls the FDR in finite samples without a correction that grows with the number of groups; under arbitrary inter-group dependence, the same guarantee is retained with a per-group correction that depends on the symmetry parameter of each group. We further develop a parameterized-threshold analysis to establish asymptotic guarantees and to characterize when the per-group correction can be dropped, so that a simple filter still controls the FDR approximately. Simulation studies show that the GC test and the CGC filter can improve power over pooled competition testing in heterogeneous settings, whereas the pooled test may remain more powerful under homogeneity. A peptide-spectrum matching benchmark involving post-translational modifications illustrates the practical relevance of the proposed methods.

fields
Statistics Theory
pdf ↗ page arXiv:2512.00901 ↗

In this manuscript, we develop and analyze a continuous version of the well-known Bennati-Dragulescu-Yakovenko (BDY) dollar-exchange discrete model. Starting from the conservative BDY exchange mechanism, we rely on kinetic theory for multi-agent systems in order to propose an analogous Boltzmann-type continuous dynamics, which does not belong to the class of other popular kinetic models for wealth exchange. We employ the quasi-invariant limit procedure to rigorously derive a nonlinear PDE on the half-line, which is a Fokker-Planck equation featuring the boundary value in the drift term. The PDE is supplemented with a nonlinear Robin-type boundary condition encoding conservation of total agents and wealth. We prove relative entropy decay to the unique stationary state that is the Boltzmann-Gibbs (exponential) distribution with a $\mathrm{e}^{-c\sqrt{t}}$ convergence rate. We determine a new entropy production term which is a Fisher information minus a competing term which measures the temporal distance of the boundary term from its equilibrium value. Thanks to an inequality relating the Fisher information relative to the Boltzmann-Gibbs equilibrium to the $L^1$-norm, we prove $L^1$-convergence toward equilibrium and convergence of the boundary term (up to a subsequence), as well as convergence in both the Hellinger and Fourier distances. This represents an advancement in classical arguments of entropy decay for Fokker-Planck equations in a kinetic framework.

comments
29 pages, 1 figure
fields
Analysis of PDEs
pdf ↗ page arXiv:2512.06101 ↗

We construct a family of higher-order Henneberg-type minimal surfaces in $\mathbb{R}^4$ from explicit holomorphic data in a generalized Weierstrass–Enneper representation. The construction retains the polynomial reciprocal structure of the classical Henneberg data and yields explicit holomorphic primitives and real parametrizations for the family $\mathcal H_{(m,n)}$. We distinguish regular points from branch points, analyze the role of the complex parameter $λ$, and show that the real-$λ$ subfamily $\mathcal H_{(1,1)}$ lies in a three-dimensional linear subspace. For $\mathcal H_{(1,1)}$, we compute the induced conformal metric and Gaussian curvature, proving that the curvature is negative at every regular point. An explicit parametrization is given for $\mathcal H_{(1,1)}$, together with three-dimensional coordinate projections used solely for visualization. We also derive an integral-free formulation in terms of a single holomorphic seed function and identify the exceptional values $λ=\pm i$ for the inverse reconstruction formula.

comments
14 pages, 2 figures
fields
Differential Geometry
pdf ↗ page arXiv:2512.07852 ↗

The \textit{Teleportation=Translation} conjecture posits that the recovery of information from a black hole is dual to a geometric translation in the emergent spacetime. In this paper, we establish this equivalence for general local quantum field theories by constructing a continuous unitary interpolation that bridges discrete algebraic teleportation protocols and continuous modular flow. We resolve the failure of dynamic idempotency, fundamentally inherent in Type III von Neumann algebras, by employing the Haagerup-Kosaki crossed-product construction. This lift to the semifinite Type~II$_\infty$ envelope yields a canonical, dynamically consistent path. Crucially, we prove that its unique infinitesimal generator $\tilde{G}$ is exactly twice the geometric modular momentum ($\tilde{G}=2P$). We establish this identity as a closed operator equivalence using Nelson's analytic vector theorem and quantify its structural robustness via non-commutative $L^p$ theory. Ultimately, our results demonstrate that unitary information recovery fundamentally manifests as a continuous geometric translation. This provides a rigorous operator-algebraic mechanism for resolving the black hole information paradox, offering a kinematic framework naturally extendable to include gravitational back-reaction.

comments
Withdrawn due to errors in Sections 3.3--3.4 and 4.2 of arXiv:2512.11877v4. The stated assumptions do not establish the canonical interpolation or $\tilde G=2P$. A physics-oriented reformulation examining the conditions for continuous black-hole information recovery is being prepared for hep-th
fields
Mathematical Physics, Operator Algebras
pdf ↗ page arXiv:2512.11877 ↗

This paper motivates the use of random-bridges -- stochastic processes conditioned to take target distributions at fixed timepoints -- in the realm of generative modelling. Herein, random-bridges act as stochastic transports between two probability distributions when appropriately initialized, displaying either Markovian or non-Markovian, and continuous, discontinuous, or hybrid patterns depending on the choice of the driving process. We show how one can start from general probabilistic statements and branch out into specific representations for learning and simulation algorithms. Essentially, our framework formulates stochastic transports as noisy information processes governing the dynamic translation and propagation of information between arbitrary probability measures. Our theoretical and algorithmic presentation details training and simulation frameworks for both Gaussian and Lévy (specifically, Gamma, Poisson and Stable-$1/2$) random-bridge transports. The empirical validation focuses on the Gaussian case for demonstration and comparison purposes, where our construct delivers high-quality samples, achieving competitive Fréchet Inception Distance scores compared to widely used denoising diffusions and flow matching frameworks.

fields
Probability
pdf ↗ page arXiv:2512.14190 ↗

Semidefinite relaxations of polynomial optimization have become a central tool for addressing the non-convex optimization problems over non-commutative operators that are ubiquitous in quantum information theory and, more in general, quantum physics. Yet, as these global relaxation methods are solved numerically, the bounds issued by the semidefinite solver can - and often do - exceed the global optimum, undermining their certifiability. To counter this issue, we introduce a framework for extracting rigorous certified bounds on non-commutative optimization problems from inexact numerical data, and apply it to several paradigmatic problems in quantum information theory. An extension to sparsity and symmetry-adapted semidefinite relaxations is also provided and compared to the general dense scheme. Our results establish rational post-processing as a practical route to reliable certification, pushing semidefinite optimization toward a certifiable standard for quantum information science.

comments
30 pages, 11 figures
fields
Optimization and Control
pdf ↗ page arXiv:2512.17713 ↗

We explore the phenomenon of cavitation in higher-dimensional elasticity, defining it as the mapping of a punctured ball onto a non-degenerate ring domain. Crucially, for the class of locally quasiconformal mappings (or more general mappings) defined on the punctured ball $0<|x|<1$ in $\mathbb R^n$ that we examine, cavitation is equivalent to a failure of continuous extension to the origin. While existing modulus estimates prove insufficient for reliably detecting cavitation in this setting, our study establishes refined modulus bounds. This is achieved by introducing a novel directional dilatation which, in conjunction with the known angular dilatation, overcomes the limitations of previous methods. We illustrate our theoretical findings with several examples that demonstrate both cavitation occurrence and its absence.

comments
21 pages
fields
Complex Variables
pdf ↗ page arXiv:2512.18731 ↗

We develop an enriched Galerkin (EG) method for the incompressible Navier-Stokes equations that conserves both kinetic energy and helicity in the inviscid limit without introducing any additional projection variables. The method employs an EG velocity space, which is the first-order continuous Galerkin space enriched with piecewise constants defined on mesh faces, together with piecewise-constant pressure. Two numerical schemes based on the rotational form of the convective term are proposed: a nonlinear scheme and a linear variant. Both schemes exactly preserve the discrete helicity and kinetic energy, and the Picard iteration maintains the conservation properties of the nonlinear scheme. We prove the conservation properties of both the methods, and establish stability and rigorous error estimates for the nonlinear scheme. Numerical examples demonstrate the accuracy and conservation of the proposed linear scheme.

comments
There is an issue regarding the treatment of the Euler equation when ν=0. The relevant part of the manuscript needs to be revised, so I withdraw this submission for correction
fields
Numerical Analysis, Mathematical Physics
pdf ↗ page arXiv:2512.20109 ↗

A problem posed by Erdős in 1945 initiated the study of non-separable arrangements of convex bodies. A finite collection of convex bodies in Euclidean $d$-space is called a non-separable family (or NS-family) if every hyperplane intersecting their convex hull also intersects at least one member of the family. Recent work has focused on minimal coverings of NS-families consisting of positive homothetic convex bodies. In this paper, we strengthen these results by establishing their stability analogues and analyze weakly non-separable families of convex polytopes. We also examine weakly $k$-impassable families of convex $d$-polytopes for $0<k<d-1$ and study tightness of NS-lattice arrangements.

comments
19 pages, 3 figures
fields
Metric Geometry
pdf ↗ page arXiv:2512.23651 ↗

The classical Adams dichotomy [Ada90] characterizes amenability of probability-measure-preserving treed equivalence relations in terms of the ends of a given treeing. We extend this dichotomy to the measure-class-preserving (mcp) setting by analyzing the Radon–Nikodym topography of an acyclic mcp Borel graph, i.e., the interaction between the graph geometry and the associated Radon–Nikodym cocycle. In the general mcp setting one must count not all ends, but only the nonvanishing ends: those ends which have positive upper cocycle-weight. More precisely, we prove that a locally countable acyclic mcp graph is amenable if and only if a.e. component has at most two nonvanishing ends, while it is nowhere amenable exactly when a.e. component has a nonempty perfect closed set of nonvanishing ends. At the heart of our analysis lies the study of acyclic countable-to-one Borel functions. Our critical result is that, outside of the essentially two-ended setting, all back ends in a.e. orbit are vanishing and have cocycle-finite geodesics. We also give several characterizations, including topographical and cocycle-free, of essential one-endedness of such functions, and show that the number of barytropic ends controls the essential number of ends. Our proofs utilize mass transport, end selection, and the notion of the Radon–Nikodym core for acyclic mcp graphs, a new concept that serves as a guiding framework for our topographical analysis.

comments
Added figures and made improvements of exposition, changed the introduction
fields
Dynamical Systems, Logic, Probability
pdf ↗ page arXiv:2512.24741 ↗

Let $G$ be an even-dimensional connected real Lie group admitting a left-invariant complex structure $J$. Let $\mathfrak g$ be the Lie algebra of $G$, and $\mathfrak g^{1,0}$ the $(1,0)$-part of the complexification $\mathfrak g^{\mathbb{C}}$ of $\mathfrak g$. We derive explicit formulas for the holomorphic sectional curvature and holomorphic bisectional curvature of any left-invariant strongly pseudoconvex complex Finsler metric $F$ on $G$, expressed in terms of the complex Lie algebra $\mathfrak g^{1,0}$. We also obtain a necessary and sufficient condition for $F$ to be a Kähler-Finsler metric (resp. weakly Kähler-Finsler metric). As an application, we prove a rigidity result: if $G$ is a complex Lie group and $F$ is a left-invariant strongly pseudoconvex complex Finsler metric on $G$, then $F$ must be a complex Berwald metric with vanishing holomorphic bisectional curvature; moreover, $F$ is a Kähler-Berwald metric if and only if $G$ is an abelian complex Lie group.

comments
28
fields
Differential Geometry
pdf ↗ page arXiv:2512.24791 ↗

We establish characterization of $H^1$ Sobolev spaces by certain square functions, improving previous results.

comments
The results were extended to the one-dimensional case; 3 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2601.00201 ↗

This paper focuses on symbolic integration of differential forms, with a particular emphasis on historical and modern developments, from Abel's addition theorems for Abelian integrals to Zeilberger's creative telescoping for parameterized integrals. It explores closed rational $p$-forms and provides algorithmic approaches for their integration, extending classical results like Hermite reduction and Liouville's theorem. The integration of closed differential forms with parameters is further examined through telescopers, offering a unified framework for handling both algebraic and transcendental cases.

comments
29 pages, no figures, version 3
fields
Classical Analysis and ODEs, Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2601.00721 ↗

Nielsen's geometric approach to quantum circuit complexity provides a Riemannian framework for quantifying the cost of implementing unitary closed-system dynamics. For open evolutions, the reduced dynamics is described by time-dependent families of quantum channels $\{Λ_t\}_{t\ge 0}$ admitting many inequivalent Stinespring realizations, so any meaningful complexity notion must specify which microscopic resources are counted and which transformations are treated as gauge. We develop a dilation-based geometric complexity framework that distinguishes implementation-dependent complexity, attached to a specific realization, from intrinsic channel complexity obtained by minimizing over a physically admissible class of dilations. The proposed functional is subtractive: it removes purely environmental contributions from the geometric cost of the joint unitary realization. The subtraction is derived from concise structural postulates --- closed-system consistency, environment-only neutrality, and invariance under dilation gauge transformations --- and admits a natural variational and geometric interpretation. We also define noise complexity as a companion quantity measuring the geometric deviation of a noisy implementation from a prescribed ideal closed-system evolution. In the Hilbert-Schmidt setting, we establish coherence-based lower bounds for unitary and noise complexity, prove linear time scaling under time-homogeneous dilation models, and obtain dissipator-controlled bounds in the Markovian GKSL regime. We illustrate the framework on canonical single-qubit benchmark channels: dephasing, amplitude damping, and Pauli/depolarizing noise.

journal
Alberto Acevedo and Antonio Falcó 2026 J. Phys. A: Math. Theor. 59 205303
fields
Mathematical Physics
pdf ↗ page arXiv:2601.00735 ↗

We study representations of generalized $k$-linear Reedy categories, extending both the linear Reedy categories of Dalezios and Št'ovíček and $k$-linearizations of generalized Reedy categories of Berger and Moerdijk. We establish homological properties of standard modules and classify irreducible representations in terms of simple modules over the local endomorphism algebras. We give criteria for a decomposition of the representation category into a product of local module categories; under the hypotheses of our non-degeneracy criterion, this decomposition holds if and only if the category is Hom-finite over $k$. Applications include span categories and representations of combinatorial categories. Using Grothendieck bifibrations, we then lift families of complete cotorsion pairs on the local module categories to complete cotorsion pairs on the representation category. Under compatibility assumptions, this also lifts families of (hereditary) Hovey triples and yields abelian model structures, with applications to Gorenstein homological algebra.

comments
Certain techinical and typographic issues fixed
fields
Representation Theory
pdf ↗ page arXiv:2601.01187 ↗

In the present paper, we study a double-phase variable exponent problem which is set up within a variational framework including a singular potential of fractional-Hardy-type. We employ the Mountain-Pass theorem and the strong minimum principle to obtain the existence of at least one nontrivial positive weak solution.

fields
Analysis of PDEs
pdf ↗ page arXiv:2601.01346 ↗

Let $Γ$ be a bounded rectifiable Jordan curve, with complementary domains $Ω_i$ and $Ω_e$. For $1<p<\infty$ and $0<s<1$, we study the spaces $\mathcal B_{p,p}^s(Ω)$ of harmonic functions satisfying \[ \iint_Ω|\nabla u(z)|^p \operatorname{dist}(z,Γ)^{(1-s)p-1}\,dA(z)<\infty, \qquad Ω\in\{Ω_i,Ω_e\}. \] When $Γ$ is the unit circle, the traces of these two spaces coincide with the fractional Besov-Sobolev space $B^s_{p,p}(Γ)$. The equivalence of boundary seminorms and harmonic energies on the circle raises a geometric question: which rough curves preserve these estimates? For every radial-Lipschitz curve $Γ$, we prove \[ \operatorname{Tr}_Γ\mathcal B_{p,p}^s(Ω_i) =B_{p,p}^s(Γ) =\operatorname{Tr}_Γ\mathcal B_{p,p}^s(Ω_e) \] whenever either $1 < p < 2$ and $2/p - 1 \leq s < 1$, $2 < p < \infty$ and $0 < s \leq 1/2 + 1/p$ or $p=2$ and $0<s<1$. For arbitrary chord-arc curves, the same trace identities hold when $1/p\le s<1/2+1/(2p)$. Taking $s=1-1/p$ yields an almost-Dirichlet principle for the unweighted $p$-energy on radial-Lipschitz domains when $3/2\le p\le4$. Here, the upper bound $4$ is sharp. In particular, every Riemann map $g:Ω_i\to\mathbb D_i$ from a bounded radial-Lipschitz domain satisfies $g'\in L^4(Ω_i)$, and the exponent $4$ is optimal uniformly over this class. This gives a sharp endpoint counterpart of Brennan's integrability conclusion for radial-Lipschitz domains.

comments
56 pages, 3 figures
fields
Complex Variables, Classical Analysis and ODEs
pdf ↗ page arXiv:2601.01348 ↗

We study compact complex $3$-dimensional non-Kähler Bismut Ricci flat pluriclosed Hermitian manifolds (BHE) via their dimensional reduction to a special Kähler geometry in complex dimension $2$, recently obtained by Barbaro, Streets and the first and third authors. We show that in the quasi-regular case, the reduced geometry satisfies a 6th order non-linear PDE which has infinite dimensional momentum map interpretation, similar to the much studied Kähler metrics of constant scalar curvature (cscK). We use this to associate to the reduced manifold or orbifold Mabuchi and Calabi functionals, as well as to obtain obstructions for the existence of solutions in terms of the authomorphism group, paralleling results by Futaki and Calabi-Lichnerowicz-Matsushima in the cscK case. This is used to characterize the Samelson locally homogeneous BHE geometries in complex dimension 3 as the only non-Kähler BHE $3$-folds with $2$-dimensional Bott-Chern $(1,1)$-cohomology group, for which the reduced space is a smooth Kähler surface. We also discuss explicit solutions of the PDE on orthotoric Kähler orbifold surfaces, extending examples found by Couzens-Gauntlett-Martelli-Sparks in the framework of supersymmetric ${\rm AdS}_3 \times Y_7$ type IIB supergravity. Our construction yields infinitely many non-Kähler BHE structures on $S^3\times S^3$ and $S^1\times S^2 \times S^3$, which are not locally isometric to a Samelson geometry. These appear to be the first such examples.

comments
Typos and the statement of Lemma 8.1 corrected. Final version
fields
Differential Geometry
pdf ↗ page arXiv:2601.04937 ↗

The online Ramsey number $\tilde r(G,H)$ is defined via a Builder–Painter game on an empty graph with countably many vertices. In each round, Builder reveals an edge, which Painter immediately colors either red or blue. Builder wins once a red copy of $G$ or a blue copy of $H$ appears, and $\tilde r(G,H)$ is the minimum number of edges Builder must reveal to force a win. For a long cycle $C_\ell$, the online Ramsey numbers $\tilde r(G,C_\ell)$ are known only for a few specific choices of $G$. In particular, exact values were determined for $G=P_3$ by Cyman, Dzido, Lapinskas, and Lo (Electron. J. Combin., 2015), while asymptotically tight results were obtained when $G$ is an even cycle by Adamski, Bednarska-Bzdȩga, and Blažej (SIAM J. Discrete Math., 2024). In this paper, we consider the case where $G$ is the claw $K_{1,3}$ and determine the exact value of $\tilde r(K_{1,3},C_\ell)$. We show that \[ \tilde r(K_{1,3},C_\ell)=\left\lfloor \frac{3(\ell+1)}{2} \right\rfloor \quad \text{for all } \ell \ge 13. \]

fields
Combinatorics
pdf ↗ page arXiv:2601.05452 ↗

Most numerical methods for time integration use real-valued time steps. Complex time steps, however, can provide an additional degree of freedom, as we can select the magnitude of the time step in both the real and imaginary directions. We show that specific paths in the complex time plane lead to expanded stability regions, providing clear computational advantages for complex-valued systems. In particular, we highlight the Schrödinger equation, for which complex time integrators can be uniquely optimal. Furthermore, we demonstrate that these benefits extend to certain classes of real-valued stiff systems by coupling complex time steps with the Projective Integration method.

fields
Numerical Analysis, Mathematical Physics, Complex Variables
pdf ↗ page arXiv:2601.07730 ↗

This work concerns the computation of ground states of two-component spin-orbit coupled Bose-Einstein condensates (SO-coupled BECs), modelled by a coupled nonlinear eigenvalue problem of Gross-Pitaevskii type. In regimes with strongly modulated densities, including supersolid-like phases, conventional numerical approaches such as generalized inverse iterations or gradient descent may converge slowly. To address this issue, we apply the J-method [E. Jarlebring, S. Kvaal, W. Michiels. SIAM J. Sci. Comput. 36-4, 2014], which allows nonlinear inverse iterations to be accelerated through spectral shifting. A central analytical challenge arises from global phase invariance, which causes the target eigenvalue of the J-operator to be multiple and prevents the direct application of existing convergence results based on simple eigenvalues. Under a quasi-isolation assumption, we establish that this eigenvalue has algebraic and geometric multiplicity exactly two. By introducing an auxiliary phase-fixed iteration, we prove local linear convergence rates for the shifted J-method, determined by spectral gaps, in a quotient metric modulo global phase rotations. The particle densities converge at the same rate. Numerical experiments confirm the predicted linear convergence for fixed shifts and indicate superlinear convergence for adaptively chosen shifts.

fields
Numerical Analysis
pdf ↗ page arXiv:2601.08990 ↗

We study bounded solutions of Dirichlet boundary value problems for semilinear elliptic equations on Cartan-Hadamard manifolds with pinched negative curvature. We prove nonexistence when the asymptotic boundary has zero Hausdorff measure at an exponent determined by the upper curvature bound and the spectral parameter. The result holds for continuous viscosity solutions under a one-sided bound on the nonlinearity, including the Allen-Cahn equation. The proof combines convex barriers at infinity, distance comparison for $C^{1,1}$ hypersurfaces and a spectral maximum principle. For surfaces, no lower curvature bound is needed.

comments
31 pages, 8 figures. v2: revised version with stronger results
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2601.09930 ↗

In this paper, we study a delayed forward-backward stochastic control system in which all the coefficients depend on the state and control terms, and the control domain is an arbitrary nonempty set. To handle the terms involving $y$ and $z$ in the second-order expansion, we derive two decompositions of $\big(\hat{y}^\e(\cd), \hat{z}^\e(\cd)\big)$. More precisely, we use the second decomposition to handle the terms involving $f^\e_{yy}, f^\e_{yz}$ and use both decompositions to handle the term involving $f^\e_{zz}$. Finally, a global stochastic maximum principle is obtained.

comments
Substantial revisions, including corrections to the proofs
fields
Optimization and Control
pdf ↗ page arXiv:2601.14138 ↗

In this paper we prove that the first Dirichlet eigenvalue $λ_1^N$ of an $N$-sided regular polygon of fixed area is a monotonically decreasing function of $N$ for all $N \geq 3$, as well as the monotonicity of the quotients $\displaystyle \frac{λ_1^{N}}{λ_1^{N+1}}$. This settles a conjecture of Antunes-Freitas from 2006 [P. Antunes, P. Freitas, Experiment. Math., 15(3):333-342, 2006].

comments
48 pages, 5 figures. To appear in Foundations of Computational Mathematics
fields
Spectral Theory, Analysis of PDEs
pdf ↗ page arXiv:2601.16285 ↗

Decentralized pricing in multi-product firms and marketplaces can lose revenue because each decision maker ignores how its price affects the demand for other products. We quantify this loss through the price of anarchy of a game in which the price of each product is set to maximize that product's own revenue. Demand is linear, and cross-price effects may be substitutes or complements and need not be symmetric. Under a two-sided diagonal dominance condition with parameter $μ\in[0,1)$, which bounds the aggregate absolute cross-price effects in each row and column relative to the own-price effect, we show that the game has a unique Nash equilibrium and that equilibrium revenue is at least a fraction $4(1-μ)/(2-μ)^2$ of the centralized optimum. This bound was previously known for symmetric gross substitutes; we show that it remains valid for signed and asymmetric interactions, and that it is tight. Because asymmetry breaks the simultaneous diagonalization underlying existing analyses, we instead evaluate the revenue gap at the equilibrium itself. This yields an exact formula for the worst-case price of anarchy of each demand matrix in terms of a normalized interaction matrix, which can be much sharper than the scalar bound in heterogeneous interaction networks. The same argument extends the guarantee to jointly concave nonlinear demand under pointwise dominance of the demand Jacobian, for every pure-strategy equilibrium.

fields
Optimization and Control
pdf ↗ page arXiv:2601.18117 ↗

In this paper, we investigate recurrence relations for the Maclaurin coefficients of the products of a elementary function and the Bessel function of the first kind $\mathcal{J}(z) = h(z) J_ν(z)$ and the modified Bessel function of the first kind $\mathcal{I}(z) = h(z) I_ν(z)$ in the complex plane corresponding to several specific choices of $h(z)$. In particular, we specialize $h(z)$ as $e^{pz}$, $(1-θz)^p$, $e^{-p \arctan z}$, $\sin(pz)$, $\cos(pz)$, $\sinh(pz)$, $\cosh(pz)$, $\arcsin(pz)$ and $\arccos(pz)$.

fields
Complex Variables
pdf ↗ page arXiv:2601.18332 ↗

We investigate the Hasse principle for Diophantine systems consisting of one diagonal form of degree $k$ and one general form of degree $k-1$. By refining the method of Brandes and Parsell (arXiv:2003.04350) in this specific setting, we improve the bound $n > 2^k k$ to $n > 2^{k-1}(2k-1)$; in particular, the requirement $n > 24$ in the case of degrees three and two is relaxed to $n > 20$.

comments
12 pages, revised version
fields
Number Theory
pdf ↗ page arXiv:2601.18581 ↗

We establish two inequalities in real inner product spaces. The first is a multiplicative strengthening of the classical Hornich-Hlawka inequality: for all vectors $x,y,z$ in a real inner product space $H$, \[ \|x\|\,\|y\| + \|z\|\,\|x+y+z\| \;\geq\; \|x+z\|\,\|y+z\|.\] We provide a complete characterization of the equality cases. The second result is a parametric inequality derived from the positive semidefiniteness of Gram matrices: for all $x,y,z \in H$ and $α, β, γ\in \mathbb{R}$, \[ α^2\|x\|^2\langle y,z\rangle^2 + β^2\|y\|^2\langle x,z\rangle^2 + γ^2\|z\|^2\langle x,y\rangle^2 + 2(αβ+ αγ+ βγ)\langle x,y\rangle\langle x,z\rangle\langle y,z\rangle \;\geq\; 0 \], which, upon optimization over the parameters yields sharp reverse inequalities to the Gram determinant inequality $\det G \geq 0$. As a special case, this recovers and strengthens the classical Cauchy-Schwarz inequality.

comments
10 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2601.18768 ↗

The construction of Maximum Distance Profile (MDP) convolutional codes in general requires the use of very large finite fields. In contrast convolutional codes with optimal column distances maximize the column distances for a given arbitrary finite field. In this paper, we present a construction of such convolutional codes. In addition, we prove that for the considered parameters the codes that we constructed are the only ones achieving optimal column distances. The structure of the presented convolutional codes with optimal column distances is strongly related to first order Reed-Muller block codes and we leverage this fact to develop a reduced complexity version of the Viterbi algorithm for these codes.

fields
Information Theory
pdf ↗ page arXiv:2601.20825 ↗

High-fidelity (HF) simulations of parametric partial differential equations are expensive, whereas low-fidelity (LF) models such as coarse grids or simplified physics are cheap but biased. Multi-fidelity physics-informed neural networks combine the two, yet it remains unclear when cheap physics actually reduces the number of HF solves, and existing methods silently fail when the LF model is misleading and offer no guaranteed uncertainty. We answer the first question with a sharp sample-complexity bound: learning the HF field through its discrepancy from the LF model reduces the number of HF samples needed for accuracy $\varepsilon$ by the factor $κ^{2γ}$, where $κ$ is the ratio of the complexity of the discrepancy to that of the HF field and $γ$ is the effective-dimension exponent, and we confirm the predicted scaling with exact risk computations in a kernel model. Guided by the analysis, we propose GaMF-PINN, a gated multi-fidelity PINN that learns where to trust the LF model and falls back to physics-only learning where it does not, together with a function-level conformal procedure that returns uncertainty bands containing the entire HF solution with probability at least $1-α$ in finite samples. We release MFPDE-Bench, an open benchmark of paired LF/HF solvers for four parametric PDEs with coarse-grid and simplified-physics LF models. Across MFPDE-Bench, GaMF-PINN reaches the accuracy of a standard HF-PINN with up to 8x fewer HF solves, remains robust when the LF model is deliberately corrupted, and attains the nominal coverage where Bayesian PINNs and deep ensembles under-cover.

comments
12 pages, 2 figures, 6 tables
fields
Numerical Analysis
pdf ↗ page arXiv:2602.01176 ↗

Modern neural networks have shown promise for solving partial differential equations over surfaces, often by discretizing the surface as a mesh and learning with a mesh-aware graph neural network. However, graph neural networks suffer from oversmoothing, where a node's features become increasingly similar to those of its neighbors. Unitary graph convolutions, which are mathematically constrained to preserve smoothness, have been proposed to address this issue. Despite this, in many physical systems, such as diffusion processes, smoothness naturally increases and unitarity may be overconstraining. In this paper, we systematically study the smoothing effects of different GNNs for dynamics modeling and prove that unitary convolutions hurt performance for such tasks. We propose relaxed unitary convolutions that balance smoothness preservation with the natural smoothing required for physical systems. We also generalize unitary and relaxed unitary convolutions from graphs to meshes. In experiments on PDEs such as the heat and wave equations over complex meshes and on weather forecasting, we find that our method outperforms several strong baselines, including mesh-aware transformers and equivariant neural networks.

comments
Ecstatic to share relaxed unitary mesh convolutions with the community :D! This version contains the camera ready for ICML 2026. V4 differs from V3 in that it fixes a small typo in the appendix example. Send me an email with your thoughts! I love getting mail :^)
fields
Symplectic Geometry
pdf ↗ page arXiv:2602.05352 ↗

In this paper, we study the partial differential equation on the circle that was heuristically obtained by Steinerberger \cite{steinerberger2019nonlocal} on the real line and which represents the evolution of the density of the roots of polynomials under differentiation. After integrating the partial differential equation in question, we observe that it can be treated with the theory of viscosity solutions. This equation at hand is a non linear parabolic integro-differential equation which involves the elliptic operator called the half-Laplacian. Due to the singularity of the equation, we first restrict our study to strictly positive initial condition. We obtain a comparison principle for solutions of the primitive equation which yields uniqueness, existence, continuity with respect to initial condition. We then extend these results to general initial data. We finally prove that the system of particles on the circle introduced by Steinerberger indeed approximates the solution of the equation.

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

We discuss the classical elliptic Toda chain introduced by Krichever and the elliptic Ruijsenaars-Toda chain introduced by Adler, Shabat and Suris. It is shown that these models can be obtained as particular cases of the elliptic Ruijsenaars chain. We explain how the classical $r$-matrix structures are derived for these chains. Also, as a by-product, we prove that the elliptic Ruijsenaars-Toda chain is gauge equivalent to discrete Landau-Lifshitz model of XYZ type. The elliptic Toda chain is also gauge equivalent to XYZ chain with special values of the Casimir functions at each site.

comments
29 pages, minor changes, details added to Section 5, typos corrected
journal
Journal of Geometry and Physics 226 (2026) 105848
fields
Mathematical Physics
pdf ↗ page arXiv:2602.08143 ↗

In this paper, we present a thorough von Neumann stability analysis of explicit and implicit Arbitrary-Lagrangian-Eulerian (ALE) ADER discontinuous Galerkin (DG) methods on classical and degenerate spacetime geometries for hyperbolic equations. First, we rigorously study CFL stability conditions for the explicit ADER-DG method, confirming results widely used in the literature while specifying their limitations. Moreover, we discuss stability bounds for ALE methods and characterize the admissible range of grid velocities once a target CFL is fixed. Next, we extend the stability study to ADER-DG in the presence of degenerate spacetime elements, with zero size at the beginning and the end of the time step, but with a non zero spacetime volume. This kind of elements has been introduced in a series of articles on direct ALE methods by Gaburro et al. to connect via spacetime control volumes regenerated Voronoi tessellations after a topology change. Here, we imitate this behavior in a 1d surrogate setting by fictitiously inserting degenerate elements in between two cells. We show that over this simplified degenerate spacetime geometry, both for the explicit and implicit ADER-DG, the von Neumann analysis leads to the same CFL stability conditions as those for classical geometries, laying the theoretical foundations for their use in the context of ALE methods.

comments
25 pages, 11 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2602.09198 ↗

We study the almost sure convergence of the Stochastic Approximation algorithm to the fixed point $x^\star$ of a nonlinear operator under a negative drift condition and a general noise sequence with finite $p$-th moment for some $p > 1$. Classical almost sure convergence results of Stochastic Approximation are mostly analyzed for the square-integrable noise setting, and it is shown that any non-summable but square-summable step size sequence is sufficient to obtain almost sure convergence. However, such a limitation prevents wider algorithmic application. In particular, many applications in Machine Learning and Operations Research admit heavy-tailed noise with infinite variance, rendering such guarantees inapplicable. On the other hand, when a stronger condition on the noise is available, such guarantees on the step size would be too conservative, as practitioners would like to pick a larger step size for a more preferable convergence behavior. To this end, we show that any non-summable but $p$-th power summable step size sequence is sufficient to guarantee almost sure convergence, covering the gap in the literature. For the regime $p \in (1, 2)$, we show that using the $\|x-x^\star\|^p$-like Lyapunov function and applying the Holder-smoothness bound suffice. For $p > 2$, such an approach is no longer applicable, and therefore, we introduce a novel iterate projection technique to control the nonlinear terms produced by high-moment bounds and multiplicative noise. We believe our proof techniques and their implications could be of independent interest and pave the way for finite-time analysis of Stochastic Approximation under a general drift condition. As a starting point, we establish almost sure convergence results for non-expansive operators under a multiplicative noise condition for $p \in (1,2]$ and an additive noise condition for $p \in (2,\infty)$.

comments
46 pages, 1 figure
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2602.10580 ↗

The motivation of this paper is twofold. We firstly investigate the block-diagonalization of the $z$-block circulant matrix $\mathtt{bcirc_z}(\mathcal A)$, and develop the algorithm $\mathtt{bcirc_z}$-inv for computing the inverse of $\mathtt{bcirc_z}(\mathcal A)$. Second, we establish the multiplicativity of the operator $\mathtt{bcirc_z}$, which yields the equivalence between the QT-product of tensors and the multiplication of their corresponding $z$-block circulant matrices. As applications of these results, we conduct large-scale numerical experiments and analyze the scalability of the Tikhonov-regularized model. We also obtain polar decompositions under the QT-product, develop an algorithm for computing them, and present a large-scale test and a scalability analysis. In addition, we evaluate several rotation strategies based on the QT-polar decomposition through video rotation applications. The results show that the decomposition remains stable and maintains inter-frame consistency while accurately preserving colors.

fields
Numerical Analysis
pdf ↗ page arXiv:2602.11493 ↗

To measure spillovers, researchers often summarize who else was treated with a simple measure, such as the share of treated neighbors. We study what the researcher estimates when that summary is misspecified. We show that the researcher estimates the best approximation to the true policy effect among all functionals of the chosen summary, and that the usual direct and spillover estimates are exactly the components of this approximation. We then specialize this framework to a setting common in applications such as cash transfers: treatment spills over both globally, through market equilibrium, and locally, through network externalities, while the researcher models only one channel. The network estimator still recovers the network spillover, and the equilibrium estimator the equilibrium spillover, even when the other channel is ignored. We illustrate with a simulation calibrated to a large cash-transfer experiment.

fields
Statistics Theory
pdf ↗ page arXiv:2602.12023 ↗

In this letter we discuss the classical integrable elliptic Toda chain proposed by I. Krichever. Our goal is to construct an open elliptic Toda chain with boundary terms. This is achieved using the factorized form of the Lax matrix and gauge equivalence with the XYZ chain.

comments
13 pages, typos corrected, comments and proofs added
journal
J. Math. Phys. 67, 072704 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2602.13903 ↗

In this paper we present Hardy type inequalities for magnetic Dirichlet forms with singular integral weights. We analyze the local and global optimality of the integral weight and discuss several examples in details. An application of our results to spectral estimates for magnetic Schrödinger operators is provided as well.

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

Given a trivially graded polynomial ring $P_0=K[a_1,\dots,a_m]$ over a field $K$ and a positively graded polynomial ring $P=P_0[x_1,\dots,x_s]$, we study graded rings $R=P/I$, where $I$ is a homogeneous ideal of $P$ satisfying $I\cap P_0=\{0\}$. The induced morphism $Θ: {\rm Spec}(R)\rightarrow {\rm Spec}(P_0) = \mathbb{A}^m_K$ is used to prove that ${\rm Spec}(R)$ is connected. Next, we characterize and compute the following loci in $\mathbb{A}^m_K$: the set ${\rm Sing}_0(Θ)$ of all points whose corresponding point in the zero section of $Θ$ is singular in ${\rm Spec}(R)$, the set ${\rm Sing}_v(Θ)$ of all points $Γ$ such that the origin of the fiber $F_Γ$ of $Θ$ is singular, and the set ${\rm Sing}_s(Θ)$ of all points $Γ$ such that $\dim({\rm Sing}(F_Γ))\ge 1$. Finally, we apply these results to MaxDeg border basis schemes. Their coordinate rings are non-negatively graded by the total arrow degree and satisfy the above hypotheses. In particular, we explicitly determine the singular loci of the $\mathcal{O}$-border basis schemes with $\mathcal{O} = \{1,x,y,z,z^2\}$ and $\mathcal{O} = \{1,x,y,z,yz\}$.

comments
22 pages; several corrections and clarifications; to appear in Acta Math. Vietnamica
fields
Commutative Algebra
pdf ↗ page arXiv:2602.22891 ↗

We prove that if the 0-th Tanaka prolongation $\mathfrak{g}_0=\mathfrak{der}_0(\mathfrak{m})$ of a fundamental graded nilpotent Lie algebra $\mathfrak{m}=\mathfrak{g}_{-s}\oplus\dots\oplus\mathfrak{g}_{-1}$ is irreducible on $\mathfrak{g}_{-1}$, then $\mathfrak{m}$ is prolongation rigid: $\text{pr}_+(\mathfrak{m})=0$. The only exceptions are given by negative gradations of maximal parabolic subalgebras of a simple Lie algebra.

comments
A few minor improvements and an acknowledgement added
fields
Differential Geometry, Representation Theory
pdf ↗ page arXiv:2603.01643 ↗

We study the Klein-Gordon equation in one spatial and one temporal dimension. Physically, this equation describes the wave function of a relativistic spinless boson with positive rest mass. Mathematically, this is the most elementary hyperbolic partial differential equation, after the wave equation itself. Relative to the origin, the spacetime splits according to the light cones, and we find four quarter-planes, two of which are timelike while the remaining two are spacelike. Not unexpectedly, the solutions behave quite differently in the two types of quarter-planes. It turns out that the spacelike quarter-planes exhibit a Liouville phenomenon, where insufficient growth forces the solutions to display a certain kind of symmetry, where the values on the two linear edges are in a one-to-one relation. This phenomenon shares features with the classical Liouville theorem as well as the Phragmen-Lindelof principle for harmonic functions. We obtain sharp transition from uniqueness to nonuniqueness.

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

We prove Lubin's conjecture for height-one commuting pairs of formal power series defined over the ring of integers $\mathcal{O}$ of finite extensions of $\mathbb{Q}_p$ whose ramification index is coprime to $p(p-1)$. For such a pair $(f, u)$, with $f$ noninvertible and $u$ invertible, we show that $(f, u)$ is a pair of endomorphisms of a formal group defined over $\mathcal{O}$. The proof relies on extracting a crystalline character of weight $1$ from the Galois set $T_f$ of $f$-consistent sequences, using it to define a $\mathbb{Z}_p$-module structure on $T_f$ for which $f$ is an endomorphism, and applying explicit functors in integral $p$-adic Hodge theory to recover the latent formal group.

comments
17 pages, 1 figure
fields
Number Theory, Dynamical Systems
pdf ↗ page arXiv:2603.03873 ↗

Recently a new family of enumerative invariants called leaky Hurwitz numbers was introduced by Cavalieri-Markwig-Ranganathan in the context of logarithmic intersection theory. They admit an interpretation via tropical covers where the balancing condition fails. We employ tropical geometry to prove a generalisation of the piecewise polynomiality of Accadia-Karev-Lewanski for leaky completed cycles Hurwitz numbers, and a different wall crossing that is cubic instead of quadratic. Using tropical combinatorics and generatingfunctionology, we also find closed formulae for one-part and two-part completed cycles leaky Hurwitz numbers in genus $0$. Working more generally with a view towards topological recursion, we use Hamiltonian flows to associate spectral curves to very general cut-and-join operators. Under mild analytic constraints, we find the appropriate spectral curves, and in case the leakiness is fixed, we show that the resulting enumerative invariants satisfy topological recursion. This provides a partial inverse to recent work of Alexandrov-Bychkov-Dunin-Barkowski-Kazarian-Shadrin producing differentials satisfying topological recursion for KP $τ$-functions. In particular these results specialise to completed cycles leaky Hurwitz numbers.

comments
53 pages, comments welcome, improved section 6, added section 8
fields
Algebraic Geometry, Mathematical Physics, Combinatorics
pdf ↗ page arXiv:2603.06094 ↗

Based on Dou Huashu's energy gradient theory, this paper focuses on the weak singularity of the incompressible Navier-Stokes (NS) equations in steady, fully developed flows. When the gradient of total mechanical energy is perpendicular to the streamline (i.e., $ u_j \frac{\partial E}{\partial x_j} = 0 $), substituting this critical condition into the NS equations with no-slip boundary conditions leads to the viscous term $ ν\to 0 $. To rigorously analyze the regularity of the solution, Sobolev space $ H_0^1(Ω) $ is introduced for energy estimation. The results show that the velocity field loses $ H^1 $-regularity, and the NS equations degenerate into Euler equations, which admit discontinuous weak solutions. Thus, the position where the mechanical energy gradient is perpendicular to the streamline becomes a weak singularity of the NS equations.

fields
Analysis of PDEs
pdf ↗ page arXiv:2603.07574 ↗

Zero-knowledge codes, introduced by Decatur, Goldreich, and Ron (ePrint 1997), are error-correcting codes in which few codeword symbols reveal no information about the encoded message, and have been extensively used in cryptographic constructions. Quantum CSS codes, introduced by Calderbank and Shor (Phys. Rev. A 1996) and Steane (Royal Society A 1996), are error-correcting codes that allow for quantum error correction, and are also useful for applications in quantum complexity theory. In this short note, we show that (linear, perfect) zero-knowledge codes and quantum CSS codes are equivalent. We demonstrate the potential of this equivalence by using it to obtain explicit asymptotically-good zero-knowledge locally-testable codes.

comments
Instantiated transformation with latest LTC constructions
fields
Information Theory
pdf ↗ page arXiv:2603.08941 ↗

The paper describes a cover of the future cover of a sofic shift which is canonical in the same way as the future cover itself. In some cases the cover is isomorphic to the future cover and in other it is a genuine extension. The extended future cover is then used to introduce and describe the desynchronization of sofic shifts.

comments
v4: Corrected Example 6.2 and some minor edits. 30 pages
fields
Dynamical Systems
pdf ↗ page arXiv:2603.09593 ↗

In this paper, we address broader concepts of Dunford-Pettis operators, presenting new classes and results that relate this class to others already well studied in the literature, as well as an approach outside the origin. We also investigate inclusion results and conditions for the coincidence of this class with previously studied classes and with new classes that arise throughout this work.

fields
Functional Analysis
pdf ↗ page arXiv:2603.09687 ↗

Several methods for computing the action of the matrix exponential $\mathrm{e}^{\boldsymbol{A}} \boldsymbol{b}$ are expressed by substituting $\boldsymbol{A}$ into a rational approximation of the scalar exponential function. When $\boldsymbol{A}$ is a general sparse matrix, the approximation error of such methods can be bounded using the numerical range of $\boldsymbol{A}$, which enables the computation of $\mathrm{e}^{\boldsymbol{A}} \boldsymbol{b}$ with a prescribed accuracy. This study extends this error control framework to matrices of the form $\boldsymbol{A} = τ\boldsymbol{M}^{-1} \boldsymbol{K}$, where $\boldsymbol{M}$ is a well-conditioned symmetric positive definite matrix. A direct application of the framework faces two challenges: determining the numerical range of $\boldsymbol{A}$ is not straightforward, and the resulting error bounds can significantly overestimate the approximation error. In this paper, we show that these issues can be resolved by using the numerical range of the similarity transformed version of $\boldsymbol{A}$. Numerical experiments confirm that the computations can be performed within the prescribed error tolerance.

fields
Numerical Analysis
pdf ↗ page arXiv:2603.11871 ↗

Recently proposed analog solvers based on dynamical systems, such as Ising machines, are promising platforms for large-scale combinatorial optimization. Yet, given the heuristic nature of the field, there is very limited insight on optimality guarantees of the solvers, as well as how parameter schedules shape dynamics and outcomes. Here, we develop a dynamical mean-field framework to analyze Ising-machine dynamics for finding the ground state energy of the Sherrington-Kirkpatrick(SK) model of spin glasses and identify mechanisms that enable rapid convergence to provenly near-optimal energies. For a fixed target energy density Ec, we show that solutions are typically reached within O(1) matrix vector multiplications, indicating constant time complexity. We further delineate theoretical limitations arising from different parameter-scheduling trajectories and demonstrate a pronounced benefit of temperature-only annealing for the Coherent Ising Machine. Building on these insights, we propose a general framework for designing optimized parameter schedules, thereby improving the practical effectiveness of Ising machines for complex optimization tasks. The superior performance of the dynamical solvers is illustrated by the attainment of the ground state energy of the SK model.

fields
Dynamical Systems
pdf ↗ page arXiv:2603.13778 ↗

This paper is concerned with the Taylor-reduced basis method (Taylor-RBM) for the efficient approximation of eigenspaces of large-scale parametric Hermitian matrices. The Taylor-RBM is a local model order reduction method, which constructs an approximation space by using the ranges of scaled derivatives of the spectral projector at a reference point in the parameter domain. For a prescribed order $n$, under local $\mathrm{C}^{n+1}$-regularity, we prove local convergence of orders $n+1$ and $2n+2$ for the eigenspace and the Ritz-value sum, respectively, and present a computationally efficient procedure for assembling the Taylor reduced basis space. Since this method is tightly connected to multivariate perturbation theory, we also analyze a projector approximation obtained from the finite Taylor polynomial of the eigenprojector and compare it with the Taylor-RBM.

comments
theoretical framework substantially revised. now 31 pages, 5 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2603.14620 ↗

We present a self-contained investigation of the local and global well-posedness of a system of nonlocal advection–diffusion equations for a heterogeneous population over $\mathbb{R}^d$, $d \in \mathbb{N}$. Each convolution kernel $K_{ij}$, which describes the nonlocal advection of species $i$ according to the distribution of species $j$, is assumed to have its own regularity $\nabla K_{ij} \in L^{q_{ij}}(\mathbb{R}^d)$, $1 < q_{ij} < \infty$. Local well-posedness of the mild solution and its regularity is obtained using semigroup theory and contraction mapping arguments. For kernels that satisfy a given interaction cycle condition, global existence is established using a Nash-type inequality to show an \textit{a priori} energy bound. For a class of kernels that need not satisfy the interaction cycle condition, a dynamical property satisfied by a normalised \(L^p\) norm of each species is used to obtain a uniform-in-time bound under a smallness condition on the initial data. An example family of kernels with varying regularities, supplemented by numerical simulations, is then considered to illustrate the theory developed in this work and how it may be generalised.

fields
Analysis of PDEs
pdf ↗ page arXiv:2603.17749 ↗

Machine learning has opened new frontiers in purely data-driven forecasting of dynamical systems; the resulting methods are showing considerable promise in some application domains. However, in contrast to model-driven algorithms, analysis of these data-driven methods is poorly developed. In this paper we address this issue, developing a theory to underpin data-driven methods to solve forecasting problems. The theoretical framework comprises two key components: (i) establishing the existence of a mapping defining the forecasting problem; (ii) showing that it is possible to approximate this mapping by supervised learning techniques, to arbitrary accuracy. We work in the continuous-time and noise-free setting as this defines a simple canonical setting in which to establish an underpinning theory; the continuous-time setting leads to an operator formulation of the problem in which the underlying forecasting map is defined on pathspace. As a byproduct of our framework we show that analogous existence and approximation results may be obtained for the smoothing problem of recovering unobserved components of dynamical systems, from observed components, using supervised learning. The theoretical results, for both forecasting and smoothing, are illustrated with experiments studying the Lorenz `63, Lorenz `96 and Kuramoto-Sivashinsky dynamical systems.

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

We present a systematic analytic study of the $p$-Bessel functions $\mathcal{J}_{ω,\varphi}^{[p]}$, a novel class of generalized Bessel functions arising from Fourier analysis on planar domains bounded by $p$-circles, including astroid-type shapes with $0<p\le2$ satisfying $(2/p)\in\mathbb{N}$. While previous work established Hardy-type oscillatory identities for these domains, expressing lattice point discrepancies via $p$-Bessel functions, the present paper focuses on the intrinsic analytic properties of the functions themselves. In particular, we (i) construct a hierarchical structure of $\{\mathcal{J}_{ω,\varphi}^{[p]}\}_{ω\ge0}$ using Erdélyi-Kober-type fractional derivatives, (ii) derive explicit real-analytic integral representations and obtain asymptotic formulas on the coordinate axes, and (iii) extend the functions to the complex domain through Poisson-type integral formulas. These results establish $p$-Bessel functions as genuinely new oscillatory kernels, providing a rigorous framework for studying anisotropic oscillatory phenomena and laying the analytic foundation for applications in $p$-circle lattice point problems.

comments
20 pages, 1 figure
fields
Number Theory
pdf ↗ page arXiv:2603.21072 ↗

We study categorical channel design under a bound on the maximum directed pairwise Renyi divergence. We determine exactly which orders make randomized response optimal in every dimension and at every finite budget: the orders strictly above one and at most two. In that range we identify the full information-trace frontier and its unique optimal anchored law. The channel is visibly thinned randomized response below a uniquely defined threshold and ordinary randomized response above it. A fixed-second-moment inequality and a second-order variational argument reduce arbitrary channel columns to singleton templates. Above order two, an explicit subset-selection channel beats every mixture of singleton templates in a finite dimension. The trace frontier also gives the exact finite-sample minimax risk among all unbiased real-valued vector estimators, and the asymptotic minimax risk among all estimators for every budget sequence with diverging total information. Appendices compare pure local privacy and distinguish homogeneous shuffle contamination from arbitrary neighboring datasets.

comments
v2: complete rewrite with a new title; 23 pages; ancillary Python script. The v1 shuffle privacy envelope is restricted to homogeneous contamination (Appendix D), with a counterexample for arbitrary neighbors
fields
Information Theory
pdf ↗ page arXiv:2603.21197 ↗

Henze and Malikiosis (2017) have shown that the Lonely Runner Conjecture (LRC) can be restated as a convex-geometric question on the so-called LR zonotopes, lattice zonotopes with one more generator than their dimension. This relation naturally suggests a more general statement, the shifted LRC, the zonotopal version of which concerns a classical parameter, the covering radius. In this paper we do two things: 1) We show explicit counterexamples to both the shifted Lonely Runner Conjecture (starting at $n=5$) and to the Lonely Vector Property of Malikiosis-Schymura-Santos (2025). 2) We push the analogies between the two versions of LRC and their zonotopal counterparts, in particular highlighting that the proofs of the finite-checking Theorems A and B in Malikiosis-Schymura-Santos (2025) are more transparent, and the statements more general, if regarded in terms of two quite general classes of lattice zonotopes: the coloopless zonotopes that we introduce here and the cosimple ones, already defined by them.

comments
41 pages, 6 figures. Main changes from v3 are minor edits and update/addition of references. This version has been accepted for "Revista Matemática Complutense''
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2603.24784 ↗

Wall-Sun-Sun primes (shortly WSS primes) are defined as those primes $p$ such that the period of the Fibonacci recurrence is the same modulo $p$ and modulo $p^2.$ This concept has been generalized recently to certain second order recurrences whose characteristic polynomials admit as a zero the principal unit of $\mathbb{Q}(\sqrt{d}),$ for some integer $d>0.$ Primes of the latter type we call $WSS(d).$ They correspond to the case when $\mathbb{Q}(\sqrt{d})$ is not $p$-rational. For such a prime $p$ we study the weight distributions of the cyclic codes over $\mathbb{F}_p$ and $\mathbb{Z}_{p^2}$ whose check polynomial is the reciprocal of the said characteristic polynomial. Some of these codes are MDS (reducible case) or NMDS (irreducible case).

fields
Number Theory
pdf ↗ page arXiv:2603.25343 ↗

Using sharp global heat kernel bounds and geodesic comparison geometry, we show that the Dalang condition for well-posedness of the parabolic Anderson model with measure-valued initial conditions, first introduced on Euclidean space, holds on general compact Riemannian manifolds. We furthermore establish upper and lower moment bounds for all such solutions, providing evidence for intermittency in this generality. This extends and simplifies earlier work that required non-positive curvature.

comments
33 pages
fields
Probability, Differential Geometry
pdf ↗ page arXiv:2603.26936 ↗

In simulation-based engineering, design choices are often obtained following the optimization of complex blackbox models. These models frequently involve mixed-variable domains with quantitative and categorical variables. Unlike quantitative variables, categorical variables lack an inherent structure, which makes them difficult to handle, especially in the presence of constraints. This work proposes a systematic approach to structure and model categorical variables in constrained mixed-variable blackbox optimization. Surrogate models of the objective and constraint functions are used to induce problem-specific categorical pseudo-distances. From these pseudo-distances, surrogate-based neighborhoods are constructed using notions of dominance from bi-objective optimization, jointly accounting for information from both the objective and the constraint functions. This study addresses the lack of automatic and constraint-aware categorical neighborhood construction in mixed-variable blackbox optimization. As a proof of concept, these neighborhoods are employed within CatMADS, an extension of the MADS algorithm for categorical variables. The surrogate models are Gaussian processes, and the resulting method is called CatMADS-GP. The method is benchmarked on the Cat-Suite collection of 60 mixed-variable optimization problems and compared with two external mixed-variable solvers. Data profiles indicate that CatMADS-GP achieves the best performance on this collection of problems.

comments
24 pages (without the references), 10 figures, and code available at https://test.pypi.org/project/NomadBBO/
fields
Optimization and Control
pdf ↗ page arXiv:2603.27839 ↗

This paper provides a rigorous mathematical analysis of the global regularity problem for the 3D incompressible Navier-Stokes (NS) equations, specifically addressing the conditions under which smooth initial data may lead to a loss of regularity. By departing from traditional phenomenological turbulence models and focusing strictly on the mechanical energy transport equation, we derive a fundamental critical condition, $\boldsymbol{u}\cdot\nabla E = 0,$ where $E = \frac12|\boldsymbol{u}|^2 + p$ is the specific mechanical energy, which characterizes the transition from laminar to turbulent flow.

fields
Analysis of PDEs
pdf ↗ page arXiv:2603.28308 ↗

Solving optimal control problems for high-dimensional partial differential equations (PDEs) is computationally expensive. As a workaround, reduced-order models (ROMs) are often employed, which replace the full PDE system and alleviate the computational burden while solving optimal control problems. However, when the underlying PDE exhibits transport-dominated behavior, standard reduced-order modeling techniques like proper orthogonal decomposition (POD) that rely on linear approximation spaces may require a large number of modes due to the slowly decaying Kolmogorov $n$-width. To overcome this challenge, we focus on the use of transformed POD as a reduced-order model, which is particularly effective in capturing low-dimensional representations of high-fidelity transport-dominated phenomena. In this work, a reduced-order model is constructed first, followed by the optimization of the reduced system. For linear systems generated by strongly continuous groups, we prove existence and uniqueness of solutions for the ROM under an explicit smallness condition on the control, as well as the existence of an optimal control for sufficiently large regularization. The numerical experiments concern the 1D linear advection equation with a subset of the general transformation groups called the shift transformations. Additionally, we compare the computational performance of the shifted POD (sPOD) method against the standard POD.

fields
Optimization and Control
pdf ↗ page arXiv:2603.28442 ↗

Extracting approximate eigenpairs from a prescribed subspace is of fundamental importance in eigenvalue computation. Although the standard Rayleigh–Ritz procedure is widely used for this purpose, it may suffer from deteriorated convergence of Ritz values and may even fail to produce convergent Ritz vectors, unless the compressed eigenvalue problem is assumed to be well-conditioned. In this paper, we address the eigenpair extraction problem by introducing a randomized Rayleigh–Ritz procedure. Our analysis shows that, for a simple eigenpair, the eigenvalue and eigenvector condition numbers of the randomly compressed generalized eigenvalue problem are, with high probability, comparable to those of the original problem, which yields a reliable approximate eigenpair from the extraction. The result also extends naturally to nonlinear eigenvalue problems.

comments
Fix some mistakes
fields
Numerical Analysis
pdf ↗ page arXiv:2604.01037 ↗

Let $Ω$ be a Riemannian manifold with boundary. The time-optimal version of the BC-method determines the parameters in the $T$-neigh\-bor\-hood $Ω^T$ of $\partialΩ$ from the boundary observations (response operator) $R^{2T}$ on the time segment $[0,2T]$. It visualizes the invisible waves supported in $Ω^T$, by reconstructing the operator $W^T$ that creates these waves. The visualization is based on the triangular factorization of the operator $C^T:=W^{T\,*}W^T$ in the form $C^T:=F^{T\,*}F^T$ with a factor $F^T=U^{T}W^T$, where $U^T$ is a unitary operator. The factorization $C^T\mapsto F^T$ has certain continuity properties, due to which the time-optimal reconstruction $R^{2T}\mapsto C^T\mapsto F^T\mapsto W^T$ turns out to be continuous (stable) in the sense of relevant operator topologies (convergences). As an example, determination of the potential $q$ in the wave equation $u_{tt}-Δu+qu=0$ from $R^{2T}$ is considered. We show that $R^{2T}_j\to R^{2T}$ implies $q_j\to q$ in $H^{-2}(Ω^T)$. However, the question of quantitative estimates of stability (the rate of convergence) remains open.

comments
There is a rough mistake in sec. 3.2: not the uniform but only weak convergence of the potentials in $H^{-2}(Ω)$ is proved. A corrected and extended version of the paper is planned for submitting to arXiv
fields
Mathematical Physics
pdf ↗ page arXiv:2604.02957 ↗

We develop a mechanistic dynamical-systems formulation of best response in finite-action games with relational structure on the action set. The proposed neuromorphic decision dynamics realize best response as the stable outcome of an internal state-space process, rather than as an externally imposed choice rule. This provides a deterministic account of commitment formation, symmetry resolution through basins of attraction, and hysteresis and decision persistence under perturbations. For action spaces with circulant coupling, we prove using Lyapunov-Schmidt reduction that the action-coupling operator determines which components of evidence govern decision formation. We further show that the dynamics implicitly compute a geometry-aware utility, converge exponentially to the corresponding best response, and switch only when evidence is sufficiently strong. In contrast, supplying the same geometry-aware utility directly to logit dynamics does not recover these properties, showing that relational structure must be embedded in the decision mechanism itself. We illustrate the framework in a repeated coverage game, prove that the induced game is an exact potential game, and show that its Nash equilibria are reached by the neuromorphic decision dynamics.

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

Bayesian neural networks (BNNs) offer a natural probabilistic formulation for inference in deep learning models. Despite their popularity, their optimality has received limited attention through the lens of statistical decision theory. In this paper, we study decision rules induced by deep, fully connected feedforward ReLU BNNs in the normal location model under quadratic loss. We show that, for fixed prior scales, the induced Bayes decision rule is not minimax. We then propose a hyperprior on the effective output variance of the BNN prior that yields a superharmonic square-root marginal density, establishing that the resulting decision rule is simultaneously admissible and minimax. We further extend these results from the quadratic loss setting to the predictive density estimation problem with Kullback–Leibler loss. Finally, we validate our theoretical findings numerically through simulation.

comments
100 pages and 6 figures
fields
Statistics Theory
pdf ↗ page arXiv:2604.04673 ↗

Continuous-time stochastic control with time-inhomogeneous jump-diffusion dynamics is central in finance and economics, but computing optimal policies is difficult under explicit time dependence, discontinuous shocks, and high dimensionality. We propose an actor-critic framework that serves as a mesh-free solver for entropy-regularized control problems and stochastic games with jumps. The approach is built on a time-inhomogeneous little q-function and an appropriate occupation measure, yielding a policy-gradient representation that accommodates time-dependent drift, volatility, and jump terms. To represent expressive stochastic policies in continuous-action spaces, we parameterize the actor using conditional normalizing flows, enabling flexible non-Gaussian policies while retaining exact likelihood evaluation for entropy regularization and policy optimization. We validate the method on time-inhomogeneous linear-quadratic control, Merton portfolio optimization, and a multi-agent portfolio game, using explicit solutions or high-accuracy benchmarks. Numerical results demonstrate stable learning under jump discontinuities, accurate approximation of optimal stochastic policies, and favorable scaling with respect to dimension and number of agents.

comments
31 pages, 8 figures, 4 tables
fields
Optimization and Control
pdf ↗ page arXiv:2604.05398 ↗

In this paper, we introduce a CBO method that incorporates jumps driven by an $α$-stable stochastic process within a kinetic framework. This approach naturally induces nonlocal stochastic effects, enhancing the exploration capabilities of the method. We formulate the dynamics at the particle level, providing a detailed description of the associated stochastic system and its asymptotic behavior. In particular, by means of a Fourier-based representation, we derive the corresponding fractional Fokker-Planck equation, which captures the nonlocal diffusion mechanisms generated by $α$-stable processes. As a central result, we establish a rigorous convergence analysis for the proposed method. Finally, we assess its performance through a series of numerical experiments, highlighting the effectiveness of $α$-stable jump dynamics and their advantages over standard diffusion based strategies, especially in complex optimization landscapes.

fields
Optimization and Control
pdf ↗ page arXiv:2604.05626 ↗

This paper develops an intrinsic framework for local solutions to time-varying linear systems with real meromorphic coefficients. Local solutions on compact intervals naturally form a sheaf of vector spaces. We introduce regularity triples to distinguish regularity across singularities, one-sided regularity at singularities, and regularity away from singularities. The local formulation isolates a continuation property implicit in established global frameworks and yields a simple definition of behavioural controllability. We establish an algebraically verifiable sufficient condition for continuation, prove its necessity for controllability, and derive an algebraic characterization of controllability based on the Teichmüller-Nakayama form, recovering and slightly generalizing established results.

comments
28 pages, 1 figure; substantially revised exposition and updated references
journal
Journal of Differential Equations 487 (2027), 114777
fields
Dynamical Systems
pdf ↗ page arXiv:2604.07043 ↗

Polynomial threshold functions (PTFs) are an important low-complexity class of Boolean functions, with strong connections to learning theory and approximation theory. Recent work on learning and testing PTFs has exploited structural and isoperimetric properties of the class, especially bounds on average sensitivity, one of the central themes in the study of PTFs since the Gotsman–Linial conjecture recently solved by OpenAI, \cite{GLsol}. In this work we study PTFs through the lens of the Boolean surface area (or Talagrand boundary) \[ \mathbf{BSA}[f]=\mathbb{E}|\nabla f|=\mathbb{E}\sqrt{s_{f}(x)}, \] a natural measure of vertex-boundary complexity on the discrete cube. Our main result is that every degree-$d$ PTF has polylogarithmic Boolean surface area: \[ \mathbf{BSA}[f]\le C_d(\log(en))^{C_d}. \] The proof is based on the PTF Restriction Lemma of Kabanets, Kane, and Lu \cite{KKL2017} and proceeds through a tail bound for the pointwise sensitivity. In particular, it controls all subcritical fractional moments of the sensitivity. We also record a random block partition principle for Boolean surface area and an alternative recursive argument following Kane's work \cite{DK} on average sensitivity, which independently yields the second bound \[ \mathbf{BSA}[f]\le \exp(C(d)\sqrt{\log n}). \] This bound was obtained in \cite{FSVZ} without clarifying the magnitude of $C(d)$, which we do below. For lower moments $\bE |\nabla f|^η \le C(d, η)$ there is no dependence on $n$ for $0<η<1$.

comments
25 pages, 1 figure
fields
Analysis of PDEs, Classical Analysis and ODEs, Probability
pdf ↗ page arXiv:2604.08095 ↗

This paper constructs a rigorous mathematical framework for investigating laminar-turbulent transition induced by weak singularities of incompressible Navier-Stokes (NS) equations. By integrating the energy identity of Leray weak solutions with the singularity criterion $\left\lVert \boldsymbol{u} \right\rVert_{H_0^1(Ω)}\to0$, a closed analytical form of the laminar-turbulent transition characteristic time is derived. The theoretical scaling $t_{\text{trans}}\simν/U^2$ (equivalent to $t_{\text{trans}}\sim t_c/\text{Re}$) is verified to be consistent with classical experimental observations in shear flows. This work reveals that laminar-turbulent transition is dominated by the local regularity collapse of Leray weak solutions rather than global viscous diffusion, and provides a novel theoretical interpretation for the onset of turbulence from the perspective of NS equation weak singularities.

fields
Analysis of PDEs
pdf ↗ page arXiv:2604.09640 ↗

Lopez-Abad extended the Bourgain-Pisier construction to Banach spaces of arbitrary density: every Banach space $X$ embeds isometrically into an $\mathcal{L}_\infty$-space $Y$ such that $Y/X$ has the Radon-Nikodym and Schur properties. We study $c_0$ quotients of these spaces. For every $X$ of uncountable density $κ$, we describe a realization of the construction that admits an explicit surjection $T: Y \to c_0$, given by coordinate functionals built along the construction, whose kernel is an $\mathcal{L}_\infty$-space of density $κ$. We also note that an $\mathcal{L}_\infty$-space with a non-Grothendieck quotient has a $c_0$ quotient, and that every Lopez-Abad space has an $\ell_2$ quotient; all of them have $c_0$ quotients if no infinite-dimensional Banach space is both Schur and Grothendieck, a question we leave open. In an appendix we characterize when the kernel of a quotient map from an $\mathcal{L}_\infty$-space onto $c_0$ is an $\mathcal{L}_\infty$-space, give a quotient map from $C[0,1]$ onto $c_0$ whose kernel is not, and show that every non-Grothendieck $\mathcal{L}_\infty$-space admits one whose kernel is. This version corrects errors in version 1.

comments
21 pages, no figures
fields
Functional Analysis
pdf ↗ page arXiv:2604.11832 ↗

Stanley polyominoes are a subclass of parallelogram polyominoes in which each row begins strictly to the right of the beginning of the previous row and ends strictly to the right of the end of the previous row. In this paper, we derive generating functions for Stanley polyominoes with respect to the numbers of columns and rows, area, semiperimeter, and numbers of interior points and edges. We also establish combinatorial connections through bijections with other combinatorial structures such as Dyck paths, skew Ferrers diagrams, and peakless Motzkin paths. As a byproduct, we answer the open question of finding a bijection between parallelogram polyominoes of area $n$ with $k$ columns and coin fountains with $n$ coins in the odd-numbered rows and $n-k$ coins in the even-numbered rows.

fields
Combinatorics
pdf ↗ page arXiv:2604.12392 ↗

We consider the well-studied setting of minimizing a convex Lipschitz function using either gradient descent (GD) or its stochastic variant (SGD), and examine the last iterate convergence. We prove that $Θ(\sqrt{\log(T)/T})$ is the optimal anytime rate attainable with a fixed stepsize schedule (that does not depend on the total number of steps $T$). The upper bound holds already for SGD, and improves on the $\log(T)/\sqrt{T}$ rate of Shamir and Zhang [2013], as well as the $\sqrt{\log(T)/T}$ rate of Zamani and Glineur [2023] which was proven only for deterministic GD. The matching lower bound holds already for GD, and confirms the conjecture of Jain et al. [2019], namely that the optimal $1/\sqrt{T}$ rate for the last iterate cannot be obtained without prior knowledge of $T$.

comments
Substantially improved version, with new and matching upper and lower bounds
fields
Optimization and Control
pdf ↗ page arXiv:2604.13870 ↗

This paper extends and analyzes the high-order kernel regularization framework of Beale & Tlupova (arXiv:2510.13639) to all four on-surface boundary integral operators of the Helmholtz Calderon calculus in three dimensions: the single-layer, double-layer, adjoint double-layer, and hypersingular operators. To the best of our knowledge, this work provides the first high-order kernel regularization of the hypersingular operator for both the Helmholtz and Laplace equations in three dimensions. The regularization replaces each singular kernel with a smooth modification constructed from error functions together with a polynomial correction whose coefficients are determined through moment conditions. Alongside the derivation of the regularizing functions, the paper provides a unified error analysis of the combined regularization and quadrature discretization procedure. By coupling the regularization parameter to the mesh size, the two error contributions can be balanced, leading to explicit overall convergence rates that depend jointly on the order of the regularization and the degree of exactness of the surface quadrature rule. A key practical feature of the method is its implementation simplicity. Once the regularizing functions are determined, the numerical task reduces entirely to the evaluation of smooth surface integrals using standard quadrature, without the need for element-local solves, singularity-specific precomputations, or specialized quadrature rules. Although the modified kernel is generally incompatible with kernel-specific fast methods, this limitation is addressed through H-matrix acceleration, applicable in a black-box manner. Numerical examples -- including verification of the predicted convergence rates and solution of sound-soft and sound-hard scattering problems by smooth obstacles -- demonstrate the accuracy and practicality of the proposed methodology.

fields
Numerical Analysis
pdf ↗ page arXiv:2604.14797 ↗

We establish existence and uniqueness results for asymptotically locally Euclidean (ALE) and asymptotically locally flat (ALF) gravitational instantons. In particular, we prove the existence of a unique, Ricci-flat, toric ALE and ALF gravitational instanton, for every admissible rod structure, that is smooth up to possible conical singularites. We also give an elementary proof that any toric ALE or ALF self-dual instanton is a multi-Eguchi-Hanson or multi-Taub-NUT solution.

comments
21 pages. v2: minor edits, published version
fields
Differential Geometry, Mathematical Physics
pdf ↗ page arXiv:2604.15159 ↗

Establishing the fusion rules of anyonic quasiparticles in fractional quantum Hall fluids is essential for understanding their underlying topological order. Building on the conjecture that key topological properties are encoded in the ''DNA'' of candidate many-body wave functions - that is, the pattern of dominant orbital occupations restricted to a finite number of lowest Landau levels - we propose a combinatorial framework that derives these fusion rules directly from microscopic data. By extending Schrieffer's counting argument and introducing classes of topological excitations, our framework provides a unified route to the fusion rules for both Abelian and non-Abelian excitations. This approach elucidates the emergence of topological features from first principles in both fermionic and bosonic systems. In particular, we unveil the previously unknown fusion rules of the Hafnian fluid.

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

In modern large-scale networked systems, rapidly solving optimization problems while utilizing communication resources efficiently is critical for addressing complex tasks. However, distributed optimization over bandwidth-limited networks must cope with two obstacles: limited-bandwidth communication, and slow convergence when the objective is ill-conditioned. In this paper, we consider unconstrained distributed optimization over strongly connected directed networks, where nodes exchange quantized (i.e., compressed) messages. We propose QANM (Quantized Averaged Nesterov Momentum), an algorithm that combines Nesterov momentum with a finite-time quantized averaging protocol. At every iteration, QANM enables all nodes to reach exact agreement, without requiring doubly stochastic weight matrices or undirected communication. For strongly convex and smooth objectives, we show that the objective gap of QANM decays at the accelerated rate $1-κ^{-1/2}$ (where $κ$ is the condition number), up to a residual of order $Δ^2$ determined by the quantization level $Δ$. This improves the condition-number dependence of the transient iteration complexity from $κ$ to $\sqrtκ$ compared with gradient descent that utilizes the same quantized averaging mechanism. Finally, we evaluate QANM on a distributed sensor fusion problem, showing that our algorithm exhibits the fastest initial error reduction compared with other methods from current literature.

fields
Optimization and Control
pdf ↗ page arXiv:2604.16906 ↗

The goal of our work is to construct a class of morphisms between two canonical line bundles on integral models of PEL Shimura varieties via Kodaira–Spencer maps, and explicitly compute such morphisms and their effects on the canonical metrics of line bundles. This result provides a concrete method for comparing two canonical line bundles and the corresponding arithmetic intersection numbers. In particular, it allows us to give an explicit relationship between the height functions defined by these two line bundles.

comments
43 pages
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2604.17792 ↗

We study the three classical integrable generalized cubic Hénon–Heiles systems -- Kaup–Kupershmidt, KdV$_5$, and Sawada–Kotera -- from the viewpoint of bi-Hamiltonian geometry and separation of variables. On the standard symplectic manifold $T^*\mathbb R^2$, we construct compatible Poisson deformations $P_1=L_XP_0$, compute the associated recursion operators $N=P_1P_0^{-1}$, and analyze the action of $N^*$ on the codistribution generated by the first integrals. This yields the corresponding control matrices, whose eigenvalues provide the separating coordinates. For the generalized Kaup–Kupershmidt case we carry out the construction explicitly: we determine a deformation vector field, the compatible Poisson tensor, the torsionless recursion operator, the control matrix, the separating coordinates, and, crucially, the conjugate momenta. We then derive the separated relations and write the Hamilton equations in canonical separated variables, thus decomposing the original Hamiltonian system into two separated subsystems. To the best of our knowledge, this explicit derivation of the separating variables and, in particular, of the conjugate momenta for the generalized Kaup–Kupershmidt system is new. For the KdV$_5$ and Sawada–Kotera cases we show how the same bi-Hamiltonian scheme applies, emphasizing both the common geometric mechanism and the features peculiar to each system. In this way, the three generalized cubic Hénon–Heiles systems are treated within a unified framework based on compatible Poisson structures, recursion operators, control matrices, and Darboux–Nijenhuis coordinates.

comments
30 pages. No figures
fields
Dynamical Systems
pdf ↗ page arXiv:2604.19188 ↗

Let $q$ be an odd prime power and write \[ θ_q := \frac{φ(q-1)}{q-1}. \] If $θ_q < \tfrac{1}{3}$, or if $θ_q = \tfrac{1}{3}$ and $q \notin \{7,13,19,25,37\}$, then the finite field $\F$ contains a pair of consecutive elements that are both non-square and non-primitive. This extends a result of Jarso and Trudgian for prime fields $\Fp$, where the same conclusion was obtained under the stronger condition $θ_p \le \tfrac{1}{4}$. More generally, let $\ell$ be the least odd prime divisor of $q-1$. If $θ_q \le \tfrac{1}{3}$, then $\F$ contains a pair of consecutive elements that are non-squares and $\ell$th powers, with the sole exceptions $q \in \{7,13,19,25,37,43\}$.

comments
13 pages
fields
Number Theory
pdf ↗ page arXiv:2604.21429 ↗

This paper studies the hierarchical joint source-channel coding with information leakage constraint in the first-phase reconstruction and distortion constraints. The receiver's access to the data varies and is evaluated by the quality of the side information. Due to the consideration of channel capacity limitation or the efficiency of the system performance, the encoder may send some additional information in Phase 1 that can only be decoded in Phase 2 with higher-quality side information. While this can optimize the overall performance, the additional information causes excessive information leakage. We provide general inner and outer bounds for the conditions such that a given distortion-leakage pair $(D_1,D_2,L)$ is achievable, together with a capacity-achieving condition.

comments
gap in proof of bounding the information leakage
fields
Information Theory
pdf ↗ page arXiv:2604.21673 ↗

Experimental designs that are minimax in the presence of model misspecifications have been constructed so as to minimize the maximum, over classes of alternate response models, of the integrated mean squared error of the predicted values. The theory to date has focussed almost exclusively on Least Squares estimates. Here we extend this theory to designs tailored for M-estimation of parameters, thus obtaining additional robustness against outlying, or otherwise erroneous, responses. We show that, subject to a minor change in a tuning constant, designs optimal for Least Squares remain so asymptotically for M-estimation, under squared error loss. We argue that even this minor change should be ignored, and the tuning constant chosen in an ad hoc but sensible manner that does not depend on which M-estimate is being employed. A rather surprising additional result is that our designs and estimates, derived under an assumption of i.i.d. errors, are also robust, in a minimax sense, against broad classes of correlation structures. We also investigate designs under a more robust loss function, less influenced by outlying responses than squared error.

fields
Statistics Theory
pdf ↗ page arXiv:2604.21998 ↗

The control of complex dynamical systems remains a fundamental challenge in science and engineering, where strong nonlinearities, the presence of noise, and computational constraints often pose significant obstacles in traditional control approaches. Recent advances in data-driven methods, particularly system identification techniques, have shown a powerful alternative by providing fast, parsimonious, interpretable models that are well-suited for model predictive control (MPC). Building on these developments, the present article embeds WSINDy with actuation inputs (WSINDYc) within a MPC framework. Compared to benchmark data-driven methods, WSINDYc enables a more robust identification of the governing dynamics, particularly in the presence of high noise levels, resulting in more accurate and efficient control. The capabilities of the proposed WSINDY-MPC framework are demonstrated on a range of problems, including a tokamak plasma boundary model that includes main ion gas puff actuation, drone tracking and collision avoidance, the chaotic Lorenz system, and a simplified flight control model for an F-8 aircraft. The proposed framework achieves superior performance in the presence of noise, enabling longer prediction horizons, lower trajectory tracking error, and a more reliable obstacle clearance, while simultaneously achieving lower MPC cost values compared to the baseline methods.

comments
Revised version with updated text, figures, and references
journal
Proc. R. Soc. A 482 (2346), 20260413 (2026)
fields
Dynamical Systems, Optimization and Control
pdf ↗ page arXiv:2604.23269 ↗

This paper presents a brief overview of ravine functions using the example of the Minkowski-Cohn moduli surface from the point of view of optimization on it. Elements of representation and solution of the minimization problem at a point are presented.

comments
11 pages, Subsection 2.1.1 extended
fields
Number Theory
pdf ↗ page arXiv:2604.23871 ↗

In this paper, we establish upper and lower bounds on the convergence rate of empirical measures of point processes under the Wasserstein distance. To this end, we first introduce a new metric on the space of finite counting measures. Unlike many existing metrics in the literature, our proposed metric incorporates the spatial locations of unmatched points. Drawing on both this new metric and existing metrics from the literature, we identify a set of common structural properties and develop a general framework for Wasserstein distances between point-process distributions based on metrics satisfying these properties. We then use this framework to investigate the convergence rates of empirical measures, providing quantitative guarantees for approximating the distribution of the underlying point process, and further establish corresponding concentration inequalities. These theoretical results may provide ingredients for constructing oracle goodness-of-fit tests for a specified point-process distribution. We also apply our theory to the approximation of Campbell measures and discuss how the resulting bounds can help assess Wasserstein-based learning of generative point-process models.

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

In this article, we study the bilaterally almost uniform (b.a.u.) convergence of weighted averages of a positive Dunford-Schwartz operator $T$ acting on the noncommutative $L_p$-spaces $L_p(\mathcal{M},τ)$ associated to a semifinite von Neumann algebra $(\mathcal{M},τ)$ for every $1\leq p<\infty$ for a variety of sequences which includes those generated by bounded i.i.d. sequences, the Möbius function, the Liouville function, and totally balanced automatic sequences. If $1<p<\infty$, then sequences generated by i.i.d. sequences with finite $q$-th moment for $q=\frac{p}{p-1}$ being the Hölder conjugate of $p$ are also shown to generate good weights for $L_p(\mathcal{M},τ)$. We also study similar problems for $T$-admissible processes on a semifinite von Neumann algebra, showing that if a Wiener-Wintner type ergodic theorem holds for a class $\mathcal{W}\subset W_q$ of weights, then it also holds for strongly $p$-bounded $T$-admissible processes assuming that the duality $\frac{1}{p}+\frac{1}{q}=1$ holds and that $T$ is a normal $τ$-preserving $*$-automorphism. A version of this result for arbitrary positive Dunford-Schwartz operators is also considered.

comments
30 pages. v3: Minor stylistic changes and rephrasings. Added Theorem 3.4 to emphasize a few applications of the main method already mentioned earlier in the article
fields
Operator Algebras, Dynamical Systems
pdf ↗ page arXiv:2604.26224 ↗

Optimization of quadratic functions and their quotients is relevant in subspace and iterative optimization methods. In this paper, we consider the matrix-free computation of the generalized operator norm and the maximization of a generalized Rayleigh quotient when only forward evaluations of two linear operators $A$ and $B$ are available. The proposed method samples search directions uniformly from the full unit sphere, thereby avoiding tangent-space sampling and explicit access to the metric matrix $B^{\mathrm T}B$. The exact line search along each sampled direction reduces to a $2\times2$ generalized eigenvalue problem on specific Gram matrices. In the generic case its maximizing step has a closed form. We prove that the objective values converge almost surely to the largest generalized eigenvalue and that the distance of the iterates to the leading generalized eigenspace converges to zero. We also relate full-sphere moment estimators to the Riemannian gradient and Hessian. The numerical experiments on synthetic Gaußian operators illustrate the behavior of the methods, and further studies of the proposed algorithms indicate favorable empirical convergence and weak dependence on the tested problem dimensions.

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

We develop a Wilsonian description of perturbative D-terms in 4d $\mathcal N=1$ gauge theories on $\mathbb R^3\times S^1$ with chiral Kaluza–Klein spectra. A closed-form, one-loop-exact coefficient of the auxiliary D fields, including 4d Fayet–Iliopoulos parameters and globally valid throughout the holonomy space, determines the leading holonomy potential away from massless thresholds. We establish uniform weak-coupling control there and match across thresholds by retaining the light fields. Gauge-anomaly cancellation renders the Coulomb-slice vacuum equations affine within each chamber bounded by the thresholds, enabling exact linear analysis of their zero sets and numerical reconstruction through DBSCAN clustering of approximate zeros, LPCA denoising, and RANSAC hyperplane detection. Complementing the rank-one applications of the accompanying Letter, we study flavor-twist dependence in the $\mathrm{SU}(2)$ $\mathcal N=4$ theory, and illustrate the numerical reconstruction in higher-rank R-twisted Argyres–Douglas reductions of interest in the SCFT/VOA correspondence. We also relate the same D-term data to leading stationary-phase equations of supersymmetric partition functions and a decompactification limit of the torus twisted superpotential.

comments
v2: the abelian example moved to the companion letter, criteria for perturbative control strengthened, A1A4 and A1A7 examples added including strong-coupling IR data for completeness in the A1A4 case
fields
Mathematical Physics
pdf ↗ page arXiv:2604.27066 ↗

In this paper, we study the geometry of bounded domains with piecewise smooth boundary. Specifically, we obtain the relationship between the squeezing function corresponding to polydisk and Levi flatness on bounded convex domains. As an application, we prove that a two-dimensional bounded generic convex domain with piecewise $C^2$-smooth boundary that is not smooth and admits a finite volume quotient is biholomorphic to bidisk. Moreover, we show that any Teichmüller space $\mathcal{T}_g$ with $g\geq2$ cannot be biholomorphic to a bounded domain with piecewise $C^2$-smooth boundary.

fields
Complex Variables
pdf ↗ page arXiv:2604.27337 ↗

Discrete entropy estimation is a classic information theory problem, wherein the average information content of a discrete random variable is estimated from samples alone. Naive approaches, such as the plugin method, fail to account for the probability mass associated with members of the random variable's support that are unobserved in a given sample, known as the "missing mass." The resulting systemic underestimation is particularly problematic when data is time-consuming or costly to gather. We propose SENECA, an entropy estimation scheme based on a novel "self-consistent" missing mass calculation. Extensive numerical experiments indicate that our approach outperforms many state-of-the-art alternatives overall in the small-sample setting. We then apply SENECA to two practical use cases, namely biodiversity estimation and the detection of incorrect large language model responses, where our method is competitive with domain-specific approaches. Our work advances SENECA as an effective drop-in replacement for small-sample entropy estimation, with broad utility across several domains.

fields
Information Theory
pdf ↗ page arXiv:2605.00668 ↗

We establish the existence of a time-periodic carrying simplex for competitive systems of Kolmogorov-type ordinary differential equations of the form $\dot{x}_i = x_i g_i(t,x)$, $i=1,\dots,d$, on $\mathbb{R}^d_+$, where the vector field $g$ is $T$-periodic in time and satisfies only Carathéodory conditions rather than the classical $C^1$ regularity assumed in earlier work. We show that the time-$T$ Poincaré map $P$ generated by the flow is retrotone, and apply recent results on the carrying simplex for retrotone maps to obtain for $P$ a carrying simplex $Σ$ that is an unordered, Lipschitz, invariant manifold homeomorphic to the standard probability simplex, and that attracts all nonzero trajectories of the discrete dynamical system generated by $P$. We then extend this construction to the full nonautonomous flow by introducing an auxiliary autonomous system on the extended phase space $\mathcal{T} \times \mathbb{R}^d_+$, where $\mathcal{T}$ is the circle of length $T$, generated via a skew-product formulation. In the context of this extended phase space we then construct a compact global attractor and identify, as its relative boundary, a time-periodic family of carrying simplices $\{Σ_s\}_{s \in \mathcal{T}}$ that depend continuously on the phase $s$, each homeomorphic to the standard simplex and each attracting, uniformly in $s$, all nonzero orbits of the corresponding time-shifted flow. These results provide a rigorous foundation for the qualitative analysis of seasonally forced competitive population models in which growth rates need only be measurable and locally Lipschitz in time, broadening the applicability of carrying simplex theory to more realistic ecological settings.

comments
40 pages
journal
Journal of Dynamics and Differential Equations, 2026
fields
Dynamical Systems, Classical Analysis and ODEs
pdf ↗ page arXiv:2605.01287 ↗

In this paper, we propose a feedback-efficient hybrid precoding framework for wideband millimeter-wave (mmWave) multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems. To reduce the hardware cost of radio-frequency (RF) chains and the feedback burden associated with frequency-selective digital precoding, frequency-flat analog precoders and combiners are first constructed from the dominant angle-of-arrival (AoA) and angle-of-departure (AoD) directions associated with the strongest propagation paths. For digital precoding, a shared quantized codebook is designed using the Lloyd algorithm, and a binary-search-based hierarchical interpolation method is developed to identify codeword switching locations between adjacent pilot subcarriers. By avoiding exhaustive codeword comparisons over all intermediate subcarriers, the proposed method reduces online search complexity and enables compact digital-precoder feedback. For the considered system configuration, the proposed method achieves a worst-case feedback reduction of approximately 98.34% relative to full-grid per-subcarrier feedback. Simulation results further demonstrate competitive spectral efficiency and bit error rate (BER) performance, low computational cost, and robustness under imperfect effective channel state information (CSI).

comments
6 pages, 4 figures, 1 table. Accepted for presentation at the 2026 IEEE GLOBECOM Workshops
fields
Information Theory
pdf ↗ page arXiv:2605.02418 ↗

We introduce a unified theoretical framework for the rigorous analysis and systematic construction of deep neural networks (DNNs). This framework addresses a gap in existing theory by explicitly modeling the structure of tensor operations -- lower level information that is often abstracted. Our framework enables two novel objectives: (1) analysis of the evolution of architectural complexity over deep learning history, and (2) automatic construction of novel architectures based on new types of tensor operations. Our study of DNNs introduced over the past 40 years reveals a connection between groundbreaking architectures and increases in different types of architectural complexity. Moreover, we identify several large classes of higher complexity architectures that have not yet been explored. We then collect a dataset of 3,000+ higher complexity architectures, which we publicly release at: https://github.com/combinatoriallabs/ArchitecturalComplexity.

comments
69 pages, 54 figures, 11 tables
fields
Combinatorics
pdf ↗ page arXiv:2605.04325 ↗

Let $n\geq2$, and let $f:[0,+\infty)\to\mathbb{R}$ be a smooth function satisfying $f''\geq0$ and $0<m\leq f'\leq M$ for some constants $m$ and $M$. We prove that $\mathbb{R}^{n+1}$, endowed with the conformal metric \begin{equation*} ds^2=e^{-\frac{f(|x|^2)}{2n}}\sum_{i=1}^{n+1}dx_i^2, \end{equation*} admits a compact, embedded, rotationally symmetric minimal hypersurface diffeomorphic to $S^1\times S^{n-1}$. This extends Angenent's existence theorem for self-shrinking tori, which is recovered when $f(s)=s$.

comments
14 pages
fields
Differential Geometry
pdf ↗ page arXiv:2605.05022 ↗

In this work we consider the well posed version of the Kaup-Broer-Kuperschmidt system in two dimensions. We numerically construct soliton type solutions and show that they are unstable both against dispersion and singularity formation. Further, we study line solitons and their stability, as well as generally localised initial data. In either case we fail to find stable structures.

comments
More simulations added
fields
Analysis of PDEs, Numerical Analysis
pdf ↗ page arXiv:2605.05183 ↗

Product reviews significantly influence purchasing decisions on e-commerce platforms. However, the sheer volume of reviews can overwhelm users, obscuring information most relevant to their individual needs. Existing e-commerce summarization systems typically produce generic, static summaries that fail to account for the fact that (i) different users prioritize different product characteristics, and (ii) these preferences may evolve with interactions. To address these challenges, we propose an online learning framework that generates personalized summaries for each user by representing user interests in a latent aspect space and selecting preference-aligned review evidence. Our system then iteratively refines its understanding of user preferences by incorporating feedback on the generated summaries directly over time. We evaluate our framework on Amazon Reviews'23 using controlled feedback simulations and robustness checks with held-out-history, independent-embedding, and external LLM-based evaluators. These experiments show improvements in preference-aligned evidence selection under the evaluated feedback settings. A separate human-based study finds that scenario-conditioned summaries are preferred over generic (uniformly-aggregated) alternatives in 69.9% of paired comparisons.

fields
Optimization and Control
pdf ↗ page arXiv:2605.05911 ↗

Support vector machines (SVMs) are widely used for binary classification. However, irrelevant or redundant features can degrade classification accuracy and model interpretability, making feature selection important for SVMs. Most SVM feature selection methods rely on sequential search or regularization and do not directly identify the best feature subset. Mixed-integer optimization (MIO) is a direct approach to best subset selection. Cross-validation (CV) is broadly applicable to feature selection because it evaluates predictive performance on validation data without model assumptions. Although Purcaru et al. (2026) proposed an MIO formulation for CV-based linear-SVM feature selection (SVM-CV), this method suffers from high computational cost. We develop computationally efficient CV-based MIO formulations for feature selection in linear SVM classification by using least squares support vector machines (LS-SVMs). We formulate the problem as a bilevel MIO problem, where the lower-level problem trains LS-SVM classifiers and the upper-level problem selects features based on validation sets. We then reformulate it as a single-level MIO problem by exploiting the optimality conditions of LS-SVM. We propose two formulations: a hinge-loss-based validation model and a least-squares-based validation model. We compare our methods with SVM-CV and other SVM-based and logistic-regression-based methods through simulation experiments on synthetic data. The hinge-loss-based validation model attained high feature selection accuracy under the high-noise and moderate-noise conditions, particularly with more candidate features, and the least-squares-based validation model performed well in feature selection under the low-noise condition at the lower correlation level. Furthermore, our two models achieved substantially faster computation than the existing SVM-CV model.

comments
25 pages, 5 figures, 1 table
fields
Optimization and Control
pdf ↗ page arXiv:2605.07089 ↗

A Tatra association scheme is an association scheme arising from a symmetric bilinear form defined on the equivalence classes of nonzero $2$-dimensional vectors modulo some subgroup of the multiplicative group of a finite field. In the present paper, we prove that every such association scheme is $4$-separable, i.e., it is determined up to isomorphism by the tensor of its $4$-dimensional intersection numbers.

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

Dense low-Earth-orbit (LEO) networks increasingly reuse spectrum across moving satellites and overlapping beams, making a spatial radio map essential for interference diagnosis and coordination. Constructing such a map from sparse ground power measurements is difficult because the active satellite subset and its cardinality are unknown, candidate footprints can be highly coherent, and beam pointing, width, effective power, Doppler, and background must be inferred jointly. Known ephemerides do more than enumerate visible candidates. Propagated positions determine candidate-specific ranges, viewing geometry, and spatial footprints, while radial velocities induce distinct time-frequency signatures. Their joint spatial–Doppler structure rejects candidates whose geometry or time–frequency signature conflicts with the observations before continuous beam inference. SateBeam therefore screens all candidates through Doppler-resolved nonnegative fitting. GPU-accelerated grid correlations initialize continuous off-grid refinement; a Gamma-likelihood Bayesian information criterion (BIC) selects model cardinality, and backward deletion and exchange repair greedy support errors. Across paired real-ephemeris scenarios, SateBeam recovers the exact support in every case and reduces independent-query RMSE from $0.655$ to $0.050$ dB relative to orthogonal matching pursuit, with consistent advantages under model mismatch and larger candidate sets. The code is available at https://github.com/UNIC-Lab/SateBeam.

fields
Information Theory
pdf ↗ page arXiv:2605.07763 ↗

We formulate flow matching on probability measures over probability measures. Directly from the Wasserstein-on-Wasserstein (WoW) continuity equation, we show that admissible nested outer and inner couplings induce a valid metameasure flow and non-local velocity field. Validity requires neither optimal plans nor a smooth manifold. Practically, this opens up the design space of multisample flow matching: exact Wasserstein plans are distinguished by energy and straightness, while sliced and lazy linear plans yield scalable alternatives. Point-cloud experiments, including controlled Bures-Wasserstein and Euclidean minibatch baselines, demonstrate the resulting geometry-cost trade-off.

comments
Keywords: flow matching, Wasserstein over Wasserstein, hierarchical optimal transport, multisample flow matching, minibatch optimal transport, sliced Wasserstein, Bures-Wasserstein, point cloud generation, generative models for distributions, measure-valued data, Wasserstein gradient flow, rectified flow, straight flows
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2605.08424 ↗

Persistent homology tracks when topological features appear and disappear across filtered data and represents the lifetime of each feature by a persistence interval. In multiple instance learning, when the instances in a bag use filtrations over the same ordered parameter space, we can compare relationships between persistence intervals across instances. No existing method is designed to aggregate collections of persistence diagrams in multiple instance learning into a single persistence diagram of implications between intervals. We introduce higher-order persistence diagrams to represent relationships between persistence intervals and recursively construct each higher-order persistence interval from a pair of lower-order persistence intervals. We then aggregate these relationships across the persistence diagrams in a bag. Explicit construction of this aggregate is computationally expensive, so we introduce harmonic aggregation to compute coordinates of the aggregate from the lower-order persistence diagrams without explicitly constructing it. Computing a harmonic aggregation coordinate has lower asymptotic computational complexity than explicitly constructing the aggregate. We evaluate harmonic aggregation against persistence landscapes, persistence images, and PersLay on random network model and real-world graph-classification benchmarks, and find that harmonic aggregation has the highest accuracy on the random network model benchmark and on most real-world data benchmarks. Source code is available at https://github.com/cfanning8/higher-order-PDs.

comments
23 pages, 3 figures
fields
Algebraic Topology, Functional Analysis
pdf ↗ page arXiv:2605.09866 ↗

We propose a regularized proximal quasi-Newton method (RPQN) for minimizing the sum of a continuously differentiable, possibly nonconvex function and a proper, lower semicontinuous, prox-bounded, possibly nonconvex regularizer. The method uses adaptive quadratic regularization and limited-memory quasi-Newton models. We establish global convergence under weak assumptions, without requiring global Lipschitz continuity of the gradient, and prove convergence of the entire sequence, with rates, under the Kurdyka-Lojasiewicz property. To solve the proximal subproblems efficiently, we exploit compact limited-memory representations and derive a compact representation of the Kleinmichel rank-one update, which preserves positive definiteness under the same condition as BFGS. Numerical experiments on logistic and Student's regression demonstrate competitive performance and the effectiveness of the proposed approach.

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

Cortical neurons are complex, multi-timescale processors wired into recurrent circuits, shaped by long evolutionary pressure under stringent biological constraints. Mainstream machine learning, by contrast, predominantly builds models from extremely simple units, a default inherited from early neural-network theory. We treat this as a normative architectural question. How should one split a fixed parameter budget $P$ between the number of units $N$, per-unit effective complexity $k_e$, and per-unit connectivity $k_c$? What controls the optimal allocation? This calls for a model in which per-unit complexity can be tuned independently of width and connectivity. Accordingly, we introduce the ELM Network, whose recurrent layer is built from Expressive Leaky Memory (ELM) neurons, chosen to mirror functional components of cortical neurons. The architecture allows for individually adjusting $N$, $k_e$, and $k_c$ and trains stably across orders of magnitude in scale. We evaluate the model on two qualitatively different sequence benchmarks: the neuromorphic SHD-Adding task and Enwik8 character-level language modeling. Performance improves monotonically along each of the three axes individually. Under a fixed budget, a clear non-trivial optimum emerges in their tradeoff, and larger budgets favor both more numerous \emph{and} more complex neurons. A closed-form information-theoretic proxy captures these tradeoffs and attributes the diminishing returns at two ends to: per-neuron signal-to-noise saturation and across-neuron redundancy. A hyperparameter sweep spanning three orders of magnitude in trainable parameters traces a near-Pareto-frontier scaling law consistent with the proxy. This suggests that the simple-unit default in ML is not obviously optimal once this tradeoff surface is probed, and offers a normative lens on cortex's reliance on complex spatio-temporal integrators.

comments
33 pages, 28 figures, 3 tables, including derivations. Submitted for peer review
fields
Information Theory
pdf ↗ page arXiv:2605.12049 ↗

The unit Euclidean distance degree and the generic Euclidean distance degree are two well-studied invariants of projective varieties. These quantities measure the algebraic complexity of nearest-point problems on a variety, and in many examples arising in optimization, engineering, statistics, and data science, there is a significant gap between them. We refer to this difference as the defect of the Euclidean distance (ED) degree. In this paper, we provide a constructible enhancement and a topological formula for the defect of the ED degree of an arbitrary complex projective variety, extending our previous results from the smooth setting. Since the generic Euclidean distance degree is typically more tractable, our approach offers a new method for computing ED degrees in broad generality.

comments
Comments are very welcome
fields
Algebraic Geometry, Algebraic Topology
pdf ↗ page arXiv:2605.13726 ↗

To each face $\mathcal{F}$ of the coweight polytope $\mathcal{P}_μ$, we associate a subset $\text{Adm}(μ)_{\mathcal{F}}$ of the $μ$-admissible set $\text{Adm}(μ)$, which we refer to as a face of $\text{Adm}(μ)$. This gives rise to a face decomposition of $\text{Adm}(μ)$. As an application, we give a complete description of the fibers of the face map $|Δ|^f$ defined by Pappas-Rapoport and prove that the face map is surjective.

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

Fractional boundary value problems are often used to model complex systems and processes characterized by memory effects and anomalous diffusion. In this paper, we consider nonlinear fractional boundary value problems of arbitrary order α involving the Riesz-Caputo operator, which is particularly suited for modelling physical phenomena exhibiting symmetric diffusive effects. By reducing the problem to a dominant singular integral equation of Cauchy type and inverting it in closed form, we derive an integral representation of the solution, which we use to prove existence and uniqueness. The closed-form inversion also describes the typical behaviour of the solution near the endpoints of the interval and provides an exact singular solution, which we use as a test case. We then analyse a B-spline collocation method for the approximation of the solution, proving its convergence and illustrating it by numerical experiments.

fields
Numerical Analysis
pdf ↗ page arXiv:2605.16102 ↗

We study finite systems of vectors whose frame operator matrices are unitarily equivalent, via explicit and computationally efficient unitary transformations, to block-diagonal matrices. We call such systems block-equivalent. We show that a Gabor system $\mathcal{G}=\mathcal{G}(g,L\times K)\subset \mathbb C^N$ is block-equivalent when either the modulation set $L$ or the translation set $K$ is a subgroup of $\mathbb Z_N$. We also characterize situations in which the frame operator matrix becomes diagonal. Finally, we show that geometric conditions on subsets of $\mathbb Z_N$ force certain diagonals of the frame operator matrix of $\mathcal{G}$ to vanish, yielding additional sparsity and block structures.

fields
Functional Analysis
pdf ↗ page arXiv:2605.16139 ↗

Maz'ya and Shaposhnikova introduced a non-classical maximal operator $M^\diamond$ as the maximal convolution with the vector-valued signum kernel truncated to centered balls. We construct a translation-invariant Banach space of locally integrable functions on which $M^\diamond$ is bounded, but the sharp maximal operator $M^\sharp$ is not. This answers one of Maz'ya's questions from a collection of 75 open problems in analysis.

comments
v2: 14 pages, minor changes suggested by the referees
fields
Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2605.17663 ↗

This paper studies the continuous-time dynamics of primal-dual algorithms for linearly constrained convex optimization problems and provides a quantitative convergence analysis using the Lyapunov functions. With the growing prevalence of sparse and low-rank models, large-scale problems involving nonsmooth objective functions have become increasingly important. Our approach addresses nonsmooth and nonstrong convex objective functions, which is particularly effective in extending classical accelerated methods to broader large-scale optimization problems. Building upon the ordinary differential equation (ODE) approach inspired by the recent work on Nesterov's acceleration methods, we extend the analysis to an ODE associated with an optimization problem with linear equality constraints. Furthermore, to relax strong assumptions, we introduce two geometric conditions the Flatness condition and the Growth condition and derive explicit convergence rates depending on the local geometry and algorithmic parameter. When the objective function is convex and the Lagrangian satisfies the Flatness condition, an appropriate parameter choice yields a worst-case convergence rate of O(1/t^2). Furthermore, incorporating the Growth condition guarantees this worst-case rate of O(1/t^2) for any function satisfying these assumptions if and only if the parameter is chosen above a suitable threshold; under this condition, even faster convergence can be achieved. For the algorithmic construction, a numerical scheme is derived by discretizing the proposed ODE. We also investigate the influence of algorithm parameters and provide insights into their optimal selection. Finally, preliminary numerical experiments are provided to validate the consistency with the theoretical results.

fields
Optimization and Control
pdf ↗ page arXiv:2605.17819 ↗

In this article we study the principal block of the category of real Harish-Chandra modules for the group $\mathsf{SL}_2(\RR)$ and relate it to the category of finite dimensional modules over the so-called real Gelfand order. We describe several distinguished classes of the corresponding indecomposable representations.

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

We study local quasihelix and generalized quasihelix properties of several Gaussian Volterra processes with tempered, power-weighted, and logarithmic kernels, including tempered fractional Brownian motions and generalized fractional Brownian motion-type processes. These properties depend significantly on the values of the parameters involved, and we consider all possible cases in detail.

fields
Probability
pdf ↗ page arXiv:2605.20026 ↗

We introduce a random matrix framework for studying statistical-mechanical lattice systems through spectral observables. Equilibrium configurations sampled from a Boltzmann measure are mapped to matrix ensembles whose covariance structure is inherited from the spatial correlations of the underlying model. This construction maps real-space correlation functions to a momentum-space variance profile, providing a direct bridge between statistical-mechanical correlations and correlated random matrix ensembles. We derive this variance profile in finite-correlation-length and critical regimes, and compute spectral moments within a Wick-contraction expansion. A complementary self-consistent description of the bulk density is developed using the resolvent formalism. These analytical methods are benchmarked against Monte Carlo data for the two-dimensional Ising model and three-dimensional Edwards–Anderson spin glasses. In both cases, the spectra evolve from the semicircle law at high temperature to model-dependent critical forms reflecting the structure of correlations. The framework, therefore, provides a quantitative spectral route to probing collective behavior in ordered and disordered statistical systems, while also defining a class of physically motivated correlated random matrix ensembles.

comments
17 pages, 9 figures
journal
Phys. Rev. B 114, 204203 (2026)
fields
Mathematical Physics
pdf ↗ page arXiv:2605.21254 ↗

We have generalised the notion of categorical theory in model theory to the context of coherent theories. We prove a duality result between the full sub-2-category of pretopoi which are categorical, and the 2-category of profinite monoids. We also study the geometry of profinite monoids via the classifying topos construction, and show it identifies them as a full sub-2-category of the 2-category of topoi.

comments
Journal version: to appear in Journal of Symbolic Logic
fields
Category Theory, Logic
pdf ↗ page arXiv:2605.22071 ↗

We present a method to build free immersions in critical dimension on $m$-tori for $m = 2, 3, 4, 5$ by using a factorization trick inspired by tori immersions in critical dimension. As an application, we show that the set of smooth free maps from a closed surface $M$ to $\mathbb R^5$ is nonempty. In particular, every closed surface embeds freely in $\mathbb R^5$. Finally, we find the homotopy invariants of free maps in our environment and study which invariants are achieved by our maps.

comments
40 pages, no figure
fields
Geometric Topology, Differential Geometry
pdf ↗ page arXiv:2605.24610 ↗

Using the Chern-Gauss-Bonnet theorem, we establish a sharp inequality for the total Gauss-Kronecker curvature of convex hypersurfaces in Cartan-Hadamard manifolds $M^n$ with nullity index at least $n-3$. Consequently, the Euclidean isoperimetric inequality extends to $M^n$, which proves the Cartan-Hadamard conjecture for these spaces.

comments
8 pages; Minor revisions; Accepted for publication in Proceedings of AMS
fields
Differential Geometry
pdf ↗ page arXiv:2605.24638 ↗

We study the algebraic compatibility between quantum homomorphic encryption and stabilizer quantum error correction in an honest-but-curious model, restricting the encryption to the transversal block-Pauli mask $(X^aZ^b)^{\otimes n}$ controlled by two secret key bits $a$ and $b$. We prove a necessary and sufficient criterion for an $[[n,1,d]]$ stabilizer code to remain compatible with this mask, namely that the transversal $X$ and $Z$ operators commute with every stabilizer generator, and we specialize it to a classical-code criterion for Calderbank–Shor–Steane codes. Combining code-space preservation with the logical action of the mask, every stabilizer code falls, with respect to each of the two transversal mask operators, into exactly one of three classes: incompatible, compatible but trivially acting, or compatible with a nontrivial logical Pauli action; the two operators need not fall into the same class. We verify this classification by exact symplectic computation for rotated and planar surface codes, toric codes, triangular and toric color codes, the $[[15,1,3]]$ code and several small codes, and find that the class is fixed by the lattice size and the boundary presentation rather than by the topological phase: the surface-code family realizes all three classes, whereas color codes realize only the two compatible ones. For encrypted computation we show that the Shor code does not implement the logical $T$ gate by a transversal $T^{\otimes 9}$, whereas suitable triorthogonal codes do so up to a Clifford correction. We formulate logical-Pauli masking as a code-independent algebraic template. Syndrome extraction and recovery are key-independent whenever the mask preserves the code space, so that the client only needs the block size and the class of the code to decrypt.

comments
23 pages, 3 figures, 3 tables
fields
Information Theory
pdf ↗ page arXiv:2605.25692 ↗

The scope of this text is to study a process that induces another proof of the Spectral Embedding Theorem: that any densely defined symmetric operator can be extended by a multiplication operator through an embedding of the Hilbert space into an $L_2$ space. Furthermore, that process is meant to be used for specific operators, where natural spectral embeddings or equivalences may be found. That process has previously been considered in arXiv:2411.06281 and in arXiv:2511.18189, where it has been introduced through nonstandard techniques. Our contribution aims to be the reformulation of the theory through classical analysis arguments, without the use of nonstandard techniques nor ultraproducts.

comments
37 pages. We corrected typos in version 2
fields
Functional Analysis, Logic, Spectral Theory
pdf ↗ page arXiv:2605.30186 ↗

Unlike classical optimal transport, weak transport costs depend nonlinearly on the conditional law of couplings. This feature is essential in problems involving barycenter, conditional moments, and martingale-type constraints. Meanwhile, such conditional dependence makes ordinary Wasserstein geometry insufficient and calls instead for an adapted Wasserstein viewpoint. In this paper, we investigate the entropy-regularized weak optimal transport via gradient flows in adapted Wasserstein space. We derive, from the formal tangent structure of adapted Wasserstein space and the projection onto the set of couplings with prescribed marginals, a coupled McKean–Vlasov SDE. A novel and subtle term is a projection that, at each $Y$-location, averages a weak-transport force that already depends on the conditional law of $Y$ given $X$, thereby preserving marginals while retaining the nonlinear weak-transport structure. Under mild integrability and regularity assumptions, we prove weak existence and uniqueness in law for this projected McKean–Vlasov equation. We then prove that the flow converges, in the adapted Wasserstein topology, to the unique minimizer of the entropic weak optimal transport problem. We also describe a particle approximation and illustrate the dynamics on optimal transport and martingale optimal transport examples.

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

In this paper, we study the minimax risk of detecting a sparse, elevated-mean Gaussian submatrix planted in a larger noisy matrix. When the planted submatrix has size $n\times n$ and the ambient matrix has size $N\times N$ with $N=n^{1+α}$, the seminal work of Butucea and Ingster (2013) identifies the sharp detection boundary around which the risk converges to $0$ or $1$. We extend that zero-one theory by determining sharp risk asymptotics throughout a two-parameter phase diagram. Above the boundary, the risk decays stretched- or super-exponentially fast, and we determine its precise exponent. Below the boundary, where the risk tends to $1$, we obtain matching absolute-constant bounds for its polynomial rate of convergence. In both regimes, the asymptotics change across the line $α+δ=1/2$, where $δ$ parametrizes the signed distance from the detection boundary. Finally, on the boundary, we show that the minimax risk converges to the nondegenerate constant $\frac12$ in a very sparse regime where $n$ remains fixed and $N\to\infty$. Each of these rates corresponds to the risk of a suitably calibrated scan or sum test, whence follow the upper bounds. The main problem is to derive the matching regime-specific lower bounds. The mixture likelihood ratio is an average rather than a product and thus its logarithm lacks the additive structure required by standard large deviation formulations. On the other hand, classical second-moment estimates fail to be sharp due to overlap-induced correlations. To address these issues, we develop two general lower-bound principles based on truncated mixture likelihoods, tailored to the target risks on both sides of the detection boundary. The same framework yields sharp risk asymptotics for sparse subtensors with equal side lengths and also applies to more general testing problems including the detection of rectangular subtensors.

comments
30 pages, 1 figure. Expanded exposition of the methods; main results remain unchanged. Tensor results are collected inside a single theorem. Abstract modified to meet arXiv's requirement
fields
Statistics Theory, Probability
pdf ↗ page arXiv:2605.31583 ↗

We consider integrable hierarchies such as KP, modified KP, 2D Toda lattice, BKP (small and large), DKP, Pfaff-Toda and their multi-component generalizations. We work in the framework of the bilinear formalism in which the universal dependent variable is a tau-function satisfying bilinear equations of the Hirota-Miwa type. Our principal interest in this paper is the dispersionless versions of the hierarchies. In the limit of zero dispersion the main object is an $F$-function, which is the limit of properly re-scaled logarithm of the tau-function. We show that in all the cases there exists an algebraic curve built into the structure of the hierarchy. We call it the {\it dynamical curve}. For the KP, modified KP and Toda lattice hierarchies, as well as for their multi-component generalizations, the curve is rational (of genus 0) and can be uniformized by rational or trigonometric functions. For hierarchies of the Pfaff type (DKP and Pfaff-Toda) the dynamical curve is in general a smooth elliptic curve (of genus 1), with its modular parameter being a dynamical variable. It is also shown that the large BKP hierarchy admits two different dispersionless versions. In one of them the dynamical curve degenerates to a rational curve while in the other one it remains to be elliptic. We show that a reformulation of the hierarchies based on uniformization of the dynamical curves by elliptic (or trigonometric) functions makes their structure nice and clear, especially in the multi-component case.

comments
92 pages, no figures. Typos corrected, references added
fields
Mathematical Physics
pdf ↗ page arXiv:2606.01354 ↗

Automatic-differentiation-based inverse analysis methods, including physics-informed neural networks (PINNs) and differentiable programming, have recently shown great promise due to their ability to compute accurate gradients and convergence efficiency. However, their applicability to falling weight deflectometer (FWD) backcalculation remains unexplored. This study critically evaluates PINN-based inverse analysis for a multilayer pavement system and investigates differentiable finite element method (DiffFEM) as an alternative based on a synthetic benchmark. The standard PINN does not recover layer moduli because of the sharp domain discontinuities inherent to layered pavement systems. Although we use an extended PINN with domain decomposition (XPINN), which shows better performance on discontinuous domains, its performance remains highly sensitive to loss weighting and network architecture, and degrades under measurement noise. By contrast, DiffFEM consistently achieves more accurate, stable, and computationally efficient inversion results. These results show and quantify the expected advantage of DiffFEM, which enforces the governing physics as a hard constraint in the solver, over PINN-based approaches, where the governing physics is imposed as a soft constraint through the loss function. More broadly, the findings suggest that the choice between PINN- and DiffFEM-based inverse analysis needs careful consideration, with DiffFEM offering practical advantages when an efficient and robust differentiable forward solver is available.

journal
Computer-Aided Civil and Infrastructure Engineering, Vol. 51, 100251 (2026)
fields
Numerical Analysis
pdf ↗ page arXiv:2606.03210 ↗

Root-MUSIC is a spectral estimation algorithm that approximates the unknown signal frequencies by constructing a high-degree polynomial and finding a subset of roots which are closest to the complex unit circle. Previous works found asymptotic expectation formulas for the performance of Root-MUSIC under the implicit assumption that the aforementioned root selection criterion does not select extraneous roots -- those which are unrelated to the correct parameters. This paper removes the need for this assumption by showing all extraneous roots lie outside an annulus of a certain thickness and therefore are not selected by the algorithm. This paper also provides sharp and non-asymptotic error bounds for the correct roots in terms of fundamental model parameters. All results hold under a natural separation condition on the correct signal frequencies and are applicable in both the single- and multi-snapshot models. Numerical simulations confirm our theory. The main mathematical insight of this paper is a geometric property of the Root-MUSIC polynomial: its correct roots are highly stable to noise while its extraneous roots must lie outside of an annulus.

comments
30 pages; to appear in Sampling Theory, Signal Processing, and Data Analysis
fields
Information Theory
pdf ↗ page arXiv:2606.04003 ↗

We study homogenization of Lamé-Stokes systems with fixed material parameters. Incompressible elastic inclusions are periodically distributed in a connected elastic matrix, with an elastic buffer near the outer boundary. The divergence constraint acts only in the inclusions, and the full pressure contributes to interface traction. We identify the effective elasticity system for the traction problem of period $\varepsilon$. Under the respective regularity assumptions, we obtain the optimal $O(\varepsilon)$ convergence rate for the displacement in $L^2$. For the unsmoothed first-order approximation, the displacement error in $H^1$ and the pressure error in $L^2$ over the inclusions are both $O(\varepsilon^{1/2})$. For a $C^{1,1}$ outer boundary, both errors improve to $O(\varepsilon)$ on every fixed interior subdomain. We establish local interface Schauder estimates including the full pressure and combine them with large-scale iteration to obtain Lipschitz estimates for the displacement up to the boundary and $L^\infty$ bounds for the pressure in the inclusions. These Lipschitz and pressure bounds are uniform in $\varepsilon$ for $C^{1,κ}$ interfaces and outer boundary and compatible $C^{0,τ}$ traction data, where $0<τ<κ<1$.

comments
32 pages, 1 figure. The previous version was based on the author's master's thesis. This version has been substantially revised and reorganized, with improved convergence and regularity results
fields
Analysis of PDEs
pdf ↗ page arXiv:2606.05098 ↗

Using André's lemma and the excision square for perfectoidization coming from $p$-complete arc descent, we prove new structural results about perfectoid rings and perfectoidization. The main result is a tameness theorem for torsion in perfectoid rings: if $R$ is a perfectoid ring and $I\subset R$ is an ideal, then the $I$-torsion in $R$ is $I_{\mathrm{perfd}}$-almost zero. This yields an excision-type decomposition of $R$ along its $I$-torsion part. We also study (semi)perfectoid rings and perfectoid ideals and take the opportunity to make some structural remarks about them.

comments
26 pages. v2:Added results in the perfectoid ideals section. v3:Simplified proof of current proposition 4.10. Added bilbiography. Comments welcome
fields
Commutative Algebra, Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2606.06241 ↗

We investigate the long-time behaviour of a one-dimensional compressible viscous fluid with general capillarity and density dependent viscosity, driven by a stochastic force. In particular, we prove the existence of invariant measures by applying the Krylov-Bogoliubov method in a setting where the dynamics is supported on a non-complete phase space. This analysis is further enhanced by the derivation of a refined stability result determining the continuous dependence with respect to the initial data. The present paper exhibits some properties and results for Korteweg fluids which are not known in absence of the capillarity tensor. In particular, we prove that the Markov semigroup associated with strong solutions is Feller and we can consider ranges of the adiabatic and viscosity exponents $γ$ and $α$ larger than those available in the current ergodic literature for compressible fluids. Also the interplay between the choice of the physical domain and the use of a damping term is discussed.

fields
Analysis of PDEs
pdf ↗ page arXiv:2606.07423 ↗

Finding a minimum proper vertex coloring is $\NP$-hard and hard to approximate. $B$-coloring is used as a heuristic approach to graph coloring. A b-coloring of a graph $G$ is a proper vertex coloring where each color class contains at least one vertex (a b-vertex) adjacent to a vertex in every other color class. The maximum number of colors in such a coloring is the b-chromatic number, ${\rm b}(G)$. A ${\rm b}^{\ast}$-coloring is a variation in which a b-vertex is adjacent to a b-vertex in every other color class. We employ the ${\rm b}^{\ast}$-coloring to prove that any $n$-vertex graph $G$ with independence number at most $t$ satisfies ${\rm b}(G) \leq [(t-1)n+tχ(G)]/(2t-1)$. This bound extends the bounds of Kouider and Zaker (2006) and Alkhateeb and Kohl (2011) and significantly improves the bound in terms of the clique partition number. We show that this bound is sharp for all $t\geq 2$ and $χ(G)\geq 3$. Furthermore, we provide a refined bound based on the maximum number of vertex-disjoint independent sets of size $t$. Finally, we prove ${\rm b}^{\ast}(G) \leq [(t-2)n+(t-1)χ(G)]/(2t-3)$ for all $K_{1,t}$-free graphs $G$, a significant improvement over the analogous bound for ${\rm b}(G)$.

comments
15 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2606.07461 ↗

We investigate the long-time asymptotics of a full soliton gas for the Camassa–Holm equation. The analysis starts from a pure-soliton Riemann–Hilbert (RH) problem with \(2N\) poles and two distinct types of residue conditions. We prove that, as \(N\to\infty\), this discrete RH problem converges to a limiting soliton gas RH problem whose jump matrix contains two nonzero reflection coefficients. In this sense, the limiting problem gives a full soliton gas model for the Camassa–Holm equation, in contrast to the previously studied half soliton gas models, whose jump matrices involve only one nonzero reflection coefficient. The limiting RH problem is analyzed by the Deift–Zhou nonlinear steepest descent method. The presence of two nonzero reflection coefficients requires two different types of triangular factorizations of the jump matrix and leads to a more delicate \(g\)-function mechanism. The main difficulty lies in the construction of suitable \(g\)-functions adapted to the Camassa–Holm phase, together with the precise control of their behavior near the distinguished point \(k=i/2\) and at infinity. Depending on the location of the spectral endpoints \(η_1\) and \(η_2\), different \(g\)-function mechanisms arise. In this paper, we focus on Case I and derive the long-time asymptotic formulas in three elliptic-wave regions of the self-similar plane. In each region, the leading term is given by a finite-gap elliptic function, while in the central region the first correction is of order \(\mathcal O(t^{-1/2})\) and involves parabolic cylinder functions.

comments
51 pages, 6 figures. Revised version with corrections to several formulas and improvements to the proofs and presentation
fields
Analysis of PDEs
pdf ↗ page arXiv:2606.10727 ↗

We study general properties of the perfectoidization of finite algebras over a perfectoid ring, which helps to understand some precise and explicit descriptions. For example, we prove that if $A=R[t]/(m(t))$ where $m(t)$ is monic, $R$ is perfectoid and the discriminant $d$ of $m(t)$ is a non-zero divisor of $R$ satisfying a bounded torsion condition, then $dA_{\mathrm{pfd}}\subset A$. We also prove a density criterion reducing the construction of the perfectoidization to adjoining suitable $p$-power roots modulo $p$. In the second part of the paper, we compute perfectoidizations in several families of examples, including Kummer-type extensions and split finite algebras.

comments
v2:Simplified section 2.2 and generalized the result of this section removing a non-zero divisor condition.v3:Corrected typos and added bibliography. 24 pages, comments welcome
fields
Commutative Algebra, Algebraic Geometry, Number Theory
pdf ↗ page arXiv:2606.12229 ↗

We lay the groundwork for the theory of roots of polynomials over semirings and hyperfields, employing a property of a ``surpassing relation'' $\preceq$ on semirings and hyperfields that we call strong $\preceq$-reversibility. There are three kinds of roots generalizing roots in classical algebraic theory --- ``null roots,'' ``$\preceq$-roots,'' and ``factor-roots.'' The theory works best when all null roots are also factor-roots. The ensuing results include the fundamental theorem of algebra for pairs, asserting that tangible polynomials with enough roots ``$\preceq$-split,'' sometimes uniquely, into linear factors. We also examine to what extent polynomials are determined by their null roots. Next, we obtain $\preceq$-roots over extension systems, and construct integrally closed systems over various base systems, including hyperfield systems over a group. The point is that whereas hyper-polynomials behave poorly, polynomial systems remain strongly $\preceq$-reversible, so one can compose chains of $\preceq$-finitely spanned extensions. Next, we introduce real pairs, focusing on square roots and quadratic closure. In the appendix we recast the theory by considering equivalence classes of tangible polynomials which agree on almost all substitutions.

comments
32 pages A third kind of root is studied, and a section on real roots and quadratic extensions was added. The theorems about extensions are clarified
fields
Rings and Algebras
pdf ↗ page arXiv:2606.13330 ↗

We consider system identification for discovering parameterized operators in governing partial differential equations (PDEs) from noisy spatiotemporal data. Building on variational system identification (VSI), which identifies PDEs through Galerkin weak-form residuals, we develop a Bayesian VSI (B-VSI) framework for operator selection, parameter estimation, and uncertainty quantification. The central idea is to define the likelihood directly in weak-form residual space by propagating observation uncertainty through the weak-form residual map. The resulting likelihood captures heteroscedastic and correlated residual errors while avoiding repeated forward PDE solves during inference. For efficient computation, we use lagged-covariance updates that yield generalized least-squares estimates and conjugate posterior approximations when applicable, together with gradient-based and particle-based methods for more general priors and posterior structures. Model-form uncertainty is handled through sequential operator elimination guided by a residual-space Bayesian information criterion. We demonstrate the framework on state-linear and nonlinear PDEs, including the Fokker–Planck equation and a two-field Cahn–Hilliard equation. The results show that B-VSI accurately recovers active operators and coefficients from noisy data, improves robustness relative to classical VSI, and provides posterior uncertainty estimates for coefficients and derived physical quantities.

fields
Mathematical Physics
pdf ↗ page arXiv:2606.14942 ↗

We solve the inverse problem for Ising models on reduced planar graphs in a disk, i.e., recovering the edge coupling constants from the boundary spin correlations. A recursive solution to this problem was provided by Galashin–Pylyavskyy. Our solution is nonrecursive. It is based on an Ising analog of the chamber ansatz which asserts that the inverse map factors through variables on the graph that transform under the Ising Y-$Δ$ move according to the discrete CKP equation.

comments
40 pages, 19 figures
fields
Combinatorics, Mathematical Physics
pdf ↗ page arXiv:2606.15082 ↗

We characterize the boundedness and compactness of the embedding $$ \operatorname{id}:\mathcal B \longrightarrow L^p(μ),\qquad 0<p<\infty, $$ where $\mathcal B$ denotes the Bloch space and $μ$ is a positive Borel measure on the unit disc. The criteria depend only on the dyadic Carleson tents. These results refine our earlier $L^2(μ)$ characterization based on a full dyadic resolution of the disc and extend it to all positive exponents. The proof combines discretization on Carleson tents, representations of Bloch functions by series of analytic polynomials, and weighted matrix estimates. We also obtain corresponding boundedness and compactness characterizations for $$ \textrm{id}:\mathcal Q_p\longrightarrow L^q(μ),\qquad 0<p\le1,\quad 0<q<\infty. $$ These results resolve the general $p$--Bloch–Carleson measure problem studied by Girela, Peláez, Pérez-González and Rättyä in 2008.

comments
46 pages. Substantially revised and extended; title changed. The characterization based on a full dyadic resolution of the unit disc is refined to one involving only the dyadic Carleson tents, and extended from $L^2(μ)$ to $L^p(μ)$ for all $0<p<\infty$. Corresponding characterizations for $\mathcal Q_p$ spaces are also included. Comments welcome!
fields
Complex Variables, Classical Analysis and ODEs
pdf ↗ page arXiv:2606.16760 ↗

Improving an earlier bound of Frieze and Mubayi, Iliopoulos showed that any $k$-uniform uncrowded hypergraph of maximum degree $Δ$ has list chromatic number at most $(1+o(1))(k-1)\Big(\fracΔ{\logΔ}\Big)^{\frac{1}{k-1}}$. Determining the optimal leading constant in this bound remains a major open problem. A natural target for the constant, suggested by the coupon-collector heuristic, is $(k-1)^{\frac{1}{k-1}}$, which also arises independently as the shattering threshold for coloring and finding large independent sets in sparse random hypergraphs. We show that uncrowded hypergraphs attain this threshold: for $k \ge 2$, every $k$-uniform uncrowded hypergraph $\mathcal{H}$ of maximum degree at most $Δ$ satisfies $$χ_\ell(\mathcal{H})\le(1+o(1))\Big((k-1)\fracΔ{\logΔ}\Big)^{\frac{1}{k-1}}.$$ This matches the coupon-collector heuristic, and establishes a 2019 conjecture of Molloy for uncrowded hypergraphs. As a consequence, we show that every $k$-uniform linear hypergraph of maximum degree at most $Δ$ has chromatic number at most $c_k\Big(\fracΔ{\log Δ}\Big)^{\frac{1}{k-1}}$ with $c_k=1-o_k(1)$, resolving, in a stronger form, a recent conjecture of Verstraëte and Wilson on the independence number of linear hypergraphs. Our techniques yield the first palette sparsification result for hypergraph coloring using $o(Δ^{\frac{1}{k-1}})$ colors per vertex. Specifically, for an uncrowded $k$-graph $\mathcal{H}$ and $q=Θ\Big({\Big(\fracΔ{γ\logΔ}\Big)^{\frac{1}{k-1}}}\Big)$, sampling $Θ(Δ^{\fracγ{k-1}})$ colors per vertex suffices to obtain a proper $q$-coloring of $\mathcal{H}$ w.h.p. As an algorithmic consequence, we obtain a single-pass streaming algorithm using $O\big(n^{1+o(1)}\big)$ space for uncrowded $k$-graphs, and, via hypergraph partitioning, for linear hypergraphs as well.

comments
Minor revision: acknowledged independent related work
fields
Combinatorics
pdf ↗ page arXiv:2606.18048 ↗

Physics-Informed Neural Networks (PINN) struggle with stiff, regime-changing transport equations due to instability, loss imbalance, and violations of physical consistency. This paper investigates these failures through the Marshak wave equations, a canonical benchmark from radiative transport, where initial and boundary conditions differ by up to 12 orders of magnitude, and proposes modifications to the standard PINN framework to overcome them. Three modifications are introduced: a ScaledSigmoid final activation enforcing physical bounds and positivity of the unknowns; a logarithmic MSE loss replacing the standard quadratic loss for initial and boundary conditions, enabling training across extreme scale disparities; and explicit enforcement of global conservation laws as an additional physics loss term. Monte Carlo sampling with exponential time weighting is used throughout. The proposed framework recovers the Marshak wave dynamics - including the hot, cold, and wave-front regions - in good agreement with a reference Implicit Monte Carlo solution (sub-millimeter absolute error on the front position, although the relative error remains substantial at early times), with run times under 5 minutes. Ablation studies confirm that each ingredient is essential: linear activation, absence of the logarithmic loss, or removal of the PDE term each independently cause the method to fail qualitatively. This work identifies and resolves three concrete failure modes of standard PINN on stiff hyperbolic systems with nonlinear coupling. The combination of bounded activations, scale-aware loss functions, and conservation law enforcement constitutes a framework validated on the present one-dimensional Marshak wave problem, with potential extension to other coupled stiff transport systems in engineering.

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

We compute via trace methods the higher algebraic $K$-theory of the group ring $k[\operatorname{SL}_2(\mathbb{F}_q)]$, as well as the related groups $\operatorname{PSL}_2(\mathbb{F}_q)$, $\operatorname{PGL}_2(\mathbb{F}_q)$, and $\operatorname{GL}_2(\mathbb{F}_q)$, where $k$ is a finite field of characteristic $p$ and $q=p^r$. At the core of the computation is the algebraic $K$-theory of the group ring of the Sylow $p$-subgroup, $k[C_p^r]$, which we determine via a theorem of Lück–Reich–Rognes–Varisco on cyclic assembly for topological cyclic homology. In the process, we reprove the cyclic assembly result in the language of Nikolaus–Scholze, analyse assembly for smaller families of subgroups, and develop further tools for computing topological cyclic homology of group rings.

comments
Corrected statement and proof of main theorem; results now stated over finite fields. Other minor corrections
fields
K-Theory and Homology, Algebraic Topology, Representation Theory
pdf ↗ page arXiv:2606.21421 ↗

We study exact semidefinite programming (SDP) relaxation for a given sparse quadratically constrained quadratic program (QCQP). The SDP relaxation is exact if, whenever it has an optimal solution, it admits a rank-at-most-one optimal solution that corresponds to an optimal solution of the QCQP. Using the maximal cliques of a chordal extension of the aggregate sparsity pattern graph of the data matrices, we formulate the SDP relaxation in terms of clique-wise matrix variables and develop a local-to-global framework for certifying exactness. For each clique-wise matrix variable, we introduce a local sub-SDP with two parameters: a local right-hand-side vector and a consistency matrix specifying the values of entries shared by overlapping clique-wise matrix variables. In the main theorem, these parameters are determined by an optimal solution of the global clique-wise SDP. The theorem shows that if the resulting local sub-SDPs are exact, then the original SDP relaxation is exact. Under the additional assumption that any two distinct cliques intersect in at most one node, we present three classes of local QCQPs that can be incorporated into this framework: convex local QCQPs, local QCQPs characterized by sign-pattern conditions, and separable local QCQPs with a limited number of constraints. Examples illustrate how these different local QCQP classes can be combined in sparse QCQPs.

comments
26 pages, 7 figures
fields
Optimization and Control
pdf ↗ page arXiv:2606.21823 ↗

We calculate the conditional expectation of $\prod_{j=1}^{n-1}H_{k_{j}}% (X_{j})$ given $X_{n}=z,$ if random vector $(X_{1},\ldots,X_{n})^{T}$ has multivariate normal distribution and $H_{n}(x)$ denotes $n$-th Hermite polynomial. This expectation is a polynomial in $z$ of order $\sum_{j=1}% ^{n-1}k_{j}$. Our formula has an iterative form with respect to $n$. We also present some auxiliary observations concerning the expansion of the density of the $n$-dimensional normal distribution in the series of the Hermite polynomials. Mostly concerning the properties of the coefficients of this expansion. To perform these calculations, we give a few auxiliary formulas concerning Hermite polynomials and multivariate normal distributions. We apply this result to obtain exact, simple forms of these expansions for $n=2$ and $3$, thus looking at known results from a different perspective. We believe that the results can be very useful in Probability Theory, in particular in the Theory of distributions, Statistics, and the Theory of Stochastic Processes, in particular Gaussian ones.

fields
Probability
pdf ↗ page arXiv:2606.22526 ↗

We develop a high-order, locally conservative, invariant-domain preserving continuous finite element method for nonlinear scalar conservation laws. A first-order graph-viscosity scheme is built on the fine-$\mathbb P_1$ submesh induced by the high-order nodes, so that it remains compact and has positive lumped masses for every polynomial degree, while the high-order candidate can be any stabilized Galerkin method; here we use residual-based artificial viscosity and continuous interior penalty methods. The two updates conserve different discrete masses, and comparing each in its own conserved measure gives a nodal difference with zero sum, which a graph-Poisson problem represents as antisymmetric edge fluxes. For polynomial degrees with positive $\mathbb P_k$ lumped masses (e.g., $\mathbb P_1$, $\mathbb P_3$, $\mathbb P_5$ on triangles), convex limiting of these fluxes conserves the $\mathbb P_k$ mass exactly and in local flux form. For degrees with zero or negative lumped masses (e.g., $\mathbb P_2$, $\mathbb P_4$), limiting perturbs the mass only on the elements where it acts, and this perturbation is removed inside each such element without violating the bounds, exactly whenever the element has enough room within its bounds. Numerical experiments demonstrate high-order accuracy for smooth solutions, robustness near discontinuities, and agreement with the entropy solution on standard benchmarks.

fields
Numerical Analysis
pdf ↗ page arXiv:2606.23397 ↗

We study multiserver queues with Marshall–Olkin dependent service mechanisms, heterogeneous servers, and fixed idle-set assignment. An explicit matrix-analytic solution links the stationary queue distribution to departure and customer-delay laws. Waiting time conditional on delay is exactly exponential, and the stationary \chg{sojourn law has a phase-type representation with at most one more phase than the number of servers.} A consistency condition characterizes when Markovian completions admit a Poisson shock representation. For two three-server families with identical bivariate residual-service laws, we prove a conditional waiting-time ordering and identify when their unconditional waiting tails cross. The results show how higher-order dependence affects performance beyond marginal rates and pairwise service dependence.

comments
47 pages. This is a significantly updated version using a different method (MAM), and extended studies to departure process, and virtual waiting time
fields
Probability
pdf ↗ page arXiv:2606.24881 ↗

The ubiquity of geometric Brascamp-Lieb data, which refers to a certain density property of geometric data within the set of all feasible Brascamp-Lieb data, has recently been studied. Motivated in part by a question of Bennett-Tao concerning a possible connection or analogue of the adjoint Brascamp-Lieb inequality to the forward-reverse Brascamp-Lieb inequality, we establish ubiquity in the forward-reverse setting. Our proof takes an analytic approach and, to overcome the difficulties arising in extending ubiquity to the forward-reverse setting, makes use of tools from the calculus of variations such as Danskin's theorem and Ekeland's variational principle.

comments
12 pages. The main result has been extended to the setting of the forward-reverse Brascamp-Lieb inequality
fields
Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2606.26500 ↗

Residential batteries can reduce the carbon emissions of households with photovoltaic (PV) generation, but how much depends on how they are operated under uncertain load, PV generation, and grid carbon intensity. We cast the operation of a residential PV-battery system as a sequential decision problem and compare, under a common and explicit evaluation protocol, a family of linear policies that differ in the information available at decision time, in how they anticipate the future, and in their adaptivity: a rule-based self-consumption policy, an open-loop stochastic schedule, affine feedback policies, receding-horizon policies with deterministic, scenario-based and two-stage lookahead models, and perfect-information benchmarks. Scenarios are generated by a joint principal component model of the three uncertain quantities, which supports conditional sampling during the day. Experiments on Italian data at 15-minute resolution comprise single-day evaluations on 10000 test scenarios in three seasons and a closed-loop simulation over more than eight months of real data. When the state of charge is treated consistently across policies, the self-consumption rule is within 3.2% of the perfect-foresight emissions in closed loop, whereas open-loop schedules and receding-horizon policies that decide before measuring the current period are about 20–35% above it. With real-time measurements, scenario-based receding-horizon control consistently outperforms its deterministic counterpart and, for households that rely more on the grid, reduces emissions by about 5% with respect to the rule. The benefit of emission-aware optimization is therefore determined mainly by the information structure of the controller and by the size of the system relative to the demand.

fields
Optimization and Control
pdf ↗ page arXiv:2606.26648 ↗

The supersaturation problem asks, for a fixed $r$-graph $\mathcal F$, for the minimum number of copies of $\mathcal F$ in an $n$-vertex $r$-graph with $\ex(n,\mathcal F)+q$ edges. Mubayi conjectured a local form of supersaturation under a stability hypothesis: if $\mathcal F$ is non-$r$-partite and stable, meaning roughly that the extremal $\mathcal F$-free construction is unique and all near-extremal $\mathcal F$-free $r$-graphs are close to it, then this minimum should be at least $q c(n,\mathcal F)$, where $c(n,\mathcal F)$ is the minimum number of copies created by adding one edge to the extremal $\mathcal F$-free $r$-graph. We disprove this conjectured local lower bound in the strongest possible quantitative sense that the ratio to the conjectured lower bound can be made arbitrarily small. More precisely, for every $r\ge2$ and every $K>1$, we construct a stable non-$r$-partite $r$-graph $\mathcal F$ such that, for all sufficiently large $n$ and every $1\le q\leδn$, there is an $n$-vertex $r$-graph with $\ex(n,\mathcal F)+q$ edges containing at most $K^{-1}q c(n,\mathcal F)$ copies of $\mathcal F$. This arbitrarily large failure already occurs when $q=1$.

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

We develop a framework for constructing and rigorously validating controls for semilinear wave equations with localized interior control. We analyze the continuous energy-space problem and certify exact control for finite-dimensional Galerkin systems. Under explicit smallness and neighborhood conditions, our a posteriori theorem proves the existence of an exact Galerkin control near a computed candidate. It combines a validated terminal-state error, a bounded right inverse of the derivative of the control-to-terminal-state map, and a Lipschitz bound for that derivative. Under additional uniform right-inverse and neighborhood conditions, we also show that Newton correction converges with quadratic decay of terminal-state errors. We use residual estimates and interval arithmetic to enclose the nonlinear trajectory and its linearized controllability Gramian. For the specified eight-mode tanh problem, we rigorously bound a source-response operator to prove contraction of the exact source-frozen iteration. We compare deterministic controls based on the Hilbert Uniqueness Method with neural approximations of temporal modal coefficients. Two Newton corrections reduce the computed terminal-state errors of all six tested neural candidates below $10^{-8}$. For the three certified candidates, we obtain smaller bounds on the distance to an exact Galerkin steering control by refining the validation mesh while keeping the computed controls fixed.

comments
Newton-HUM method is added to the study
fields
Numerical Analysis
pdf ↗ page arXiv:2606.28029 ↗

This paper provides an isomorphism between the space of twisted gauge fields on a principal bundle $\mathcal{P}(M,H)$ and the space of standard gauge fields on a different principal bundle $\mathcal{Q}(M,G)$ associated to $\mathcal{P}$. This isomorphism extends to local fields on the base manifold, which enables the use of local twisted fields in standard gauge theories (e.g. Yang-Mills-like theories). This allows one to deal with two symmetry groups, coming from $\mathcal{P}$ and $\mathcal{Q}$, respectively. The construction makes use of a larger principal bundle $\mathcal{S}$ which has $\mathcal{P}$ and $\mathcal{Q}$ as quotient bundles. $\mathcal{S}$ is a Hilsum-Skandalis bibundle between the action groupoids $H\ltimes\mathcal{P}$ and $G\ltimes\mathcal{Q}$. The gauge structure on $\mathcal{S}$ encodes both standard and twisted gauge structures on $\mathcal{P}$. In addition, the isomorphism classes of bundles $\mathcal{S}$ up to an isomorphism covering the identity map on $\mathcal{P}$ are in 1:1 correspondence with the equivalence classes of cocycles (up to a coboundary). This paper also provides a new interpretation of (full) dressing fields as dynamic (or active) sections of a principal bundle.

comments
40 pages
journal
Serge Lazzarini, Thierry Masson, Louis Usala, How to untwist twisted gauge fields, Journal of Geometry and Physics, Volume 231, 2027, 106028, ISSN 0393-0440
fields
Mathematical Physics, Differential Geometry
pdf ↗ page arXiv:2606.28888 ↗

The purpose of this paper is to give a natural divisor-theoretic formulation of the counting method introduced by Halburd for computing degree growth, in a form applicable to birational dynamical systems on varieties of arbitrary dimension. Instead of counting only preimages of special values, we follow time-indexed divisorial conditions through singularity patterns. These conditions are recorded on normalized finite-window orbit graphs, where the relevant multiplicities are realized as divisorial valuations of pullbacks of time-indexed divisors. This construction explains how the elementary computations appearing in singularity patterns can be interpreted as degree relations on a single normal variety. We then show that further relations arise from the failure of functoriality of pullbacks: when the center of a divisor enters the relevant indeterminacy locus, a degree-drop divisor appears. Under suitable finite-type assumptions, the two kinds of relations lead to closed linear difference systems governing degree sequences. Several examples, including higher-dimensional ones, demonstrate that the two mechanisms are complementary and that their combination determines the degree growth in cases where either mechanism alone is insufficient.

comments
32 pages, 4 figures. Version 2 revises Theorem 3.2 under the base-point-free hypothesis. It also adds explicit coordinate descriptions of degree drops on P^M and (P^1)^M, refines the divisor decomposition on normalized orbit graphs by including the remainder R_I, and corrects the Riccati-type example in Section 8
fields
Dynamical Systems, Algebraic Geometry
pdf ↗ page arXiv:2606.29274 ↗

We classify all skew left braces with additive group isomorphic to the infinite dihedral group. There are ten isomorphism classes.

comments
14 pages
fields
Group Theory
pdf ↗ page arXiv:2606.29641 ↗

This paper presents a cooperative distributed model predictive control (MPC) scheme for nonlinear continuous-time systems. The centralized optimal control problem is solved asynchronously via a fixed number of sensitivity-based distributed programming (SBDP) iterations. The proposed scheme requires only neighbor-to-neighbor communication and no synchronization between agents during optimization. Under nominal MPC stability and bounded information delay, local exponential stability is established for a sufficiently large number of per-agent SBDP iterations. Numerical and hardware-in-the-loop results on both Ethernet and Wi-Fi demonstrate the benefits of an asynchronous execution, reducing execution times by over 60% while maintaining comparable closed loop performance.

fields
Optimization and Control
pdf ↗ page arXiv:2607.03412 ↗

In this article, we investigate the asymptotic Bayes optimality under sparsity (ABOS) of the Gavrilov-Benjamini-Sarkar (GBS) step-down multiple testing procedure (Gavrilov et al., 2009) in the sparse Gaussian sequence model. While the asymptotic optimality properties of the Benjamini-Hochberg procedure have been extensively studied, corresponding results for the GBS procedure remain unavailable despite its favorable finite-sample performance in several settings. Within the spike-and-slab Bayesian formulation and the asymptotic decision-theoretic framework of Bogdan et al. (2011), we establish that the GBS procedure is ABOS over a broad class of sparse asymptotic regimes. Existing analyses of the Benjamini-Hochberg procedure rely on approximating the random rejection threshold by a suitable deterministic surrogate. In contrast, our approach proceeds through a direct analysis of the Bayes risk by separately controlling the false discovery and false nondiscovery components. The analysis combines two key ingredients: a new finite-sample inequality for shifted order statistics associated with the GBS critical constants and a signal-crossing argument for ordered alternative $p$-values that exploits the sequential step-down structure of the procedure. For diverging expected signal counts, these tools yield ABOS without threshold localization. For bounded positive expected signal counts, a direct argument based on the first GBS critical constant establishes ABOS as well. In particular, our results cover polynomial sparsity $p_m\asymp m^{-β}$ for every fixed $0<β\le1$. To the best of our knowledge, this is the first asymptotic decision-theoretic analysis of the GBS procedure and the first proof of its asymptotic Bayes optimality under sparsity.

fields
Statistics Theory
pdf ↗ page arXiv:2607.03719 ↗

The aim of this paper is to study the variation under quadratic twists of the analytic Iwasawa invariants of Sprung's sharp/flat 2-adic $L$-functions for elliptic curves over $\mathbb{Q}$ with good supersingular reduction at $2$. Under the hypothesis that the $μ$-invariant vanishes, we obtain an explicit formula for the sharp/flat $λ$-invariants. This formula gives a supersingular analogue of Matsuno's formula in the good ordinary case. As an application, we show that the sharp/flat $λ$-invariants can be made arbitrarily large even among quadratic twists by single primes. Moreover, using the method of Hatley-Ray, we obtain an asymptotic lower bound for the number of quadratic twists with a prescribed sharp/flat 2-adic Iwasawa $λ$-invariant.

comments
33 pages. Corrections and improvements
fields
Number Theory
pdf ↗ page arXiv:2607.05305 ↗

False discovery rate control does not by itself guarantee optimal recovery of sparse signals: a procedure may make few false discoveries while missing an unnecessarily large fraction of the alternatives. We investigate whether the classical Gavrilov–Benjamini–Sarkar (GBS) step-down procedure also achieves the sharp frequentist minimax limits for sparse recovery in independent Gaussian sequence models. Under a beta-min separation at the critical sparse detection boundary, GBS attains the exact asymptotic risk constant $\barΦ(b)$ for normalized Hamming loss and combined $\mathrm{FDP}+\mathrm{FNP}$ loss. The Hamming conclusion remains valid when the number of signals is only bounded above by the nominal sparsity $s_n$. For heterogeneous signal magnitudes, the corresponding risk under either loss equals the sharp benchmark $Λ_n(a)+o(1)$, without assuming that $Λ_n(a)$ converges; this is additive, rather than necessarily relative, sharpness. We assume $s_n\to\infty$, $n/s_n\to\infty$, and a vanishing nominal level $α_n$ satisfying $\log(1/α_n)=o(\sqrt{\log(n/s_n)})$. Unlike step-up rules, a step-down procedure must satisfy every preceding ordered $p$-value constraint before reaching a given rank. Our analysis handles this sequential obstruction directly: a finite-sample shifted order-statistic bound makes false positives negligible, while new uniform crossing arguments show that the rejection path reaches the optimal fraction of signals. The results extend the range of testing architectures known to attain the sharp minimax benchmarks, without requiring localization of a single rejection threshold.

fields
Statistics Theory
pdf ↗ page arXiv:2607.05893 ↗

Determinantal point processes (DPPs) have recently emerged as a kernel-based alternative to standard independent sampling for constructing efficient minibatches, coresets, and other compact representations of large-scale datasets. One of the key strengths of DPP based samplers is that they can be deployed over very general spaces, in contrast to more classical sampling methods beyond i.i.d. which tend to be tailored to particular well-structured settings, principally Euclidean spaces. In this work, we establish explicit rate guarantees for determinantal sampling in spaces that extend far beyond known Euclidean setups, focussing on spectral kernels obtained from eigenspaces of naturally associated Markov diffusion operators, including in particular the Laplacian on manifolds and nearest-neighbour type graphs on data point clouds and the discrete Schrodinger operator on large scale networks. This covers, in particular, the settings of Riemannian manifolds and discrete networks, as well as the problem of batch sampling from discrete datasets. Overall, our approach achieves guarantees comparable to $\big(\text{sample size}\big)^{-\frac{1}{2}-\frac{1}{2d_{\text{int}}}}$ , which match with the rates for well-known determinantal samplers on Euclidean spaces of comparable dimension. In terms of techniques, we connect to the celebrated Weyl's Law for spectra on general spaces, and leverage tools from the theory of Markov diffusion operators and Dirichlet forms, which could be of independent interest in this area. Our approach is applicable to a very wide plethora of ambient spaces beyond Euclidean as soon as these ingredients are available, including e.g. fractals, leading to guarantees that will be governed by the intrinsic structural constants of such spaces.

comments
Abstract shortened to meet arXiv requirements
fields
Probability
pdf ↗ page arXiv:2607.06644 ↗

We propose the Randomized BH procedure, a generalized framework that introduces randomization into the Benjamini-Hochberg (BH) procedure for false discovery rate (FDR) control. We show that the classical BH procedure as well as two recently developed families of null-distribution-free methods, competition tests and conformal tests, share a common theoretical foundation and arise as special cases of this framework. The Randomized BH relaxes the classical conditions required for FDR control, frees conformal tests from the strict exchangeability assumption while allowing calibration sets to be constructed via pre-screening, and enables competition tests to be analyzed through the well-developed theory of p-values. We illustrate the framework through two applications. The first is a deeper analysis of compound p-values through the lens of randomization. The second is a general approach for integrating distributed multiple testing problems while maintaining global FDR control. Numerical simulations confirm the validity of our theoretical results.

comments
70 page, 15 figures
fields
Statistics Theory
pdf ↗ page arXiv:2607.07245 ↗

We prove a closed-string remodeling statement for the affine binary dihedral Calabi–Yau orbifold threefold $\mathcal X=[\mathbb C^2/Γ]\times\mathbb C$, where $Γ$ is a binary dihedral subgroup of $SU(2)$. This target lies outside the toric setting of the Bouchard–Klemm–Mariño–Pasquetti remodeling conjecture: the toric mirror curve is replaced by the type-$D_l$ relativistic Toda curve of Brini–Ma–Strachan, and the Chekhov–Eynard–Orantin topological recursion is replaced by the $\mathbb Z_2$-equivariant topological recursion of Giacchetto–Kramer–Lewański, run in the sign sector of the Toda-curve involution with the Prym kernel as its two-point input. We identify the equivariant orbifold quantum cohomology Frobenius manifold of $\mathcal X$ with the invariant Jacobian Frobenius structure of the Toda curve, and we prove that the B-model $R$-matrix, defined by regularized stationary phase, equals the A-side normalized canonical Givental–Teleman $R$-matrix on a chosen simply connected domain; this equality is anchored at the orbifold point through a semistable degeneration of the Toda curve. Comparing the resulting Givental–Teleman and Dunin-Barkowski–Orantin–Shadrin–Spitz graph sums then identifies, after a parity-twisted leaf substitution, the sign-sector recursion with the descendant Gromov–Witten generating functions of $\mathcal X$ in the stable range ($2g-2+n>0$ with $n>0$), and identifies the recursion free energies with the equivariant Gromov–Witten free energies of $\mathcal X$ for $g\geq2$. We also match the genus-one potential defined by the reduced calibrated tau function with the Gromov–Witten potential up to an additive constant.

comments
70 pages; major revision
fields
Algebraic Geometry, Mathematical Physics
pdf ↗ page arXiv:2607.07355 ↗

The classical identity relating squared distances to inner products determines every off-diagonal entry of a symmetric matrix associated with a set of pairwise dissimilarities, while leaving its diagonal free. This paper studies the resulting affine family of symmetric matrices and asks which representative is selected by minimising a matrix norm. We prove that the same representative, namely the double-centred matrix used in classical multidimensional scaling and principal coordinate analysis, minimises every unitarily invariant norm on the family. The result includes the Frobenius, spectral, nuclear, Schatten, and Ky Fan norms, and requires no assumption that the dissimilarities are Euclidean distances. The proof rests on a compression-reduction principle: the centring projection maps the entire compatible set to a single element of the family, and orthogonal compression is contractive for unitarily invariant norms; the conclusion follows without solving a separate minimisation problem for each norm. We then determine how many minimisers there are: the minimiser is unique for the Frobenius norm, for the nuclear norm and for every strictly convex unitarily invariant norm, while for the spectral norm we describe the whole minimising set, a compact convex set that reduces to a single point precisely when the double-centred matrix vanishes.

fields
Rings and Algebras
pdf ↗ page arXiv:2607.09670 ↗

Octonions and split-octonions have been used to express the Dirac equation in physics in several conceptually distinct ways. This review organizes them into four groups: the 2-factor, 3-factor, and projection representations, which use (split-)octonion basis elements natively to model a spacetime basis, and the conventional use of octonions to carry Dirac algebra acting on spinors. For each group we identify the originating construction, relate later variants to it, and point to modern applications and to recent methods for native split-octonionic analysis. Because the multiplication table of the (split-)octonions is not unique, forms that look different in print can coincide after a norm-preserving linear isometry and a multiplication-preserving change of basis; we make such relations explicit and tabulate the basis conventions used across select sources. The 2-factor representation is treated in most detail: we document its origin and show that a recently proposed split-octonionic Dirac equation coincides with it after such an isometry and change of basis, while crediting the independent contributions of that work.

comments
15 pages
fields
Mathematical Physics, Rings and Algebras
pdf ↗ page arXiv:2607.09703 ↗

Prefabricated prefinished volumetric construction (PPVC) builds room-sized modules in factories that operate as flexible job shops. A module waits 12 to 48 h after casting, waterproofing, and painting, while its station is free for other modules. Existing learned dispatchers release the next operation before this wait ends, so their plans need repair. This paper presents SLAB (Scheduling under time-Lags with an Admissible Bound), a decision process for dispatchers trained by deep reinforcement learning. Its transition releases a module only after its wait, and its reward is the decrease of a proven lower bound that includes the waits. Training on 10-module orders with halved waits also teaches the policy the station contention of larger orders. On three existing networks, repaired plans are 42% to 133% longer than the same network's schedules inside SLAB. On orders generated from Singapore's PPVC guidebook, one trained policy gives schedules 2.2% to 8.1% shorter than the shortest-processing-time rule at 10 to 80 modules. At 50 and 80 modules, it outperforms a time-lag memetic algorithm by 6.7% and 7.4% and constraint-programming search started from that rule's schedule and given 600 s by 6.6% and 7.6%. The memetic algorithm gives shorter schedules on orders of 10 modules, and the same search given 300 s on orders of 10 and 20 modules. A module factory can therefore train one dispatcher on small orders and run it without a solver on production batches of 50 to 80 modules.

comments
12 pages, 4 figures, with a 31-page supplementary material appended. Submitted to IEEE Transactions on Industrial Informatics
fields
Optimization and Control
pdf ↗ page arXiv:2607.11725 ↗

In this paper, we prove a sufficient condition for the uniform ball-covering property of closed operator subspaces invariant under selected truncations. We use uniform convexity of the range space and near-contractive finite-rank projection approximations to obtain quantitative coverings with finite-rank centres whenever the truncated images are separable. A weak-star version gives the same covering parameters for quotients by arbitrary weak-star closed subspaces. In the completely bounded setting, the covering parameters are independent of the matrix level. In particular, the duals of all closed subspaces of $S_1(\ell_2)$ admit coverings with centre norm $2$ and radius $1+\varepsilon$, for $0<\varepsilon<1$, at every matrix level. Applications include operator-valued Schur multipliers and, for $1<p<\infty$, prescribed-support Fourier multipliers on countable amenable groups and finitely generated free groups. The Fourier coverings have finite-support centres in the given operator or completely bounded norms. An endpoint example shows failure of the ball-covering property at $p=1,\infty$.

fields
Functional Analysis
pdf ↗ page arXiv:2607.12538 ↗

This survey revisits classical results on the existence of periodic solutions in incompressible fluid dynamics. Owing to the breadth of the subject, we restrict our attention to the simplest and most illustrative framework: the two-dimensional Euler equations and vortex patch solutions. The aim is not to present new results, but rather to provide a unified and streamlined exposition of several classical constructions by combining ideas from the original works with more recent developments.

fields
Analysis of PDEs
pdf ↗ page arXiv:2607.12577 ↗

We study twisted Yangians associated with the split symmetric pairs of types BI, CI and DI. We introduce a new presentation of these algebras, which we call the transposed presentation, governed by a twisted reflection equation that interacts naturally with the Gaussian decomposition of the generating matrix. Working entirely within the $R$-matrix presentation, we derive Drinfeld-type current presentations of the special twisted Yangian $SY^{\mathrm{tw}}(\mathfrak{g}_N)$ and of the extended twisted Yangian $X^{\mathrm{tw}}(\mathfrak{g}_N)$, in which the Serre relations are stated in a closed current form. Extracting coefficients recovers the Drinfeld presentation of Lu, Wang and Zhang, in the normalisation of Lu. As a consequence, we establish an explicit isomorphism between the $R$-matrix and Drinfeld presentations conjectured by Lu, Wang and Zhang. As a byproduct, we obtain a tensor product decomposition of $X^{\mathrm{tw}}(\mathfrak{g}_N)$ into the twisted Yangian in the Drinfeld presentation and a polynomial ring in countably many central variables. We also obtain Poincaré-Birkhoff-Witt bases in the Drinfeld generators and the coideal coproduct on the low Drinfeld modes at all but the last node.

comments
45 pages. v2: proofs corrected and expanded, Prop. 2.6 and Cor. 2.7 replaced by Lemma 2.6, new Lemmas 5.5 and 5.13 (§5 renumbered), coideal remark now Prop. 5.20; main results unchanged
fields
Quantum Algebra, Mathematical Physics, Representation Theory
pdf ↗ page arXiv:2607.14692 ↗

Multi-objective learning (MOL) aims to optimize multiple objectives simultaneously. The multi-gradient descent algorithm (MGDA) constructs a common descent or conflict-avoidant (CA) direction by solving a gradient-aggregation subproblem. In stochastic settings, the vanilla stochastic MGDA method, SMG, replaces full-batch gradients with mini-batch estimates, causing bias in the resulting CA direction. Existing analyses control this error using continuity of the CA-direction mapping, but do not distinguish how its sensitivity varies with the geometry of the MGDA subproblem. Motivated by this limitation, we show that the MGDA direction map is Lipschitz continuous under reduced nondegeneracy, whereas its general \(1/2\)-Hölder exponent on bounded sets is sharp. This geometry motivates the Multi-objective Regularity-aware (MoRe) method, which retains adaptive MGDA aggregation in the regular regime and switches to a fixed-weight linear scalarization (LS) near degeneracy. The fallback branch skips the MGDA subproblem solve, which can reduce aggregation cost on fallback iterations while avoiding a potentially noise-sensitive update. Theoretically, we establish a per-iterate CA guarantee, and a \(\widetilde{\mathcal O}(T^{-1})\) convergence rate, improving upon the previously established \(\widetilde{\mathcal O}(T^{-1/4})\) SMG guarantee, where \(\widetilde{\mathcal O}\) hides logarithmic factors. Experiments demonstrate favorable multi-task performance and convergence behavior consistent with the theoretical rate.

fields
Optimization and Control
pdf ↗ page arXiv:2607.15412 ↗

We study elliptic superlevel geometry and return dynamics for the class $\mathcal{O}_{C}$. Let $C \subset \mathbb{R}^{N}$ be a compact strictly convex core, and $Ω\in \mathcal{O}_{C}$ a bounded domain whose boundary is a global normal graph over $\partial C$ with inward normals returning to $\operatorname{int} C$. For $-Δu = f$ in $Ω$ ($u=0$ on $\partialΩ$), with $f \geq 0$, $f \not\equiv 0$, $\operatorname{supp} f \Subset \operatorname{int} C$, we analyze the superlevel sets $Ω_{t} = \{u > t\}$ for $t \downarrow 0$. We prove that for small $t > 0$, $\partialΩ_{t}$ is a global normal graph given by $\partialΩ_{t} = \{c + d_{t}(c)ν(c) : c \in \partial C\}$, satisfying $\|d_{t} - d_{0}\|_{C^{1}} = O(t)$ and $d_{t} = d_{0} - t b_{0} + o_{C^{1}}(t)$, where $b_{0}$ depends on the Hopf derivative and transversality. Using normal-graph formulas, we show $Ω_{t} \in \mathcal{O}_{C}$. The return maps $F_{t} : \partial C \to \partial C$ are well-defined, satisfying $\|F_{t} - F_{0}\|_{L^{\infty}} = O(t)$ and $F_{t} = F_{0} + t \mathcal{A}_{0} + o_{L^{\infty}}(t)$. For any sequence $t_{n} \downarrow 0$, the non-autonomous system $x_{n+1} = F_{t_{n}}(x_{n})$ is asymptotically autonomous with background map $F_{0}$. These results bridge elliptic boundary-layer deformation and return-map dynamics relative to a convex core.

fields
Analysis of PDEs
pdf ↗ page arXiv:2607.16912 ↗

We prove a conjecture of Lurie characterizing $(n+1)$-dualizability in higher Morita categories of $\mathbb{E}_n$-algebras in terms of dualizability over certain factorization homologies. A key ingredient is a higher Morita category based on the recently developed framework of pointless factorization algebras of Karlsson and the first author. We also verify an invertibility conjecture of Brochier–Jordan–Safranov–Snyder as an immediate corollary of our main result. Moreover, we prove a relative version of the dualizability conjecture, yielding a new criterion for relative/twisted field theories. We give some examples, including Dirichlet and Neumann relative theories.

comments
85 pages, comments welcome! Additions and changes in version 2: Pushforward functoriality of pointless constructible factorization algebras (Sections 2.2 and 2.3); Comparison of Morse and conical actions of factorization homology (Remark 3.3.9); Various typos and minor inaccuracies fixed
fields
Category Theory, Algebraic Topology, Quantum Algebra
pdf ↗ page arXiv:2607.16953 ↗

The running-time distribution of a randomized algorithm is computed under independent randomness, but independence is rarely what a source guarantees. We study sources $ν$ satisfying $ν[w]\le DP[w]^s$ for every finite prefix $w$ of the random tape, where $P$ is an independent reference law, $0<s\le1$, and $D\ge1$; individual choices may be predictable, even determined by the past. The worst-case probability of any closed tape event $E$ is exactly $\min\{1,DC_s(E)\}$, where $C_s(E)$ is the infimum cost of covering $E$ by prefixes of varying depth, a tree max-flow/min-cut identity that makes worst-case survival probabilities exact and optimizable over the algorithm's choices. Three applications follow. For $n$ tasks on one machine, each retried until the next random symbol lies in its success set, every schedule has the same makespan distribution under independent randomness, yet under our constraint two fixed orders miss a linear deadline with worst-case probabilities $1$ and $\exp[-Θ(n)]$; a static priority rule is optimal at every deadline. For the standard local walk on a $k$-CNF with an assignment that satisfies a majority of each clause, we determine the sharp source threshold $s_*$. Below $s_*$, on some instances a single admissible source forces nontermination however clauses are selected; at $s_*$, with fixed $D$, the expected number of flips is at most cubic in the initial Hamming distance, against linear under independence, with matching worst-case instances; and any fixed margin above $s_*$ restores linear dependence on the distance. Third, verified backtracking for noisy predecessor search remains correct under a sufficiently strong bound on the comparison errors. In every setting the algorithm may also restart, which supplies no fresh randomness; restarting restores exponential tails exactly when the nontermination event has a prefix cover of cost below one.

fields
Combinatorics, Probability
pdf ↗ page arXiv:2607.17469 ↗

We study coalgebra measurings between multiplicative sequences of algebras and the maps induced by them on Hochschild homology. The Hochschild theory of multiplicative sequences is introduced as a functor taking values in graded algebras in the symmetric monoidal category of chain complexes, constructed with the help of the shuffle product. We develop the universal measuring coalgebra, or Sweedler Hom for multiplicative sequences, as well as study several other Sweedler operations in this context. In particular, we obtain an enrichment of multiplicative sequences over cocommutative coalgebras. Using an appropriate theory of bimodules over multiplicative sequences, we study maps induced by comodule measurings on the Hochschild theory with coefficients, as well as the corresponding enriched categories. Finally, we consider measurings and generalized Sweedler operations between multiplicative sequences induced by comultiplicative sequences of coalgebras, and also the maps in Hochschild theory obtained from them.

comments
Sections 2 & 3 completely reorganized
fields
Rings and Algebras, Category Theory
pdf ↗ page arXiv:2607.17470 ↗

This paper develops a systematic theory of complex powers, logarithms, and sectorial projections of elliptic pseudodifferential operators on noncommutative tori, extending to this setting the classical constructions of Seeley and others. Building on the parametric pseudodifferential calculus of the prequel~\cite{LP:Part1}, we construct the complex powers associated with a given ray, show that they form a holomorphic family of pseudodifferential operators with the semigroup property, and compute their symbols. We further establish exponential growth bounds on vertical strips in the operator, Schatten, and trace-class topologies by means of a new holomorphic calculus for pseudodifferential families. The logarithm is identified as a pseudodifferential operator whose symbol is determined by the resolvent symbol, and the associated trace formula is derived. Sectorial projections are constructed as contour integrals and shown to be of order zero. This yields analogues for noncommutative tori of results of Wodzicki, Okikiolu, and Gaarde–Grubb, and provides the analytic foundations for the spectral-geometric applications developed in subsequent papers.

comments
v2: final version, 62 pages. To appear in J. Pseudo-Differ. Oper. Appl
fields
Operator Algebras, Spectral Theory
pdf ↗ page arXiv:2607.17516 ↗

In many quantum applications it is important to know whether or not a Bell nonlocal two-qudit state exhibits its nonlocality under correlation scenarios with some given numbers $S_{1},S_{2}\geq1$ of generalized quantum measurements at two sites. In the present article, we find analytically a new general condition sufficient for a nonseparable Werner state with a dimension $d\leq\min\{S_{1},S_{2}\}$ to satisfy all Bell inequalities under every $S_{1}\times S_{2}$-setting correlation scenario with outcomes of an arbitrary spectral type, discrete or continuous $-$ that is, to be $S_{1}\times S_{2}$-setting Bell local, for short. For a variety of measurement settings $S_{1}, S_{2}$, this new general bound is beyond (i) Werner's and Barrett's locality bounds for a nonseparable Werner state and (ii) the related result by Johnson and Viola [Phys. Rev. A 88, 032323 (2013)] on "sharability" of this state. When specialized to $d = 2$ and $\min\{S_{1},S_{2}\} = 2, 3$, our new general bound improves upon the corresponding results by Terhal et. al. in [Phys. Rev. Lett. 90, 157903 (2003)], moreover, for $d=\min\{S_{1},S_{2}\} = 2$, it reduces exactly to the bound derived for this case via the CHSH inequality. We prove also explicitly in operator terms the result of Terhal et. el. that every nonseparable Werner state with a dimension $d >\min\{S_{1},S_{2}\}$ is $S_{1}\times S_{2}$-setting Bell local. The new results presented in this article are important for both the theory of Bell nonlocality and quantum applications based on this fundamental concept.

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

Thin current sheets are central small-scale structures in electron magnetohydrodynamics (EMHD), closely associated with energy dissipation and fast magnetic reconnection at electron scales. We study their formation numerically in a $2\frac{1}{2}$-dimensional EMHD system on a periodic domain with split fractional dissipation, where the magnetic potential and the vertical magnetic component are damped separately. The local theory is governed by a symmetric combined damping balance, but the numerical onset of small-scale growth need not follow this symmetry. A scaling analysis identifies the out-of-plane current as the primary concentration observable, since it is regularized only through the magnetic-potential equation. Using a validated Fourier pseudospectral exponential time-differencing solver with resolution-controlled diagnostics, we find a clear decay/concentration dichotomy. The onset boundary is markedly asymmetric: current-sheet formation appears to be controlled mainly by damping of the magnetic potential, rather than by the combined damping strength. The analyticity strip collapses to the grid scale, the concentration sharpens under grid refinement, and the observed growth is consistent with an energy-critical self-similar rate, with exponent near three. These experiments indicate that magnetic-potential damping is the apparent binding constraint for current-sheet concentration, refining the symmetric sum picture.

comments
19 pages, 9 figures. Accepted for publication in Communications in Computational Physics
fields
Numerical Analysis
pdf ↗ page arXiv:2607.18648 ↗

Let $L\subseteq\mathbb Z^4$ be a rank-three lattice possessing an admissible basis, and let $S=K[x_1,\ldots,x_4]$ be the polynomial ring over a field $K$. We show that the associated lattice ideal $I_L \subset S$ is generic and that $S/I_L$ is a Cohen–Macaulay ring. We also identify the neighbors of the origin in $L$ and the indispensable binomials of $I_L$. Moreover, we prove that the Betti numbers of $S/I_L$ are $β_0(S/I_L)=1$, $β_1(S/I_L)=7$, $β_2(S/I_L)=12$, and $β_3(S/I_L)=6$. In addition, we show that $I_L$ is a set-theoretic complete intersection over an arbitrary field.

comments
10 pages
fields
Commutative Algebra
pdf ↗ page arXiv:2607.18697 ↗

We prove that monomial coefficients in affine families of key and Schubert polynomials are eventually polynomial. These results extend to finite products. Using M.~Watanabe's Schubert duality, we deduce that stretched Schubert structure constants are eventually polynomial. This proves a conjecture stated by I.~Pak and Z.~Slonim. We also prove that the positive key expansion of every affine-code family of Schubert polynomials eventually has fixed coefficients and affine indices. The proofs combine Demazure operators and vector partition functions with P.~Magyar's orthodontic formula and the generalized Demazure character theory of V.~Lakshmibai, P.~Littelmann, and P.~Magyar.

comments
17 pages, comments welcome. Lean formalization available on request
fields
Combinatorics, Algebraic Geometry, Representation Theory
pdf ↗ page arXiv:2607.18746 ↗

Systems of hard rods of equal length in a one-dimensional harmonic trap have been observed to exhibit peculiar non-ergodic behavior that might suggest the existence of a novel hidden conserved quantity beyond the two well known ones, i.e., the total energy and the center-of-mass energy. In this work, we investigate this possibility by systematically constraining the forms of the conserved quantities, and we rigorously rule out the existence of any extra hidden conserved quantity that is analytic in the positions and momenta of the rods involved. We do so by showing two key results: conservation during free motion demands the $U(1)$ invariance of these quantities under rotations of the position and momenta of each rod, and conservation during collisions demand an $S_N$ invariance under the permutation of the momenta of the rods as long as one of the rods have non-zero length. We then show that these conditions imply that any conserved quantity is functionally dependent on the two known conserved quantities. In addition, we show that in the special case where all rods have zero length (i.e., when they are point particles), conservation under collisions only requires invariance under a smaller $S_N$ group of permutations of the labels of the rods, which leads to a much larger set of analytic conserved quantities that we explicitly write down. In all, this rigorously clarifies the structure of conserved quantities in the hard rod problem, and motivates the application of such systematic methods to other classical systems.

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

Boots and Royle, and independently Cao and Vince, conjectured that the join of an edge and a path on $n-2$ vertices is the unique planar graph of maximum adjacency spectral radius for $n\geq 9$. Tait and Tobin (JCTB, 2017) proved the conjecture for sufficiently large order. In this paper, we completely resolved the Boots-Royle/Cao-Vince conjecture.

comments
18 pages, 2 figures
fields
Combinatorics
pdf ↗ page arXiv:2607.19268 ↗

We show that the set $A(n, d)$ of polynomial automorphisms $F : \Bbb C^n \to \Bbb C^n$ of degree at most $d$ and with $Jac(F ) = 1$ is Zariski closed. In particular every irreducible component of the set $A(n,d)$ of polynomial mappings with Jacobian $1$ is either composed with polynomial automorphisms or (generically) with counterexamples to the Jacobian Conjecture. Moreover every such component has dimension at least $n^2-1.$ In particular if the set $X(n,d)$ is irreducible, and $n\ge 3, d\ge 7$, then a generic element of this set is a counterexample to the Jacobian Conjecture.

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

Metasurfaces, two-dimensional arrangements of subwavelength nanopillars, provide local control over the phase of light, enabling flat optical functions beyond conventional refractive components. Their inverse design, finding the pillar distribution producing a target response, faces two obstacles: the immense dimensionality of the design space and the prohibitive cost of rigorous electromagnetic simulations, precluding exhaustive exploration at device scale. This thesis addresses the challenge in three stages. The first assesses the reliability of rigorous Maxwell solvers: comparing three implementations of Li's factorization rules for RCWA shows that spectral convergence does not guarantee physical fidelity, as these rules implicitly distort the simulated permittivity, most severely in the plasmonic regime. FDTD, immune to such artifacts, is retained as ground truth throughout. The second stage removes the computational bottleneck: a local phase-approximation model, then fully convolutional surrogates trained on FDTD simulations of large pillar metasurfaces, predict the near field almost instantaneously. Exploiting problem symmetries quadruples the training database, and the surrogates generalize to much larger apertures while remaining differentiable. The third stage benchmarks three strategies under a common FDTD protocol ($R^2$ between realized and target far fields): Gerchberg-Saxton retrieval and Local Model ($R^2\approx0.925$), surrogate-based and heuristic-initialized gradient descent ($R^2\approx0.975$), and a generative framework based on diffusion models and Schrödinger bridges. Hybrid posterior sampling and amplitude constraints restore scale-invariant fidelity on surfaces over 230 times larger than training, with diverse, fabrication-tolerant designs. Database enhancement lifts every approach to $R^2\approx0.97$.

comments
Withdrawn by the authors pending major revision. The revised manuscript is subject to a three-year embargo and will be posted after the embargo period ends
fields
Mathematical Physics
pdf ↗ page arXiv:2607.21091 ↗

We propose a model order reduction framework for nonlinear parametrized variational inequalities arising in computational mechanics. The high-dimensional model is written in mixed primal-dual form with projection-based complementarity conditions, leading to nonlinear nonsmooth algebraic systems solved by a semi-smooth Newton method. On this basis, reduced models are constructed by proper orthogonal decomposition (POD) of both primal and dual solution snapshots. To address cases where low-dimensional linear spaces provide limited approximation efficiency, we introduce a neural-network-augmented reduced model. Two feedforward networks learn corrections in the truncated POD coordinates of the primal and dual variables from solutions of enlarged Galerkin ROMs. The learned reconstructions enter the coupled equilibrium and constraint equations directly, defining a nonlinear reduced system solved by approximate semi-smooth Newton iterations. The online cost associated with high-dimensional residual evaluations is reduced through hyper-reduction, using a sparse cubature approach based on greedy nonnegative least squares. The proposed methodology is assessed on two nonlinear variational inequalities with distinct sources of nonlinearity: a two-dimensional obstacle problem with a cubic nonlinearity in the state equation, and a three-dimensional frictional contact problem in which the Coulomb law induces a nonlinear projection in the constraint equation. Numerical results compare the high-dimensional model, the linear reduced model, the neural-network-augmented reduced model, and their hyper-reduced variants, demonstrating accurate approximations with substantial reductions in online computational cost. The performance study also evaluates feasibility over the complete constraint set and measures how errors in the reconstructed obstacle and contact forces affect the primal response.

fields
Numerical Analysis
pdf ↗ page arXiv:2607.21242 ↗

We give a direct differential-geometric proof of a result of Crainic on the cohomology of pullbacks of Lie algebroids under surjective submersions: If the fibers are connected and have vanishing cohomology through degree $n$, pullback with coefficients in any representation is an isomorphism through degree $n$ and is injective in degree $n+1$. The proof reduces to a vanishing result for leafwise cohomology and uses an exhaustion-and-patching argument due to Buchdahl. No local triviality or finite-type assumption on the fibers is required. We also prove the analogous result for holomorphic Lie algebroids.

comments
13 pages
fields
Differential Geometry
pdf ↗ page arXiv:2607.23859 ↗

We present several remarks on cardinal coefficients associated with the generalized Baire space for an inaccessible cardinal kappa. Our inquiry originates in the work of van der Vlugt arXiv:2307.14118 . We provide evidence that the appropriate coefficients to consider are those determined by binary relations restricted to a club. In other words, we make a case for the systematic use of clubs.

fields
Logic
pdf ↗ page arXiv:2607.23923 ↗

We study the strong convergence rate of the Euler–Maruyama scheme for additive stochastic differential equations driven by a fractional Brownian motion with Hurst parameter $H\in(0,1)$. Assuming the drift coefficient to be Lipschitz continuous, we establish strong convergence bounds of order $1$ if $H\in(1/2,1)$, and $1/2+H-\varepsilon$, for any $\varepsilon>0$, if $H\in(0,1/2]$. The main ingredient is a shifted stochastic sewing argument, which exploits the conditional Gaussian structure of fractional Brownian motion to control the noise discretization error.

comments
Accepted version with corrections. The supplementary material has been included
fields
Probability
pdf ↗ page arXiv:2607.24166 ↗

We show that the Levi-Civita connection for the Taub-NUT metric is singular on Misner strings and generates an Einstein tensor containing the squares of the delta function. This can be improved by introducing torsion, in which case the Einstein tensor may be interpreted as that of a cosmic string with negative variable tension. Komar flows in Misner strings are generated by torsion, which is therefore responsible for the asymptotic Komar charges. The Taub-NUT metric then appears as a soliton supported by two spin-fluid beams.

comments
The journal version (slightly expanded)
journal
Phys. Lett. B 882 (2026) 141012
fields
Mathematical Physics
pdf ↗ page arXiv:2607.25654 ↗

This paper proposes a novel physics-guided spectral deep operator network, termed SpectONet, for solving Euler-Bernoulli beam (EBB) vibration problems. The proposed framework integrates the operator-learning capability of DeepONet with physics-informed constraints and Chebyshev-Gauss-Lobatto (CGL) sensor placement. Unlike conventional DeepONet frameworks, which commonly employ uniformly distributed sensors, SpectONet uses nonuniform spectral sensor locations with a higher concentration of points near the domain boundaries. This sampling strategy improves the finite-dimensional representation of boundary-sensitive structural responses while requiring only a limited number of branch-network inputs. The governing beam equation, together with the associated initial and boundary conditions, is incorporated into the training objective to promote physically consistent and generalizable predictions. Numerical experiments on three EBB vibration problems demonstrate the effectiveness of the proposed framework. Comparisons with strong baseline models such as Vanilla DeepONet, PI-DeepONet, PINN, and CNN-UNet show that SpectONet consistently achieves lower prediction errors across all considered evaluation metrics. In particular, SpectONet achieves an average reduction of approximately 79% in the mean relative $\mathcal{L}_2$ error compared with the best-performing baseline across the three benchmark problems. These results demonstrate the effectiveness of SpectONet as an accurate physics-guided operator-learning framework for structural vibration analysis.

comments
30 pages, 15 figures
fields
Dynamical Systems
pdf ↗ page arXiv:2607.25790 ↗

We prove that, for either a Steinhaus random multiplicative function or a Rademacher random multiplicative function $f$, and every $\varepsilon>0$, almost surely $|\sum_{n\le x}f(n)|\ll_{\varepsilon,f}\sqrt{x}(\log\log x)^{1/4+\varepsilon}$. Together with Harper's almost sure lower bound, this determines the sharp logarithmic exponent in both models. This settles Harper's conjecture on the large fluctuations of random multiplicative functions.

comments
v3:AI declaration included
fields
Number Theory, Probability
pdf ↗ page arXiv:2607.29429 ↗

Quantum integrability is a cornerstone of the exact theory of interacting quantum spin chains. In its standard formulation, however, one starts from R-matrices satisfying the Yang–Baxter equation, rather than from the Hamiltonian itself. It has therefore remained unclear how Yang–Baxter solvability can be characterized directly at the Hamiltonian level, and how it is related to the existence of local conservation laws. Here we prove that, in a broad standard setting, the Reshetikhin condition is not only necessary but also sufficient for Yang–Baxter integrability, thereby reducing the hidden algebraic structure of integrability to a Hamiltonian-level conservation law. Since the Reshetikhin condition is equivalent to conservation of the total energy current, this Hamiltonian-level criterion is also experimentally accessible. This result establishes a quantum counterpart of the Liouville–Arnold theorem for isotropic spin chains, stating that Yang–Baxter solvability is equivalent to an infinite hierarchy of local conserved quantities. Our result also simplifies substantially the search for integrable spin chains by replacing the search for R-matrices with a direct criterion on local Hamiltonians.

comments
11 pages, 4 figures, 1 table; Supplemental Material included (24 pages). Code available at https://github.com/sanatanim/reshetikhin and archived at https://doi.org/10.5281/zenodo.21721878
fields
Mathematical Physics
pdf ↗ page arXiv:2607.29660 ↗

Let $G$ be an $n$-vertex graph and let $\ell:V(G)\to\mathbb{F}_2$ prescribe degree parities. A set $S\subseteq V(G)$ is $\ell$-admissible if every $v\in S$ has degree congruent to $\ell(v)$ modulo $2$ in $G[S]$. Let $h_\ell(G)$ be the maximum order of an $\ell$-admissible set, set $f_{\mathrm{oe}}(G):=\min_\ell h_\ell(G)$, and write $f_o(G):=h_{\mathbf{1}}(G)$, where $\mathbf{1}(v)=1$ for every $v\in V(G).$ We prove three main results for graphs without isolated vertices. First, by extending Zeng's odd-cut method to arbitrary parity prescriptions and introducing a one-sided completion lemma, we show that $h_\ell(G)\ge 2n/11$ for every $\ell$. Consequently, $f_{\mathrm{oe}}(G)\ge 2n/11$, improving the previous bound $2n/21$. Second, for bipartite graphs we derive lower bounds on $f_o(G)$ in terms of the $\mathbb{F}_2$-rank of the bipartite adjacency matrix and combine them to obtain \[ f_o(G)\ge \left(\frac14+\frac1{256}\right)n=\frac{65}{256}n. \] Thus, in the bipartite case, the factor $2$ in Scott's bound $f_o(G)\ge n/(2χ(G))$ can be replaced by $128/65<2$. Finally, a fourth-moment argument gives, for $α=α(G)\ge2$ and $δ(G)\ge 1$, \[ f_o(G)\ge \fracα{2}+\frac{\log_3α}{8} -\frac14\log_3\log_3\sqrtα. \] We also construct bipartite graphs satisfying \[ f_o(G)\le \frac{α(G)}2+\log_2\!\bigl(α(G)+1\bigr)+\frac12, \] showing that the logarithmic additive improvement over Scott's bound $f_o(G)\geα(G)/2$ has the optimal order of magnitude.

comments
For $δ(G)\ge 1$, we improved a low bound on $f_{\mathrm{oe}}(G)$ from $n/6$ (in v. 1) to $2n/11.$
fields
Combinatorics
pdf ↗ page arXiv:2608.02339 ↗

We generate infinite binary exchangeable sequences by sequential comparison of data points against a latent benchmark. Assuming a prior distribution of the benchmark rank \(R_0\) within an unobserved group of players, we set up the Bayesian machinery which determines the posterior distribution of the running rank \(R_n\) in purely combinatorial terms, by counting insertion slots in a uniformly random ranking. This yields an explicit predictive probability of winning against the benchmark, which is a rational function of the counts. We identify some cases where the predictive probability has particularly simple form, notably a tournament related to the Topp–Leone distribution. The running benchmark rank is a Pólya urn with random initial composition, and its normalised value converges to a latent strength variable with polynomial density. In a projective time scale, the fluctuations of the normalised rank about this limit are Brownian, with the Wright–Fisher coefficient frozen at the limit, while the associated recurrent up-down Markov chain on a high level $n$ of the Pascal graph is approximated by a Wright–Fisher diffusion with a nonlinear drift expressed through the prior density.

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

We introduce a purely operator-theoretic framework for quantitative homogenization that bypasses the traditional reliance on large-scale spatial regularity and probabilistic assumptions. Inspired by Tartar's vision of a point-free theory, we derive explicit norm resolvent estimates using only the algebraic structure of multiscale operators and the abstract geometry of Hilbert spaces. In this framework, the effective macroscopic dynamics and the abstract corrector emerge naturally from an orthogonal decomposition of the state space, governed algebraically by a Schur complement. To quantify the convergence rate, we introduce a frequency-splitting technique and a flux corrector obtained by inverting the microscopic derivative on the residual field; this controls the error for regular macroscopic data in terms of explicit, $\varepsilon$-independent operator norms. This abstract perspective places on one footing stationary, non-stationary, periodic, quasi-periodic, and stochastic homogenization. We demonstrate that the physical distinctions between these media—and their respective convergence rates—are captured by the behavior of the spectral measure of the microscopic derivative operator, evaluated on the residual field, near zero frequency; in the periodic case the rate $O(\varepsilon)$ is proved, while in the stochastic case the rates are conditional on a density-of-states hypothesis. Furthermore, our results apply for multiscale systems that do not uphold subadditivity of energy quantities or do not have a well-defined Brillouin zone.

comments
62 pages. New results and details are added. Several errors are addressed
fields
Analysis of PDEs, Functional Analysis, Spectral Theory
pdf ↗ page arXiv:2608.05077 ↗

The product of two Cartesian quaternions can be written as a quadratic form based on a 4x4 matrix made of the imaginary numbers i,j,k introduced by Hamilton. We generalized this matrix to non-Cartesian bases, and showed that the matrix is made of the metric and the cross tensors. We called it crossmetric tensor. Its symbols are ia,ib,ic; they are the elementary crystallographic quaternions. We determined the crossmetric tensors for the six crystal families. We also showed that any unit crystallographic quaternion can be geometrically represented by an infinity of pairs of oriented planes intersecting along the vectorial component of the quaternion such that the angle between them is the semiangle of the rotation. The composition of quaternions follows the intuitive source-target rule. The elementary quaternions ia,ib,ic are geometrically represented by pair of perpendicular and oriented planes intersecting along the axis a,b,c, respectively. Three other complementary quaternions were also introduced. They are the pairs of planes ma, mb, mc. The elementary quaternions follow Hamilton rules on the squares of imaginary numbers. The complementary quaternions follow Hamilton rules on the bi and tri-products. For Cartesian basis, the quaternions i,j,k appear as a specific case of crystallographic quaternions. They are formed by the pairs of perpendicular faces of the cube mx, my, mz.

comments
18 pages, 4 figures, 1 appendix
fields
Metric Geometry
pdf ↗ page arXiv:2608.05113 ↗

Let $P_1(n)$ and $P_2(n)$ be the largest and second-largest distinct prime factors of $n$. Alladi and Johnson asked whether there is a bounded function $f$ on the primes such that the averages $\frac{1}{x}\sum_{2\le n\le x}f(P_1(n))$ and $\frac{1}{x}\sum_{2\le n\le x}f(P_2(n))$ converge to different limits, where $f(P_2(n))=0$ when $n$ is a prime power. We show that this cannot happen. In fact, whenever the first average converges, the second also converges to the same limit.

comments
14 pages
fields
Number Theory
pdf ↗ page arXiv:2608.05191 ↗

We study the problem of sampling from target distributions whose potentials are simultaneously non-smooth, subject to superlinear gradient growth, and non-convex. We introduce the Subgradient Tamed Unadjusted Langevin Algorithm (SG-TULA), a discretisation of the Langevin diffusion that operates directly on subgradients, without relying on computationally demanding smoothing procedures. To handle the superlinear regime, taming techniques are employed to produce a stable, explicit scheme. We derive non-asymptotic convergence bounds in Wasserstein-2 distance, with all constants tracked explicitly in terms of dimension and inverse temperature, improving upon the currently known rates for subgradient-based Langevin algorithms. We further provide excess risk estimates for the associated optimisation problem. We verify the assumptions, with explicit constants, for the regularized pretraining potential of a LLM in the GPT-2 lineage and the boosted coordinate-wise variant of SG-TULA pretrains the former competitively against finetuned AdamW and Muon, for which no comparable non-asymptotic guarantees are presently available.

comments
57 pages, 2 figures
fields
Optimization and Control, Probability
pdf ↗ page arXiv:2608.06283 ↗

We study graphs containing no cycle whose length is divisible by $3$ or congruent to $4$ modulo $6$. We prove that every such $n$-vertex graph $G$, where $n \ge 2$, satisfies $e(G) \le (11/8)n-7/4$. Moreover, equality holds if and only if $n=8k+2$ for some nonnegative integer $k$ and $G$ is isomorphic to the explicitly constructed graph $H_k$. We also construct, for every $n\geq2$, an $n$-vertex graph with $\left\lfloor (11/8)n-7/4 \right\rfloor$ edges satisfying the same cycle restriction. Consequently, this is the exact maximum number of edges for every $n \ge 2$.

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

We study Multi-Level Aggregation with Maximum Delay (MLA-MD) on finite weighted rooted trees. Each service pays for a rooted subtree and for the maximum waiting time among the requests it clears. For the offline problem, we give an exact polynomial-time algorithm that computes both the optimum and an optimal service schedule. For the online problem, we give a deterministic $2$-competitive algorithm and, against an oblivious adversary, a randomized $e/(e-1)$-competitive algorithm. Both competitive ratios are optimal, even on rooted paths. We also extend the offline result and both online guarantees to service systems with submodular costs.

fields
Optimization and Control
pdf ↗ page arXiv:2608.06796 ↗

Molecular motion within living cells provides a window into the physical principles underlying intracellular organization and transport. Yet a fundamental limitation remains: measured trajectories are often short, noisy, and randomly oriented, rendering spatial anisotropies inaccessible to conventional analyses. We show that turning-angle statistics provide a robust approach for uncovering anisotropies in anomalous diffusion. Using a two-dimensional anisotropic fractional Brownian motion model with random orientations, we show theoretically and through simulations that turning-angle distributions preserve signatures of anisotropy. We apply this approach to single-particle tracking data, including quantum dots in the cytoplasm of HeLa cells and membrane proteins in hippocampal neurons. Turning angles reveal hidden anisotropies in the motion of quantum dots and Kv1.4 channels, and in specific dynamical states of glycoprotein CD4. These results establish turning-angle analysis as a powerful strategy for detecting organization in complex environments and reveal that anisotropic anomalous diffusion is an {often} overlooked feature of intracellular dynamics.

comments
Main text: 22 pages, 6 figures; Supplementary information: 14 pages, 7 figures
fields
Probability
pdf ↗ page arXiv:2608.07975 ↗

In this paper, we establish several new bounds for the distributional sectional category ($\mathrm{dsecat}$). We first prove Jauhari's conjecture, thereby establishing a cohomological lower bound for $\mathrm{dsecat}$ with arbitrary coefficients. We then obtain an analogous lower bound with rational coefficients by constructing a natural graded $\mathbb{Q}$-linear section of the homomorphism induced in cohomology by the symmetric diagonal. As applications, we provide several computations of the distributional sectional category. We also establish multiplicative product and composition inequalities for $\mathrm{dsecat}$. Finally, we apply these results to distributional homotopic distance. A sequential version of this invariant was recently introduced by Jauhari and Oprea; we give an equivalent formulation in terms of distributed homotopies and derive new fibration and multiplicative triangle inequalities.

comments
31 pages. The paper has been revised with minor edits to improve its clarity and conciseness. In particular, the section on H-spaces has been removed, and several redundant passages have been eliminated to make the presentation more focused
fields
Algebraic Topology
pdf ↗ page arXiv:2608.08298 ↗

We study variable screening for high-frequency continuous-time regression, targeting the support of the spot regression coefficient. Under coordinatewise truncation and finite-variation jumps, uniform entrywise bounds for local correlation estimates yield the rate $\{(\log p)/n\}^{α/(2α+1)}$ under a local averaged $α$-Hölder condition, up to confidence and grid factors. These bounds imply sure screening for the marginal support. To retain the regression support under local dependence, we propose partial-residual spot iterative screening with pathwise Lepski adaptation. Under sparse eigenvalues and standardized beta-min, the procedure has the sure screening property and requires only correlation columns associated with the current active set. A list-size minimax lower bound applies to both support targets and matches the localization and multiplicity order of the marginal-screening bound when $\log(p/d)\asymp\log p$. Simulations and a high-frequency factor application illustrate the procedures.

fields
Statistics Theory
pdf ↗ page arXiv:2608.08582 ↗

Let $A$ be a complex abelian variety with $\NS(A)=\Z[L]$, $L$ ample. We show that a vector bundle filtered by line bundles splits uniquely into unipotent blocks, determine when it is ACM with respect to $L$, and show that it is never Ulrich. For a rank-two Ulrich bundle we bound from below the degree of the defect of every saturated line subbundle, compute the Hilbert polynomial of the defect, and show that the bound is attained exactly when an explicit cohomological support locus is nonempty. On abelian surfaces this locus is an ample curve in $\Pic^0(A)$; as a consequence, every rank-two Ulrich bundle is a Serre extension of a fixed numerical type, which we characterize and construct for every ample $L$. For $g\ge3$, we reduce the equality case to the existence of subcanonical codimension-two subschemes with prescribed cohomology.

comments
19 Pages, Updated, All comments are welcome
fields
Algebraic Geometry
pdf ↗ page arXiv:2608.09163 ↗

Polyhedral outer approximation (OA) is widely used to solve mixed-integer second-order cone programs (MISOCPs) by iteratively strengthening polyhedral relaxations of conic constraints. However, the accumulation of cutting planes can increase the difficulty of solving the resulting mixed-integer linear programs (MILPs), while repeatedly solving these MILPs can be computationally expensive. To address these challenges, we investigate the geometry of supporting cuts and the computational role of integrality in OA. First, we establish theoretical bounds showing that the marginal contribution of a new supporting cut decreases at least linearly as its supporting direction approaches an existing one. Motivated by this analysis, we develop a closed-form cut-generation strategy that balances separation depth and directional diversity. Second, we propose a progressive-integrality OA framework that strengthens the polyhedral approximation through linear programs and partially integral relaxations before solving full MILPs. We theoretically characterize the transfer of cut-induced bound improvements across integrality levels and provide a branch-and-bound interpretation of the framework. Computational experiments on CBLIB instances and large-scale AC unit-commitment models demonstrate substantial improvements over classical OA and direct MISOCP solution, with runtime reductions of up to 62\% relative to classical OA on the reported power-system instances.

fields
Optimization and Control
pdf ↗ page arXiv:2608.10055 ↗

In this paper, we define topological and measure-theoretic entropy scales in dynamical systems for the scaling introduced by Helfter. Firstly, we establish a variational principle between Bowen and lower entropy scales on compact subsets. Secondly, we prove factor inequalities for Bowen and upper capacity entropy scales on arbitrary subsets; unlike the classical additive case, the fiber contribution is described by a transfer function and need not be additive. We also study entropy scales and sequence entropy scales under the induced action. Under suitable conditions, zero values are preserved in both directions, while positive values become infinite; counterexamples show that additional assumptions are generally necessary. As an application, we use entropy scales to distinguish zero-entropy systems sharing the same entropy dimension but differ in finer orbit-growth rates.

fields
Dynamical Systems
pdf ↗ page arXiv:2608.10460 ↗

We prove Sobolev space well-posedness of the decoupled potential integral equations. Using basic pseudo-differential techniques, discrete stability is obtained for the standard $L^2$-pairing, and we deduce spectral convergence for high-order schemes employing discontinuous basis functions, or with additional element-wise tangential continuity imposed in the vectorial part of the system. The schemes are shown to be much better conditioned than a mature commercial EFIE/CFIE solver. In many cases appearing almost independent of wavenumber, mesh density, and the order.

comments
20 pages
fields
Numerical Analysis
pdf ↗ page arXiv:2608.10799 ↗

We study the landscape function on a discretized interval. The discrete landscape has an explicit closed form, and its spectral coefficients can be computed exactly. We show that these coefficients lie in explicit abelian extensions of $\mathbb{Q}$ and obtain the bound $$[\mathbb{Q}(c_k(N)):\mathbb{Q}]\leq\varphi(N)$$ for every odd $k$. The Chandra–Jain conjecture, asserting that $[\mathbb{Q}(c_1(N)):\mathbb{Q}]=\varphi(N)$ for all $N\geq3$, has since been proved by Q. Zhou (Zenodo, doi:10.5281/zenodo.21935814). We then reduce higher modes to the coprime case. Exact computations for all 624 pairs with $3\leq N\leq50$ reveal only the degrees $\varphi(N/d)$ and $2\varphi(N/d)$ for non-coprime modes, where $d=\gcd(N,k)$. This motivates the Second Chandra–Jain Conjecture that this degree dichotomy holds generally. We also discuss connections with parity, the Arnold cat map, and Lefschetz numbers.

comments
v3: revised landscape exposition and clarified cyclotomic degree arguments. added notes on degree dichotomy for non-coprime higher modes following discussion of original conjecture and its resolution by Q. Zhou
fields
Dynamical Systems, Number Theory
pdf ↗ page arXiv:2608.11372 ↗

Coherences between different energy levels are strongly constrained by thermodynamics. Here we ask whether several coherence transfers that can be optimized separately can also be optimized simultaneously by the same thermodynamic process. Using an energy-resolved Stinespring representation of thermal operations, we express elementary transfer amplitudes as inner products of bath-weighted vectors. Joint saturation imposes collinearity and phase-closure conditions on these vectors, which must all arise from one energy-preserving system–bath unitary. This gives necessary compatibility conditions for arbitrary finite-dimensional Hamiltonians. We show that joint incompatibility persists in a system with both degenerate and nondegenerate energy levels: rigorous computer-assisted semidefinite-program bounds, combined with explicit thermal constructions, prove that three individual thermal optima cannot be approached simultaneously. We then determine how well different coherences can be protected when their optima are incompatible. For a four-level family at infinite temperature, we obtain the complete closed retention region and the cost of balancing the coherences relative to their individual optima. At positive temperature, covariance and Gibbs preservation permit joint retention that no thermal operation can approach. Finite-bath constructions and certified semidefinite relaxations bound the balanced thermal performance. When two coherences carry independent phases, these bounds describe simultaneous preservation of interference visibility and phase Fisher information.

comments
27 pages, v2: some clarifications about reasons and sources of joint obstruction in coherences transfer made, v3: slightly rewritten version
fields
Mathematical Physics
pdf ↗ page arXiv:2608.11872 ↗

In this paper, we establish two improved Liouville-type theorems for the three-dimensional stationary tropical climate model without imposing any temperature assumptions. Compared with previous results, we achieve significant improvements on the growth assumptions imposed on $u$, $v$ and $\nabla v$. Owing to the special structure inherent to the equations, we fully exploit the $L^2$-estimate for the oscillation of the temperature, refined interpolation techniques and an iteration argument to establish a Liouville-type theorem under flexible and relaxed power-law growth conditions. As an interesting consequence, we obtain the triviality of solutions under the integrability conditions imposed only on $(u,\nabla v)$ or $(\nabla u,\nabla v)$. Furthermore, by developing a systematic framework to handle the energy function associated with the non-trivial solutions and with the aid of delicate ODE analysis and a contradiction argument, we refine our Liouville-type theorem by introducing logarithmic corrections to the growth rates.

comments
Made some corrections
fields
Analysis of PDEs
pdf ↗ page arXiv:2608.13149 ↗

We prove sharp norm comparisons between positive Toeplitz operators associated with the same positive Borel measure, acting respectively on holomorphic functions and on sums of holomorphic and antiholomorphic functions, both equipped with the Gaussian-weighted $L^2$ norm. For every positive Borel measure $μ$ on $\mathbb{C}^n$ and $0<p<\infty$, both operators are compact with summable $p$th powers of their singular values (i.e. Schatten) exactly when $z\mapstoμ(B(z,r))$ belongs to $L^p(\mathbb{C}^n)$ for some fixed radius $r>0$. For other weights, this agreement can fail dramatically. We construct a weight $e^{-2φ}$ and a finite positive measure $μ$ on $\mathbb{C}$ for which the operator on holomorphic functions has the same singular values as with the Gaussian weight and the same measure $μ$. These values have summable $p$th powers for every $p>0$, yet the quadratic form on sums of holomorphic and antiholomorphic functions is unbounded in weighted $L^2$. The example still satisfies $Δφ=2$, as for the Gaussian choice $φ(z)=|z|^2/2$.

comments
25 pages. v3: Streamlined exposition, with greater emphasis on the example where the holomorphic operator belongs to every Schatten class while the pluriharmonic Toeplitz form is unbounded
fields
Functional Analysis, Complex Variables
pdf ↗ page arXiv:2608.13550 ↗

This paper presents a comprehensive study of the characteristic polynomial of matrix tuples and finite dimensional group representations. Among other things, several key concepts are introduced, including the minimal polynomial, algebraic extension, spectral index and multiplicity, and characteristic graph. Notably, this framework leads to a complete resolution of Kippenhahn's conjecture by providing necessary and sufficient conditions for its validity.

comments
49 pages, 2 figures
fields
Representation Theory, Spectral Theory
pdf ↗ page arXiv:2608.14194 ↗

For $d \geq 2$, $p \geq 1$ and $ε> 0$, let $N_p(d,ε)$ be the smallest integer $N$ such that for every integer $n$ and every $A\in\mathbb{R}^{n\times d}$, there exists a matrix $Φ\in\mathbb{R}^{N\times n}$ satisfying $(1-ε)\lVert Ax\rVert_p\leq \lVertΦA x\rVert_p\leq (1+ε)\lVert Ax\rVert_p$ for all $x\in\mathbb{R}^d$. For every constant $p\geq 1$ with $p\not\in 2\mathbb{Z}$, when $d\gtrsim_p \log(1/ε)$, the bound \[ N_p(d,ε) \gtrsim_{p} \frac{d}{ε^2 \operatorname{polylog}(d/ε)} \] is established. This improves the previous lower bound $Ω(1/(ε^2\operatorname{polylog}(1/ε)))$ due to Li et al. (SICOMP 2021) and is optimal up to logarithmic factors for $1\leq p<2$. The central technical idea originated from ChatGPT 6 Pro.

comments
Simplified the construction of hard instance
fields
Functional Analysis
pdf ↗ page arXiv:2608.14201 ↗

We investigate structural properties of Lie affgebras, viewed as affine analogues of Lie algebras. We introduce the notion of an ideaf, the affine counterpart of an ideal, and establish characterizations of left and right ideafs. We further study centers, quotient structures, and product ideafs, proving, under suitable conditions, that the center of a Lie affgebra is an ideaf. We then develop the notion of affine nilpotency and establish connections between the nilpotency of Lie affgebras and that of their retracted Lie algebras. As an application, we prove an Engel-type theorem for Lie affgebras of the form $\mathfrak{a}(\mathfrak{g};κ=2λ,λ,s)$.

comments
22 Pages
fields
Rings and Algebras
pdf ↗ page arXiv:2608.15190 ↗

Let $k\ge1$ be an integer and let $λ$ be the Liouville function. In 1965, Chowla gave a conjecture that the values of $λ(n+h_1),\dots, λ(n+h_k)$ are asymptotically unrelated for any distinct natural numbers $h_1, \dots, h_k$. In this article, motivated by the recent work of Bergelson and Richter on the dynamical generalizations of the prime number theorem, we will show a dynamical generalization of Chowla's conjecture on average. In the proof, we follow an approach of Qi and Zheng who established a variant of Bergelson and Richter's theorem over irreducible binary cubic forms. Moreover, we will use this approach to show an analogue of the dynamical Chowla's conjecture along the primes on average. In 2016, Tao proved that the two-point logarithmic Chowla's conjecture holds. Recently, Charamaras and Richter generalized Tao's theorem to bounded arithmetic functions and proposed a conjecture that generalizes Chowla's conjecture to bounded multi-variable arithmetic functions. Building on their work, we prove a dynamical generalization of Tao's theorem and a variant for the composition of the sum-of-digits function with the prime Omega function.

comments
The first two main results in this article have been extended in arXiv: 2609.14492v1. So we integrate these two preprints into one. This one is removed, and the other is kept. preprint at arXiv: 2608.16108v3
fields
Number Theory, Dynamical Systems
pdf ↗ page arXiv:2608.16108 ↗

Reflective Grounded Arithmetic (RGA) is a paracomplete arithmetic allowing direct expression of any general-recursive computation. Every RGA term is a program and truth is grounded evaluation, with a proof certificate at each universal quantifier. This paper shows, in a machine-checked Isabelle/HOL development, that such a system is powerful enough to carry out its own metamathematics. A fuel-indexed decider of RGA's grounded semantics and checkers for RGA's proofs are compiled primitive-recursive RGA terms. RGA proves internally that its decider never affirms $0 = 1$, and that every well-formed term it affirms has an RGA proof accepted by a transparent test. RGA proves that, for each valid RGA proof, its conclusion is true. RGA proves that each grounded-true well-formed term is provable. RGA proves that no proof in either of two decided classes of RGA proofs derives $0 = 1$. Gödel's incompleteness theorems hold for RGA, but their proofs must be adapted. In RGA an implication $A \rightarrow B$ is strictly stronger than an entailment $A \vdash B$: RGA discharges a hypothesis only when it can prove the hypothesis decided, a restriction needed to defuse Curry's paradox. RGA's implication is material and RGA has the disjunction property, so RGA proves no implication between ungrounded sentences. The implications that the textbook proof of Gödel's second theorem uses are of this kind and fail, but the entailments and rules it uses hold: Gödel's proof survives as entailments. RGA does not prove its consistency sentence $\mathit{Con}$: RGA carries out Gödel's argument internally, with a decided proof predicate and explicit proof transformers, and only the last step, that RGA does not prove $0 = 1$, is left to HOL. RGA also proves its own second incompleteness theorem as an entailment from $\mathit{Con}$, and as a single sentence quantified over proofs.

comments
title adjusted and substantially revised; now 177 pages
fields
Logic
pdf ↗ page arXiv:2608.16140 ↗

We study integrable variable-mass sine-Gordon model (vmSG) with point defects. Using the Lax and Bäcklund-gauge formulations, we construct type-I and type-II defect matrices, derive the corresponding sewing conditions, and generate the bulk and defect contributions to an infinite hierarchy of conserved charges. The lowest members reduce to the standard sine-Gordon energy and momentum in the homogeneous limit, while for inhomogeneous backgrounds they define integrability-generated energy- and momentum-type quantities. Defect compatibility imposes matching conditions on the variable-mass functions across the defect. An analytical transmission factor $z$ characterizes soliton transmission, topological conversion, and absorption/emission processes. We then deform the type-I sewing conditions by parameters $α$ and $β$ and derive the associated defect anomalies. Consistent one-soliton transmission is recovered for $αβ=1$, whereas for $αβ\neq 1$ parity-centered kink-kink and kink-antikink transmissions display vanishing lowest order integrated anomalies but no generic vanishing at higher order. Numerical simulations reproduce the integrable transmission/conversion regimes and show that non-integrable defects generate small residual disturbances and lowest order quasi-conserved charges, while quasi-conservation of the higher order charges remains unestablished. These results elucidate how exact defect integrability deforms into charge-dependent quasi-conservation and establish a framework for defect-controlled soliton transport in inhomogeneous media, with potential applications to nonuniform Josephson junctions, magnetic and nonlinear-optical systems, and effective molecular and DNA models.

comments
71 pages, Latex. 16 Figs. New figures and error norms;convergence of the reflected and radiated disturbances; fitting interval, objective function, and uncertainties have been added. Various Appendices added
fields
Mathematical Physics
pdf ↗ page arXiv:2608.17211 ↗

For a semi-arithmetic Fuchsian group $Γ$ of arithmetic dimension $r$ with a generalized modular embedding, EGMM holds for $r\leq2$, and for $r\geq3$ under an explicit \emph{strong contraction condition}, via a multi-dimensional Schwarz-Pick bound and a geometry-of-numbers estimate. A covering construction turns every known example into an infinite explicit family with the same exponent via principal congruence towers. We add new $r\leq2$ examples (genus-$3$/$4$ Prym eigenform loci, a different commensurability class from the known triangle groups and McMullen genus-two family) and attempt a direct flat-geometric bound on the contraction constant $δ$ for the latter via its Lyapunov exponents ($δ=2/3$ on ergodic average, by Bainbridge exact computation), explaining why an average bound does not yet certify the pointwise one \eqref{eqstrong-contraction} needs.

fields
Functional Analysis
pdf ↗ page arXiv:2608.17604 ↗

For a ring $R$, let $\mathcal{GP}(R)$, $\mathcal{GF}(R)$, and $\mathcal{PGF}(R)$ denote the classes of Gorenstein projective, Gorenstein flat, and projectively coresolved Gorenstein flat left $R$-modules, respectively. We answer negatively the question whether $\mathcal{GP}(R)=\mathcal{PGF}(R)$ for every ring. More precisely, over every field $k$ we construct a left and right coherent central $k$-algebra $T$ and a strongly Gorenstein projective left $T$-module which is not Gorenstein flat; hence $\mathcal{PGF}(T)\subsetneq\mathcal{GP}(T)$.

comments
This paper has been withdrawn by the author, as its results are superseded by arXiv:2608.17748v3
fields
Rings and Algebras
pdf ↗ page arXiv:2608.18722 ↗

This paper relates the minimal Harder–Narasimhan slope to the surjectivity of real-linear Cauchy–Riemann operators. We establish a conformally invariant $L^2$ criterion and an asymptotic slope criterion, which yield higher-rank automatic transversality criteria for pseudoholomorphic curves beyond the classical rank-one framework. Applications to pseudoholomorphic spheres in $S^6$ provide quantitative $L^2$ obstructions to the integrability of almost complex structures.

comments
Corrected the proof of the main surjectivity criterion using weighted $L^2$ estimates, with the main results unchanged. 33 pages. Comments welcome
fields
Symplectic Geometry, Complex Variables, Differential Geometry
pdf ↗ page arXiv:2608.18997 ↗

In this article, we introduce and study the class $\mathcal{M}_r(H)$ of minimum attaining operators on a separable Hilbert space $H$ whose restrictions to every nonzero reducing subspace are minimum attaining. This class lies between the classes of absolutely minimum attaining operators and minimum attaining operators. We establish a spectral characterization of positive operators in $\mathcal{M}_r(H)$: a positive operator $T$ belongs to $\mathcal{M}_r(H)$ if and only if $T=\sum_{λ\inΛ}λP_λ$, where $Λ\subseteq[0,\|T\|]$ is a countable well-ordered set, $(P_λ)_{λ\inΛ}$ is a family of mutually orthogonal nonzero projections, and $\sum_{λ\inΛ}P_λ=I$ in the strong operator topology. We also establish a connection between $\mathcal{M}_r(H)$ and the class of operators attaining their norm on every nonzero reducing subspace. Further, we obtain stability results under suitable finite-rank and compact perturbations, and prove that $\mathcal{M}_r(H)$ is norm dense in $\mathcal{B}(H)$. We also establish the norm density of operators in this class having a nontrivial invariant half-space. Finally, we characterize normal operators in $\mathcal{M}_r(H)$, obtain a corresponding characterization for multiplication operators on $L^2(\mathbb{T})$, and characterize the condition $\mathcal{R}_T=\mathcal{R}_{|T|}$ in terms of the von Neumann algebra generated by $|T|$, showing that this condition forces $T$ to be normal.

comments
Submitted to a journal. Some of the earlier results modified. Comments and suggestions are welcome
fields
Functional Analysis, Operator Algebras
pdf ↗ page arXiv:2608.19286 ↗

Let $G$ be a group, let $\mathbb{K}$ be a field, and let $V$ be a $\mathbb{K}$-vector space. We prove that there exists a bijective linear cellular automaton $V^G\to V^G$ whose inverse is not a cellular automaton if and only if $G$ is not locally finite and $\dim_{\mathbb{K}}V \geq |\mathbb{K}|^{\aleph_0}$. In particular, $|\mathbb{K}|^{\aleph_0}$ is the exact dimension threshold for non-reversibility. This answers an open problem proposed by T. Ceccherini-Silberstein and M. Coornaert.

comments
10 pages
fields
Group Theory, Dynamical Systems
pdf ↗ page arXiv:2608.20600 ↗

We prove that for every prime power $q$ and every $p \in (0, 1-1/q)$, a random $\mathbb{F}_q$-linear code of rate $1 - h_q(p) - ε$ is $(p, C_{p,q}/ε)$-average-radius list-decodable with probability at least $1 - q^{-Ω(n)}$, i.e., for every center $y \in \mathbb{F}_q^n$, the $C_{p,q}/ε$ codewords closest to $y$ have average fractional Hamming distance at least $p$ from $y$. This extends a similar result for (standard) list-decoding due to Guruswami, Håstad, and Kopparty (2010) to the stronger average-radius guarantee, with the same $O(1/ε)$ list size. For average-radius list-decoding, such a result was previously known only for binary linear codes (Guruswami, Li, Mosheiff, Resch, Silas, and Wootters, 2021) and for general (non-linear) random codes over arbitrary alphabets (Elias, 1991).

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

We derive convergence guarantees for mirror descent and proximal mirror descent with a logarithmic barrier as the distance-generating function. When the solution lies on the boundary, the Bregman divergence blows up and classical guarantees become vacuous. While existing remedies recover $O(\log k/k)$ rates by adapting classical bounds, we propose a more direct route in which the Bregman distance to the solution never appears, and which achieves the same rate with constant stepsize. We also construct an example showing that this rate cannot be improved in general. Finally, we compare the proposed approach with interior-point methods.

comments
18 pages
fields
Optimization and Control, Numerical Analysis
pdf ↗ page arXiv:2608.22834 ↗

This work develops tensor-train (TT) formulations for solving large-scale three-dimensional linear elasticity problems discretized by isogeometric analysis. By exploiting the tensor-product structure of the basis functions and the low-rank structure of geometry-dependent coefficient fields, the stiffness operator, mass operator, force vector, and displacement solution are represented in TT format. Two solution strategies are investigated: a block-operator formulation, in which the coupled elasticity operator is stored as separated TT blocks, and a single-operator formulation, in which the full coupled system is stored as one monolithic TT operator. A matrix-free three-field TT conjugate-gradient solver is introduced for the block formulation, while AMEn is used for the single-operator formulation. Numerical examples demonstrate substantial compression of both operators and solutions compared with conventional sparse full-grid representations, showing that TT-based formulations provide an efficient and scalable approach for large-scale three-dimensional elasticity simulations.

fields
Numerical Analysis
pdf ↗ page arXiv:2608.23595 ↗

We study axisymmetric self-similar solutions of the stationary Navier–Stokes equations with $(-3)$-homogeneous forces and no-slip boundary conditions in a half-space. For a fixed force without swirl, we characterize the interval of amplitudes for which solutions exist and describe the velocity singularity at its finite endpoints. For each parameter in this interval, a solution exists after adding a swirl force of any size, and it is unique among solutions with bounded profiles when the swirl force is sufficiently small. The proof uses the nonnegative contribution of swirl to a Riccati equation and a comparison estimate. We also prove that, when the tangential curl of the force is sufficiently small, there exists a unique solution with small velocity profiles.

comments
26 pages; comments are welcome!
fields
Analysis of PDEs
pdf ↗ page arXiv:2608.25432 ↗

We consider the radially symmetric version of the reaction-diffusion equation $u_t-dΔu=f(u)$ with a monostable nonlinearity $f$, viewed as a model for the spreading of a species with population range $r<h(t)$ and density $u(t,r)$ ($r=|x|$), where the free boundary $r=h(t)$ is governed by $u(t,h(t))=δ>0$ and $h'(t)=-d u_r(t,h(t))/δ$. For the one-dimensional case ($N=1$), Du \cite{DN} proved that when $δ\in(0,1)$, spreading occurs: $u\to1$ locally uniformly in $\mathbb{R}$, $h(t)\to\infty$, and $\lim_{t\to\infty}[h(t)-c_*t]=\tilde{h}\in\mathbb{R}$ with no logarithmic shift. In the present paper we consider $N\ge2$ and establish a complete trichotomy: spreading for $δ\in(0,1)$; transition for $δ=1$, where $u\to1$ uniformly on $[0,h(t)]$ and $h(t)\to h_\infty\in(0,\infty)$; and vanishing for $δ>1$, where $h(t)\to0$ and $u\toδ$ uniformly on $[0,h(t)]$. For the spreading regime, by constructing sharp upper and lower solutions, we prove that the solution converges globally to the semi-wave profile and reveal a logarithmic shift of the form $ \lim_{t\to\infty}\big[h(t)-c_*t+c_N(δ)\log t\big]=\hat{h}\in\mathbb{R}$, with the coefficient $c_N(δ)>0$ satisfying $ \lim_{δ\to0}c_N(δ)=d(N-1)/c_0$, where $d(N-1)/c_0$ is the shift coefficient for the high-dimensional radial pushed-case Cauchy problem. These results reveal the connection to the spreading behavior modeled by the corresponding Cauchy problem.

fields
Analysis of PDEs
pdf ↗ page arXiv:2608.25672 ↗

We study Eratosthenes sieve as a discrete dynamic system. At each stage of the sieve there is a cycle of gaps ${\mathcal G}(p^\#)$ of length $φ(p^\#)$ and span $p^\#$. There is a recursion ${\mathcal G}(p_k^\#)\longrightarrow {\mathcal G}(p_{k+1}^\#)$ that creates the next cycle from the current one. If we take initial conditions from the cycle ${\mathcal G}(p_0^\#)$, then for all constellations of span $|s| < 2p_1$, including gaps $g < 2p_1$, the driving terms of various lengths form Markov chains. These yield {\em exact} models for the populations $n_s(p_k^\#)$ for all further stages of the sieve. If $s$ is an admissible constellation of length $J$, then its population $n_{s,J}(p^\#)$ grows as $Θ\left( \prod (q-J-1)\right)$. So we factor out the superexponential growth to obtain the exact model for the relative population $w_s(p_k^\#)$ of the constellation $s$ across all further stages of the sieve. $$ w_{s,J}(p_k^\#) \; = \; n_{s,J}(p_k^\#) \, / \, \prod_{J+1 < p \le p_k} (p-J-1) $$ The asymptotic value of the relative population is a constant ${w_{s,J}(\infty) \ge 1}$ that depends only on the odd prime factors that divide a span in $s$. Assuming that the instances of a constellation $s$ are approximately uniformly distributed in ${\mathcal G}(p_k^\#)$, we develop initial estimates of the number of instances $s$ that would occur in the interval of survival $ΔH(p_k) = (p_k^2, p_{k+1}^2)$. We define a statistic $η_s(p_k)$, the quadratic density of the constellation $s$ over the interval $ΔH(p_k)$. We show that the initial estimates $\widehat{η_g}(p)$ for prime gaps agree with samples up to $5.677\,E14$.

comments
27 pages, 14 figures
fields
Number Theory
pdf ↗ page arXiv:2608.26384 ↗

Our results imply, in particular, that a finitely generated solvable group $G$ is nilpotent if and only if it contains a solution to any unimodular equation, i.e., an equation of the form $\prod g_ix^{n_i}=1$, where $g_i\in G$ and $\sum n_i=\pm1$. A similar fact turns out to be true for Lie algebras. We also exhibit an example of a unimodular equation $w(x)=g$ over a finitely generated group $G$, which has a solution (in $G$) for any $g\in G$, but the solution is not unique for some $g\in G$. We show that, for nilpotent groups $G$, the set of unimodular mappings $G^n\to G^n$ (which are defined naturally) forms a group under the composition.

comments
10 pages. A Russian version of this paper is at http://halgebra.math.msu.su/staff/klyachko/papers.htm . V3: References to robots' recent achievements have been added, some misprints have been corrected
fields
Group Theory
pdf ↗ page arXiv:2608.28045 ↗

We investigate two families of central elements of the queer super Yangian ${\rm Y}(\mathfrak{q}_1)$, arising from the constructions of Poletaeva-Serganova and from Nazarov's quantum Berezinian. We establish an explicit relation between their generating series, thereby giving an answer to the question raised by Nazarov in \cite{Na22}.

comments
final version, to appear in JMP
fields
Quantum Algebra
pdf ↗ page arXiv:2608.30293 ↗

Di Nezza–Guedj–Lu asked whether local Arnold multiplicities under maximal weak twisted Kähler–Ricci flow with fixed cohomology class satisfy $λ(\varphi_t,x)=\max\{λ(\varphi_0,x)-t,0\}$. We construct counterexamples with analytic initial singularities in every dimension $n\ge2$. On the Hirzebruch surface $\mathbb F_e$, $e\ge2$, the initial current $[S]+(e+1)[F]$ yields $λ(\varphi_t,x)=1/2-t/e$ for $x\in S\setminus F$ and $0<t<e/2$, where $S$ is the negative section and $F$ a fibre. Products with smooth stationary factors give higher-dimensional examples. The Zariski negative part of $\{S\}+\{F\}$, the reduced support class, forces extra divisor mass. For pure divisorial data with simple normal crossings support, a smooth semipositive representative of the reduced support class's positive part gives exact short-time formulas. On one surface we construct flows with identical initial current germs, background data and global initial Arnold multiplicity, but different local rates.

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

Uniform-state discrete diffusion models update all tokens in parallel while keeping every position revisable. Even when the commonly used top-$p$ rule leaves only one candidate at a position, that choice affects only the current reverse step and can be revised at the next sampling step. We ask what changes when selected hypotheses instead become persistent context for later predictions. We therefore propose committed reveal sampling (CRS), a training-free sampler that stores selected argmax tokens and inserts them into subsequent model inputs. Our analysis separates persistent context from truncation. Within one reverse step, adaptive top-$p$, randomized or not, reproduces the update induced by a visible token only when a likelihood-ratio ordering holds, while in a simple latent-mode model, keeping the selected token visible helps later parallel predictions agree on the same sequence-level choice. Empirically, paired experiments on Duo-distilled then separate this persistent effect from single-step top-$p$ restriction and scalar temperature scaling. Under the same finalization rule, CRS without top-$p$ truncation reaches lower generative perplexity (GenPPL) than fixed $p=0.95$ and $p=0.9$ baselines across budgets of 8–64 function evaluations (NFE). At 64 NFE, the comparison at matched unigram entropy also gives lower GenPPL for CRS, shifting the GenPPL–entropy tradeoff under this metric. Base Duo shows the same direction in a descriptive comparison, while other diversity and continuation metrics can rank these operating points differently. A distributional distance to held-out text (SOL) under a fixed GPT-2-Large representation also decreases with persistent context at the same late top-$p$ threshold. These results identify support restriction and persistent context as distinct controls of that tradeoff.

comments
29 pages, NeurIPS 2026 DiffuLM workshop
fields
Probability
pdf ↗ page arXiv:2609.01043 ↗

The Modulo Krinkle tilings of Imura (arXiv:2506.07638) form a family of non-periodic, spiral monohedral tilings parametrized by a reduced fraction $m/k$ and an integer $t\ge 2$. We show that the Farey sum (mediant) $(m_1+m_2)/(k_1+k_2)$ of two Farey-adjacent parameters is realized by an exact geometric operation on prototiles: the lower boundary path of the $(m_1+m_2,k_1+k_2)$-prototile is obtained by concatenating the parents' lower paths after an edge-length-preserving progressive rotation (fan-twist) of their edges. Conversely, every prototile admits exactly one fan-twist splice decomposition -- no non-adjacent parameters ever splice -- the cut position being $k_1=m^{-1}\bmod k$, and the recursion descends the Stern-Brocot tree to a single unit edge. The combinatorial core of the operation is the classical standard factorization of Christoffel words; the contribution here is its exact edge-isometric realization on circular direction systems and the resulting structure theory for the Modulo Krinkle family, including the recently introduced variants: we prove a separation theorem stating that every variant prototile is the common recursively-generated core plus finitely many direction-invariant decoration edges. As a corollary of Imura's spiral-arm count formula, the two Farey parents are visible in the offset-free tiling itself: the numbers of counterclockwise and clockwise spiral arms are $tk_1$ and $tk_2$.

comments
13 pages, 6 figures. Ancillary files contain two JavaScript verification scripts (run with Node)
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2609.01270 ↗

We prove uniform endpoint estimates, killed local limits, and conditioned-bridge invariance principles for triangular arrays of centered, aperiodic, integer-valued random walks with uniform exponential tails. The endpoint estimates cover all nonnegative heights, while the local limits treat positive diffusive and zero endpoints. The increment law may vary with the scaling parameter.

comments
17 pages, 1 figure. Simplified the proof of Lemma 3.1
fields
Probability
pdf ↗ page arXiv:2609.02257 ↗

This paper shows that the optimal gain of the risk-sensitive linear quadratic regulator (LQR) problem is invariant under input randomization when the cost penalizes the realized noisy input. This may appear counterintuitive at first glance because certainty equivalence does not hold for risk-sensitive LQR and input randomization inflates the effective process noise. Nonetheless, the gain is preserved because the input noise enters not only the system dynamics but also the cost functional, and its total effect eventually vanishes. Consequently, the optimal gain and the Riccati recursion need not be recomputed, and the increment in the optimal cost can be readily evaluated in closed form. This result facilitates the use of risk-sensitive LQR in applications that employ input randomization for privacy or exploration, such as dynamic watermarking for replay attack detection.

comments
6 pages, revised extended version submitted to IEEE L-CSS and ACC 2027, including Section III-F
fields
Optimization and Control
pdf ↗ page arXiv:2609.02363 ↗

Let A be a d-by-n integer matrix of rank d, let beta belong to the d-dimensional complex vector space, and consider the A-hypergeometric system defined by the ideal H_A(beta), with relation lattice L equal to the integer kernel of A. No homogeneity, pointedness, or positivity assumption is imposed on A. We study directed formal logarithmic solutions simultaneously over all exponent lattices in the Euler fiber over beta, which form an uncountable family when L has positive rank. For a fixed L-generic direction, negative-support strata are described by rational sign polyhedra, and their directional boundedness is characterized by recession cones. On each exponent lattice, normalization reduces the infinitely indexed coefficient equations to a finite system of Euler, transit, and directional vanishing relations, represented by a finitely presented directional coefficient module. We prove that only finitely many exponent lattices contribute nonzero directed solution spaces and that every contributing coefficient module has finite length. Macaulay inverse-system duality then identifies the dimension of the all-lattice directed formal logarithmic solution space with the length of the all-lattice coefficient module. We also give an explicit formal-series realization and a polynomial colon-ideal criterion for all realizable lowest exponents.

fields
Algebraic Geometry
pdf ↗ page arXiv:2609.02449 ↗

For every $β>0$, we establish multi-time soft-edge moment convergence for a class of Jack processes, including the Jack–Plancherel process, a discrete $β$-analogue of Dyson Brownian motion. The limiting moments admit an absolutely convergent expansion in terms of nonnegative Brownian bridges decorated by pairs of equal and opposite jumps. At equal times, we identify this limit with the joint Laplace statistics of the Airy$_β$ process for $β\geq1$. The same Brownian expansion yields an asymptotic $β$-topological expansion of the marginal $b$-conjecture and, at $β=2$, an explicit nonnegative formula for the Witten–Kontsevich intersection numbers.

comments
67 pages, 3 figures. Minor revision and added a short section about the moment convergence of the general Jack processes
fields
Probability, Mathematical Physics, Algebraic Geometry, Combinatorics
pdf ↗ page arXiv:2609.03532 ↗

We introduce a reduced-order learning framework that couples a convolutional autoencoder to a structured latent neural ordinary differential equation. A learned scalar generates the latent dynamics through an antisymmetric operator and a positive-definite dissipative operator. The antisymmetric component permits motion along scalar level sets, while the dissipative component decreases the scalar. Adding a coercive quadratic term gives bounded continuous-time latent trajectories and approach to the scalar's critical set under the stated assumptions. The scalar provides a structural constraint rather than an approximation of physical energy. The encoder, decoder, scalar, and operators are trained jointly on short snapshot windows without time-derivative supervision, physical-energy labels, or dissipation penalties. At inference, one initial state is encoded and evolved continuously in latent space, with decoding only at requested times. We demonstrate the framework on micromagnetic magnetization trajectories from NIST $μ$MAG Standard Problem 4 and compare it with dissipative-only dynamics and an unstructured latent neural differential equation. Repeated training runs show competitive observed-horizon accuracy, while selected longer rollouts illustrate improved retention of approximately stationary states relative to the unstructured baseline. These results motivate scalar-generated latent dynamics as an inductive bias for reduced-order prediction and other learning tasks where bounded evolution and equilibrium behavior are important.

comments
37 pages, 19 figures
fields
Numerical Analysis
pdf ↗ page arXiv:2609.04530 ↗

In quantum information theory, the state space of a multipartite quantum system is modeled by a tensor product. In the tensor-product space $\C^{d_1}\otimes\cdots\otimes\C^{d_p}$, a nonzero vector is a \emph{product state} if it can be written as $\ket{\varphi_1}\otimes\cdots\otimes\ket{\varphi_p}$ with $\ket{\varphi_j}\in\C^{d_j}\setminus\{0\}$. An \emph{unextendible product basis} (UPB) is a finite family of pairwise orthogonal product states such that no nonzero product state is orthogonal to all of them. UPBs play a key role in investigating quantum entanglement and nonlocal phenomena. Finding a smallest UPB is a natural extremal problem: it asks how few pairwise orthogonal product states suffice to prevent any further product state from being added. The general minimum-size problem for UPBs has been studied for over two decades since the seminal work of Alon and Lovász. Let $f_m(d_1,\ldots,d_p)$ be the minimum cardinality of a UPB in the space, and let \(f_{LB}(d_1,\ldots,d_p)=1+\sum_{j=1}^{p}(d_j-1)\) be the natural lower bound. Alon and Lovász determined exactly when \(f_m\) attains the lower bound \(f_{LB}\), but the obstructed multipartite cases remained open in general. We prove a stabilization theorem: for every non-all-qubit system with $p\ge3$, whenever the natural lower bound $f_{LB}$ is unattainable, the true minimum is exactly $f_{LB}+1$. Precisely, if the number of even local dimensions $d_i$ is positive and even, and at least one local dimension is greater than two, then \(f_m(d_1,\ldots,d_p)=f_{LB}(d_1,\ldots,d_p)+1\). The proof is built on a unified graph-theoretic framework. Our result, together with earlier work, settles the minimum size problem for UPBs in all finite quantum systems.

fields
Combinatorics
pdf ↗ page arXiv:2609.05657 ↗

We prove that, for every sufficiently large modulus $q\not\equiv2\bmod4$, at least $3/8-o(1)$ of the primitive Dirichlet characters $χ$ modulo $q$ have $L(1/2,χ)\ne0$. We also establish stronger proportions for moduli $q$ satisfying certain arithmetic conditions.

comments
v3: missing AI declaration now included
fields
Number Theory
pdf ↗ page arXiv:2609.06167 ↗

We prove that, for every $k\ge2$ and every sufficiently large odd $n$, the induced size–Ramsey number of $C_n$ satisfies \[ \widehat R_{\mathrm{ind}}(C_n;k)=e^{Θ(k)}n. \] This improves the previous upper bound of $e^{O(k\log k)}n$ and resolves a conjecture of Bradač, Draganić and Sudakov. We obtain this result by proving a stronger form of their odd-hole gadget conjecture: we construct a graph with $e^{O(k)}$ edges whose every $k$-edge-colouring contains a monochromatic induced odd cycle of length $O(\log k)$. Our proof develops a spread-based approach to finding induced cycles. The key idea is to place spread probability weights directly on families of candidate cycles and control their possible chords through a quadratic chord score. Combining this with random sparsification and hypergraph containers yields a sparse host graph that works for every $k$-edge-colouring.

fields
Combinatorics
pdf ↗ page arXiv:2609.06481 ↗

We prove that the Dirichlet $p$-torsion function $u_p$ converges to the distance to the boundary $d$ at the rate $O(1/p)$ in the uniform norm, on every bounded domain and with a constant depending only on the dimension and the diameter. The upper bound comes from a radial barrier with its pole at a boundary point, which is an admissible comparison function for $p>n$ and needs no boundary regularity; the lower bound comes from an inscribed ball. On the ball the error equals $(1+\log n)/p+O(p^{-2})$, so the order $1/p$ cannot be improved in general. Under a uniform exterior ball condition an annular barrier gives $u_p\le K_Ω^{1/(p-1)}d$ for every $p>1$, with $K_Ω$ explicit in the dimension, the diameter and the exterior radius; on convex sets the constant is the diameter, and a multiple of $d$ is a supersolution whenever $-Δd$ has a positive distributional lower bound. On $C^2$ domains, the same barrier and the classical gradient maximum principle give $\norm{\nabla u_p}_{L^\infty}^{p-1}\le K_Ω$. When $-Δd$ is a measure of finite total variation, which we prove for $C^1$ domains with a uniform exterior ball, the gradients converge in $L^q$ at the rate $O(p^{-1/2})$ for $q\le2$ and $O(p^{-1/q})$ for $q\ge2$; these exponents are not claimed to be sharp. The explicit ball profile shows that the gradients do not converge uniformly.

fields
Analysis of PDEs
pdf ↗ page arXiv:2609.06534 ↗

We study seven Eulerian-type polynomial families. We prove that the descent polynomials of derangements are real-rooted, settling the derangement part of a conjecture of S.~Fu, Z.~Lin, and J.~Zeng. We also resolve the real-rootedness conjecture in OEIS A335340, strengthen the known rowwise real-rootedness of an even-top descent family to consecutive strict interlacing, and prove real-rootedness, consecutive interlacing, and real-rooted gamma-polynomials for U.~Shankar's super-Eulerian polynomials. A differential recurrence gives consecutive weak interlacing for ternary words counted by increasing runs. We prove stability of the peak-value refinement and consecutive interleaving of its positive weighted diagonals, settling a conjecture of P.~Alexandersson and O.~Nabawanda. Finally, we prove that the zig-zag Eulerian polynomials, which enumerate swaps in alternating permutations, have simple negative roots, settling the real-rootedness conjecture of T.~Kyle Petersen and Y.~Zhuang.

comments
28 pages, comments welcome. Theorems are Lean formalized, see https://peralexandersson.github.io/RealRooted/
fields
Combinatorics
pdf ↗ page arXiv:2609.07325 ↗

We consider the full two-dimensional water-wave equations in finite depth, with and without surface tension. Water waves have been studied mathematically for more than two centuries. Reflection symmetry remains a common assumption in constructions of periodic steady waves, although asymmetric profiles have been observed in experiments and numerical computations. We construct families of periodic stationary solutions whose free surfaces have no axis of reflection, in both the pure-gravity and capillary–gravity cases. To the best of our knowledge, this provides the first rigorous construction of asymmetric periodic pure-gravity waves for the full two-dimensional water-wave problem in finite depth. The proof combines localized vorticity laws with a Lyapunov–Schmidt reduction. In the pure-gravity case, we introduce a small background shear flow to obtain an invertible boundary operator and couple the interior and free-surface approximations at leading order.

fields
Analysis of PDEs
pdf ↗ page arXiv:2609.08150 ↗

Permutation pattern avoidance on Ferrers boards has become a central topic in enumerative combinatorics with important connections to matchings, set partitions, and other combinatorial structures as it allows one to build families of Wilf-equivalent patterns. While shape-Wilf-equivalence classes have been completely determined for individual patterns and pairs of patterns of length three, the corresponding classification for larger pattern sets has remained open. In this paper, we provide a complete classification of the shape-Wilf-equivalence classes of triples of patterns of length three. Our proofs use a bijective encoding of pattern avoiding transversals to establish all equivalence classes. As an application, we enumerate matchings avoiding triples of patterns of length three for all, extending previous results of Bloom and Elizalde. These enumerative results identify additional families of combinatorial objects counted by the Fuss-Catalan numbers and by other integer sequences appearing in the OEIS.

comments
This is version 2, here we solved two open problems proposed in version 1
fields
Combinatorics
pdf ↗ page arXiv:2609.08562 ↗

For $k\ge3$, a $k$-angulation is a simple $2$-connected outerplane graph whose interior faces are bounded by $k$-cycles, and a closed $k$-angulation is a simple $2$-connected plane graph all of whose faces are bounded by $k$-cycles. Their face hypergraphs have the same vertices as the graphs; the hyperedges are the vertex sets of the interior faces, respectively all faces. For $k=3$, the extremal problems over these hypergraphs agree with those for the outerplanar and planar $3$-uniform hypergraphs of Ellingham, Lu and Wang, who determined the outerplanar maximizer for large $n$ and conjectured the planar one. In this paper, for each fixed $k$, we determine the hypergraphs of maximum spectral radius in both classes for all sufficiently large $n$ satisfying the corresponding face-count divisibility condition. In the outerplanar case, the unique extremal hypergraph is the face hypergraph of the fan, in which one vertex lies on every interior face. In the planar case with $k=3$, it is the face hypergraph of $K_2+P_{n-2}$, which confirms the conjecture of Ellingham, Lu and Wang. For $k\ge4$, the extremal hypergraphs are the face hypergraphs of balanced theta graphs, in which two vertices lie on every face. For $k=4$, the result holds for every $n\ge5$, with extremal hypergraph ${\mathcal H}(K_{2,n-2})$. For $k\ge6$ and an even number of faces, there are exactly $\lfloor(k-2)/2\rfloor$ extremal hypergraphs up to isomorphism.

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

Let $\overline{po}_k(n)$ denote the number of $k$-colored overpartitions of $n$ into odd parts. For every odd number of colors, we establish infinite families of internal congruences modulo high powers of $2$. The proof proceeds by expressing the relevant difference generating functions as a fixed theta quotient multiplied by polynomials in an auxiliary function. Uniform lower bounds for the $2$-adic valuations of the polynomial coefficients then yield the stated internal congruences. These results generalize an internal congruence of Saikia, Sarma and Sellers (J. Ramanujan Math. Soc.~2025) on overpartition triples into odd parts.

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

Berger and Coburn showed that boundedness of a Toeplitz operator $T_g$ on the Fock space controls the heat transform $g^{(t)}$ for $1/4<t<1$, and conjectured that $T_g$ is bounded if and only if $g^{(1/4)}$ is bounded. Looi recently disproved the forward implication by constructing a bounded $T_g$ with unbounded $g^{(1/4)}$. We prove that the reverse implication also fails, even for a real-valued admissible symbol $g$ with $g^{(1/4)}\in C_0(\mathbb{C}^n)$, and that the forward implication fails even when $T_g\in S_p$ for every finite $p>1$. Our counterexamples come from Baire category and closed graph arguments, which yield no explicit symbols. Despite this two-sided failure, the forward implication has a sharp Schatten-class form: $\|g^{(1/4)}\|_\infty\le 2^n\|T_g\|_{S_1}$ for every admissible symbol $g$ with $T_g$ trace class. We show that the constant $2^n$ is optimal and that the same estimate holds with $S_p$ in place of $S_1$ for $T_g\in S_p$ when $0<p\le1$. For $p>1$, no corresponding uniform estimate holds, even for smooth compactly supported symbols. We also determine the optimal constants in the Berger–Coburn estimates for $1/4<t\le1$. Finally, for $1\le p<\infty$, we show that the equivalence $T_g\in S_p$ if and only if $g^{(1/4)}\in L^p$ holds exactly when $p=2$, answering a question of Bauer, Coburn, and Isralowitz.

fields
Functional Analysis
pdf ↗ page arXiv:2609.11853 ↗

We determine the exact $L^p(\mathbb{R})$ norm of the centered Hardy–Littlewood maximal operator for every $1<p<\infty$, proving that it equals $p/(p-1)$. This settles the sharp strong-type problem for the centered maximal operator on the real line. For every $p$ in this range, the norm is strictly larger than the constant associated with the critical power $|x|^{-1/p}$, thereby disproving the conjecture of Dror, Ganguli, and Strichartz that this profile determines the unrestricted norm.

comments
14 pages. This paper was merged into https://arxiv.org/abs/2610.10247
fields
Classical Analysis and ODEs, Probability
pdf ↗ page arXiv:2609.12440 ↗

By studying wall crossings of Hassett moduli spaces of weighted pointed curves, we prove a recursive formula that reduces the computation of the cohomology of $\overline{\mathcal M}_{g,n}$ to that of the moduli space $\overline{\mathcal M}_{g,(0^+)^n}$ of stable pointed curves of minimal weights. For $g=1$, we further prove an explicit formula for the Hodge-Deligne and Poincaré polynomials of $\overline{\mathcal M}_{1,(0^+)^n}$. Combining these, we prove formulas that enable us to compute the cohomology of $\overline{\mathcal M}_{1,n}$ efficiently.

comments
14 pages, 1 figure. Fixed typos. References updated
fields
Algebraic Geometry
pdf ↗ page arXiv:2609.12507 ↗

We prove that any embedded genus zero free boundary minimal surface in the ball has first Steklov eigenvalue $1$. This implies the uniqueness of the critical catenoid.

comments
Comments welcome!
fields
Differential Geometry
pdf ↗ page arXiv:2609.13054 ↗

In 1965, Chowla conjectured that the signs of the Liouville function become asymptotically uncorrelated at any fixed collection of distinct shifts. In 2015, Matomäki, Radziwiłłand Tao proved an averaged form of Chowla's conjecture. In 2022, Lichtman proved a variant of this conjecture over primes on average. In the same year, Lichtman and Teräväinen proved the Hardy-Littlewood-Chowla conjecture on average. In this article, motivated by the recent work of Bergelson and Richter on the dynamical generalizations of the prime number theorem, we will first establish the analogous dynamical generalizations of these three results related to Chowla's conjecture. In the proofs, we follow an approach of Qi and Zheng who established a variant of Bergelson and Richter's theorem over irreducible binary cubic forms. In 2016, Tao proved that the two-point logarithmic Chowla's conjecture holds. Recently, Charamaras and Richter generalized Tao's theorem to bounded arithmetic functions and proposed a conjecture that generalizes Chowla's conjecture to bounded multi-variable arithmetic functions. Building on their work, we will also prove a dynamical generalization of Tao's theorem and some variants for the composition of the sum-of-digits function with the prime Omega function.

comments
41 pages. The main results in this article has been merged with the preprint at arXiv: 2608.16108v3
fields
Number Theory, Dynamical Systems
pdf ↗ page arXiv:2609.14492 ↗

Finite-horizon prediction is challenging when observations are limited and a quantity of interest depends on several coupled nonlinear measurement channels. This paper develops a three-phase data-driven twin framework that integrates finite-horizon Hankel–Koopman energy decomposition, inverse-calibrated reconstruction using nonlinear autoregressive models with exogenous inputs, and forecast composition. Channel dynamics are identified and simulated in Hankel coefficient space, with candidate models assessed after reconstruction in physical measurement space. The resulting reduced-order model of the channel dynamics drives recursive prediction of the quantity of interest. Three theorems support the framework, establishing the energy decomposition and modal orthogonality; existence, uniqueness, and inverse stability of the auxiliary continuous inverse-calibration solution; and finite-horizon stability of the composed forecast for a fixed selected model under stated assumptions. A retrospective solar-power case study yields high correlations between predicted and reference trajectories across the considered forecast horizons, demonstrating reproduction of a constructed channels-dependent quantity of interest.

fields
Numerical Analysis
pdf ↗ page arXiv:2609.14501 ↗

This paper focuses on difference-of-convex (DC) composite optimization problems with set-inclusion and manifold constraints. We develop an inexact proximal-linearized nonsmooth exact penalty (NEP) method that penalizes the conic constraint while retaining the manifold constraint explicitly. At each outer iteration, the method approximately solves a strongly convex proximal-linearized subproblem over the current tangent space, using computable inexactness criteria, adaptive parameters, and a retraction-based acceptance mechanism. Under boundedness of the iterates and penalty parameters, we establish an $O(ε^{-2})$ worst-case outer iteration complexity for finding an $ε$-approximate KKT point of the original problem. We further develop a complexity-transfer framework relating uniform primal objective-gap and KKT-residual decay, or dual objective-gap decay, to total inner-iteration complexity bounds. This yields an $O(ε^{-4})$ overall oracle complexity with either accelerated semi-proximal ADMM or FISTA applied to the dual subproblem as the inner solver. Using semi-proximal ADMM as the inner solver improves the bound to $O(ε^{-2}\log(1/ε))$ under an additional uniform error-bound condition. We further establish convergence of the entire iterate sequence to a KKT point under the same boundedness assumption and the Kurdyka-Lojasiewicz property of the associated potential function. Numerical experiments demonstrate the competitive performance of the proposed method on row-sparse PCA, clustering, robust SVMs, and nonconvex SOCPs.

comments
59 pages, 4 figures, 5 tables
fields
Optimization and Control
pdf ↗ page arXiv:2609.14564 ↗

Given a real square matrix $A$ and a nonempty closed target set of complex matrices $\mathcal{E}$, invariant by complex conjugation and containing real matrices, does the subset of $\mathcal{E}$ consisting of the matrices nearest to $A$ in the Frobenius distance always contain a real matrix? We give negative answers when $\mathcal{E}$ is either the set of normal matrices (solving a question posed by N. Higham) or the set of matrices whose eigenvalues lie in the closed left half-plane (solving a question posed by the first author and F. Poloni). For the latter problem, we also argue that the ratio between the real and complex distances is unbounded in every dimension $n\geq 3$, and this holds for every distance induced by a unitarily invariant norm. For both problems and $n \geq 3$, we show that a real input $A$ uniformly drawn from the unit sphere $\|A\|_F=1$ has no real minimizer over $\mathcal{E}$ with probability strictly between $0$ and $1$. Beyond these two cases, we prove for an arbitrary nonempty closed target sets $\mathcal{E}$ that, for almost every real input, either $\mathcal{E}$ contains a unique nearest matrix which is real, or every nearest matrix in $\mathcal{E}$ is nonreal.

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

We study the Perron extremal solutions of the stationary one-phase Bernoulli problem. These solutions are important in several applications, but not much is known about the regularity of their free boundaries due to their non-variational construction. We show that, in fact, Perron extremal solutions retain some variational features; specifically, they are solutions in the sense of inner variations. We establish this property by showing that extremal solutions arise as infinite-time limits of monotone solutions of the parabolic Bernoulli problem. As a consequence, we are able to describe the structure of singularities for Perron extremal solutions in two dimensions: largest subsolutions have smooth free boundaries, while smallest supersolutions have free boundary points that are either smooth, or whose blow-up limits are two-plane wedges with equal slope.

code
github.com/willmfeldman/bernoulli-perron-variational ∎ Lean project (challenges/main-results/lakefile.toml, challenges/main-results/lean-toolchain) builds, no sorry at 2abc332, checked 2026-10-27 build details
fields
Analysis of PDEs
pdf ↗ page arXiv:2609.14981 ↗

We investigate how Heegner points detect the finiteness of the $p$-primary part of Tate-Shafarevich groups of semi-stable elliptic curves over the rationals of \emph{arbitrary} rank with any good reduction prime $p \geq 5$ with irreducible mod $p$ representation and partially recover Çiperiani–Wiles' theorem on solvable points on genus one curves. As a key ingredient of the proof of these results, we also give a concise proof of Kolyvagin's conjecture for semi-stable elliptic curves with supersingular reduction with a relevant choice of an imaginary quadratic field. Our approach is independent of the cyclotomic Iwasawa main conjecture for elliptic curves with supersingular reduction.

comments
Reference updated and no content change; comments welcome
fields
Number Theory
pdf ↗ page arXiv:2609.15328 ↗

Let $\mathbb O$ be the real octonion division algebra, let $\mathfrak g_2=\operatorname{Der}(\mathbb O)$, and fix a quaternionic subalgebra $H\subset\mathbb O$. We ask when an element $Z$ preserving $H$ and its conjugate $TZT^{-1}$ generate $\mathfrak g_2$, where $T$ is a prescribed involutive octonion automorphism. We prove that such a $Z$ exists if and only if $T(H)\ne H$. Moreover, a fixed set of six derivations preserving $H$ contains a generating choice for every such $T$. For an arbitrary $Z\in\mathfrak g_2$, we construct a polynomial criterion with two factors: one detects reducibility on the imaginary octonions, and the other detects generated algebras of dimension at most three. An irreducible proper generated algebra must be a principal $\mathfrak{su}(2)$. We characterize the elements admitting this case by their rotation frequencies and parametrize all corresponding involutions. For one specified involution and quaternionic subalgebra $H$, we describe the nongenerating set by four geometric families and six irredundant systems of scalar equations, and prove that it has real dimension four.

comments
36 pages, 4 tables. Substantially revised and reorganized version; title changed. The exposition is self-contained relative to the technical companion. The revision adds prerequisite material, guided examples, explicit derivations of the two Gram certificates, and corrections and clarifications following referee review
fields
Rings and Algebras, Group Theory
pdf ↗ page arXiv:2609.15497 ↗

We first verify the expected calculations of the topological structure set, in the sense of surgery theory, for the total spaces of $S^{4k-1}$-bundles over $S^{4k}$ for $k\ge3$, in which manifolds homotopy equivalent to the total spaces are organized. Next, we investigate the question of which of the elements in these structure sets can be realized as such bundles. Moreover, we study the forgetful map from the smooth version to the topological version of the structure set; we determine its image. All elements in the image turn out to have the underlying manifold such a bundle.

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

We establish a probabilistic Lie-Trotter-Kato formula for the gradient flow generated by an integral function over suitable separable Hadamard spaces. This result leverages Stojković's Lie-Trotter-Kato formula for gradient flows of sums of convex functions and Bačák's result relating resolvent and gradient flow convergence, along with a strong law of large numbers for normal convex integrands. For separable Hilbert spaces and locally compact Hadamard spaces, these strong laws follow from results of King and Wets and Artstein and Wets, respectively, but we crucially go beyond these examples by establishing a new such strong law for normal convex integrands on all Hadamard spaces whose tangent cones are isometric to Hilbert spaces, a class that includes non-Hilbertian, non-locally compact examples such as infinite-dimensional hyperbolic space. This new strong law arises as a combination of a strong law of large numbers for integrable random monotone vector fields on Hilbert-Hadamard spaces, that is, Hadamard spaces whose tangent cones all embed isometrically into Hilbert spaces, extending a result of Salim from Hilbert spaces, together with a new result on the interchangeability of the subdifferential and the integral, which we establish for $L^2$-Lipschitz integrands. This latter ingredient provides, to our knowledge, the first nonlinear version of (a particular case of) a previous result due variously to Ioffe and Tikhomirov, Levin, Hiriart-Urruty, Thibault as well as Rockafellar and Wets. On the way to this strong law for random monotone vector fields, we also establish a distribution-uniform generalization of Sturm's strong law of large numbers for inductive means of $L^1$-sequences of i.i.d. random variables on Hadamard spaces via a new effective non-asymptotic concentration inequality. Throughout the paper, we highlight various remaining open problems.

comments
46 pages
fields
Metric Geometry, Optimization and Control, Probability
pdf ↗ page arXiv:2609.16439 ↗

We prove the conjecture of Ding and Mossel~\cite{DM}: the lazy random walk on the discrete cube, censored to any increasing set of fixed positive density, mixes in time $O(n\log n)$. More precisely, for every nonempty increasing set $A\subseteq\{0,1\}^n$, with $a=μ(A)$ and $μ$ uniform on the cube, we prove $$ t_{\mathrm{mix}}(P)\le C_a n\log(en), $$ where $C_a$ depends only on $a$. The proof uses hypercontractivity on the ambient cube to strengthen the Poincaré inequality on coordinate sections. An optimal stopping time occupation inequality for increasing sets converts the resulting local bound into a uniform bound on hitting times of large sets. An appendix by Y.~Peres improves the density dependence to $C_a=13a^{-1}\log(e/a)$, within a logarithmic factor of the conjectured $a^{-1}$ dependence.

comments
23 pages
fields
Probability
pdf ↗ page arXiv:2609.16515 ↗

In this paper, for $N=8,12,16,20,32$, we determine the explicit structure of the graded algebra of modular forms for $\varGamma_0(N)$ of both integral and half-integral weights, with all quadratic Dirichlet characters modulo $N$. We give explicit eta quotient generators and determine the relations among them. Using these structures, for a given weight, a level among those considered above, and a quadratic character, we obtain a basis for the corresponding space of modular forms consisting of eta quotients. Using these eta quotient bases, we obtain necessary and sufficient conditions for the periodicity of the signs of the Fourier coefficients of modular forms in three specific spaces. Finally, we determine all eta quotients in these spaces whose Fourier coefficient signs are periodic.

comments
17 pages, 3 tables
fields
Number Theory
pdf ↗ page arXiv:2609.18339 ↗

In this paper, we investigate the existence of maximal algebraic two-sided ideals in nonunital $C^*$-algebras. We formulate singular-distribution estimates in terms of lower semicontinuous $2$-quasitraces and introduce a novel criterion, which we call an admissible compact quasitracial triple set. These tools allow us to control membership in algebraic ideals and to prove the nonexistence of maximal ideals in nonunital $C^*$-algebras under a closed finite-scale face condition. This nonexistence result applies to a broad class of simple $C^*$-algebras including simple separable stable AF algebras, and nonunital, simple, separable, stably finite, $\mathcal Z$-stable $C^*$-algebras $A$ that admit an approximate identity consisting of increasing projections $(p_n)$ and for which the simplex $\operatorname{QT}_2^1(A,p_1)$ of normalized traces at $p_1$ has finitely many extreme points. Moreover, we construct a simple AF algebra whose finite-scale face is dense but not closed and which nevertheless has a maximal dense algebraic ideal. This example yields a negative resolution to a question raised by Ozawa, asking whether every maximal algebraic two-sided ideal in a $C^*$-algebra must be closed.

comments
v3:A negative resolution to Ozawa's original question has been added. v2:Results have been strengthened and arguments have been simplified
fields
Operator Algebras
pdf ↗ page arXiv:2609.18840 ↗

Let $G$ be a compact connected semisimple Lie group, and let $π:G\to U(V_λ)$ be a finite-dimensional irreducible unitary representation associated with the highest weight $λ$. We prove that coherent projectors are the unique minimizers of the Wehrl entropy over all density matrices on $V_λ$. Similar extremal properties hold for power functions in place of the entropy function. The proof uses a second variation at the extremizer by perturbation in directions associated with Killing fields, similar to the strategy of Frank and Lieb used in \cite{FrankLieb}. Then the problem reduces to the uncertainty principle characterizing coherent states. This solves the Wehrl-type entropy problem for arbitrary compact connected semisimple Lie groups.

comments
11 pages. Reformulated the proof using minimum uncertainty. Simplified some arguments. Updated the exposition and references
fields
Mathematical Physics, Functional Analysis, Representation Theory
pdf ↗ page arXiv:2609.18919 ↗

A biharmonic conformal immersion asks whether a hypersurface can become a critical point of the bienergy after a conformal change of the domain metric. We study when this flexibility can produce compact nonconstant-mean-curvature geometry in space forms. For surfaces in three-dimensional space forms, with $U=λ^2H$, Ou's system is encoded exactly by a Laplace-type operator acting on a restricted ambient Killing spinor. We classify all monic scalar–chiral factorizations of this operator. In nonzero curvature such a factorization exists locally exactly when the principal curvatures are locally constant; the normalized Euclidean branch is equally rigid, and the remaining real spherical non-CMC branch is excluded by a finite-type Frobenius obstruction. For $m>2$, this scalar rigidity does not imply geometric nonexistence. The conformal tension has independent normal and tangential components. We prove that $\mathbb Rξ\oplus TM$ is the minimal natural $O(m)$-equivariant carrier, derive the corresponding strongly elliptic Jacobi block and its two-grade Clifford realization, and identify off-diagonal hybridization as the escape mechanism. Exact cohomogeneity-one reductions, combined with validated interval and Chebyshev/radii-polynomial arguments, yield embedded proper non-CMC, nowhere-umbilical examples in round spheres, including $$ S^1\times\mathbb S^n\times\mathbb S^n\hookrightarrow\mathbb S^{2n+2} \qquad(n\ge1). $$ Thus the scalar obstruction is sharp with respect to coefficient bundle: the smallest enlargement forced by conformal tension already supports compact non-CMC solutions.

comments
67 pages
fields
Differential Geometry
pdf ↗ page arXiv:2609.20197 ↗

Let $S(Q,M,N,(a_n))=\sum_{q\le Q}\sum_{a\bmod q^2,(a,q)=1}|\sum_{M<n\le M+N}a_ne(an/q^2)|^2$ be Zhao's large sieve sum with square moduli. Zhao conjectured that $S\ll(QN)^ε(Q^3+N)\sum|a_n|^2$. The bound of Baier and Zhao (2008) exceeds this conjecture by a factor which reaches $Q^{1/2}$ at the critical point $N=Q^3$, and there the exponent $1/2$ has not been lowered since. We prove that, under Hooley's Hypothesis $R^*$ for short Salié sums, $S\ll(QN)^ε(Q^3+N+Q^{4/3}N^{2/3})\sum|a_n|^2$. This replaces the excess over Zhao's conjecture by its $2/3$-th power throughout the range $Q^{5/2}<N<Q^4$; at $N=Q^3$ it gives $S\ll Q^{1/2-1/6+ε}N\sum|a_n|^2$. The proof is short. Following Zhao's original treatment, we approximate the point under consideration by fractions $b/r$ with denominators up to $Q^{2/3}N^{1/3}$, which for $N<Q^4$ is beyond the customary $\sqrt{N}$. If the approximation is poor, an elementary count suffices. If it is good, the analytic part of the problem disappears: after Poisson summation in both variables the count is expressed through quadratic Gauss sums, and their exact evaluation at every modulus turns the sum over the dual variable into short Kloosterman and Salié sums, to which Hypothesis $R^*$ applies and gives the square root of the elementary count. At odd moduli the hypothesis is needed only in the form of Conjecture (C*) of Friedlander and Iwaniec. The Gauss-sum evaluations, including even moduli and coefficients sharing a factor with the modulus, are proved in full. This version supersedes earlier versions, which obtained the exponent $1/2-1/28$ at $N=Q^3$ by a much longer route through sums of modular square roots. The paper was prepared in collaboration with Claude (Anthropic).

comments
27 pages. New, much shorter proof with a stronger result ($1/2-1/6$ instead of $1/2-1/28$ at $N=Q^3$)
fields
Number Theory
pdf ↗ page arXiv:2609.21195 ↗

This paper studies the element-wise convergence behavior of subspace iteration. All results are established for both \(\mathbb{F}=\mathbb{R}\) and \(\mathbb{F}=\mathbb{C}\). For a diagonal matrix \(Λ=\mathrm{diag}(λ_1,\ldots,λ_n)\) with \(|λ_1|>\cdots>|λ_n|>0\), we analyze the modulus of each entry of the iterative matrix sequence generated by subspace iteration, both without and with the Rayleigh–Ritz procedure. Under mild assumptions on the initial matrix \(X\in\mathbb{F}^{n\times m}\), we first derive exact asymptotic expressions for \(|Q_k(i,j)|\) in the subspace iteration without the Rayleigh–Ritz procedure: entries with \(i\neq j\) decay as \(|λ_{\max\{i,j\}}/λ_{\min\{i,j\}}|^k\), and the deviation of \(|Q_k(j,j)|\) from \(1\) decays as \(\max\{|λ_j/λ_{j-1}|,|λ_{j+1}/λ_j|\}^{2k}\), with explicit coefficients determined by the LU factorization of \(X\). Similar conclusions could also be established for upper triangular matrices. For the Rayleigh–Ritz variant, we obtain element-wise bounds for the normalized Ritz vectors \(Z_k\). Specifically, for \(|Z_k(i,j)|\), off-diagonal entries with \(i\geq m+1\) decay as \((|λ_i|/|λ_j|)^k\), off-diagonal entries with \(i\leq m\) decay as \((|λ_{m+1}|^2/(|λ_i||λ_j|))^k\), and the deviation of \(|Z_k(j,j)|\) from \(1\) decays as \((|λ_{m+1}|/|λ_j|)^{2k}\). These results give an element-wise description of the convergence behavior of subspace iteration. After an orthogonal or unitary change of basis, the results could be further generalized.

comments
The second version generalizes one of the conclusions in the first version. This generalization may lead to a considerable increase in the length of the paper. We had originally planned to write the generalization as a separate paper, but after submission, arXiv suggested that we add it directly to the original paper
fields
Numerical Analysis
pdf ↗ page arXiv:2609.21540 ↗

In this second paper on descent methods as proof mechanisms in harmonic analysis (the first treated Bourgain's $Λ(p)$ selection theorem), entropic mirror descent gives an improved restricted isometry bound, improving sampling and recovery bounds in the Fourier Ratio program. Let $H$ be a complex $n\times n$ matrix with $H^*H=nI$ and $|H_{ij}|=1$. For fixed $0<\varepsilon<\frac14$ and $A_0>0$, independent Bernoulli row selection with expected cardinality $C_{\varepsilon,A_0}r\log\frac{2en}{r}\log(2r)\leq m\leq n/2$ preserves, after normalization by $\sqrt m$, the squared norm of every complex vector $y$ with $\|y\|_1\leq\sqrt r\|y\|_2$ within a factor $1\pm\varepsilon$, with failure probability at most $Cn^{-A_0}$. This includes every $r$-sparse vector and also fully supported ones; support size enters only through this inequality. For $y=\widehat f$ the condition is exactly $\operatorname{FR}(f)^2\leq r$, where $\operatorname{FR}(f)=\|\widehat f\|_1/\|\widehat f\|_2$, giving uniform energy sampling and approximate recovery even for signals with full Fourier support. The same holds for a uniform subset of prescribed cardinality, and for discrete Fourier and real Hadamard matrices. At fixed accuracy the bound removes one sparsity logarithm from the earlier count and replaces $\log n$ by $\log\frac{2en}{r}$; for Walsh matrices it matches, up to constants, the lower bound of Błasiok et al.\ in their range. One relative-entropy potential controls the corrections of an amplitude predictor at every scale; counting them on the symmetric difference of two samples gives the uniform estimate. We also prove the sufficient bound $C_{A_0}\varepsilon^{-5}r\log\frac{2en}{r}\log\frac{2r}{\varepsilon}$, and stable sparse recovery from $Cs\log\frac{2en}{s}\log(2s)$ measurements, with error controlled by the noise and the best $s$-term approximation.

fields
Information Theory, Classical Analysis and ODEs
pdf ↗ page arXiv:2609.22568 ↗

Prime and Cohen-Macaulay ideals of 2-minors of matrices of variables with linear resolution are classified.

comments
Comments are welcome
fields
Commutative Algebra, Combinatorics
pdf ↗ page arXiv:2609.23712 ↗

For every admissible non-maximal Toledo invariant $t$, we construct a locus of irreducible representations of a closed genus-$g$ surface group into $\mathrm{PU}_{2,n+1}$ with Toledo invariant $t$ whose orbit maps are quasi-isometric embeddings. These loci have real codimension $10(g-1)$ or $10(g-1)+2(n-1)$ in the character variety depending on the Toledo value. Our construction uses $4$-cyclic Higgs bundles and their correspondence with $\partial$-alternating surfaces in complex pseudo-hyperbolic spaces. The associated equivariant minimal maps into the symmetric space are bi-Lipschitz embeddings. We further construct cocompact domains of discontinuity in the Shilov boundary. Their quotients are smooth fiber bundles over the surface with fiber homeomorphic to $S^{2n-1}\times S^{2n-1}$.

comments
Several mistakes are fixed. 56 pages, including two appendices and a declaration of AI use, comments are very welcome
fields
Differential Geometry, Geometric Topology
pdf ↗ page arXiv:2609.24672 ↗

We study the smooth stabilization number of a locally flat embedded surface in a smooth $4$-manifold, defined as the minimum number of connected sums with $S^2\times S^2$ needed to make the surface topologically isotopic to a smooth embedding. We prove that a nonsmoothable locally flat surface in a closed, simply connected smooth $4$-manifold becomes smoothable after a single stabilization if its homology class is primitive and noncharacteristic and its complement has abelian fundamental group. This yields infinitely many examples of nonsmoothable surfaces with smooth stabilization number one. We also exhibit examples for which a single stabilization produces infinitely many pairwise smoothly nonisotopic representatives in the same topological isotopy class. In contrast, we construct a locally flat genus-eight surface representing $6h$ in $\mathbb{CP}^2$ whose smooth stabilization number is exactly two. More generally, we show that smooth stabilization numbers of locally flat embedded surfaces in $\mathbb{CP}^2$ are unbounded.

comments
One section is added on nonsmoothable surfaces whose smooth stabilization number is 2. 13 page, 1 figure
fields
Geometric Topology
pdf ↗ page arXiv:2609.24834 ↗

For every uncountable regular cardinal $α$, $\mathbb S^{\ast}(α)$ is an explicitly typed four-coordinate forcing motivated by the ladder-system construction of Hayut and Magidor. The forcing is $σ$-closed and, after adjoining a formal maximum, $α$-strategically closed. For $α\geqω_2$, every nonempty countable family of designated generic branches has a stationary and costationary common trace on the generic ladder-coordinate set $L_α$, while no countable family of cofinal branches generates $L_α$. These conclusions persist under a Kurepa-style level-size bound. In the unrestricted forcing, for every infinite cardinal $μ<α$ in the ground model, some level of the generic tree contains a copy of $({}^μ2)^V$. Consequently, the endpoint-corrected restriction family indexed by $\mathcal P_{ω_2}α$ is too wide, whereas the scaled restriction system indexed by $\mathcal P_αα$ has all levels of size less than $α$ exactly when $α$ is strongly inaccessible in the ground model. When these equivalent conditions hold, the branch-covering number of $L_α$ relative to the scaled system is at least $ω_1$. The low-cofinality empty-value convention also ensures that the set of domains of $L_α$ contains no club in $\mathcal P_αα$. The unrestricted tree clause of the motivating presentation is retained, without asserting forcing equivalence.

comments
23 pages
fields
Logic
pdf ↗ page arXiv:2609.25033 ↗

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

comments
13 pages. Some typos were fixed
fields
Geometric Topology
pdf ↗ page arXiv:2609.25574 ↗

Many statistical procedures compute an entire solution path rather than a single estimator. For one class the path is piecewise linear, traced corner to corner by an active-set homotopy. Two of its members coincide exactly: under $Σ=X^\top X$ and $μ=X^\top y$ the gross-exposure-constrained mean–variance program and the constrained LASSO trace the same piecewise-linear curve, and they keep doing so under arbitrary linear equality and inequality constraints. Which parameter is swept, a leverage budget or a return tilt, is not a choice the curve notices: under a homogeneous mandate the two sweeps differ by a scalar. A mandate that holds the portfolio invested costs a radial rescaling instead, and the efficient frontier is that curve rescaled; its corners pass unnoticed because the frontier is continuously differentiable where they fall. We give the map between the two parametrisations and the single way it degenerates. That mean–variance selection and the LASSO instantiate one parametric quadratic program is prior art (Gärtner, Jaggi and Maria, 2012). The Critical Line Algorithm itself lies off that route, and the correspondence established here is new. The identity is one of curves, not of statistical experiments. The map between the parametrisations is computed from the data, so the geometry of the path transfers while quantities averaged over the response do not. We cross that boundary deliberately and give the degrees of freedom of the constrained fit under arbitrary linear constraints. In the long-only, fully invested case it is the expected number of holdings away from a bound, less one.

comments
18 pages, 3 figures, 2 tables
fields
Optimization and Control
pdf ↗ page arXiv:2609.25704 ↗

In this paper, we prove the Brauer $A(\infty)$ condition for good non-defining primes. Consequently, we show a conjecture of Navarro on coprime actions and Brauer characters for primes larger than 3.

fields
Representation Theory
pdf ↗ page arXiv:2609.26441 ↗

Every Dubrovin–Frobenius manifold provides a solution to the WDVV equation, that was initially formulated in the study of the moduli space of curves. During the last two decades special attention was given to the "open" version of the moduli space of curves. Its genus zero intersection theory is governed by the system of equations called open WDVV equation, that extends "classical" WDVV equation. In this note we study Dubrovin–Frobenius manifold structures on the Hurwitz spaces of genus zero. We construct explicitly the solutions to open WDVV equation for these Dubrovin–Frobenius manifolds and show that these solutions appear as the restriction of the Dubrovin–Frobenius structure to its discriminant.

fields
Algebraic Geometry
pdf ↗ page arXiv:2609.26948 ↗

We complete, in the general Riemannian setting, the classification of isolated singularities of positive solutions to the Yamabe equation for dimensions \(3\le n\le29\), initiated in the flat case by Caffarelli, Gidas, and Spruck in 1989. Precisely, every isolated singularity is either removable or the solution is asymptotic to a Fowler solution. The sharpness of this range is established by counterexamples for every dimension \(n\ge30\) in our companion paper.

comments
108 pages. submitted. In this new version we first updated the status of our work in sequel, then clarified a few points in the statements and proofs of Lemma 4.2 and Proposition 9.3 and we made minor edits at a few spots in the abstract and introduction for clarity
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2609.28323 ↗

This is an expanded version of a memorial article that is to appear in the Notices of the American Mathematical Society.

comments
This is a small revision of the expanded version of a memorial article that is to appear in the Notices of the American Mathematical Society. (with appendices by John Ewing and Dusan Repovs)
fields
History and Overview, Geometric Topology
pdf ↗ page arXiv:2609.28515 ↗

We prove that the language of palindromic reduced words in a Coxeter system is regular if and only if the Coxeter group is a direct product of a finite Coxeter group with finitely many copies of the infinite dihedral group.

comments
14 pages. Corrected error in proof of Proposition 4.1: thanks to Matthew Dyer for catching this. Further comments welcome!
fields
Group Theory
pdf ↗ page arXiv:2609.29022 ↗

In this study, we investigate continuous data assimilation for a class of partly diffusive FitzHugh–Nagumo neural networks with memristive feedback and linear synaptic coupling. The nudging algorithm implemented here only adds a feedback term to the membrane-potential equations, while the recovery and memductance variables remain unobserved. We obtain weighted energy estimates that give sufficient conditions for exponential convergence of the data-assimilated solution to the reference solution under full or coarse membrane potential observations. Moreover, we prove energy-class uniqueness in dimensions one and two. In dimension three, the uniqueness criterion is an \(L^4\) membrane-potential initial data. We also establish an observational-noise estimate for locally square-integrable forcing, yielding an asymptotic error bound when the noise energy is eventually bounded.

fields
Analysis of PDEs
pdf ↗ page arXiv:2609.30480 ↗

The para-Racah polynomials, taken at the persymmetric value of their isospectral deformation parameter, define through their recurrence relation a mirror-symmetric tridiagonal Hamiltonian $J$. Its spectrum is a quadratic bi-lattice, the union of the squares $(s+a)^2$ and $(s+c)^2$ of two interlaced arithmetic progressions of unit step, and it exhibits fractional revival when the grid parameters $a$ and $c$ satisfy a Diophantine condition. As the number of sites grows, $J$ contracts to the trigonometric Pöschl–Teller Hamiltonian on a finite interval. We establish this twice, on the recurrence relation and on the polynomials themselves. Both grid parameters survive in the limit, the difference $c-a$ as a scalar centrifugal term at the interior point fixed by the mirror, and $a+c-1$ as the strength of two confining singular walls at the ends. These walls turn the spectrum into the quadratic pair $(s+a)^2$, $(s+c)^2$, with Jacobi eigenfunctions $P_s^{(a+c-1,\,\mp(c-a))}$, and the two sublattices converge to two families that differ only by the sign of the second Jacobi parameter. The mirror symmetry of $J$ becomes the reflection about the midpoint, which grades the two families and carries the fractional revival to the limit. Algebraically, the bispectral pair of the discrete model, which generates the Racah algebra, becomes a pair of generators of the Jacobi algebra, one rung down the Askey–Wilson hierarchy, which is the dynamical algebra of the Pöschl–Teller Hamiltonian.

comments
25 pages
fields
Mathematical Physics
pdf ↗ page arXiv:2609.30624 ↗

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. This view explains vanishing-gradient behavior in high-dimensional BO and provides a common interpretation of heuristics such as RAASP and dimension-scaled lengthscales. Building on this analysis, we propose FITR, a trust-region-based BO method that replaces lengthscale-based scaling by local pullback-Fisher weights. FITR is not restricted to GP kernels with explicit lengthscales. On GP benchmarks with an SE kernel, experiments show competitive performance using FITR. The proposed method also easily generalizes to non-isotropic surrogates, although the gains are more task-dependent in that setting.

comments
Accepted at NeurIPS 2026 (Camera Ready Version)
fields
Information Theory
pdf ↗ page arXiv:2609.31107 ↗

We construct a sequence of AE Kähler metrics on $\mathbb{C}^2$ with nonnegative and integrable scalar curvature whose ADM mass tends to zero but which, for a suitable choice of basepoints, fails to converge to Euclidean space in the pointed Gromov-Hausdorff sense.

comments
21 pages. v2: new title, abstract and AI statement
fields
Differential Geometry
pdf ↗ page arXiv:2609.32383 ↗

In this article, we describe a method to obtain lower bounds for the $2k$th moment of values of $L$-functions localised at the central point for all real $k > 0$. In particular, for the families of quadratic twists of self-dual irreducible unitary cuspidal automorphic representations of $\operatorname{GL}_2(\mathbb{A}_{\mathbb{Q}})$ and $\operatorname{GL}_3(\mathbb{A}_{\mathbb{Q}})$ our results are new in the range $0<k<\tfrac12$.

fields
Number Theory
pdf ↗ page arXiv:2609.32673 ↗

We determine the small-diffusion limit of the principal eigenvalue for a one-dimensional cooperative elliptic system with component-dependent drifts and Neumann boundary conditions. For scalar equations, this limit is determined by local data at the drift equilibria and boundary points. We show that such localization fails for systems: switching between components can make some intervals spectrally relevant. We first prove that the logarithmic transforms of all component eigenfunctions converge to the same function, which solves a scalar Hamilton-Jacobi equation. The associated Aubry set determines the asymptotic behavior of the principal eigenvalue. Under nondegeneracy assumptions, this set decomposes into isolated points, regular intervals, and composite intervals containing common drift zeros. We then identify the effective value of each class through local Ornstein-Uhlenbeck spectra and interval transport problems, and establish that the limit of the principal eigenvalue is the minimum of these class values. A unique minimizing class also determines the common logarithmic eigenfunction profile.

comments
53 pages, 3 figures
fields
Analysis of PDEs
pdf ↗ page arXiv:2609.32693 ↗

We prove an $e$-positive formula for the chromatic symmetric function of proper circular arc graphs solving the $q=1$ case of a conjecture of Ellzey and of Alexandersson and Panova. In doing so, we provide a new proof of the $e$-positivity of unit interval graphs, which alongside Guay-Paquet's reduction gives a new proof of the Stanley–Stembridge conjecture. We define color matrices, which count proper colorings, and tableau matrices, whose entries are nonnegative rational numbers and ratios of elementary symmetric functions. We prove the two matrices are related by a single family of change of basis matrices, which become invertible after restricting to finitely many colors, and we show the chromatic symmetric function of proper circular arc graphs comes from taking the trace of these matrices. Using Hikita's tableaux, this gives an explicit formula for the chromatic symmetric function of a proper circular arc graph as a weighted sum over tableaux whose first and last $k$ vertices lie in the same columns.

fields
Combinatorics
pdf ↗ page arXiv:2609.33124 ↗

Spectral zeta functions provide a standard tool for regularizing determinants of differential operators in quantum physics. In a previous paper (J. Math. Phys. 66: 083505, 2025), we introduced a $p$-adic spectral zeta function for discrete spectra via a locally analytic interpolation function. In this paper we extend the framework to continuous spectra using the inverse Stieltjes transform. Starting from the resolvent of a bounded operator, we construct a generalized distribution, called the $p$-adic spectral distribution, and define bosonic and fermionic zeta functions and functional determinants. We establish their analytic properties, special value formulas, and Stirling expansions, and show that our previous framework is embedded into the present one in the discrete case. In this approach, the bosonic and fermionic cases exhibit an interesting symmetry. As an application, we consider the position operator in $p$-adic quantum mechanics on an arbitrary compact subset of $\mathbb{C}_{p}$.

comments
43 pages. Dedicated to the memory of Lev Genrikhovich Shnirelman (1905--1938)
fields
Mathematical Physics, Number Theory
pdf ↗ page arXiv:2609.33660 ↗

Every group has a canonical coloring of its unordered pairs by inverse pairs of differences. We prove that this coloring can be coarsened to four colors without changing its color-preserving permutation group, for groups of arbitrary cardinality. Four is the least uniform bound. A related construction applies to finite homogeneous coherent configurations: if every basic relation has valency at most $d$, where $d\geq 2$, a coarsening with at most $2d+1$ off-diagonal colors in the symmetric case, or $2d+3$ off-diagonal arc colors in general, has the original configuration as its coherent closure. Two-dimensional Weisfeiler-Leman refinement recovers that partition within $2\lceil\log_2 n\rceil$ rounds on $n$ points, with the specified atomic initialization. Affine-plane schemes show that linear dependence on valency is necessary. We apply the group realization to classify groups admitting naturalizing invariant metrics and show that, for a suitable such metric, naming the identity determines the compatible multiplication uniquely. Finally, using additional Cayley-realization and finite-classification inputs and explicit certificates, we determine the least number of metric values for every group. The direct universal construction and the finite coherent-reconstruction theorem do not depend on those computations.

comments
60 pages. Ancillary files: finite certificates, verification programs and run records. v4: expanded and retitled (v3: Finite-valued invariant metrics and a classification of natural groups). Adds a sharp four-color construction for all groups and a reconstruction theorem for finite coherent configurations; keeps the natural-group classification and exact minima
fields
Group Theory, Combinatorics
pdf ↗ page arXiv:2609.33938 ↗

For $1<p<2$ we prove weak and strong unique continuation properties for the solutions to $Δ_pu+f(u)=0$ in a planar domain, with $f$ continuous and such that $|f(s)|\leq C|s|^{p-1}$: a solution vanishing on an open set vanishes identically, and so does a solution vanishing to infinite order at a single point. We can therefore make progress towards a proof of some long-standing nonexistence results available only for $p=2$, such as a celebrated one of Esteban and Lions, establishing here that for the critical $p$-Laplace equation with zero Dirichlet boundary condition on a half-plane, there are no nontrivial finite energy solutions. In the plane, unique continuation thus provides the missing ingredient for a generalisation to the $p$-Laplacian operator of a classical result of Struwe on the bubble-profile decomposition of possibly sign-changing Palais-Smale sequences associated to the Brezis-Nirenberg problem, which remains open in dimension $N\geq3$ for $p\neq2$. We obtain a characterisation of their loss of compactness in terms of the finite energy solutions of $Δ_pu+|u|^{p^*-2}u=0$ in $\mathbb R^2$.

comments
30 pages. In version 2 the isolatedness of the simultaneous zeros has been stated explicitly and a related question written more clearly
fields
Analysis of PDEs
pdf ↗ page arXiv:2609.34204 ↗

We study the edge scaling limit of the logarithms of the squared singular values of multiplicative Brownian motion on the general linear group $\mathrm{GL}_N(\mathbb{C})$ with general initial conditions. Building on earlier work [arXiv:2605.06429], we prove that, for every initial condition in the enhanced state space, the limiting dynamics are determinantal and derive an explicit double-contour formula for their extended multitime correlation kernel. The dependence on the initial state, including information not determined by the particle coordinates, is encoded by the associated Laguerre–Pólya entire function. We further extend the construction of solutions to the corresponding infinite-dimensional system of singular stochastic differential equations to arbitrary initial configurations, including those with coinciding coordinates.

comments
48 pages, 5 figures. Added an explicit comparison with Ahn's kernel; minor clarifications and corrections
fields
Probability, Mathematical Physics
pdf ↗ page arXiv:2609.35383 ↗

We prove that the relative commutant of a finite unitary tuple in a tracial matrix ultraproduct is internal whenever its conjugation operator has a spectral gap off the commutant. This implies the existence of a non-hyperlinear group.

comments
24 pages
fields
Group Theory, Operator Algebras
pdf ↗ page arXiv:2609.37761 ↗

Let $B_\infty$ be the braid group on infinitely many strands and $P_\infty$ its pure braid group. We show that $C^*_r(P_\infty)\subseteq C^*_r(B_\infty)$ and all its intermediate inclusions are $\mathcal{Z}$-stable and completely selfless. This gives natural examples of simple nonnuclear $\mathcal{Z}$-stable $C^*$-algebras. Further examples come from $\mathrm{SL}_\infty(\mathbb{Z})$ and $\mathrm{GL}_\infty(\mathbb{Z})$. We also show that $C^*_r(\mathbb{F}_\infty)\subseteq C^*_r(B_\infty)$ is completely selfless for the free group $\mathbb{F}_\infty$ of braids in which only the first strand moves. All results hold for twisted group $C^*$-algebras. In contrast, $\mathcal{Z}$-stability fails for $B_n$ with $n$ finite and for groups that are not inner amenable.

comments
12 pages; algebras and inclusions are now shown to be completely selfless; exposition revised and references updated
fields
Operator Algebras, Group Theory
pdf ↗ page arXiv:2609.38596 ↗

Let \( G \) be a finite group, and consider its common non-zero graph, which we denote by \( Γ_{nv}(G) \). In this graph, the vertices represent the non-linear irreducible characters of \( G \). There is an edge connecting two distinct vertices \( χ_1 \) and \( χ_2 \) if there is a vanishing element \( g \in G \) such that \( χ_1(g) χ_2(g) \neq 0 \). A finite group \( G \) is described as a strongly \( \mathcal{H}_1' \)-group if the set of vanishing elements of each of its non-linear irreducible character is equal to the set of vanishing elements of \( G \). In this paper, we prove Conjecture 1 from \cite{ourself}, which states that if \( Γ_{nv}(G) \) is null (has no edge), then \( G \) must either be a strongly \( \mathcal{H}_1' \)-group or a Frobenius group, whose Frobenius complement is isomorphic to \( Q_8 \). Additionally, we show that if there are no triangles in \( Γ_{nv}(G) \), this implies that the group is solvable. We also look at the situation where the common non-zero graph of a finite group \( G \) contains only one edge. This leads us to conclude that \( G \) is either isomorphic to \( S_4 \); or that the single edge in \( Γ_{nv}(G) \) is of the form \( \{θ, ζθ\} \) for some \( ζ\in \Irr(G/G') \) and \( θ\in \Irr(G|G') \), $G$ is a $p$-nilpotent group for some prime $p$ and for all characters \( χ\in \Irr(G|G') - \{θ, ζθ\} \), we find \( \Van(χ) = \Van(G) \). Lastly, our study also explores groups whose common non-zero graph forms a star shape, concluding that such configurations can only occur if \( G \) has exactly one non-linear irreducible character.

fields
Group Theory
pdf ↗ page arXiv:2609.39290 ↗

Coded distributed computing (CDC) mitigates the Shuffle communication bottleneck through coded multicast, but existing schemes with predetermined worker populations do not directly adapt to worker arrivals and disconnections. To address these dynamics, we propose a dynamic CDC scheme that preserves surviving workers' caches and Reduce assignments while exploiting the storage brought by arriving clusters. The model accommodates general MapReduce tasks under a placement that is partly fixed and partly new. The scheme uses Cartesian products of cluster-wise placement delivery arrays (PDAs) for file placement. A delivery-aware greedy algorithm reassigns abandoned Reduce functions, and a Communication Array allows workers with no Reduce function to serve as coded transmitters. For arbitrary feasible disconnections, the scheme's exact communication load is derived. A file-wise converse under one-shot communication and uncoded placement shows that, in the absence of disconnections, the scheme lies within a factor of two of the lower bound under these assumptions when new clusters arrive, and within a factor of four otherwise.

fields
Information Theory
pdf ↗ page arXiv:2609.39373 ↗

For estimating the mean vector of a $p$-variate normal distribution ($p \ge 3$) under quadratic loss, the positive-part James-Stein estimator dominates the original Jame-Stein estimator though it suffers from a non-smooth thresholding boundary. In this paper, we first express the shrinkage factor of the positive-part estimator using an infinite series. Truncating this series at a finite degree $m$ allows us to interpret the factor as a special case of $q$-numbers. Leveraging these $q$-numbers parameterized by a positive real index $m$, we propose a novel smooth estimator. We prove that the proposed estimator dominates the original James-Stein estimator for any dimension $p \ge 3$, provided the truncation parameter satisfies $m \ge 0.95\sqrt{p-2}$.

comments
Major revision with q-number formulation; title updated
fields
Statistics Theory
pdf ↗ page arXiv:2609.39614 ↗

Hong Wang has made several tremendous contributions to harmonic analysis and geometric measure theory. On the 23rd of July 2026, she was awarded the Fields Medal. In this short article we shall focus on her work on the Kakeya problem and other problems related to the Fourier transform. We will try to put her work in historical context and present a small selection of her contributions to harmonic analysis.

comments
15 pages. A Laudatio article for the proceedings of the ICM. Corrected minor typos
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2609.40161 ↗

Consideration of frequentist type-I error or power based on certain fixed conditions may not fully embrace the aims of a Bayesian analysis; this is particularly true in settings where informative priors are involved. Calderazzo et al. consider adaptations of a testing procedure involving Bayesian borrowing from external control data. Particular caution may be necessary here in order not to condition on parameters and data simultaneously. We consider their example case and argue that (a) the conditioning scheme may have limited practical implications, and (b) if the main concern are assumption violations, these might be better addressed by adapting the likelihood function.

comments
4 pages, 2 figures
fields
Statistics Theory
pdf ↗ page arXiv:2610.00711 ↗

We develop Toeplitz infinite GMRES for solving large sparse analytic parameterized systems $A(s)x(s)=z$ at many parameter values. Our method exploits a block upper triangular Toeplitz structure in the companion Krylov sequence to construct the Arnoldi process and recover solution approximations without storing full Arnoldi vectors. We derive incremental recurrences requiring $\mathcal{O}(np^2+p^3)$ arithmetic and $\mathcal{O}(np+p^2)$ storage for $p$ Arnoldi steps, excluding factorization setup and assuming linear-cost coefficient actions and triangular solves. A dynamic generator-refreshing strategy addresses cancellation in this basic recurrence. Moreover, we show that the Arnoldi basis can be simply represented using one block row and a nilpotent matrix. For $A(s)$ admitting a split form, we further use this structure to develop an implicitly rebased method. A residual lower bound for square-summable Taylor coefficients explains the effect of scaling outside the unit disk. Theoretical analysis and numerical experiments illustrate the computational efficiency of the proposed methods.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.01740 ↗

Two integer partitions $t$-intersect if they have at least $t$ common parts, counted with multiplicity. We study the largest $t$-intersecting families of integer partitions of $n$ into exactly $k$ positive parts. The canonical $t$-star consists of the partitions containing at least $t$ ones. Applying Kupavskii's weak-spread theorem, we prove that this star is largest whenever $n\ge Ak^3$, for every fixed $A>24$ and all sufficiently large $k$, uniformly over $1\le t<k$. We also give counterexamples to Borg's conjecture at every intersection scale: for all sufficiently large $k$ and for every $1\le t\le \lceil k/4\rceil$, we describe $t$-intersecting families on integer partitions of $n=\lfloor tk^2/3\rfloor$ into $k$ parts which are strictly larger than the corresponding canonical stars. Moreover we present a family of counterexamples to Borg's conjectures about largest $t$-intersecting families of integer partitions of $n$ without restricting the number of parts.

comments
We added counterexamples to Borg's conjectures about largest $t$-intersecting families of integer partitions without restricting the number of parts. Additional small edits
fields
Combinatorics, Number Theory
pdf ↗ page arXiv:2610.01747 ↗

Let $θ$ be an ordinal and let $(N_α)_{α\leqθ}$ be a continuous increasing tower of closed normal subgroups of a Hausdorff topological group $G$, with $N_0=\{e\}$. Write $ρG$ for the Raikov completion of $G$, and put $K_α=\overline{N_α}^{ρG}$ and $H_α=GK_α$. The successive and limit differences of the groups $H_α$ mark the first stages at which points of $ρG$ become old quotient points. For every nonzero ordinal $θ$ and every set $S\subseteq(0,θ]$, there is a Hausdorff pseudocompact Boolean group with a continuous tower of closed normal subgroups such that every member of the tower is pseudocompact and the nonempty strata occur exactly at the stages in $S$. The terminal quotient can simultaneously be chosen isomorphic to $\mathbb Z/2\mathbb Z$, and for every $δ<θ$ the successive factor $N_{δ+1}/N_δ$ is compact exactly when $δ+1\notin S$. Thus a tower may have a single nonempty stratum at a limit stage even when every successive factor is compact. For a closed normal subgroup $N$ of $G$, let $\widehat q:ρG\toρ(G/N)$ extend the quotient homomorphism and put $K=\overline N^{ρG}$. Over $gN\in G/N$, the fiber in $ρG\setminus G$ is $g(K\setminus N)$, homeomorphic to $ρN\setminus N$, while for $y\in\widehat q(ρG)\setminus(G/N)$ the entire $\widehat q$-fiber lies in $ρG\setminus G$ and is homeomorphic to $ρN$. For precompact kernels this gives a canonical decomposition, and nested quotients give the two-stage identity underlying the transfinite filtration. Further results concern pseudocompact Raikov remainders and include countable Abelian examples.

comments
24 pages
fields
General Topology, Group Theory
pdf ↗ page arXiv:2610.02212 ↗

Computer-assisted proofs in dynamics establish results about nonlinear systems by rigorous numerical computation. Their correctness rests on a trusted base of interval-arithmetic libraries and analytic estimates checked by hand. We formalize in Lean~4 a framework for the radii polynomial method, which certifies an exact solution near a numerical approximation by verifying four norm bounds and the resulting polynomial inequality. Weighted coefficient algebras provide the common setting for polynomial equations and initial value problems in Taylor and Chebyshev series. Their universal properties construct the bounded operators and the evaluation maps, and the universal property of the free commutative algebra makes polynomial substitution commute with evaluation. Finite/tail reductions turn the four norm bounds into finite rational inequalities, which are checked in Lean. The radii theorem then yields an exact coefficient solution, and realization theorems carry it to a solution of the original equation. The worked examples are a square-root branch given by a convergent power series and polynomial initial value problems, among them the Lorenz system, for which the library proves existence, uniqueness within the trajectory ball, and analyticity of the function-level solution.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.02335 ↗

We prove that any counter-example to the two dimensional Jacobian Conjecture with integral coefficients and determinant of its Jacobian matrix equals one, has only paths of asymptotic values that can contain only finitely many points of the planar integral lattice. The second part of our paper gives some nontrivial applications of the theory of certain Theta functions to the two dimensional Jacobian Conjecture over the real field, and over the complex field.

fields
Number Theory, Commutative Algebra, Algebraic Geometry
pdf ↗ page arXiv:2610.02961 ↗

We construct smooth time-periodic Hamiltonians on the monotone manifolds $S^2\times S^2$ and $\mathbb{C}P^2$ for which the Clifford torus meets its Hamiltonian image in exactly two isolated degenerate points. The product example disproves the degenerate Arnol'd-Givental conjecture.

comments
35 pages; 3 figures and further details of the proof have been added
fields
Symplectic Geometry
pdf ↗ page arXiv:2610.02965 ↗

We construct metrics of strictly positive sectional curvature on at least 508 pairwise nondiffeomorphic exotic fifteen-spheres, without prescribing orientations. The construction begins with quaternionic line bundles over $\mathbb{H}P^2\times S^4$. Surgery along a Hopf fiber gives homotopy spheres with specified equivariant two-disk presentations. A calculation on the surgery filling distinguishes 1015 nonstandard oriented smooth types. We construct positively curved quotient metrics on both disks, match their boundary data under the prescribed attaching map, and smooth the seam by averaging the inverse tangential metrics. The connection estimates and the smoothing argument are proved directly for every two-plane. Thus the curvature conclusion does not require a compatible-disk theorem from the eleven-dimensional construction or an external curvature-gluing theorem. We give quantitative parameter bounds and specify the auxiliary choices for the first nontrivial member after fixing its smooth gauge family.

fields
Differential Geometry
pdf ↗ page arXiv:2610.03310 ↗

We study a physics-informed neural network (PINN) approximation of a coupled PDE system that models the interaction between fluid and elastic dynamics. The canonical heat-wave model considered here couples a parabolic and a hyperbolic equation through transmission conditions on a fixed boundary interface, and serves as a prototype for the Stokes-elastic systems that arises in real world applications. This coupling makes the error analysis more delicate than that for a single PDE. We bound the error between the exact and PINN solutions by the associated PINN residuals, and we moreover prove that the generalization error is controlled by the training error, the number of quadrature points, and the size of the network. {To the best of our knowledge}, these are the first error estimates for a PINN approximation of a coupled fluid-structure interaction PDE system. We also show that numerical experiments with respect to a given test problem.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.03575 ↗

We show that beta-shifts whose lexicographically largest point is a Sturmian sequence do not have typical periodic optimization (TPO): on each such beta-shift there is a non-empty open set of Lipschitz functions whose unique maximizing measure is the Sturmian measure, which is not supported on a periodic orbit. These are the first known examples of beta-shifts without TPO, and, since they have the specification property, the first known examples of shift spaces with specification but without TPO. The corresponding beta-transformations do not have TPO in any space of Hölder functions on the interval. The main ingredient in the proofs is a rigidity property of Sturmian subshifts: modulo constants and Lipschitz coboundaries, the space of Lipschitz functions on such a subshift is one-dimensional. We also show that the set of $β>1$ for which the beta-shift or the beta-transformation does not have TPO is dense in $(1,\infty)$, but has zero packing dimension. The density is proved by a tuning construction, analogous to Douady–Hubbard tuning in the Mandelbrot set, which produces non-Sturmian subshifts with the same rigidity property. Finally, we show that every beta-shift has typical zero-entropy optimization: for an open dense set of Lipschitz functions, the maximizing measure is unique and its support has zero topological entropy.

comments
54 pages. Results added showing that the set of non-TPO parameters is dense and of zero packing dimension, and that every beta-shift has typical zero-entropy optimization. Title change to reflect the new content
fields
Dynamical Systems, Number Theory
pdf ↗ page arXiv:2610.03619 ↗

We study the maximization of a nonnegative $k$-submodular function, not assumed monotone, in which each of $n$ elements receives one of $k\ge2$ labels or stays unselected and the selected elements must satisfy a constraint. For a compact convex down-closed region $P\subseteq[0,1]^n$ of fractional selection vectors, the diagonal level $ζ(P)=\max\{t\in[0,1]:t(1,\ldots,1)\in P\}$ is the largest selection probability that can be given to all elements at once; it equals $r/n$ for a uniform matroid of rank $r$, and $ζ(P)=1$ means that the constraint is vacuous. We give approximation coefficients that increase continuously with $ζ$. They come from one inequality for the multilinear extension of the objective: the algorithm computes an action without querying the objective, and objective feedback gives a comparator-independent update direction. For $k\ge3$, feasibility of the action reduces to three polynomial inequalities in one variable; for $k=2$ the profile is closed form. At $ζ=0$ the coefficients are $0.4456\ldots$ for $k=2$ and $0.4541\ldots$ for every $k\ge3$. For every finite $k\ge3$ they reach $1/2$ above an explicit level, which is $0.4026\ldots$ for $k=3,4,5$, and at $ζ=1$ they reach $1/2$ for $k=2$, $(\sqrt{17}-3)/2$ for $k=3,4$, and $k/(2k-1)$ for $k\ge5$. Online linear optimization gives $O(\sqrt T)$ approximate regret, with gradient feedback or with value queries made after each action. The coefficients carry over to matroids, with expected and high-probability guarantees, and to any fixed number of knapsacks: the zero-level coefficients hold on every instance, and the larger ones when items are small or when prefix enumeration keeps the diagonal level on one branch. For one budget the enumeration exponent is $O(1/\varepsilon)$.

fields
Optimization and Control
pdf ↗ page arXiv:2610.04049 ↗

Let $G$ be a connected compact Lie group and $R$ a commutative ring over which $H_*(G;R)$ is an exterior algebra on odd primitive generators. We prove a rigidity theorem: the Batalin-Vilkovisky (BV) algebra $\mathbb{H}_*(LG;R)$ of Chas and Sullivan on the homology of the free loop space is that of the product of odd spheres with the classical exponents of $G$, tensored with the group ring of the torsion of $π_1(G)$. Conversely, over an integral domain the graded algebra $\mathbb{H}_*(LG;R)$ already determines the exponents and the group ring, hence the BV algebra. The isomorphism with the product of spheres is algebraic: for $\mathrm{Sp}(n)$, $n\geq2$, and $\mathrm{SU}(n)$, $n\geq3$, no map of spaces induces it over $\mathbb{Z}$. If moreover $G$ is simply connected, then $\mathbb{H}_*(LG;R)$, as a BV algebra, is the Hochschild cohomology of $H^*(G;R)$ with the BV operator induced by Poincaré duality.

comments
27 pages. v3: new title; introduction restructured; abstract shortened; citations corrected, including a missing reference to Kupers' thesis
fields
Algebraic Topology, K-Theory and Homology
pdf ↗ page arXiv:2610.04164 ↗

For every prime $\ell\geq5$ and integer $n\geq2$, we construct a totally real cubic field in the family studied by Ennola with a specified prime ideal above $\ell$ whose class has exact order $2^n$. For parameters satisfying two square conditions and explicit congruences, the same squareclass obstructions give four independent rational points on the associated elliptic curves. A Pell equation describes all such parameters. A genus-one base change gives five independent sections that generate a subgroup saturated at two. It also yields infinitely many elliptic curves over $\mathbb Q$, pairwise nonisomorphic over $\overline{\mathbb Q}$, with rank at least five.

fields
Number Theory
pdf ↗ page arXiv:2610.04254 ↗

We study formal matrix rings with the involution property, that is, rings in which every element can be represented as the sum of an invertible element and an involution. After recalling the construction of formal matrix rings via Morita contexts, we describe involutions in triangular formal matrix rings and establish a criterion for upper triangular rings of order two. We then prove that a formal matrix ring of arbitrary finite order has the involution property whenever all of its diagonal rings have this property. Several examples and counterexamples are included to illustrate the obtained results.

fields
Rings and Algebras
pdf ↗ page arXiv:2610.04709 ↗

Mean-field games provide a continuum framework for modeling the dynamics of large, interacting populations of non-cooperative agents. This paper studies symmetry-breaking in a finite-horizon, two-choice min-LQG mean-field game in which identical agents with linear stochastic dynamics choose one of two equally desirable terminal destinations, while trading off control effort against social pressure to conform. The model has an odd symmetry between the two destinations and therefore always admits a symmetric, dynamic Nash equilibrium in which the population splits evenly between them, producing a deadlock collective state at final time. Numerical studies have suggested that, as the penalty for social nonconformity increases, this symmetric equilibrium loses stability as a fixed point of an associated scalar, self-consistency map, and asymmetric consensus Nash equilibria emerge, where most agents select the same destination. By analyzing the linearized forward-backward PDE system through the scalar map representation, we provide a proof of this loss of stability of the symmetric equilibrium. Together with the odd symmetry of the map, this implies the existence of symmetry-broken mean-field game equilibria corresponding to consensus on either destination.

comments
26 pages, 4 figures. Originally submitted for review 5/18/26. v2 fixes issue with proof of lemma 4.3 related to terminal differentiability of the linearized scalar map, and other minor issues/typos
fields
Dynamical Systems, Analysis of PDEs, Optimization and Control
pdf ↗ page arXiv:2610.05730 ↗

For a finite poset, we partition the edges of the order polytope and of the chain polytope into classes indexed by the connected convex subsets of the poset, and we establish that corresponding classes have the same cardinality. This yields a closed formula for the common number of edges, and it identifies the bijection of Hibi, Li, Sahara and Shikama as a disjoint union of simple bijections between corresponding classes, explaining why it is a bijection and how it acts on edge directions and lengths. As consequences, the two polytopes have equally many edge directions, with matching multiplicities, and, for every m, equally many pairs of vertices whose symmetric difference has m components; the chain polytope has at least as many edges parallel to each coordinate subspace as the order polytope; and the edge lengths of the chain polytope are dominated by those of the order polytope, with strict inequality in the last two comparisons exactly when the poset contains a three-element chain. We discuss implications for linear and convex combinatorial optimization over ideals and antichains. We also express the number of edges in terms of the comparability graph, extending to stable-set polytopes of all graphs; give a recursion for series-parallel posets and closed formulas for layered, zigzag and crown posets; and characterize the distributive lattices for which the two polytopes are unimodularly equivalent. Finally, either diameter can exceed the other arbitrarily; both are bounded by the width, and they coincide for series-parallel, zigzag and crown posets.

fields
Combinatorics
pdf ↗ page arXiv:2610.07413 ↗

We study the structure of finitely ramified henselian valued fields of mixed characteristic with arbitrary residue fields via their residue rings of higher length, where a residue ring of length $n$ is the quotient ring of the valuation ring by the $n$-th power of its maximal ideal. We prove an approximate lifting theorem for homomorphisms between residue rings of higher length and explicitly determine the optimal bound of error of lifting. As applications, we obtain several Ax-Kochen-Ershov principles for relative completeness, relative existential completeness, and existential closedness using the pure ring structures on the residue rings. And we show that any formula on a residue ring of length $k$ is equivalent to a normal form of sentences in pure ordered group structure and special formulas at level $n$, uniformly for all finitely ramified henselian valued fields of mixed characteristic $(0,p)$ and the same initial ramification index $e$. Here, for $n\ge k$, a special formula at level $n$ represents a definable set on a residue ring of length $k$ given by a projection image of a definable set in pure ring structure on a residue ring of length $n$. Also, such $n$ is optimally computed from the precise estimation of error of lifting and depends only on $k$, residue characteristic $p$, and initial ramification index $e$.

comments
28 pages. v2:revised version with corrections
fields
Logic, Number Theory
pdf ↗ page arXiv:2610.08395 ↗

The solvable degree of a Schur algebra $D$ is the greatest common divisor of all integers $n$ such that $D^{n\times n}$ is a direct summand of the rational group algebra $\Q G$ for some finite solvable group $G$. The main result of this paper gives divisibility conditions on the solvable degree depending on the center and the rational primes that divide the discriminant of $D$.

fields
Representation Theory
pdf ↗ page arXiv:2610.08490 ↗

We study Hamiltonian elliptic systems with prescribed bilinear mass $\int_{\mathbb{R}^N}uv=a>0$. We establish a Gagliardo–Nirenberg inequality in the crossed gradient pairing and bilinear mass, on scaling-invariant component-bounded classes. It identifies the critical curve $1/p+1/q=N/(N+2)$ and the restricted energy trichotomy. For power nonlinearities, we establish uniqueness up to common translations and nondegeneracy of positive profiles throughout the Sobolev-subcritical hyperbola. Exact scaling then classifies positive normalised solutions and identifies the unique critical mass. In dimension two, we develop a bilinear exponential Gagliardo–Nirenberg estimate with a sharp gradient threshold and a truncated scalar refinement with the optimal quartic leading coefficient. Adapting variational ideas from [Cassani-Tarsi, Calc.Var.PDE (2015)] we combine a mass-normalising quotient, reduction over the full negative fibres and compactness below the concentration threshold to obtain least-energy positive radial solutions for pure exponential nonlinearities at every prescribed mass below the cubic limiting mass. Local perturbative branches and a small-frequency exponential branch yield explicit mass-response formulas.

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

A Markov chain with exit rates $q_i$ runs for $N$ steps with transition matrix $I+(T/N)Q$. On each irreducible face that carries start mass, we prove a local limit theorem for the occupation counts with an explicit constant and relative error $O(1/T)$, uniformly for $1\le T\le\varepsilon N$ with $\varepsilon\max_iq_i<1$ and on compact subsets of the open face. Up to $O(1)$, minus the log-probability of counts $n$ with support $F$ is $|F|-1$ times $\log(N/\sqrt T)$ plus $N$ times the Donsker and Varadhan functional of $I+(T/N)Q$ at $n/N$. Every admissible face has an explicit power of $T$ in its largest probability for large $T\le N^{1/3}$, and a constant given by a finite-dimensional variational formula. For $T=τ\log N$ the face of the mode minimizes $τλ_F+|F|-1$ at first order, with $λ_F$ the exit rate. If an admissible face has $Δ\ge1$ more states than another and an exit rate smaller by $δ>0$, we locate every crossing of their largest probabilities for large $T\le N^{1/3}$ up to $O(1/\log N)$. For two irreducible faces the crossing is unique for large $N$ in $1\le T\le\varepsilon N$, with coefficient $1/2$ of $\log\log N$. Near a facet, the continuous-time occupation density is the facet density times an explicit kernel, with relative error $O(1/T)$ at times $x\le cT$ off the facet, $c$ small. The counts obey a lattice form with extra error $T^2/N$ for $T\le\varepsilon_1\sqrt N$. The kernel is Bessel for $x=o(T)$ at facet profiles where the removed state has equal entry and exit laws, and at a profile where the rate has a first correction, of order $m\ge3$, if and only if $x=o(T^{1-2/m})$. On the complete graph with the uniform start, each face of at least 2 states crosses a vertex exactly once.

code
github.com/apemm/Kagey-Problems ∎ Lean project (kagey-problems/lean/lakefile.toml, kagey-problems/lean/lean-toolchain) could not be checked, checked 2026-10-27 build details
comments
82 pages, 2 figures. v2 replaces 'Vertex crossings in a symmetric Markov multinomial model'. Most results of v1 are reproved here, mainly in Sections 7 and 8; Table 1 and the paragraph before it list which, and the others stay in v1. Code and Lean files at https://github.com/apemm/Kagey-Problems
fields
Probability, Combinatorics
pdf ↗ page arXiv:2610.09258 ↗

We study a linear backward stochastic partial differential equation with unbounded observation-adapted random coefficients, motivated by the duality approach to nonlinear filtering. The coefficients depend predictably on the observation history through a control with almost surely finite time-integrated squared norm. The drift, diffusion, and coefficient multiplying the martingale integrand may grow linearly in space. The diffusion matrix may grow quadratically in space and is allowed to be degenerate. Under bounded positive-order spatial derivatives and bounded smooth observation-measurable terminal data, we prove existence and uniqueness in a polynomially weighted Sobolev class up to control-energy stopping times. The proof combines conditional parameter estimates, entropy bounds for likelihoods, stability under the reference probability, and stochastic-flow reconstruction.

fields
Probability
pdf ↗ page arXiv:2610.09278 ↗

We determine the worst-case behavior of the heavy-ball method on smooth strongly convex functions, first for Polyak's quadratic-optimal parameters and then for arbitrary constant parameters. For Polyak's tuning, the exact dimension-uniform exponential rate is the largest growth factor of an interpolable mixture of rotating geometric sequences. Four algebraic families determine this rate at every condition number. Two frequencies suffice, and one function in dimension five attains the rate at every horizon up to constant factors. We recover the sharp convergence threshold $9+4\sqrt5$ of Badithela and Seiler. For general tunings, an exact linear feasibility criterion characterizes dimension-uniform linear convergence through the angle between the characteristic polynomials of the two extreme quadratics. This gives a continuous condition-number threshold and resolves the second heavy-ball riddle of Goujaud, Taylor and Dieuleveut. The regions between consecutive cycle tongues are Farey gaps, each containing convergent and divergent tunings. Regular portions of the threshold surface are analytic plateaus with fixed periodic frequency support. Every rational rotation number in a gap anchors a single-harmonic plateau; mixed-harmonic plateaus and an exact two-lag threshold point also occur. Along tongue edges, explicit multiplier inequalities and second-order expansions of competing Farey fans bound the transition from single-harmonic to mixed-harmonic extremals. The rate bounds and the extremal constructions follow from a common interpolation and separation argument that preserves initialization with zero momentum.

comments
77 pages, 9 figures, links to Lean formalization and source code
fields
Optimization and Control, Dynamical Systems
pdf ↗ page arXiv:2610.09912 ↗

We give a deterministic polynomial-time algorithm for the Bilu–Linial signing problem on bipartite graphs. For every finite simple bipartite graph of maximum degree at most an integer $Δ\ge3$, the algorithm assigns signs to its edges so that the signed adjacency matrix has operator norm strictly less than $2\sqrt{Δ-1}$. Our algorithm builds on the randomized recursive repair framework of Jadbabaie, Saberi, and Sra~\cite{JSS26}, with deterministic rules for sign selection and vertex deletion.

comments
20 pages. We have improved the presentation and clarified some details of the arguments
fields
Combinatorics
pdf ↗ page arXiv:2610.09972 ↗

We study a Monge normal form of a surface in $\mathbb{R}^4$ based on the principal axes of its curvature ellipse. The curvature-ellipse-based Monge normal form is obtained using only Euclidean motions of the ambient space and local reparameterizations of the surface, and preserves the Euclidean invariants of the curvature ellipse, including its semi-axis lengths up to their ordering. We also give applications of this normal form to the $2$-jet geometry of surfaces in $\mathbb{R}^4$ and to the geometry of their orthogonal projections.

fields
Differential Geometry
pdf ↗ page arXiv:2610.10132 ↗

For every $1<p<\infty$, with $p^*=\max\{p,p/(p-1)\}$, we determine the sharp Hilbert norm $C_p=\cot(π/(2p^*))$ on $L^p(\mathbb{R};\mathcal{S}_p)$ and the sharp uniform bound $D_p=\csc(π/p)$ for retained and strict Riesz projections of maximal subdiagonal algebras in finite tracial von Neumann algebras. The Hilbert value is also the common Fourier–Schur completely bounded norm. For finite matrices, a nonnegative logarithmic determinant defect connects Heinävaara's tracial joint spectral measure to eigenvalues. The resulting transfer identity classifies finite signed real ridge inequalities on nilpotents and identifies their least additive eigenvalue corrections. A dual theorem characterizes weak-* limits of weighted angular measures of finite nilpotents. In general finite tracial algebras, separate positive-kernel and sharp determinant-covariance comparisons yield the Riesz bounds. Consequences include the sharp Volterra constant, Riesz–Titchmarsh and shifted-transform formulas, joint real-pencil norms, and exact triangular and operator-valued Fourier Riesz norms.

comments
50 pages. Substantially expanded from v1: sharp uniform bounds for retained and strict Riesz projections of maximal subdiagonal algebras in finite tracial von Neumann algebras, via determinant covariance and positive-kernel comparison; sharp triangular truncation bounds and exact operator-valued Fourier norms; weaker regularity for nonhomogeneous spectral transfer. Title and abstract revised
fields
Analysis of PDEs, Classical Analysis and ODEs, Functional Analysis
pdf ↗ page arXiv:2610.10158 ↗

A centrally excited random walk on $\mathbb Z^d$ moves like simple random walk, except that its first step from each site other than the origin has a drift of fixed size toward it. Kozma (2007) conjectured that after $n$ steps the visited set approximates a ball with radius of order $n^{1/(d+1)}$. We prove this in every dimension $d\geq 2$ and show that the rescaled local times converge uniformly to a cone, which is the potential generated by the drift on a ball. The same argument shows that, when the drift is opposite to a subgradient of a norm, the visited set approximates the ball of that norm. In the plane, the outer and inner radii of the visited set differ by at most $n^{1/6}$ times a power of $\log n$, and the exponent $1/6$ cannot be lowered. Earlier versions of this work appeared in three independent drafts by Nguyen (arXiv:2610.07724), Bou-Rabee and Peres (arxiv:2610.10162v1) and Singh (arxiv:2610.12138). The present paper brings together the results and ideas from these drafts.

code
github.com/nitromannitol/Centrally-Excited-Random-Walk ∎ Lean project (lakefile.lean, lean-toolchain) builds, no sorry at 411431c, checked 2026-10-27 build details
comments
29 pages, 5 figures. Lean formalization: https://github.com/nitromannitol/Centrally-Excited-Random-Walk
fields
Probability
pdf ↗ page arXiv:2610.10162 ↗

Levin asked what can be said about the locus of points lying on a given curve in $\mathbb{G}_m^n$ that have a non-zero integer power on another given curve in $\mathbb{G}_m^n$ for $n \geq 3$. We give a definite answer to the abelian analog of Levin's question, proving what is predicted by the Zilber-Pink conjecture in this case. An important ingredient in our proof is a strengthening of a height inequality by Vojta and Rémond.

comments
71 pages
fields
Number Theory, Algebraic Geometry
pdf ↗ page arXiv:2610.10212 ↗

Fluid antenna systems (FASs) offer significant spatial flexibility, yet securing them against eavesdropping is critical for practical FAS deployment in military, satellite, and internet-of-things networks. Although large language model (LLM)-assisted genetic algorithms (LLM-GAs) can address this secure FAS port selection problem, whether further algorithmic improvement is possible warrants deeper investigation. To this end, we propose a memetic algorithm based on reflective evolution (ReEvo). Unlike the state-of-the-art LLM-GAs, which design only crossover or mutation operators with an LLM, our algorithm leverages an LLM to evolve dedicated crossover, mutation, and local-search operators offline. These operators are then embedded into a memetic search framework, thereby obviating any online LLM queries during execution. Simulation results at equal generation counts demonstrate that our proposed algorithm achieves a higher secure sum-rate than the conventional GA and the state-of-the-art LLM-GAs.

comments
Accepted by WCSP 2026
fields
Information Theory
pdf ↗ page arXiv:2610.10235 ↗

We prove that Fourier quasicrystal measures with positive integer masses are precisely the nonzero real sections of effective Lee-Yang cycles by matrices with positive maximal minors, with masses given by weighted local intersection degrees. For Delone support, the reduced support of the cycle can be chosen strict. For unit masses, the cycle can be chosen reduced, with local intersection degree one at every root. Every integer-mass FQ measure has support equal to the common complex zero set of finitely many real-valued trigonometric polynomials. These results answer Questions (1), (2), and (4) of Alon, Kummer, Kurasov, and Vinzant. We recover a finite-dimensional torus from the spectrum and prove that its canonical analytic set is algebraic. A support-height theorem for holonomic sequences provides a linear spectral bound, from which we reconstruct the complex branches and their integer coefficients using fiber moments. Singular sections carry their natural local intersection degrees; discarding these can destroy the Fourier quasicrystal property.

comments
68 pages
fields
Functional Analysis, Algebraic Geometry, Classical Analysis and ODEs
pdf ↗ page arXiv:2610.10652 ↗

A rational polyhedron has Chvátal rank at most one if a single round of Chvátal-Gomory cuts yields its integer hull. In 1973, Chvátal asked whether 0/1 integer programs over polytopes of bounded Chvátal rank can be solved in polynomial time. For polyhedra of bounded Chvátal rank, integer feasibility is in NP $\cap$ coNP, so it is unlikely to be NP-hard. We answer Chvátal's question negatively already in its most restricted form: for Chvátal rank one, for integer feasibility, and even for the SAT polytopes of formulas whose clauses have at most three literals. Our answer holds under either of two standard assumptions from lattice-based cryptography. First, a polynomial-time algorithm for integer feasibility on such SAT polytopes of Chvátal rank one would solve bounded distance decoding with polynomial factors in deterministic polynomial time, contradicting the conjectured hardness of approximating lattice problems within polynomial factors. Second, assuming the hardness of learning with errors, an average-case analog of bounded distance decoding, the problem is also hard on average, for a polynomial-time samplable distribution of formulas. This also gives negative answers to related questions of Cornuéjols, Lee, and Li. We first prove these results for parallelepipeds, where they rest on an elementary sufficient condition: a polyhedron has Chvátal rank at most one if its width is less than one along every row of some unimodular matrix. For our parallelepipeds, such a matrix exists but is hard to find. For SAT polytopes, we represent candidate lattice vectors by their residues modulo small integers, and binary arithmetic on additional 0/1 variables checks that these vectors lie in the lattice.

fields
Optimization and Control
pdf ↗ page arXiv:2610.10911 ↗

We show that if a contractible Stein manifold $X$ with the density property admits a proper holomorphic embedding into $\mathbb{C}^k$, then $X \times \mathbb{C}^k$ is biholomorphic to $\mathbb{C}^{n+k}$ with $n=\dim X$. We also prove that McLean's exotic affine variety $K_n$, $n\ge4$, a smooth contractible affine variety which is not biholomorphic to $\mathbb{C}^n$, has the density property. Hence for $n \ge 4$ there exist an integer $m \in \{ n, \dots, 2n\}$ and an affine variety $X$ such that $X \times \mathbb{C}$ is biholomorphic to $\mathbb{C}^{m+1}$ and $X$ is not biholomorphic to $\mathbb{C}^m$. This settles the Holomorphic Cancellation Problem in the negative. We also construct holomorphic actions of $\mathbb{C}^*$ and finite cyclic groups on complex Euclidean spaces that are not topologically conjugate to linear actions.

fields
Complex Variables
pdf ↗ page arXiv:2610.12581 ↗

In 1970, P. R. Halmos raised ten open problems on operator theory. The third problem of Halmos is the following: if an intransitive operator has an inverse, is its inverse also intransitive? This question is reduced to the case of conjugate bi-geometric operators in arXiv: 2610.11202. In the framework of conjugate bi-geometric operators, using tools from complex geometry, operator theory, and function theory, this paper gives an affirmative answer to the third problem of Halmos in the following cases: (a) bundle-preserving operator;(b) subexponential growth of operator norms. These two cases cover a large class of operators.

comments
28pages
fields
Functional Analysis
pdf ↗ page arXiv:2610.12857 ↗

Goal-oriented communication often struggles to sustain downstream task performance under variable and unpredictable bandwidth. We address this problem by proposing GO-OAE (Goal-Oriented Ordered AutoEncoding), which learns a progressively refinable quantized latent sequence, optimized directly for task utility rather than source reconstruction. Each component of the sequence is represented for transmission by its code index, and the learned ordering enables inference from any received prefix of the index sequence, with performance improving as more indices arrive. We prove that optimizing the goal-oriented distortion objective is equivalent to solving a weighted conditional information bottleneck formulation, and introduce an unbiased multi-prefix importance sampling (MPIS) estimator, to reduce GO-OAE training computational cost from O(BK) to O(Bm) with m << K, and reduces the estimator variance by a factor of 1/m. Experiments show that, on MiniImageNet, GO-OAE achieves over 96% of the lossless upper-bound classification accuracy using 324 bits per image (683X compression vs. raw RGB), and already attains over 94% of the upper bound with only 70% of the transmitted indices. It consistently outperforms reconstruction-optimized codecs and ordered autoencoders trained with uniform prefix sampling across all transmission budgets, demonstrating effective communication at extreme compression rates.

fields
Information Theory
pdf ↗ page arXiv:2610.13426 ↗

Parameterized Quantum Circuits have emerged as a central framework for variational quantum algorithms in the NISQ regime, with major applications in quantum simulation, combinatorial optimization, and, more recently, quantum machine learning (QML). By developing a new approach for computing dynamical Lie algebras associated with quantum circuits combining parametrized gates and non-parametrized entangling gates, we aim to extend the applicability of recent algebraic results to architectures that are actually used in quantum machine learning.

comments
24 pages, accepted as a poster at the QTML Conference
fields
Quantum Algebra
pdf ↗ page arXiv:2610.13709 ↗

In the classical occupancy problem, $B$ balls are placed independently and uniformly into $d$ boxes. We study a graph analogue of this model. Let $G$ be a directed $r$-regular graph on $d$ vertices and fix a vertex $i$. Consider all paths of length $L$ starting from $i$, and let $N_L(i,j)$ denote the number of such paths ending at a vertex $j$. Thus the vertices play the role of boxes and the $r^L$ paths play the role of balls. In general, these occupancies depend strongly on the geometry of $G$. We show that inserting independent uniform permutations between successive layers restores the classical Poisson behavior at the empirical level. Although the path endpoints remain strongly dependent, their empirical occupancy distribution has the same limiting Poisson law as independent balls thrown into boxes. More precisely, at the critical scale $r^L/d\toλ\in(0,\infty)$, provided $rL/d \to 0$, the empirical path multiplicity distribution converges in Wasserstein distance to $\operatorname{Pois}(λ)$, independently of the geometry of the underlying graphs. We also prove a local Poisson limit theorem and a Berry-Esseen bound for the empirical distribution functions. These estimates determine the full total-variation transition of the normalized path multiplicities toward uniformity. For arbitrary doubly stochastic kernels, we further establish exact covariance and Frobenius norm identities, together with an exact contraction formula for the chi-square divergence. As applications, we study synchronous opinion averaging, obtaining an explicit cutoff profile for equal-size groups and quantitative convergence to consensus for heterogeneous group sizes.

comments
29 pages, 3 figures
fields
Probability
pdf ↗ page arXiv:2610.14724 ↗

We prove that, in every dimension, a bounded, non-constant entire solution of the Allen–Cahn equation whose zero set is contained in a half-space is a one-dimensional heteroclinic solution.

comments
v2: fixed minor typos, improved exposition, added references
fields
Analysis of PDEs, Differential Geometry
pdf ↗ page arXiv:2610.15014 ↗

We establish lower bounds for the non-vanishing proportions of primitive cubic, quartic and sextic Dirichlet $L$-functions over $\F_q[T]$ in the non-Kummer setting. Adapting truncated-exponential techniques for shifted moments, we improve the cubic lower bound of David, Florea and Lalín and obtain positive lower bounds for quartic and sextic families. For each family, the lower limit of the non-vanishing proportion exceeds $e^{-e^{53}}$ as the conductor degree tends to infinity with $q$ fixed. We use a common choice of truncation parameters and explicitly control the exceptional sets. The cubic argument uses the published twisted first moment. We also establish uniform twisted first moments in the quartic and sextic cases, yielding an asymptotic formula for the sextic first moment.

fields
Number Theory
pdf ↗ page arXiv:2610.15316 ↗

We show that in any hypothetical $G$ = srg(99,14,1,2) a spanning subgraph with $189$ edges is forced. Moreover, the graph formed out of the remaining edges has the spectrum $(12^1,-4^{30}, 3^{40},-2^6,0^7)$ expressed in Brouwer's notation.

comments
4 pages, 2 figures. v2: Substantially reworked, though the overarching topic remains the same
fields
Combinatorics
pdf ↗ page arXiv:2610.16266 ↗

We prove an upper bound for the error term in the higher rank hyperbolic lattice counting problem for ${\hbox{SL}(n, \mathbb{Z})}$. Blomer and Lutsko achieved recently a significant improvement of previous known results by Duke–Rudnick–Sarnak and Gorodnik–Nevo–Yehoshua. We deduce an improved upper bound for the error which holds for almost all pairs $z,w \in {\hbox{SL}(n, \mathbb{R})}$. We also derive a $Ω$-result for the error term, in the spirit of Phillips–Rudnick.

comments
25 pages, 1 figure
fields
Number Theory
pdf ↗ page arXiv:2610.16668 ↗

We prove that every Lawson surface $ξ_{k,l}\subset\mathbb S^3$ of genus $kl>1$ is non-algebraic: any real polynomial vanishing on $ξ_{k,l}$ vanishes identically on $\mathbb S^3$. This answers a question posed by Hsiang in 1967 and proves Lawson's 1970 conjecture for $ξ_{2,2}$. The proof uses a reflection principle for the monodromy of the associated family of flat connections.

comments
24 pages. Comments are welcome
fields
Differential Geometry, Algebraic Geometry
pdf ↗ page arXiv:2610.16853 ↗

Let lambda(n) denote the infimum of -min_x sum_{a in A} cos(ax) over all sets A of n positive integers. While the classical Sidon-difference construction yields lambda(n) <= (1 + o(1))sqrt(n)/2, we construct sets achieving a leading constant of 1/2: lambda(n) <= (1/2)sqrt(n) + O(n^(1/4)sqrt(log n)), establishing limsup_{n->infinity} lambda(n)/sqrt(n) <= 1/2. This construction combines a two-sided Sidon square identity, a Singer difference set, a Fejer-kernel majorant, a parity-biased deletion, and an exact-cardinality probabilistic selection. We also provide an L^4 criterion and a multiplicity bound constraining any construction with a smaller leading constant. In the opposite direction, we incorporate the L^1 norm into Bedert's boundary estimate with an explicit constant, yielding two lower bounds for f_A(x) = sum_{a in A} cos(ax): (1) -min f_A >= cn^(1/4) for every n-element set A subset of [1, Cn]; and (2) (-min f_A)^3 ||f_A||_1^2 >= cn for every n-element set A subset of N. The second bound recovers the 1/5 exponent of Bedert and Shankar and improves it whenever ||f_A||_1 is small relative to -min f_A. Numerical values of the construction are reported up to |A| = 25,440.

fields
Number Theory
pdf ↗ page arXiv:2610.17160 ↗

We study the rough differential equation $$ \frac{du_t}{dt}= F(u_t) ζ_t, \ \ u(0) = u_0 \in \mathbb{R}^d, $$ where $F : \mathbb{R}^d \to L(\mathbb{R}^d, \mathbb{R}^d)$ is a sufficiently regular vector field, and the noise $ζ$ is a distribution in $\mathscr{C}^{α-1}(\mathbb{R})$ for $α\in (\frac{1}{4}, \frac{1}{3})$. We construct solutions to this equation at lower regularity than previous work of Gubinelli-Imkeller-Perkowski and Prömel-Trabs using ideas from the high-order paracontrolled viewpoint of Bailleul-Bernicot. The key tool in our work is the development of a harmonic-analytic framework for proving a set of iterated commutator estimates which are necessary for the solution theory. We also show the procedure of enhancement when the noise $ζ= dZ$, where $Z$ is a realization of fractional Brownian motion with Hurst parameter $H \in (\frac{1}{4}, \frac{1}{3})$.

comments
50 pages; small typos with scaling fixed in Lemma 3.3f. Comments welcome!
fields
Probability, Analysis of PDEs
pdf ↗ page arXiv:2610.17307 ↗

We derive a recurrence for logarithmically weighted Möbius sums by combining Möbius inversion with the Euler-Maclaurin summation formula. Consequently, starting from estimates of orders zero, one and two, we obtain polynomial approximations for these sums for every nonnegative integer exponent of $\log$. We then extend these estimates to sums with coprimality conditions via a convolution identity and to sums weighted by the reciprocal of the sum-of-divisors function. We also study the nonnegativity of the latter sums for every positive integer logarithmic order, establishing that they never change sign.

comments
Typos and minor errors corrected. Updated
fields
Number Theory
pdf ↗ page arXiv:2610.17720 ↗

We develop an algebraic theory of local intertwining periods for symmetric pairs $(G,H,θ)$ over non-archimedean local fields $F$ of characteristic different from $2$, and finite-length representations of Levi subgroups of $G$ with coefficients in an algebraically closed field $R$ of characteristic different from the residual characteristic of $F$. For open orbits this algebraic version is essentially contained in the work of Blanc and Delorme. The theory relies on a crucial new uniqueness result, extending a result of Blanc and Delorme for open periods, which asserts that an admissible intertwining period is the only $H$-equivariant linear form extending the corresponding integral on the space of well-supported sections. In the group case it recovers at once the results of Dat on algebraic intertwining operators. Our algebraic construction does not require the unimodularity hypothesis imposed in the work of Matringe–Offen–Yang. When $R=\mathbb{C}$, we also remove this assumption in the classical non-archimedean analytic setting, and prove convergence of intertwining periods for all symmetric spaces. At the same time we extend the context of the whole theory in the following manner: we allow $F$ to be of positive odd characteristic, we allow twisting characters in the periods, and we allow $H$ to lie between $(\mathbb{G}^θ)^\circ(F)$ and $G^θ$. Finally, in the algebraic setting, we obtain explicit polynomial bounds for the singularities of intertwining periods, and compute them in a concrete case.

comments
AI tools have been used; see the corresponding section for details. In this second version, we have replaced the application to quaternionic symplectic models, as we found a simpler proof of the conjecture it was used to establish. We also recover Dat's results on algebraic intertwining operators as a direct application of our algebraic theory
fields
Representation Theory
pdf ↗ page arXiv:2610.17783 ↗

We prove the existence of unique solutions ${u\in H^1(0,T;L^2_γ(\mathbb{R}^n))\cap L^2(0,T;H^1_γ(\mathbb{R}^n))}$ of the transport equation $u_t=F\cdot\nabla u+f$ and the orthogonal dynamics equation ${u_t= Q_\text{Z} (F\cdot\nabla) Q_\text{Z} u+f}$, where $F$ is a time-independent vector field, $f$ is a forcing term, $P_\text{Z}=1-Q_\text{Z}$ is a Zwanzig projection (conditional expectation) on $L^2_γ(\mathbb{R}^n)$ defined by $P_\text{Z}h \propto \int h(\cdot ,y) ρ(\cdot,y)\rm{d}y$, and $γ$ is the standard Gaussian measure with density $ρ$. To this end, we develop a vanishing viscosity method based on the maximal regularity theory for the Ornstein-Uhlenbeck operator on $L^2_γ(\mathbb{R}^n)$. The following assumptions guarantee the existence and uniqueness of strong solutions: ${f\in H^1(0,T;L^2_γ(\mathbb{R}^n))\cap L^2(0,T;H^1_γ(\mathbb{R}^n))}$, ${g\in H^1_γ(\mathbb{R}^n)}$, $F\in W^{1,\infty}(\mathbb{R}^n,\mathbb{R}^n)$ and $\rm{ess\,sup}_{\mathbb{R}^n}\left(x\cdot F-\rm{div}F\right) < \infty$, where $g$ denotes the initial value function.

fields
Dynamical Systems
pdf ↗ page arXiv:2610.18647 ↗

This paper studies several first-order methods for low-rank matrix minimization in the Burer–Monteiro form, where the target matrix is represented as the product of a nonnegative factor matrix and its transpose. Such a factorization destroys convexity of the objective function and global Lipschitz continuity of the gradient. We prove that for a quadratic objective function that is strongly convex only on the subspace of symmetric matrices, the Burer-Monteiro factorized objective possesses generalized smoothness with a fractional exponent 2/3. For a quadratic objective, the generalized smoothness property requires positive definiteness of the operator A only on the subspace of symmetric matrices, which relaxes the assumptions of Dragomir et al. On this basis, three methods are proposed: an adaptive gradient descent method with Armijo backtracking; an unconstrained SafeAdam method combining the Adam direction with a descent-angle certificate and a fallback to the normalized gradient; and a certified projected version for the nonnegativity constraint. Global convergence and explicit convergence rates for the proposed methods have been proved. The obtained convergence rate is better than the convergence rate of ordinary unaccelerated gradient descent in the case of a sufficiently large gradient. In the small-gradient regime, the convergence guarantee is of square-root type, and the corresponding complexity scales as the inverse square of the desired accuracy. In the large-gradient regime, the convergence guarantee is of three-quarters type, and the corresponding complexity is proportional to the inverse of the accuracy raised to the power of 4/3. Experiments on SymNMF using the TDT2, Reuters and CBCL datasets, which are standard benchmarks for document and image clustering, show that the methods match or outperform Dyn-NoLips without tuning the relative-smoothness kernel parameters.

fields
Optimization and Control
pdf ↗ page arXiv:2610.19059 ↗

We introduce binary cyclic gradient coding (BCGC), an exact gradient coding scheme for $n$ workers and up to $s$ stragglers. Its encoding matrix is binary, circulant when $(s+1)\mid n$ and nearly circulant otherwise, and the master decodes by a single summation. Like the fractional repetition coding scheme (FRC) and its generalized version (GFRC), BCGC splits the workers into $s+1$ classes that each cover the whole dataset, but it assigns the data through cyclic supports. Its encoding matrix has rank $n-s$, and $n-s-1$ workers keep the balanced load $s+1$, which is the largest possible number. We prove that encoding matrix of BCGC is not permutation-equivalent to those of FRC and GFRC schemes. Moreover, We also prove that a binary coded scheme with compression is equivalent to an uncoded compressed scheme on a coarser partition of the data. This explains why binary schemes remain stable under compression, whereas the large decoding coefficients of MDS codes amplify the compression error and lead to divergence in our experiments. For every contractive compressor, the standard convergence guarantee of compressed gradient descent holds on each coarse partition. FRC, GFRC and BCGC therefore share the same convergence guarantee and differ only in their partitions, with one partition for FRC, two for GFRC and $s+1$ distinct partitions for BCGC. Choosing among these partitions can recover the exact gradient in cases where FRC and GFRC cannot. Experiments on four datasets confirm the theory. BCGC matches GFRC, keeps its accuracy under top $κ$ sparsification while the MDS codes diverge, and on heterogeneous data its partition diversity reduces the compression error and improves the accuracy.

fields
Information Theory
pdf ↗ page arXiv:2610.20087 ↗

We study the Cauchy problem for the energy-critical Schrödinger map into the 2-sphere: \[ \partial_{t}u = u\timesΔu, \quad (t,x)\in\mathbb{R}^{1+2}, \quad u(t,x)\in\mathbb{S}^2 \] for equivariant initial data of homotopy degree $k=1$. Given any integer $L\in\mathbb{N}_+$, we exhibit a set of initial data arbitrarily close to the ground state harmonic map in the energy norm such that the corresponding solution blows up in finite time with a quantized rate \[ λ(t)\sim \frac{\left(T-t\right)^L}{\left|\log(T-t)\right|^{\frac{2L}{2L-1}}} \quad\mbox{as}\ \ t\uparrow T. \] Our proof is inspired by the techniques developed for the energy-critical harmonic map heat flow in a similar context by Raphaël and Schweyer [Anal. PDE 7 (2014), 1713–1805]. However, its adaptation to a Schrödinger-type equation requires the introduction of a new energy-Virial-Morawetz Lyapunov functional tailored to quantized slow blowup dynamics.

comments
110 pages
fields
Analysis of PDEs
pdf ↗ page arXiv:2610.20313 ↗

In this article, we study the mixed-moment problem for the product of central values of two $L$-functions twisted by a Dirichlet character of large conductor $q$. Precisely, for a fixed $\mathrm{SL}_3(\mathbb{Z})$ Hecke-Maass cusp form $π$, we asymptotically evaluate the first moment, with $\textit{power-saving}$ error term for the product of central $L$-values $L(1/2, π\timesχ)\overline{L(1/2, χ)}$ averaged over the $\textit{full family}$ $\{χ\,(\mathrm{mod}\,{q}): Q\leq q\leq 2Q\}$ of primitive Dirichlet characters modulo $q$. And as a consequence, we also established the simultaneous non-vanishing of the aforementioned central $L$-values.

comments
Some errors in the earlier draft have been fixed. Comments are welcome!
fields
Number Theory
pdf ↗ page arXiv:2610.20792 ↗

We are concerned with dissipation enhancement by divergence-free transport noise for stochastic \(p(x)\)-Laplace equations on \(\mathbb T^d\), \(d\ge2\). Spatially variable growth removes homogeneous scaling and produces two flux growth regimes. For periodic log-Hölder continuous exponents satisfying \(2<p^-\le p^+<\infty\), we first establish global variational well-posedness and the exact energy identity in the natural dual spaces. Under the additional condition \(p^+<2d/(d-2)\) when \(d\ge3\), we then prove averaged algebraic decay with any prescribed coefficient, uniformly on bounded zero-mean \(L^2\) balls, by estimating the two flux powers separately. A deterministic lower bound yields strict averaged comparison with the unperturbed flow at prescribed positive times on shells with bounded gradient modular. We also prove optimality of the modular coercivity exponent \(p^+\) near zero. Finally, combining these estimates with intervalwise noise acceleration from the constant-exponent theory gives exponential decay in mean square and almost surely, with moments of the random prefactors bounded uniformly on the initial-data ball. For the exponential estimates, the noise depends on the prescribed rate and moment order; its intensity is fixed in time and its frequency range increases.

fields
Probability
pdf ↗ page arXiv:2610.21242 ↗

Let $E$ be chosen uniformly from the geometric isomorphism classes of supersingular elliptic curves over $\overline{\mathbb{F}}_p$ and $δ_E$ be the minimum degree of isogenies from $E$ to its Frobenius conjugate $E^{(p)}$. We establish bounds for the smoothness probability of $δ_E$ and hence affirm Wesolowski's $p^{1/3+o(1)}$ attack on the supersingular endomorphism ring problem is unconditional. We also establish a uniform asymptotic formula, with a main term expressed in terms of Dirichlet $L$ values, for the probability that a connection isogeny of degree $n$ exists between $E$ and $E^{(p)}$.

fields
Number Theory
pdf ↗ page arXiv:2610.21488 ↗

For each integer $k \ge 2$, we prove that an abelian group $Γ$ satisfies $\exp(Γ) \in \{1,\dots,k\} \cup \{2,4,\dots,2k\}$ if and only if it admits no non-bipartite Cayley graph whose circular chromatic number is strictly less than $2 + \frac{2}{k-1}$. This refines the algebraic characterization by Krebs and Sankar of abelian groups that admit $3$-chromatic Cayley graphs.

comments
14 pages, Theorem 3.5 was added, references were updated
fields
Combinatorics, Group Theory
pdf ↗ page arXiv:2610.21940 ↗

A fusion ring is said to be vanishing if one of its multiplication matrices has determinant zero. We classify all vanishing fusion rings of rank four. We then provide a more explicit classification in the integral case, which leads to new consequences: there are infinitely many nonisomorphic simple integral vanishing fusion rings of rank four and no simple integral fusion ring of rank four is 1-Frobenius. We also classify all Burnside fusion rings of rank four.

comments
17 pages, Theorem 1.8 has been strengthened (we now classify all nonpointed Burnside fusion rings of rank four), and streamlined Section 3. Comments are welcome!
fields
Number Theory, Mathematical Physics
pdf ↗ page arXiv:2610.22000 ↗

We present a brief, elementary proof of a striking theorem by I. Chowla on the addition of residue classes (1937) which generalizes the famous result of Cauchy and Davenport to residue classes modulo a composite.

comments
There is an error in the proof
fields
Commutative Algebra, Number Theory
pdf ↗ page arXiv:2610.22427 ↗

We establish a non-split Motohashi formula for toric Eisenstein periods over an arbitrary number field $F$. For a quadratic extension $E/F$, we compare toric Fourier inversion for a product of two Eisenstein series with the $\mathrm{GL}_2/F$-spectral expansion of its Rankin–Selberg kernel. The kernel regularizes the product in a cone of absolute convergence. Eisenstein corrections and contour residues give the geometric and residual terms in the meromorphically continued identity. Suitable test data give twisted first- and second-moment formulas for the completed $L$-functions of everywhere unramified toric characters. Over general $F$ these provide an adelic counterpart of the moment formulas of Duke–Friedlander–Iwaniec that does not use the geometry of Heegner points. In the CM case, we prove the absolute nonvanishing proportion $4.9\times10^{-4}$ for every totally real base field and all sufficiently large CM discriminants, with the threshold depending on the base field and no restriction on the number of ramified primes. We incorporate inverse Euler factors at small ramified primes into the mollifier. Local unit-group tests control the resulting moments and remove the ramified Euler-factor loss.

comments
62 pages. Revised introduction to discuss related work of Blomer, Brumley and Radziwill (arXiv:2603.05609); added an acknowledgment. Main results unchanged
fields
Number Theory
pdf ↗ page arXiv:2610.22728 ↗

We study the common spanning structure of connected finite simple graphs that are indistinguishable by uniformly initialized color refinement. We prove that any two such graphs with common cyclomatic number $r\ge2$ contain isomorphic spanning forests with at most $r-1$ components. This bound depends only on $r$ and is sharp for every $r\ge2$, even when both graphs have maximum degree at most three. We also determine the maximum, over all such graph pairs without restricting their order, of the minimum edge symmetric difference under vertex bijections: it is exactly $4(r-1)$.

fields
Combinatorics
pdf ↗ page arXiv:2610.22909 ↗

In over-the-air split learning over an aging single-antenna Rayleigh channel, the mean returned gradient equals the antenna-domain gradient scaled by the temporal correlation. Uncorrected training collapses in negative-correlation lobes. Near a correlation zero, no nonzero scalar calibration improves the ratio of mean power to innovation power for an individual transmission, and, on the tested grid, using sixteen times as many pilots recovers only 7 percent of the training gap. Returning at the first correlation extremum with phase correction, 1.3 ms later at 3.5 GHz and 15 m/s, achieves 90.2 percent accuracy, compared with 91.8 percent with CSI. In the tested line-of-sight setting, the near-zero gap becomes negligible.

comments
revised: theory reframed as instantiation of classical results, added line-of-sight extension
fields
Information Theory
pdf ↗ page arXiv:2610.23135 ↗

Over-the-air split learning returns the receiver's loss gradient through the reciprocal channel, so terminal motion between the forward and backward transmissions corrupts the backward pass. We repair the aged return at a fixed receive array using only second-order statistics. Two numbers taken from the forward-backward cross-covariance, the alignment reachable by the best common phase and by the best unitary correction, bound the main term of every repair. In the 3GPP tapped-delay-line channels TDL-A/B/C, where every antenna ages by the same scalar, the two numbers coincide, and at a correlation zero all tested fixed corrections stay between 58% and 62% accuracy, whereas a return delayed to the next correlation lobe reaches 98.4%. In 3GPP clustered-delay-line channels a statistical unitary correction stays within 0.02 in mean cross-entropy of ideal channel knowledge in all six tested profile and speed combinations, while common-phase correction falls to 69% for CDL-A at 3 km/h and the tested delay loses up to 10 points. In a two-cluster model spatial correction is decisive only where the common-phase alignment nearly vanishes (64% to 95%). With a ResNet-18 on CIFAR-10, only the delayed return trains at a separable correlation zero (86% against at most 16%), and at 30 km/h in a clustered-delay-line channel the unitary correction reaches 80% where the common phase reaches 60%. Given geometry, displacement and angular statistics, a port permutation chosen by linear assignment reaches 99.5-99.7% accuracy for hexagonal and square arrays in oblique motion without pilots or digital feedback during training, where nearest-position matching drops to 89%.

comments
v2: substantially revised and retitled (v1: "Coherent but Discordant: Rotate, Don't Invert, to Backpropagate Through an Aging Channel"). Adds 3GPP TDL/CDL, matched-normalization and CIFAR-10 split-learning experiments. The v1 claim that unitary correction outperforms inversion is withdrawn. 9 pages, 2 figures, 5 tables
fields
Information Theory
pdf ↗ page arXiv:2610.23137 ↗

We give an explicit construction of a pair of anticommuting Weyl displacement operators for a harmonic oscillator and use bounded functional calculus to obtain exact dichotomic representatives of the Pauli algebra. Two independent oscillators provide commuting Pauli algebras for Alice and Bob. The standard singlet-sector projector, written entirely in terms of these bounded oscillator observables, is then applied to the two-oscillator vacuum. We show explicitly that the projected vacuum has nonzero norm, so its normalization is well defined, has the exact singlet correlations, and reaches the Tsirelson value $2\sqrt2$ for the usual Bell–CHSH settings. We also clarify that the construction generally realizes a singlet sector with multiplicity, rather than selecting a unique vector in the full oscillator Hilbert space, and we compare the construction with the older pseudospin approach to continuous-variable Bell tests.

comments
8 pages. Published in Physics Letters A. Final version: corrected numerical values and typos; added proofs of the vanishing vacuum expectation of Y and strict positivity of the vacuum overlap for every finite r > 0
fields
Mathematical Physics
pdf ↗ page arXiv:2610.23264 ↗

We study flat left-invariant pseudo-Riemannian metrics on nilpotent Lie groups. Associated with a flat metric Lie algebra $(\mathfrak{g},\langle\cdot,\cdot\rangle)$ there is a canonical affine action of the corresponding group on the vector space $\mathfrak{g}$, whose linear part is the Levi-Civita representation $L$. Combining this action with Scheuneman's theorem on pure translations in nilpotent affine groups, we prove that a flat metric nonabelian nilpotent Lie algebra has a nontrivial kernel of $L$, that is, $\ker L\neq 0$. As a consequence, every $n$-dimensional flat metric nonabelian nilpotent Lie algebra is a double extension of an $(n-2)$-dimensional flat metric nilpotent Lie algebra.

comments
Theorem 3.1 is incorrct and so the proof of Theorem 1.1 is wrong. Although the main result might still true
fields
Differential Geometry
pdf ↗ page arXiv:2610.23481 ↗

The Schur sector of four-dimensional $\mathcal N=4$ super Yang$--$Mills theory contains infinitely many protected operators, while the invariant polynomials of a single adjoint scalar are organized by finitely many Casimir degrees. I prove that the small $\mathcal N=4$ short multiplets built from these invariants strongly generate the associated chiral algebra, thereby establishing the $SU(N)$ case of the strong-generation conjecture of Beem et al. For every $N\ge2$, all field components associated with degrees $2,\ldots,N$ suffice, in every conformal weight and every degree of the standard relative quantum BRST cohomology. The proof brings together cyclic trace cohomology, quantum lifting, and an arbitrary-degree quartic$--$odd transport identity. Exact field relations and a finite-rank Newton obstruction exclude every additional lowest space, including non-scalar flavor representations; the required normal-ordering corrections and BRST primitives are derived explicitly. The resulting completeness theorem explains how a finite family of supersymmetric multiplets organizes an unbounded quantum spectrum. Every Schur class is a normal polynomial in their components and derivatives, even when its gauge-theory representative involves fermions and arbitrarily many derivatives. This supplies a uniform set of local inputs for meromorphic operator products, bounds protected state multiplicities before cancellations in an index, and gives an algebraic account of the finite-rank reorganization of protected trace operators.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.24594 ↗

The explore-exploit trade-off is the core problem of reinforcement learning (RL). In its multi-agent, resource-sharing form the optimum is not a scalar-return maximum but an equilibrium allocation -- the ideal-free distribution (IFD), the Nash equilibrium of a congestion game. We show that a minimal foraging swarm reaches the shape of this equilibrium as a self-organized attractor -- foragers in proportion to resource richness (matching slope 0.94) -- with no learner, no trained parameters, and no payoff or reward read anywhere in its dynamics. Agents explore by heavy-tailed (Levy) flights, recruit neighbours to a discovery through a threshold cascade on their proximity network, and disperse as a patch crowds; removing the coupling of recruitment to movement collapses the matching (slope 0.08). The reinforcement learning is at the level of the problem and the allocation reached, not the micro-rule. The swarm reaches this equilibrium rather than learning it, attaining its shape but not the exact equilibrium: it stays measurably exploitable (Nash-gap 0.58 versus ~0.01 for a converged learner). Against PPO learners (feedforward, centralized-critic, and graph message-passing) trained in the same sensing-limited environment, the reward-free swarm at zero training matches the IFD gradient more faithfully than any learner (slope ~1 vs 0.69-0.91) and ties the best learner's harvest where clustered (both plateau at ~0.80 of an oracle ceiling), while the learner collects more where resource is scarce (0.33 vs 0.22) and holds tighter per-capita intake. Learning thus buys precision and transfer, not a better allocation; neither message passing nor a centralized critic exceeds it at this budget. We read this not as beating RL, but as evidence that a minimal swarm's physics reaches the equilibrium RL seeks without a learner, a reward, or a trained parameter. A companion paper develops the mechanism.

fields
Mathematical Physics
pdf ↗ page arXiv:2610.25113 ↗

Let $C_n^r$ denote the direct sum of $r$ cyclic groups of order $n$, where $n\ge2$ and $r\ge1$. Properties C and D predict a uniform multiplicity structure for extremal zero-sum problems over $C_n^r$: every sequence of maximum length avoiding nonempty zero-sum subsequences of length at most $n$, or of length exactly $n$, respectively, should have the form $T^{n-1}$. We prove that, for every $r\ge4$ and every even $n\ge2$, each of these properties holds if and only if $n$ is a power of two. This gives negative answers to the general Property C problem posed by Gao, Hou, Schmid and Thangadurai Open Problems 1.2{GHST} in 2007, and disproves the Property D conjecture proposed by Gao and Geroldinger [Conjecture 7.2]{GG} in 2006.

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

Let $B$ be a piecewise hereditary algebra of affine type over an algebraically closed field. In this paper we give a derived and stable equivalence classification of twisted multifold extensions of $B$. The types $\widetilde D$ and $\widetilde E$ are already covered by the classification for tree type. We therefore consider the remaining types $\widetilde{A}_{p,q}$. We show that the $n$th power of the Nakayama functor on the full subcategory of a transjective component determines the twist, including its action on morphisms, up to conjugacy in the derived Picard group of a hereditary algebra. Together with the hereditary derived type and the folding number, this gives a complete invariant for derived equivalence, and also for stable triangle equivalence. We then compute these conjugacy classes in the unbalanced, balanced, bypass, and Kronecker cases, keeping the finite rotation data. Finally, by the normalization theorem of Asashiba–Kimura–Nakashima–Yoshiwaki, we obtain the same classification for generalized multifold extensions with nonzero integer jump.

comments
43 pages. Appendix A has been revised: the proof of Proposition A.2 now uses a covering theorem for group actions rather than the more general 2-categorical machinery. The main results are unchanged
fields
Representation Theory, Category Theory, Rings and Algebras
pdf ↗ page arXiv:2610.25312 ↗

Tatsuoka et al. proposed an efficient algorithm for computing the matrix logarithm using the double-exponential (DE) formula. Its discretization error decreases exponentially as the number of quadrature nodes grows, and its nested grids allow previously computed values to be reused when the mesh is refined. They also reported that their approach is more robust than Gauss–Legendre quadrature for ill-conditioned matrices. We propose two algorithms based on the DE formula. The first adaptively refines the mesh while reusing previously computed values and requires no matrix norm computations. The second uses a rigorous error bound to select the number of quadrature nodes a priori. Numerical experiments show that both methods attain lower errors than Tatsuoka et al.'s method at comparable elapsed times over the tested ranges.

comments
Keywords: Matrix function, numerical integration, double-exponential formula, computable error bound
fields
Numerical Analysis
pdf ↗ page arXiv:2610.25361 ↗

We address the structural stability of transonic shock solutions to the Zeldovich-von Neumann-Döring (ZND) combustion equations in a cylindrical domain under three-dimensional perturbations of the incoming supersonic flow and exit pressure. The perturbed transonic shock is completely free and its strength and position are uniquely determined by the incoming flow and the exit pressure. The solution shares the same regularity for the velocity, the pressure, the entropy and the fraction of unburned gas. The main difficulties are that the shock front is a free boundary to be determined simultaneously with the subsonic flow and the equations for all states are coupled with each other due to the combustion process. One of the key ingredients of the analysis is to reformulate the three-dimensional ZND combustion equations into a deformation-curl system and four transport equations in terms of the deformation tensor and vorticity. Another one is an elaborate decomposition of the Rankine-Hugoniot conditions so that the shock front is uniquely determined by an algebraic equation and an unusual second order differential boundary condition is obtained on the shock front for the first order nonlocal deformation-curl system, from which an oblique boundary condition can be derived after homogenizing the curl system and introducing the potential function.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.25614 ↗

In this paper, we resolve the local cone conjecture proposed by Kienzler, Koch, and Vázquez concerning the free-boundary regularity of the porous medium equation. We prove that the local cone condition guarantees the smoothness of the free boundary lying outside the initial support. The proof relies on new gradient estimates obtained through maximum principle arguments and comparison principles. As an application, we establish the global-in-time smoothness of the free boundary for solutions with convex initial support under standard assumptions on the initial data.

fields
Analysis of PDEs
pdf ↗ page arXiv:2610.25740 ↗

Testing by betting is a powerful framework that recasts hypothesis testing as a betting game. A popular approach spreads the initial wealth over fixed bets according to a prior distribution, using a universal portfolio algorithm. For suitable priors, this approach achieves the optimal expected rejection time as the error probability goes to zero at a fixed alternative. Yet, priors with this guarantee can behave quite differently near the null. This motivates the question: Which prior should we use in testing-by-betting algorithms? We study bounded scalar payoffs and, under technical conditions, prove a sharp formula for expected rejection time, uniform over all bounded alternatives as the error probability tends to zero. The formula shows how the prior's mass around the zero bet determines the cost of adapting to an unknown alternative. We characterize the priors that attain the best possible leading constant when the error probability and alternative vary together. We also show that no valid test can uniformly improve on this cost across ranges of alternatives near the null. In particular, the uniform prior can require arbitrarily more observations than suitable priors that concentrate around the zero bet. A general inversion argument converts our results into sharp expected times to reach a prescribed confidence-sequence width. We also give a concrete prior choice and an FFT-based algorithm with almost linear computational complexity.

comments
Drastically improved the main results, added confidence sequences, improved numerical implementation, reorganized the paper
fields
Statistics Theory, Information Theory
pdf ↗ page arXiv:2610.25821 ↗

The polyatomic Boltzmann equation extends the classical kinetic description to gases whose molecules possess internal energy in addition to their translational motion. The distribution function then has one more variable than in the monatomic case, and the collision operator becomes an eight-fold integral whose evaluation dominates the cost of solving the equation. In this work, we propose a fast Laguerre–Fourier spectral method for the polyatomic Boltzmann equation with continuous internal energy, which evaluates the collision operator in $O(K^2MN^4\log N + K^3MN^4)$ online operations after a solution-independent precomputation, where $N$ is the number of Fourier modes in each velocity direction, $K$ is the number of Laguerre modes and $M$ is the number of quadrature points on the sphere. Specifically, the distribution function is expanded in generalized Laguerre functions in the internal energy and in Fourier modes in velocity. A sequence of changes of variables then separates the internal-energy integrals from the velocity convolutions, so that the former no longer involve the distribution function and are computed once and stored. Numerical experiments are presented for both the spatially homogeneous and the spatially inhomogeneous Boltzmann equation. They confirm the spectral accuracy of the proposed method and its agreement with the direct simulation Monte Carlo method.

fields
Numerical Analysis
pdf ↗ page arXiv:2610.25921 ↗

Let $(X,\mathcal B,μ)$ be a probability space and let $S,Q:X\to X$ be commuting probability-preserving transformations. Let $1\leq p,q\leq\infty$ satisfy $1/p+1/q\leq1$. We prove that, for every fixed $F\in L^p(μ)$ and $G\in L^q(μ)$, the averages $$ \frac1N\sum_{n=1}^N F(S^nx)G(Q^nx) $$ converge almost everywhere as $N\to\infty$. Our proof introduces a new analytic approach that relies on neither the circle method nor characteristic-factor theory. Exploiting the triangular structure arising from commuting transformations, we combine matrix-energy estimates with Gaussian heat-flow arguments to establish pointwise variation inequalities for suitable smooth averages. We then use even and odd Gaussian kernels to recover the convergence of the original averages.

comments
Revised proof and updated references. Added a note explaining that the main theorem is the same as the result previously formalized by van Doorn, Durcik, Roos, Slavíková and Thiele (Palomar, PALOMAR-2026-10-18-000026 v1). At present, we do not plan to submit this manuscript for journal publication
fields
Dynamical Systems
pdf ↗ page arXiv:2610.26388 ↗

Peres's iteration of von Neumann's procedure, run to exhaustion and keeping everything it does not extract, is a bijection of {0,1}^N that splits every string into fair bits and a residual. The residual is self-delimiting and determines the number of ones, so the fair bits are exactly uniform given the residual under every exchangeable law. Each residual one accounts for a power of two of the weight of the input; consequently, on every input of length N, the residual has fewer than sqrt(3) N^0.793 ones. This deterministic sparsity gives a short proof, with an explicit remainder, that the number of fair bits per symbol tends almost surely to the entropy, for Bernoulli sources and, by binarisation, on every finite alphabet. For coding, the Bernoulli likelihood factorises along the recursion, and code B, which stores the fair bits and codes the residual at plug-in biases, has the length of the two-part code. Alternatively, code G stores the fair bits and writes the Elias gamma codes of the gaps of the residual: it needs no parameter, no estimate and no arithmetic coder. On every string its length is at most the logarithm of the type class plus O(N^0.793 log N); a concatenation of J pieces costs, without transmitting the cuts, its piecewise empirical entropy plus a term that is sublinear when J = o(N). After a Burrows-Wheeler transform of the reversed string, code G competes on every individual sequence with the empirical conditional entropy of every order at once, which gives universality for stationary ergodic sources.

fields
Information Theory
pdf ↗ page arXiv:2610.26396 ↗

We study fixed-field analogues of the lattice product construction recently used by Bloom, Sawin, Schildkraut, and Zhelezov to disprove the sum-product conjecture over the real numbers. These sets are of the form $A_n = P_nG_n \subset F$, where $F$ is a fixed number field, $P_n$ can be rescaled to a set of algebraic integers whose conjugates are polynomially bounded in $|P_n \setminus \{0\}|$, and $G_n$ occupies a positive proportion of a bounded box of scale $Y_n$ in a fixed positive-rank multiplicative lattice. We prove that these fixed-field constructions satisfy the sum-product conjecture, $\max\{|A_n+A_n|, |A_nA_n|\} \ge |A_n|^{2-o(1)}$ as $|A_n| \to \infty$, with no restriction on the relative growth of the two factors. More strongly, any fixed power saving in the product set forces an asymptotically maximal sumset: there exists $C > 0$ such that, for each fixed $δ\in (0,1]$, if $|A_nA_n| \le |A_n|^{2-δ}$ for all sufficiently large $n$, then $Y_n \to \infty$ and $|A_n+A_n|/|A_n|^2 = 1/2 + O_δ((\log Y_n)^C/Y_n)$. In particular, the additive-box times unit-box construction of Bloom, Sawin, Schildkraut, and Zhelezov cannot produce sum-product counterexamples in any fixed totally real number field, at any relative scales. The proof combines a bound for factorizations of algebraic integers with a more general maximal-sumset theorem for coefficient sets whose nonzero-element ratios have small Weil height. The latter controls multiplication fibers and combines a lattice strip estimate with logarithmic separation derived from the theorems of Yu and Matveev.

comments
26 pages
fields
Number Theory, Combinatorics
pdf ↗ page arXiv:2610.26737 ↗

Let $0<γ_1\leq γ_2\leq \cdots$ be the ordinates of the non-trivial zeros of the Riemann zeta function in the upper half-plane, counted with multiplicity, and fix $c>0$. We say that a non-trivial zero $ρ_n=β_n+iγ_n$ is $c$-isolated if $\min(γ_{n+1}-γ_n, γ_n-γ_{n-1})>2πc/\log γ_n$. Note that any isolated zero is necessarily simple and on the critical line. We prove unconditionally that there exists a positive constant $c>0$ such that at least $13/20$ of the zeta zeros are $c$-isolated. Moreover, we can show that this proportion is more than $1/2$ when $c=1/6$. Previously, it was not known unconditionally that there are infinitely many isolated zeros. We also show that there are positive proportions of $k$ consecutive ``moderate'' gaps (gaps larger than a constant times the average local gap) between the ordinates of the zeta zeros, for $k=3, 4, 5$. As an application we combine our work on isolated zeros (which we extend to Dirichlet $L$-functions) with an unconditional refinement of the Bombieri–Hejhal method to show unconditionally that at least $31\%$ of the zeros of a linear combination of two distinct primitive Dirichlet $L$-functions with the same conductor and parity lie on the critical line and have odd multiplicity. The previous unconditional record for this proportion was $7.38\times 10^{-9}$, which was obtained by Dousselin who refined and made explicit a result of Selberg.

comments
Fixed some typos, updated the introduction and expanded the exposition. 26 pages
fields
Number Theory
pdf ↗ page arXiv:2610.26841 ↗

Indirect and noisy observations are difficult to invert when the forward operator smooths out the unknown signal. In this case, the unstable modes are precisely the modes that the data reveals least, thus the success of any reconstruction method depends on how prior information interacts with the geometry of the operator across regularity scales. Diffusion priors have become ubiquitous for such problems; however, the current theory still does not determine when a learned score remains informative under ill-posed forward operators. In this paper, we study posterior diffusion for linear inverse problems on Hilbert scales and derive a stability theory under an explicit score-amplification condition. Under a smoothing condition on the forward map, a source condition on the truth, and weak-norm control of score error, we derive non-asymptotic recovery bounds in \(\Hs^s\) that separate observation noise, score approximation, and reverse-time discretization. These bounds give a recoverable regularity threshold determined jointly by operator smoothing, truth regularity, score regularity, and the posterior correction. The threshold specifies the Hilbert-scale norms \(\Hs^s\) in which weak-norm score error remains controlled after propagation through the posterior reverse dynamics. For larger regularity indices \(s\), the inverse geometry magnifies the same error, and the Hilbert-scale recovery estimate no longer gives uniform stability. We also prove that a posterior correction adapted to the forward operator improves stability relative to isotropic guidance in the regularity ranges where the smoothing action of the forward map matters most. The recovery estimates give a regularity-sensitive theory of posterior diffusion and show how learned score error, operator smoothing, and reconstruction norm jointly determine the stable range predicted by the analysis.

journal
2026 Asilomar Conference on Signals, Systems, and Computers
fields
Information Theory
pdf ↗ page arXiv:2610.27030 ↗

In this work, we study numerical approximations of the equation \begin{equation} \partial_t^αu-\nabla\cdot\left(u^{m-1}\nabla(-Δ)^{-σ}u\right)=0, \end{equation} where $0<α<1$, $0<σ<1$ and $m>1$. The Caputo derivative is discretized by the L1 formula, while the nonlinear nonlocal flux is approximated by a conservative upwind finite-difference scheme. We establish several structural properties of the implicit scheme in arbitrary space dimension, including a discrete maximum principle, non-negativity, mass conservation, $\ell^\infty$ and $\ell^2$ stability, existence of non-negative discrete solutions, and a discrete energy-dissipation estimate. Our assumptions include natural symmetry, a sign condition on the sum of the directional coefficients, and decay on the discrete weights. We also derive a consistency estimate for the complete nonlinear spatial operator. For rigorous convergence analysis, we restrict ourselves to one space dimension and introduce the cumulative variable associated with the density. This transforms the discrete problem into a monotone approximation of an equation involving the fractional Laplacian. Interestingly, for semigroup-based pressure-gradient weights, the resulting discrete operator is identified with the fractional discrete Laplacian. Next, using comparison and contraction properties of the integrated scheme, for $m\geq2$ and under the stated spatial regularity and weighted temporal consistency assumptions, we prove uniform convergence of the cumulative numerical solution and convergence of the corresponding density against compactly supported smooth test functions. The temporal estimates allow a weak singularity at the initial time. We also analyze an explicit variant of the scheme and derive a sufficient CFL condition covering the full range $0<σ<1$.

comments
Extra acknowledgment added
fields
Numerical Analysis, Analysis of PDEs
pdf ↗ page arXiv:2610.27172 ↗

We classify all real linear into preservers of semipositivity on $M_{m,n}(\mathbb{R})$, $m,n\ge2$, for arbitrary source and target pairs of proper cones, without assuming invertibility or a prescribed form. The classification consists of product maps $L(A)=XAY$ and degenerate maps $L(A)=Ψ(u^TA)$, subject to explicit necessary and sufficient cone conditions. For square minimal semipositivity with respect to the standard nonnegative orthant, preservation instead forces the operator to be invertible: for $n\ge2$, the linear into preservers are exactly the maps $L(A)=XAY$ and $L(A)=XA^TY$ with $X,Y$ invertible and $X^{-1},Y^{-1}\ge0$. We also classify all linear preservers of orthant semipositivity from $M_{2,2}(\mathbb{R})$ to $M_{1,3}(\mathbb{R})$ into three disjoint classes, two of which lie outside product form.

comments
14 pages; added a classification of linear preservers of square minimal semipositivity; title and abstract updated
fields
Functional Analysis
pdf ↗ page arXiv:2610.27413 ↗

In this paper, we provide the exact formula for the $\mathrm{v}$-number of powers of the edge ideal of a cubic circulant graph $C_{2n}(a,n)$ with $1\le a<n$.

comments
There is an error in the formula in Theorem 4.13; it needs to be corrected
fields
Commutative Algebra
pdf ↗ page arXiv:2610.27545 ↗

The Terracini locus of a projective variety tells us the sets of points at which Terracini's lemma will fail to recover the dimension of the corresponding secant variety. We study the Terracini loci of tangential varieties of Veronese varieties, classifying several cases, including a complete classification of the Terracini loci of tangential varieties to rational normal curves. We also show that many Terracini loci involve only sets with "intratangent pairs" that lie on the same tangent space to the underlying Veronese variety. Finally, we give some applications to algebraic statistics, showing that osculating varieties of Veronese varieties are moment varieties for local mixtures of location families and connecting Terracini loci to local identifiability.

comments
20 pp, no content change from first version, but we now use thmtools to work around a TL2025 bug that made every reference appear as a theorem instead of lemma, remark, etc
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.27625 ↗

Polyak–Ruppert averaging gives SGD and momentum methods the same asymptotic covariance. We characterize how fast finite runs reach it and how far they can be parallelized. For strongly convex quadratics with additive noise, we prove an online–offline bridge: the empirical risk minimizer on the samples of a tail average is one Newton step from the tail-averaged query point of any online procedure. For SGD, heavy ball, and Nesterov's method with constant momentum, this step is a boundary term at the two ends of the tail and splits the gap to the offline estimator into center, covariance, and shape errors. Necessary and sufficient conditions show that, on the least curved direction, the center error sets the pace: SGD needs $m\ggκ^2$ rounds but momentum only $m\ggκ$, where $κ$ is the condition number, so at sample size $N$ the critical batch size grows from $Θ(\sqrt{N}/κ)$ to $Θ(\sqrt{N/κ})$. The covariance error separates the momentum methods: heavy ball has relative variance excess $Θ(κ^{3/2}/m)$ along the stiffest direction, whereas Nesterov has relative error $O(\sqrtκ/m)$ in every direction. The shape error is method-independent by a Berry–Esseen bound uniform in $κ$ and batch size, so confidence intervals are valid when the other two errors vanish. We further examine how the conclusions change under heavy-tailed or state-dependent noise and clipping, and establish a first-order comparison with ERM for nonlinear Nesterov averaging under explicit conditions.

fields
Optimization and Control
pdf ↗ page arXiv:2610.27990 ↗

Let $F$ be a graph on $m$ vertices with at least one edge, and let $0<p\le1$. We study when prescribed subgraph counts across disjoint vertex classes characterize $p$-quasirandom graph sequences. For positive multiplicities $\bm=(m_1,\ldots,m_r)$ summing to $m$ and positive class proportions $\balpha=(α_1,\ldots,α_r)$ with total at most one, we first classify symmetrized repeated-class counts for $r\ge3$: when $0<p<1$, they are forcing precisely if $e(F)>1$ or $\balpha\ne\bm/m$. We also obtain a complete classification of labelled transversal counts: for \rev{$0<p<1$, the only nonforcing profile is $F=K_2$ with class proportions $(1/2,1/2)$.} Together, these results settle conjectures of Janson and Sós [European J. Combin. 46 (2015)], Hatami, Hatami and Li [European J. Combin. 56 (2016)], and Janson [arXiv:2606.20186v1 (2026)]. The common ingredient is a balanced-count theorem for every graph with more than one edge, proved through a degree-sequence inequality, and its consequence of additive rigidity. Our arguments also determine the bad indices of the associated functional nullspaces and isolate the exceptional single-edge profiles. In particular, a non-divisibility theorem for grouped elementary symmetric polynomials excludes the higher-order obstructions in the repeated-class setting. In contrast, for two repeated classes and every $p\in(0,1)$, we construct nonquasirandom graph sequences satisfying the crossing-triangle counts at proportions $(1/3,2/3)$, with limiting edge density strictly below $p$. These counterexamples answer the crossing-triangle question negatively and show why the three-class assumption cannot be omitted.

fields
Combinatorics
pdf ↗ page arXiv:2610.28124 ↗

In their seminal paper \cite{eisenbud2003resultants}, Eisenbud and Schreyer asked whether every smooth projective variety admits an Ulrich bundle with respect to each very ample polarization. This question has stimulated extensive research for more than two decades. Recently, Anghel \cite{anghel2026smooth} constructed counterexamples over $\mathbb C$ in dimension two, and Lopez \cite{lopez2026existence} extended this nonexistence result to higher dimensions. In this article, we study the existence problem for sufficiently large multiples of a fixed polarization and derive applications in positive characteristic. Over an algebraically closed field of positive characteristic, we prove that every polarized smooth surface admits an Ulrich bundle and every polarized smooth variety admits a weakly Ulrich bundle. Consequently, the Chow forms of surfaces (resp. varieties) admit linear determinantal (resp. determinantal) representations. Moreover, for every such polarized surface, the cone of cohomology tables of coherent sheaves coincides with that on $(\mathbb{P}^2, \mathcal{O}_{\mathbb{P}^2}(1))$.

comments
Added an existence theorem for almost Ulrich bundles on threefolds
fields
Algebraic Geometry
pdf ↗ page arXiv:2610.28456 ↗

We report the first results of phenomenological analysis, based on extended set of explicitly calculated colored HOMFLY-PT polynomials in \cite{knotebook}. They concern differential expansion (DE), which separates the dependencies on the knot ${\cal K}$ and the representation $R$. %of colored HOMFLY-PT polynomials. DE is well understood for symmetric and rectangular representations, while for non-rectangular $R$ even the knot-independent basis $Z_R^X$ of DE is not known. We concentrate on two issues: the possible derivation of DE and on improved characteristic of its defect. We discuss how evolution families -- twist knots, double braids and 3-pretzels -- can be used to find DE by a peculiar triangular transformation of evolution coefficients. Once $Z^R_X$ are found for particular family, they are expected to stay basically the same for arbitrary knots -- modulo controllable reductions, characterized by the defect of DE, which puts knots into different universality classes. Contrary to original expectation, these classes appear labeled not by a single number $δ^{\cal K}$, but by a whole non-decreasing sequence $\{k_j\}$, which is squeezed between two staircases, ${ entier}\!\left(\frac{j-1}{δ+1}\right)\leq k_j\leq{ entier}\!\left(\frac{j-1}{{\rm deg}\,Δ}\right)$, where the upper bound involves Alexander polynomial $Δ(q^2)$ and follows from the continuation of the Melvin–Morton–Rozansky-Kashaev limit to $A=q^{-m}$ with $m>0$, when the limit gives a {\it positive} power of Alexander. The old assumption $δ+1={\rm deg}\,Δ$ is oversimplified and fails for 19 non-alternating knots with 11 and 12 crossings. Last, we list the differences of non-rectangularly colored HOMFLY for various mutant pairs to demonstrate their universality (knot-independence) and nice consistency with the spirit of DE.

comments
13 pages
fields
Mathematical Physics, Geometric Topology
pdf ↗ page arXiv:2610.28531 ↗

The binding number of a graph is the smallest ratio $|N(S)|/|S|$ among all nonempty vertex sets $S$ whose neighborhood $N(S)$ is not the whole vertex set. We prove that every finite nonempty $K_k$-free graph has binding number at most $k-2$ for every $k\ge6$, confirming Brandt's conjecture; the bound is sharp for complete $(k-1)$-partite graphs with equal nonempty parts. We first prove the case $k=6$ and then extend it to all $k\ge6$ by induction.

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

Let $f$ be a dominant meromorphic self-map of a compact Kähler manifold. Assume that $f$ has a strictly dominant intermediate dynamical degree $λ$ and that the number of isolated $n$-periodic points, counted with multiplicity, is at most $λ^n+o(λ^n)$. Then $f$ admits at most one adapted invariant probability measure of entropy $\logλ$. If such a measure exists, its natural extension is Bernoulli, and the isolated periodic points equidistribute towards it when counted with or without multiplicity. We apply this criterion to several classes of maps in complex dynamics, resolving longstanding open problems.

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

In this paper we introduce a class of non-flat Lorentzian manifolds, called Lorentzian torse-forming structure manifolds (briefly, LTFSMs). This class contains Lorentzian concircular structure manifolds (briefly, LCSMs), LSP-Sasakian manifolds, LP-Sasakian manifolds with coefficient $α$, LP-$α$-Sasakian manifolds, LP-Sasakian manifolds, and LP-$α$-Kenmotsu manifolds. The interrelations among these various classes of manifolds are illustrated in Figures 1 and 2. We investigate several geometric properties of LTFSMs. In particular, we show that the expansion scalar, given by the divergence of $ξ$, is nonzero and nonconstant, and that the flow of $ξ$ is irrotational. In an LCSM, the Ricci operator commutes with the structure tensor $φ$ [12]. However, it is shown that, in an LTFSM, the Ricci operator does not generally commute with $φ$. If the gradient of the torse-forming scalar $α$ is collinear with the torse-forming vector field $ξ$, then the Ricci operator commutes with $φ$, and the manifold reduces to an LCSM. It is known that a conformally flat LCSM is quasi-Einstein and hence is a manifold of quasi-constant curvature. We show that a conformally flat LTFSM is a generalized quasi-Einstein manifold in the sense of Chaki [1] and is also a manifold of generalized quasi-constant curvature. Several curvature-related properties of LTFSMs are established, and their sectional curvature is determined. The existence of LTFSMs is demonstrated through several proper nontrivial examples. We also present examples that are simultaneously LCSMs and LTFSMs, examples of LTFMs characterizing twisted cubic spacetimes, and generalized Robertson-Walker (GRW) spacetimes characterizing LCSMs. Finally, we provide examples of LTFSMs in which the vector field $ξ$ is a unit timelike torse-forming vector field but is not concircular; see Examples 5.6–5.8.

comments
32 pages, 2 figures
fields
Differential Geometry
pdf ↗ page arXiv:2610.28651 ↗

We consider sequences of large symmetric positive-definite linear systems in which spectral information from a reference matrix $A$ is reused to accelerate the solution of a nearby system with perturbed matrix $A(t)=A+tE$, where $E$ is symmetric, $\|E\|_F=1$, and $t\geq0$ is the perturbation size. We compare deflated conjugate gradient (deflated CG) with preconditioned CG (PCG) equipped with a scaled spectral preconditioner constructed from the same spectral information of $A$. First, we derive an energy-norm error characterization of deflated CG. We then use perturbation analysis to show that, after one additional PCG iteration, the squared PCG error is bounded, up to terms of order $t^2$, by an explicit multiple of the squared deflated CG error. This result clarifies the role of the scaling parameter in the preconditioner. Experiments show that the scaled spectral preconditioner recovers much of the convergence improvement provided by deflation while requiring fewer products with $A(t)$.

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

We prove that every bounded pseudoconvex domain in $\mathbb C^N$ with $C^\infty$ boundary of finite D'Angelo one-type is Kobayashi complete. As a separate consequence of our criterion of completeness and an estimate of Diederich–Fornæss, we prove that every bounded pseudoconvex domain with real-analytic boundary is Kobayashi complete. We then show that smoothness alone does not imply completeness: there exists a bounded pseudoconvex domain in $\mathbb C^3$ with $C^\infty$ boundary and a global smooth plurisubharmonic defining function whose Kobayashi and Carathéodory distances are incomplete.

fields
Complex Variables
pdf ↗ page arXiv:2610.28833 ↗

We study the elephant random walk with stops and independent positive random step sizes. Building on fixed-movement estimates, we obtain quantitative normal approximations for an empirically normalized statistic by controlling its random denominator and the independent movement clock. A permutation comparison preserves the diffusive Kolmogorov rate, while variance matching permits third-order Zolotarev estimates. We also derive self-normalized Cramér-type moderate deviations. For regularly varying step-size tails, we obtain uniform precise large deviations and establish the necessity of the diffusive and critical threshold orders. Further applications of the clock representation yield large deviation principles for Weibull-type and light-tailed step sizes, and a precise light-tailed expansion in the balanced case.

comments
32 pages
fields
Probability
pdf ↗ page arXiv:2610.29105 ↗

Pinching antenna systems (PASS) provide flexible transmitter-side radiation reconfiguration for high-frequency wireless communications. This paper applies PASS to non-orthogonal multiple access (NOMA) covert communication networks, where activated pinching antennas (PAs) transmit superimposed signals to a pair of users stochastically distributed within a rectangle. Two passive wardens respectively monitor the downlink transmissions intended for two users. More specifically, we derive the closed-form detection error probability (DEP) expressions for two wardens under bounded noise uncertainty. Then we analytically determine the optimal detection thresholds and minimum DEPs in the worst-case covert detection scenarios. The covert transmission rates of two users are further characterized by taking into consideration ideal successive interference cancellation and non-ideal successive interference cancellation at near user and intra-NOMA interference at far user. Numerical results are presented to confirm that: 1) PASS-NOMA is capable of providing higher covert rates relative to conventional orthogonal multiple access OMA schemes; 2) As the number of activated PAs begun to increase, the near user has ability to obtain a larger covert rate gain than far user; and 3) The DEP of PASS-NOMA networks is larger than that of both PASS-OMA and traditional antenna based NOMA in specific output power regions.

fields
Information Theory
pdf ↗ page arXiv:2610.29433 ↗

We establish criteria for at most one or at most two limit cycles of generalized Liénard systems in a single potential well. Two independent uniqueness tests use modified quotients of the damping and restoring forces; both allow a degenerate restoring force, and one extends to continuous potential profiles with corners. Opposite convexity of the two branches of the damping quotient in the potential coordinate gives an upper bound of two. Further criteria apply to weak damping with an analytic normalized profile on a bounded potential interval under an explicit smallness condition, to small profile perturbations vanishing near the equilibrium on a bounded range of half-widths, and to parameter families satisfying curvature, monotonicity and boundary conditions. Applications give another proof of the classical quartic bound. For Selkov systems, we obtain a two-cycle bound in a specified negative-parameter region and prove existence and uniqueness in a positive-parameter region. We also prove Conjecture~2.1 in [J. Math. Anal. Appl., 2025]. Examples attain the two-cycle bound.

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

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

comments
6 pages; added contact details and cleaned LaTeX. Comments very welcome!
fields
Number Theory
pdf ↗ page arXiv:2610.30658 ↗

We develop a topological and combinatorial interpretation of the Kawai–Lewellen–Tye (KLT) relations for $n$-point AdS string-amplitude building blocks, which are disk integrals with multivariable multiple polylogarithm insertions and sphere integrals with their single-valued counterparts. Building on the framework of twisted de Rham theory over a noncommutative ring, we reformulate the problem in terms of associahedral chambers of the moduli space loaded with solutions of the Knizhnik–Zamolodchikov equation. We construct regularized twisted cycles and express their intersection pairings through local monodromies and Drinfeld associators, which control transport between fusion-tree normalizations. Organizing the intersection contributions by common boundary faces yields the intersection matrix, which is identified with the inverse KLT kernel by the twisted period relation. The field-theory limit of the inverse KLT kernel is also given.

comments
64 pages, 12 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.30862 ↗

This paper studies near-field integrated sensing and communication (ISAC) with a rotatable base-station array under an exact spherical-wave propagation model. For a general transmit covariance, we derive a Cramér–Rao bound (CRB) decomposition that separates target-side geometry from transmit-covariance-dependent terms. We then specialize the framework to two representative low-complexity architectures: a single-stream superposition architecture, and a dual-waveform split architecture design. We characterize the communication-, detection-, and estimation-optimal rotations for each architecture using the exact finite-array model. In addition, we show how a second-order approximation yields compact approximate expressions for the optimal rotation angles. We also study uncertainty in the target state used for beamforming design through a correlated Gaussian perturbation model, and derive approximations of the optimal robust rotation angles for target sensing and detection. The analysis shows that the two architectures behave differently under rotation: the single-stream design can align communication and detection tasks, whereas the dual-waveform design exhibits a direct communication–detection tradeoff and can incur a larger communication loss when sensing is prioritized. Numerical results show clear gains over a fixed array orientation, especially for range estimation, and close agreement between the approximate and exact rotation choices. Detection is less affected by target-state errors than estimation in the considered cases.

fields
Information Theory
pdf ↗ page arXiv:2610.31136 ↗

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

comments
Added Arxiv identifier for simultaneous submission https://arxiv.org/abs/2610.31448
fields
Category Theory
pdf ↗ page arXiv:2610.31410 ↗

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

comments
Added Arxiv identifier for simultaneous submission https://arxiv.org/abs/2610.31410
fields
Category Theory
pdf ↗ page arXiv:2610.31448 ↗

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

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

Let $X$ be a smooth projective Poisson surface over an algebraically closed field of characteristic $p>2$, and let $s\in H^0(X,ω_X^{-1})$ be nonzero. We construct an anticanonical section associated to $s$, called the leafrian, on moduli spaces $M$ of stable objects on $X$, including the moduli of stable sheaves, of principal $G$-bundles, and of instantons. The leafrian splits $M$ if and only if $s^{p-1}$ Frobenius splits the base. It is invariant under the Hamiltonian flows of Bottacin's Poisson structure on $M$, so every compatibly split subvariety of $M$ is a Poisson subvariety. Furthermore, the leafrian extends to an anticanonical section on the Gieseker compactification $\bar M$, and splits $\bar M$ under the same criterion. As a consequence, for $X$ a rational surface, a ruled surface over an elliptic curve, a $K3$ surface, or an abelian surface, and $ρ>0$, the Gieseker compactification $\bar M$ satisfies Kodaira-type cohomology vanishing, including singular $\bar M$, and the same holds in characteristic zero.

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

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

comments
101 pages; Supplementary computational data previously included in the v1 TeX source have been reorganized as ancillary files
fields
Representation Theory, Quantum Algebra
pdf ↗ page arXiv:2610.31655 ↗

In this work, we develop a nonlinear continuum model for wave propagation in two-dimensional granular materials, building on key ideas from Nesterenko's work. Starting from the Hertzian contact law and neglecting contact friction, we derive an effective continuum description through homogenization, assuming spherical, monodisperse grains, local periodicity, and the Cauchy–Born hypothesis. The resulting strain-gradient model depends on both the first and second gradients of the displacement field. We analyse the hyperbolicity of the leading-order system through its eigenvalues and eigenvectors, establishing conditions for hyperbolicity within a restricted deformation domain. The model is solved using an explicit finite-volume method to investigate gravitational settling and wave propagation. We derive analytical expressions for the longitudinal and transverse wave speeds and highlight their dependence on depth. Finally, the predictions of the continuum model are compared with existing discrete-element simulations. This formulation allows several extensions, including more complex packing geometries, contact laws, and large-deformation regimes in which the contact network can evolve.

comments
23 pages, 8 figures
fields
Mathematical Physics
pdf ↗ page arXiv:2610.31738 ↗

Let $X\subset\mathbb{R}^{d_X}$ and $Y\subset\mathbb{R}^{d_Y}$ be open, where $d_X,d_Y\geq2$ and $1\leq p\leq\min\{d_X,d_Y\}$. Let $Φ:X\times Y\to\mathbb R^p$ be a smooth mapping, and suppose that $D_xΦ$ and $D_yΦ$ have rank $p$. For compact sets $A\subset X$ and $B\subset Y$, we give lower bounds on $\dim_H A+\dim_H B$ ensuring that the pinned configuration set \[Δ_Φ^y(A)=\{Φ(x,y):x\in A\}\] has positive Lebesgue measure or nonempty interior for some $y\in B$. The dimensional thresholds are expressed in terms of uniform $L^2$-Sobolev estimates for the generalized Radon transforms associated with $Φ$. Our results extend the Fourier integral operator approach developed by Greenleaf, Iosevich, and Taylor for unpinned $2$-point configuration problems to the pinned setting. We also prove a nonlinear projection theorem that remains valid even when the Peres-Schlag transversality condition fails. Under the smoothing hypotheses used for the pinned configuration theorem, we obtain lower bounds for the Hausdorff dimensions of the corresponding slices of $A$ by the level sets of $Φ$. Applications include distances from points to hyperplanes, spheres and lines; multiparameter distance sets; and a restricted projection family introduced by Harris.

comments
35 pages
fields
Classical Analysis and ODEs
pdf ↗ page arXiv:2610.32088 ↗

An identifying code of a graph is a dominating set $C$ such that the sets $N[v]\cap C$ are pairwise distinct. The minimum density of an identifying code has been studied extensively for several infinite grids. It is known to be $1/4$ for the triangular grid and $7/20$ for the square grid, whereas for the hexagonal grid the problem is still open, between $5/12$ and $53/126$. These three grids are the regular members of the family of the eleven Archimedean grids. In this paper, we start a systematic study of identifying codes in this family. We determine the minimum density for five of the nine Archimedean grids for which it was not known: it is $2/3$ for the truncated hexagonal grid 3.12.12, $3/7$ for the truncated square grid 4.8.8, and $1/3$ for the trihexagonal (kagome) grid 3.6.3.6, the elongated triangular grid $3^3.4^2$ and the snub hexagonal grid $3^4.6$. All lower bounds are proved by the discharging method. For the three remaining non-regular Archimedean grids, we also obtain some bounds: the minimum density lies between $3/7$ and $13/30$ for the truncated trihexagonal grid 4.6.12, between $1/3$ and $11/30$ for the rhombitrihexagonal grid 3.4.6.4, and between $2/7$ and $9/28$ for the snub square grid $3^2.4.3.4$.

fields
Combinatorics
pdf ↗ page arXiv:2610.32192 ↗

Under quantitative asymptotic hyperbolicity assumptions, we prove the existence of hyperbolic ergodic invariant probability measures satisfying Pesin's entropy formula for $C^1$ diffeomorphisms whose attractors admit extendable continuous invariant splittings. No dominated splitting is required on the attractor. For $C^{1+α}$ diffeomorphisms, the resulting measures are SRB measures. Our results apply to mostly expanding partially hyperbolic systems and to systems with strictly separated Lyapunov exponents under suitable statistical assumptions. We also construct examples with hyperbolic SRB measures of full support on attractors admitting no nontrivial dominated splitting, demonstrating the applicability of our criteria beyond results that require domination.

comments
Corrected several typographical errors and added an AI use declaration
fields
Dynamical Systems
pdf ↗ page arXiv:2610.32820 ↗

A Berge path in a hypergraph is an alternating sequence of distinct vertices and edges $v_1,e_1, v_2, \ldots, e_{k-1}, v_{k}$ such that $v_i, v_{i+1} \in e_i$ for all $i \in [k-1]$. Győri, Katona, and Lemons determined the maximum number of edges in $r$-uniform, $n$-vertex hypergraphs without Berge paths on $k$ vertices. The extremal examples for their bounds are disconnected hypergraphs in which each component has either too few edges or too few vertices to contain such a Berge path. We consider the setting in which the host hypergraph is connected. Let $\operatorname{ex}^{\mathrm{conn}}_r(n,\mathcal{BP}_k)$ denote the maximum number of edges in an $n$-vertex, $r$-uniform, connected hypergraph that does not contain a Berge path on $k$ vertices. This number was determined by Zhang, Broersma, Győri, Tompkins, Wang for $k \leq r+2$, and Zhao, Gerbner, Zhou for $k \geq 2r+2$. In this paper, we resolved the remaining cases $r+3 \leq k \leq 2r+1$ when $n$ is sufficiently large, confirming a conjecture of Zhang, et al.

comments
minor typos were corrected
fields
Combinatorics
pdf ↗ page arXiv:2610.32875 ↗

We characterize the range of the cosine transform on real Grassmannians in terms of the decomposition under the action of the special orthogonal group SO(n). Also a geometric interpretation of its image is given. The non- Archimedean analogues are discussed.

comments
16 pages; the statement of Remark 2.2 was corrected
journal
Adv. Math. 184 (2004), no. 2, 367--379
fields
Metric Geometry, Representation Theory
pdf ↗ page arXiv:math/0111031 ↗

The Horizontal Chord Theorem states that if a continuous curve connects points $A$ and $B$ in the plane, then for every positive integer $k$ there are points $C$ and $D$ on the curve with $\overrightarrow{AB}=k\,\overrightarrow{CD}$. We reformulate the one-dimensional chord problem on finite metric graphs: the \emph{chord set} $\cH(G)$ consists of those $r$ such that every function of mean zero on $G$ integrates to zero over some closed connected subset of $G$ of measure $r$. We prove that the space of connected subsets of fixed measure is compact and path-connected, that $\cH(G)$ always contains the closure of a combinatorially defined \emph{partition set} $\cP(G)$, and that the two sets agree at every rational number; as a consequence, membership of a rational number in $\cH(G)$ is decided by a finite linear program, and the conjecture $\cH(G)=\overline{\cP(G)}$ reduces to a statement about irrational points. We give a covering lemma that yields $\cH(G)=[0,|E|]$ for Eulerian graphs, $[0,1]\subseteq\cH(G)$ when $G$ has no vertex of degree one, and $[0,g(G)]\subseteq\cH(G)$ when $G$ is bridgeless with girth $g(G)$. Conversely, a bridge forces a gap in $\cH(G)$ below $|E|$. Computations on small graphs support the conjecture that $\cH(G)=[0,|E|]$ exactly when $G$ is bridgeless.

comments
This is a revised and extended version of a previously published article
journal
M. Javaheri, Chord theorems on graphs, Proc. Amer. Math. Soc. 137 (2009), 553--562
fields
Group Theory
pdf ↗ page arXiv:math/0702805 ↗

Get each issue by email →