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)

Wednesday 25 March

Information Theory · Cross-listed from eess.IV

Joint Source-Channel-Check Coding with HARQ for Reliable Semantic Communications

Semantic communication has emerged as a promising paradigm for improving transmission efficiency and task-level reliability, yet most existing reliability-enhancement approaches rely on retransmission strategies driven by semantic fidelity checking that require additional check codewords solely for retransmission triggering, thereby incurring substantial communication overhead. In this paper, we propose S3CHARQ, a Joint Source-Channel-Check Coding framework with hybrid automatic repeat request that fundamentally rethinks the role of check codewords in semantic communications. By integrating the check codeword into the JSCC process, S3CHARQ enables JS3C, allowing the check codeword to simultaneously support semantic fidelity verification and reconstruction enhancement. At the transmitter, a semantic fidelity-aware check encoder embeds auxiliary reconstruction information into the check codeword. At the receiver, the JSCC and check codewords are jointly decoded by a JS3C decoder, while the check codeword is additionally exploited for perceptual quality estimation. Moreover, because retransmission decisions are necessarily based on imperfect semantic quality estimation in the absence of ground-truth reconstruction, estimation errors are unavoidable and fundamentally limit the effectiveness of rule-based decision schemes. To overcome this limitation, we develop a reinforcement learning-based retransmission decision module that enables adaptive, sample-level retransmission decisions, effectively balancing recovery and refinement information under dynamic channel conditions. Experimental results demonstrate that compared with existing HARQ-based semantic communication systems, the proposed S3CHARQ framework achieves a 2.36 dB improvement in the 97th percentile PSNR, as well as a 37.45% reduction in outage probability.
Read the full abstract

All authors Boyuan Li, Shuoyao Wang, Suzhi Bi, Liping Qian, Yunlong Cai

Combinatorics

Autoparatopisms of Quasigroups and Latin Squares

Paratopism is a well known action of the wreath product $\mathcal{S}_n\wr\mathcal{S}_3$ on Latin squares of order $n$. A paratopism that maps a Latin square to itself is an autoparatopism of that Latin square. Let $\mathrm{Par}(n)$ denote the set of paratopisms that are an autoparatopism of at least one Latin square of order $n$. We prove a number of general properties of autoparatopisms. Applying these results, we determine $\mathrm{Par}(n)$ for $n\le17$. We also study the proportion of all paratopisms that are in $\mathrm{Par}(n)$ as $n\rightarrow\infty$.
Read the full abstract

Numerical Analysis

Stable High-Order Interpolation on the Grassmann Manifold by Maximum-Volume Coordinates and Arnoldi Orthogonalization

High-order interpolation on the Grassmann manifold $\Gr(n, p)$ is often hindered by the computational overhead and derivative instability of SVD-based geometric mappings. To solve the challenges, we propose a stabilized framework that combines Maximum-Volume (MV) local coordinates with Arnoldi-orthogonalized polynomial bases. First, manifold data are mapped to a well-conditioned Euclidean domain via MV coordinates. The approach bypasses the costly matrix factorizations inherent to traditional Riemannian normal coordinates. Within the coordinate space, we use the Vandermonde-with-Arnoldi (V+A) method for Lagrange interpolation and its confluent extension (CV+A) for derivative-enriched Hermite interpolation. By constructing discrete orthogonal bases directly from the parameter nodes, the solution of ill-conditioned linear system is avoided. Theoretical bounds are established to verify the stability of the geometric mapping and the polynomial approximation. Extensive numerical experiments demonstrate that the proposed MV-(C)V+A framework can produce highly accurate approximation in high-degree polynomial interpolation.
Read the full abstract

All authors Qiang Niu, Wen Jiang, Jie Fei, Ruoyu Xiong, Yuxuan Li

Analysis of PDEs · Cross-listed from cs.LG

Symbolic–KAN: Kolmogorov-Arnold Networks with Discrete Symbolic Structure for Interpretable Learning

Symbolic discovery of governing equations is a long-standing goal in scientific machine learning, yet a fundamental trade-off persists between interpretability and scalable learning. Classical symbolic regression methods yield explicit analytic expressions but rely on combinatorial search, whereas neural networks scale efficiently with data and dimensionality but produce opaque representations. In this work, we introduce Symbolic Kolmogorov-Arnold Networks (Symbolic-KANs), a neural architecture that bridges this gap by embedding discrete symbolic structure directly within a trainable deep network. Symbolic-KANs represent multivariate functions as compositions of learned univariate primitives applied to learned scalar projections, guided by a library of analytic primitives, hierarchical gating, and symbolic regularization that progressively sharpens continuous mixtures into one-hot selections. After gated training and discretization, each active unit selects a single primitive and projection direction, yielding compact closed-form expressions without post-hoc symbolic fitting. Symbolic-KANs further act as scalable primitive discovery mechanisms, identifying the most relevant analytic components that can subsequently inform candidate libraries for sparse equation-learning methods. We demonstrate that Symbolic-KAN reliably recovers correct primitive terms and governing structures in data-driven regression and inverse dynamical systems. Moreover, the framework extends to forward and inverse physics-informed learning of partial differential equations, producing accurate solutions directly from governing constraints while constructing compact symbolic representations whose selected primitives reflect the true analytical structure of the underlying equations. These results position Symbolic-KAN as a step toward scalable, interpretable, and mechanistically grounded learning of governing laws.
Read the full abstract

All authors Salah A Faroughi, Farinaz Mostajeran, Amirhossein Arzani, Shirko Faroughi

Algebraic Geometry

Independence of tautological classes and cohomological stability for strata of differentials

The tautological rings of strata of differentials are known to be generated by divisor classes. In this paper, we give lower bounds on the degrees of relations among them, depending on the genus $g$ and the number of simple zeros. For strata with more than $4g/3$ simple zeros, our results show that there are no relations in degrees less than $\lfloor g/3 \rfloor + 1$. Moreover, we conjecture that, outside of a few exceptions, there is always a non-trivial relation in degree $\lfloor g/3 \rfloor + 1$, and prove the conjecture for all strata of holomorphic abelian differentials with $g \leq 30$. We also prove that the cohomology rings of strata of holomorphic differentials with sufficiently many simple zeros stabilize to the free algebra on the tautological divisor class. Finally, we show that for a large class of holomorphic abelian strata, containing hyperelliptic differentials, the tautological ring is non-trivial for sufficiently large $g$.
Read the full abstract

Information Theory

A Measurement-Calibrated AI-Assisted Digital Twin for Terahertz Wireless Data Centers

Terahertz (THz) wireless communication has emerged as a promising solution for future data center interconnects; however, accurate channel characterization and system-level performance evaluation in complex indoor environments remain challenging. In this work, a measurement-calibrated AI-assisted digital twin (DT) framework is developed for THz wireless data centers by tightly integrating channel measurements, ray-tracing (RT), and implicit neural field (INF) modeling. Specifically, channel measurements are first conducted using a vector network analyzer at 300 GHz under both line-of-sight (LoS) and non-line-of-sight (NLoS) scenarios. RT simulations performed on the Sionna platform capture the dominant multipath structures and show good consistency with measured results. Building upon measurement and RT data, an RT-conditioned INF is developed to construct a continuous radio-frequency (RF) field representation, enabling accurate prediction in RT-missing NLoS regions. The comprehensive RF map generated by DT can provide system-level analysis and decisions for wireless data centers.
Read the full abstract

All authors Mingjie Zhu, Yejian Lyu, Ziming Yu, Chong Han

Statistics Theory · Cross-listed from stat.ML

Beyond Consistency: Inference for the Relative risk functional in Deep Nonparametric Cox Models

There remain theoretical gaps in deep neural network estimators for the nonparametric Cox proportional hazards model. In particular, it is unclear how gradient-based optimization error propagates to population risk under partial likelihood, how pointwise bias can be controlled to permit valid inference, and how ensemble-based uncertainty quantification behaves under realistic variance decay regimes. We develop an asymptotic distribution theory for deep Cox estimators that addresses these issues. First, we establish nonasymptotic oracle inequalities for general trained networks that link in-sample optimization error to population risk without requiring the exact empirical risk optimizer. We then construct a structured neural parameterization that achieves infinity-norm approximation rates compatible with the oracle bound, yielding control of the pointwise bias. Under these conditions and using the Hajek–Hoeffding projection, we prove pointwise and multivariate asymptotic normality for subsampled ensemble estimators. We derive a range of subsample sizes that balances bias correction with the requirement that the Hajek–Hoeffding projection remain dominant. This range accommodates decay conditions on the single-overlap covariance, which measures how strongly a single shared observation influences the estimator, and is weaker than those imposed in the subsampling literature. An infinitesimal jackknife representation provides analytic covariance estimation and valid Wald-type inference for relative risk contrasts such as log-hazard ratios. Finally, we illustrate the finite-sample implications of the theory through simulations and a real data application.
Read the full abstract

Analysis of PDEs

The speeds of propagation for the monostable Lotka-Volterra competition-diffusion system in general unbounded domains

This paper is concerned with the speeds of propagation for the monostable Lotka-Volterra competition-diffusion system in general unbounded domains of $\mathbb{R}^N$. We first establish various definitions of spreading speeds at large time in the situation where one species is an invader and the other is a resident. Then, we study fundamental properties of these new definitions, including their relationships and their dependence on the geometry of the domain and the initial values. Under the conditions that both species possess the same diffusion ability and that the interactions between them are sufficiently weak, we derive an upper bound for the spreading speeds in a large class of domains. Furthermore, we obtain general upper and lower bounds for spreading speeds in exterior domains, as well as a general lower bound in domains containing large half-cylinders. Finally, we construct some particular domains for which the spreading speeds can be zero or infinite.
Read the full abstract

Analysis of PDEs

Refined Liouville-Type Theorems for the Stationary Navier–Stokes Equations

We study smooth solutions to the three-dimensional stationary Navier–Stokes equations and establish new Liouville-type theorems under refined decay assumptions. Building on the work of Cho et al., we introduce a refinement to previously known integrability criteria and analyze the associated averaged quantities. Our main result shows that if the $L^p$ growth rate of a solution remains bounded for some $3/2 < p < 3$, then the solution must be trivial. The proof combines averaged decay estimates, energy inequalities, and an iteration scheme.
Read the full abstract

Spectral Theory

Sharp estimates for eigenvalues of localization operators with applications to area laws

We study the eigenvalues of the localization operator $S_{A, B} = P_A\mathcal{F}^{-1}P_B\mathcal{F} P_A$, where $\mathcal{F}$ is the Fourier transform and $A = cA_0, B = B_0$ for some fixed sets $A_0, B_0\subset \mathbb{R}^d$ and a large parameter $c > 0$. For the counting function of the eigenvalues $|\{n: \varepsilon < \lambda_n(A,B)\le 1-\varepsilon\}|$ we obtain a sharp uniform upper bound if one of the sets is a finite disjoint union of parallelepipeds and a bound which is only a single logarithm off the conjectural optimal bound in the general case. These bounds are applied to the estimation of traces ${\rm{Tr}}\, f(S_{A,B})$ for functions $f$ with a very low regularity, in particular establishing an enhanced area law in the former case.
Read the full abstract

Geometric Topology

On deformations of foliations and characteristic classes

We study characteristic classes for deformations of foliations. Those classes include known classes such as the Godbillon–Vey class and the Fuks–Lodder–Kotschick class. We introduce a certain differential graded algebra (DGA for short) which recovers the Bott vanishing and some formulae by Heitsch. Some basic properties and structures of the cohomology of those DGA's are discussed. In particular, it is shown that at the level of the cohomology of DGA, there are some classes which cannot be described by the Godbillon–Vey class and the Fuks–Lodder–Kotschick class. It is also shown that if a certain type of characteristic classes admit non-trivial deformations in examples, then they yield another kind of classes which admit also non-trivial deformations.
Read the full abstract

Combinatorics

On fixing and distinguishing numbers of trees

A graph $G$ is $D$-distinguishable if there is a labeling of its vertices with $D$ labels such that the only automorphism of $G$ which preserves the labeling is the identity. The distinguishing number of $G$ is the minimum value $D$ for which $G$ is $D$-distinguishable. The fixing number of $G$ is the minimum cardinality of a subset of the vertices of $G$ which is fixed pointwise only by the trivial automorphism. We prove that the fixing number of any $2$-distinguishable tree of order $n \geq 3$ is at most $4n/11$, or at most $(D-1)n / (D+1)$ for a $D$-distinguishable tree ($D \geq 3$). For every $D$ and $r$ at least $2$, we characterize the $D$-distinguishable trees with radius $r$ by constructing a universal tree $T_r^D$ which has the property that a tree $T$ of radius $r$ is $D$-distinguishable if and only if $T$ is a union of branches of $T_r^D$. We obtain a similar collection of universal trees for the property of having a constant paint cost spectrum, i.e., the minimum size of the complement of a color class in a distinguishing $D$-coloring of $T$ is equal to the fixing number. Finally, we prove bounds on the distinguishing and fixing numbers of a tree in terms of the eccentricities of its vertices.
Read the full abstract

All authors Calum Buchanan, Peter Dankelmann, Isabel Harris, Paul Horn, K. E. Perry, Emily Rivett-Carnac

Representation Theory

Infinite sequences via Lie algebra actions for oligomorphic groups

Many integer sequences arise as numbers of $G$-orbits on $\binom{X}{n}$ as $n$ varies, for a permutation group $G\subseteq \operatorname{Sym}(X)$. For finite $X$, Stanley proved that these finite sequences increase towards the middle using an action of the Lie algebra $\mathfrak{sl}_2(\mathbb{C})$. For infinite sets $X$, and hence infinite sequences, Cameron provided an argument for monotonicity by identifying orbits with a vector space basis of the orbit algebra $\mathsf{H}_{G,X}^{\star}$, and proving injectivity of a certain operator $\mathsf{H}_{G,X}^{\star}\to \mathsf{H}_{G,X}^{\star+1}$. In this paper we generalize Stanley's approach to oligomorphic groups, and in particular extend Cameron's operator to a full $\mathfrak{sl}_2(\mathbb{C})$-action on $\mathsf{H}_{G,X}^{\star}$. As intermediate step, we define for every oligomorphic permutation group $G\subseteq \operatorname{Sym}(X)$ the $X$-th tensor power $(k^r)^{\otimes X}$, generalizing work of Entova-Aizenbud. We show that this space carries natural commuting actions of $G$ and the Lie algebra $\mathfrak{gl}_r(k)$, the latter depending on a Harman-Snowden measure $\mu$ on $G$. We then show that $\mathsf{H}_{G,X}^{\star}\subseteq (\mathbb{C}^2)^{\otimes X}$ has an ascending filtration by $\mathfrak{sl}_2(\mathbb{C})$-Verma modules. We explain how our approach applies to Fibonacci numbers, Tribonacci numbers, etc. by constructing measures on products with $(\mathbb{Q},<)$.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Resolving gradient pathology in physics-informed epidemiological models

Physics-informed neural networks (PINNs) are increasingly used in mathematical epidemiology to bridge the gap between noisy clinical data and compartmental models, such as the susceptible-exposed-infected-removed (SEIR) model. However, training these hybrid networks is often unstable due to competing optimization objectives. As established in recent literature on “gradient pathology," the gradient vectors derived from the data loss and the physical residual often point in conflicting directions, leading to slow convergence or optimization deadlock. While existing methods attempt to resolve this by balancing gradient magnitudes or projecting conflicting vectors, we propose a novel method, conflict-gated gradient scaling (CGGS), to address gradient conflicts in physics-informed neural networks for epidemiological modelling, ensuring stable and efficient training and a computationally efficient alternative. This method utilizes the cosine similarity between the data and physics gradients to dynamically modulate the penalty weight. Unlike standard annealing schemes that only normalize scales, CGGS acts as a geometric gate: it suppresses the physical constraint when directional conflict is high, allowing the optimizer to prioritize data fidelity, and restores the constraint when gradients align. We prove that this gating mechanism preserves the standard $O(1/T)$ convergence rate for smooth non-convex objectives, a guarantee that fails under fixed-weight or magnitude-balanced training when gradients conflict. We demonstrate that this mechanism autonomously induces a curriculum learning effect, improving parameter estimation in stiff epidemiological systems compared to magnitude-based baselines. Our empirical results show improved peak recovery and convergence over magnitude-based methods.
Read the full abstract

Tuesday 24 March

Combinatorics · Cross-listed from cs.SI

Representing Higher-Order Networks: A Survey of Graph-Based Frameworks

Many real-world phenomena can be naturally represented using graphs and networks. Classical graph models, however, are generally restricted to pairwise interactions and may therefore be insufficient for capturing the richer structural relationships encountered in practical systems. Higher-order graph formalisms extend the classical framework by incorporating multiway, hierarchical, temporal, multilayer, recursive, and tensor-based interactions, thereby enabling more expressive representations of complex systems. This book provides a comprehensive overview of mathematical concepts and frameworks for modeling higher-order networks. It surveys foundational notions, extended frameworks, and newly introduced formalisms, with particular emphasis on their underlying structural principles, interrelationships, and respective modeling roles. Its primary objective is to offer a unified perspective that enables readers to compare diverse higher-order network models and to identify suitable mathematical tools for both theoretical investigation and practical application. Now in its fourth edition, this volume presents an expanded, revised, and corrected treatment of foundational concepts, established extensions, and recently introduced structures, while maintaining a unifying focus on the relationships among these models. It is intended to serve as a reference for researchers and students studying and comparing higher-order network models in combinatorics, topology, applied mathematics, and related fields.
Read the full abstract

Analysis of PDEs · Cross-listed from physics.flu-dyn

A simplified model for coupling Darrieus-Landau and diffusive-thermal instabilities

A simplified phenomenological model is proposed to couple the long-wave Darrieus–Landau (DL) instability and the short-wave diffusive-thermal (DT) instability in premixed flames. By identifying a cubic coupling term in the linear dispersion relation, representing the leading-order interaction between hydrodynamic expansion and diffusive transport, this framework moves beyond the traditional treatment of these instabilities in isolation. Two distinct asymptotic regimes are identified: the first recovers the classical Michelson–Sivashinsky equation for order-unity positive Markstein numbers $\mathcal M>0$, the second reveals a distinguished DL-DT crossover regime where both instabilities participate at equal order. In this crossover limit, where the Markstein number is small ($\mathcal M \sim \sqrt{\epsilon}$ with $\epsilon$ measuring thermal expansion), a generalized evolution equation is derived featuring a nonlocal stabilising term controlled by the hydro-diffusive number $\mathcal{N} = \mathcal A/\delta_L^2$, where $\mathcal A$ is the hydro-diffusive area – the characteristic area over which hydrodynamic and diffusive transport processes interact. This term remains active even when Markstein stabilisation vanishes. Numerical solutions in sufficiently large domains based on our model reveal a distinctive chaotic regime in which the characteristic DL cusp structures are in persistent competition with small-scale wrinkles. This minimal unified framework thus captures the essential coupled dynamics governing flame front instability and provides a tractable explanation for the fine-scale cellular structures and accelerated growth rates observed, without recourse to the full complexity of the complete conservation equations.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Safe Decentralized Operation of EV Virtual Power Plant with Limited Network Visibility via Multi-Agent Reinforcement Learning

As power systems advance toward net-zero targets, behind-the-meter renewables are driving rapid growth in distributed energy resources (DERs). Virtual power plants (VPPs) increasingly coordinate these resources to support power distribution network (PDN) operation, with EV charging stations (EVCSs) emerging as a key asset due to their strong impact on local voltages. However, in practice, VPPs must make operational decisions with only partial visibility of PDN states, relying on limited, aggregated information shared by the distribution system operator. This work proposes a safety-enhanced VPP framework for coordinating multiple EVCSs under such realistic information constraints to ensure voltage security while maintaining economic operation. We develop Transformer-assisted Lagrangian Multi-Agent Proximal Policy Optimization (TL-MAPPO), in which EVCS agents learn decentralized charging policies via centralized training with Lagrangian regularization to enforce voltage and demand-satisfaction constraints. A transformer-based embedding layer deployed on each EVCS agent captures temporal correlations among prices, loads, and charging demand to improve decision quality. Experiments on a realistic 33-bus PDN show that the proposed framework reduces voltage violations by approximately 45% and operational costs by approximately 10% compared to representative multi-agent DRL baselines, highlighting its potential for practical VPP deployment.
Read the full abstract

All authors Chenghao Huang, Jiarong Fan, Weiqing Wang, Hao Wang

Numerical Analysis

Fast elementwise operations on tensor trains with alternating cross interpolation

Tensor trains (TTs), also known as matrix product states (MPS), are compressed representations of high-dimensional data that can be efficiently manipulated to perform calculations on the data. In many applications, such as TT-based solvers for nonlinear partial differential equations, the most expensive step is an elementwise multiplication or similar elementwise operation on multiple TTs. Known error-controlled algorithms for such operations scale as $O(\chi^4)$, where $\chi$ is the TT rank. If the rank of the output is smaller than $\chi^2$, it is possible to formulate algorithms with better scaling. In this work, we present the alternating cross interpolation (ACI) algorithm that performs such operations in $O(\chi^3)$, while maintaining error control. We demonstrate these properties on benchmark problems, achieving a significant speedup for TT ranks that are commonly encountered in practical applications.
Read the full abstract

Information Theory

DUGC-VRNet: Joint VR Recognition and Channel Estimation for Spatially Non-Stationary XL-MIMO

In this letter, we address spatially non-stationary near-field channel estimation for extremely large-scale multiple-input multiple-output (XL-MIMO) systems with a hybrid combining architecture. One key challenge in the considered problem lies in that conventional channel estimation algorithms typically struggle to effectively identify and adapt to the partial antenna visibility caused by varying visibility regions (VRs), thereby compromising estimation accuracy. To perform joint VR recognition and channel estimation, we integrate a deep unfolding network (DUN) with a graph convolution network (GCN), leading to a Deep Unfolding and Graph Convolution coupled, Visibility Region Aware Network (DUGC-VRNet). By leveraging the channel's graph structure, the GCN infers and feeds back VR information to dynamically guide the DUN's updates, thereby enhancing reliable channel estimation under spatial non-stationarity. To reduce DUGC-VRNet's complexity, we apply weight pruning to obtain a lightweight network. Simulation results demonstrate that the DUGC-VRNet and its pruned variant achieve superior channel estimation and more accurate VR recognition under spatially non-stationary conditions.
Read the full abstract

All authors Jinhao Nie, Guangchi Zhang, Miao Cui, Hao Fu, Xiaoli Chu

Dynamical Systems

A Structural Reduction of the Collatz Conjecture to One-Bit Orbit Mixing

We reduce the Collatz conjecture to a fixed-modulus, one-bit orbit-mixing problem. Working with the compressed odd-to-odd Collatz map, we prove exact low-depth decomposition formulas at depths K = 3, 4, 5, reducing block-discrepancy terms to explicit run statistics. We then prove a Map Balance Theorem: among the 2^(K-3), 1 burst residues modulo 2^K that initiate gaps, the counts mapping to gap starts congruent to 3 versus congruent to 7 (mod 8) differ by exactly 1 for every K >= 5. Thus all residual bias is orbit-level, not map-level. For the dominant n congruent to 1 (mod 8) class, the gap outcome depends on a single binary variable, bit 4 of the orbit value at burst-ending times, reducing the conjecture to whether every orbit visits two residue classes modulo 32 with sufficient balance along a sparse subsequence.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

The Born Rule as the Unique Refinement-Stable Induced Weight on Robust Record Sectors

This paper proves a conditional structural uniqueness theorem for induced weight on robust record sectors within an admissible Hilbert record layer. Its theorem target and additive carrier differ from those of the standard Born-rule routes: additivity is not placed on the full projector lattice, but on disjoint admissible continuation bundles through an extensive bundle valuation, from which the sector-level additive law is inherited under admissible refinement. Accordingly, the result is not a Gleason-type representation theorem in different language, but a distinct uniqueness theorem about induced sector weight inherited from bundle additivity on admissible continuation structure. Under two explicit structural conditions, internal equivalence of admissible binary refinement profiles and sufficient admissible refinement richness, the quadratic assignment is the only non-negative refinement-stable induced weight on robust record sectors. In the main theorem, refinement richness is secured by admissible binary saturation. A supplementary proposition shows that dense admissible saturation already suffices if continuity of the profile function is added. Under normalization, the result reduces to the standard Born assignment.
Read the full abstract

Optimization and Control · Cross-listed from cs.DS

Multi-LLM Query Optimization

Deploying multiple large language models (LLMs) in parallel to classify an unknown ground-truth label is a common practice, yet the problem of optimally allocating queries across heterogeneous models remains poorly understood. In this paper, we formulate a robust, offline query-planning problem that minimizes total query cost subject to statewise error constraints which guarantee reliability for every possible ground-truth label. We first establish that this problem is NP-hard via a reduction from the minimum-weight set cover problem. To overcome this intractability, we develop a surrogate by combining a union bound decomposition of the multi-class error into pairwise comparisons with Chernoff-type concentration bounds. The resulting surrogate admits a closed-form, multiplicatively separable expression in the query counts and is guaranteed to be feasibility-preserving. We further show that the surrogate is asymptotically tight at the optimization level: the ratio of surrogate-optimal cost to true optimal cost converges to one as error tolerances shrink, with an explicit rate of $O\left(\log\log(1/\alpha_{\min}) / \log(1/\alpha_{\min})\right)$. Finally, we design an asymptotic fully polynomial-time approximation scheme (AFPTAS) that returns a surrogate-feasible query plan within a $(1+\varepsilon)$ factor of the surrogate optimum.
Read the full abstract

All authors Arlen Dean, Zijin Zhang, Stefanus Jasin, Yuqing Liu

Probability

Pinning in non-critical half-space geometric last passage percolation

We study a symmetrized (half-space) version of geometric last passage percolation with a boundary parameter $c$ that interpolates between subcritical, critical, and supercritical behavior. This model gives rise to a family of interlacing random curves, or a line ensemble, which encode both the usual last passage time and its higher-rank analogues. Although these ensembles are understood in most space-time regions, their behavior near the diagonal – where the boundary effects are strongest – has remained unclear outside the critical regime. We determine the universal scaling limits of the line ensemble in this near-diagonal region for both subcritical ($c < 1$) and supercritical ($c > 1$) phases. In the subcritical case, after appropriate centering and scaling, the entire line ensemble converges to the pinned half-space Airy line ensemble, a universal Brownian Gibbsian object recently constructed as a canonical limit for half-space models in the KPZ universality class in arXiv:2601.04546. In the supercritical case, we prove an analogous convergence together with a curve-separation phenomenon: the lower curves converge to the same pinned half-space Airy limit, while the top curve decouples and converges to Brownian motion. These results essentially complete the asymptotic description of half-space geometric last passage percolation and provide a new rigorous instance of the pinned half-space Airy line ensemble as a universal scaling limit.
Read the full abstract

Number Theory

On factorial reciprocals in Cantor sets

Let $C$ be the middle-third Cantor set. We show that \[\left\{\frac{1}{n!}: n\in\mathbb{N}\right\}\cap C=\left\{1, \frac{1}{5!}\right\}.\] This answers a question recently posed by Jiang [J. Lond. Math. Soc., 113(1):e70408, 2026]. Our approach extends to general missing-digit sets, showing that, in any such set, there are only finitely many elements of the form $\frac{1}{n!}$, all of which can be effectively determined.
Read the full abstract

Algebraic Topology · Cross-listed from cs.CG

Persistence-based topological optimization: a survey

Computational topology provides a tool, persistent homology, to extract quantitative descriptors from structured objects (images, graphs, point clouds, etc). These descriptors can then be involved in optimization problems, typically as a way to incorporate topological priors or to regularize machine learning models. This is usually achieved by minimizing adequate, topologically-informed losses based on these descriptors, which, in turn, naturally raises theoretical and practical questions about the possibility of optimizing such loss functions using gradient-based algorithms. This has been an active research field in the topological data analysis community over the last decade, and various techniques have been developed to enable optimization of persistence-based loss functions with gradient descent schemes. This survey presents the current state of this field, covering its theoretical foundations, the algorithmic aspects, and showcasing practical uses in several applications. It includes a detailed introduction to persistence theory and, as such, aims at being accessible to mathematicians and data scientists newcomers to the field. It is accompanied by an open-source library which implements the different approaches covered in this survey, providing a convenient playground for researchers to get familiar with the field.
Read the full abstract

All authors Mathieu Carriere, Yuichi Ike, Théo Lacombe, Naoki Nishikawa

Dynamical Systems

Four Limit Cycles in Three-Dimensional Competitive Lotka-Volterra Systems of Class 28 in Zeeman's Classification

In this paper, a three-dimensional competitive Lotka-Volterra system with four limit cycles is constructed for class 28 in Zeeman's classification. Combined with existing results – from Gyllenberg and Yan (2009) for class 27, from Wang, Huang and Wu (2011) for class 29, and from Yu, Han and Xiao (2016) for class 26 – our finding indicates that there exist systems with at least four limit cycles for each class among classes 26 $-$ 29.
Read the full abstract

Information Theory

Digital Twin-Assisted Measurement Design and Channel Statistics Prediction

Prediction of wireless channels and their statistics is a fundamental procedure for ensuring performance guarantees in wireless systems. Statistical radio maps powered by Gaussian processes (GPs) offer flexible, non-parametric frameworks, but their performance depends critically on the choice of mean and covariance functions. These are typically learned from dense measurements without exploiting environmental geometry. Digital twins (DTs) of wireless environments leverage computational power to incorporate geometric information; however, they require costly calibration to accurately capture material and propagation characteristics. This work introduces a hybrid channel prediction framework that leverages uncalibrated DTs derived from open-source maps to extract geometry-induced prior information for GP prediction. These structural priors are fused with a small number of channel measurements, enabling data-efficient prediction of channel statistics across the entire environment. By exploiting the uncertainty quantification inherent to GPs, the framework supports principled measurement selection by identifying informative probing locations under resource constraints. Through this integration of imperfect DTs with statistical learning, the proposed method reduces measurement overhead, improves prediction accuracy, and establishes a practical approach for resource-efficient wireless channel prediction.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Probabilistic Geometric Alignment via Bayesian Latent Transport for Domain-Adaptive Foundation Models

Adapting large-scale foundation models to new domains with limited supervision remains a fundamental challenge due to latent distribution mismatch, unstable optimization dynamics, and miscalibrated uncertainty propagation. This paper introduces an uncertainty-aware probabilistic latent transport framework that formulates domain adaptation as a stochastic geometric alignment problem in representation space. A Bayesian transport operator is proposed to redistribute latent probability mass along Wasserstein-type geodesic trajectories, while a PAC-Bayesian regularization mechanism constrains posterior model complexity to mitigate catastrophic overfitting. The proposed formulation yields theoretical guarantees on convergence stability, loss landscape smoothness, and sample efficiency under distributional shift. Empirical analyses demonstrate substantial reduction in latent manifold discrepancy, accelerated transport energy decay, and improved covariance calibration compared with deterministic fine-tuning and adversarial domain adaptation baselines. Furthermore, bounded posterior uncertainty evolution indicates enhanced probabilistic reliability during cross-domain transfer. By establishing a principled connection between stochastic optimal transport geometry and statistical generalization theory, the proposed framework provides new insights into robust adaptation of modern foundation architectures operating in heterogeneous environments. These findings suggest that uncertainty-aware probabilistic alignment constitutes a promising paradigm for reliable transfer learning in next-generation deep representation systems.
Read the full abstract

Dynamical Systems

Advances on Stable Ergodicity of Toral Automorphisms

We prove that all ergodic automorphisms of the $N$-dimensional torus with two dimensional center are stably ergodic. This includes all ergodic automorphisms in dimension $N\leq 5$ or $N=7$. This generalizes a previous result of Rodriguez-Hertz, that required an additional algebraic condition on the carachteristic polynomial of the linear automorphism. The core of the proof is a minimality criterion.
Read the full abstract

Algebraic Topology

A theory of twisted umkehr maps

We develop a theory of umkehr maps for twisted generalized homology theories. In this theory, interesting umkehr maps, including generalizations of important classical ones, are induced by cartesian morphisms of a certain category opfibred over the category of spaces and continuous maps, making it possible to access them through universal properties.
Read the full abstract