Probability
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 25 February
We study the total variation distance (TV) between two $n$-fold Bernoulli product measures parametrized by $\vec p=(p_1,\ldots,p_n)$ and $\vec q=(q_1,\ldots,q_n)$, respectively, in the tiny and small regimes. In the tiny regime, we have $p_i,q_i\lesssim 1/n^2$, and in the small regime, $p_i,q_i\lesssim 1/n$. We discover that in the tiny regime, the TV distance behaves as $\|\vec p-\vec q\|_1$, while in the small regime, it behaves as \[ \sum_{i=1}^n \Big| p_i\prod_{j\neq i}(1-p_j) - q_i\prod_{j\neq i}(1-q_j) \Big|, \] both up to absolute constants. Along the way we discover some identities of possible independent interest.
Functional Analysis
Compactness of averaging operators on non-reflexive Lebesgue spaces
Let $X$ be a Borel and Borel-regular metric measure space whose closed balls are of positive and finite measure. In this paper, we shall give equivalent conditions for averaging operators on non-reflexive Lebesgue spaces $L^1(X)$ and $L^\infty(X)$ on X to be compact, where X has some doubling property and satisfies certain uniform continuity between metric and measure.
Read the full abstract
Group Theory
On subgroup growth of iterated wreath products in product action
We show that there are hereditarily just infinite groups of any subgroup growth type between $n$ and $n^{\log n}$. This is obtained calculating the subgroup growth type of a family of hereditarily just infinite profinite groups obtained via iterated wreath products of finite permutation groups with respect to product actions.
Read the full abstract
Differential Geometry
Llarull type theorems for bands in Three and Four dimensions
Llarull's theorem asserts that the scalar curvature and the metric on the $n$-sphere cannot be bounded below at the same time by those of the standard $n$-sphere. Using the warped $\mu$-bubble method, we develop Llarull type theorems for three and four-dimensional bands with spectral scalar curvature bounds.
Read the full abstract
Probability
On large deviations for the range of a two-dimensional random walk
In this note, we compute the probability that a two-dimensional symmetric random walk visits more vertices than expected, for deviations on scales between the mean behavior and linear growth.
Mathematical Physics · Cross-listed from quant-ph
Imperfect Graphs from Unitary Matrices – I
Matrix representations of quantum operators are computationally complete but often obscure the structural topology of information flow within a quantum circuit \cite{nielsen2000}. In this paper, we introduce a generalized graph-theoretic framework for analyzing quantum operators by mapping unitary matrices to directed graphs; we term these structures Imperfect Graphs or more formally as Topological Structure of Superpositions(TSS) as a tool to devise better Quantum Algorithms. In this framework, we represent computational basis states as vertices. A directed edge exists between two vertices if and only if there is a non-zero amplitude transition between them, effectively mapping the support of the unitary operator. In this paper we deliberately discard probability amplitudes and phase information to isolate the connectivity and reachability properties of the operator. We demonstrate how TSS intuitively helps describe gates such as the Hadamard, Pauli-(X,Y,Z) gates, etc \cite{nielsen2000}. This framework provides a novel perspective for viewing quantum circuits as discrete dynamical systems \cite{childs2009,aharonov2001} Keywords: Quantum Algorithms, Unitary Matrix Approach, Topological Structure of Superpositions (TSS), Graph Theory
Read the full abstract
Representation Theory
Harish-Chandra D-modules for bi-Whittaker reduction
Let $D(G)$ be the algebra of algebraic differential operators on a complex reductive group $G$. Denote by $\mathbb{W}$ the bi-Whittaker quantum Hamiltonian reduction of $D(G)$, also known as the quantum Toda lattice. In this article we define the admissible $\mathbb{W}$-modules and the special case of Harish-Chandra modules, the latter being bi-Whittaker variants of the invariant holonomic systems of Hotta-Kashiwara. We then study their torsion properties up to completion relative to the Kazhdan filtration, which in general is unbounded in both directions, through the geometry of universal centralizer. In the case of regular infinitesimal characters, the corresponding $D(G)$-module is shown to be the minimal extension of an irregular connection on the open Bruhat cell. Certain ring-theoretic properties of the completion of $\mathbb{W}$ are also obtained.
Read the full abstract
Analysis of PDEs
Large-Norm Solutions and the Relaxation-Time Limit for Quantum Hydrodynamics on the Two-Dimensional Torus
This paper extends to the two-dimensional torus our previous analysis \cite{AMZ3} of weak solutions with large norms for the collisional quantum hydrodynamic (QHD) system in semiconductor modeling. We first establish the global well-posedness of weak solutions with strictly positive density within the functional framework of generalized chemical potential (GCP) solutions introduced in \cite{AMZ1}. Two key ingredients of the analysis are a logarithmic Sobolev-type inequality controlling oscillations of the density and a functional combining a higher-order energy with the physical entropy. This combined functional yields a coercive dissipation mechanism that allows us to establish stability and exponential convergence for solutions with large initial data. As a byproduct of our approach, we also prove the global existence of $H^2$ solutions for a nonlinear Schrödinger–Langevin equation. Finally, for GCP solutions with strictly positive density, we justify the relaxation-time limit and provide an explicit convergence rate. Our analysis relies on compactness techniques that do not require the existence or smoothness of solutions to the limiting system. Moreover, our results impose no well-preparedness assumptions on the initial data, thereby accommodating the possible formation of an initial layer.
Read the full abstract
Algebraic Geometry
Non-commutative crepant resolutions for (almost) simplicial toric algebras
Given a rational convex polyhedral Gorenstein cone constructed as cone over a lattice polytope P, we establish that toric non-commutative crepant resolutions (NCCRs) of its associated toric algebra descend to toric NCCRs of the algebras associated to faces of the polytope P. As consequence, we present two new, short proofs to the existence of toric NCCRs for simplicial affine toric Gorenstein algebras and for almost simplicial affine toric Gorenstein algebras, i.e. those associated to cones $\sigma$ with $\dim\sigma+1$ extremal rays.
Read the full abstract
Algebraic Geometry
Neural Learning of Fast Matrix Multiplication Algorithms: A StrassenNet Approach
Fast matrix multiplication can be described as searching for low-rank decompositions of the matrix–multiplication tensor. We design a neural architecture, StrassenNet, which reproduces the Strassen algorithm for $2\times 2$ multiplication. Across many independent runs the network always converges to a rank-$7$ tensor, thus numerically recovering Strassen's optimal algorithm. We then train the same architecture on $3\times 3$ multiplication with rank $r\in\{19,\dots,23\}$. Our experiments reveal a clear numerical threshold: models with $r=23$ attain significantly lower validation error than those with $r\le 22$, suggesting that $r=23$ could actually be the smallest effective rank of the matrix multiplication tensor $3\times 3$. We also sketch an extension of the method to border-rank decompositions via an $\varepsilon$–parametrisation and report preliminary results consistent with the known bounds for the border rank of the $3\times 3$ matrix–multiplication tensor.
Read the full abstract
Combinatorics
The average order of a connected vertex set in $K_m \times P_n$
Let $G$ be a connected graph. Let $N(G)$ and $S(G)$ be the number of connected sets of $G$ and the sum of the orders of these connected sets of $G$, respectively. Then $A(G)=\frac{S(G)}{N(G)}$ is called the average order of a connected set of $G$. In this paper, we derive a closed-form formula for $A(K_m \times P_n)$, where $K_m \times P_n$ is the Cartesian product of the complete graph $K_m$ and the path $P_n$.
Read the full abstract
Mathematical Physics · Cross-listed from q-bio.BM
Spectral analysis of protein backbone geometry reveals abrupt helix–coil boundaries
The boundaries of cooperative helix–coil transitions influence protein allostery and conformational dynamics, yet the persistent one-to-two-residue ambiguity in their assignment remains poorly characterized. We apply the discrete Hasimoto map to translate three-dimensional C$_\alpha$ backbone geometry into a one-dimensional discrete nonlinear Schrödinger effective potential and analyze its spatial-frequency structure. Helical segments appear as near-integrable, low-entropy states whose spectral power concentrates at the zero-frequency mode, whereas coil regions show broadband fluctuations. A pointwise integrability residual and a windowed spectral entropy separate the two phases with ROC AUC values of 0.783 and 0.715, and their combination reaches 0.803, while combining the residual instead with a low-frequency energy ratio reaches 0.815. Across 1\,986 proteins and 19\,148 of 21\,107 fitted helix–coil boundaries the transition is abrupt, with a median sigmoid width of 0.145 residues that measures the steepness of a single-step discrete jump rather than a literal sub-residue distance; the transition is directionally asymmetric, with helix exits sharper than entries. Across the full dataset every C$_\alpha$ geometry-based assignment, including DSSP-calibrated P-SEA and both spectral probes, loses agreement with the DSSP hydrogen-bond reference most acutely at these boundaries, indicating that the assignment ambiguity is a general feature of C$_\alpha$ geometry rather than any single algorithm. The windowed spectral probe is subject to a Gabor resolution limit and is therefore outperformed by the pointwise probe, which attains the lattice-limited resolution.
Read the full abstract
Differential Geometry
Quadric surfaces of revolution in the 3-sphere as cubic Weingarten surfaces
The study of quadric surfaces of revolution is a cornerstone of classical Euclidean geometry, but its extension to the three-dimensional sphere $\mathbb{S}^3$ has not been sufficiently explored. This article addresses this important gap by providing a rigorous classification and characterization of non-degenerate quadric surfaces of revolution in $\mathbb{S}^3$, namely spherical ellipsoids, hyperboloids and paraboloids, generated by the rotation of spherical conics around a geodesic axis containing their foci or is orthogonal to them. Using the concept of spherical angular momentum as a prominent geometric invariant, we discover that these surfaces constitute a remarkable class of Weingarten surfaces and prove that they are uniquely characterised by a specific cubic functional relation between their principal curvatures. This result not only provides a unified description of spherical quadric surfaces of revolution, but also highlights a profound geometric universality, reflecting exactly the same cubic Weingarten relations observed in their Euclidean and Lorentzian counterparts.
Read the full abstract
Mathematical Physics
Physico-mathematical model of open quantum systems with varying particle number
We derive the effective Hamiltonian $H - \mu N$ for open quantum systems with varying particle number from first principles. Our derivation relies on the general postulates of quantum statistical mechanics and on some specific assumptions regarding the size of the open system and the range of the interaction with the reservoir. Within this model, we also show that the effective Hamiltonian is unique up to a constant. In the course of our argument, we establish a rigorous version of the surface-to-volume ratio approximation, which is routinely used in an empirical form in statistical physics, and we show that the Hilbert space for systems with varying particle number must be isomorphic to Fock space. Together, these findings establish a solid physico-mathematical model for open quantum systems with varying particle number.
Read the full abstract
Probability
True self-repelling motion above a general barrier
The true self-repelling motion is a continuous-time random process which was introduced by Tóth and Werner in 1998 to be a limit for the "true" self-avoiding random walk defined by Tóth in 1995. The construction of the true self-repelling motion involves an uncountable system of coalescing Brownian motions starting from all points of the upper half-plane, related to the Brownian web, but reflected and absorbed on a "barrier" which is the abscissa axis. In this work, we consider much more general barriers, construct an uncountable system of coalescing Brownian motions reflected and absorbed on these barriers, and the true self-repelling motion associated to it. The extension of the proofs of Tóth and Werner to this more general case is surprisingly difficult, especially when the barrier is irregular.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Learning-Based Geometric Leader-Follower Control for Cooperative Rigid-Payload Transport with Aerial Manipulators
This paper presents a learning-based tracking control framework for cooperative transport of a rigid payload by multiple aerial manipulators under rigid grasp constraints. A unified geometric model is developed, yielding a coupled agent–payload differential–algebraic system that explicitly captures contact wrenches, payload dynamics, and internal force redundancy. A leader–follower architecture is adopted in which a designated leader generates a desired payload wrench based on geometric tracking errors, while the remaining agents realize this wrench through constraint-consistent force allocation. Unknown disturbances and modeling uncertainties are compensated using Gaussian Process (GP) regression. High-probability bounds on the learning error are explicitly incorporated into the control design, combining GP feedforward compensation with geometric feedback. Lyapunov analysis establishes uniform ultimate boundedness of the payload tracking errors with high probability, with an ultimate bound that scales with the GP predictive uncertainty.
Read the full abstract
Numerical Analysis
Kernel Methods for the Construction of Certified Lyapunov Functions via Approximate Koopman Eigenfunctions
We present a kernel-based methodology for constructing Lyapunov functions for nonlinear dynamical systems using approximate Koopman eigenfunctions. Our approach decomposes principal Koopman eigenfunctions into linear and nonlinear components, where the linear part is obtained from the system's linearization and the nonlinear part is computed by solving a partial differential equation using symmetric kernel collocation in reproducing kernel Hilbert spaces (RKHS). The resulting Lyapunov function is constructed as a quadratic form in the approximate eigenfunctions. We establish error bounds relating the approximation quality to the fill distance of collocation points and provide a certification procedure using continuous piecewise affine (CPA) methods. Numerical experiments on benchmark systems, including a polynomial system and the Duffing oscillator, demonstrate the effectiveness of our approach.
Read the full abstract
Statistics Theory
Estimation of the Self-similarity Index of Non-stationary Increments Self-similar Processes via Lamperti Transformations
We introduce a novel method for estimating the self-similarity index of a general $H$-self-similar process with either stationary or non-stationary increments. The estimation algorithm is developed based on a modified Lamperti transformation, which transforms $H$-self-similar processes to stationary ones. As an application, we show how to use this approach to estimate the self-similarity index of fractional Brownian motion, subfractional Brownian motion, bifractional Brownian motion, and trifractional Brownian motion. Simulation study is performed to support the consistency of our estimators. Implementation in Python is publicly shared. Application on the estimation of the self-similarity index of the Nile river water level data from the year 900 to 1200 C.E..
Read the full abstract
Optimization and Control
Survey on Neural Routing Solvers
Neural routing solvers (NRSs) that leverage deep learning to tackle vehicle routing problems have demonstrated notable potential for practical applications. By learning implicit heuristic rules from data, NRSs replace the handcrafted counterparts in classic heuristic frameworks, thereby reducing reliance on costly manual design and trial-and-error adjustments. This survey makes two main contributions: (1) The heuristic nature of NRSs is highlighted, and existing NRSs are reviewed from the perspective of heuristics. A hierarchical taxonomy based on heuristic principles is further introduced. (2) A generalization-focused evaluation pipeline is proposed to address limitations of the conventional pipeline. Comparative benchmarking of representative NRSs across both pipelines uncovers a series of previously unreported gaps in current research.
Read the full abstract
Symplectic Geometry
Density of fibers for the filtered Fukaya category of $T^*N$
We answer a question of Biran and Cornea about the density of iterated cones of fibers in the Fukaya category of a cotangent bundle. We prove that indeed if we take a dense set of basepoints, the iterated cones of the cotangent fibres are dense in the Filtered Fukaya category. In an appendix we prove that the space of exact Lagrangians in a symplectic manifold is never totally bounded for the spectral distance (unless it is empty). This was implicit in \cite{MCA-VH-CV} for $n=1$ and proved for cotangent bundles of negatively curved manifolds in \cite{A-B-C}.
Read the full abstract
Numerical Analysis
A dual lumping procedure for static condensation in mixed NURBS-based isogeometric elements with optimal convergence rates for arbitrary open knot vectors
Locking is a common effect in finite element and isogeometric analysis. In the case of plates, transverse shear locking is most prominent, for shells several other types of locking exist. A common cure are mixed methods that introduce additional fields of unknowns into the variational formulation. These fields reduce constraints and thus alleviate locking significantly. As a drawback, the discretized additional fields increase computational costs significantly. These fields are often eliminated by static condensation, which requires the inverse of a part of the stiffness matrix. In Lagrange-based finite elements, this inverse is computed on element level, due to a discontinuous interpolation of additional fields. Since isogeometric analysis features higher continuity, static condensation must be performed on patch level, which requires a costly matrix inversion on that level. In this contribution, the virtual shear parameters of a mixed isogeometric plate formulation are interpolated by enhanced approximate dual basis functions. This allows to conduct row-sum lumping of the relevant matrix part at a minimal loss of accuracy, since this part becomes diagonal dominant. For a properly chosen integration space, this lumped matrix becomes the identity matrix. Thus, the proposed condensation procedure does not require an inversion anymore. The crucial and novel point is the proposed treatment of knot vectors with limited internal continuity. With the help of several single- and multi-patch examples, both with full and with limited internal continuity, we show that the proposed procedure obtains optimal error convergence rates in all cases, while without these alterations, convergence rates are significantly deteriorated.
Read the full abstract
Algebraic Topology
Cohomology of symplectic $T^n$ - reductions and compactifications of $\mathcal{M}_{0, n}$
A symplectic $T^n$ - reduction on a complex Grassmann manifold $G_{n,2}$ for the canonical action of the maximal compact torus depends on the $S_n$ - orbit of a maximal chamber in a hypersimplex $\Delta _{n,2}$. The chamber decomposition of $\Delta _{n,2}$ is defined by the admissible polytopes, which can be realized as matroids. In our previous work we described this chamber decomposition by means of the hyperplane arrangement. It is important to note that to any chamber it corresponds the compact space, which is a smooth compact manifold for a chamber of maximal dimension. In this paper we obtain explicit description of the cohomology rings of the symplectic $T^n$ - reductions on $G_{n,2}$ for the standard moment map in terms of the chamber decomposition of $\Delta _{n,2}$ and the well known results of Kirwan and Goldin. We recently introduced the Hassett category whose objects are special compactifications of the space $\mathcal{M}_{0, n}$. The initial object in this category is the Deligne-Mumford compactification $\overline{\mathcal{M}}_{0, n}$. In this paper we describe the cohomology rings of various compactifications for $\mathcal{M}_{0, n}$, which correspond to the objects of the Hassett category. Our results show that even in the case $n=5$ there are objects in the Hassett category with different cohomology rings.
Read the full abstract
Number Theory
Prime-Weighted Interference Patterns Inspired by the Euler Product
We study a prime-weighted oscillatory model inspired by structural aspects of the Euler product of the Riemann zeta function. The model defines finite superpositions of prime-frequency modes and exhibits zero-like crossings produced by destructive interference. We analyze how the weight exponent $x$ controls amplitude growth, slope scaling, and stability of crossings. A heuristic asymptotic argument identifies $x=\tfrac12$ as a distinguished balance regime separating high-energy and over-damped behavior. The results concern the defined model itself.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
Adaptive Penalized Doubly Robust Regression for Longitudinal Data
Longitudinal data often involve heterogeneity, sparse signals, and contamination from response outliers or high-leverage observations especially in biomedical science. Existing methods usually address only part of this problem, either emphasizing penalized mixed effects modeling without robustness or robust mixed effects estimation without high-dimensional variable selection. We propose a doubly adaptive robust regression (DAR-R) framework for longitudinal linear mixed effects models. It combines a robust pilot fit, doubly adaptive observation weights for residual outliers and leverage points, and folded concave penalization for fixed effect selection, together with weighted updates of random effects and variance components. We develop an iterative reweighting algorithm and establish estimation and prediction error bounds, support recovery consistency, and oracle-type asymptotic normality. Simulations show that DAR-R improves estimation accuracy, false-positive control, and covariance estimation under both vertical outliers and bad leverage contamination. In the TADPOLE/ADNI Alzheimer's disease application, DAR-R achieves accurate and stable prediction of ADAS13 while selecting clinically meaningful predictors with strong resampling stability.
Read the full abstract
Algebraic Geometry
An Effective Criterion for Covering Maps Between Real Varieties
We prove that a quasi-finite flat morphism with locally constant geometric-fiber cardinality between varieties over a real closed field induces a covering map on the rational points. The algebraic core of the criterion is a characteristic-zero result showing that every such morphism becomes finite étale after reduction. Since reduction does not change rational points, the induced map is a covering in the Euclidean topology. We extend the covering conclusion to Boolean combinations of closed subschemes and their complements, and construct a finite stratification separating finite covering families from families with positive-dimensional fibers. Finally, we compute the canonical non-finite, non-finite-flat, and non-finite-étale loci, using Gröbner bases. This yields effective tests for the hypotheses of the covering criterion. We conclude with applications illustrating these constructions.
Read the full abstract
Optimization and Control · Cross-listed from eess.IV
Learning spatially adaptive sparsity level maps for arbitrary convolutional dictionaries
State-of-the-art learned reconstruction methods often rely on black-box modules that, despite their strong performance, raise questions about their interpretability and robustness. Here, we build on a recently proposed image reconstruction method, which is based on embedding data-driven information into a model-based convolutional dictionary regularization via neural network-inferred spatially adaptive sparsity level maps. By means of improved network design and dedicated training strategies, we extend the method to achieve filter-permutation invariance as well as the possibility to change the convolutional dictionary at inference time. We apply our method to low-field MRI and compare it to several other recent deep learning-based methods, also on in vivo data, where the benefit of using a different dictionary is demonstrated. We further assess the method's robustness when tested on in- and out-of-distribution data. When tested on the latter, the proposed method suffers less from the data distribution shift compared to the other learned methods, which we attribute to its reduced reliance on training data due to its underlying model-based reconstruction component.
Read the full abstract
Group Theory
Chirality and Racemization on Isotopy Classes of Loops: A Groupoid-Based Structural Theory
We develop a theory of chirality and racemization on isotopy classes of finite loops, formulated intrinsically within the loop isotopy groupoid understood in the categorical sense. Motivated by earlier work on quasigroups \cite{InoueQuasiChirality} and by the classical medical paradigm of mirror-related enantiomers, we restrict admissible mirror transitions to those generated by intrinsic, unit-preserving symmetries. Within this framework, racemization is modeled as a two-state dynamics on isotopy classes, with an effective rate determined by the presence of mirror-isotopisms. Our main result shows that this rate vanishes if and only if no loop isotopism exists between a loop and its opposite, providing a structural criterion for chirality. A strengthened variant based on translation-generated symmetries is discussed in the appendix.
Read the full abstract
Combinatorics
Perpetually Fair Assignments Via Balanced Sequences of Permutations
There is a set of $n$ indivisible items (goods or chores), and a set of $n$ players. Each day, a single item should be assigned to each player. Assignments based on latin squares guarantee fairness after every $n$ days; our goal is to ensure fairness after every single day. We present two 'balance' conditions on latin squares. Informally, a latin square is balanced if its top rows and leftmost columns contain all $n$ labels; this ensures that all $n$ players receive one of the top items in one of the early days. One such condition can always be satisfied, but is arguably too weak; a second condition is strong, and can be satisfied for all $n\leq 12$, but cannot be satisfied for some larger values of $n$, including all $n>108$. We show that the second balance condition guarantees that the cumulative assignment is always proportional up to one item (PROP1), where proportionality holds in a strong ordinal sense – for every valuations that are consistent with the item ranking. Finally, we present a weaker balance condition on a sequence, that guarantees ordinal proportionality up to two items (PROP2). Whether or not this condition can be satisfied for all $n$ remains an open question.
Read the full abstract
Numerical Analysis
Adaptive isogeometric analysis of high-order phase-field fracture based on THB-splines
In recent decades, the study of fracture propagation in solids has increasingly relied on phase-field models. Several recent contributions have highlighted the potential of this approach in both static and dynamic frameworks. However, a major limitation remains the high computational cost. Two main strategies have been identified to mitigate this issue: the use of locally refined meshes and the adoption of higher-order models. In this work, leveraging Truncated Hierarchical B-splines (THB-splines), we introduce adaptive simulations of higher-order phase-field formulations (AT1 and AT2), focusing primarily on two-dimensional fracture problems.
Read the full abstract
Probability
Phase transitions in the charged compact abelian lattice Higgs model
We consider the (compact) abelian lattice Higgs model with charge \( k \geq 1 \) and show, using charged Wilson~loop observables and charged versions of the Marcu–Fredenhagen ratio, that this model exhibits several distinct phase transitions. In particular, we show that if \(k = 2\), then the Marcu–Fredenhagen ratio and Wilson~loop observables together can distinguish among three distinct phases of the parameter space, and hence both can be used as order parameters for the model.