Peer Revenue Publish or profit

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Monday 30 March

Functional Analysis

Minimum Norm Interpolation via the Local Theory of Banach Spaces: The Role of $2$-Uniform Convexity

The minimum-norm interpolator (MNI) framework has recently attracted considerable attention as a tool for understanding generalization in overparameterized models, such as neural networks. In this work, we study the MNI under a $2$-uniform convexity assumption, which is weaker than requiring the norm to be induced by an inner product; in this setting, the MNI typically does not admit a closed-form solution. At a high level, we show that this condition yields an upper bound on the MNI bias in both linear and nonlinear models. We further show that this bound is sharp for overparameterized linear regression when the norm's unit ball is in isotropic or John's position and the covariates are i.i.d.\ sub-Gaussian, for example, when each covariate vector has i.i.d. Rademacher entries. Finally, under the same assumption on the covariates, we prove sharp generalization bounds for the $\ell_p$-MNI when $p \in \bigl(1 + C/\log d, 2\bigr]$. To the best of our knowledge, this is the first work to establish sharp bounds for non-Gaussian covariates in linear models when the norm is not induced by an inner product. This work is deeply inspired by classical work on $K$-convexity and recent work on the geometry of $2$-uniformly convex and isotropic convex bodies.
Read the full abstract

Group Theory

A language-theoretic approach to study the density of subsets in free groups

In this paper, we study the density of subsets of nonabelian free groups using relative densities of languages. We start by proving some basic properties about the density of a language $L_1$ relative to another language $L_2$ containing $L_1$. We then focus on the case where $L_2$ is the language of freely reduced words over an alphabet and prove an analogue of the Infinite Monkey Theorem for this language. This result, obtained as a corollary of a broader theorem on irreducible subshifts of finite type, allows for a language-theoretic characterization of rational subsets with positive density. As a consequence, we obtain a language-theoretic proof that the automorphic orbit of an element of a nonabelian free group has natural density zero, which generalizes a result by Burillo and Ventura concerning the density of primitive elements of free groups. We then describe rational subsets of free groups of positive density and explore in depth the case of finitely generated subgroups. We prove that if the rational subset is a subgroup, then it has positive density if and only if it has finite index and characterize those for which there is convergence. In cases where convergence fails due to parity constraints, we show that the density of the subset always exhibits weak convergence and that the average of its supremum and infimum densities converges to the expected value.
Read the full abstract

Numerical Analysis

Toward generalized solutions of the Keller–Segel equations with singular sensitivity and signal absorption via an algebraic manipulation finite element algorithm

The paper that follows describes a numerical algorithm to solve the parabolic-parabolic Keller–Segel system characterized by singular sensitivity and signal absorption in such a manner that the numerical approximations converge towards a generalized solution on two-dimensional polygonal domains as the time and space discretization parameters tend to zero. The algorithm employs an algebraic manipulation finite element method for space, while time remains continuous, based on introducing a stabilized term. This term is constructed via a graph-Laplacian operator and a shock detector for detecting extrema in finite element functions. Furthermore, the cross-diffusion term also includes an algebraic manipulation, which is related to testing by a nodally interpolated, suitable nonlinear function involved in obtaining a discrete energy-like law leading to a priori estimates. This approach yields approximations that respect physical constraints at nodal points such as positivity and maximum principle, and maintaining mass properties as well. Compactness results are quite laborious due to the low regularity stemming from the a priori estimates and the discretization procedure itself. Finally, the passage to the limit rests on testing by the product of a positive test function and a renormalization of the numerical solution.
Read the full abstract

Combinatorics

Hypergeometric Bernoulli Polynomials Defined on Simplicial $d$-Polytopic Numbers

We introduce an ${\rm S}_d$-analogue of the hypergeometric Bernoulli polynomials and study their properties. To achieve this goal, we introduce a calculus defined on the simplicial $d$-polytopic numbers. Two definitions of the ${\rm S}_d$-derivatives are given. These two definitions allow us to derive an identity relating Kummer confluent hypergeometric function and Touchard polynomials. This calculus is closely related to the $d$-Hoggatt binomial coefficients. ${\rm S}_d$-analogs of the exponential function and the hypergeometric functions are given.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Foundations of Polar Linear Algebra

This work revisits operator learning from a spectral perspective by introducing Polar Linear Algebra, a structured framework based on polar geometry that combines a linear radial component with a periodic angular component. Starting from this formulation, we define the associated operators and analyze their spectral properties. As a proof of feasibility, the framework is evaluated on a canonical benchmark (MNIST). Despite the simplicity of the task, the results demonstrate that polar and fully spectral operators can be trained reliably, and that imposing self-adjoint-inspired spectral constraints improves stability and convergence. Beyond accuracy, the proposed formulation leads to a reduction in parameter count and computational complexity, while providing a more interpretable representation in terms of decoupled spectral modes. By moving from a spatial to a spectral domain, the problem decomposes into orthogonal eigenmodes that can be treated as independent computational pipelines. This structure naturally exposes an additional dimension of model parallelization, complementing existing parallel strategies without relying on ad-hoc partitioning. Overall, the work offers a different conceptual lens for operator learning, particularly suited to problems where spectral structure and parallel execution are central.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Optimistic Online LQR via Intrinsic Rewards

Optimism in the face of uncertainty is a popular approach to balance exploration and exploitation in reinforcement learning. Here, we consider the online linear quadratic regulator (LQR) problem, i.e., to learn the LQR corresponding to an unknown linear dynamical system by adapting the control policy online based on closed-loop data collected during operation. In this work, we propose Intrinsic Rewards LQR (IR-LQR), an optimistic online LQR algorithm that applies the idea of intrinsic rewards originating from reinforcement learning and the concept of variance regularization to promote uncertainty-driven exploration. IR-LQR typically retains the structure of a standard LQR synthesis problem by only modifying the cost function, resulting in an intuitively pleasing, simple, computationally cheap, and efficient algorithm. This is in contrast to existing optimistic online LQR formulations that rely on more complicated iterative search algorithms or solve computationally demanding optimization problems. We show that IR-LQR achieves the optimal worst-case regret rate of $\sqrt{T}$, and compare it to various state-of-the-art online LQR algorithms via numerical experiments carried out on an aircraft pitch angle control and an unmanned aerial vehicle example.
Read the full abstract

All authors Marcell Bartos, Bruce D. Lee, Lenart Treven, Andreas Krause, Florian Dörfler, Melanie N. Zeilinger

Probability

Composition of random functions and word reconstruction

Given two functions $\mathbf{a}\!:\! [n] \rightarrow [n]$ and $\mathbf{b}\!:\! [n] \rightarrow [n]$ chosen uniformly at random, any word $w=w_1w_2\dots w_k\in \{a,b\}^k$ induces a random function $\mathbf{w}\!:\! [n] \rightarrow [n]$ by composition, i.e. $\mathbf{w}=\phi_{w_k}\circ \dots \circ \phi_{w_1}$ with $\phi_a=\mathbf{a}$ and $\phi_b=\mathbf{b}$. We study the following question: assuming $w$ is fixed but unknown, and $n$ goes to infinity, does the random function $\mathbf{w}$ carry enough information to (partially) recover the word $w$ with good enough probability, in one or several i.i.d. samples? We prove that the random functions stemming from two non-isomorphic words can be discriminated with probability arbitrarily close to $1$ with a bounded number of samples, when $n$ goes to infinity. Equivalently, the total variation distance between their distributions is bounded away from zero. The proof relies on the study of certain auto-correlation functions appearing in the variance of the weighted number of quasi-leaves. Whether the total variation distance goes to 1, or equivalently, whether one sample is enough to distinguish the words with high probability, is the major question we leave open. We show that this is the case when the two words have different lengths or different exponents.
Read the full abstract

2603.28936 · 30 Mar · v2: we now prove separation in TV-distance for non-isomorphic words unconditionally, without the Schanuel conjecture. To do this, we change our main observable from a leaf count to a weighted quasi-leaf count, with an extra real parameter u (after a suggestion of Andrea Sportiello). Only local modifications are needed and the structure of the paper and the techniques are essentially unchanged

Logic

On maximal families of independent sets with respect to asymptotic density

We study families of subsets of $\omega$ which are independent with respect to the asymptotic density $\mathsf{d}$. We show, for instance, that there exists a maximal $\mathsf{d}$-independent family $\mathcal{A}$ such that $\mathsf{d}[\mathcal{A}]$ attains a prescribed set of values in $(0,1)$ with at most countably many exceptions. In addition, under $\mathrm{cov}(\mathcal{N})=\mathfrak{c}$, it is possible to construct such $\mathcal{A}$ with no exceptions. We also construct $2^{\mathfrak{c}}$ maximal $\mathsf{d}$-independent families with pairwise distinct generated density fields and obtain maximal families with strong definability pathologies, including examples without the Baire property and, consistently, nonmeasurable examples.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Covariance-Domain Near-Field Channel Estimation under Hybrid Compression: USW/Fresnel Model, Curvature Learning, and KL Covariance Fitting

Near-field propagation in extremely large aperture arrays requires joint angle-range estimation. In hybrid architectures, only $N_\mathrm{RF}\ll M$ compressed snapshots are available per slot, making the $N_\mathrm{RF}\times N_\mathrm{RF}$ compressed sample covariance the natural sufficient statistic. We propose the Curvature-Learning KL (CL-KL) estimator, which grids only the angle dimension and learns the per-angle inverse range directly from the compressed covariance via KL divergence minimisation. CL-KL uses a $Q_\theta$-element dictionary instead of the $Q_\theta Q_r$ atoms of 2-D polar gridding, eliminating the range-dimension dictionary coherence that plagues polar codebooks in the strong near-field regime, and operates entirely on the compressed covariance for full compatibility with hybrid front-ends. At $N_\mathrm{MC}=400$ ($f_c=28$~GHz, $M=64$, $N_\mathrm{RF}=8$, $N=64$, $d=3$, $r\in[0.05,1.0]\,r_\mathrm{RD}$), CL-KL achieves the lowest channel NMSE among all six evaluated methods – including four full-array baselines using $64\times$ more data – at $\mathrm{SNR}\in\{-5,0,+5,+10\}$~dB. Running in approximately 70~ms per trial (vs.\ 5~ms for the compressed-domain peer P-SOMP), CL-KL's dominant cost is the $N_\mathrm{RF}{\times}N_\mathrm{RF}$ inversion rather than $M$: measured runtime stays near 70~ms across $M\in\{32,64,128,256\}$, making it aperture-scalable for XL-MIMO deployments. CL-KL is further validated against a derived compressed-domain Cramér-Rao bound and confirmed robust to non-Gaussian (QPSK) source distributions, with a maximum NMSE gap below 0.6~dB.
Read the full abstract

Optimization and Control

Symmetrizing Bregman Divergence on the Cone of Positive Definite Matrices: Which Mean to Use and Why

This work uncovers variational principles behind symmetrizing the Bregman divergences induced by generic mirror maps over the cone of positive definite matrices. We show that computing the canonical means for this symmetrization can be posed as minimizing the desired symmetrized divergences over a set of mean functionals defined axiomatically to satisfy certain properties. For the forward symmetrization, we prove that the arithmetic mean over the primal space is canonical for any mirror map over the positive definite cone. For the reverse symmetrization, we show that the canonical mean is the arithmetic mean over the dual space, pulled back to the primal space. Applying this result to three common mirror maps used in practice, we show that the canonical means for reverse symmetrization, in those cases, turn out to be the arithmetic, log-Euclidean and harmonic means. Our results improve understanding of existing symmetrization practices in the literature, and can be seen as a navigational chart to help decide which mean to use when.
Read the full abstract

Analysis of PDEs

Lipschitz solvability of prescribed Jacobian and divergence for singular measures

Let $\mu$ be a finite Radon measure on an open set $\Omega\subset\mathbb{R}^d$, singular with respect to the Lebesgue measure. We prove Lusin-type solvability results for the prescribed divergence equation and the prescribed Jacobian equation with Lipschitz solutions. More precisely, for every $\varepsilon>0$ and every Borel datum $f \colon \Omega \to \mathbb{R}$ there exists a vector field $V\in C^1_c(\Omega;\mathbb{R}^d)$ such that $\operatorname{div} V=f$ on a compact set $K\subset\Omega$ with $\mu(\Omega\setminus K)<\varepsilon$, and $\operatorname{Lip}(V)\le (1+\varepsilon)\|f\|_{L^\infty(\Omega,\mu)}$. Similarly, for every Borel datum $g\colon \Omega \to \mathbb{R}$ there exists a map $\Phi$ with $\Phi-\operatorname{Id}\in C^1_c(\Omega;\mathbb{R}^d)$ such that $\det D\Phi=g$ on a compact set $K\subset\Omega$ with $\mu(\Omega\setminus K)<\varepsilon$, and $\operatorname{Lip}(\Phi-\operatorname{Id})\le (1+\varepsilon)\|g-1\|_{L^\infty(\Omega,\mu)}$. The maps $V$ and $\Phi-\operatorname{Id}$ can be chosen arbitrarily small in supremum norm.
Read the full abstract

Analysis of PDEs

Full flexibility of the Monge-Ampère system in codimension $d_*-d+1$

We prove that $\mathcal{C}^{1,\alpha}$ solutions to the Monge-Ampère system in dimension $d$ and codimension $k= d_*-d+1$, where $d_*$ denotes the Janet dimension, are dense in the space of continuous functions, for every Hölder exponent $\alpha<1$. Our result strengthens the statement in [Lewicka 2022], obtained for $k = 2d_*$ and based on ideas from [Källen 1978] in the context of the isometric immersion system. It also generalizes the result of [Inauen-Lewicka 2025], where full flexibility was established in dimension $d=2$ and codimension $k=2$. The same proof scheme further yields local full flexibility of isometric immersions of $d$-dimensional Riemannian metrics into Euclidean space of dimension $d_* + 1$, generalizing the result in [Lewicka 2025] proved for $d=k=2$. By using techniques of [Conti-De Lellis-Szekelyhidi], the result can be extended to compact manifolds, in codimension $(d+1)d_*-d+1$.
Read the full abstract

All authors Wentao Cao, Jonas Hirsch, Dominik Inauen, Marta Lewicka

Combinatorics

The Priority Lattice

We introduce the priority lattice, a structure arising from the priority search algorithm on rooted trees and forests. We prove bijectively that its maximal chains are labeled by parking functions, and that the maximal chains of its principal ideals are labeled by partial parking functions. We establish that it is a graded lattice and compute its Möbius function and characteristic polynomials.
Read the full abstract

Mathematical Physics

Central Limit Theorems for Outcome Records in Disordered Quantum Trajectories

We prove annealed functional central limit theorems for finite pattern counts in the measurement record of discrete-time quantum trajectories, with the instrument applied at each step determined by an invertible, probability-preserving base dynamical system. When the base is ergodic, under summable strong-mixing coefficients of the instrument process and a summable uniform annealed trace-norm forgetting rate for the associated non-selective channel cocycle, we establish a joint functional CLT for bounded vector-valued functions of finite outcome blocks under the annealed law determined by the dynamically stationary state. We then extend this limit to every measurable random initial state, yielding a universal functional CLT with unchanged stationary centering and asymptotic covariance. We also provide practical sufficient criteria ensuring the existence and uniqueness of the dynamically stationary state and the required annealed trace-norm forgetting. We illustrate the results through a broad family of examples, including disordered walk-type models generated by finite group actions, measurement followed by preparation, and instruments with reset components. The results apply to general disordered quantum instruments and are not restricted to the perfect-measurement regime; they complement the law of large numbers established by Ekblad, Moreno-Nadales, and Pathirana (2026) for the same disordered setting and provide a disordered counterpart of the homogeneous CLT of Attal, Guillotin-Plantard, and Sabot (2014).
Read the full abstract

Optimization and Control

H Infinity Minimal Destabilizing Feedback for Vulnerability Analysis and Attack Design of Nonlinear Systems

The robust stability problem involves designing a controlled system which remains stable in the presence of modeling uncertainty. In this context, results known as small gain theorems are used to quantify the maximum amount of uncertainty for which stability is guaranteed. These notions inform the design of numerous control systems, including critical infrastructure components such as power grids, gas pipelines, and water systems. However, these same concepts can be used by an adversary to design a malicious feedback attack, of minimal size, to drive the closed-loop system to instability. In this paper, we first present a detailed review of the results in robust control which allow for the construction of minimal destabilizers. These minimally sized attacks merely push the system to the stability boundary, which we demonstrate do not necessarily destabilize nonlinear systems even when the linearization is destabilized. Our main result leverages linear perturbation theory to explicitly prove, in the state space context, that internal destabilization is guaranteed for a broad class of nonlinear systems when the gain of these attacks is slightly increased.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Charged scalar fields on Reissner–Nordström spacetimes I: integrated energy estimates

This is the first part of a series of papers deriving the precise, late-time behaviour and (in)stability properties of charged scalar fields on near-extremal Reissner–Nordström spacetimes via energy estimates. In this paper, we establish global, weighted integrated energy decay and energy boundedness estimates for solutions to the charged scalar field equation on (near-)extremal Reissner–Nordström(–de Sitter) spacetimes. These estimates extend to Reissner–Nordström spacetimes away from extremality under the assumption of mode stability on the real axis. Together with the companion paper [Gaj26], this paper forms the first global quantitative analysis of the charged scalar field equation on asymptotically flat black hole spacetimes, without a smallness assumption on the scalar field charge. Due to a coupling of the degeneration of the red-shift effect with the presence of superradiance at the linearized level, charged scalar fields on Reissner–Nordström spacetimes also probe some of the main difficulties encountered when studying the (neutral) wave equation on extremal Kerr spacetimes.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Charged scalar fields on Reissner–Nordström spacetimes II: late-time tails and instabilities

This is the second part of a series of papers deriving the precise, late-time behaviour and (in)stability properties of charged scalar fields on near-extremal Reissner–Nordström spacetimes via energy estimates. In this paper, we use purely physical-space based methods to establish the precise late-time behaviour of solutions to the charged scalar field equation in the form of oscillating and decaying late-time tails that satisfy inverse-power laws, assuming global integrated energy decay estimates, which are proved in the companion paper [Gaj26]. This paper provides the first pointwise decay estimates for charged scalar fields on black hole backgrounds without an assumption of smallness of the scalar field charge. We also prove the existence of asymptotic instabilities for the radiation field along future null infinity and, in the extremal case, also along the future event horizon. Both the energy methods and the precise late-time asymptotics derived in this paper are expected to play an important role in future nonlinear studies of black hole dynamics in the context of the spherically symmetric (Einstein–)Maxwell–charged scalar field equations, as well as in the context of extremal Kerr spacetimes.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Maximally heavy dynamics in the causal diamond

Correlation functions of CFT operators with infinite scaling dimension are rich, multifaceted objects that describe physics ranging across classical holography, black hole dynamics, and flat-space scattering amplitudes. In this work, we provide a rigorous framework for characterizing the space of four-point functions of identical operators with infinite dimension in terms of well-defined “maximally heavy observables,” which are akin to intrinsic quantities describing statistical systems in the thermodynamic limit. These observables are highly constrained by crossing symmetry and unitarity, and give novel insights into the locality of bulk states through the emergence of dynamical phase transitions. In certain cases, these results connect directly to the more familiar picture of torus partition functions at large central charge. We apply our framework to a number of illustrative examples including generalized free fields, chiral product correlators, and maximal giant gravitons in planar $\mathcal{N}=4$ SYM.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

A Covariant Phase Space Approach to Einstein-AEther Gravity

Black hole thermodynamics in Lorentz-violating gravity is subtle because different excitations propagate at different speeds and hence identify different causal horizons. We revisit Einstein–AEther gravity using the covariant phase space formalism with boundaries and derive a consistent first law for stationary black holes. For a mode of propagation speed $c_s$, we introduce a disformal frame in which the corresponding causal horizon is a Killing horizon, so that the standard Wald-type derivation can be carried out. The result is then mapped back to the original frame, where it mantains the same structure. The associated horizon charge contains, besides the usual Komar term, an irreducible entropic AEther contribution that can be interpreted as heat due to the AEther flux across the horizon; accordingly, the total entropy splits into a gravitational part and an AEther part. We further develop an extended-thermodynamics framework in which the couplings of the theory are allowed to vary, obtaining generalized Smarr relations. Finally, we analyze the probe-mode limit $c_s \to +\infty$, clarifying its connection to universal-horizon thermodynamics and resolving the apparent tension in the literature between approaches that (i) fix the entropy to be proportional to the area and infer a corresponding temperature, and (ii) impose the Hawking temperature associated with modes peeling from the universal horizon and infer the entropy. Once the independent AEther contribution is properly taken into account, the two prescriptions are reconciled.
Read the full abstract

Classical Analysis and ODEs

Meta Algebras and Special Functions: the Racah Case

Finite families of biorthogonal rational functions and orthogonal polynomials of Racah-type are studied within a unified algebraic framework based on the meta Racah algebra and its finite-dimensional representations. These functions are identified as overlap coefficients between eigensolutions of generalized and standard eigenvalue problems posited on the representation space. The approach naturally yields their orthogonality relations and bispectral properties.
Read the full abstract

All authors Nicolas Crampé, Quentin Labriet, Lucia Morey, Satoshi Tsujimoto, Luc Vinet, Alexei Zhedanov

Mathematical Physics

Gibbs measure for the HC-Blume-Capel model in the case of a "wand" type graph on a Cayley tree

In this paper, we investigate translation-invariant splitting Gibbs measures (TISGMs) for the HC-Blume-Capel model on a "wand" graph embedded in the Cayley tree of arbitrary order $k \geq 2$. It is known that there is the exact critical value $\theta_{cr}$ such that for $\theta \geq \theta_{cr}$, there exists a unique TISGM, whereas for $\theta < \theta_{cr}$, precisely three TISGMs exist in the case of a "wand" graph for the given model. In the present paper, we completely solve the (non-)extremality problem for one of these measures for any order $k$ of Cayley tree
Read the full abstract

Differential Geometry · Cross-listed from cs.LG

Geometry-aware similarity metrics for neural representations on Riemannian and statistical manifolds

Similarity measures such as centred kernel alignment (CKA) or representational similarity analysis (RSA) are widely used to compare the representational geometries employed by different neural networks to solve the same task. Yet, because existing methods compare the extrinsic geometry of representations in state space, rather than their intrinsic geometry, they may fail to capture subtle yet crucial distinctions between fundamentally different computations. Here, we introduce metric similarity analysis (MSA), a novel method which leverages tools from Riemannian geometry to compare the intrinsic geometry of neural representations under the manifold hypothesis. We show that MSA can be used to (i) disentangle neural computations of deep networks in rich vs. lazy learning regimes, (ii) compare the dynamics of recurrent neural networks and state-space models, and (iii) investigate the statistical manifolds of diffusion models. Overall, we introduce a mathematically grounded and broadly applicable framework to understand the mechanisms behind neural computations by contrasting their intrinsic geometries.
Read the full abstract

Combinatorics

Odd Hadwiger number and graph products

The Odd Hadwiger number of a graph $G$ is the largest integer $r$ such that $G$ has a clique of size $r$ as an odd minor. In this paper, we investigate how large is the Odd Hadwiger number of the product of two graphs, when considering any of the four standard graph products: Cartesian, direct, lexicographic, strong. We provide an optimal lower bound in the cases of the strong and lexicographic products.
Read the full abstract

All authors Henry Echeverría, Andrea Jiménez, Suchismita Mishra, Daniel A. Quiroz, Mauricio Yépez

Optimization and Control

Constrained Optimization on Matrix Lie Groups via Interior-Point Method

This paper proposes an interior-point framework for constrained optimization problems whose decision variables evolve on matrix Lie groups. The proposed method, termed the Matrix Lie Group Interior-Point Method (MLG-IPM), operates directly on the group structure using a minimal Lie algebra parametrization, avoiding redundant matrix representations and eliminating explicit dependence on Riemannian metrics. A primal-dual formulation is developed in which the Newton system is constructed through sensitivity and curvature matrices. Also, multiplicative updates are performed via the exponential map, ensuring intrinsic feasibility with respect to the group structure while maintaining strict positivity of slack and dual variables through a barrier strategy. A local analysis establishes quadratic convergence under standard regularity assumptions and characterizes the behavior under inexact Newton steps. Statistical comparisons against Riemannian Interior-Point Methods, specifically for optimization problems defined over the Special Orthogonal Group SO(n) and Special Linear Group SL(n), demonstrate that the proposed approach achieves higher success rates, fewer iterations, and superior numerical accuracy. Furthermore, its robustness under perturbations suggests that this method serves as a consistent and reliable alternative for structured manifold optimization.
Read the full abstract

Algebraic Geometry

Weakly special varieties, Campana stacks, and Remarks on Orbifold Mordell

We construct the first weakly special surfaces that are not Campana-special, including the complement of the plane curve $x^2y^3 = 1$ in $\mathbb{A}^2$. We prove that the set of $\mathcal{O}_{K,S}$-integral points on this surface is non-dense for every number field $K$ and finite set $S$ of finite places of $K$ if and only if Campana's Orbifold Mordell conjecture holds for $(\mathbb{G}_m, \tfrac{1}{2}[1])$. This basic example carries a natural $\mathbb{G}_m$-action, and the quotient stack is an Artin stack parametrizing points on a C-pair. This leads to the introduction of "Campana stacks", which encode morphisms of C-pairs in a manner analogous to the role of root stacks for integral points satisfying prescribed divisibility conditions.
Read the full abstract

Combinatorics

Upper bound on the $k$-th eigenvalue of a graph

We prove a general upper bound on the $k$-th adjacency eigenvalue of a graph. For $k\ge 2$, we show that \[ \lambda_k(G)\le \frac{(k-2)\sqrt{k+1}+2}{2k(k-1)}\,n-1 \] for every graph $G$ on $n$ vertices. We build on a recent approach that addresses the case $k=3$ and generalize the upper bound for all $k \geq 3$ by using the positivity of Gegenbauer polynomials. The upper bound is tight for $k \in \{2,3,4,8,24\}$. We also highlight the close relation of $\lambda_k(G)$ to questions about equiangular lines.
Read the full abstract

Probability

Free energy analyticity of the disordered XY model and Debye screening in the 2D Coulomb gas

We consider three models of statistical mechanics: the classical XY model in arbitrary dimension, the lattice Coulomb gas in dimension two, and the square well model in arbitrary dimension. For each of these three models, we prove that the free energy is analytic in the disordered regime (the square well model is disordered at any positive temperature). In order to prove these results, we prove that the Gibbs measures of these models are factors of i.i.d. with information clusters of exponentially decaying size (volume). In the case of the Coulomb gas, we obtain a strong version of Debye screening with an arbitrary number of arbitrary local observables of the Coulomb gas, and we prove that the Debye phase contains the complement of the Berezinskii-Kosterlitz-Thouless phase.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.str-el

Categorical Time-Reversal Symmetries

The classification of phases using categorical symmetries has greatly expanded the landscape of gapped and gapless phases. So far, however, these developments have largely been restricted to phases with unitary (higher-)categorical symmetries over $\mathbb{C}$. In this work, we incorporate anti-unitary symmetries, such as time-reversal symmetry $\mathbb{Z}_2^T$, and show that the relevant physical structures are naturally described by fusion categories over $\mathbb{R}$. A class of real fusion categories, which we call Galois-real fusion categories, provides the correct categorical model for anti-unitary symmetries. A simple example is the time-reversal symmetry $\mathbb{Z}_2^T$ itself. We discuss the basic structures of real fusion categories and present a range of examples, including the group-theoretical categories $(G^T)^{\omega}$ and $\mathsf{Rep}(G^T)$ associated to anti-linear groups $G^T$, as well as non-invertible time-reversal symmetries described by a real analogue of Tambara–Yamagami fusion categories. We then classify gapped phases enriched with anti-linear symmetries in terms of module categories over Galois-real fusion categories. We furthermore apply the categorical formulation to prove dualities (i.e. gauge or Morita equivalences) of anti-linear symmetries generated by gauging subgroups. Complementing this, we also develop a Symmetry Topological Field Theory (SymTFT) framework, in which Galois-real fusion categories arise as boundary conditions of a $\mathbb{Z}_2^T$-enriched SymTFT. Morita equivalent anti-linear symmetries are shown to arise as different boundaries of the same $\mathbb{Z}_2^T$-enriched SymTFT.
Read the full abstract

Analysis of PDEs

Slow dispersion in Floquet-Dirac Hamiltonians

We study dispersive decay for non-autonomous Hamiltonian systems. While the general theory for dispersion in such non-autonomous systems is largely open, it was shown \cite{kraisler2025time} that there exists a time-periodically forced one-dimensional Dirac equation with unusually slow dispersive decay rate of $t^{-1/5}$. It is to be expected that such behavior is not generic and requires a very particular forcing term; we provide a more general ansatz and systematic procedure to construct such an equation with a dispersive decay rate no faster than $t^{-1/10}$. Our limitations are purely algebraic and it stands to reason that arbitrarily slow decay, $t^{-\varepsilon}$ for every $\varepsilon > 0$, should be achievable.
Read the full abstract

Numerical Analysis

A Scalable Monolithic Modified Newton Multigrid Framework for Time-Dependent $p$-Navier-Stokes Flow

Fully implicit tensor-product space-time discretizations of time-dependent $(p,\delta)$-Navier-Stokes models yield, on each time step, large nonlinear monolithic saddle-point systems. In the shear-thinning regime $1<p<2$, especially as $p\downarrow 1$ and $\delta\downarrow 0$, the decisive difficulty is the constitutive tangent: its ill-conditioning impairs Newton globalization and the preconditioning of the arising linear systems. We therefore develop a scalable monolithic modified Newton framework for tensor-product space-time finite elements in which the exact constitutive tangent in the Jacobian action is replaced by a better-conditioned surrogate. Picard and exact Newton serve as reference linearizations within the same algebraic framework. Scalability is achieved through matrix-free operator evaluation, a monolithic multigrid V-cycle preconditioner, order-preserving reduced Gauss-Radau time quadrature, and an inexact space-time Vanka smoother with single-time-point coefficient freezing in local patch matrices. We prove coercivity of the linearized viscous-Nitsche term in the uniformly elliptic regime $\nu_\infty>0$ and consistency of the reduced time quadrature. Numerical tests demonstrate robustness with respect to model parameters, nonlinear and linear iteration counts, and scalable parallel performance.
Read the full abstract