Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 5 March

Probability

Local limits of uniform triangulations with boundaries in high genus

We study the local limits of uniform random triangulations with boundaries in the regime where the genus is proportional to the number of faces. Budzinski and Louf proved in 2020 that when there are no boundaries, the local limits exist and are the Planar Stochastic Hyperbolic Triangulation (PSHT) introduced in PSHT. We show that when the triangulations considered have size n and boundaries with total length p that tends to infinity with n and p=o(n), the local limits around a typical boundary edge are the half-plane hyperbolic triangulations defined by Angel and Ray. This provides, for the first time, a construction of these hyperbolic half-plane triangulations as local limits of large genus triangulations. We also prove that under the condition p = o(n), the local limit when rooted on a uniformly chosen oriented edge is given by the PSHT. Contrary to the proof of Budzinski and Louf, the latter does not rely on the Goulden-Jackson recurrence relation, but only on coarse combinatorial estimates. Thus, we expect that the proof can be adapted to local limits in similar models.
Read the full abstract

Combinatorics

Chromatic thresholds for linear equations and recurrence

Motivated by classical problems in extremal graph theory, we study a chromatic analogue of Roth-type questions for linear equations over $\mathbb F_p$. Given a homogeneous equation $\mathcal L:\sum_{i=1}^k c_i x_i=0$ with $k\ge 3$, we study $\mathcal L$-solution-free sets $A\subseteq \mathbb F_p$ through the chromatic number of the Cayley graph $\mathsf{Cay}(\mathbb F_p,A)$. We introduce the chromatic threshold $\delta_\chi(\mathcal L)$, the minimum density that guarantees bounded chromatic number of $\mathsf{Cay}(\mathbb F_p,A)$ among all $\mathcal L$-solution-free sets $A$, and determine exactly when $\delta_\chi(\mathcal L)=0$. We prove that $\delta_\chi(\mathcal L)=0$ if and only if $\mathcal L$ contains a zero-sum subcollection of at least three coefficients. A key ingredient is a quantitative chromatic lower bound for Cayley graphs on $\mathbb Z_p^n$ generated by Hamming balls around the all-ones vector. This is obtained by introducing a new Kneser-type graph that admits a natural embedding into $\mathbb Z_p^n$, together with an equivariant Borsuk–Ulam type argument. As a consequence, we resolve a question of Griesmer. We further relate our classification to the hierarchy of measurable, topological, and Bohr recurrence. In particular, we show that every infinite discrete abelian group admits a set that is topological recurrent but not measurable recurrent, extending the seminal examples of Kříž and Ruzsa.
Read the full abstract

All authors Hong Liu, Zhuo Wu, Ningyuan Yang, Shengtong Zhang

Information Theory · Cross-listed from quant-ph

Improved Decoding of Quantum Tanner Codes Using Generalized Check Nodes

We study the decoding problem for quantum Tanner codes and propose to exploit the underlying local code structure by grouping check nodes into more powerful generalized check nodes for enhanced iterative belief propagation (BP) decoding by decoding the generalized checks using a maximum a posteriori (MAP) decoder as part of the check node processing of each decoding iteration. We mainly study the finite-length setting and show that the proposed enhanced generalized BP decoder for quantum Tanner codes significantly outperforms the standard quaternary BP decoder with memory effects, as well as the recently proposed Relay-BP decoder, even outperforming generalized bicycle (GB) codes with comparable parameters in some cases. For other classes of quantum low-density parity-check (qLDPC) codes, we propose a greedy algorithm to combine checks for generalized BP decoding. However, for GB codes, bivariate bicycle codes, hypergraph product codes, and lifted-product codes, there seems to be limited gain by combining simple checks into more powerful ones. To back up our findings, we also provide a theoretical cycle analysis for the considered qLDPC codes. This leads us to a construction criterion for quantum Tanner codes that produces codes particularly well-suited for BP decoding.
Read the full abstract

Combinatorics · Cross-listed from cs.DS

Finding Short Paths on Simple Polytopes

We prove that computing a shortest monotone path to the optimum of a linear program over a simple polytope is NP-hard, thus resolving a 2022 open question of De Loera, Kafer, and Sanità. As a consequence, finding a shortest sequence of pivots to an optimal basis with the simplex method is NP-hard. In fact, we show this is NP-hard already for fractional knapsack polytopes. By applying an additional polyhedral construction, we show that computing the diameter of a simple polytope is NP-hard, resolving a 2003 open problem by Kaibel and Pfetsch. Finally, on the positive side we show that every polytope has a small, simple extended formulation for which a linear length path may be found between any pair of vertices in polynomial time building upon a result of Kaibel and Kukharenko.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Thermodynamic Response Functions in Singular Bayesian Models

Singular statistical models-including mixtures, matrix factorization, and neural networks-violate regular asymptotics due to parameter non-identifiability and degenerate Fisher geometry. Although singular learning theory characterizes marginal likelihood behavior through invariants such as the real log canonical threshold and singular fluctuation, these quantities remain difficult to interpret operationally. At the same time, widely used criteria such as WAIC and WBIC appear disconnected from underlying singular geometry. We show that posterior tempering induces a one-parameter deformation of the posterior distribution whose associated observables generate a hierarchy of thermodynamic response functions. A universal covariance identity links derivatives of tempered expectations to posterior fluctuations, placing WAIC, WBIC, and singular fluctuation within a unified response framework. Within this framework, classical quantities from singular learning theory acquire natural thermodynamic interpretations: RLCT governs the leading free-energy slope, singular fluctuation corresponds to curvature of the tempered free energy, and WAIC measures predictive fluctuation. We formalize an observable algebra that quotients out non-identifiable directions, allowing structurally meaningful order parameters to be constructed in singular models. Across canonical singular examples-including symmetric Gaussian mixtures, reduced-rank regression, and overparameterized neural networks-we empirically demonstrate phase-transition-like behavior under tempering. Order parameters collapse, susceptibilities peak, and complexity measures align with structural reorganization in posterior geometry. Our results suggest that thermodynamic response theory provides a natural organizing framework for interpreting complexity, predictive variability, and structural reorganization in singular Bayesian learning.
Read the full abstract

Numerical Analysis

A Space-Time Galerkin Boundary Element Method for Aeroacoustic Scattering

Acoustic scattering by vehicle surfaces can have significant effects on overall noise levels. In this paper, we present a space-time Galerkin time-domain boundary element method (TDBEM) that offers several distinct advantages over contemporary scattering methods for prediction of acoustic scattering and shielding of complex aeroacoustic sources such as propellers and rotors. The time-domain approach allows efficient simulation of transient, rotating, and broadband noise sources, while the Galerkin formulation is robust and unconditionally stable without any tuned numerical parameters. The main challenge of the Galerkin approach, namely the numerically difficult double space-time integration, is resolved through an efficient decomposition-based quadrature procedure. We present three cases with analytical solutions to validate the method and study its numerical properties, demonstrating excellent agreement for scattering and shielding by a variety of different geometries. We then apply the TDBEM to a trailing edge-mounted propeller case, comparing the numerical predictions with experimental measurements. The results demonstrate good agreement between predicted and measured scattering and shielding in a practical application case.
Read the full abstract

Probability

Thresholds for colouring the random Borsuk graph

We consider the chromatic number of the random Borsuk graph. The random Borsuk graph is obtained by sampling $n$ points i.i.d. uniformly at random on the $d$-dimensional sphere $S^d$, and joining a pair of points by an edge whenever their geodesic distance is $>\pi-\alpha$ where the parameter $\alpha=\alpha(n)$ may depend on $n$. Kahle and Martinez-Figueroa have shown that the switch from being $(d+1)$-colourable to needing $\geq d+2$ colours occurs in the regime where the average degree is of logarithmic order. We show that for each $2\leq k\leq d$, the switch from being $k$-colourable to needing $> k$ colours occurs in the regime when the average degree is constant. What is more, we show that for $k=2$ there is a sharp threshold of the form $\alpha(n) = c \cdot n^{-1/d}$, where the constant $c$ can be expressed in terms of the critical intensity for continuum AB percolation on $\mathbb{R}^d$. For $k=3,\dots,d+1$ we show that there is a sharp threshold for "almost all $n$".
Read the full abstract

All authors Álvaro Acitores Montero, Matthias Irlbeck, Tobias Müller, Matěj Stehlík

Operator Algebras

Obata's rigidity theorem in free probability

We establish a free analogue of Obata's rigidity theorem. More precisely, Cheng and Zhou (2017) proved that on a weighted Riemannian manifold, the sharp spectral gap (Poincaré constant) is achieved only when the space splits isometrically off a one-dimensional Gaussian factor, providing an infinite-dimensional counterpart of Obata's rigidity theorem. We obtain the corresponding phenomenon in free probability, extending it beyond the setting of analytic self-adjoint potentials: Assume a self-adjoint $n$-tuple $X=(X_1,\dots,X_n)$ admits Lipschitz conjugate variables in the sense of Dabrowski (2014). Under a suitable non-commutative curvature-dimension condition, we show that any non-zero saturator of Voiculescu's free Poincaré inequality must be an affine function of the generators. Consequently, we deduce that the von Neumann algebra $M=W^*(X_1,\dots,X_n)$ necessarily splits off a freely complemented semicircular component $W^*(Y_1)\simeq L^{\infty}([-2,2],\mu_{\rm sc})$, which is also maximal amenable in $M$. More generally, whenever the first eigenspace of the free Laplacian $\Delta=\partial^*\bar\partial$ is finite-dimensional of rank $r\ge 1$, our rigidity argument shows that these $r$ extremal directions form a free semicircular family, yielding a free product decomposition with an $L(\mathbb{F}_r)$ factor. This provides a free-probability analogue of the classical Gaussian splitting phenomenon and reveals a rigidity mechanism under non-commutative curvature.
Read the full abstract

General Topology · Cross-listed from cs.GT

Equilibrium for max-plus payoff

We study equilibrium concepts in non-cooperative games under uncertainty where both beliefs and mixed strategies are represented by non-additive measures (capacities). In contrast to the classical Nash framework based on additive probabilities and linear convexity, we employ capacities and max-plus integrals to model qualitative and idempotent decision criteria. Two equilibrium notions are investigated: Nash equilibrium in mixed strategies expressed by capacities, and equilibrium under uncertainty in the sense of Dow and Werlang, where players choose pure strategies but evaluate payoffs with respect to non-additive beliefs. For games with compact strategy spaces and continuous payoffs, we establish existence results for both equilibrium concepts using abstract convexity techniques and a Kakutani-type fixed point theorem.
Read the full abstract

Optimization and Control

The Inverse Micromechanics Problem given Dielectric Constants for Isotropic Composites with Spherical Inclusions

In this article, convex optimization is introduced as a promising tool to study Eshelby based inverse micromechanics problems. The focus is on inverse micromechanics using the Eshelby-Mori-Tanaka model given the dielectric constants of the composite material and of all of its components. The model is exactly the same for the conductivity properties as well. This choice of model is made since the model is fairly simple and has a closed form analytical solution for the case of spheroidal inclusions as well. The forward or direct micromechanics problem deals with the determination of effective properties of a composite material given the properties of its components and microstructural information. The focus is on isotropic composites and the distribution of inclusions is assumed to be such that this holds. The inverse micromechanics problem considered in this paper deals with the determination of microstructural information given the properties of the composite material and all of its components. Since in this paper, isotropy of the composite and only spherical inclusions are considered, the goal is to determine just volume fractions of the components of the composite material. The inverse problem is formulated as a Linear Programming problem and is solved. Before this, the inverse problem and certain important variants of it are examined through the lens of convex optimization. Lastly, promising results regarding the relationship between dispersive materials, noise in measurements, and quality of obtained volumetric splits are showcased. The scope of the use of convex optimization in inverse micromechanics is discussed.
Read the full abstract

Analysis of PDEs

2D capillary liquid drops with constant vorticity: rotating waves existence and a conditional energetic stability result for rotating circles

We consider a two-dimensional, pure capillary drop of nearly-circular shape, having constant vorticity. We write the Craig-Sulem equations on the unit circle, then on the flat torus. We show their Hamiltonian structure and we then observe symmetries and we derive constants of motions. After showing linear stability for rotating circles, we prove the existence of rotating waves by combining a bifurcation-theoretical approach together with critical point theory. Finally, by exploiting the Hamiltonian structure, we show that whenever volume and barycenter are fixed to be the same as those of rotating circle, this solution is also conditionally energetically stable. This holds in the irrotational case as well, in agreement with the stability analysis of rotating cylinder jets in Rayleigh [25].
Read the full abstract

Algebraic Geometry

A complete classification of modular compactifications of the universal Jacobian

This is the third paper in a series, following [FPVa] and [FPVb]. We classify all modular compactifications of the universal Jacobian over $\overline{\mathcal{M}}_{g,n}$, both as stacks and as their relative good moduli spaces. Our main result gives a combinatorial parametrization of compactified universal Jacobian stacks by $V$-functions on a stability domain $\mathbb{D}_{g,n}$ of half-vine types (two-components topological types with a chosen side); under this correspondence, fine compactifications are exactly the general $V$-functions. We single out the classical compactified universal Jacobians, namely those induced by numerical polarizations (relative $\mathbb{R}$-line bundles on the universal curve $\overline{\mathcal{C}}_{g,n}/\overline{\mathcal{M}}_{g,n}$), recovering the constructions of Kass-Pagani and Melo in the fine case, and we prove that their good moduli spaces are locally projective over $\overline{\mathcal{M}}_{g,n}$. We determine when two compactified universal Jacobians are isomorphic over $\overline{\mathcal{M}}_{g,n}$ and describe a resolution of the universal family via a compactified Jacobian over $\overline{\mathcal{M}}_{g,n+1}$. Finally, we analyse the poset $\Sigma_{g,n}$ of compactified universal Jacobians, an extension of the poset of regions of the hyperplane arrangement of classical stability conditions $\mathcal{A}_{g,n}$ studied in Kass-Pagani. We prove that for $n=0$ all compactified universal Jacobians are those constructed by Caporaso. We then give an explicit description of the submaximal elements of $\Sigma_{g,n}$ for all $n$, generalizing the stability walls in the classical stability space $\mathcal{A}_{g,n}$ from Kass-Pagani's work.
Read the full abstract

Combinatorics

Cross-free families have linear size

Two subsets $A$ and $B$ of a ground set $X$ are crossing if none of the four sets $A\setminus B,B\setminus A,A\cap B, X\setminus (A\cup B)$ are empty. Almost fifty years ago, Karzanov and Lomonosov conjectured that every family of subsets of an $n$-element ground set with no $k$-pairwise crossing members has size $O(kn)$. We prove the bound $O_k(n)$, settling (arguably) the main problem about the growth rate of such families. In fact, we prove the stronger statement that every $k$-wise laminar family has at most linear size. Here a family is $k$-wise laminar if it contains no antichain of size $k$ whose members have nonempty common intersection.
Read the full abstract

Combinatorics

Homological methods in rigidity theory using graphs of groups

In recent work, Stokes and Vermant considered graph-of-groups realisations of hypergraphs as a new description of rigidity-theoretic problems. In this paper, we show that the infinitesimal aspects of graph-of-groups realisations can be analysed using cellular sheaves and their cohomology. Using these tools, we give an algebraic condition for Henneberg moves to preserve independence, and we prove that the infinitesimal rigidity and flexibility of certain graph-of-groups realisations are generic properties. We use these results to show that whenever a rigidity-theoretic problem is defined in a Lie group $G$ using a $1$-dimensional connected subgroup $H$ with $N_{G}(H)/H$ finite, then the so-called Maxwell-count leads to a necessary and sufficient condition for minimal rigidity, generalising various known results in the literature.
Read the full abstract

Information Theory

Spatially-aware Secondary License Sharing in mmWave Networks

In this work, we consider a multi-operator mmWave network implementing secondary license sharing (SLS) where a primary license holder leases secondary licenses to secondary users, allowing them to access its licensed spectrum under some pre-defined transmission constraints. The highly directional nature of mmWaves, along with their sensitivity to blockages, naturally confines the interference to/from devices to narrow angular sectors within a certain range around themselves. This motivates us to consider a spatially-aware SLS that determines a secondary link's activity based on its distance/orientation relative to the primary link, as well as blockages around it. By leveraging the tools of stochastic geometry, we develop an analytical framework to design and study such spatially-aware SLS in mmWave networks. Our analysis quantifies the transmission opportunities available to secondary users and the resulting coverage probabilities for both primary and secondary links. We characterize the effect of directionality and blockage conditions, along with transmission restrictions and secondary users' density, on the performance of both operators. Via numerical investigation, we derive various insights. We show that blockage conditions can change the shape of coverage plots and thus affect key conclusions. Further, blockage and directionality can increase the transmission opportunities for secondary users, improving the feasibility and gains of SLS.
Read the full abstract

Numerical Analysis

Structured distance to singularity as a nonlinear system of equations

In this article we study the structured distance to singularity for a nonsingular matrix $A\in\mathbb{C}^{n\times n}$, with a prescribed linear structure $\mathcal{S}$ (for instance, a sparsity pattern, or a real Toeplitz structure), i.e., the norm of the smallest perturbation $\Delta \in \mathcal{S}$, such that $A + \Delta$ is singular. This is an example of structured matrix nearness problem: a family of problems that arise in control and systems theory and in numerical analysis, when characterizing the robustness of a certain property of a system with respect to perturbations that are constrained to a certain structure (for example the structure of the nominal system). We start by highlighting the parallelism between two main tools which have been proposed in the literature: a gradient system approach for a functional in the eigenvalues, which requires the solution of certain low-rank matrix differential equations (see [Guglielmi, Lubich, Sicilia, SINUM 2023]), and a two-level optimization approach in which the inner linear least-squares problem is solved explicitly (see [Usevich, Markovsky, JCAM 2014] and [Gnazzo, Noferini, Nyman, Poloni, FoCM 2025]). In particular, these articles underline the remarkable property that $\Delta$ is (at least generically) the orthogonal projection onto the structure $\mathcal{S}$ of a rank-1 matrix $uv^*$. This property and the parallelism suggest a new reformulation of the problem into a system of nonlinear equations in the two vector unknowns $u,v \in\mathbb{C}^n$. We study this new formulation, and propose an algorithm to solve these nonlinear equations directly with the multivariate Newton's method. We discuss how to avoid the singularity of such system of nonlinear equations, and how to ensure monotonic convergence. The resulting algorithm is faster than the existing ones for large matrices, and maintains comparable accuracy.
Read the full abstract

All authors Miryam Gnazzo, Nicola Guglielmi, Federico Poloni, Stefano Sicilia

Combinatorics

Four relations on the set of point-hyperplane anti-flags

There are precisely four arrangements of two point-hyperplane anti-flags. We consider the corresponding relations on the set of such anti-flags and show that each of them can be recovered from any other except in one special case. If the field consists of two elements, then one of the relations cannot be used to recover each of the remaining three. This is related to a bijection between anti-flags and exterior points of the hyperbolic polar space which exists in this case.
Read the full abstract

Mathematical Physics

The Gibbs phenomenon for the Krawtchouk polynomials

We study the Fourier approximation $\mathcal{F}_N$ of the sign function by the Krawtchouk polynomials. We give numerical evidence that the Gibbs phenomenon of the approximation differs from the classical Gibbs constant; this is in contrast to other families of orthogonal polynomials. We also show that the steepness $\mathcal{F}_N'(0)$ of the approximation is bounded by explicitly proving $\lim_{N \to \infty} \mathcal{F}_N'(0) = \log 4$. This is also in contrast to approximations by classical orthogonal polynomials, where the steepness has been shown to be unbounded as the degree increases.
Read the full abstract

General Topology · Cross-listed from cs.CG

ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes

The Optimal Morse Matching (OMM) problem asks for a discrete gradient vector field on a simplicial complex that minimizes the number of critical simplices. It is NP-hard and has been studied extensively in heuristic, approximation, and parameterized complexity settings. Parameterized by treewidth $k$, OMM has long been known to be solvable on triangulations of $3$-manifolds in $2^{O(k^2)} n^{O(1)}$ time and in FPT time for triangulations of arbitrary manifolds, but the exact dependence on $k$ has remained an open question. We resolve this by giving a new $2^{O(k \log k)} n$-time algorithm for any finite regular CW complex, and show that no $2^{o(k \log k)} n^{O(1)}$-time algorithm exists unless the Exponential Time Hypothesis (ETH) fails.
Read the full abstract

Analysis of PDEs

Well-posedness of the heat equation in domains with topological transitions

We analyze a linear parabolic equation with homogeneous Dirichlet boundary conditions posed in domains whose evolution may involve topological transitions. The domains are described as sublevel sets of a smooth space-time level set function, allowing for transitions such as domain splitting and merging and the creation or vanishing of islands and holes. We introduce anisotropic space-time function spaces that extend the classical Bochner spaces used in cylindrical domains and establish key functional-analytic properties of these spaces, including the density of compactly supported smooth functions. This framework enables the application of the Babuška-Banach theorem, yielding existence, uniqueness, and a priori estimates for weak solutions. The analysis applies to domain evolutions generated by level set functions with isolated nondegenerate critical points, which correspond to the generic topology changes classified by Morse theory in two and three spatial dimensions.
Read the full abstract

Analysis of PDEs

On spiral steady flows for the Couette-Taylor problem

We investigate the Couette-Taylor problem for a steady incompressible viscous fluid in a 3D cylindrical annulus, where one of the two cylinders is still, under both Dirichlet and boundary conditions involving the vorticity that naturally appear in the weak formulation. The outcome of this study is twofold. First, we explicitly determine all the solutions with a specific geometric partial invariance, which coincide with the so-called spiral Poiseuille or Poiseuille-Couette flows depending on the boundary conditions. Second, for small boundary data, we provide stability of such solutions, that is, no steady finite-energy perturbations are admissible. To achieve this result in presence of vorticity boundary conditions, we find a substantial analytical difference depending on which cylinder is still.
Read the full abstract

Analysis of PDEs

Existence and regularity for an entire Grushin-Choquard equation

We consider the following Choquard equation $$ -\Delta_\gamma u + u = \left(d(z)^{-\mu} \ast |u|^p\right)|u|^{p-2}u, \text{ in } \mathbb{R}^N, $$ where $\Delta_\gamma$ is the Grushin operator. For a suitable range of the parameter $p$ we prove the existence of a mountain pass solution of the equation and we establish that the solution belongs to $L^q(\mathbb{R}^N)$ for all $q\in [2,\infty]$ and to $C^{0,\alpha}_{\textrm{loc}}(\mathbb{R}^N)$ for some $\alpha \in (0,1)$. Additionally, we provide a Poho\v zaev type identity, which allows us to derive a nonexistence result for smooth solutions to our equation.
Read the full abstract

Probability

Controlled fields, rough stochastic calculus, and Itô-Wentzell-Alekseev-Gröbner identities

We develop a calculus of space-time controlled fields for rough stochastic systems. This approach provides a unified composition rule for evaluating random fields along rough semimartingales and yields a rough stochastic Itô-Wentzell formula under natural and verifiable regularity assumptions. Our motivation comes from works of Hudde et al. (2024) and, independently, Del Moral and Singh (2022) where the authors established, respectively, Itô-Alekseev-Gröbner, backward Itô-Wentzell, and diffusion interpolation formulas.
Read the full abstract

All authors Jannis R. Dause, Peter K. Friz, Arnulf Jentzen, Jian Song

Classical Analysis and ODEs

Weighted Sobolev Inequalities via the Meyers–Ziemer Framework: Measures, Isoperimetric Inequalities, and Endpoint Estimates

We establish a new global endpoint Sobolev inequality for measures that extends the classical theorem of Meyers-Ziemer by placing a maximal function on the right-hand side. This result has several significant consequences. It extends naturally to functions of weighted bounded variation and yields corresponding capacity and isoperimetric inequalities. The inequality is also closely connected to endpoint estimates for fractional operators, including bounds for fractional maximal functions and Hardy space endpoint estimates for the Riesz potential. Our main inequality yields a family of endpoint inequalities, characterized in terms of subrepresentation formulas, Lorentz space improvements, and isoperimetric inequalities for measures and bounded open sets. When one moves away from the endpoint to $p>1$, the analogous inequalities no longer hold in general; however, we identify a sharp bumped maximal function for which the corresponding non-endpoint inequality is valid. Finally, we show that this framework yields new $(p,p)$ two-weight Sobolev inequalities.
Read the full abstract

All authors Simon Bortz, Kabe Moen, Andrea Olivo, Carlos Pérez, Ezequiel Rela

Optimization and Control

Integral Formulation and the Brézis-Ekeland-Nayroles-Type Principle for Prox-Regular Sweeping Processes

We study sweeping processes in a Hilbert space driven by time-dependent uniformly prox-regular sets, allowing the moving constraint to exhibit discontinuities of bounded variation. We introduce a new integral formulation for bounded-variation trajectories, given by a global variational inequality tested against continuous admissible trajectories, and we compare it with the standard differential-measure formulation, in which the differential measure of the trajectory is constrained by the proximal normal cone. In the prox-regular (generally nonconvex) framework, the variational inequality necessarily includes a quadratic correction term reflecting the hypomonotonicity of proximal normal cones. Under mild regularity assumptions on the moving set, including lower semicontinuity in time, uniform prox-regularity of the values, and a selection-extension property guaranteeing a rich class of test trajectories (satisfied, for instance, in the convex case and for bounded prox-regular sets), we prove that the new integral formulation is equivalent to the differential-measure formulation. This yields a unified bounded-variation notion of solution for prox-regular sweeping processes. We further establish a Brézis-Ekeland-Nayroles-type variational characterization via a prox-regular variational residual: the residual is nonpositive along every admissible trajectory, and solutions are exactly those trajectories for which this residual attains its maximal value, namely zero. As a consequence, we prove a stability result: a uniform limit of admissible trajectories with vanishing residual is a solution of the limit sweeping process. The resulting variational framework provides a robust tool for stability and approximation analyses in the prox-regular, nonconvex setting.
Read the full abstract

Rings and Algebras

A Knebusch trace formula for Azumaya algebras with involution

We establish a trace formula for signatures of hermitian forms over Azumaya algebras with involution, extending Knebusch's work on symmetric bilinear forms over finite étale extensions of commutative base rings. As an application when the base ring is semilocal, we obtain an exact sequence for total signatures, related to Pfister's local-global principle and the notion of stability index.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

On the Statistical Optimality of Optimal Decision Trees

While globally optimal empirical risk minimization (ERM) decision trees have become computationally feasible and empirically successful, rigorous theoretical guarantees for their statistical performance remain limited. In this work, we develop a comprehensive statistical theory for ERM trees under random design in both high-dimensional regression and classification. We first establish sharp oracle inequalities that bound the excess risk of the ERM estimator relative to the best possible approximation achievable by any tree with at most $L$ leaves, thereby characterizing the interpretability-accuracy trade-off. We derive these results using a novel uniform concentration framework based on empirically localized Rademacher complexity. Furthermore, we derive minimax optimal rates over a novel function class: the piecewise sparse heterogeneous anisotropic Besov (PSHAB) space. This space explicitly captures three key structural features encountered in practice: sparsity, anisotropic smoothness, and spatial heterogeneity. While our main results are established under sub-Gaussianity, we also provide robust guarantees that hold under heavy-tailed noise settings. Together, these findings provide a principled foundation for the optimality of ERM trees and introduce empirical process tools broadly applicable to other highly adaptive, data-driven procedures.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Bayes with No Shame: Admissibility Geometries of Predictive Inference

Modern predictive systems combine predictors, sequential monitors, prediction sets, and online strategies, each with a different certificate of optimality. We study four criterion-relative geometries: Blackwell risk dominance, anytime-valid admissibility, fixed-level marginal coverage with expected-length efficiency within a declared rank-indexed family, and choice-based approachability (CApp) boundary-feasibility. We embed the four procedure types in a common product space and prove witness-based pairwise non-nesting: for every ordered pair of criterion classes, an explicit predictive system is active in both relevant coordinates, belongs to one class, and fails the other. The result records non-nesting across different object spaces and partial orders; it does not assert practical incompatibility. We separate three measure-relative coherence notions. In conditionally i.i.d. models, posterior predictive means under a single prior are martingales under the prior predictive law. For a point null, anytime-valid admissibility within e-processes is equivalent to the nonnegative martingale property. Self-consistency under a predictor's own predictive law does not imply Blackwell admissibility, as shown by a Bernoulli log-loss counterexample. Coverage admissibility is certified by exchangeability ranks within the declared rank-indexed family, while CApp boundary-feasibility uses Cesaro steering. A constrained-Bayes design schema organizes the four paradigms without collapsing their distinct decision spaces, partial orders, or risk functionals. Admissibility is criterion-relative.
Read the full abstract

2603.05335 · 5 Mar · Accepted for publication in Transactions on Machine Learning Research (TMLR). 38 pages, 6 figures, 5 tables. This version synchronizes the preprint with the verified camera-ready manuscript; it clarifies the scope and assumptions of auxiliary results while leaving the main separation results and numerical findings unchanged. Video overview: https://doi.org/10.6084/m9.figshare.33350829

Analysis of PDEs

Conditional asymptotic stability of solitary waves of the Euler-Poisson system on the line

We apply the idea of using a combination of virial inequalities and Kato smoothing, previously applied to NLS and generalized KdV pure power equations to Euler-Poisson: we assume that a solution remains very close for all times to a soliton in an appropriate space and then we prove an asymptotic convergence to a soliton for $t\to +\infty$.
Read the full abstract

Analysis of PDEs

The Extra Vanishing Structure and Nonlinear Stability of Multi-Dimensional Rarefaction Waves: The Geometric Weighted Energy Estimates

We study the resolution of discontinuous singularities in gas dynamics via multi-dimensional rarefaction waves. While the mechanism is well-understood in one spatial dimension, the rigorous construction in higher dimensions has remained a challenging open problem since Majda's proposal, primarily due to the characteristic nature of rarefaction fronts which leads to derivative losses in linearized estimates. In this paper, we establish the nonlinear stability of multi-dimensional rarefaction waves for the compressible Euler equations with ideal gas law. We prove that for initial data being small perturbations of the planar rarefaction wave in $H^s$ ($s > s_c$), there exists a unique global solution that converges asymptotically to the background rarefaction wave as $t \to \infty$. Our proof relies on a novel Geometric Weighted Energy Method (GWEM), which yields stable energy estimates without loss of derivatives in standard Sobolev spaces, overcoming the limitations of previous Nash-Moser schemes. A key ingredient is a detailed geometric description of the rarefaction wave fronts via the acoustical metric, where we identify a hidden extra vanishing structure in the top-order derivatives of the characteristic speed. This is the first paper in a series, providing the crucial a priori energy bounds. The existence of solutions and applications to the multi-dimensional Riemann problem will be addressed in the forthcoming companion paper.
Read the full abstract