Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 14 April

General Topology

The converse to Borsuk's result on fans fails

A fan is an arc-wise connected hereditarily unicoherent continuum with exactly one branching point. By a result of Borsuk, every fan is a 1-dimensional continuum that can be expressed as the union of a family of arcs, each pair of which intersects in the branching point. In this paper, we prove that the converse does not hold by providing a more general result.
Read the full abstract

Functional Analysis

Widths of embeddings of Gaussian Sobolev spaces

In this paper, we investigate the approximation problem for functions in Gaussian Sobolev spaces $W^s_p(\mathbb{R}^d, \gamma)$ of smoothness $s > 0$, where the approximation error is measured in the Gaussian Lebesgue space $L_q(\mathbb{R}^d, \gamma)$. Such function spaces naturally arise in the analysis of high-dimensional problems with Gaussian measures and play an important role in various applications, including uncertainty quantification and stochastic modeling. Our main objective is to analyze the asymptotic behavior of fundamental quantities that characterize the complexity of the approximation problem. In particular, we determine the exact asymptotic order of several classes of widths, including Kolmogorov, linear, and sampling widths, which quantify the optimal performance of different approximation methods. The obtained results cover the parameter regimes $1 \leq q < p < \infty$ and $p = q = 2$, where distinct phenomena in terms of approximation rates can be observed.
Read the full abstract

Optimization and Control

Constructing Nested Self-Amplifying Multiperiod Hypergraphs through Mathematical Optimization

This paper proposes an optimization-based framework for the analysis of multiperiod directed multihypergraphs aimed at identifying self-amplifying structures that sustain endogenous growth in complex systems. The approach captures the progressive and nested activation of nodes and hyperarcs, providing a dynamic representation of evolving production and reaction networks. We formulate the problem as a mixed integer optimization model. First, we introduce a tractable linear formulation that captures structural amplification. We then extend this model to a mixed integer nonlinear setting that incorporates a synergistic flow law that generalizes mass-action kinetics in Chemical Reaction Networks and that accounts for interaction effects. This nonlinear formulation is handled through logarithmic transformations and piecewise-linear outer approximations. The framework unifies combinatorial structure selection and flow dynamics, bridging Mathematical Optimization with applications in Economics and Chemistry, including autocatalytic systems related to the Origin of Life. Computational experiments on synthetic instances demonstrate scalability, while an input–output case study illustrates the ability of the model to identify growth-enabling sectors, interdependencies, and structural bottlenecks across different periods, providing actionable insights for the analysis and management of complex systems.
Read the full abstract

Differential Geometry

Strong formality below middle degree implies strong formality

We show that hyperplane sections of strongly formal manifolds inherit strong formality. In particular, this property holds for generalized complete intersections defined by positive line bundles with trivial first de Rham cohomology group. Furthermore, we establish the strong formality of compact Kähler manifolds with central cohomology of width $\frac{n}{2}-1$ and, more generally, of compact $\partial\bar{\partial}$-manifolds with no non-trivial multiplicative relations in cohomology below degree $n+2$. These results arise from the notion of $s$-strong formality, which we adapt from a work of Fernandez and Muñoz to the pluripotential setting. Specifically, we prove that a compact, connected complex manifold of dimension $n$ with trivial first de Rham cohomology group is strongly formal if and only if it is $(n-1)$-strongly formal.
Read the full abstract

Dynamical Systems

Cover time for countable Markov shifts

Cover time, in the context of dynamical systems, quantifies the rate at which orbits cover the system. We prove that for countable full shifts with a Gibbs measure, equipped with a natural metric, the rate of covering of orbits of points behaves according to the minimum measure of balls. Moreover, this rate exhibits sensitivity to changes in the metric.
Read the full abstract

Information Theory

A Heterogeneous Dual-Network Framework for Emergency Delivery UAVs: Communication Assurance and Path Planning Coordination

Natural disasters often damage ground infrastructure, making unmanned aerial vehicles (UAVs) essential for emergency supply delivery. Yet safe operation in complex post-disaster environments requires reliable command-and-control (C2) links; link instability can cause loss of control, delay rescue, and trigger severe secondary harm. To provide continuous three-dimensional (3D) C2 coverage during dynamic missions, we propose a Heterogeneous Dual-Network Framework (HDNF) for safe and reliable emergency delivery. HDNF tightly couples an Emergency Communication Support Network (ECSN), formed by hovering UAV base stations, with a Delivery Path Network (DPN), formed by fast-moving delivery UAVs. The ECSN dynamically safeguards mission-critical flight corridors, while the DPN aligns trajectories with reliable coverage regions. We formulate a joint optimization problem over task assignment, 3D UAV-BS deployment, and DPN path planning to maximize end-to-end C2 reliability while minimizing UAV flight energy consumption and base-station deployment cost. To solve this computationally intractable NP-hard problem, we develop a layered strategy with three components: (i) a multi-layer C2 service model that overcomes 2D-metric limitations and aligns UAV-BS deployment with mission-critical 3D phases; (ii) a 3D coverage-aware multi-agent reinforcement learning algorithm that addresses the high-dimensional search space and improves both training efficiency and topology resilience; and (iii) a 3D communication-aware A* planner that jointly optimizes C2 quality and flight energy, mitigating trajectory–coverage mismatch and improving routing safety. Extensive simulations show that HDNF markedly improves C2 reliability, eliminates outages in critical phases, and sustains high task success rates while reducing hardware deployment cost.
Read the full abstract

All authors Ping Huang, Bin Duo, Ziedor Godfred, Liuwei Huo, Jin Ning, Xiaojun Yuan, Jun Li

Algebraic Geometry

Cyclic AG-Codes on the Hermitian Curve

Cyclic AG-codes $C_L(D,G)$ on the Hermitian curve $H_q$ over $\mathbb{F}_{q^2}$ are constructed such that $G = m(P_2 + \ldots + P_q)$, where $2 \le m \le q-1$ and $\mathrm{supp}(G)$ is the intersection of $H_q$ with a chord $\ell$ minus two points $P_1, P_{q+1}$. The divisor $D = Q_1 + \ldots + Q_{q^2-1}$ consists of all $q^2 - 1$ points in a single orbit under the action of the (cyclic) 2-point stabilizer $\Gamma$ of $(P_1, P_{q+1})$ in $\mathrm{Aut}(H_q) = \mathrm{PGU}(3,q)$.
Read the full abstract

Differential Geometry

Tensor tomography and frame flow ergodicity for magnetic flows in higher dimensions

We extend two results from the theory of geodesic flows to the magnetic setting on manifolds of arbitrary dimension. First, we investigate the magnetic ray transform and establish a tensor tomography result. Second, we define and analyze the ergodicity of the magnetic frame flow under a pinching condition, building on work of Cekić-Lefeuvre-Moroianu-Semmelmann. These generalizations rely on new Pestov identities tailored to the magnetic flow, which extend and improve identities derived by Dairbekov-Paternain. In the process, we develop a framework that adapts several concepts of Riemannian geometry to the magnetic context, including covariant differentiation, torsion, curvature, and Jacobi fields. Notably, our curvature tensor generalizes the magnetic sectional curvature recently proposed by Assenza.
Read the full abstract

Commutative Algebra

Depth of powers of the edge ideal of an increasing weighted path

We provide exact formulas for the depth of the quotient ring of powers of the edge ideal of an increasing weighted path.
Read the full abstract

All authors Jiaxin Li, Dancheng Lu, Thanh Vu, Guangjun Zhu

Number Theory

Multivariable automatic arrays and transcendence

We study real numbers defined by multidimensional automatic arrays weighted by multiplicatively independent bases. Let $a_1, \dots, a_r\geq 2$ be integers such that $\log a_1, \dots, \log a_r$ are $\mathbb Q$-linearly independent. Given bounded automatic sequences $(p_n(i))_{n\geq 0}$ with $i=1, \dots , r$ and a function $f:\mathbb Z^r\rightarrow \mathbb Z$, we consider the associated series $\alpha = \sum_{n_1,\dots,n_r \geq 0} \frac{f(p_{n_1}(1),\dots,p_{n_r}(r))}{a_1^{n_1}\cdots a_r^{n_r}}$. Using combinatorial properties of automatic sequences and Schmidt's Subspace Theorem, we prove that $\alpha$ is either rational or transcendental. This extends a result of Adamczewski and Bugeaud to the multidimensional setting.
Read the full abstract

Probability

Stochastic analysis of Beckner's and related functional inequalities

Beckner's inequality is a family of inequalities that interpolates the two fundamental functional inequalities, the logarithmic Sobolev and Poincaré's inequalities. It is parametrized by exponent $p\in (1,2]$ and it implies the logarithmic Sobolev inequality as $p\to 1$ and agrees with Poincaré's inequality when $p=2$. In this paper, employing a stochastic method, we prove an improvement of Beckner's inequality under the Gaussian measure when $4/3\le p<2$; in particular, when $p=3/2$, the error bound is expressed in terms of the entropy functional. A similar reasoning to the derivation of the improvement also enables us to obtain a Hölder-type inequality that holds among the entropy, variance and related functionals.
Read the full abstract

Functional Analysis

Fixed Points of Asymptotic Pointwise Contractions under Local Uniform Convergence

We introduce a weak asymptotic version of nonlinear contraction, termed asymptotic pointwise contraction. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances between the $n$-th iterates of any two points. The sequence is assumed to converge pointwise to a limit function, and the convergence is required to be uniform on every bounded set (i.e., locally uniform). The limit function is then controlled by a Boyd–Wong type condition: there exists a nondecreasing, right upper semicontinuous function strictly below the identity on positive numbers, and the limit function is bounded above by this function evaluated at a maximum term that involves not only the distance between the two points but also distances from each point to its image and mutual distances between each point and the image of the other. By standard analytic arguments we prove that if the mapping is continuous on a complete metric space and possesses a bounded orbit, then its iterates converge to a unique fixed point. This result extends Kirk's asymptotic contraction theorem by replacing global uniform convergence on $[0,\infty)$ with the weaker condition of local uniform convergence.
Read the full abstract

Algebraic Geometry

Categorical Torelli theorems for higher Picard rank Fano double covers

We prove categorical Torelli theorems for four families of Fano double covers with Picard rank greater than 1. Among these is the family of Verra fourfolds. The other three families manifest as double covers of Fano threefolds, branched in anticanonical K3 surfaces. For the three families of threefolds, our proof is based on reducing equivalences between the Kuznetsov components of Fano threefolds in the same deformation family to derived equivalences of their respective K3 branch divisors, and deducing that the resulting isomorphism of branch divisors gives rise to an isomorphism of the Fano threefolds for each family. For Verra fourfolds, we show that an equivalence of their Kuznetsov components induces an isomorphism of the branch divisors using the theory of 2-torsion Brauer classes on K3 surfaces.
Read the full abstract

Analysis of PDEs · Cross-listed from eess.SY

Bilinear controllability for the linear KdV-Schrödinger equation

We study the controllability of a linear KdV-Schrödinger equation on the one-dimensional torus via purely imaginary bilinear controls. Considering controls spanning a suitable finite number of Fourier modes, we prove small-time global approximate controllability in L2(T). The result holds between any pair of states with the same norm and is obtained via the saturation method by following the idea introduced in [Poz24]. We first establish small-time controllability for phase multiplications, and then generate transport operators associated with diffeomorphisms of the torus. Finally, we combine these results to recover global approximate controllability. Note that the controllability property holds independently of the Schrödinger component of the dynamics, which may in particular be taken to vanish.
Read the full abstract

Combinatorics

Partial-twuality polynomials of matrices

The study of partial-twuality polynomials originates from the classical operations of geometric duality and Petrie duality on cellularly embedded graphs. These involutions generate the symmetric group $S_3$, and applying them to subsets of edges yields the notions of partial-(geometric) duality, partial-Petriality, and more generally, partial-twuality. In this paper, we generalize this theory of partial-twuality polynomials within the framework of matrix algebra. The key observation that the Euler genus of a bouquet under a partial-twuality can be expressed as a rank function of its adjacency matrix motivates and leads to the definition of a partial-twuality polynomial for an arbitrary square matrix over any field, thereby providing a universal algebraic counterpart to the topological polynomials. We then investigate basic properties of these polynomials, including product formulas, recursion relations, degrees, interpolation behaviors, and invariance and duality theorems under the matrix operations of pivoting and inversion. We conclude by posing some problems for further research.
Read the full abstract

Logic

On a new theory of models for formal mathematical systems

We study a new model theory for formal mathematical systems that we developed in a previous paper. We introduce isomorphic and homomorphic structures for formal languages, present some results and examples and conclude our paper with a discussion about the reduced set theory RST adapted to our new theory.
Read the full abstract

Information Theory

Hierarchical Secure Distributed Linearly Separable Computation with Arbitrary Heterogeneous Data Assignment

This paper studies secure distributed linearly separable computation over a three-layer hierarchical network, where clustered users communicate with a central server through relays. The server aims to recover Kc linear combinations of K intermediate outcomes, where each intermediate outcome is a separable function of one dataset. We consider a more general setting with arbitrary heterogeneous data assignment across users, where `arbitrary' means that the data assignment is given in advance (which can be in any form) and `heterogeneous' means that the users may hold different numbers of datasets. Under this assignment, each user computes the intermediate outcomes of its assigned datasets and sends masked messages to its associated relay. The relays subsequently process and forward the received messages to the server. We impose two security constraints: (i) security against server, requiring the server to learn only the desired task function without gaining any additional information about users' inputs; and (ii) security against relays, ensuring each relay learns nothing about users' inputs. Moreover, the server or any relay may collude with a subset of users. For Kc=1, the underlying computation reduces to distributed gradient coding. We propose a secure scheme tolerating user dropouts and user collusion, achieving the optimal two-layer communication rates in one regime and order-optimal communication rates within a factor of 2 in the other regime. For Kc>1, we extend the proposed construction to multi-dimensional linearly separable tasks under the no-dropout setting.
Read the full abstract

All authors Ziting Zhang, Chenyi Sun, Kai Wan, Xiang Zhang

Analysis of PDEs

Norm inflation and low-regularity ill-posedness for the rod equation

In this paper, we consider the Cauchy problem for the rod equation in the line. By constructing an explicit smooth initial data, we present a new method to prove that this problem is ill-posed in $H^s(\R)$ with $1< s<3/2$ in the sense of norm inflation, i.e., an initial data is smooth and arbitrarily small in $H^s(\R)$ with $1< s<3/2$, but the solution becomes arbitrarily large in the Sobolev space after an arbitrarily short time.
Read the full abstract

Classical Analysis and ODEs

An eigenvalue result for Neumann BVPs with functional terms

We study the existence and localization of eigenvalue-eigenfunction pairs for parameter-dependent Neumann BVPs with a functional term. By reformulating the problems as a Hammerstein integral equation, we apply an existence and localization result and propose a convergent fixed-point iteration scheme. Finally, two pseudocodes and a MATLAB implementation are provided to numerically approximate the eigenvalues and validate the theoretical localization bounds. We also illustrate an approximation of the eigenfunctions for a fixed norm.
Read the full abstract

Analysis of PDEs

A Doubly Critical Elliptic Problem with Submanifold Singularities

Let $N \ge 4$, $\Omega$ be a bounded domain in $\mathbb{R}^N$, and let $\Sigma \subset \Omega$ be a smooth closed submanifold of dimension $k$ with $2 \le k \le N-2$. We study the existence of positive solutions $u \in H_0^1(\Omega)$ to the Euler–Lagrange equation \[ -\Delta u + h u = \lambda\, \rho_{\Sigma}^{-s_1}\, u^{2^{*}_{s_1}-1} + \rho_{\Sigma}^{-s_2}\, u^{2^{*}_{s_2}-1} \quad \text{in } \Omega, \] where $h : \Omega \to \mathbb{R}$ is a continuous potential, $\lambda > 0$ is a real parameter, and $0 \le s_2 < s_1 < 2$. For $i=1,2$, the exponents \[ 2^{*}_{s_i} = \frac{2(N - s_i)}{N - 2} \] correspond to Hardy–Sobolev critical growth, and $\rho_{\Sigma} = \mathrm{dist}(\,\cdot\,, \Sigma)$ denotes the distance to the submanifold $\Sigma$. The problem involves two Hardy-type singular nonlinearities with different critical exponents, leading to a lack of compactness. Using variational methods, in particular the mountain pass lemma, together with a suitable construction of test functions, we prove existence results under appropriate assumptions. Our analysis shows that the local geometry of $\Sigma$ and the behavior of the potential $h$ near $\Sigma$ play a crucial role in the existence of positive solutions for this doubly critical problem.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Notes on some inequalities, resulting uncertainty relations and correlations

We analyze the Schwarz inequality and its generalizations, as well as inequalities resulting from the Jensen inequality. They are used in quantum theory to derive the Heisenberg-Robertson (HR) and Schroedinger-Robertson (SR) uncertainty relation for two non-commuting observables and their generalizations to three or more non-commuting observables. Jensen's inequality, in turn, is helpful in deriving various the "sum uncertainty relations" for two or more observables. Using these inequalities, we derive various types of generalized uncertainty relations for more than two non–commuting observables and analyze their properties and critical points. We also study the connections between the generalizations of the HR and SR uncertainty relations for two and more observables and the correlations of these observables in the state of the quantum system under study. In this analysis, we pay special attention to the consequences of the generalized SR uncertainty relation for three non–commuting observables on their correlations in a given state of a quantum system and to the connections of this relation with the appropriate correlation matrix, whose matrix elements are the quantum versions of the Pearson coefficient. We show also that the SR uncertainty relation (including the generalized ones) can be written in an equivalent way using these Pearson coefficients.
Read the full abstract

Combinatorics

Maximizing the Steklov eigenvalues on trees with a diameter constraint

We study the first nonzero Steklov eigenvalue $\lambda_2(T,\delta\Omega)$ of the Dirichlet-to-Neumann operator on a finite tree $T$ with leaf boundary $\delta\Omega$, under a constraint on the diameter $D$. He and Hua [Calc. Var. PDE, 2022] showed that $\lambda_2(T) \leq 2/D$ for any tree of diameter $D$, with the even-diameter equality case fully characterized. For odd $D$, the geometric picture underlying the sharp configurations has remained unclear beyond diameter three. We determine this picture completely for all odd diameters $D = 2r+1 \geq 5$. The sharp value of $\lambda_2$ is achieved on spider trees with nearly-equidistributed branch lengths, forming the family of generalized almost seesaw trees $\mathrm{AS}(r,q+2,c,t)$, prescribed by the arithmetic of $n$ relative to $\lceil r/2 \rceil$. Together with the results of He-Hua and Lin-Zhao [Bull. Lond. Math. Soc., 2025] for even diameters and diameter three, this completes the geometric classification for every diameter. The argument is based on a scalar root equation for one-center profiles, an inverse boundary quadratic form on boundary fluxes, and a reduction scheme from arbitrary trees to two-center profiles, and then to the one-center class. The inverse variational viewpoint may be regarded as a boundary analogue of the classical distance-matrix formalism for trees initiated by Graham and Lovász [Adv. Math., 1978].
Read the full abstract

Mathematical Physics

Contact Geometry of Relativistic Particle Motion

We introduce a new geometric framework for relativistic particle dynamics based on contact geometry and suitable for treating dissipative processes like particle decay. The dynamics is formulated on a nine–dimensional extended phase space consisting of four position coordinates, four momenta, and an additional variable (functioning as a geometric variant of the particle's proper time). In this setting, the evolution is generated by an evolution contact vector field with a contact Hamiltonian encoding the mass shell. By promoting the proper time to an independent variable, the relativistic Hamilton canonical equations are rewritten in a fully geometric form without having to identify the proper time with a parameter along the worldlines. This makes for instance the evolution of massless particles (photons) well-defined without the need of reparametrization. The framework is then applied to decaying particles. Finally, we formulate a covariant kinetic theory and show how decaying particles can be described geometrically in this framework, changing the entropy.
Read the full abstract

Numerical Analysis

Nitsche method for the Stokes-Poisson-Boltzmann equation with Navier slip boundary condition

We study the Stokes–Poisson–Boltzmann equations with Dirichlet and Navier boundary conditions. The system consists of the incompressible Stokes equations coupled with a nonlinear Poisson–Boltzmann equation through electrostatic forcing and convective transport effects. To handle the Navier boundary conditions in a unified framework, we employ Nitsche's method for their weak imposition within a conforming finite element setting. We derive a consistent and stable discrete formulation and establish the well-posedness of the resulting problem. By carefully choosing the penalty parameters, the bilinear form is shown to be coercive and continuous. A priori error estimates are proved in the natural energy norms, yielding optimal-order convergence under suitable regularity assumptions. Furthermore, we develop residual-based a posteriori error estimators that incorporate element residuals, inter-element jump residuals, and boundary residuals arising from the Nitsche formulation. The estimators are shown to be reliable and locally efficient. Numerical experiments confirm the theoretical results and demonstrate the robustness and accuracy of the proposed method for the Stokes–Poisson–Boltzmann system.
Read the full abstract

Mathematical Physics

The parity operator for parafermions and parabosons

In this paper we reexamine the definition of parafermions and parabosons by means of Green's triple relations, and extend these relations by including a parity operator $P$ which is also determined by means of triple relations. As a consequence, we are dealing with new algebraic structures. It is shown that the algebra underlying a set of $n$ parafermions together with $P$ is the orthogonal Lie algebra $so(2n+2)$. The Fock spaces correspond to particular irreducible representations of $so(2n+2)$, and the action of $P$ in these spaces leads to interesting observations. Next, we show that the algebra underlying a set of $n$ parabosons together with $P$ is the orthosymplectic Lie superalgebra $osp(2|2n)$. In this case, the Fock spaces correspond to certain irreducible infinite-dimensional representations of $osp(2|2n)$. Both for parafermions and parabosons the spectrum of $P$ is closely related to the so-called order of statistics $p$, introduced by Green.
Read the full abstract

Combinatorics

Enumerations and Bijections for Stanley Polyominoes

Stanley polyominoes are a subclass of parallelogram polyominoes in which each row begins strictly to the right of the beginning of the previous row and ends strictly to the right of the end of the previous row. In this paper, we derive generating functions for Stanley polyominoes with respect to the numbers of columns and rows, area, semiperimeter, and numbers of interior points and edges. We also establish combinatorial connections through bijections with other combinatorial structures such as Dyck paths, skew Ferrers diagrams, and peakless Motzkin paths. As a byproduct, we answer the open question of finding a bijection between parallelogram polyominoes of area $n$ with $k$ columns and coin fountains with $n$ coins in the odd-numbered rows and $n-k$ coins in the even-numbered rows.
Read the full abstract

Dynamical Systems · Cross-listed from quant-ph

A Periodic Orbit Trace Formula for Quantum Scrambling: The Role of the Normally Hyperbolic Invariant Manifold

Out-of-Time-Order Correlators (OTOCs) quantify quantum information scrambling, but their connection to localized phase-space structures, such as chemical transition states, requires formal development. We derive a leading-order semiclassical expansion for the local microcanonical OTOC in systems with an index-1 saddle point, expressing the scrambling rate as a coherent sum over unstable periodic orbits on the Normally Hyperbolic Invariant Manifold (NHIM). Valid in the semiclassical limit and the intermediate-time regime before the Ehrenfest time, our derivation utilizes the Normal Form theory of the transition state, which transforms the Hamiltonian near the saddle into an integrable (though generally non-separable) form dependent on conserved actions. We outline the derivation of the microcanonical trace, the semiclassical propagator for integrable systems, the factorization of the stability matrix, and the Schur complement reduction of the stationary phase approximation. Our result extends periodic-orbit trace methods to scrambling observables, yielding a local instability exponent {\Lambda}(J) governing the leading semiclassical growth window. As a special case, when the observation time coincides with the intrinsic periods of the contributing orbits, the trace sum reduces to an effective 1.5{\Lambda} scaling, resulting from the competition between local hyperbolic growth and wavepacket dilution. This simplified form is conditional; the full expansion retains a coherent sum over orbit periods. Finally, we discuss how the dependence of the instability on transverse actions establishes a theoretical mechanism for mode-selective control of scrambling, and outline a numerical evaluation strategy to test these predictions.
Read the full abstract

Algebraic Geometry

Higher F-rational singularities

We introduce higher $F$-rationality generalising $F$-rationality. We prove that a normal variety over a field of characteristic zero is $m$-rational if and only if it is $m$-$F$-rational after reduction modulo a sufficiently large prime $p$. Additionally, we establish new results on the logarithmic extension of forms.
Read the full abstract

Rings and Algebras

Graded Equivalence for Graded Idempotent Rings

In this paper, we extend the study of graded equivalences to the case of general idempotent graded rings. We prove that the existence of a graded equivalence between two categories of graded torsion-free unital modules may be characterized by the existence of a Morita context with surjective trace maps. As an application of our results we relate certain lattices of graded submodules and graded ideals of graded equivalent garded rings and give some properties invariant under graded equivalences.
Read the full abstract

Information Theory · Cross-listed from stat.ML

Information-Geometric Decomposition of Generalization Error in Unsupervised Learning

We decompose the Kullback–Leibler generalization error (GE) – the expected KL divergence from the data distribution to the trained model – of unsupervised learning into three non-negative components: model error, data bias, and variance. The decomposition is exact for any e-flat model class and follows from two identities of information geometry: the generalized Pythagorean theorem and a dual e-mixture variance identity. As an analytically tractable demonstration, we apply the framework to $\epsilon$-PCA, a regularized principal component analysis in which the empirical covariance is truncated at rank $N_K$ and discarded directions are pinned at a fixed noise floor $\epsilon$. Although rank-constrained $\epsilon$-PCA is not itself e-flat, it admits a technical reformulation with the same total GE on isotropic Gaussian data, under which each component of the decomposition takes closed form. The optimal rank emerges as the cutoff $\lambda_{\mathrm{cut}}^{*} = \epsilon$ – the model retains exactly those empirical eigenvalues exceeding the noise floor – with the cutoff reflecting a marginal-rate balance between model-error gain and data-bias cost. A boundary comparison further yields a three-regime phase diagram – retain-all, interior, and collapse – separated by the lower Marchenko–Pastur edge and an analytically computable collapse threshold $\epsilon_{*}(\alpha)$, where $\alpha$ is the dimension-to-sample-size ratio. All claims are verified numerically.
Read the full abstract