Classical Analysis and ODEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 27 February
We study the Abel differential equation x0 = A(t)x3 + B(t)x2 +C(t)x. Specifically, we find bounds on the number of its rational solutions when A(t), B(t) and C(t) are polynomials with real or complex coefficients; and on the number of rational limit cycles when A(t), B(t) and C(t) are trigonometric polynomials with real coefficients.
Combinatorics
Note as to size-minimal hypercompletly separating systems
If $S$ is a non-empty finite set, $|S|=s$, then a system $\mathscr{A}$ of subsets of $S$ is a size-minimal hypercompletely separable system (i.e., for every $a\in S$ there are $A,B\in\mathscr{A}$ such that $A\cap B=\{a\}$) if and only if $|\mathscr{A}|=\left\lceil\frac{1+\sqrt{8s+1}}2\right\rceil$.
Read the full abstract
Optimization and Control
Towards Tsallis Fully Probabilistic Design
Fully Probabilistic design (FPD) is a powerful framework offering an elegant and unifying account of stochastic control, learning and decision-making. Here we introduce a generalized FPD framework, which we term as Tsallis FPD. Tsallis FPD uses Tsallis divergence in place of the Kullback-Leibler divergence that defines the standard FPD cost term. Tsallis divergence is a natural generalization of the KL divergence, rooted in non-extensive statistical mechanics and providing flexibility towards modeling stochastic processes with non-Gaussian tail behavior. After formulating Tsallis FPD, we present a double iteration scheme that performs a sequence of backwards inductions, rather than a single pass down the stages that constitutes the proven approach for classical FPD.
Read the full abstract
Optimization and Control
Stable and Renewable: Assessing the Reliability of a Fully Renewable European Energy System
The transformation of the energy system has raised concerns about the reliability of fully renewable energy systems. We address this question for a 2050 European energy system using an economically optimal adequacy assessment. Our results show that a cost-optimal, fully renewable European system can be as reliable as a fossil-based one, with an average loss of load of only 0.03% due to variability in renewable generation. Outages primarily affect industrial and service sectors, while household supply remains largely uninterrupted. Regional differences in supply security emerge, with outages concentrated in countries with a low Value of Lost Load (VoLL). We demonstrate that system reliability can be fully ensured at negligible additional cost (+0.17%) by modestly increasing hydrogen turbine (+10%) and battery capacities (+15%) beyond the cost-optimal levels. We conclude that well-designed renewable energy systems are stable, with hydrogen-based backup being a key enabler of reliability.
Read the full abstract
Combinatorics
The Equidistant Dimension of Corona Product Graphs
A subset $S$ of vertices, in a connected graph $G$, is called a distance-equalizer set if for every pair of distinct vertices outside $S$, there exists a vertex in $S$ equidistant to both. The equidistant dimension, denoted by $\xi(G)$, is defined as the minimum cardinality of such sets. While several distance-based parameters have been studied for different graph products, the equidistant dimension of corona product graphs has remained unexplored. In this paper, we investigate the equidistant dimension of the corona product $G \odot H$ of two graphs $G$ and $H$. We introduce the empty bisector graph $\widehat{G}$, an auxiliary construction that relates pairs of vertices in $G$ that cannot be equidistant from any third vertex. Using this framework, we establish tight bounds on the equidistant dimension of $G \odot H$ and derive exact values for several classical families of graphs. Moreover, we show that for any fixed base graph $G$, the equidistant dimension of $G \odot H$ depends on $H$ only through its order and eventually becomes linear in $\n(H)$.
Read the full abstract
Numerical Analysis
The $*$-algebra of unbounded GLT: construction and theoretical foundations
In the present paper, we are concerned with the study of matrix-sequences arising from the discretization of PDEs and FDEs on domains $\Omega \subset \mathbb{R}^d$ with finite measure. When $\Omega$ is either a hypercube or a bounded domain, the theory of Generalized Locally Toeplitz (GLT) sequences and of reduced GLT sequences cover the spectral analysis of the matrix-sequences derived from the approximation of the continuous problem. This work aims to extend the machinery and tools of the GLT apparatus to the case of unbounded domains with finite measure. For any unbounded domain $\Omega \subset \mathbb{R}^d$ with finite measure, we define a new class of sequences, which we call unbounded GLT, and study their spectral properties.
Read the full abstract
Combinatorics
Variants of Merge-Width and Applications
Merge-width is a recently introduced family of graph parameters that unifies treewidth, clique-width, twin-width, and generalised colouring numbers. We prove the equivalence of several alternative definitions of merge-width, thus demonstrating the robustness of the notion. Our characterisation via definable merge-width uses vertex orderings inspired by generalised colouring numbers from sparsity theory, and enables us to obtain the first non-trivial approximation algorithm for merge-width, running in time $n^{O(1)} \cdot 2^n$. We also obtain a new characterisation of bounded clique-width in terms of vertex orderings, and establish that graphs of bounded merge-width admit sparse quotients with bounded strong colouring numbers, are quasi-isometric to graphs of bounded expansion, and admit neighbourhood covers with constant overlap. We also discuss several other variants of merge-width and connections to adjacency labelling schemes.
Read the full abstract
Category Theory · Cross-listed from quant-ph
Supermaps on generalised theories
Categorical supermaps generalise higher-order quantum operations from finite-dimensional quantum theory to arbitrary circuit theories. In this paper, we establish the Yoneda lemma for categorical supermaps, which states that whenever a physical theory has a suitable notion of channel-state duality, then categorical supermaps on that theory can be concretely represented in terms of that duality. This lemma eliminates any guesswork or ambiguity when defining the appropriate notion of supermap for these theories. As a concrete application, we show that the categorical supermaps on Boxworld are in general characterised by a physically well-motivated weaking of the recently proposed NSWSE principle for higher-order processes on boxworld. Furthermore, via the same Yoneda lemma we put forward a stable definition for supermaps in real quantum theory.
Read the full abstract
Optimization and Control
HYCO: A Formalism for Hybrid-Cooperative PDE Modelling
We present Hybrid-Cooperative Learning (HYCO), a hybrid modeling framework that integrates physics-based and data-driven models through mutual regularization. Unlike traditional approaches that impose physical constraints directly on synthetic models, HYCO treats both components as co-trained agents nudged toward agreement. This cooperative scheme is naturally parallelizable and demonstrates robustness to sparse and noisy data. Numerical experiments on static and time-dependent benchmark problems show that HYCO can recover accurate solutions and model parameters under ill-posed conditions. The framework admits a game-theoretic interpretation as a Nash equilibrium problem, enabling alternating optimization. This paper is based on the extended preprint: arXiv:2509.14123 .
Read the full abstract
Optimization and Control
A Fast Heuristic for Stochastic Steiner Tree Problems
Network design under uncertainty arises in countless real-world settings and can be captured by the Stochastic Steiner Tree Problem (SSTP). Although there are a few approaches specifically tailored to this stochastic optimization problem, there are considerably more state-of-the-art heuristics for its deterministic variant, the Steiner Tree Problem (STP). In this work, we show how to leverage an existing STP heuristic in building a novel method for solving its stochastic variant, the SSTP. This approach is a powerful, yet simple and easy-to-implement way of solving this complex problem. We test our method using benchmark instances from the literature. Numerical results show considerably faster computation times compared to the state-of-the-art, with a gap of approximately 5%.
Read the full abstract
Optimization and Control
A distributed semismooth Newton based augmented Lagrangian method for distributed optimization
This paper proposes a novel distributed semismooth Newton based augmented Lagrangian method for solving a class of optimization problems over networks, where the global objective is defined as the sum of locally held cost functions, and communication is restricted to neighboring agents. Specifically, we employ the augmented Lagrangian method to solve an equivalently reformulated constrained version of the original problem. Each resulting subproblem is solved inexactly via a distributed semismooth Newton method. By fully leveraging the structure of the generalized Hessian, a distributed accelerated proximal gradient method is proposed to compute the Newton direction efficiently, eliminating the need to communicate with full Hessian matrices. Theoretical results are also obtained to guarantee the convergence of the proposed algorithm. Numerical experiments demonstrate the efficiency and superiority of our algorithm compared to state-of-the-art distributed algorithms.
Read the full abstract
Number Theory
Products of factorials which are products of factorials
In this note, we look at the diophantine equation $$ \prod_{i=1}^ta_i!=\prod_{j=1}^sn_i!, \quad n_1\geq \cdots \geq n_s\geq 2 \quad \textnormal{and}\quad n_1>a_1\geq a_2\geq\cdots \geq a_t\geq2. $$ \noindent Let $s<t$. Under the (explicit) abc conjecture, we show that it has only finitely many nontrivial solutions in a certain subset of $\mathbb{N}^{t+s}$ of positive asymptotic density.
Read the full abstract
Probability
An exactly solvable evaporation-deposition PCA with long-distance interactions
We consider a probabilistic cellular automaton (PCA) of evaporation-deposition on the one-dimensional lattice having $n$ sites with periodic boundary conditions, in which each site, during each epoch, can be in one of two states: $0$ and $1$. Fix a positive integer $m\geqslant 2$. There are two types of transitions at each discrete time, which are as follows: (i) the first site in every contiguous block of $m$ $0$s becomes a $1$ with probability $p_1$, and (ii) the first site in every contiguous block of $(m-1)$ $0$s followed immediately by a $1$ also becomes a $1$ with probability $(1-p_2)$. As in a PCA, all of these transitions occur simultaneously. We show that the resulting discrete-time Markov chain is ergodic, and we give an explicit formula for its limiting distribution, the partition function and the density. We also propose necessary and sufficient conditions for this Markov chain to be reversible. For $m=2$, we provide a fully analytical expression for the free energy of this model.
Read the full abstract
Information Theory
Antenna Coding Optimization for Pixel Antenna Empowered Wireless Communication Using Deep Learning with Heterogeneous Multi-Head Selection
Pixel antenna is a promising antenna technology that enables flexible adjustment of radiation characteristics and enhancement of wireless systems through antenna coding. This work proposes a novel deep learning-based antenna coding optimization algorithm. Specifically, the proposed algorithm is supported by a heterogeneous multi-head selection mechanism, whose main idea is to train multiple neural networks based on various coding schemes and select the one that leads to the best system performance. Unlike traditional heuristic searching-based algorithms that require high computational complexity to achieve satisfactory performance, the proposed data-driven deep learning approach can achieve 98% of the performance achieved by the searching-based algorithms with significantly reduced computational complexity. Results demonstrate that in pixel antenna empowered single-input single-output systems, the proposed algorithm achieves a computational speed 81 times faster than the searching-based algorithm. For more complex pixel antenna empowered multiple-input multiple-output systems, the computational speed is 297 times faster than the existing searching-based algorithm. Benefiting from the high performance and low computational complexity, this algorithm demonstrates the significant potential of pixel antennas as a novel and practical technology to enhance wireless systems.
Read the full abstract
Optimization and Control
A Flow-based Method for Problems with Vanishing Constraints
Mathematical Programs with Vanishing Constraints (MPVCs) are a notoriously challenging class of problems owing to their lack of constraint qualification. Therefore, to tackle these problems, relaxation-based approaches are typically used. While often yielding satisfactory results, they generally require significant manual tuning and adjustment of the relaxation parameter. To circumvent these problems, we introduce a novel approach based on piecewise gradient flows leading to first-order stationary points. We demonstrate the effectiveness of our method on several real-world MPVC instances and compare it to a common relaxation approach.
Read the full abstract
Combinatorics
Local Equivalence Classes of Distance-Hereditary Graphs using Split Decompositions
Local complement is a graph operation formalized by Bouchet which replaces the neighborhood of a chosen vertex with its edge-complement. This operation induces an equivalence relation on graphs; determining the size of the resulting equivalence classes is a challenging problem in general. Bouchet obtained formulas only for paths and cycles, and brute-force methods are limited to very small graphs. In this work, we extend these results by deriving explicit formulas for several broad families of distance-hereditary graphs, including complete multipartite graphs, clique-stars, and repeater graphs. Our approach uses a technique known as split decomposition to establish upper bounds on equivalence class sizes, and we prove these bounds are tight through a combinatorial enumeration of the graphs' decomposed structure up to symmetry.
Read the full abstract
Group Theory
Parabolic subgroups and word problem in virtual Artin groups
We begin by establishing two fundamental results on standard parabolic subgroups of virtual Artin groups. We first show that a standard parabolic subgroup is naturally isomorphic to a virtual Artin group. Second, we prove that the intersection of two standard parabolic subgroups is a standard parabolic subgroup. Our main result is that, if all free of infinity standard parabolic subgroups of a given virtual Artin group VA[{\Gamma}] have a solvable word problem, then VA[{\Gamma}] itself has a solvable word problem. It follows that virtual Artin groups of FC type and, more generally, of affine-FC type, have a solvable word problem. We also prove that, if a virtual Artin group VA[{\Gamma}] has a solvable word problem, then the strong membership problem for any standard parabolic subgroup in VA[{\Gamma}] is solvable.
Read the full abstract
Analysis of PDEs
Asymptotic behavior and spectral distortion for biharmonic Steklov problems on thin domains
In this paper, we investigate the asymptotic behavior of the eigenvalues and eigenfunctions of a biharmonic Steklov problem defined on a thin domain in the $n$ dimensional Euclidean space degenerating to a segment. For $n=2$ the problem models the vibrations of a thin elastic plate with cross section represented by the given domain and mass concentrated on a free boundary. The problem under consideration depends on a parameter $\sigma$ that in the theory of elastic plates represents the Poisson ratio of the material. Our analysis points out a distortion in the limiting problem depending on $\sigma$ and the space dimension $n$.
Read the full abstract
Number Theory
On $p$-adic integral moduli schemes and local models for PEL type D
We construct flat integral moduli schemes of PEL type D and the corresponding flat orthogonal Rapoport–Zink spaces with parahoric level structure over a $p$-adic integer ring. The construction relies on proving a conjecture of Pappas–Rapoport: for an even orthogonal similitude group over a complete discretely valued field of residue characteristic $p>2$, and for arbitrary parahoric level, the associated spin local model is flat, normal, Cohen–Macaulay, with reduced special fiber. In the course of the proof, we also show that in the quasi-split but non-split case, the Rapoport–Zink (naive) local model is topologically flat, verifying a conjecture of Pappas–Rapoport–Smithling. In the maximal parahoric case, we also describe the Schubert varieties in the special fiber in moduli-theoretic terms. Finally, for a maximal parahoric case we construct an explicit regular semi-stable model by blowing up the spin local model along the unique closed Schubert cell in its special fiber.
Read the full abstract
Combinatorics
Colour diversity in spanning structures under Dirac-type conditions
Finding spanning structures with many distinct colours in properly edge-coloured graphs is a central theme in extremal combinatorics. A classical result of Andersen shows that every proper edge-colouring of the complete graph $K_n$ contains a Hamilton cycle with $n - O(n^{1/2})$ distinct colours. In the bipartite setting, the analogous question for perfect matchings is closely related to permutations in Latin squares. In this paper, we investigate how a Dirac-type minimum degree condition forces colour diversity in spanning structures. For every constant $1/2 < c \le 1$, we prove the following. $\bullet$ Every properly edge-coloured graph $G$ on $n$ vertices with $\delta(G)\ge cn$ contains a Hamilton cycle with at least $cn - O(n^{1/2})$ distinct colours. $\bullet$ Every subset of an $n\times n$ Latin square with at least $cn$ cells in each row and each column contains a permutation with at least $cn - O(n^{2/3})$ distinct symbols. Both bounds are best possible up to the error term.
Read the full abstract
Logic
Some aspects of topological dynamics of Polish groups (with an introduction to descriptive set theory)
The first part of these notes give an introduction to the theory of Polish group actions on compact Hausdorff spaces, leading up to a proof of the Kechris-Pestov-Todorcevic correspondence and discussions of properties of universal minimal flows. The second part proveides some background on descriptive set theory and culminates with B. Miller's proof of the $\mathcal{G}_0$-dichotomy theorem due to Kechris, Solecki, and Todorcevic.
Read the full abstract
Functional Analysis
Integral representations of projective norm-attaining tensors
We introduce a Bochner integral approach to projective norm attainment in tensor products of Banach spaces by defining the class of integral projective norm-attaining tensors. This framework provides a broader, measure-theoretic approach to the study of projective norm attainment in tensor products of Banach spaces. We show that every integral norm-attaining tensor can be approximated in norm by norm-attaining tensors with finite representations. As a consequence, the Bishop-Phelps type density problem for classical norm-attaining tensors is equivalent to the corresponding density problem for integral norm-attaining tensors. Moreover, we prove that if an integral projective norm-attaining tensor represented by a Radon measure is an extreme point, then it must be an elementary tensor. We further investigate weaker topological versions of integral norm-attainment, including weak and weak$^*$ integral representations, providing sufficient conditions for the existence of Bochner representations. Finally, we extend known constructions of projective tensor products containing non-norm-attaining tensors to the integral setting. We show, for instance, that $L_1\widehat{\otimes}_\pi L_p$ and the real $c_0\widehat{\otimes}_\pi L_p$ contain non-norm-attaining tensors for $1<p<\infty$.
Read the full abstract
Functional Analysis · Cross-listed from eess.SP
Exact Deconvolution for Schwartz Kernels: From Polynomial Automorphisms to Recursive Inversion in Tempered Distributions
In this work, we construct an explicit, theoretically rigorous deconvolution method that relies entirely on iterative forward convolutions, thus can be numerically implemented. We first prove that convolution with an even Schwartz kernel acts as an automorphism on the vector space of finite-degree polynomials. Exploiting the parity of the kernel, we derive an exact algebraic inverse for this space, expressed uniquely as a finite linear combination of repeated convolutions. The core contribution of this work extends this algebraic inversion to infinite-dimensional function spaces, including $L^1(\mathbb{R})$, $L^2(\mathbb{R})$, the Schwartz space $\mathscr{S}(\mathbb{R})$, and the space of tempered distributions $\mathscr{S}'(\mathbb{R})$. By passing the finite-sum polynomial inversion formula to the limit, we demonstrate that an arbitrary function or distribution convolved with a Schwartz kernel can be exactly recovered in its respective topology. The resulting inverse is an explicitly computable limit of a sequence of linear combinations of recursive convolutions. As a primary application, this limit provides a fundamentally new, iterative numerical formula for the inverse of the Weierstrass Transform. By bypassing traditional numerically ill-posed inversion techniques, our method offers a mathematically exact and numerically robust algorithm for computational signal recovery.
Read the full abstract
Logic
The model theory of perfectoid fields [after Jahnke and Kartas]
This text was written to support a Bourbaki seminar given in January 2026 on the subject of the model theory of perfectoid fields, especially on the work of Jahnke and Kartas in their paper "Beyond the Fontaine-Wintenberger theorem", J. Amer. Math. Soc. 38 (4), pp. 997-1047, 2025.
Read the full abstract
Numerical Analysis
Iterative Refinement for a Subset of Eigenvectors of Symmetric Matrices via Matrix Multiplications
We develop an iterative refinement method that improves the accuracy of a user-chosen subset of $k$ eigenvectors ($k\ll n$) of an $n\times n$ real symmetric matrix. Using an orthogonal matrix represented in compact WY form, the method expresses the eigenvector error through a correction matrix that can be approximated efficiently from Rayleigh quotients and residuals. Unlike refinement methods for a single eigenpair or for a full eigenbasis, the proposed method refines only the selected $k$ eigenvectors using $\mathcal{O}(nk)$ additional storage, and its dominant work can be organized as matrix–matrix multiplications. Under an eigenvalue separation condition, the refinement converges linearly; we also provide a conservative sufficient condition. Practical variants of the separation condition (e.g., via shifting) enable targeting other extremal parts of the spectrum. For tightly clustered eigenvalues, we discuss limitations and show that preprocessing can restore convergence in a representative sparse example. Numerical experiments on dense test matrices and sparse matrices from the SuiteSparse Matrix Collection illustrate attainable accuracy and problem-dependent convergence.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
A new class of coherent states involving Fox-Wright functions and their generalization in the bicomplex framework
In this work, an extensive class of coherent states is introduced by taking the Fox Wright function as the normalization function. It is demonstrated that these states satisfy the key requirements of continuity, normalizability and resolution of unity. Furthermore, coherent states associated with the continuous spectrum are obtained through a discrete to continuous limiting procedure. Moreover, FW generalized multi parameter nu function is introduced and shown to act as the normalization function for the Fox Wright coherent states in the continuous spectrum. Later the Fox Wright function with bicomplex arguments has been introduced and its existence has been investigated. Bicomplex Fox Wright coherent states are also developed for the discrete spectrum based on this new function and their properties are analyzed. Subsequently, the results regarding Fox Wright coherent states are generalized to the bicomplex setting. In addition, a bicomplex FW generalized multi-parameter nu function is defined to demonstrate that it provides the normalization for these states in the continuous spectrum.
Read the full abstract
Analysis of PDEs
Concentration Phenomena of Normalized Solutions of Critical Biharmonic Equations with Combined Nonlinearities in $\mathbb{R}^{N}$
We prove the multiplicity and concentration of normalized solutions of critical biharmonic equations with combined nonlinearities in $\mathbb{R}^{N}$ \begin{equation*} \Delta^{2}u+V(\varepsilon x)u=\lambda u+\mu |u|^{q-2}u+|u|^{2^{**}-2}u \mbox{ in }\ \mathbb{R}^{N}, \quad \int_{\mathbb{R}^{N}}|u|^{2}dx=c^{2}, \end{equation*} where $\Delta^{2}$ is the biharmonic operator, $N\geq5$, $\mu,c>0$, $\varepsilon>0,$ $\lambda\in\mathbb{R}$, $q\in(2,2+\frac{8}{N}),$ and $2^{**}=\frac{2N}{N-4}$ is the Sobolev critical exponent. The potential $V$ is a bounded and continuous nonnegative function, satisfying some suitable global conditions. Using minimization techniques and a truncation argument, we show that the number of normalized solutions is not less than the number of global minimum points of $V$ when the parameter $\varepsilon$ is sufficiently small. To overcome the loss of compactness of the energy functional due to the critical growth, we apply the concentration-compactness principle. To the best of our knowledge, this study is the first contribution regarding the concentration and multiplicity properties of normalized solutions of critical biharmonic equations with combined nonlinearities in $\mathbb{R}^{N}$. To some extent, the main results included in this paper complement several recent contributions to the study of biharmonic equations with combined nonlinearities.
Read the full abstract
Combinatorics
The exact value of $c_1(K_{2,n})$
For a graph $G$, let $c_1(G)$ be the largest distortion necessary to embed any shortest-path metric on $G$ into $\ell_1$, and for any natural number $n,m\in\mathbb{N}$, denote $K_{n,m}$ as the complete bipartite graph. In this note, we caculate the value of $c_1(K_{2,n})$, more precisely we prove $c_1(K_{2,n})=\frac{3k-2}{2k-1}$ where $k=\lceil\frac{n}{2}\rceil$.
Read the full abstract
Information Theory
On the Uniqueness of Solutions in GPS Source Localization: Distance and Squared-Distance Minimization under Limited Measurements in Two and Three Dimensions
The source localization problem, fundamental to applications like GPS, is typically approached as a minimization problem in the presence of various types of noise. Ensuring the uniqueness of solutions in GPS technology is vital for the reliability and accuracy of applications, from everyday navigation to critical military operations. In this paper, we examine two key minimization problems: one focused on distance error and the other on squared distance error. We explore these problems in both three-dimensional space, the standard scenario, and in two-dimensional space as a simplified case. Furthermore, we discuss the number of possible source solutions when the number of measurements is fewer than three.
Read the full abstract
Optimization and Control
Direct Spectral Acceleration of First-Order Methods for Saddle Point Problems with Bilinear Coupling
We study convex-concave saddle point problems with bilinear coupling, covering linearly constrained convex optimization and more general nonsmooth or constrained models via a proximable term in the dual objective. In linearly convergent regimes, we characterize how spectral properties of the coupling matrix and objective conditioning jointly determine the attainable linear rates. We propose direct spectral acceleration for first-order primal–dual methods for a class of bilinear-coupled saddle point problems, including affinely constrained smooth strongly convex optimization and extensions with proximable dual terms. The resulting algorithms distinguish objective-dominated and coupling matrix-dominated regimes and attain optimal linear convergence without Chebyshev inner loops or double-loop designs. We further develop stochastic block-coordinate extensions in the affinely constrained case with separable objectives; we also establish optimal linear rates matching the block-coordinate lower bound. For both deterministic and stochastic methods, we provide matching worst-case lower bounds via explicit finite-dimensional hard instances.