Information Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 9 March
In 2004, while studying the information geometry of binary Bayesian networks (bitnets), the author conjectured that the volume-averaged Ricci scalar <R> computed with respect to the Fisher information metric is universally quantized to positive half-integers: <R> in (1/2)Z. This paper resolves the conjecture after 20 years. We prove it for tree-structured and complete-graph bitnets via a universal Beta function cancellation mechanism, and disprove it in general by exhibiting explicit loop counterexamples. We extend the program to Gaussian DAG networks, where a sign dichotomy holds: discrete bitnets have positive curvature, while Gaussian networks form solvable Lie groups with negative curvature.
Numerical Analysis
Geometrically Explicit Cosserat-Rod Modeling with Piecewise Linear Strain for Complex Rod Systems
This paper presents a geometrically explicit formulation for Cosserat rods that unifies configuration-space and strain-based representations within a single modeling framework. The proposed method uses nodal configurations on the Lie group SE(3) as generalized coordinates, while internal strains are reconstructed via a piecewise-linear parameterization. This hybrid design preserves the geometric rigor of Lie-group formulations and retains the locality, simplicity, and computational efficiency characteristic of strain-parameterized rod models. The formulation naturally avoids shear and membrane locking without additional stabilization techniques, and it accommodates arbitrary rod networks, closed-loop architectures, and gridshell-like structures through element-wise assembly. A Riemannian Newton solver is further developed to solve the equilibrium equations directly on SE(3), providing rapid convergence and consistent treatment of rotations. Numerical examples demonstrate that the method achieves high accuracy with only a few elements and generalizes seamlessly from single rods to complex multi-rod systems. These properties highlight the potential of the proposed formulation as a fast, robust, and scalable simulation tool for slender mechanisms and compliant structures.
Read the full abstract
Differential Geometry
Einstein deformations of Kähler Einstein metrics
We study Einstein deformations of negative Kähler Einstein metrics. We relate the second order Einstein deformation theory of negative Kähler-Einstein metrics to the complex geometry of the underlying Kähler manifold. After suitable gauge normalisation we show that the Taylor expansion to order two of an Einstein deformation tangent to $h_1$ in the infinitesimal deformation space is fully determined by $h_1^2$ and the divergence of the Kodaira-Spencer bracket $[h_1,h_1]^c$. This substantially refines and extends recent results of Nagy-Semmelmann which state that Einstein deformations for negative Kähler-Einstein metrics are unobstructed to second order.
Read the full abstract
Probability
On the structure of the Poisson trinomial distribution
We study sums of independent random variables that take values $0$, $1/2$, or $1$. We show that the probability mass function of the sum splits into two interleaved parts: one supported on the integers and the other supported on the half-integers. Each part, when normalized, is a Poisson binomial distribution and hence log-concave with one or two modes. We also prove that each of the two conditional means (conditioning on being an integer or a half-integer) lies within $1/2$ of the unconditional mean. As a consequence, any two modes of the two conditional distributions are within $5/2$ of each other.
Read the full abstract
Mathematical Physics · Cross-listed from hep-th
Hydrodynamics as cospans of field theories into the BF theory
Hydrodynamics is based on conservation laws of currents: one starts from the conserved currents of the theory describing the microscopic dynamics, and provides an alternative parameterisation of these currents in terms of hydrodynamic variables (density, pressure, velocity, etc.). This paradigm has recently been extended to incorporate higher-form symmetries. The conservation law of the $p$-form conserved currents can be regarded as the equations of motion of a $BF$ theory that treats the currents as fundamental fields. We argue that the hydrodynamic approximation to a microscopic theory can be regarded as a cospan of differential graded manifolds $X_\mathrm{micro}\to X_{BF}\leftarrow X_\mathrm{hydro}$, where $X_\mathrm{micro}$ and $X_\mathrm{hydro}$ describe the microscopic and hydrodynamic theories, respectively, and $X_{BF}$ describes the $BF$ theory of conserved currents.
Read the full abstract
Algebraic Geometry
On the height boundedness of periodic and preperiodic points of dominant rational self-maps on projective varieties
We give a counterexample to the following conjecture: the set of isolated periodic points of an automorphism of degree at least two on an affine space is a set of bounded height. As a positive result, we prove that any cohomologically hyperbolic dominant rational self-map on a projective variety admits a non-empty Zariski open subset on which the set of periodic points is height bounded. Concerning preperiodic points, we give an example suggesting that the same statement may fail.
Read the full abstract
Probability
On the statistics of random-to-top shuffles
We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each statistic as a randomly indexed statistic of a uniformly random permutation. This perspective gives new combinatorial proofs of the expected number of fixed points and inversions. In particular, we solve an open problem of Pehlivan on fixed points, and we answer a question of Diaconis and Fulman on inversions.
Read the full abstract
Number Theory
Arithmetic Bias in the Distribution of Mersenne Prime Exponents and the Divisor Structure of $p-1$
Wagstaff's classical heuristic describes how the probability that $2^p-1$ is prime depends on the size of the prime exponent $p$. We investigate whether the divisor structure of $p-1$ is associated with additional variation among exponents of comparable size. We summarize this structure by $S(p)=\log\tau(p-1)/\log\log p$, where $\tau$ is the divisor function, and compare regions of higher and lower $S$ within six exponent intervals. In a Wagstaff-balanced design covering all $5{,}761{,}450$ prime exponents $13\le p<10^8$, $32$ of the $47$ known Mersenne-prime exponents lie in the higher-$S$ regions, with a conditional two-sided reference value of $0.01154$ under the weighted-subset null. These comparisons are exploratory: the statistic and conditional analyses were selected post hoc, and the present data do not establish an association beyond the contribution of powers of two to the divisor count. We then construct a modular-response benchmark $H(p)$ from an exactly characterized cyclotomic order family. The benchmark averages a declared response over residue configurations satisfying the selected product-one constraints. Its variation across the full population is summarized by $H(p)\approx\theta\tau(p-1)$, with $\theta$ determined without using Mersenne-prime labels. Under a restricted effective-channel continuation hypothesis, relative variation in this score redistributes Wagstaff weight while preserving its total mass on the finite calibration population. The resulting rule allocates $32.28$ and $14.72$ cases to the higher- and lower-$S$ regions, respectively. Extrapolating the same rule to $10^8\le p<10^9$ assigns $73.88\%$ of model weight to the higher-$S$ region.
Read the full abstract
Numerical Analysis
Four-field mixed finite elements for incompressible nonlinear elasticity
We present a stable finite element method for incompressible nonlinear elasticity based on a four-field mixed formulation involving the displacement, displacement gradient, first Piola–Kirchhoff stress and pressure. Unlike existing four-field mixed formulations, such as the compatible strain mixed finite element method (CSFEM), the proposed approach employs a discontinuous displacement field and requires no stabilisation in either 2D or 3D. A Newton–Raphson linearisation is derived and finite element pairs satisfying the relevant inf-sup conditions are identified. To recover accurate continuous displacement fields, an efficient postprocessing technique is further introduced. We establish the well-posedness of the linearised continuous problem together with a priori error estimates for the discrete formulation. Extensive numerical experiments in both 2D and 3D demonstrate optimal or even super convergence rates and enhanced robustness, particularly in 3D where CSFEM typically requires stabilisation.
Read the full abstract
Representation Theory
Structure and Representation Theory of basic simple $\mathbb{Z}_2\times \mathbb{Z}_2$-graded color Lie algebras
We adapt methods from the theory of complex semisimple Lie algebras to develop a root theory for a class of simple $\mathbb{Z}_2 \times \mathbb{Z}_2$-graded (color) Lie algebras, which we call basic. As an application, assuming that the Cartan subalgebra is self-centralizing, we classify all finite-dimensional representations of these algebras by proving a highest weight theorem and a complete reducibility theorem.
Read the full abstract
Optimization and Control
Data-driven robust Markov decision processes on Borel spaces: performance guarantees via an axiomatic approach
We consider Markov decision processes (MDPs) with unknown disturbance distribution and address this problem using the robust Markov decision process (RMDP) approach. We construct the empirical distribution of the unknown disturbance distribution and characterize our ambiguity set of distributions as the sublevel set of a nonnegative distance function from the empirical distribution. By connecting the weak convergence of distributions to convergence with respect to the distance function, we prove that the robust optimal value function and the out-of-sample value function converge to the true optimal value function with increasing sample-sizes. We establish that, for finite sample-sizes, the robust optimal value function serves as a high probability upper bound on the out-of-sample value function. We also obtain probabilistic convergence rates, sample complexity bounds, and out-of-distribution performance bounds. The finite sample performance guarantees rely on the distance function satisfying a certain concentration type inequality. Several well-studied distances in the literature meet the requirements imposed on the distance function. We also analyze the data-driven properties of empirical MDPs and demonstrate that, unlike our data-driven RMDPs, empirical MDPs fail to satisfy some of the finite sample performance guarantees.
Read the full abstract
Numerical Analysis
Overlapping Schwarz Preconditioners for Pose-Graph SLAM in Robotics
We investigate scalable two-level overlapping Schwarz domain decomposition methods with energy-minimizing coarse spaces of GDSW type (Generalized Dryja–Smith–Widlund type) as preconditioners for the sparse linear systems arising in graph-based nonlinear least-squares problems, specifically the pose-graph optimization back-end in Simultaneous Localization and Mapping (SLAM). After a brief introduction to SLAM and domain decomposition preconditioners, we describe the nonlinear least-squares formulation, its linearization, and the resulting matrix structure, to facilitate access for readers without prior knowledge of either field. Numerical experiments demonstrate the numerical scalability of the preconditioned conjugate gradient method (CG): Using the two-level overlapping Schwarz preconditioner, the number of CG iterations remains bounded independently of the problem size, overcoming the typical limitations of simple preconditioners, including one-level Schwarz approaches. We further show that a simplified SLAM problem can be interpreted as a finite element problem using linear elastic bars, reinforcing the analogy to continuum mechanics and motivating the use of scalable domain decomposition techniques.
Read the full abstract
Differential Geometry
On Ricci Solitons and Harmonic Vector Fields in the Thurston Geometry $F^4$
In this paper, we consider a left-invariant Riemannian metric $g$ on the Lie group $F^4$. We classify Ricci solitons on $(F^4,g)$ and show that all such solitons are expanding and non-gradient. Moreover, we study the existence of harmonic maps from compact Riemannian manifolds into $(F^4,g)$. Finally, we characterize a class of harmonic vector fields on $(F^4,g)$.
Read the full abstract
Information Theory
Mitigation of UE Antenna Calibration Errors via Differential STBC in Cell-Free Massive MIMO
This letter investigates the use of differential space-time block coding (DSTBC) to address antenna array calibration impairments at multi-antenna user equipment (UE) in the downlink (DL) of cell-free massive MIMO (CF-mMIMO) systems. We show that, by exploiting DSTBC, reliable DL communication can be achieved without explicit UE-side calibration or channel phase knowledge. Simulation results demonstrate that the proposed DSTBC-based transmission effectively mitigates the impact of antenna-dependent phase offsets, restoring near-coherent performance in CF-mMIMO networks.
Read the full abstract
Classical Analysis and ODEs
Cumulative Riemann sums, distribution functions, and a universal inequality
We study discrete expressions of the form $$ T_n(g)=\sum_{i=1}^n a_i g(S_i), \qquad S_i=\sum_{j=1}^i a_j, $$ where $a_i>0$ and $\sum_{i=1}^n a_i=1$. If $g:[0,1]\to\mathbb{R}$ is a decreasing integrable function, we have $$ \sum_{i=1}^n a_i g(S_i) \le \int_0^1 g(x)\,dx, $$ from which classical inequalities can be obtained, for instance for the choice $g(x)=1-x^k$. Although elementary, this inequality admits a natural interpretation in terms of Riemann sums, Abel summation, and the probability integral transform. The aim of this paper is to present a unified perspective emphasizing that the discrete inequality is a consequence of a distribution-free continuous identity. Beyond the specific example, we establish a general discrete theorem for monotone functions and discuss connections with majorization theory and Karamata's inequality.
Read the full abstract
Differential Geometry
On K-peak solutions for the Yamabe equation on product manifolds
Let $(M^n, g)$ and $(X^m, h)$ be closed manifolds $m, n>2$, such that $(X, h)$ has constant positive scalar curvature. We consider the one parameter family of products $(M\times X, g+\epsilon^2 h)$, $\epsilon>0$. We prove that if either the scalar curvature of $g$, $s_g$, is constant or a certain dimensional constant $\beta=0$, there is some function $\Phi:M\rightarrow \mathbb{R}$ that depends on $s_g$, the norm of the Ricci curvature of $g$ and the norm of the curvature tensor of $g$; such that if $\xi_0$ is a stable, isolated, critical point of $\Phi$, then for each $K\in\mathbb{N}$, there is some $\epsilon_0>0$ such that for every $\epsilon \in (0,\epsilon_0)$ the subcritical Yamabe equation $-\epsilon^2\Delta_g u+(1+{\bf{c}}\epsilon^2 s_g)u=u^q$ has a positive $K-$peak solution, which concentrates around $\xi_0$. Here, ${\bf{c}}=\frac{N-2}{4(N-1)}$, $q=\frac{N+2}{N-2}$ and $N=n+m$. This provides solutions for the Yamabe equation on Riemannian products $(M\times X, g+\epsilon^2 h)$ and covers some remaining cases of previous results which handle the case where $s_g$ has non-degenerate critical points and $\beta\neq0$.
Read the full abstract
Logic
Dimension of Generic Reals
This paper investigates the Hausdorff measure of certain sets of generics in computability theory. Let $\Gamma$ be the Turing ideal in which we take the dense open sets. The set of $\Gamma$-Cohen generics has measure positive if and only if the gauge function is not dominated by every element in $\Gamma$, under some mild restrictions on the gauge function. The set of $\Gamma$-Mathias generics and the set of $\Gamma$-Sacks generics have measure positive if and only if the gauge function eventually dominates every element in $\Gamma$. This gives some comparison between the behavior of reals in the set and the measure of the set.
Read the full abstract
Statistics Theory
Kernel Debiased Plug-in Estimation based on the Universal Least Favorable Submodel
We propose ULFS-KDPE, a kernel debiased plug-in estimator based on the universal least favorable submodel, for estimating pathwise differentiable parameters in nonparametric models. The method constructs a data-adaptive debiasing flow in a reproducing kernel Hilbert space (RKHS), producing a plug-in estimator that achieves semiparametric efficiency without requiring explicit derivation or evaluation of efficient influence functions. We place ULFS-KDPE on a rigorous functional-analytic foundation by formulating the universal least favorable update as a nonlinear ordinary differential equation on probability densities. We establish existence, uniqueness, stability, and finite-time convergence of the empirical score along the induced flow. Under standard regularity conditions, the resulting estimator is regular, asymptotically linear, and attains the semiparametric efficiency bound simultaneously for a broad class of pathwise differentiable parameters. The method admits a computationally tractable implementation based on finite-dimensional kernel representations and principled stopping criteria. In finite samples, the combination of solving a rich collection of score equations with RKHS-based smoothing and avoidance of direct influence-function evaluation leads to improved numerical stability. Simulation studies illustrate the method and support the theoretical results.
Read the full abstract
Information Theory
Differentially Private Secure Multiplication: Beyond Two Multiplicands
We study the problem of differentially private (DP) secure multiplication in distributed computing systems, focusing on regimes where perfect privacy and perfect accuracy cannot be simultaneously achieved. Specifically, N nodes collaboratively compute the product of M private inputs while guaranteeing epsilon-DP against any collusion of up to T nodes. Prior work has characterized the fundamental privacy-accuracy trade-off for the multiplication of two multiplicands. In this paper, we extend these results to the more general setting of computing the product of an arbitrary number M of multiplicands. We propose a secure multiplication framework based on carefully designed encoding polynomials combined with layered noise injection. The proposed construction generalizes existing schemes and enables the systematic cancellation of lower-order noise terms, leading to improved estimation accuracy. We explore two regimes: (M-1)T+1 <= N <= MT and N = T+1. For (M-1)T+1 <= N <= MT, we characterize the optimal privacy–accuracy trade-off. When N = T+1, we derive nontrivial achievability and converse bounds that are asymptotically tight in the high-privacy regime.
Read the full abstract
Information Theory
Zero-knowledge and Quantum CSS Codes Are Equivalent
Zero-knowledge codes, introduced by Decatur, Goldreich, and Ron (ePrint 1997), are error-correcting codes in which few codeword symbols reveal no information about the encoded message, and have been extensively used in cryptographic constructions. Quantum CSS codes, introduced by Calderbank and Shor (Phys. Rev. A 1996) and Steane (Royal Society A 1996), are error-correcting codes that allow for quantum error correction, and are also useful for applications in quantum complexity theory. In this short note, we show that (linear, perfect) zero-knowledge codes and quantum CSS codes are equivalent. We demonstrate the potential of this equivalence by using it to obtain explicit asymptotically-good zero-knowledge locally-testable codes.
Read the full abstract
Statistics Theory
Shape-constrained density estimation with Wasserstein projection
Statistical inference based on optimal transport offers a different perspective from that of maximum likelihood, and has increasingly gained attention in recent years. In this paper, we study univariate nonparametric shape-constrained density estimation via projection with respect to the $p$-Wasserstein distance, with a focus on the quadratic case $p = 2$. By considering shape constraints given by displacement convex subsets of the Wasserstein space, Wasserstein projection estimation is a convex optimization problem. We focus on two fundamental examples, namely non-increasing densities on $\mathbb{R}_+ := [0, \infty)$ and log-concave densities on $\mathbb{R}$. In each case, we prove structural properties of the Wasserstein projection estimator, propose a discretization which can be implemented by off-the-shelf solvers, and compare the projection estimator with the corresponding maximum likelihood estimator.
Read the full abstract
Statistics Theory
Functional Bias and Tangent-Space Geometry in Variational Inference
Variational inference approximates Bayesian posterior distributions by projecting onto a tractable family of distributions. While most theoretical analyses evaluate the quality of this approximation using global divergence measures, many applications rely on specific posterior summaries such as expectations, variances, or tail probabilities. We develop a geometric framework for analyzing the bias of posterior functionals under variational approximations. We show that the leading-order bias of a posterior functional is determined by its component orthogonal to the variational tangent space induced by the variational family. Functionals aligned with this space incur only second-order bias. For structured mean-field variational families we characterize the tangent space explicitly and show that it consists of block-additive functions of the parameter blocks, while interaction components determine the leading-order bias. Under standard local asymptotic normality conditions we further derive explicit asymptotic expansions for the bias of posterior functionals and show that omitted interaction directions produce first-order distortion of cross-block dependence measures. These results provide a geometric explanation for several well-known properties of mean-field variational inference, including the systematic distortion of cross-block dependencies.
Read the full abstract
Functional Analysis
Demi Weak Dunford-Pettis Operators
In this paper, our main goal is to introduce the class of Demi Weak Dunford-Pettis operators. We also investigate its relationship with the classes of weak Dunford-Pettis and demi Dunford-Pettis operators, as well as conditions under which this class coincide with the classes of demi Dunford-Pettis and demicompact operators. In the final section, we study some properties of this new class in the setting of Banach lattices.
Read the full abstract
Differential Geometry
A Bianchi-Calo method for Bryant type surfaces
We present a Bianchi-Calo type construction method for Bryant type linear Weingarten surfaces in hyperbolic space.
Probability
Small noise asymptotics for a class of jump-diffusions with heavy tails for large times
In this work, we investigate positive recurrent Lévy diffusions driven by appropriately scaled Brownian motion and $\alpha$-stable process (with $1<\alpha<2$) in the small noise regime. Supposing that in the vanishing noise limit, our Lévy diffusion approaches a deterministic system with a unique asymptotically stable fixed point, we show that the limiting behavior of the one-dimensional marginal distribution at large times is dictated by the optimal value of a deterministic control problem, just as in the classical case of diffusions driven by small variance Brownian motion. In our case, the control is allowed to have two parts: continuous control and impulse control.
Read the full abstract
Logic
A Note on a Theorem of Apter
We show that the consistency of $\mathrm{ZF} + \mathrm{AD}_{\mathbb{R}} + ``\Theta$ is measurable$"$ implies the consistency of $\mathrm{ZF} +``\Theta$ is the least strongly regular cardinal and the least measurable cardinal$"$ + $``$all uncountable cardinals below $\Theta$ are of countable cofinality$"$.
Read the full abstract
Analysis of PDEs
The Batchelor spectrum for a deterministically driven passive scalar
We study the long-time behavior of a passive scalar transported by an incompressible flow in the presence of smooth, deterministic forcing. For a specific spatially Lipschitz and time-periodic velocity field, we prove that all sufficiently smooth initial data is attracted to a limiting solution that satisfies a cumulative form of Batchelor's law. To our knowledge, this provides the first example for which a version of Batchelor's law can be established with deterministic forcing.
Read the full abstract
Dynamical Systems
A Dynamical Approach to Non-Extensive Thermodynamics
We develop a non-extensive thermodynamic formalism for the one-sided shift on a finite alphabet, inspired by Tsallis' generalization of Boltzmann entropy in statistical physics. We introduce notions of $q$-entropy, $q$-pressure, and $q$-transfer operators which extend the classical thermodynamic formalism when $q=1$. We prove a Bowen-type relation linking the $q$-pressure with a $(2-q)$-Ruelle transfer operator and show that $q$-equilibrium states correspond to classical equilibrium states for a related potential. We establish the existence and uniqueness of $q$-equilibrium states for Lipschitz potentials, prove the differentiability of the $q$-pressure, and obtain variational principles for both the $q$-pressure and a related asymptotic pressure. Finally, we study cohomological equations associated with $(2-q)$-transfer operators and prove the differentiable dependence of their solutions on the potential, yielding an alternative construction of eigenfunctions for classical Ruelle operators.
Read the full abstract
Combinatorics
Degree-based weighted adjacency matrices: spectra, integrality, and edge deletion effects
We study degree-based weighted adjacency matrices associated with symmetric edge-weight functions $\phi(d_u,d_v)$, with emphasis on complete multipartite graphs and spectral changes caused by edge modification. We characterize its families with three distinct eigenvalues and identifies integral matrices. For complete graphs, an exact threshold is obtained that determines whether deleting one edge increases, preserves, or decreases both the spectral radius and the weighted energy; the generalized Randić family is classified completely, thereby correcting and refining earlier published results in [Bilal and Munir, Int. J. Quantum Chem. (2024)]. We further determine the $ISI$ spectrum under edge deletion from regular complete multipartite graphs, derive the complete weighted spectrum, energy, and inertia of crown multipartite graphs, and prove that adding an edge between two leaves of $S_n$ strictly increases its $ISI$ energy.
Read the full abstract
Analysis of PDEs
Linearized Boundary Control Method for Damping Reconstruction in an Acoustic Inverse Boundary Value Problem
We develop a linearized boundary control method for the inverse boundary value problem of determining the damping coefficient in the damped wave equation. The objective is to reconstruct an unknown perturbation in a known background damping from the linearized Neumann-to-Dirichlet map. When the linearization is at a constant background damping, we derive a reconstructive algorithm with stability estimates based on the boundary control method in dimension $n\geq 1$. The reconstruction algorithm is implemented in one dimension to validate its numerical feasibility. When the linearization is at a non-constant background damping, we establish an increasing stability estimate in the time domain in dimension $n\geq 3$.