Functional Analysis
On the Unique Continuation Principle for a Class of Translation Invariant Nonlocal Operators
David Berger and Rene L. Schilling
The unique continuation property (UCP) for an operator $A$ says that, if $Au = 0 = u$ holds on an open set $G$, then one has $u=0$ everywhere. We establish necessary and sufficient conditions for the UCP for the class of Lévy operators. We prove a connection between the UCP of the Lévy operator and its resolvent. Our results are applied to obtain a new elementary proof of the UCP for the fractional Laplace operator, and for certain functions (Bernstein functions) of the discrete Laplace operator.
Read the full abstract ▾
Probability · Cross-listed from quant-ph
Degrees, Levels, and Profiles of Contextuality
Ehtibar N. Dzhafarov and Victor H. Cervantes
We introduce a new notion, that of a contextuality profile of a system of random variables. Rather than characterizing a system's contextuality by a single number, its overall degree of contextuality, we show how it can be characterized by a curve relating degree of contextuality to level at which the system is considered. A system is represented at level n if one only considers the joint distributions with no more than n variables, ignoring higher-order joint distributions. We show that the level-wise contextuality analysis can be used in conjunction with any well-constructed measure of contextuality. We present a method of concatenated systems to explore contextuality profiles systematically, and we apply it to the contextuality profiles for three major measures of contextuality proposed in the literature.
Read the full abstract ▾
Spectral Theory
The elliptical range theorem for the conformal range
Gyula Lakos
The conformal range (or the real Davis–Wielandt shell), which is a particular planar projection of the Davis–Wielandt shell, can be considered as the
hyperbolic version of the numerical range; i. e. it is a “field of values” which can be interpreted as a subset of the asymptotically closed
hyperbolic plane. Here we explain the analogue of the elliptical range
theorem of $2\times2$ complex
matrices for the conformal range.
Read the full abstract ▾
General Mathematics
An Ahmed-like integral
Jean-Christophe Pain
The so-called Ahmed integral $$ \int_{0}^{1}\frac{\arctan\left(\sqrt{2+x^{2}}\right)}{(1+x^{2})\sqrt{2+x^{2}}}\,\mathrm{d} x=\frac{5\pi^{2}}{96}, $$ has attracted considerable interest since its appearance in the "American Mathematical Monthly" in 2001. Several proofs and extensions have been proposed, including a probabilistic multivariate approach introduced by Pla based on powers of the Gaussian integral. In this note, we extend Pla's method to the fifth power of the Gaussian integral. By expressing this power as a sequence of iterated integrals and performing successive reductions, we obtain a new integral identity closely related to Ahmed's integral. In particular, we prove that $$ \int_{0}^{1}\frac{\arctan\!\left(\sqrt{\displaystyle\frac{2+x^2}{4+x^2}}\right)}{(1+x^{2})\sqrt{2+x^{2}}}\,\mathrm{d} x=\frac{\pi^2}{30}. $$ The derivation suggests that Pla's technique can systematically generate a family of Ahmed-type integrals associated with higher powers of the Gaussian integral.
Read the full abstract ▾
Statistics Theory
Breakdown properties of optimal transport maps: general transportation costs
Alberto Gonzalez-Sanz and Marco Avella Medina
Two recent works, Avella-Medina and González-Sanz (2026) and Passeggeri and Paindaveine (2026), studied the robustness of the optimal transport map through its breakdown point, i.e., the smallest fraction of contamination that can make the map take arbitrarily aberrant values. Their main finding is the following: let $P$ and $Q$ denote the target and reference measures, respectively, and let $T$ be the optimal transport map for the squared Euclidean cost. Then, the breakdown point of $T(u)$, when $P$ is perturbed and $Q$ is fixed, coincides with the Tukey depth of $u$ relative to $Q$. In this note, we extend this result to general convex cost functions, demonstrating that the cost function does not have any impact on the breakdown point of the optimal transport map. Our contribution provides a definitive characterization of the breakdown point of the optimal transport map. In particular, it shows that for a broad class of regular cost functions, all transport-based
quantiles enjoy the same high breakdown point properties.
Read the full abstract ▾
Combinatorics
A Permutation Avoidance Game with Reverse Replies and Monotone Traps
Henning Ulfarsson
We study the impartial game PAP (“permutations avoiding patterns”), in which players take turns choosing patterns to avoid. We define a set of length $k$ patterns, $B_k$, and show that it is the unique minimal monotone-forcing subset of $S_k$: every sufficiently long permutation that avoids $B_k$ is monotone, and every monotone-forcing subset of $S_k$ must contain $B_k$. We prove a quadratic upper bound for the monotone-forcing threshold, and determine the exact thresholds for $k=3,4,5,6$. We use properties of the sets $B_k$ to prove that a reverse-reply strategy wins PAP on $S_n$ when $k=4$ for all $n \geq 10$; for $k=3$, the same strategy can be analysed directly. We
conjecture that it is a winning strategy for all $k$ and $n$ sufficiently large.
Read the full abstract ▾
Analysis of PDEs
Existence, Uniqueness, and Smoothing for Generalized EMHD
Chao Wu
We study the Cauchy problem for generalized electron magnetohydrodynamics (EMHD). We establish the local existence and uniqueness of solutions in critical Sobolev spaces, as well as global existence and uniqueness for small initial data. In addition, we prove an instantaneous smoothing effect for the corresponding solutions. Finally, we derive time decay rates for the global solutions.
Read the full abstract ▾
Representation Theory
Extended Admissible Dissections of Marked Surfaces and Piano Algebras
Marina Godinho and Dave Murphy
We introduce the notion of extended admissible dissections of a marked surface, building upon the notion of an admissible dissection of a marked surface by Amiot–Plamondon–Schroll. For each extended admissible dissection we construct a differential graded
algebra, called a piano
algebra, which may be viewed in some sense as a differential graded analogue of a gentle
algebra. We show that for a marked disc without punctures, a piano
algebra is quasi-isomorphic to the graded endomorphism ring of a classical generator of the Paquette–Y\i ld\i r\i m completion of the discrete cluster category of Dynkin type $A_{\infty}$, labelled $\overline{\mathcal{C}}_n$. Furthermore, we show that if two piano
algebras $\Lambda$ and $\Gamma$ both correspond to extended admissible dissections of homeomorphic unpunctured marked discs, then $\Lambda$ and $\Gamma$ are derived equivalent as differential graded
algebras.
Read the full abstract ▾
Numerical Analysis
Unifying Finite Differences and Semi-Lagrangian Schemes via Localized Matrix Exponentials
Víctor Bayona
We present a unified framework for the construction of localized exponential integrators that bypasses the traditional trade-off between the accuracy of global spectral methods and the efficiency of sparse finite differences. By evaluating the
matrix exponential of a discrete operator strictly within a local stencil of size $n$, we "harvest" integration weights that naturally incorporate high-order temporal corrections. We prove that this Local
Matrix Exponential Propagator (LMEP) is algebraically isomorphic to optimal semi-Lagrangian transport for advection and provides algebraically exact coupled
evolution for mixed-physics operators, effectively eliminating the commutator errors associated with operator splitting. The framework is extended to semi-linear systems via a localized augmented
matrix approach, facilitating the evaluation of Exponential Time Differencing (ETD) $\phi$-functions through sparse, banded operations. Numerical experiments on the viscous Burgers, Korteweg-de Vries, and Allen-Cahn equations demonstrate that the method preserves high-order temporal accuracy and exhibits superior stability at high Courant numbers across both periodic and non-periodic domains. We empirically demonstrate that this localized approach yields optimal $\mathcal{O}(N)$ scaling and, for high-CFL upwind configurations, total execution times that remain strictly independent of the spatial approximation order.
Read the full abstract ▾
Functional Analysis
Boundedness of Bilinear Bessel Potentials
Ana Čolović and Xinyu Gao
In analogy with bilinear Riesz potentials, we introduce bilinear Bessel potentials and characterize their boundedness from $L^p\times L^q$ into Lebesgue and Lorentz spaces $L^{r,\alpha}.$ In several cases we identify the optimal Lorentz indices by constructing explicit counterexamples.
Read the full abstract ▾
Optimization and Control
Parameterization of Seed Functions for Equivalent Representations of Time-Varying Delay Systems
Sengiyumva Kisole, Jungbae Chun, Peter Seiler et al. (+1 more)
Abel's classic transformation shows that any well-posed system with time-varying delay is equivalent to a parameter-varying system with fixed delay. The existence of such a parameter-varying constant delay representation then simplifies the problems of stability analysis and optimal control. Unfortunately, the method for construction of such transformations has been ad-hoc – requiring an iterative time-stepping approach to constructing the transformation beginning with a seed function subject to boundary-value constraints. Moreover, a poor choice of seed function often results in a constant delay representation with large time-variations in system parameters – obviating the benefits of such a representation. In this paper, we show how the set of all feasible seed functions can be parameterized using a basis for $L_2$. This parameterization is then used to search for seed functions for which the corresponding time-transformation results in smaller parameter variation. The parameterization of admissible seed functions is illustrated with numerical examples that contrast how well-chosen and poorly chosen seed functions affect the boundedness of a time transformation.
Read the full abstract ▾
All authors Sengiyumva Kisole, Jungbae Chun, Peter Seiler, Matthew M. Peet
Mathematical Physics
Fourier transform of irregular connections on $\mathbb P^1$ and classification of Argyres-Douglas theories
Jean Douçot
We give a mathematical interpretation of the dualities between type $A$ Argyres-Douglas theories recently obtained by Beem, Martone, Sacchi, Singh and Stedman, building on work of Xie. Using the fact that, via the wild nonabelian Hodge correspondence, the data defining such a theory amount to singularity data for irregular connections on $\mathbb P^1$ of a specific form, we show that these dualities can all be realized as compositions of two types of more basic operations acting on such irregular connections: the
Fourier transform and a Möbius transformation exchanging zero and infinity. The proof relies on the stationary phase formula giving explicit expressions for the singularity data of the
Fourier transform. We also clarify the relation between the quivers describing the 3d mirrors of type $A$ Argyres-Douglas theories and the nonabelian Hodge diagrams defined in work of Boalch-Yamakawa and of the author: the 3d mirror corresponds to the unique nonabelian Hodge diagram with no negative edges/loops among those of singularity data in the corresponding orbit under basic operations.
Read the full abstract ▾
Optimization and Control
Fast Relax-and-Round Unit Commitment with Economic Horizons
Shaked Regev, Evan J. R. Brody, Charles Foltz et al. (+2 more)
The US energy system is under increasing pressure to serve expanding data centers loads and to accommodate a larger number of generating units with varying technologies and ownership structures. Therefore, developing new unit commitment (UC) methods remains a priority for reliable and affordable grid operations. We expand our novel computational method for UC to include ramping constraints and long-horizon planning, and provide a theoretical bound on its accuracy. We solve problems with thousands of generators at 5-minute
market intervals. We show that our method can solve UC problems with over 20,000 generators in approximately 10 seconds on commodity hardware and that an increased planning horizon leads to sizable op- erational cost savings. This is twice as fast as the leading commercial solver, Gurobi. The gap increases when adding more constraints. Our method can be implemented using existing continuous optimization solvers and adapted for different applications. We prove a bound on the error of these solvers and show that it vanishes (in relative terms) as the problem becomes larger. Our novel
algorithm could allow an operator to make horizon-aware economic decisions for large systems.
Read the full abstract ▾
All authors Shaked Regev, Evan J. R. Brody, Charles Foltz, Eve Tsybina, Slaven Peles
Algebraic Geometry
Eigenforms and graphs of Hecke operators with wild ramification
Rudrendra Kashyap and Vladyslav Zveryk
Hecke operators on
moduli of bundles over a global function field become substantially more complicated in the presence of ramification. We show that far enough in the Harder-Narasimhan cone of $\mathrm{Bun}_G$, this extra complexity has a simple structure, which allows to reduce most of the study to the unramified case. Using the theory of graphs of Hecke operators, we transform this statement into a combinatorial condition. Utilizing the combinatorial
language, we obtain tight bounds, and for generic
eigenvalues exact formulas for the dimensions of Hecke eigenspaces with arbitrary ramification for $\mathrm{Bun}_{\mathrm{PGL}_2}$. We compare these formulas to the known results in the theory of Eisenstein series. Moreover, our methods allow to construct eigenforms explicitly.
Read the full abstract ▾
Analysis of PDEs · Cross-listed from cs.AI
Semi-Autonomous Formalization of the Vlasov-Maxwell-Landau Equilibrium
Vasily Ilin
We present a complete Lean 4 formalization of the
equilibrium characterization in the Vlasov-Maxwell-Landau (VML) system, which describes the motion of charged
plasma. The project demonstrates the full AI-assisted mathematical research loop: an AI
reasoning model (Gemini DeepThink) generated the proof from a
conjecture, an agentic coding tool (Claude Code) translated it into Lean from natural-
language prompts, a specialized prover (Aristotle) closed 111 lemmas, and the Lean kernel verified the result. A single mathematician supervised the process over 10 days at a cost of \$200, writing zero lines of code. The entire development process is public: all 229 human
prompts, and 213 git commits are archived in the repository. We report detailed lessons on AI failure modes – hypothesis creep, definition-
alignment bugs,
agent avoidance behaviors – and on what worked: the abstract/concrete proof split,
adversarial self-review, and the critical role of human review of key definitions and
theorem statements. Notably, the formalization was completed before the final draft of the corresponding math paper was finished.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.LG
Discovery of interaction and diffusion kernels in particle-to-mean-field multi-agent systems
Giacomo Albi, Alessandro Alla and Elisa Calzola
We propose a data-driven framework to learn interaction kernels in
stochastic multi-
agent systems. Our approach aims at identifying the functional form of nonlocal interaction and
diffusion terms directly from trajectory data, without any a priori knowledge of the underlying interaction structure. Starting from a discrete
stochastic binary-interaction model, we formulate the inverse problem as a sequence of sparse regression tasks in structured finite-dimensional spaces spanned by compactly supported basis functions, such as piecewise linear
polynomials. In particular, we assume that pairwise interactions between
agents are not directly observed and that only limited trajectory data are available. To address these challenges, we propose two complementary identification strategies. The first based on random-batch sampling, which compensates for latent interactions while preserving the statistical structure of the full dynamics in expectation. The second based on a mean-field approximation, where the empirical particle density reconstructed from the data defines a continuous nonlocal regression problem. Numerical experiments demonstrate the effectiveness and robustness of the proposed framework, showing accurate reconstruction of both interaction and
diffusion kernels even from partially observed. The method is validated on
benchmark models, including bounded-confidence and attraction-repulsion dynamics, where the two proposed strategies achieve comparable levels of accuracy.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Adaptive Tube MPC: Beyond a Common Quadratically Stabilizing Feedback Gain
Anchita Dey and Shubhendu Bhasin
This paper proposes an adaptive tube framework for model predictive control (MPC) of discrete-time linear time-invariant systems subject to parametric uncertainty and additive disturbances. In contrast to conventional tube-based MPC schemes that employ fixed tube geometry and constraint tightening designed for worst-case uncertainty, the proposed approach incorporates online parameter learning to progressively refine the parametric uncertainty set and update the parameter estimates. These updates are used to adapt the components of the MPC optimization problem, including the prediction model, feedback gain, terminal set, and tube cross-sections. As the uncertainty set contracts, the required amount of constraint tightening reduces and the tube shrinks accordingly, yielding less conservative control actions. Recursive feasibility, robust constraint satisfaction, and closed-loop stability are formally established. Furthermore, the framework does not require the existence of a common quadratically stabilizing linear feedback gain for the entire parametric uncertainty set, thereby relaxing a standard assumption in existing tube-based MPC formulations. Numerical examples illustrate the effectiveness of the proposed approach.
Read the full abstract ▾
Optimization and Control
Parallel Newton methods for the continuous quadratic knapsack problem: A Jacobi and Gauss-Seidel tale
Leonardo D. Secchin and Paulo J. S. Silva
The continuous quadratic knapsack (CQK) problem involves minimizing a diagonal convex quadratic function subject to box constraints and a single linear equality constraint. It has numerous applications in resource allocation, multicommodity flow, machine learning, and classical optimization tasks such as Lagrangian relaxation and quasi-Newton updates. In this work, we revisit the semismooth Newton method introduced by Cominetti, Mascarenhas, and Silva. We demonstrate that the method can be significantly improved in two directions. First, for projections onto the simplex or the $\ell_1$-ball, it can incorporate Condat's highly effective initial multiplier guess. Second, it can serve as a flexible foundation for CQK
algorithms, allowing for different parallel variants tailored to exploit CPU and GPU computational models. These improvements are implemented in the open-source Julia package NewtonCQK.jl. We present extensive numerical tests comparing this implementation with other state-of-the-art solvers, demonstrating its superior efficiency and scalability.
Read the full abstract ▾
Analysis of PDEs
Extrapolation of solvability of the parabolic $L^p$ Neumann problem on bounded Lipschitz cylinders
Martin Dindoš and YingYi Liu
A recent result of the first author with Li and Pipher has established the extrapolation of solvability of the $L^p$
parabolic Neumann problem on unbounded graph domains of the form $\Omega=\{(x',x_n):\,x_n>\varphi(x')\}\times\mathbb R$, where $\varphi:\mathbb R^{n-1}\to\mathbb R$ is a Lipschitz function. The result shows that under the assumptions that the $L^p$
parabolic Neumann problem for the equation $Lu=-\partial_t u+\mbox{div}(A\nabla u)=0$ in $\Omega$ and also the $L^{p'}$
parabolic Dirichlet problem for the adjoint equation $L^*u=\partial_t u+\mbox{div}(A\nabla u)=0$ in $\Omega$ are solvable, then also the $L^q$
parabolic Neumann problem for the equation $Lu=0$ in $\Omega$ is solvable for all $1<q<p$. However the mentioned paper does not answer the question whether the same claim is also true for domains of the form $\mathcal O\times\mathbb R$, where $\mathcal O$ is a bounded Lipschitz domain (in spatial variables) since this case does not follow from our argument for the unbounded case. Indeed, the bounded Lipschitz cylinder case requires a significantly different approach which we present in this article and establish an analogous result when $\mathcal O$ is a bounded Lipschitz domain.
Read the full abstract ▾
Optimization and Control
An Adaptive Method for Optimal Control Problems Constrained by Parabolic Differential Equations
Alexander M. Davies, Sara Pollock, Miriam E. Dennis et al. (+1 more)
An adaptive direct collocation method is developed for solving optimal control problems constrained by
parabolic partial differential equations. The partial differential equation is first reformulated in a variational setting, where the spatial domain is discretized using the hp-Galerkin finite element method. To address nonlinearities in the variational form, a Kirchhoff-like integral transformation is applied to linearize the dynamics. In the temporal dimension, an orthogonal collocation scheme, the hp-flipped Legendre-Gauss-Radau method, is employed to fully discretize the problem, yielding a large, sparse nonlinear programming problem. Upon solving the nonlinear programming problem, solution accuracy is assessed through an implicit residual estimation procedure. This approach evaluates the local error by solving auxiliary residual problems over selected subdomains, providing a novel means of error estimation within an orthogonal collocation framework for optimal control. Based on the computed error estimate, the mesh is adaptively refined or coarsened to meet a prescribed error tolerance. Mesh refinement is guided by the estimated regularity of the solution which is determined via the decay rate of the coefficients of a Legendre
polynomial expansion. In overcollocated regions, a mesh reduction strategy is adapted from orthogonal collocation methods for application within the finite element framework. Numerical examples demonstrate that the proposed method can reduce the error by up to five orders of magnitude in both spatial and temporal dimensions.
Read the full abstract ▾
All authors Alexander M. Davies, Sara Pollock, Miriam E. Dennis, Anil V. Rao
Functional Analysis
On a theorem of M. Jodeit Jr. on pushforwards of Fourier multipliers
Patrick Poissel
A classical
theorem of M. Jodeit Jr. implies that if a compactly supported distribution on $\mathbf{R}^d$ is the symbol of an $L^p(\mathbf{R}^d)$-$L^q(\mathbf{R}^d)$
Fourier multiplier, then its pushforward by the canonical homomorphism from $\mathbf{R}^d$ to $\mathbf{T}^d$ is the symbol of an $\ell^p(\mathbf{Z}^d)$-$\ell^q(\mathbf{Z}^d)$
Fourier multiplier. In the present work, we generalise this result to the setting of locally compact groups, including those non-abelian, by characterising the continuous homomorphisms of locally compact groups by which, for every $p,q\in[1,\infty]$, the pushforward of a compactly supported distribution symbol of an $L^p$-$L^q$
Fourier multiplier is a symbol of the same type as those which are open. Motivated by a simple proof in the abelian case, we also investigate pushforwards of positive definite distributions.
Read the full abstract ▾
Number Theory
Galois groups of reciprocal polynomials II: Twisted reciprocal polynomials
Theresa C. Anderson and Evan M. O'Dorney
We study the Galois group $G_f$ of a random
polynomial $f$ of height at most $H$ in the family of
polynomials of degree $2n$ satisfying the twisted reciprocal relation $f(x) = x^{2n}/b^n \cdot f(b/x)$, which arise in a wide variety of applications. Our main result is a
theorem of van der Waerden-Bhargava type: the probability that $G_f$ is not the full hyperoctahedral group $S_2 \wr S_n$ is $\Theta(H^{-1}\log H)$, independent of $b$, with the leading-order group $G_1$ being of index $2$. This paper is a companion to a recent paper by the authors and Bertelli addressing reciprocal
polynomials (i.e. the case $b = 1$).
Read the full abstract ▾