Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Sunday 17 May

Information Theory · Cross-listed from eess.SP

Leveraging Deep Reinforcement Learning for Clustered Cell-Free Networking Over User Mobility

Clustered cell-free networking paves a new way for enabling scalable joint transmission among access points (APs) by partitioning the whole network into non-overlapping subnetworks. Previous works adopted clustering algorithms, graph partitioning methods or conventional continuous optimization theories to partition a network based on the channels between all users and all APs, resulting in huge channel measurement and computational costs. This makes these methods difficult to be implemented in practical systems since the optimal network partition could vary frequently due to user mobility. In addition, existing methods were usually designed for specific clustered cell-free networking problems with different optimization algorithms employed. In this paper, we leverage deep reinforcement learning (DRL) for clustered cell-free networking so as to rapidly adapt to user movements in dynamic environments, and propose a deep deterministic policy gradient based clustered cell-free networking (DDPG-C$^{2}$F) framework that can be adapted in various application scenarios. Moreover, in our framework, only one single channel needs to be estimated at each AP as the input of the neural network, which greatly reduces the channel measurement costs for clustered cell-free networking, and the training and inference costs of our framework. The proposed DDPG-C$^{2}$F framework is then applied to various clustered cell-free networking problems with different objectives and constraints to demonstrate its performance. Simulation results show that our framework outperforms existing baselines in all scenarios. Moreover, we show that the proposed framework can reduce the handover cost over user mobility, and is robust to dynamic scenarios with random user joining or leaving.
Read the full abstract

All authors Ouyang Zhou, Junyuan Wang, Bo Qian, Antonio Pérez Yuste, Yusheng Ji

Geometric Topology

Flexible exponent of geometric 3-manifolds and Legendrian maps of Seifert spaces

A classical question in quantitative topology is to bound the mapping degree $\operatorname{deg}(f)$ in terms of its Lipchitz constant $\operatorname{Lip}(f)$. For a closed, oriented manifold $M$, the flexible exponent $\alpha(M)$ is the infimum of $\alpha\geq 0$ such that $|\operatorname{deg} f|\leq C(\operatorname{Lip} f)^\alpha$ holds for all differentiable map $f:M\to M$. The flexible exponent measures how effectively a manifold can wrap itself through self-maps. For geometric 3-manifolds $M$ in the sense of Thurston, we give the complete result for $\alpha(M)$: \[ \alpha(M)= \begin{cases} 3 & M \text{ modeled on } \mathbb S^3,\mathbb E^3,\mathbb S^2\times\mathbb E^1,\\ \frac83 & M \text{ modeled on Nil},\\ 2 & M \text{ modeled on Sol},\\ 1 & M \text{ modeled on }\mathbb H^2\times\mathbb E^1,\\ 0 & M \text{ modeled on } \mathbb H^3,\widetilde{\rm SL_2}. \end{cases} \] To prove $\alpha(M)=8/3$ for Nil 3-manifold $M$, we construct the so-called Legendrian map: a smooth self-map $f: M\to M$ such that $f$ is homotopic to the identity and $f$ maps all $S^1$-fibers into the orthogonal contact plane field simultaneously. Moreover, we prove that any Legendrian map must not be a diffeomorphism.
Read the full abstract

All authors Jianru Duan, Jianfeng Lin, Shicheng Wang, Zhongzi Wang, Dongyi Wei

Optimization and Control · Cross-listed from cs.AI

CAM-Bench: A Benchmark for Computational and Applied Mathematics in Lean

Formal theorem-proving benchmarks enable mechanically verifiable evaluation of mathematical reasoning in large language models. However, existing benchmarks mainly focus on Olympiad-style problems and algebraic domains, leaving computational and applied mathematics underrepresented. We introduce CAM-Bench, a Lean 4 theorem-proving benchmark of 1,000 Lean proof targets in computational and applied mathematics, with coverage spanning optimization, numerical linear algebra, and numerical analysis. These problems are adapted from textbook exercises and often depend on locally introduced definitions, notation, algorithms, and elementary results. To construct CAM-Bench, we develop a dependency-recovery pipeline that reconstructs the local textbook context needed to state each problem faithfully. It then normalizes each problem into a standalone informal theorem and translates it into a Lean target. We validate the resulting formal problems through Lean compilation and semantic review, checking both formal correctness and semantic alignment with the original exercises. For each problem, we release the raw exercise, recovered context, normalized informal theorem, and final Lean target. CAM-Bench complements existing formal mathematics benchmarks by targeting applied mathematics problems that rely on textbook concepts and elementary theorems, many of which are not directly available as standard Mathlib4 lemmas. We evaluate widely used large language models and formalization agents on CAM-Bench, and analyze common failure modes in tracking local assumptions, applying elementary results, decomposing proofs, and maintaining long-horizon control in Lean.
Read the full abstract

All authors Wentao Long, Yunfei Zhang, Chenyi Li, Li Zhou, Chumin Sun, Zaiwen Wen

Complex Variables

Some sharp Schwarz type estimates and their applications in Banach spaces

The primary objective of this paper is to develop methodologies for investigating Schwarz type lemmas and to present their applications in Banach spaces. First, we improve upon the main results obtained by Rogosinski [Jber. Dtsch. Math.-Verein 44: 258–261, 1934] %Osserman [Proc. Am. Math. Soc. 128: 3513-3517, 2000] and Chen et al. [J. Anal. Math. 152: 181-216, 2024]. Based on these sharp estimates, we then derive several sharp boundary Schwarz type lemmas (also known as Hopf type lemmas) for holomorphic mappings in Banach spaces, as well as for solutions to certain classes of elliptic partial differential equations on the Euclidean unit ball in $\mathbb{C}^n$ or on the unit disk in $\mathbb{C}$. Furthermore, we prove some sharp Schwarz type lemmas for holomorphic mappings that send a prescribed point to another prescribed point. Finally, these lemmas are applied to establish a sharp Minda type Schwarz inequality in Banach spaces and to provide a sharp refined bound on subballs of the unit ball.
Read the full abstract

All authors Shaolin Chen, Hidetaka Hamada, Megha Kundathil, Ramakrishnan Vijayakumar

Functional Analysis

Singular value functions for C\(^*\)-algebras

We introduce singular value functions for C\(^*\)-algebras, generalizing the singular values of compact operators on Hilbert spaces. We also establish several fundamental properties of these singular value functions and present examples of singular value functions for certain classes of C\(^*\)-algebras.
Read the full abstract

Analysis of PDEs

Geometric uncertainty principles for Schrödinger evolutions on negatively curved manifolds

In this paper, we study the uncertainty principle for Schrödinger equations with a bounded time-independent potentials on certain Cartan-Hadamard manifolds endowed with an asymptotic hyperbolic metric in dimensions $n\geq2$. The classical Hardy uncertainty principle in Euclidean space, as developed in the works of Escauriaza-Kenig-Ponce-Vega (JEMS, 2008; Duke Math. J., 2010), reveals a rigidity phenomenon for solution $u$ to Schrödinger equations: sufficiently strong Gaussian decay at two distinct times yields $u\equiv0$. In this work, we show that a similar rigidity persists in the setting of hyperbolic geometry, despite the absence of translation invariance and Fourier representation. Our approach follows a general strategy of Escauriaza-Kenig-Ponce-Vega, where the underlying geometry brings an essential change. This enables us to establish new Carleman estimates and logarithmic convexity. Unlike the Euclidean setting, the hyperbolic geometry exhibits exponential volume growth and nontrivial geodesic escape at infinity, which fundamentally alters the propagation mechanism of Schrödinger evolutions. Based on the newly-built virial identities and an approximation argument, we derive the logarithmic convexity. The main difficulty in proving the logarithmic convexity is the lack of convolution structure on general manifolds. By making use of the exponential map and Jacobi field, we define a new mollifier on curved geometry. Meanwhile, to establish the Carleman estimate adapted to hyperbolic space, we introduce a new weight function adapted to the curved manifold. Our results highlight the role of curvature in shaping quantitative uniqueness properties for dispersive equations.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Vocabulary-size-independent Convergence of Discrete Diffusion Models: adjoint equations induce the right space

Discrete diffusion has become a leading framework for generative modeling in various applications including language, vision, and biology. Existing convergence theory, however, exhibits fundamental limitations. KL-based analyses diverge under singular priors such as the masked distribution, while bounds in total variation (TV) depend on the vocabulary size $S$ and become vacuous for modern language tasks, where vocabularies contain hundreds of thousands of tokens. We develop a unified adjoint-equation-based framework that establishes vocabulary-size-independent convergence guarantees in any integral probability metric (IPM). To the best of our knowledge, our bounds are the first to be entirely free of $S$ and applicable to both masked and uniform priors. Importantly, our results can extend existing step complexity guarantees to any IPM. Also, our theory relies only on a single standard rate-matrix regularity assumption and applies to general priors. Five novel techniques drive our improvements: 1. working in the space of observables via adjoint equations rather than directly with probability measures; 2. a regularity analysis that yields bounds on any IPM; 3. a coupling argument that removes $S$-dependence under uniform transitions; and 4. score-marginal cancellation and 5. exit-routing techniques that remove $S$-dependence under masked transitions. Our framework thus sharply departs from prior analyses and avoids the shortcomings of pathspace-KL and existing TV-based approaches. Beyond convergence bounds, our framework provides a versatile toolkit for further theoretical study of discrete diffusion models, including principled choices of loss functions and vocabulary-size-independent step complexity.
Read the full abstract

All authors Kelvin Kan, Xingjian Li, Benjamin J. Zhang, Tuhin Sahai, Stanley Osher, Markos A. Katsoulakis

Algebraic Geometry

Moduli of Persson surfaces: The compactification via KSBA stable pairs and a generic global Torelli type theorem

We study a family of canonically polarized surfaces introduced by Persson, which arise as Galois $G=(\mathbb{Z}/2\mathbb{Z})^4$-covers of $\mathbf{P}^2$ branched along eight general lines. For this family, we construct the compactified moduli space and explicitly describe the stable degenerations in the sense of Kollár, Shepherd-Barron, and Alexeev (KSBA) via stable pairs of weighted hyperplane arrangements. By computing the $\mathbb{Q}$-Gorenstein obstructions and using the KSBA wall crossings, we show that the resulting compactified moduli stack is smooth. Furthermore, we establish a generic global Torelli type result: up to two possibilities, a generic smooth Persson surface can be recovered from the Hodge structure on the anti-invariant part of the second cohomology of its étale double cover, together with the associated $\widetilde{G}=(\mathbb{Z}/2\mathbb{Z})^5$-action.
Read the full abstract

All authors Hanlong Fang, Bin Nguyen, Xian Wu, Zheng Zhang

Combinatorics

Induced subdivisions in graphs of large girth

In this paper, we prove that there exists an absolute constant $g_0$ such that, for every integer $k\ge 3$, every graph $G$ with $\delta(G)\ge k$ and $g(G)\ge g_0$ contains an induced subdivision of $K_{k+1}$. This fully resolves a problem raised by Kühn and Osthus (originally attributed to Shi), and improves a recent result of Girão and Hunter. Our proof uses some ideas from Girão and Hunter. Another main ingredient in our proof is an induced variant of Mader's theorem: for every fixed \(s,\eta,D\), every graph \(J\) with \(\Delta(J)\le D\), \(d(J)>s-2+\eta\) and sufficiently large girth contains an induced subdivision of \(K_s\).
Read the full abstract

Saturday 16 May

Functional Analysis · Cross-listed from quant-ph

Spectral geometric mean and trace characterizations

We use nearly parallel pure states to characterize positive linear functionals $\phi$ on $\mathbb{M}_n$ as positive multiples of the trace if and only if $\phi(A \natural B) \leq \sqrt{\phi(A) \phi(B)}$ for all positive definite matrices $A$ and $B$. Here $A \natural B = (A^{-1} \# B)^{1/2} A (A^{-1} \# B)^{1/2}$ represents the spectral geometric mean. For further clarification, we establish novel characterizations through the inequality $\phi(A \natural B) \leq \phi((A+B)/2)$ for all positive definite matrices $A$ and $B$. We also present a trace inequality related to quantum fidelity that applies to all positive definite matrices, and demonstrate that it does not characterize the trace.
Read the full abstract

All authors Airat Bikchentaev, Trung Hoa Dinh, Anh Vu Le, Mohammad Sal Moslehian

Information Theory

The Extremum Stack is a Minimal Sufficient Statistic for Rate-Independent Functionals: A Kolmogorov Complexity Characterisation

We prove that the extremum stack of a discrete sequence is a minimal sufficient statistic for the class of all computable, causal, rate-independent functionals, in the sense of Kolmogorov complexity. Specifically, we establish K(Pi_n) - O(1) <= K_R(u_{0:n}) <= K(Pi_n) + O(1), where K_R(u_{0:n}) is the length of the shortest program answering every query in the class R, and the O(1) overhead is independent of both the sequence length n and the stack depth k. Sufficiency follows from the classical wiping property of the Preisach hysteresis operator. Minimality is established via a finite indicator family whose rate-independence is verified explicitly. Any compression of a hysteresis-driven stream that preserves the full class R must therefore retain at least K(Pi_n) - O(1) bits; the stack-based compression algorithm implied by the result carries a Kolmogorov optimality guarantee that none of the standard time-series compression methods provide.
Read the full abstract

Differential Geometry

Quantitative Stability for Minimizing Yamabe Metrics with minimal boundary

In this paper, we investigate the stability of minimizing Yamabe metrics on compact manifolds with boundary, in the sense introduced by Escobar. We show that if a function nearly minimizes the Yamabe energy, then the associated conformal metric is quantitatively close to a minimizing Yamabe metric within its conformal class. Moreover, this closeness is controlled by an appropriate power of the Yamabe energy deficit.
Read the full abstract

Information Theory · Cross-listed from stat.ML

Sample-efficient inductive matrix completion with noise and inexact side-information

Inductive matrix completion (IMC) is a variant of low-rank matrix completion that incorporates row and column side-information. In principle, it can reduce the effective dimension of the recovery problem from the ambient matrix size to the dimension of the side-information features. Existing theory, however, does not fully realize this advantage in the noisy setting: sample-efficient guarantees only apply to noiseless recovery, while noisy guarantees require sample sizes comparable to ordinary matrix completion. This paper closes this gap for noisy IMC. We analyze a nonconvex projected gradient descent algorithm with spectral initialization and prove that, under exact side-information, it achieves linear convergence and stable recovery at a sample complexity governed by the effective side-information dimension rather than the ambient matrix dimension. The key technical ingredient is a local regularity condition for the IMC loss that holds at this reduced sample size, despite the mismatch between the observation pattern and the side-information subspaces. We further extend the analysis to inexact side-information, showing that the same reduced sample complexity is preserved and that the estimation error degrades optimally with the level of subspace misspecification. Motivated by this trade-off, we also propose a penalized interpolation between IMC and ordinary matrix completion that balances sample efficiency against robustness to imperfect side-information. Simulations and experiments on the MovieLens dataset support the theoretical findings and illustrate the practical benefits of exploiting side-information in low-sample regimes.
Read the full abstract

Numerical Analysis

Operator splitting for exploiting linear-rate closure in solving infinite ODE hierarchies

We introduce an operator-splitting method for infinite hierarchies of linear ordinary differential equations (ODEs) indexed by nonnegative integers. When the coupling coefficients depend linearly on the count index, an exact transformation closes the equations on finite count-index windows without an upper-boundary value. For more general hierarchies, Strang splitting applies the linear-rate closure during the linear-rate substeps and a conventional capped solver to the remainder. We derive the closure from generating functions and the method of characteristics and extend it to multi-indexed systems. The derivation requires neither positivity nor mass conservation, so it applies to a wider class of systems than the examplar stochastic models presented here. We discuss branching processes, stochastic predator-prey dynamics, the Schlögl chemical kinetics model, and a telegraph model for gene expression. Through numerical experiments and computational cost analyses we demonstrate that our operator splitting method is typically advantageous for solving large scale systems in terms of memory usage and computational time, while retaining accuracy competitive with finite state projection (FSP) methods.
Read the full abstract

Numerical Analysis

Numerical Instabilities in the Kaczmarz Method and Stabilization by Iterative Refinement

The randomized Kaczmarz method and its accelerated variants are a powerful class of iterative methods for solving large-scale linear systems, offering guaranteed convergence with low per-iteration cost. However, their numerical stability remains poorly understood. In this work, we investigate the stability properties of both classical and accelerated randomized Kaczmarz methods, with an emphasis on how error propagates across iterations and interacts with acceleration. We show that both classical and accelerated randomized Kaczmarz fail to be forward stable. To address this issue, we propose the integration of iterative refinement into randomized Kaczmarz frameworks. We demonstrate that refinement can effectively control error accumulation and recover high-accuracy solutions, even when the system is ill-conditioned. Numerical experiments corroborate our theoretical findings and illustrate the practical benefits of combining refinement with both classical and accelerated Kaczmarz methods.
Read the full abstract

All authors Michał Dereziński, Ethan N. Epperly, Deanna Needell, Alexander Xue

Optimization and Control · Cross-listed from cs.LG

The Geometry of Projection Heads: Conditioning, Invariance, and Collapse

We develop a geometric theory of projection heads in self-supervised learning by modeling the head as a trainable Riemannian metric on the backbone representation manifold. We show that linear heads perform implicit subspace whitening, while nonlinear heads adapt local metrics to satisfy the specific topological constraints of the loss, with head depth empirically dictating this capacity. Analyzing dimensional collapse, we prove that smooth nonlinear heads natively induce negative eigenvalues in the Hessian at collapsed equilibria, making them unstable. We empirically validate this by continuously tracking the optimization geometry during training, which reveals that smooth activations like Swish can generate explicit negative curvature to escape collapse, whereas linear and ReLU heads under continuous-time gradient flow cannot, relying instead on discrete-time optimization dynamics and BatchNorm. Finally, we geometrically characterize how metric degeneracy governs the information-invariance trade-off, explaining why the head must be discarded. Evaluated across contrastive and decorrelation-based objectives on foundation models, our results demonstrate that the projection head acts as a universal geometric buffer, decoupling the semantic backbone from the rigid, destructive constraints of the pretraining objective.
Read the full abstract

Optimization and Control

High-dimensional Limit of SGD for Diagonal Linear Networks

Understanding the behavior of stochastic gradient methods is a central problem in modern machine learning. Recent work has highlighted diagonal linear networks as a simplified yet expressive setting for analyzing the optimization and generalization properties of neural models. In this work, we show that in the high-dimensional regime, stochastic gradient descent on diagonal linear networks is well-approximated by continuous dynamics governed by a stochastic differential equation (SDE), which explicitly decouples the drift from the gradient noise. We further derive a deterministic partial differential equation whose solution propagates the relevant state of the iterates and characterizes the time evolution of a broad class of observable statistics, including the risk, curvature, and other metrics for optimality. Finally, we show that, under a suitable parametrization, the stochastic dynamics are globally well posed and converge exponentially fast to zero risk with high probability, yielding a fully explicit non-asymptotic description of their long-time behavior. Numerical simulations corroborate our theoretical findings.
Read the full abstract

All authors Begoña García Malaxechebarría, Courtney Paquette, Maryam Fazel, Dmitriy Drusvyatskiy

Logic

Inception Display Calculi

Display calculi were introduced by Nuel Belnap in `Display logic' (1982) as a natural extension of Gentzen's sequent calculi, as a uniform and modular framework capable of encompassing broad classes of logics. In `Unified correspondence as a proof-theoretic tool', the properly displayable (D)LE-logics are syntactically characterized as the logics axiomatised by analytic inductive axioms for any signature. We extend the framework of proper display calculi for LE-logics to include axiomatic extensions with axioms that are inductive but not necessarily analytic inductive. This class of axioms covers and properly extends all Sahlqvist axioms. The present framework takes inspiration from Schroeder-Heister's calculus of Higher-Level Rules and captures the whole acyclic fragment of the substructural hierarchy when generalized to arbitrary signatures. We apply unified correspondence theory and the algorithm ALBA to uniformly generate analytic rules for the aforementioned axiomatic extensions.
Read the full abstract

Group Theory

Higher Commutativity in Finite Groups, Rigidity, Extremal bounds, and Heisenberg-Type Families

For a finite group $G$ and an integer $r\ge 2$ let $$ P_r(G):=\frac{|Hom(\mathbb Z^r,G)|}{|G|^r}, $$ where $\Hom(\mathbb Z^r,G)$ is the set of pairwise commuting $r$-tuples in $G$. This paper studies rigidity and extremal behavior of the hierarchy $\{P_r(G)\}_{r\ge2}$, together with a low-rank representation-theoretic / TQFT counting bridge. The first main direction is cyclic-index rigidity: for groups with an abelian normal subgroup $A$ and cyclic quotient of order $\omega$, under a natural fixed-subgroup hypothesis we prove the exact all-rank formula $$ P_r(G)=\frac{1}{\omega^r}+\left(1-\frac{1}{\omega^r}\right)\left(\frac{|A\cap Z(G)|}{|A|}\right)^{r-1}, $$ which yields gap and rigidity statements for non-abelian abelian extensions of prime index. The second main direction is the class-$2$ exponent-$p$ world. We develop a symplectic reduction, obtain closed formulas when $|G'|=p$, and prove a closed all-$r$ hierarchy in the $\mathbb F_q$-Heisenberg family: \[ P_r(G)=q^{-2nr}\sum_{k=0}^{\min(n,r)}L_{n,k}(q)\prod_{i=0}^{k-1}(q^r-q^i). \] In particular, inside the $\mathbb F_q$-Heisenberg family the pair $(P_2(G),P_3(G))$ already determines the isoclinism class. Combining the cyclic-index formula with the known sharp upper bound for the multiple commutativity degree gives equality and near-extremal rigidity, including a stability gap near $11/32$ for commuting triples. At the low-rank end we also prove explicit class-number formulas for $P_3(G)$ and $P_4(G)$; these recover the simple-count formulas for the untwisted Drinfeld double and the untwisted quantum triple / double-loop-groupoid algebra.
Read the full abstract

Numerical Analysis

Rational approximation and intrinsic Gaussian processes

Gaussian processes (GPs) defined through intrinsic random fields provide a flexible framework for modeling spatial phenomena, and have been advocated in a variety of applications over the past several decades. Nevertheless, their adoption has lagged behind traditional, covariance-based approaches, in part because the intrinsic formulation has lacked an accompanying toolkit of computational methods and dependence specifications that facilitate fitting and prediction. We develop here a systematic framework for modeling intrinsic GPs and introduce practical algorithms and dependence/variogram models for modeling, inference and computation that parallel those of traditional, stationary GPs. We explore a close connection between intrinsic GP models and rational approximation, which clarifies the underlying problem structure. Numerical examples illustrate how the new tools can be deployed in practice, highlighting the advantages of intrinsic-field modeling in terms of robustness, interpretability, and computational efficiency.
Read the full abstract

All authors Christopher Beattie, David Higdon, Leanna House, Colby Stakun-Pickering, Jared Clark

Functional Analysis

A Weighted Spectral Quantum Fidelity

We introduce and study a one-parameter family of fidelity-type quantities based on the weighted spectral geometric mean, which we call the weighted spectral fidelity \( \mathsf{F}_t^{\mathrm{spec}}(\rho,\sigma):=\Tr\!\big[\rho(\rho^{-1}\sharp\sigma)^{2t}\big],\ t\in[0,1]. \) This family interpolates smoothly between the trivial overlap ($t=0,1$) and the Uhlmann (root) fidelity at $t=\tfrac12$, and it is distinct from the sandwiched Rényi family except at this midpoint. We establish core structural features-unitary invariance, tensor stabilization and multiplicativity, flip symmetry, endpoint behavior, and a orthogonality criterion. We further show explicit violations of DPI for generic $t\neq\tfrac12$. For concavity in the state variables we obtain concavity in each variable separately. Closed forms are obtained for pure states and for qubits in Bloch coordinates. We also extend the first Fuchs–van de Graaf inequality to $\mathsf{F}_t^{\mathrm{spec}}$ for all $t\in[0,1]$, while the second inequality fails away from the midpoint.
Read the full abstract

All authors Cong Trinh Le, The Khoi Vu, Minh Toan Ho, Trung Hoa Dinh

Logic

Modular constructive Lyndon interpolation for nondistributive logics

We establish the Lyndon interpolation property for basic lattice expansion logics (LE-logics) in arbitrary signatures using display calculi. Our approach is constructive, yielding interpolants algorithmically from derivations, and modular, in the sense that interpolation for axiomatic extensions can be obtained by verifying a local interpolation property for the analytic structural rules corresponding to the additional axioms. To this end, we identify a class of interpolation-safe structural rules preserving local Lyndon interpolation. As applications of the general framework, we show that the tense version of Holliday's fundamental modal logic enjoys the Lyndon interpolation property.
Read the full abstract

All authors Andrea De Domenico, Giuseppe Greco, Alessandra Palmigiano, Apostolos Tzimoulis

Number Theory

Gaps of Binary Numerical Semigroups and of Binary Inclusion-Exclusion Polynomials

Let $p$ be a given modulus, let $u$ be prime to $p$, and consider the linear permutation $u\cdot n\pmod p$ of the residue system modulo $p$. Writing $\langle x\rangle_p$ to denote the least nonnegative residue of $x$ modulo $p$, we say that a pair of integers $(a,b)$ is a dominant pair of this permutation if either the inequality $\max(\langle ua\rangle_p,\langle ub\rangle_p)<\min_{a<n<b}\langle un\rangle_p$, or the inequality $\min(\langle ua\rangle_p,\langle ub\rangle_p)>\max_{a<n<b}\langle un\rangle_p$ hold. The main technical part of this work gives analysis of this property of linear permutations of residue systems. We then apply this analysis to the problems that motivated it, and give (i) complete description of the gapsets of binary inclusion-exclusion polynomials $Q_{\{p,q\}}$ (which include binary cyclotomic polynomials $\Phi_{pq}$ as its principal special case), and (ii) complete description of all possible distances between consecutive elements of a numerical semigroup $\langle p,q\rangle$.
Read the full abstract

Probability

Almost periodicity as a path property for $p$-adic self-similar processes with stationary increments

Shen and Zhang (2021) showed that almost periodicity naturally arises in the spectral representation of discrete-time $p$-adic self-similar processes with stationary increments. In this paper, we study several notions of almost periodicity as sample path properties of Banach space-valued $p$-adic sssi processes. We prove that Bohr almost periodicity is equivalent, as a path event, to continuity with respect to the $p$-adic topology. We also show that the corresponding equivalence fails for Weyl and Besicovitch almost periodicity. Finally, we extend the Bohr almost-periodic result to finite-dimensional random fields.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Stress-Testing Neural Network Verifiers with Provably Robust Instances

Neural network verifiers aim to provide formal guarantees on model behavior, but existing verification benchmarks are fundamentally limited by their lack of ground-truth labels. As a result, verifier evaluation relies on indirect heuristics, which prevents exact scoring and systematic study of verifier failure modes. We address this gap by introducing a reusable framework for generating verification instances whose ground-truth robustness labels are known a priori through analytic construction. Our framework led to the discovery of multiple numeric tolerance concerns and an implementation bug in popular verifiers, highlighting the need for ground-truth labels. Additionally, to systematically study verifier failure modes, we introduce the verification Difficulty Profile, a collection of estimable quantities capturing distinct sources of instance hardness. Using our framework and these profiles, we evaluate five state-of-the-art verifiers and show that different instances stress distinct aspects of the verification pipeline. We show that these results can aid the future development of verifiers as they provide actionable targets for improving numerical reliability, relaxation quality, and search behavior. Our code is publicly available: https://github.com/dtroxell19/VeriStressGT.git.
Read the full abstract

All authors David Troxell, Yulia Alexandr, Sofia Hunt, Stephanie Lei, Guido Montúfar

Optimization and Control

QPLEX Decision Processes: Formulation via Nonlinear Markov Chains and Optimization via Policy Gradients

We introduce a QPLEX Decision Process (QDP) as a model for dynamic control of queueing systems with non-stationary arrivals, general service distributions, and service-level chance constraints. QDPs integrate QPLEX, a computational modeling methodology for transient analysis of stochastic systems, into a nonlinear Markov decision framework. Since QPLEX approximations use nonlinear transition probabilities with orders-of-magnitude smaller state spaces, QDPs circumvent the curse of dimensionality associated with general service times. Via forward and backward iterative schemes, we can rapidly compute gradients deterministically on the much smaller state space, eliminating sampling variance. We further address optimization through natural-gradient-inspired methods with block-diagonal Fisher approximations. To illustrate the QDP methodology, we formulate a single-station dynamic pricing problem with non-stationary demand as a QDP. When the reward structure uses waiting and terminal costs, our approach can find near-optimal policies in seconds on a single CPU; when the reward structure uses penalties for deviating from service-level chance constraints, the optimization landscape is substantially more challenging yet our approach can find a high-quality, practical policy in approximately a minute on a single CPU.
Read the full abstract

All authors Antonius B. Dieker, Steven T. Hackman, Zitong Wang, Yunhao Yan

Probability · Cross-listed from q-fin.MF

On the Structural Foundations of Signature Volatility Models: Existence, Arbitrage, Completeness, and the Hedging-Error Decomposition

We establish four structural results for signature volatility models. First, we prove global existence and uniqueness of strong solutions to the signature SDE $dS_t = S_t \langle \ell, \widehat{W}_t \rangle \, dB_t$ on the weighted tensor algebra $T_w$, identifying the admissibility class through a summability condition H1 and an exponential-integrability condition H3 for the square-integrable stochastic-exponential construction. Second, we establish the asset-pricing part on the natural filtration of the prolonged signature and separate it from transform non-explosion: H3 makes the reference-measure stochastic exponential a true martingale, hence yields NFLVR, while global solvability of the associated infinite-dimensional Riccati equation is the additional condition equivalent to absence of explosion for finite signature transforms. Third, we characterise market completeness on the price filtration via the density of the truncated signature span $\mathrm{span}\{\langle e_I, \widehat{W}_T \rangle : |I| \leq N\}$ inside $L^2(\mathcal{F}^S_T, \mathbb{Q})$, and identify the minimal such $N$, the price-filtration completeness depth. Fourth, we derive the hedging-error decomposition $X = \mathbb{E}_\mathbb{Q}[X] + \int_0^T H_s \, dS_s + \varepsilon_T$ for square-integrable payoffs, with residual expanded through the Gram projection of signature components beyond the completeness depth and bounded by a model-dependent projection error. The four results are tied by an architectural identity: the admissible weighted tensor algebra on which the stochastic exponential is a true martingale and finite signature transforms do not explode is the natural valuation cell of a signature SDE. The proofs are self-contained except for standard results from rough path theory, stochastic integration, and quadratic hedging, recalled in the appendices.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Stable minimum principles for scattering states

Quantum-mechanical scattering states are energy eigenstates obeying particular boundary conditions, whose behavior at infinity encodes the S-matrix which defines the outcoming of scattering experiments. With an eye toward numerical algorithms for computing nonrelativistic S-matrices, we present a family of stable minimum principles for scattering states. States that approximately satisfy these minimum principles are shown to have a bounded difference with the true scattering states. These minimum principles and stability estimates can be used to obtain rigorous bounds on scattering amplitudes. We show that these minimum principles are applicable to momentum-dependent potentials, long-range (Coulomb) interactions, and elastic or inelastic scattering of bound states.
Read the full abstract

Combinatorics · Cross-listed from cs.GT

Classification aggregation: a quantitative impossibility theorem

A group of individuals wishes to classify $m$ objects into $n$ categories in such a way that no class is left empty, a condition known as surjectivity. The opinions of the individuals are aggregated separately for each object using an aggregation function that can depend on the object. Maniquet and Mongin showed that if the aggregation functions are unanimous and the outcome must always be surjective, then the aggregation mechanism is dictatorial. Cailloux et al. showed that the same holds even if unanimity is relaxed to citizen sovereignty (each object can be classified into any category). We show that similar results hold even if we only require the outcome to be surjective with probability $1-\epsilon$ (with respect to an arbitrary symmetric i.i.d. distribution), provided that the aggregation functions are far from being constant. On the way, we characterize all aggregation mechanisms whose outcome is always surjective without any assumptions on the aggregation functions. Our approach uses a general result of Alekseev and Filmus which has wider applicability. We illustrate this by proving a similar impossibility result for aggregating equivalence relations.
Read the full abstract

Analysis of PDEs

Wave breaking for perturbed Burgers equations

We establish a simple and explicit criterion for wave breaking for a general class of perturbed Burgers equations that cover several Burgers-type models, including the Fractional KdV equation, the Whitham equation, and the Fornberg-Whitham equation. The proof is both rigorous and straightforward.
Read the full abstract