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 26 February

Commutative Algebra

Multiprojective Geometry of Compatible Triples of Fundamental and Essential Matrices

We characterize the variety of compatible fundamental matrix triples by computing its multidegree and multihomogeneous vanishing ideal. This answers the first interesting case of a question recently posed by Bråtelund and Rydell. Our result improves upon previously discovered sets of algebraic constraints in the geometric computer vision literature, which are all incomplete (as they do not generate the vanishing ideal) and sometimes make restrictive assumptions about how a matrix triple should be scaled. Our discussion touches more broadly on generalized compatibility varieties, whose multihomogeneous vanishing ideals are much less well understood. One of our key new discoveries is a simple set of quartic constraints vanishing on compatible fundamental matrix triples. These quartics are also significant in the setting of essential matrices: together with some previously known constraints, we show that they locally cut out the variety of compatible essential matrix triples.
Read the full abstract

All authors Timothy Duff, Viktor Korotynskiy, Anton Leykin, Tomas Pajdla

Numerical Analysis

A Novel Aggregated SIR Model for Spatial Epidemic Propagation

We propose an extension of the classical susceptible infectious recovered (SIR) model that incorporates the effects of spatial propagation of an epidemic through a small number of additional compartments. The model is designed to capture the dynamics of disease spread across multiple interconnected cities or populated regions, while avoiding the high dimensionality and large parameter sets typical of network based or agent-based approaches. Instead of explicitly modeling individual locations or mobility networks, we introduce aggregate variables that describe whether the epidemic has not yet reached, is currently active in, or has already passed through different regions of the spatial domain. This formulation allows the model to reproduce key qualitative features observed in aggregated incidence data, such as prolonged plateaus and multiple infection waves arising from asynchronous local outbreaks. The resulting system consists of ordinary differential equations with a relatively small number of interpretable parameters, providing a tractable framework for analytical investigation and numerical simulation. Our approach offers a parsimonious alternative for studying spatially structured epidemic dynamics when only aggregated data are available or when model simplicity is essential.
Read the full abstract

Optimization and Control

Generalized Stochastic Gradient Descent with Momentum Methods for Smooth Optimization

Stochastic gradient descent with momentum (SGDM) methods have become fundamental optimization tools in machine learning, combining the computational efficiency of stochastic gradients with the acceleration benefits of momentum. Despite their widespread use in practice, the theoretical understanding of SGDM remains incomplete, with most existing analyses focusing on specific momentum schemes or requiring restrictive assumptions. In this paper, we introduce a generalized SGDM framework that unifies a broad class of momentum-based methods, including SGD with Polyak's momentum, SGD with Nesterov's momentum, and many others. We provide comprehensive convergence analyses for both convex and nonconvex optimization problems under mild smoothness and bounded variance assumptions. For convex problems, we establish general ergodic convergence results with constant parameters and derive improved iterate convergence rates with time-varying parameters. For nonconvex problems, we prove sublinear convergence to stationary points and establish linear convergence to a neighborhood of the optimum under the Polyak–Łojasiewicz condition. Notably, our analysis allows flexible parameter choices and thus provides convergence guarantees for many existing momentum methods as special cases.
Read the full abstract

Geometric Topology

On mutation invariance in Khovanov homology

We show that reduced Khovanov homology over any field is invariant under component-preserving Conway mutation. Our proof relies on strong geography restrictions for a certain Khovanov multicurve invariant associated with Conway tangles that we introduced in previous work [arXiv:1910.14584]. Applying ideas from homological mirror symmetry, we give a full classification of the components of this invariant.
Read the full abstract

Dynamical Systems · Cross-listed from cs.SI

Learning dynamics from online-offline systems of LLM agents

Online information is increasingly linked to real-world instability, especially as automated accounts and LLM-based agents help spread and amplify news. In this work, we study how information spreads on networks of Large Language Models (LLMs) using mathematical models. We investigate how different types of offline events, along with the "personalities" assigned to the LLMs, affect the network dynamics of online information spread of the events among the LLMs. We introduce two models: 1) a stochastic agent-based network model and 2) a system of differential equations arising from a mean-field approximation to the agent-based model. We fit these models to simulations of the spread of armed-conflict news on social media, using LLM agents each with one of 32 personality trait profiles on k-regular random networks. Our results indicate that, despite the complexity of the news events, personalities, and LLM behaviors, the overall dynamics of the system are well described by a Susceptible-Infected (SI) type model with two transmission rates.
Read the full abstract

All authors Moyi Tian, George Mohler, P. Jeffrey Brantingham, Nancy Rodríguez

General Mathematics

The Dynamical Landscape of Beggar-My-Neighbour: Ultra-long Matches, Loops, and Infinite Matches

We present a rigorous mathematical and computational analysis of the deterministic card game Beggar-My-Neighbour. By establishing a formal state-space framework, we investigate the game's dynamical landscape, focussing on the dichotomy between terminating and non-terminating matches. Extensive numerical simulations reveal that the distribution of finite match durations approximates an exponential decay, with relevant deviations, confirming an emergent memory-less dynamics. This statistical behaviour is further analysed in the context of ultra-long matches, where we identify characteristic multi-scale oscillatory patterns and entropic regimes. Theoretically, we address the problem of backwards determinism, formalising the lack of injectivity of the trick function even within the set of reachable states. Crucially, we contribute to the recent resolution of the long-standing question regarding the existence of infinite games. We introduce an automated `Infinite Loop Factory' algorithm which, by implementing adaptive insertion strategies, proves effective in identifying non-terminating cycles with balanced initial deck configurations, thereby confirming the existence of non-terminating dynamics in standard and generalised settings of the game.
Read the full abstract

All authors Nicolas Andorno, Giulio Cernoia, Simone Duiz, Alessandro Michelangeli

Combinatorics

Independent mutual-visibility sets and distance edge-critical graphs

In this paper, connections between independent sets and the variety of mutual-visibility sets are studied. It is proved that every outer mutual-visibility set of a graph is independent if and only if the graph is distance edge-critical. Several constructions yielding distance edge-critical graphs are given. Graphs in which every independent set is a total mutual-visibility or a dual mutual-visibility set are characterized, as well as graphs in which every total mutual-visibility set is independent. Along the way the total mutual-visibility number of some graphs derived from fullerenes is determined. Graphs in which every independent set is a mutual-visibility set are discussed and characterized over diameter four graphs. It is proved that determining the maximum cardinality of an independent mutual-visibility set and deciding whether it equals the independence number of a graph are NP-hard problems, and the same is true for independent total, outer and dual mutual-visibility sets.
Read the full abstract

Analysis of PDEs

Soliton resolution for the energy-critical nonlinear Ginzburg-Landau equation in the radial case

We study the the energy critical non-linear Ginzburg-Landau equation $\partial_{t} u =z\Delta u+z|u|^{\frac{4}{D-2}} u$ with $\Re z >0$ in dimension $D\geq 3$. We prove that every radial solution with finite energy norm resolves into a finite superposition of asymptotically decoupled copies of the ground state and free radiation continuously in time.
Read the full abstract

Mathematical Physics

Stark localization of interacting particles

We consider N interacting quantum particles on a one-dimensional lattice, and subjected to an external linear potential. For N = 1, the corresponding Hamiltonian is explicitly diagonalizable, with superexponentially localized eigenstates. This is called Stark localization. We prove that superexponential spectral localization persists for arbitrary N and every interaction strength.
Read the full abstract

All authors Wojciech De Roeck, Amirali Hannani, Alessio Lerose, Nathan Vandenbosch

Functional Analysis

A strengthening of the dimensional Brunn-Minkowski conjecture implies the (B)-conjecture

We prove that if a sufficiently regular even log-concave measure satisfies a certain stronger form of the dimensional Brunn-Minkowski conjecture, then it also satisfies the (B)-conjecture. Furthermore, we show that hereditarily convex measures satisfy the aforementioned strengthened form, therefore providing an alternative proof of a recent result by Cordero-Erausquin and Eskenazis stating that a hereditarily convex measure satisfies both conjectures.
Read the full abstract

Combinatorics

Cyclic sieving for a class of rectangular domino tableaux

The cyclic sieving phenomenon (CSP) provides valuable data about symmetry classes of cyclic actions, and has applications to representation theory. In this paper, we enumerate domino tableaux of shape 2-by-n, and use this result to prove a new CSP on these objects. We then enumerate the rectangular domino tableaux of any dimensions, and conjecture a more general CSP on rectangular domino tableaux. As a consequence of the enumerative results, we obtain several identities involving Fibonacci and Catalan numbers.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Mean Estimation from Coarse Data: Characterizations and Efficient Algorithms

Coarse data arise when learners observe only partial information about samples; namely, a set containing the sample rather than its exact value. This occurs naturally through measurement rounding, sensor limitations, and lag in economic systems. We study Gaussian mean estimation from coarse data, where each true sample $x$ is drawn from a $d$-dimensional Gaussian distribution with identity covariance, but is revealed only through the set of a partition containing $x$. When the coarse samples, roughly speaking, have “low” information, the mean cannot be uniquely recovered from observed samples (i.e., the problem is not identifiable). Recent work by Fotakis, Kalavasis, Kontonis, and Tzamos [FKKT21] established that sample-efficient mean estimation is possible when the unknown mean is identifiable and the partition consists of only convex sets. Moreover, they showed that without convexity, mean estimation becomes NP-hard. However, two fundamental questions remained open: (1) When is the mean identifiable under convex partitions? (2) Is computationally efficient estimation possible under identifiability and convex partitions? This work resolves both questions. [...]
Read the full abstract

All authors Alkis Kalavasis, Anay Mehrotra, Manolis Zampetakis, Felix Zhou, Ziyu Zhu

Logic

Combinatorial Properties of the Raisonnier Filter

The Raisonnier filter is a combinatorial object isolated by Jean Raisonnier in order to simplify Shelah's proof that if all $\mathbf{\Sigma}^1_3$ sets are Lebesgue-measurable then there is an inner model with an inaccessible cardinal. In this paper, we study the combinatorics of a general version of the Raisonnier filter, with an eye to potential applications in descriptive set theory. We prove various results about the Raisonnier Filter generated by simple sets, and we study the ideals associated to the Raisonnier Filter being rapid and/or unbounded, connecting it to the null-additive and meagre-additive ideals studied by Pawlikowski and Shelah. Among the more interesting results is a converse to Raisonnier's theorem which indicates that Raisonnier's technique is unlikely to lead to similar results for other regularity properties. We also draw some conclusions regarding the Borel and dual Borel Conjectures.
Read the full abstract

Probability

Spin Glass Concepts in Computer Science, Statistics, and Learning

Spin glass theory studies the structure of sublevel sets and minima (or near-minima) of certain classes of random functions in high dimension. Near-minima of random functions also play an important role in high-dimensional statistics and statistical learning, where minimizing the empirical risk (which is a random function of the model parameters) is the method of choice for learning a statistical model from noisy data. Finally, near-minima of random functions are obviously central to average-case analysis of optimization algorithms. Computer science, statistics, and machine learning naturally lead to questions that are traditionally not addressed within physics and mathematical physics. I will try to explain how ideas from spin glass theory have seeded recent developments in these fields. (This article was written on the occasion of the 2024 Abel Prize to Michel Talagrand.)
Read the full abstract

Combinatorics

Spanning tight components in 4-uniform hypergraphs

We prove that every $n$-vertex 4-uniform hypergraph with minimum codegree at least $\lfloor n/4 \rfloor$ has a spanning tight component. This is tight, and it settles the 4-uniform case of a conjecture of Illingworth, Lang, Müyesser, Parczyk, and Sgueglia.
Read the full abstract

All authors Francesco Di Braccio, Brian Hearn, Joanna Lada, Mihir Neve, Lu-Ming Zhang

Optimization and Control

Modeling Large-Scale Adversarial Swarm Engagements using Optimal Control

We study optimal control of large-scale autonomous systems under adversarial conditions in which agents may be probabilistically destroyed during an engagement. Because attrition changes the population that generates the spatial interaction dynamics, treating survival and motion independently can produce physically inconsistent solutions. We formulate a stochastic variable-population benchmark and examine three deterministic approximations that propagate agent survival probabilities from relative geometry. The models are applied to defense of a high-value unit against an attacking swarm and solved using direct optimal-control methods. Monte Carlo realizations of the stochastic benchmark show that deterministic models can reproduce engagement outcomes when attrition is coupled to spatial influence, whereas a decoupled formulation can exploit effectively destroyed defenders that continue to repel attackers, a failure mode we term “ghost herding.” Large-scale simulations and defender-number sweeps further show that this modeling choice can substantially alter predicted high-value-unit survival and inferred defensive resource requirements. The results provide a tractable framework for attrition-aware trajectory optimization and resource–survival analysis in adversarial autonomous systems.
Read the full abstract

All authors Claire Walton, Isaac Kaminer, Qi Gong, Abram H. Clark, Theodoros Tsatsanifos

Metric Geometry

The metric fundamental class of non-orientable manifolds and manifolds with boundary

We introduce the metric fundamental class for metric spaces that are homeomorphic to compact, non-orientable, smooth manifolds with (possibly empty) boundary. This is an integer rectifiable current that provides an analytic representation of the topological fundamental class of the space. Under certain weak geometric conditions, we show the existence of such a current, extending earlier results for orientable, closed manifolds obtained in collaboration with Basso and Wenger. As an application, we present new rectifiability results.
Read the full abstract

Dynamical Systems

Lyapunov exponents for random products of non-negative matrices

We first study i.i.d. products of finitely many invertible $2 \times 2$ matrices with positive entries, and prove that the top Lyapunov exponent admits an explicit, rapidly convergent Neumann-series-type representation involving an infinite matrix. We further show that non-negative invertible $2 \times 2$ matrices are simultaneously conjugate to positive matrices if and only if “generalized” heteroclinic connections do not occur among products of length at most $2$. These results yield a series formula for the Hausdorff dimension of the intersection of the middle-$n$th Cantor set with a random translate of itself, for every natural number $n$ except $4$. Furthermore, our method applies to the intersection of thick Cantor sets under random translation. We also determine the almost sure growth rate of i.i.d. three-term recurrences with finitely many positive coefficients.
Read the full abstract

Logic · Cross-listed from cs.AI

The logic of KM belief update is contained in the logic of AGM belief revision

For each axiom of KM belief update we provide a corresponding axiom in a modal logic containing three modal operators: a unimodal belief operator $B$, a bimodal conditional operator $>$ and the unimodal necessity operator $\square$. We then compare the resulting logic to the similar logic obtained from converting the AGM axioms of belief revision into modal axioms and show that the latter contains the former. Denoting the latter by $\mathcal L_{AGM}$ and the former by $\mathcal L_{KM}$ we show that every axiom of $\mathcal L_{KM}$ is a theorem of $\mathcal L_{AGM}$. Thus AGM belief revision can be seen as a special case of KM belief update. For the strong version of KM belief update we show that the difference between $\mathcal L_{KM}$ and $\mathcal L_{AGM}$ can be narrowed down to a single axiom, which deals exclusively with unsurprising information, that is, with formulas that were not initially disbelieved.
Read the full abstract

Combinatorics

Building with Blocks: Enumerating Polyforms on Tilings

In areas as diverse as contemporary art, play structures, climbing equipment, and modular construction toys, we see the presence of building block-like polyhedral complexes, which are generalizations of the pieces in the game Tetris. We give an algorithm for counting the number of $n$-celled structures on polygonal and polyhedral cells of certain periodic two- and three-dimensional tilings; moreover, we count these structures up to translations, rotations, and reflections of the tiling. We describe this algorithm with respect to structures in the snub square tiling, provide numerical data related to existing three-dimensional art and structures, and suggest puzzles based on these constructions.
Read the full abstract

All authors Bert Dobbelaere, Peter Kagey, Drake Thomas, Andrés R. Vindas-Meléndez

Statistics Theory · Cross-listed from stat.ME

Identifiability of Treatment Effects with Unobserved Spatially Varying Confounders

The study of causal effects in the presence of unmeasured spatially varying confounders has garnered increasing attention. However, a general framework for identifiability, which is critical for reliable causal inference from observational data, has yet to be advanced. In this paper, we study a linear model with various parametric model assumptions on the covariance structure between the unmeasured confounder and the exposure of interest. We establish identifiability of the treatment effect for many commonly 20 used spatial models for both discrete and continuous data, under mild conditions on the structure of observation locations and the exposure-confounder association. We also emphasize models or scenarios where identifiability may not hold, under which statistical inference should be conducted with caution.
Read the full abstract

Combinatorics

Largest Sidon subsets in weak Sidon sets

A finite set $ S \subset \mathbb{R} $ is called a Sidon set if all sums $ x+y $ with $ x,y \in S $ and $ x \le y $ are distinct, and a weak Sidon set if all sums $ x+y $ with $ x,y \in S $ and $ x < y $ are distinct. For a finite set $ A \subset \mathbb{R} $, let $ h(A) $ denote the maximum size of a Sidon subset of $ A $, and define $$ g(n) := \min\{\, h(A) : A \subset \mathbb{R},\ |A| = n,\ A \text{ is a weak Sidon set} \,\}. $$ Sárközy and Sós asked whether the limit $ \lim_{n\to\infty} g(n)/n $ exists and, if so, to determine its value. We resolve this problem completely by determining $g(n)$ exactly: $$ g(n)=\left\lceil \frac{n+1}{2}\right\rceil \qquad\text{for all } n\ge 1. $$ In particular, $\lim_{n\to\infty} g(n)/n=\frac12$. We also investigate a related problem of Erdős concerning a local difference condition. A finite set $ A \subset \mathbb{R} $ is called a $(4,5)$-set if every $4$-element subset of $A$ determines at least five distinct values among its six pairwise absolute differences. Erdős asked for the optimal constant $ c_* > 0 $ such that every $(4,5)$-set of size $ n $ contains a Sidon subset of size at least $ c_* n $. Gyárfás and Lehel reduced this to an extremal problem of $3$-uniform hypergraphs and proved $\frac{1}{2} + \frac{1}{141 \cdot 76} \le c_* \le \frac{3}{5}$. We improve both bounds by establishing $$ \frac{9}{17} \le c_* \le \frac{4}{7}, $$ where the lower bound uses a reformulation of the extremal problem, and the upper bound follows from an explicit construction together with a convenient characterization of $c_*$.
Read the full abstract

Geometric Topology

Cusped spaces for hierarchically hyperbolic groups, and applications to Dehn filling quotients

We introduce a construction that simultaneously yields cusped spaces of relatively hyperbolic groups, and spaces quasi-isometric to Teichmueller metrics. We use this to study Dehn-filling-like quotients of various groups, among which mapping class groups of punctured spheres. In particular, we show that the mapping class group of a five-holed sphere (resp. the braid group on four strands) has infinite hyperbolic quotients (strongly) not isomorphic to hyperbolic quotients of any other given sphere mapping class group (resp. any other braid group). These quotients are obtained by modding out suitable large powers of Dehn twists, and we further argue that the corresponding quotients of the extended mapping class group have trivial outer automorphism groups. We obtain these results by studying torsion elements in the relevant quotients.
Read the full abstract

Dynamical Systems

Tameness, nullness, and amorphic complexity of automatic systems

In topological dynamics, tame and null systems arise naturally in the study of low-complexity aperiodic behaviour, yet providing concrete and easily testable conditions to establish their existence in a canonical class of systems is often nontrivial. We give a complete characterisation of tameness and nullness for minimal automatic systems generated by primitive constant length substitutions in terms of amorphic complexity – a numerical invariant recently introduced to study zero entropy systems. We derive an easily computable closed formula for this invariant in this setting and show that, for infinite automatic systems, tameness and nullness are equivalent to its value being one.
Read the full abstract

Dynamical Systems

On limit sets and equicontinuity in the hyperspace of continua in dimension one

The paper studies the structure of $\omega$-limit sets of map $\tilde{f}$ induced on the hyperspace $C(G)$ of all connected compact sets, by dynamical system $(G,f)$ acting on a topological graph $G$. In the case of the base space being a topological tree we additionally show that $\tilde{f}$ is always almost equicontinuous and characterize its Birkhoff center.
Read the full abstract

Optimization and Control

Efficient Interior-Point Methods for Hyperbolic Programming via Straight-Line Programs

Hyperbolic (HB) programming generalizes many popular convex optimization problems, including semidefinite and second-order cone programming. Despite substantial theoretical progress on HB programming, efficient computational tools for solving large-scale hyperbolic programs remain limited. This paper presents DDS 3.0, a new release of the Domain-Driven Solver, which provides an efficient interior-point implementation tailored for hyperbolic programming. A key innovation lies in a new straight-line program (SLP) representation that enables compact representation and efficient computation of hyperbolic polynomials, their gradients, and Hessians. The SLP structure significantly reduces computational cost, allowing the Hessian to be computed in the same asymptotic complexity as the gradient through a batched reverse-over-forward differentiation scheme. We further introduce an improved corrector step for the primal-dual interior-point method, enhancing stability and convergence on convex sets where only the primal self-concordant barrier is efficiently computable. We create a comprehensive benchmark library beyond the elementary symmetric polynomials, using several different techniques. Numerical experiments demonstrate substantial performance gains of DDS 3.0 compared to first-order Frank-Wolfe algorithm, homotopy method, and SDP software utilizing SDP relaxations.
Read the full abstract

Logic

Distality in Ordered Abelian Groups

We provide a characterization of distal ordered abelian groups: An ordered abelian group is distal if and only if, for each prime number $p$, the sizes of ribs with respect to the "valuation" $\mathfrak{s}_p$ are uniformly bounded. This generalizes the distality criterion for ordered abelian groups with finite spines given by Aschenbrenner, Chernikov, Gehret, and Ziegler. Furthermore, we prove that every ordered abelian group has a distal expansion, affirmatively answering a conjecture posed by the same authors.
Read the full abstract

Information Theory · Cross-listed from eess.SP

A Scaling Law for Bandwidth Under Quantization

We derive a scaling law relating ADC bit depth to effective bandwidth for signals with $1/f^\alpha$ power spectra. Quantization introduces a flat noise floor whose intersection with the declining signal spectrum defines an effective cutoff frequency $f_c$. We show that each additional bit extends this cutoff by a factor of $2^{2/\alpha}$, approximately doubling bandwidth per bit for $\alpha = 2$. The law requires that quantization noise be approximately white, a condition whose minimum bit depth $N_{\min}$ we show to be $\alpha$-dependent. Validation on synthetic $1/f^\alpha$ signals for $\alpha \in \{1.5, 2.0, 2.5\}$ yields prediction errors below 3% using the theoretical noise floor $\Delta^2/(6f_s)$, and approximately 14% when the noise floor is estimated empirically from the quantized signal's spectrum. We illustrate practical implications on real EEG data.
Read the full abstract

Algebraic Geometry

Toric schemes and integral models for Shimura varieties with $\Gamma_1(p)$-type level

We propose a conjectural theory of $p$-integral models of Shimura varieties with level structure at $p$ given by a class of normal subgroups of parahoric subgroups with abelian quotient group. The role of the theory of local models is played in this context by a certain root stack over the local model for parahoric level. The construction of this root stack is based on the "divisor theorem" (a foundational fact about local models) and on the theory of toric varieties in this context, both of which are of independent interest. We prove our conjecture in the case of Shimura varieties of PEL type when the parahoric is an Iwahori (under some additional conditions).
Read the full abstract

Functional Analysis

A unified approach to compression-expansion fixed point theorems for operators systems and applications

In this paper, we present some fixed point theorems for operator systems in the line of Krasnosel'skii's theorem in cones. The cone-compression and cone-expansion type conditions are imposed in a component-wise manner. Unlike related results in the literature, the operators are allowed to be defined in the Cartesian product of conical regions delimited by nonconvex sets. Our approach, based on the fixed point index, ensures the existence of a coexistence fixed point–that is, one with nontrivial components. As a first application, we establish several localization results for systems of integral equations between strictly star-shaped sets defined by functionals. These results cannot be derived solely from previous studies dealing with operators in annular regions. A second application concerns nonlinear systems involving the {\Phi}-Laplacian.
Read the full abstract