Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 7 May

Algebraic Geometry

On the cohomological purity of the affine Springer fibers

We address questions posed by Gérard Laumon and Jean-Loup Waldspurger concerning the cohomological purity of affine Springer fibers. More precisely, we show that an affine Springer fiber is cohomologically pure if and only if its $\xi$-stable quotient is cohomologically pure, and that this is further equivalent to the cohomological purity of a certain sequence of truncated affine Springer fibers. We deduce from this a sheaf-theoretic reformulation of cohomological purity for affine Springer fibers. We then compare this new criterion with a previously known one via a microlocal analysis of the relevant intersection complexes. As a corollary, we show that both the primitive part of the cohomology of an affine Springer fiber and the cohomology of its $\xi$-stable quotient depend only on the root valuation datum of the defining element.
Read the full abstract

Information Theory · Cross-listed from cs.LG

When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation

Increasing a voting budget can improve or reduce population accuracy, and an initial gain or loss need not persist. We give a complete structural classification of these curves for binary unweighted majority under infinitely exchangeable correctness indicators, with an arbitrary latent success-probability law $\Pi$. The classification is encoded by the signed voting signature $ \omega_\Pi(B)=\int \mathbf{1}\{q(1-q)\in B\}(2q-1)\,\Pi(\,\mathrm{d} q). $ The complete odd-budget curve and this signature determine each other: the initial accuracy gives its total signed mass, and successive budget increments give its higher moments. Reflection-symmetric differences between latent laws are exactly the changes invisible to voting. A weighted total-variation constraint characterizes every attainable signature, and a minimum-mass allocation to the two reflected branches, completed by symmetric probability mass, gives every population producing its curve. Consequently, the full curve identifies the latent population precisely when no symmetric mass remains to redistribute.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.str-el

Algebraic Structure of Finite-Size Bethe Solutions in the Heisenberg Chain

The spin-$1/2$ Heisenberg antiferromagnetic chain is the canonical example of an integrable quantum many-body model. Despite its exact solvability, explicit finite-size solutions are typically only accessible via numerical evaluation of the Bethe ansatz equations. Here, we analyse the algebraic structure of the exact, symbolic ground states for chains up to twelve sites using the Bethe ansatz. We find that the algebraic degree of the ground state magnon phases and Bethe roots scale with respect to system size at a different rate to the ground-state energy and wavefunction coefficients. The ground-state Bethe roots and energy are found to become Galois unsolvable for ten or more sites, thus demonstrating the lack of a symbolic analytical solution in a quantum integrable model due to algebraic complexity.
Read the full abstract

Complex Variables

Revised Demailly's Affineness Criterion and Algebraization of Entire Grauert Tubes

We provide a partial answer to Burns' 1982 conjecture on the affineness of entire Grauert tubes: the complement of a codimension-one subset of an entire Grauert tube is affine. This result is obtained by establishing a generalized version of Demailly's criterion for affineness of Stein manifolds, which may be of independent interest.
Read the full abstract

Numerical Analysis

Numerical Analysis of Space-Time Dependent Source Identification in Subdiffusion Equations

In this work, we propose an easy-to-implement fixed-point algorithm for reconstructing a space-time dependent source in a subdiffusion model from lateral boundary measurements. The numerical scheme combines a Galerkin finite element method for spatial discretization with a finite difference method for temporal discretization. We establish the linear convergence of the fixed-point iteration and derive an error bound that depends explicitly on the discretization parameters and the noise level. The error analysis relies on stability properties of the continuous inverse problem and technical estimates for the associated direct problem with limited-regularity data. Numerical experiments are presented to support and complement the theoretical analysis.
Read the full abstract

All authors Siyu Cen, Bangti Jin, Yavar Kian, Zhi Zhou

Optimization and Control · Cross-listed from eess.SY

Maximal Controlled Invariant-MPC: Enhancing Feasibility and Reducing Conservatism through Terminal CBF Constraint in Safety-Critical Control

Optimal control for safety-critical systems is often dependent on the conservativeness of constraints. Control Barrier Functions (CBFs) serve as a medium to represent such constraints, but constructing a minimally conservative CBF is a computationally intractable problem. Therefore, approaches that can guarantee safety while reducing conservatism will help improve the optimality of the system under consideration. Here, we present a Model Predictive Control (MPC) formulation using CBF as a terminal constraint, which is proven to improve feasibility and reachable sets with increasing prediction horizon. The constructive nature of the proofs allows for warm-starting the nonlinear optimization problem, thereby reducing the computational time substantially. Simulations are set up for a simple nonholonomic system to numerically validate the results, and it is observed that the number of infeasible points decreased by a factor of 1.7 to 2.7. The increase in reachable state space was demonstrated by the ability of the system to track trajectories that are entirely inside the unsafe region of the control barrier function.
Read the full abstract

Optimization and Control

Stability of the Monge Map in Semi-Dual Optimal Transport

This paper shows that the semi-dual formulation of the optimal transport problem has a degenerate saddle-point structure, and that its numerical solution is equivalent to solving a constrained optimization problem. We derive necessary and sufficient conditions for the convergence of Monge maps without requiring optimality of the dual potential. This analysis helps explain why, in practice, numerical algorithms often require more iterations to update the transport map than the potential.
Read the full abstract

Geometric Topology

Ropelength-Filtered Swept-Area Geometry

This paper studies the swept-area cost of isotopies between thick knot representatives when the isotopy is required to stay inside a ropelength window: every intermediate curve has thickness at least one and length at most $\Lambda$. Without these constraints the swept area is the classical homotopy-area length on spaces of curves, and the induced distance on unparametrized curves is bounded below by the flat norm; see Yezzi–Mennucci and Michor–Mumford. We record the corresponding non-degeneracy on the ropelength-filtered moduli space, taken modulo orientation-preserving reparametrizations and Euclidean isometries, as a consequence of this classical lower bound. The ropelength window changes the theory in two ways. Distances are infinite between classes that are not yet connected at the level $\Lambda$, and all costs depend monotonically on the budget. We organize this dependence through budget–cost profiles and swept-area merge costs of admissible components. We prove their monotonicity and a transport estimate under whole-path simulations, and relate them to the merge scales of ropelength-filtered knot spaces. On the diagrammatic side, we construct a network with exact spatial endpoints whose path cost equals the infimal cost over diagrammatically generic isotopies, and show that the graph obtained by collapsing projection fibres gives only a lower bound, which can lose positive cost inside a fibre. We also give projected-area calibrations, exact formulas for concentric round and homothetic elliptical unknots, in which the window is not active, a labelled polygonal estimate, and a based loop-length structure on admissible fundamental groups. Existence of minimizing isotopies under the thickness and length constraints is left open.
Read the full abstract

Analysis of PDEs

Notes on Liouville-type theorems for the 3D stationary Navier-Stokes equations

In \cite{CV23}, Chamorro and Vergara-Hermosilla established several Liouville-type theorems to the Navier-Stokes equations in the framework of the variable Lebesgue spaces. These results may allow the variable exponent $p(\cdot)$ beyond the range of $[3,\frac{9}{2}]$ in some non-negligible regions in $\mathbb{R}^3$. In this paper we find two new non-negligible regions, in which the Liouville-type theorems still hold under some assumptions imposed on $p(\cdot)$ in these regions. Our results can be regarded as the generalization of the results in \cite{CV23}.
Read the full abstract

All authors Hongling Jiang, Jianfeng Sun, Gastón Vergara-Hermosilla, Jihong Zhao

Numerical Analysis

The double splitting iteration method for solving the large indefinite least squares problem

Addressing large-scale indefinite least squares (ILS) problem poses notable computational bottlenecks in the field of numerical linear algebra. State-of-the-art iterative schemes for such problems are predominantly constructed upon the single splitting of the coefficient matrix derived from the corresponding normal equation. In this work, we put forward an innovative iterative framework grounded in the double splitting of normal equations tailored for ILS problem. Specifically, we elaborate on a distinct implementations of the double splitting strategy, which offer constructive insights and methodological references for subsequent research on double splitting-based iterative methods. Two numerical experiments further corroborate that the proposed double splitting iterative paradigm outperforms conventional single splitting approaches in both computational efficiency and convergence robustness.
Read the full abstract

Combinatorics

Defective chromatic polynomials

For a graph $G$ and an integer $d\geq 0$, the defective chromatic polynomial $\chi_d(G;k)$ counts the $k$-colorings of $G$ in which each vertex has at most $d$ neighbors of its own color. We investigate which structural properties of $G$ are determined by the full family $\{\chi_d(G;k)\}_{d\geq 0}$. We establish a contraction formula expressing $\chi_d(G;k)$ as a sum of ordinary chromatic polynomials of the edge contractions of $G$. As a first application, we prove that for triangle-free graphs, the full family determines the degree sequence. For trees, we show further that the family $\{\chi_d(T;k)\}_{d\geq 0}$ determines the path-subgraph counts $N(P_j,T)$ for $j=1,2,3,4$, but not for $j=5$. For each $n\geq 9$, we construct a pair of nonisomorphic trees of order $n$ that share the same defective chromatic polynomials for every $d\geq 0$.
Read the full abstract

Optimization and Control

Optimal Design of Stealthy Attacks in Partially Observed Linear Systems: A Likelihood-Based Approach

We study the optimal design of stealthy attacks against partially observed linear control systems. We first propose a novel likelihood-based detection mechanism derived from the innovation process, based on which we quantify stealthiness and formulate an attack design problem that trades off performance degradation and detectability. We develop a tractable control-theoretic framework for optimal stealthy attacks under two information structures: deterministic attacks fixed prior to system evolution, and adaptive attacks constructed from available observations. In the adaptive setting, the attacker's partial observation leads to a stochastic control problem with an endogenous information structure. We address this challenge through a hierarchical optimization framework combined with the separation principle, reducing the problem to a Markovian control formulation and yielding semi-explicit optimal attacks. We further establish well-posedness of the resulting systems and illustrate through numerical experiments how information constraints shape the trade-off between attack effectiveness and stealthiness.
Read the full abstract

Combinatorics

Fertility fibres and coproduct coefficients in the LOT Hopf algebra

We study fibres of the fertility map $\Phi$ from decorated rooted trees to decorated multi-index monomials. For a multi-index $\mathbf{k}$ of weight $-1$, the fibre $\mathcal F_{\mathbf{k}}=\{\,t:\Phi(t)=\xx^{\mathbf{k}}\,\}$ consists of all rooted trees with decoration–fertility profile $\mathbf{k}$. We consider its ordinary cardinality $F_{\mathbf{k}}$, its symmetry-weighted cardinality $W_{\mathbf{k}}$, and the coefficient mass $J_{\mathbf{k}}$ appearing in the tree expansion of the transposed embedding $\jmath$. We obtain an explicit formula and a functional equation for the weighted counts, and an exact multiset recursion together with a cycle-index functional equation for the ordinary counts. We also introduce coefficient generating functions for the lowering derivation $\bar\partial$, derive recursive and transport-array formulas for the corresponding coefficients, and use them to refine the admissible-cut formula for the coproduct in the LOT Hopf algebra.
Read the full abstract

Combinatorics

The vertex Folkman number $F_v(3,3;5)$ equals~$8$

The vertex Folkman number $F_v(s,t;k)$ is the smallest $n$ for which there exists a $K_k$-free graph on $n$ vertices whose vertices cannot be $2$-colored without producing a monochromatic copy of $K_s$ or $K_t$. We show $F_v(3,3;5)=8$. The witness is the cone $K_1 \vee \overline{C_7}$, a single universal vertex joined to the complement of a $7$-cycle. That this graph is $K_5$-free and arrows $(3,3)^v$ follows from a short independence-number argument. The matching lower bound – no $K_5$-free graph on $7$ or fewer vertices works – comes from exhaustive enumeration via nauty and a SAT check using Glucose\,4. The appendix has a self-contained Python script for verification.
Read the full abstract

2605.05526 · 7 May · Withdrawn: this result is not new. The value F_v(3,3;5)=8 with witness K_1 + complement(C_7) is established in T. Luczak, A. Rucinski, S. Urbanski, On minimal Folkman graphs, Discrete Mathematics 236 (2001) 245-262, Theorem 2 (p. 250). I missed this reference during the prior-work search before posting v1. Apologies for the duplication.

Wednesday 6 May

Metric Geometry

Minimal Fillings of Finite Metric Spaces and Convex Polyhedra

Problem of minimal parametric generalized fillings of finite metric space $M$ (a version of optimal connection problem) leads to construction of a convex multidimensional polyhedra $W_G$ for each tree $G$ connecting $M$ chosen as type of the parametric filling. The weight of the parametric minimal filling can be found as maximum on $W_G$ of the special linear function corresponding to the distance vector of $M$. It is proved that the union of vertex sets of the polyhedra $W_G$ over all possible $G$ forms an extremal subset, i.e., coincides with the vertex set of its convex hull.
Read the full abstract

Classical Analysis and ODEs

A simple proof that the Riesz projection is bounded on $L^p(\mathbb{T})$ for $1<p<\infty$

Let $\mathbf{P}$ denote the Riesz projection on the unit circle $\mathbb{T}$ and suppose that $1<p<\infty$. We present a simple proof of the bound $\|\mathbf{P}f\|_p \leq \max(p,q) \|f\|_p$, where $f$ is in $L^p(\mathbb{T})$ and $p^{-1}+q^{-1}=1$. Our proof is a variation of a classical argument due to M. Riesz demonstrating that the Hilbert transform is bounded on $L^p(\mathbb{T})$.
Read the full abstract

Logic · Cross-listed from cs.CC

Measuring Decidability as Related to Busy Beaver Numbers

The theoretical existence of Busy Beaver numbers provides a new notion for decidability and corresponding heuristic for conjectures. The minimum number of states in which a conjecture can be modeled gives a classification of what logic system can describe said conjecture. In this work, we construct explicit Turing machines that search for a solution to Brocard's problem greater than 7 and a Fermat prime beyond the 4th which halt if and only if such a solution exists.
Read the full abstract

Combinatorics

On the Hilton-Zhao vertex-splitting conjecture

Let $G$ be a simple graph with order $n$, maximum degree $\Delta(G)$, and chromatic index $\chi'(G)$, respectively. A graph $G$ is edge-chromatic critical if $\chi'(H)<\chi'(G)$ for every proper subgraph $H$ of $G$. Assume that $G$ is an $n$-vertex connected regular Class $1$ graph, and let $G^*$ be obtained from $G$ by splitting one vertex into two vertices. Hilton and Zhao in 1997 proposed the vertex-splitting conjecture: if $\Delta(G)>\frac{n}{3}$, then $G^*$ is edge-chromatic critical. Recently, Cao, Chen, and Shan (Discrete Math. 2022) verified the conjecture for $\Delta(G)\ge\frac{3n}{4}$. In this paper, we confirm the conjecture for $\Delta(G) \ge\frac{2n-2}{3}$.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Tests for constancy of model parameters Over time

Suppose that a sequence of data points follows a distribution of a certain parametric form, but that one or more of the underlying parameters may change over time. This paper addresses various natural questions in such a framework. We construct canonical monitoring processes which under the hypothesis of no change converge in distribution to independent Brownian bridges, and use these to construct natural goodness-of-fit statistics. Weighted versions of these are also studied, and optimal weight functions are derived to give maximum local power against alternatives of interest. We also discuss how our results can be used to pinpoint where and what type of changes have occurred, in the event that initial screening tests indicate that such exist. Our unified large-sample methodology is quite general and applies to all regular parametric models, including regression, Markov chains, and time series situations.
Read the full abstract

2605.16335 · 6 May · 23 pages, 3 figures. This is a Statistical Research Report, Department of Mathematics, University of Oslo, from 2001, containing some more material than for the published version, in Journal of Nonparametric Statistics, 2002, vol. 14, pages 113-132. NLH honours Alex Koning (1959-2022) by making these Hjort-Koning methods more visible, via arXiv and other channels

Information Theory

Uniqueness on a Continuum: Quantifying Tonal Ambiguity Using Information Theory

We propose a continuous measure of tonal ambiguity that extends the established concept of uniqueness. While uniqueness is widely regarded as necessary for tonality, it cannot (i) discriminate among sets that possess it, (ii) capture hierarchical organization in modes of limited transposition, or (iii) account for temporal unfolding. To address these limitations, we introduce a companion measure, grounded in information theory, that quantifies tonal ambiguity on a continuous scale. The measure applies across pitch-class sets and tuning systems, expanding analytic coverage of tonal relationships and offering a practical tool for theory and analysis.
Read the full abstract

Differential Geometry

The energy-momentum tensor of the Standard Model with applications to energy conditions

The Standard Model of elementary particle physics is one of the most successful models of contemporary physics, its predictions being in full agreement with experiments. In this manuscript we consider the Lagrangian of the Standard Model as a geometric variational problem on a globally hyperbolic manifold and derive the associated energy-momentum tensor in a geometric invariant way. As an application, we investigate the validity of various energy conditions that arise in general relativity.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Learning the Channel Gain from Anywhere to Anywhere via Cross-environment Transformer Estimators

Channel-gain maps provide the channel gain between any two locations in a geographical region. They find numerous applications, from resource allocation and interference control to path planning for autonomous vehicles. Channel-gain map estimation (CGME) is considerably more challenging than conventional radio map estimation (RME) because channel-gain maps are functions over a 6-dimensional input space. This calls for specialized methods, which currently rely on the (inaccurate) radio tomographic model or require a prohibitively large number of measurements since they do not exploit any spatial structure. This paper overcomes this issue by leveraging spatial patterns that channel-gain maps exhibit across environments, as dictated by the laws of physics and typical environmental characteristics (e.g. building materials and layouts). Adopting a metalearning perspective, a transformer-based estimator is proposed to implicitly learn this common structure from measurements collected in multiple environments. This enables CGME in new environments from significantly fewer measurements (five times less in our experiments). To maximize learning efficiency, the transformer is composed with a feature map that enforces the invariances of CGME, such as those following from reciprocity. Numerical experiments corroborate the merits of the proposed estimator relative to existing methods.
Read the full abstract

Geometric Topology

On extending results of Gluck and Warner on fibrations of spheres by great subspheres

In this paper, we build upon the work of Gluck and Warner who showed in 1983 that the set of positively oriented fibrations of a 3-sphere by oriented great circles is in bijection with the set of distance-decreasing maps from the 2-sphere to itself. One approach to generalizing their result to higher-dimensional spheres involves understanding when exactly two Hopf fibrations of $S^{2n-1}$ are guaranteed to agree on a fiber. We give a complete characterization of this phenomenon, and we discuss the barriers which prevent us from obtaining a fully general version of Gluck and Warner's result.
Read the full abstract

Information Theory

Information-theoretic Limits of Learning and Estimation

Information theory plays a central role in establishing fundamental limits on what any learning or estimation algorithm can – and cannot – achieve, regardless of computational power. In this chapter, we provide an introduction to these connections. End-of-chapter exercises makes the material suitable for both classroom use and self-study. We begin by introducing concentration inequalities along with the notions of covering and packing in metric spaces, and the associated concept of metric entropy. These tools are essential for our analysis. We then introduce the learning-theoretic framework and derive upper bounds on generalization error in terms of metric entropy, Rademacher complexity, and the VC dimension, as well as mutual information and relative entropy. Finally we discuss the minimax estimation framework and establish lower bounds on minimax risk using Fano's inequality, yielding bounds in terms of relative entropy and covering and packing numbers. This manuscript contains preprint of a chapter under consideration for inclusion in the forthcoming third edition of Cover and Thomas's Elements of Information Theory, posted with permission from Wiley. It would follow the chapter posted at arXiv:2605.02989 . The table of contents of the new edition can be found at: https://docs.google.com/document/d/1L-m4oQEJw1PJhoxBeMwrrBD8S_HmvzMEkPbYvS24980/edit?usp=sharing . For feedback, please contact abbas@ee.stanford.edu.
Read the full abstract

General Mathematics

The Taylor Integral and a Generalization of the Discrete Fourier Transform

We propose a new integral based on Taylor measures, study its properties extensively, and we illustrate that it includes many concepts from mathematics as special cases. In particular, the new integral emerges as a generalization of the discrete Fourier transform, and we identify general conditions for it to be invertible when applied to any real or complex sequence. Applications to the mathematical sciences are also presented.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.stat-mech

Emergence of Tsallis Statistics from a Self-Referential Nonlinear Operator: A Variational Framework

We develop a variational thermodynamic framework for statistical systems governed by a self-referential nonlinear operator Omega characterized by structural exponents alpha > 0, beta >= 0, a symmetric kernel K, and a self-coupling constant kappa >= 0. The central object is the self-consistency entropy S[Psi] = -D_KL(Psi || Omega Psi), which vanishes at the fixed points of Omega and serves as a natural Lyapunov functional. Within the local kernel (mean-field) approximation, minimization of the free energy F = U - T S admits the Tsallis q-exponential distribution as an equilibrium state, with the entropic index q = alpha + beta emerging directly from the fixed-point structure of the operator rather than being postulated. The framework yields a consistent thermodynamic description, including a generalized equation of state PV = (2 - q) T, response functions, and a critical temperature associated with spontaneous symmetry breaking. The relation q = alpha + beta connects independently measurable structural exponents of the feedback mechanism to the observed tail index, providing a parameter-free criterion that distinguishes this approach from superstatistics, constrained entropy maximization, and q-deformed formalisms. This work establishes an operator-theoretic foundation for nonextensive statistical mechanics in which nonlinear self-referential feedback naturally generates Tsallis statistics in the mean-field limit.
Read the full abstract

General Mathematics

Linearization Problem for Third-Order ODEs with Four- and Five-Dimensional Lie Symmetry Algebras under Contact Transformations

Using Cartan equivalence method, invariant coframes are constructed for two branches of rank one and zero, which characterize linearizable third-order ODEs under contact transformations with four- and five-dimensional Lie symmetry algebras, respectively. A procedure for deriving the corresponding contact transformations is also presented, along with illustrative examples.
Read the full abstract

All authors Omar A. Abuloha, Marwan Aloqeili, Ahmad Y. Al-Dweik, F. M. Mahomed

Statistics Theory · Cross-listed from econ.TH

An Axiomatic Foundation for Decisions with Counterfactual Utility

Counterfactual utilities evaluate decisions not only by the realized outcome under a given decision, but also by the counterfactual outcomes that would arise under alternative decisions. By generalizing the standard utility framework, they allow decision-makers to encode asymmetric criteria, such as avoiding harm and anticipating regret. Recent work, however, has raised fundamental concerns about the coherence and transitivity of counterfactual utilities. We address these concerns by extending the von Neumann-Morgenstern (vNM) framework to preferences defined on the extended space of all potential outcomes rather than realized outcomes alone. We show that expected counterfactual utility satisfies the vNM axioms on this extended domain, thereby admitting a coherent preference representation. We further examine how counterfactual preferences map onto the realized outcome space through menu-dependent and context-dependent projections. This axiomatic framework reconciles apparent inconsistencies highlighted by the Russian roulette example in the statistics literature and resolves the well-known Allais paradox from behavioral economics. We also derive an additional axiom required to reduce counterfactual utilities to standard utilities on the same potential outcome space, and establish an axiomatic foundation for additive counterfactual utilities, which satisfy a necessary and sufficient condition for point identification. Our results show that the use of asymmetric counterfactual utility functions is coherent regardless of whether individual potential outcomes are deterministic or stochastic, and that a recent proposal involving stochastic potential outcomes leads to ambiguities and inconsistencies.
Read the full abstract

Differential Geometry

Variational reduction of homogenous Lagrangian systems

In this paper we show that a variational reduction procedure can be defined for Lagrangian systems subject to scaling symmetries (i.e. Lagrangian systems defined by a homogenous Lagrangian function), in such a way that the trajectories of the system can be reconstructed up to quadratures from the critical points of the reduced variational principle. Also, we characterize the mentioned critical points in terms of a set of ordinary differential equations which are the scaling analogue of the Lagrange-Poincaré equations. Finally, we study if the homogeneous Lagrangian systems are naturally related or not with the Herglotz variational principle.
Read the full abstract

All authors Javier Fernández, Sergio Grillo, Juan Carlos Marrero, Edith Padrón