Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 16 March

K-Theory and Homology

Equivariant localizing motives and multiplicative norms on algebraic K-theory

We construct multiplicative norms on equivariant nonconnective algebraic $K$-theory for finite groups $G$. We also construct a genuine equivariant version of THH equipped with a Dennis trace map from K-theory compatible with the multiplicative norms. To do so, we follow the general strategy of Blumberg-Gepner-Tabuada in the nonequivariant case by generalizing their category of localizing motives to the genuine equivariant context, building upon the theory of perfect $G$-stable categories of the first-named author. Crucially, we proceed using the recent perspective on noncommutative motives by the second-named author with Sosnilo and Winges which allows us to deal with non-exact functors on this category of motives. Together with an isotropy separation argument for equivariant cubes, we prove our main theorem that norms of stable categories preserve equivariant motivic equivalences. As an immediate consequence, we obtain a unique equivariant multiplicative refinement of nonconnective algebraic $K$-theory. From these constructions and results, we draw several applications, namely: (1) that the endofunctor of (equivariant) tensor powers on ordinary perfect stable categories preserve motivic equivalences; (2) that the multiplicative norms also preserve the additive motivic equivalences, thus yielding a motivic refinement of a result of Elmanto-Haugseng and Cnossen-Haugseng-Lenz-Linskens that connective algebraic K-theory admits multiplicative norms; (3) we construct a genuine equivariant version of topological Hochschild homology equipped with a Dennis trace map that is compatible with multiplicative norms; and (4) we prove that every genuine $G$-spectrum is the K-theory of a perfect $G$-stable category.
Read the full abstract

Optimization and Control

Reachability Analysis for Design Optimization

We present an approach to approximate reachable sets for linear systems with bounded L-infinity controls in finite time. Our first approach investigates the boundaries of these sets and reveals an exact characterization for single-input, planar systems with real, distinct eigenvalues. The second approach leverages convergence of the Lp-norms to L-infinity and uses Lp-norm reachable sets as an approximation of the L-infinity-norm reachable sets. Our optimal control results yield insights that make computational approximations of the Lp-norm reachable sets more tractable, and yield exact characterizations for L-infinity with the previous assumptions on the system. As an example, we incorporate our reachability analysis into the design optimization of a highly-maneuverable aircraft. Introducing constraints based on reachability allow us to factor physical limitations to desired flight maneuvers into the design process.
Read the full abstract

Group Theory

On the first-order genus of wreath products and their central extensions

We prove that groups of the form $\mathbb Z^m {\,\rm wr\,} \mathbb Z^n$, where $m,n \in \mathbb N$, are regularly bi-interpretable with $\mathbb Z$ and therefore are first-order rigid: every finitely generated group elementarily equivalent to $\mathbb Z^m {\,\rm wr\,} \mathbb Z^n$ is isomorphic to $\mathbb Z^m {\,\rm wr\,} \mathbb Z^n$. On the other hand, we show that $\mathbb Z^2 {\,\rm wr\,} \mathbb Z$ admits $2^{\aleph_0}$ elementarily equivalent, pairwise non-isomorphic central extensions with finite kernel.
Read the full abstract

Geometric Topology

Perturbed Alexander Invariants via Quantum Cluster Algebras

We derive a perturbative expansion of knot invariants using quantum cluster algebras. In a recent series of papers, it has been shown that the universal $R$-matrix of $U_q(\mathfrak{g})$, with $\mathfrak{g}$ a Lie algebra of type ADE, can be interpreted as a cluster transformation. For $\mathfrak{g} = \mathfrak{sl}_2$, we show that this interpretation yields a perturbed $R$-matrix. We achieve this by expressing certain representations of quantum cluster algebras in terms of generators of the Weyl-Heisenberg algebra. By inserting an auxiliary parameter $\epsilon$, we derive a perturbed $R$-matrix. With it, we can compute a knot invariant whose zeroth-order term in $\epsilon$ equals $ \Delta_K (T)^{-1}$, the reciprocal of the Alexander polynomial, while higher-order terms in $\epsilon$ give rise to so-called perturbed Alexander invariants. These invariants also appear in perturbative series known by several names in the literature: the Melvin-Morton-Rozansky (MMR) expansion, the large-color expansion, the rational expansion, or the loop expansion. We implement our approach formally in Mathematica and compute explicit examples. Moreover, we argue that the methods developed in this paper should extend beyond the case $\mathfrak g=\mathfrak{sl}_2$.
Read the full abstract

Differential Geometry

Remarks on the structure and integrability of LA-groups

We study the structure of an LA-group identifying its underlying VB-group with a representation up to homotopy. We show that the Lie algebroid structure is determined by a complementary action up to homotopy of the Lie algebra of units. We identify the equations that the representation and the action need to verify in order to assemble into an LA-group, establishing an equivalence between LA-groups and LA-matched pairs. As an application, we catalog some extreme examples of representations and actions and comment on their integrability.
Read the full abstract

Combinatorics

Permanents of random matrices over finite fields

Fix a finite field $\mathbb F_q$ and let $A\in \mathbb F_q^{n\times n}$ be a uniformly random $n\times n$ matrix over $\mathbb F_q$. The asymptotic distribution of the determinant $\det(A)$ is well-understood, but the asymptotic distribution of the permanent $\operatorname{per}(A)$ is still something of a mystery. In this paper we make a first step in this direction, proving that $\operatorname{per}(A)$ is significantly more uniform than $\det(A)$.
Read the full abstract

Group Theory

Classifying Prime Character Degree Graphs With Eight Vertices

In this paper, an effort is made to classify which prime character degree graphs having eight vertices occur for some finite solvable group. To approach this, we compile known results and constructions from the literature which are used to develop a general algorithm to begin classifying graphs of any order. We then apply the algorithm to the graphs of order eight. Of the 12,346 non-isomorphic graphs with eight vertices, 1,229 are disconnected and are fully classified. Meanwhile, thirty-seven of the 11,117 non-isomorphic connected graphs are shown to occur; thirty-four of which are constructed via joins of smaller graphs and three of which have diameter three. Fifty-eight graphs are shown not to occur, several of which fall into previously studied families, while the classification of 204 graphs is still unknown.
Read the full abstract

Information Theory

Low-complexity tuning of pinching-antenna systems for integrated sensing and communication

Pinching antenna systems (PASSs) can dynamically adapt their transmit and receive arrays for sensing and communication in wireless systems. This work explores the potential of PASSs for integrated sensing and communication (ISAC) by proposing a novel PASS-aided ISAC design, in which pinching locations are adaptively adjusted to enable simultaneous sensing and data transmission with minimal interference. The proposed design introduces a bi-partitioning strategy that allocates sensing power and tunes pinching locations with remarkably low computational complexity, allowing dynamic PASS tuning at high update rates. Numerical results demonstrate that the proposed approach achieves a significantly larger sensing-communication rate region compared to baseline designs at no noticeable cost.
Read the full abstract

All authors Saba Asaad, Chongjun Ouyang, Zhiguo Ding, Ali Bereyhi

Combinatorics

On the Possibilities of Defining Infinite Oriented Matroids

Is it possible to define cryptomorphic axiom systems for infinite oriented matroids by lifting some of the axiom systems for finite oriented matroids to the infinite setting while not losing duality in the process? We show that the answer to this question is a twofold "no". First, lifting the circuit axioms neither preserves duality nor inheritance of strong circuit elimination in minors. Second, although duality is kept intact by translating the orthogonality axioms and an axiom system based on the Farkas Lemma, the classes of infinite oriented matroids obtained in this way have the property that one is a proper subclass of the other.
Read the full abstract

Information Theory · Cross-listed from cs.LG

Informationally Compressive Anonymization: Non-Degrading Sensitive Input Protection for Privacy-Preserving Supervised Machine Learning

Modern machine learning systems increasingly rely on sensitive data, creating significant privacy, security, and regulatory risks that existing privacy-preserving machine learning (ppML) techniques, such as Differential Privacy (DP) and Homomorphic Encryption (HE), address only at the cost of degraded performance, increased complexity, or prohibitive computational overhead. This paper introduces Informationally Compressive Anonymization (ICA) and the VEIL architecture, a privacy-preserving ML framework that achieves strong privacy guarantees through architectural and mathematical design rather than noise injection or cryptography. ICA embeds a supervised, multi-objective encoder within a trusted Source Environment to transform raw inputs into low-dimensional, task-aligned latent representations, ensuring that only irreversibly anonymized vectors are exported to untrusted training and inference environments. The paper rigorously proves that these encodings are structurally non-invertible using topological and information-theoretic arguments, showing that inversion is logically impossible, even under idealized attacker assumptions, and that, in realistic deployments, the attacker conditional entropy over the original data diverges, driving reconstruction probability to zero. Unlike prior autoencoder-based ppML approaches, ICA preserves predictive utility by aligning representation learning with downstream supervised objectives, enabling low-latency, high-performance ML without gradient clipping, noise budgets, or encryption at inference time. The VEIL architecture enforces strict trust boundaries, supports scalable multi-region deployment, and naturally aligns with privacy-by-design regulatory frameworks, establishing a new foundation for enterprise ML that is secure, performant, and safe by construction, even in the face of post-quantum threats.
Read the full abstract

Combinatorics

Necklaces, subset sums, and cyclic permutations

It is a well known that, for odd $n$, the number of subsets of $\{1,2,\dots,n\}$ the sum of whose elements is divisible by $n$ equals the number of binary necklaces of length $n$. In this paper generalize this result in two directions. On the one hand, we introduce a parameter $r$ so that requiring the subset sums to be congruent to $r$ modulo $n$ translates into imposing some periodicity conditions on the necklaces. On the other hand, we refine these relations by the size $k$ of the subset, showing that it matches the number of ones in the necklace. We describe the precise conditions on $n$, $k$ and $r$ for which the equalities hold. We also extend some of our formulas to $q$-ary necklaces. The classical results correspond to the case $r=0$. When $r=1$, our identity is related to a conjecture of Baker et al. connecting subsets the sum of whose elements is congruent to $1$ modulo $n$ and unimodal permutations which consist of one cycle. We prove this conjecture using generating functions. Finding bijective proofs of most of our identities remains an open problem.
Read the full abstract

Optimization and Control

Global Stability and Step Size Robustness of RMSProp

In this paper, an input-to-state Lyapunov function for the RMSProp optimization algorithm is introduced. Global asymptotic stability of the RMSProp algorithm for constant step sizes and robustness properties with respect to arbitrary bounded time-varying step size rules are established.
Read the full abstract

All authors Naum Dimitrieski, Maria Christine Honecker, Carsten Scherer, Christian Ebenbauer

Statistics Theory · Cross-listed from stat.ME

On the Equivalence between Neyman Orthogonality and Pathwise Differentiability

It has been frequently observed that Neyman orthogonality, the central device underlying double/debiased machine learning (Chernozhukov et al., 2018), and pathwise differentiability, a cornerstone concept from semiparametric theory, often lead to the same debiased estimators in practice. Despite the widespread adoption of both ideas, the precise nature of this equivalence has remained elusive, with the two concepts having been developed in largely separate traditions. In this work, we revisit the semiparametric framework of van der Laan and Robins (2003) and identify an implicit regularity assumption on the relationship between target and nuisance parameters – a local product structure – that allows us to establish a formal equivalence between Neyman orthogonality and pathwise differentiability. We also show that the two directions of this equivalence impose fundamentally different structural requirements. Finally, we illustrate the theory through three detailed examples of estimating the average treatment effect and expected density in a nonparametric model, as well as the slope in a partially linear model. This helps clarify the relationship between these two foundational frameworks and provides a useful reference for practitioners working at their intersection.
Read the full abstract

Numerical Analysis

Efficient and Accurate Surrogate Modeling of Turbulent Flows via Space-Dependent Aggregation and Reduced Order Models

Reynolds-Averaged Navier-Stokes (RANS) models are widely used for turbulent flow simulations due to their computational efficiency, but their accuracy strongly depends on the selected turbulence closure and may vary across the flow domain. Space-dependent model aggregation has been shown to improve RANS predictions by combining multiple turbulence models, although at the cost of repeated high-fidelity simulations. The first novelty of this work is a unified framework that combines different turbulence models, space-dependent aggregation, and non-intrusive reduced order models to achieve both accuracy and efficiency. Two aggregation pipelines are proposed: a Mixed FOM-ROM (MFR) approach, where a reduced order model is trained on aggregated RANS solutions, and a Mixed-ROM (MR) approach, which directly aggregates multiple reduced order models built on top of different RANS full-order models. The second novelty is that the aggregation weights are learned via a neural-network that provides smooth, space-continuous weights and improves generalization with respect to standard weighting techniques. The resulting surrogate models are validated on the two-dimensional periodic hill benchmark and on the flow over a height-dependent bump, demonstrating improved accuracy over individual RANS and ROM predictions at near real-time computational cost.
Read the full abstract

All authors Piero Zappi, Anna Ivagnes, Niccolò Tonicello, Gianluigi Rozza

Group Theory

A note about Jordan's bound on the size of finite linear groups

In 1878 Camille Jordan showed that every finite subgroup $G\le\text{GL}_n(\mathbb C)$ has an abelian normal subgroup $A$ such that $\lvert G/A\rvert$ is bounded in terms of $n$, but he did not give an explicit bound. An explicit bound was obtained by Blichfeldt in a series of papers beginning in 1904, using representation-theoretic methods. In 1911 Bieberbach gave a geometric proof, which is quite different from the approaches of Jordan and Blichfeldt, together with an explicit bound. Frobenius simplified this proof in the same year, and the resulting argument is still the simplest known. We present a self-contained and streamlined variant of Frobenius's argument, yielding the bound $\lvert G/A\rvert\le25^{n^2}$.
Read the full abstract

Number Theory

On the central derivatives of l-functions and modularity of heenger cycles

This paper establishes an arithmetic intersection formula for central L-derivatives in higher weights.We prove that for a general cusp form (extending the previous result for newforms), the derivative is represented by the global height pairing between higher Heegner cycles. This result provides a framework for the Gross-Zagier-Zhang formula and its generalizations.Furthermore, we investigate the modularity of the generating series of Heegner cycles,proving a weak version of the conjecture and reducing the full modularity to a vanishing conjecture,for which we provide supporting evidence.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Almost-iid information theory

Information-theoretic techniques are based on the assumption that resources are well characterized by independent and identically distributed (iid) states. This assumption cannot be justified operationally, since, for example, correlations between subsequent systems emitted by a source cannot be detected by any practical tomographic protocol. Operationally motivated symmetry assumptions still imply, via de Finetti theorems, that the resources are described by almost-iid states. This raises the question: Are almost-iid resources as effective as perfect iid resources for information-processing tasks? Here we address this question and prove that the conditional entropy of almost-iid states asymptotically coincides with that of iid states. As an application, this implies that squashed entanglement is robust for almost-iid states, asymptotically matching its value on iid states.
Read the full abstract

Probability

On the Uniqueness of Fréchet Means for Polytope Norms

Fréchet means are a popular type of average for non-Euclidean datasets, defined as those points that minimise the average squared distance to a set of data points. We consider the behaviour of sample Fréchet means on normed spaces whose unit ball is a polytope; this setting is particularly important for semi-discrete data, but is rarely covered by existing literature on Fréchet means, which focuses primarily on manifolds and spaces with bounded Alexandrov curvature. We study the geometry of the set of Fréchet means over polytope normed spaces, with a focus on dimension and probabilistic conditions for uniqueness. In particular, we provide a geometric characterisation of the threshold sample size at which Fréchet means have a positive probability of being unique, and we prove that this threshold is at most one more than the dimension of our space. This geometric characterisation presents a novel framework for computing the unique Fréchet mean sample threshold, which we demonstrate in the case of the $\ell_1$, $\ell_{\infty}$ and tropical norms. In particular, we show that the $\ell_1$ sample threshold is always 3, but the $\ell_{\infty}$ and tropical sample thresholds grow at different rates with the dimension of our space.
Read the full abstract

Information Theory

Multi-objective Optimization for Over-the-Air Federated Edge Learning-enabled Collaborative Integrated Sensing and Communications

This paper introduces a novel multi-objective integrated sensing and communications (ISAC) framework to enable collaborative wireless sensing in conjunction with over-the-air federated-edge learning (OTA-FEEL). The framework enables multi-task OTA aggregation to handle sensing and learning simultaneously, while benefiting from dual-purpose uplink signals for both communications and target sensing. Starting from characterizing the local sufficient statistics at each edge device and establishing its stationary, we develop a tractable analytical expression for the local sufficient statistics. To suppress the interference from uplink transmissions of other devices through matched filtering, we then propose a novel orthogonal pulse shaping method. Then, we derive the optimal unbiased estimate of the target's coordinates by casting the centralized problem of joint likelihood function maximization of all devices as the distributed likelihood maximization of each device (which requires only local sufficient statistics). A lower bound on the sensing error variance is then characterized using the Cramer-Rao bound (CRB). We then formulate a multi-objective optimization (MOOP) problem to minimize the mean square error (MSE) and sensing error bound simultaneously. The considered problem is then solved using the epsilon-constrained method. Numerical results demonstrate that the proposed dual-purpose OTA-FEEL-enabled collaborative ISAC framework enhances sensing accuracy without adversely affecting the performance of the primary OTA-FEEL task. While conventional single-shot collaborative sensing schemes are limited by the average error of local estimators, the proposed algorithm achieves the CRB of the considered problem.
Read the full abstract

Geometric Topology

Counting and entropy for hyperbolic surface amalgams

This paper is about closed hyperbolic surface amalgams with a focus on the growth of the number of closed geodesics. As in the case of surfaces, we show that topological and volume entropies coincide, but we show stark differences in how they behave according to geometric data with upper and lower bounds on the number of closed geodesics which depend on the length of the systole and the length of the pasting curves. In particular, we show that the entropy can increase exponentially in terms of the pasting length in the absence of a lower bound on the systole.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Formalization of QFT

A foundational result in constructive quantum field theory is the construction of the free bosonic quantum field theory in four-dimensional Euclidean spacetime and the proof that it satisfies the Glimm-Jaffe axioms, a variant of the Osterwalder-Schrader axioms. We present a formalization of this result in the Lean 4 interactive theorem prover. The project is intended as a proof of concept that extended arguments in mathematical physics can be translated into machine-checked proofs using existing AI tools. We begin by introducing interactive theorem proving and constructive quantum field theory, then describe our formalization and the design decisions that shaped it. We also explain the methods we used, including coding assistants, and conclude by considering how AI assisted formalization may influence the future of theoretical physics. Our original release assumed three results, Minlos' theorem, the nuclear property of Schwartz space, and Goursat's theorem. In subsequent releases from our group and from contributors from the Lean community, these assumptions have been proven (or avoided), so that the OS/GJ axioms are now proven using only Lean and its library Mathlib.
Read the full abstract

All authors Michael R. Douglas, Sarah Hoback, Anna Mei, Ron Nissim

Dynamical Systems

Asymmetry of a class of Mellin transforms

We consider a class of Mellin transforms $\mu_\eta$ associated with a class of functions $\eta$, defined for every complex $s$ in the critical strip. We establish sufficient conditions on $\eta$ under which $\mu_\eta(s)$ and $\mu_\eta(1-s)$ cannot both vanish outside the critical line for sufficiently large imaginary parts of $s$. An application is given to the case in which $\eta$ is the fractional part function, for which the zeros of $\mu_\eta$ coincide with the zeros of the Riemann zeta function.
Read the full abstract

Complex Variables

Quasiconformal Normalization of Random Meromorphic Functions

We study the conformal type of surfaces spread over the sphere via random quasiconformal maps. Constructing a random Beltrami coefficient on the complex plane, we obtain a locally quasiconformal homeomorphism with prescribed dilatation that is almost surely surjective and, with high probability, approximately linear. This yields a normalization for random meromorphic functions associated to surfaces spread over the sphere, from which we prove that the surfaces are almost surely parabolic and obtain bounds on the growth order of their Nevanlinna characteristic.
Read the full abstract

Number Theory

The Mean field equation on the Tate curve

In this paper, we study the spectrum of the Laplacian on the Tate curve and construct the associated Green's function as a finite sum, which can be viewed as the non-Archimedean counterpart of the Green's function on the flat torus in the Archimedean case. Moreover, we establish existence and uniqueness results of the mean field equation on this space. To address the problem, we first prove the structure of solutions on finite quotients, and prove the existence on the Tate curve by the convergence of such solutions. We also prove the uniqueness of the solutions for some parameter region. Notably, the well-posedness of the solution resembles that in the Archimedean case.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Schrödinger-picture formulation of a scalar quantum field driven by white noise

We develop a Schrödinger-picture formulation for a scalar quantum field driven by a Lorentz-invariant white-noise field. The quantum state of the system is described by a stochastic wave functional that evolves according to a stochastic Schrödinger equation. We show that the Gaussian structure of the wave functional is preserved under the stochastic evolution, allowing the dynamics to be reduced to a set of equations for the corresponding kernel functions. These kernel equations are derived and solved exactly, yielding an explicit time-dependent expression for the wave functional. The exact solution enables a direct analysis of the statistical properties of the quantum field in the space of field configurations. In particular, we show that the expectation value of the field operator obeys the same stochastic equation as the classical field obtained from the Euler-Lagrange equation of the action. We further compute the energy density from the stochastic wave functional and evaluate its ensemble average over noise realizations. The resulting energy production rate coincides with that obtained from the corresponding Lindblad equation. This result indicates that the stochastic quantum state remains well defined even though certain derived observables exhibit ultraviolet divergences associated with the white-noise idealization.
Read the full abstract

General Mathematics

Natural Orderings of Triangle Centers

Triangle centers are usually studied individually or through special geometric relationships, but little attention has been given to global structure among them. In this paper we introduce several natural ways to order triangle centers, including the isosceles order, vertex order, side order, and trace order. These partial orders compare centers by their relative positions in families of triangles, such as acute triangles with a fixed shortest side. Using barycentric coordinates and symbolic computation, we determine ordering relations among many of the first 100 triangle centers listed in Kimberling's Encyclopedia of Triangle Centers. The results reveal surprising structural patterns and suggest new ways to organize and study triangle centers. For example, in an acute triangle $ABC$, with shortest side $BC$, the Gergonne point is always closer to side $BC$ than the nine-point center.
Read the full abstract

Logic

Direct powers, ultrapowers and cumulative powers

In this paper we investigate cumulative direct powers of functions on structures, or cumulative powers, and study their properties. Particularly, we show how they extend the preservation phenomena of reduced powers, direct powers and ultrapowers by offering a characterization of the fragment of first-order theory it preserves, and elucidate the connections between the three sorts of constructions. More precisely, we show how both direct powers and ultrapowers may be obtained from cumulative powers as quotients by appropriate equivalence relations. We further offer a construction of Conway's surreal field by using direct limits of hierarchies of ultrapowers.
Read the full abstract

Optimization and Control

Saddle Point Evasion via Curvature-Regularized Gradient Dynamics

Nonconvex optimization underlies many modern machine learning and control tasks, where saddle points pose the dominant obstacle to reliable convergence in high-dimensional settings. Escaping these saddle points deterministically using continuous-time optimization remains an open challenge: gradient descent is blind to curvature, stochastic perturbation methods lack deterministic guarantees, and Newton-type approaches suffer from Hessian singularity. Adopting the perspective of viewing optimization algorithms as dynamical systems, we present Curvature-Regularized Gradient Dynamics (CRGD), which augments the objective with a smooth penalty on the negative Hessian eigenvalues, yielding an augmented cost that serves as an optimization Lyapunov function with user-selectable convergence rates to second-order stationary points. Numerical experiments confirm that CRGD converges to second-order stationary points, even in regimes where gradient descent fails.
Read the full abstract

All authors Liraz Mudrik, Isaac Kaminer, Sean Kragelund, Abram H. Clark

Mathematical Physics

Ruijsenaars-van Diejen-Takemura Hamiltonians as rational Heun operators

The most general Ruijsenaars-van Diejen-Takemura Hamiltonians are characterized as Heun operators defined as second order $q$-difference operators with a raising action on elementary rational functions with poles on the Askey-Wilson grid.