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)

Monday 11 May

Information Theory

A Fast Hierarchical Splitting Approach for Non-Adaptive Learning of Random Hypergraphs

This work focuses on the problem of learning an unknown $3$-uniform hypergraph using edge-detecting queries. Our goal is to design a querying strategy that recovers the hyperedge set using as few queries as possible. We restrict our attention to random hypergraphs under the Erdős–Rényi (ER) model, in which each potential hyperedge appears independently with probability $q = \Theta(n^{-3(1-\theta)})$ for $\theta \in (0;1)$. Prior work [Austhof-Reyzin-Tani, ISIT 2025] presents a testing-decoding scheme that uses $O(\bar{m}\log n)$ tests but requires a decoding time of $\Omega(n^3)$, where $\bar{m} = q\binom{n}{3}$ denotes the expected number of hyperedges. In this work, we extend the binary splitting framework and adapt it to the $3$-uniform hypergraph setting. We obtain a testing-decoding scheme that recovers the hyperedge set with high probability using $O(\bar{m} \log n)$ tests and achieves decoding time $O(\bar{m}^{5/3}\log n)$ for the case $\theta > \dfrac{2}{3}$ and $O(\bar{m}^{5/3}\log^2{\bar{m}}\log n)$ for the case $\theta \leq \dfrac{2}{3}$. In particular, the decoding runtime is subcubic in $n$ whenever $\theta<\frac{3}{5}$, providing a new test-decoding tradeoff compared with existing schemes.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Consolidation-Expansion Operator Mechanics:A Unified Framework for Adaptive Learning

Every adaptive learning system must alternate between two operations: consolidating what it already knows and expanding into new evidence. We propose Consolidation-Expansion Operator Mechanics (OpMech), a framework that makes this structure precise. The central object is the order-gap $\Ogap(\theta; e)$, the degree to which a consolidation operator~$Q$ and an expansion operator~$P_e$ fail to commute at a given knowledge state. Because the order-gap is computable from the system's own trajectory, it serves as a real-time control signal: large values indicate that the system is still sensitive to the ordering of consolidation and expansion; once the order-gap falls and stays small, further processing is unlikely to change the outcome. Three results give the signal precise meaning: the order-gap decays along convergent trajectories; a persistently large order-gap implies the system is far from its settled state; and an order-gap-based stopping rule terminates with provable guarantees in both noiseless and bounded-noise settings. The framework applies across five domains: bandits, reinforcement learning, stochastic optimization, continual learning, and recursive language models. We give conditions under which the order-gap reliably tracks convergence in three representative cases. We develop the recursive language model application in detail, showing how OpMech replaces heuristic stopping rules and fixed recursion budgets with principled, evidence-driven alternatives.
Read the full abstract

Numerical Analysis · Cross-listed from physics.geo-ph

Total Generalized Variation regularization closes the gap between neural-eld and classical methods in seismic travel-time tomography

Travel-time tomography forces a trade-off between mesh resolution and stability in which the regularizer choice dominates what can be recovered. We introduce MIMIR, a differentiable framework that represents the 2D velocity field as a Fourier-feature neural network, replacing the grid-based slowness vector with a continuous, infinitely differentiable function. Prior neural-field tomography has staircased smooth fields under total-variation (TV) priors or oscillated near interfaces under $L^2$ Laplacian smoothing. We adopt second-order total generalized variation (TGV$^2$) and parametrize its auxiliary vector field as a second neural network jointly optimized with the velocity field, eliminating the inner Chambolle-Pock primal-dual loop that classically dominates TGV computation. On three synthetic benchmarks (Gaussian, horizontally layered, curved-fault inspired by OpenFWI) using cross-well acquisition, 5% travel-time noise, and five seeds, MIMIR-TGV$^2$ ties a classical FMM-LSMR baseline with auto-tuned hyperparameters on the Gaussian ($p=0.134$, paired $t$-test) and significantly outperforms it on layered ($p<0.0001$, 44% RMSE reduction) and curved-fault ($p=0.0002$, 33% reduction). Replacing TGV$^2$ with TV degrades performance on Gaussian ($p=0.004$) and layered ($p=0.003$); curriculum-annealed TV improves Gaussian RMSE by only 5.4%, confirming that TV's staircase bias is intrinsic to the regularizer rather than a scheduling artifact. The results empirically validate the Bredies-Kunisch-Pock prediction that piecewise-affine priors are better suited to subsurface velocity recovery than piecewise-constant TV priors. We argue that the central design choice in physics-informed neural-field inversion is not the network architecture but the regularizer. The full pipeline reproduces in under one hour on consumer hardware.
Read the full abstract

Numerical Analysis

Fast Evaluation of the Azimuthal Fourier Modes of the 3D Helmholtz Green's Function and Their Derivatives

We introduce an $O(M)$ algorithm for evaluating the azimuthal Fourier modes $G_{k,m}$, $m = 0, 1, ..., M$, of the three-dimensional Helmholtz Green's function with real wavenumber $k$, together with all their first- and second-order derivatives with respect to the cylindrical source and target coordinates. The cost is independent of both the wavenumber and the source-target separation, and high relative accuracy is retained even for modes whose magnitude is exponentially small. The method combines contour deformation at a few boundary modes with a boundary-value formulation of the five-term recurrence in the mode index. Derivative quantities are obtained from stable recurrences, adding only a small constant factor to the cost of $G_{k,m}$ alone. Numerical experiments demonstrate high relative accuracy, linear scaling in $M$, and applications to modal boundary integral equation solvers for axisymmetric acoustic scattering, where the $k$-independent kernel evaluator makes dense per-mode linear algebra the dominant cost.
Read the full abstract

Combinatorics

Three-Edges and the SOS Rank of Biquadratic Forms

We extend the augmented bipartite graph framework for biquadratic sum-of-squares (SOS) ranks by introducing $3$-edges – triples of cells representing squares of three-term bilinear forms. We define suitable generalized cycle-free conditions that are purely combinatorial yet sufficient to guarantee that the SOS rank equals the total number of edges, carefully distinguishing occupation by $1$/$2$-edges from occupation by $3$-edges. The main theorem states that for any generalized cycle-free augmented bipartite graph $G$ satisfying the simplicity condition (S), the associated triply simple biquadratic form $P_G$ satisfies $\operatorname{sos}(P_G) = |E_1| + |E_2| + |E_3|$. The proof extends the orthogonality method with a novel trick: when a $2$-edge and a $3$-edge interact, the $3$-edge condition must be invoked rather than the $2$-edge condition. We give three applications. A $5 \times 3$ construction with two $2$-edges, inadmissible under the original definition, is admissible under our new definition, yielding $z_{3L}(5,3) \ge 10$ and improving $z_L(5,3)=9$. A $10 \times 5$ graph using a column-fully-degenerate $3$-edge gives $z_{3L}(10,5) \ge 27$, separating it from $z_L(10,5)=26$. A $15 \times 6$ graph using a half-row-degenerate $3$-edge improves the lower bound for $\operatorname{BSR}(15,6)$ from $43$ to $44$. These are the first explicit applications of $3$-edges to obtain improved lower bounds for $\operatorname{BSR}(m,n)$, and the $5 \times 3$ example demonstrates the power of the refined conditions.
Read the full abstract

Information Theory

Rényi Rate-Distortion-Perception-Privacy Tradeoff under Indirect Observation

We introduce a Rényi Rate-Distortion-Perception-Privacy (R-RDPP) framework for indirect source coding. A latent source~$S$ is correlated with a private attribute~$U$, and the encoder observes only a noisy view~$X$ such that $(S,U) - X - Y$ holds at the decoder output~$Y$. The communication cost is measured by Sibson's $\alpha$-mutual information $\Ialp$, the privacy leakage by $\Ibeta$, the semantic distortion between $S$ and $Y$, and the realism constraint at the semantic marginal $P_S$. We characterize the scalar Gaussian RDPP tradeoff, revealing that standard privacy metrics inherently penalize legitimate semantic recovery. To resolve this, we introduce a conditional privacy measure that quantifies only the residual leakage. In addition, we refine the achievability bounds for $\alpha > 1$ via the Poisson functional representation. By deriving the exact geometric-mixture distribution of the Poisson index, we obtain exact closed-form expressions for integer-order Rényi entropies and sharper computable bounds in regimes where the resulting expression improves the logarithmic-moment approach.
Read the full abstract

Information Theory

Closed-Form Gaussian Estimators for Multi-Source Partial Information Decomposition

Computing multi-source partial information decomposition (PID) for continuous data is hard: existing closed-form Gaussian estimators are restricted to two source variables, while continuous arbitrary-source estimators are typically learning-based and do not provide closed-form expressions. To address this, we develop closed-form Gaussian estimators for multi-source PID. We provide two-source redundancy, multi-source unique information, the K-th order synergistic effect from source subsets of size K, and the total synergistic effect. The estimators are derived from the conditional-independence-based information measures introduced in our earlier work, under which every quantity reduces to a log-determinant expression in covariance blocks of the system. The resulting estimator is plug-in consistent, affine invariant, source-permutation symmetric, and additive over independent systems. We validate it on a controlled Gaussian benchmark, evaluate its computational efficiency against baselines, and confirm its numerical stability in finite-sample regimes. To our knowledge, this is the first covariance-based closed-form estimator that provides multi-source continuous PID measures.
Read the full abstract

Metric Geometry

The Observable Wasserstein Distance

We introduce the observable Wasserstein distance, a framework for deriving lower bounds on the Wasserstein distance between probability measures on Polish metric spaces, designed to bypass the computational intractability of exact optimal transport in large-scale, non-Euclidean datasets. Analogous to the sliced Wasserstein distance in $\mathbb{R}^d$, our approach projects measures onto the real line via 1-Lipschitz observables and computes the Wasserstein distances between the resulting pushforward distributions. We define a hierarchy of pseudo-metrics by restricting observables to a nested chain of subspaces. A central theoretical contribution is an injectivity result linking the metric covering dimension of the support of a measure to the specific order in the hierarchy that guarantees unique recovery. This serves as a metric-space analogue to the Cramér-Wold Device for Euclidean distributions. We demonstrate that this hierarchy offers a tunable trade-off between sharpness as a lower bound on the Wasserstein distance and computational efficiency. We also present a discrete computational model for finite grids and numerical experiments validating the efficacy and utility of these approximations.
Read the full abstract

All authors Edivaldo Lopes dos Santos, Leandro Vicente Mauri, Washington Mio, Tom Needham

Logic

Some model-theoretic consequences of high-arity uniform convergence, part I

We show that certain families of sets in $\mathbb{R}^2$ (or $\mathbb{R}^n$) which are neither definable nor have bounded VC-dimension are nonetheless uniformly approximately definable in the real field, an o-minimal structure.

Dynamical Systems

Simultaneous Approximation by Attracting Basins

We show that any $d\geq3$ pairwise-disjoint open sets $A_1$, ..., $A_d\subset\widehat{\mathbb{C}}$ sharing a common boundary $J$ can be simultaneously approximated by the $d$ attracting basins $\mathcal{A}_1$, ..., $\mathcal{A}_d$ of a rational map $r$ having Fatou set $\mathcal{F}(r)=\mathcal{A}_1\sqcup...\sqcup\mathcal{A}_d$ and so that the Julia set $\mathcal{J}(r)$ approximates $J$.
Read the full abstract

All authors Colton Fisher, Aiden Hill, Kirill Lazebnik, Palmer Thompson

Complex Variables

Slice Fueter-regular functions on arbitrary domains in octonions

This paper is concerned with a class of generalized slice Fueter-regular functions on arbitrary domains in O with local stem functions. Some classical theorems such as the maximum modulus principle will be generalized to our setting. Some new phenomena such as the conditional uniqueness of stem vectors will be discovered by means of new technical tools, e.g., the CCL equivalence relation and the Bers-Vekua continuation. And a natural connection between the theory of slice Fueter-regular functions and that of Riemann domains will be revealed via the quotient space under the CCL equivalence relation.
Read the full abstract

All authors Xinyuan Dou, Guangbin Ren, Zeping Zhu, Ting Yang

Algebraic Geometry

Quasi-Projective Moduli for Polarized klt Good Minimal Models

We prove the weak positivity of direct images for locally stable families of klt good minimal models over reduced quasi-projective bases using Gabber's Extension Theorem. As an application, we apply Viehweg's ampleness criterion to show that the normalization of the moduli space of polarized klt good minimal models of arbitrary Kodaira dimension, constructed in [Jia23], is quasi-projective.
Read the full abstract

Algebraic Geometry

Homological sieve and Manin's conjecture

This is a report of the author's talk at RIMS workshop Algebraic Number Theory and Related Topics 2025 which was held at RIMS Kyoto University during December 15th-19th 2025. In this survey paper, we explain the homological sieve method, which is proposed by Das, Lehmann, Tosteson, and the author, and its applications to Manin's conjecture.
Read the full abstract

Differential Geometry · Cross-listed from cs.LG

The Geometric Wall: Manifold Structure Predicts Layerwise Sparse Autoencoder Scaling Laws

Sparse autoencoders (SAEs) operationalise the linear representation hypothesis: they reconstruct model activations as sparse linear combinations of interpretable dictionary atoms, on the implicit assumption that activation space is well approximated by a globally linear structure. Their reconstruction error varies sharply across layers in ways that existing scaling laws, fitted at single layers, do not explain. We argue that this variation is the empirical trace of a geometric mismatch: where the activation manifold is curved and its intrinsic dimension varies across layers, no sparse linear dictionary can match it uniformly, and the SAE's width-sparsity scaling becomes a layer-dependent function of manifold structure rather than a single universal law. We conduct the first cross-layer SAE scaling study, fitting and regressing on 844 residual-stream Gemma Scope SAE checkpoints across 68 layers of Gemma 2 2B and 9B. Stage 1 fits a per-layer scaling-law surface; Stage 2 regresses the fitted parameters and the derived per-layer width exponents on four layerwise geometric summaries. We find that manifold geometry predicts the per-layer width exponent in both models, and that the same regression coefficients learnt on one model predict the other model's per-layer exponents under cross-model transfer, indicating a transferable geometric law. At the showcase layers where richer width grids permit identification of the asymptotic floor, we find that the fitted floor tracks the layerwise geometric ordering: higher curvature and intrinsic dimension correspond to higher floor, consistent with the irreducible second-order residual that any sparse linear approximation of a curved manifold must leave behind. SAEs thus encounter not a finite-resource ceiling but a geometry-dependent wall, set by the manifold they are trying to reconstruct.
Read the full abstract

All authors Eslam Zaher, Maciej Trzaskowski, Quan Nguyen, Fred Roosta

Numerical Analysis

Parameter Estimation for Partially Observed Time-Changed SDEs

In this paper we consider the parameter estimation problem associated to partially-observed time changed SDEs, with observations that are given at discrete times. In particular we consider both likelihood and Bayesian estimation. We develop new Markov chain Monte Carlo (MCMC) algorithms which allow an unbiased score-based stochastic approximation method to provide likelihood-type parameter estimators. We also use a variant of this MCMC algorithm to perform multilevel-based Bayesian parameter estimation. We prove that this latter method achieves a mean square error of $\mathcal{O}(\epsilon^2)$ ($\epsilon>0$) with a cost of $\mathcal{O}(\epsilon^{-2}\log(\epsilon)^2)$. Our methodologies are tested numerically on both simulated and real data.
Read the full abstract

Combinatorics

On distance spectral radius of power hypertrees with given number of pendant paths of fixed length

The distance spectral radius of a connected hypergraph is the largest eigenvalue of the distance matrix of the hypergraph. A pendant path of length l with l greater than or equal to 1 in a hypergraph G at vertex v sub l plus 1 is a path consisting of vertices and edges v1 e1 v2 up to vl el v(l+1). The vertex v(l+1) has degree at least 2, vertex v1 has degree 1, and each vertex vi has degree 2 for i from 2 to l. Every vertex belonging to edge ei except vi and v(i+1) has degree 1 for all i from 1 to l. We find the unique hypertree that maximizes or minimizes the distance spectral radius among all r-th power hypertrees with m edges and k pendant paths of length l, where r is no less than 3, k and l are no less than 1, and the product of k and l is smaller than m.
Read the full abstract

Combinatorics

A proof of purely singular splitting conjecture

A set $M$ of nonzero integers is said to split a finite abelian group $G$ if there exists a subset $S\subseteq G$ such that $M\cdot S = G\setminus\{0\}$. Such a splitting is called purely singular if every prime divisor of $|G|$ divides some element of $M$. In 1995, Woldar \cite{W1995} conjectured that the finite abelian groups admitting a purely singular splitting by the set $\{1,2,\dots,k\}$ are precisely the cyclic groups of orders $1$, $k+1$, and $2k+1$. In this paper, we prove this conjecture.
Read the full abstract

Algebraic Topology · Cross-listed from cs.CG

Higher-order Persistence Diagrams

Persistent homology tracks when topological features appear and disappear across filtered data and represents the lifetime of each feature by a persistence interval. In multiple instance learning, when the instances in a bag use filtrations over the same ordered parameter space, we can compare relationships between persistence intervals across instances. No existing method is designed to aggregate collections of persistence diagrams in multiple instance learning into a single persistence diagram of implications between intervals. We introduce higher-order persistence diagrams to represent relationships between persistence intervals and recursively construct each higher-order persistence interval from a pair of lower-order persistence intervals. We then aggregate these relationships across the persistence diagrams in a bag. Explicit construction of this aggregate is computationally expensive, so we introduce harmonic aggregation to compute coordinates of the aggregate from the lower-order persistence diagrams without explicitly constructing it. Computing a harmonic aggregation coordinate has lower asymptotic computational complexity than explicitly constructing the aggregate. We evaluate harmonic aggregation against persistence landscapes, persistence images, and PersLay on random network model and real-world graph-classification benchmarks, and find that harmonic aggregation has the highest accuracy on the random network model benchmark and on most real-world data benchmarks. Source code is available at https://github.com/cfanning8/higher-order-PDs.
Read the full abstract

Information Theory

A Global Coding Scheme for OFDM over Finite Fields

This paper proposes a highly efficient global coded-multiplexing scheme, conceptualized as Orthogonal Frequency Division Multiplexing over a finite field (FF-OFDM), for reliable multiuser communications. By utilizing a prime length cyclic code and its Hadamard equivalents as algebraic subcarriers, independent data streams are globally multiplexed via a Galois Fourier Transform (GFT) without rate loss. We show that this finite-field synthesis intrinsically generates a global Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) code over $\mathrm{GF}(2^s)$, whose parity-check matrix is governed by the structural rigor of partial geometries. At the receiver, supported by a binary decomposition theorem, the received nonbinary global codeword is jointly decoded using parallel binary iterative soft-decision algorithms prior to demultiplexing. This joint decoding enables seamless reliability information sharing across all user streams, achieving near-bound error performance, rapid convergence without error floors, and strictly linear amortized decoding complexity.
Read the full abstract

All authors Juane Li, Qi-yue Yu, Khaled Abdel-Ghaffar, Shu Lin

Information Theory

Cross-Domain Lossy Compression via Constrained Minimum Entropy Coupling

This paper studies cross-domain lossy compression through the lens of minimum entropy coupling (MEC) with rate and classification constraints. In this setting, an encoder observes samples from a degraded source domain, while the decoder is required to generate outputs following a prescribed target distribution and to preserve information relevant to a downstream classification task. Motivated by logarithmic-loss distortion, we adopt an information-based objective that maximizes the coupling strength between the source and reconstruction, rather than minimizing a sample-wise distortion. Under common randomness, we formulate a rate-constrained MEC problem (MEC-B) and show that the intermediate representation can be removed without loss of optimality, yielding an equivalent deterministic coupling formulation. For Bernoulli sources, closed-form expressions are derived with and without classification constraints. In addition, we implement a neural restoration framework using quantization, entropy modeling, distribution matching, and classification regularization. Experiments on MNIST super-resolution and SVHN denoising show that increasing the available rate improves classification accuracy and yields more informative reconstructions.
Read the full abstract

All authors Nam Nguyen, Hassan Tavakoli, An Vuong, Thinh Nguyen, Bella Bose

Representation Theory

Middle convolution for Lie algebra representations

This paper introduces a Lie algebra analogue of the middle convolution functor, which is defined on the category of modules over certain Lie algebras, including, as typical motivating examples, free Lie algebras, Drinfeld-Kohno Lie algebras, and the holonomy Lie algebras of complements of hyperplane arrangements. First, we demonstrate that the middle convolution for Lie algebra representations can be regarded as a natural generalization of the infinitesimal analogue of the Long-Moody functor for Drinfeld-Kohno Lie algebras. Second, we show that our middle convolution recovers the Dettweiler-Reiter additive middle convolution for Fuchsian systems on the punctured Riemann sphere as a special case. Furthermore, we show that when applied to the holonomy Lie algebra of the complement of a hyperplane arrangement, our functor is compatible with Haraoka's middle convolution for logarithmic connections on such complements. Finally, we establish a Riemann-Hilbert correspondence between the middle convolution for the holonomy Lie algebra and the middle convolution for local systems on complements of hyperplane arrangements.
Read the full abstract

Sunday 10 May

Statistics Theory

Asymptotic Normality and Convergence Rates for Tsallis Entropy Estimators via Stabilization Techniques

We study nearest-neighbor-based estimators of Tsallis entropy associated with Poisson and binomial point processes on general metric measure spaces. Using stabilization techniques based on flexible add-one cost operators together with second-order Poincaré inequalities, we establish asymptotic normality and derive explicit convergence rates for the Kolmogorov distance. Our analysis avoids explicit score-function decompositions and instead relies on flexible localizations of add-one costs, which simplify the treatment of higher-order terms. Under natural stabilization and moment conditions, the resulting bounds recover the classical normal approximation rates \(s^{-1/2}\) and \(n^{-1/2}\) and extend corresponding results for Shannon and Rényi entropy estimators. We further illustrate the scope of the framework through examples involving Tsallis entropy functionals, weighted \(k\)-nearest-neighbor Shannon entropy estimators. The examples provided highlight the benefits of stabilization-based normal approximations for non-parametric statistical inference in complex spatial and high-dimensional settings.
Read the full abstract

Optimization and Control · Cross-listed from cs.AI

Integro-differential equations in angular stabilization of drone motion by distributed feedback control

In this paper, we propose angular stabilization of drone motion using distributed feedback control in the form of an integral operator. It should be stressed that the memory of this integral operator could be unbounded. It is intuitively clear that large length of the observation time open new possibilities to construct better control based on previous states of the control object. Unbounded memory in control requires the creation of a certain approach different from standard ones to the study of integro-differential equations. One of the goals of this article is to propose a certain universal approach that allows us to study the stability of integro-differential equations in the case of unbounded memory in the integral operator specifying the feedback control in stabilization. The approach we propose allows us to reduce the study of integro-differential equations to the analysis of systems of ordinary differential equations. In general, such systems can consist of an infinite number of equations. In relation to the so-called linear approximation in the problem of angle stabilization manages to limit itself to relatively simple exponential kernels in the integral control and arrive at a system with a finite number of equations. The examples explain that more complex kernels, for example, linear combinations of the exponential kernels, can enhance the stabilization capabilities. We obtain new unexpectable results on the exponential stability of integro-differential equations. Then we apply them to stabilization of drone flight.
Read the full abstract

Optimization and Control · Cross-listed from q-bio.GN

Detecting and Correcting Sample-by-Sample Scale Distortion in RNA Sequencing Data

RNA sequencing (RNA-seq) is the conventional genome-scale approach used to capture the expression levels of all detectable genes in a biological sample. This is now regularly used for population-based studies designed to identify genetic determinants of various diseases. Naturally, the accuracy of these tests should be verified and improved if possible. In this study, we aimed to detect and correct for expression level-dependent errors which vary from sample to sample, and are not corrected by conventional normalization techniques . We examined several RNA-seq datasets from the Cancer Genome Atlas (TCGA), Stand Up 2 Cancer (SU2C), and GTEx databases with various types of preprocessing. By applying local averaging, we found sample by sample expression-level dependent biases in all datasets studied. Using simulations, we show that these biases corrupt gene-gene correlation estimations and $t$ tests between subpopulations. To mitigate these biases, we introduce two different nonlinear transforms based on statistical considerations that correct these observed biases. We demonstrate that that these transforms effectively remove the observed per-sample biases, reduce sample-to-sample variance, and improve the characteristics of gene-gene correlation distributions. Using a novel simulation methodology that creates controlled differences between subpopulations, we show that these transforms reduce variability and increase sensitivity of two population tests. The improvements in sensitivity and specificity were of the order of 3-5% in most instances after the data was corrected for bias. Altogether, these results improve our capacity to understand gene-gene relationships, and may lead to novel ways to utilize the information derived from clinical tests.
Read the full abstract

Differential Geometry

Spherical Milnor Spaces II: Projective Quotients and Higher Topological Structures

We study projective and semidirect quotients of the spherical Milnor construction and develop a step-by-step lifting obstruction from their explicit spherical local sections. The resulting transition functions produce a twisted Cech 2-cocycle for any specified compatible extension with abelian kernel. When the kernel is $U(1)$ and the sign acts by complex conjugation, taking logarithms yields a twisted Dixmier–Douady obstruction under stated sheaf hypotheses. We identify its projective-operator interpretation when an additional representation is supplied, without attempting a classification of K-theory twists. We also investigate descent of differential-geometric structures and, under restricted-operator hypotheses, Schwinger cocycles and lifting gerbes for loop groups.
Read the full abstract

Differential Geometry

On spherical Milnor Classifying Spaces I: differential geometry

We compare the original product-subset diffeology on the Milnor join of Magnot–Watts with the locally finite final diffeology on a signed spherical model. The canonical squaring map from the spherical space to the Magnot–Watts join is smooth, whereas the positive square-root section is generally not; we also construct a different smooth injection from the locally finite simplicial model whose inverse is not smooth. For Hausdorff Fréchet–Lie groups whose smooth real-valued functions separate points, we compute the full algebraic internal tangent space, exhibiting separate first-order branches labelled by elements of the group at every inactive coordinate. The spherical weighted energy descends plotwise and restricts to a Riemannian metric on each support stratum. Smooth normalized strictly positive-definite kernels yield non-canonical ambient tangent metrics; compact Lie groups admit an explicit realization through their heat kernels. We characterize global diffeological forms by descent, construct plotwise Hausdorff Jacobians and varying-degree complementary forms, and show why these data do not define a canonical Hodge star across support changes. Stratumwise Hodge–Dirac operators remain available, but an explicit example obstructs their automatic gluing. We prove smooth contractibility of the total spherical space for any diffeological group, as well as equivariant uniqueness of maps to it. For any diffeological group we establish a classifying theorem for $D$-numerable principal bundles, without regularity hypotheses. For Lie groups we construct barycentric connections and their Chern–Weil forms, and distinguish sign local systems from gerbes. The hypotheses and proofs specify which conclusions are global, stratumwise, or conditional.
Read the full abstract

Dynamical Systems · Cross-listed from nlin.CD

Revealing dynamics of non-autonomous complex systems from data

Discovering governing equations from data is crucial for understanding complex systems in many diverse fields from science to engineering. Yet, there still is a lack of versatile computational toolbox to deal with this long standing challenge due to the inherent non-autonomicity and unknowability of the underlying dynamics. Here, we introduce a data-driven approach for inferring non-autonomous dynamical equations by identifying an optimal set of basis functions within the model space, enabling the reconstruction of complex systems behavior under simplified prior specifications. Our method demonstrates effectiveness in equation discovery on canonical synthetic systems such as cusp bifurcation and coupled Kuramoto oscillators. Furthermore, we extend the application of this approach to leaf cellular energy, unmanned aerial vehicle navigation, chick-heart aggregates, and marine fish community under simple basis function libraries. Leveraging the inferred equations, we accurately predict the evolution of these empirical systems and further uncover their governing laws. Our approach offers a novel paradigm to reveal the underlying dynamics of a wide range of real-world systems.
Read the full abstract

All authors Chengzuo Zhuge, Zheng Jiang, Zhefan Xu, Wei Chen

Combinatorics · Cross-listed from cs.DS

State Canonization and Early Pruning in Width-Based Automated Theorem Proving

Width-based automated theorem proving is a framework where counterexamples to graph-theoretic conjectures are searched width-wise relative to some graph width measure, such as treewidth or pathwidth. In a recent work it has been shown that dynamic programming algorithms operating on tree decompositions can be combined together with the purpose of width-based theorem proving. This approach can be used to show that several long-standing conjectures in graph theory can be tested in time \(2^{2^{k^{O(1)}}}\) on the class of graphs of treewidth at most \(k\). In this work, we give the first steps towards evaluating the viability of this framework from a practical standpoint. At the same time, we advance the framework in two directions. First, we introduce a state-canonization technique that significantly reduces the number of states evaluated during the search for a counterexample of the conjecture. Second, we introduce an early-pruning technique that can be applied in the study of conjectures of the form \(\mathcal{P}_1 \rightarrow \mathcal{P}_2\), for graph properties \(\mathcal{P}_1\) and \(\mathcal{P}_2\), where \(\mathcal{P}_1\) is a property closed under subgraphs. As a concrete application, we use our framework in the study of graph-theoretic conjectures related to coloring triangle-free graphs. In particular, our algorithm is able to show that Reed's conjecture for triangle-free graphs is valid on the class of graphs of pathwidth at most 5, and on graphs of treewidth at most 3. Perhaps more interestingly, our algorithm is able to construct in a completely automated way counterexamples to invalid strengthenings of Reed's conjecture. These are the first results showing that width-based automated theorem proving is a promising avenue in the study of graph-theoretic conjectures.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Sharp Entropy Cost of Coherent Leakage Across a Block Decomposition

Let $\mathcal{H}=P\mathcal{H}\oplus Q\mathcal{H}$ and let $\Pi\rho=P\rho P\oplus Q\rho Q$ be the two-block pinching of a density matrix. Write $A=P\rho P$, $B=P\rho Q$, and $C=Q\rho Q$. We study the block-coherence entropy $D(\rho\|\Pi\rho)$, the relative-entropy cost of removing cross-block coherence. First, we prove a midpoint Bogoliubov–Kubo–Mori coercivity estimate, giving the operator-kernel lower bound $D(\rho\|\Pi\rho)\ge \operatorname{Tr}[B^*\Omega^{-1}_{A,C}(B)]$ for strictly positive diagonal blocks. The proof uses the block-sign involution $U=P-Q$ to obtain a sign-symmetric midpoint lower bound for the BKM Hessian. Second, we determine the exact minimum in the associated constrained entropy-minimization problem: at fixed protected-sector floor, leakage mass, and quadratic coherence, the minimum can be achieved by a single active two-level block, independently of the ambient dimension. Third, under a uniform floor $A\ge a_0P$ and $0<\varepsilon_Q\le a_0/2$, we obtain the logarithmic boundary law $D(\rho\|\Pi\rho)\ge \|B\|_F^2\log(a_0/\varepsilon_Q)$, showing that the lower-bound coefficient multiplying the quadratic coherence diverges logarithmically as leakage mass tends to zero. As a finite-dimensional application, the estimates give an entropy certificate for coherent leakage from a protected subspace: $P\rho Q$ measures protected–leakage coherence, and the constrained entropy minimum is attained by a state supported on a single effective two-level transition. The BKM estimate also yields a dissipation lower bound along an idealized uniform block-dephasing orbit. Finally, the midpoint mechanism extends to finite-dimensional trace-preserving $\mathbb{Z}_2$-graded automorphisms and bounded finite-trace semifinite corners.
Read the full abstract