Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 4 March

Functional Analysis

A new class of function spaces generalizing the Arias-de-Reyna space

This paper studies the structure and properties of a rearrangement-invariant quasi-Banach space $QA_{\varphi,\psi}$ which generalizes the classical space $QA$ introduced by Arias-de-Reyna in connection with the study of the pointwise almost everywhere convergence of Fourier series. We present basic properties of $QA_{\varphi,\psi}$ and explore the relationship between $QA_{\varphi,\psi}$ and other rearrangement-invariant Banach spaces.
Read the full abstract

General Topology

Completeness of topological spaces: An induction-free review

Completeness for a (topological) space is often based on the existence of special structures (such as metrics, uniformities, proximities, convergences, etc) that explicitly induce the topology, making the completeness induction-dependent. However, in any given space $X=(X,\tau)$, suppose we fix a base $\mathcal{B}$ of $\tau$ that is graded, in the sense it is partitioned as $\mathcal{B}=\bigcup_{\varepsilon\in \mathcal{E}}\mathcal{B}_\varepsilon$ into open covers $\mathcal{B}_\varepsilon$ of $X$, making $X=(X,\tau,\mathcal{B})$ a (graded) base space. If we now relax the notion of convergence of nets to a notion of approach between nets in $X$, then we obtain a more natural induction-free notion of a cauchy net in a base space, hence a corresponding induction-free notion of completeness for base spaces. We find that many classical concepts and results on completeness for uniform spaces carry over to completeness for a certain class of base spaces (named locally symmetric base spaces or \emph{$lsb$-spaces}) that properly contains uniform spaces. The said classical results include characterization of compactness, Baire's theorem, existence of a completion, and completeness results for product and function $lsb$-spaces.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

K-Means as the Zero-Temperature Limit of Normalized RBF Assignments: Rates, Trajectories, and Exact Recovery with Entmax

K-Means is usually treated as a discrete procedure outside gradient-based learning, whereas normalized radial basis function (RBF) layers are smooth. We make precise the sense in which K-Means is the zero-temperature limit of such a layer. Relaxing the K-Means assignments to the simplex with a Shannon entropy penalty yields the normalized Gaussian RBF responsibilities and a reduced objective $F_\sigma$ with $0\le J-F_\sigma\le 2n\sigma^2\log k$, so $F_\sigma$ $\Gamma$-converges to the K-Means distortion $J$. We keep four levels of statement apart. For the objective, minimal values and minimizers converge, and above the critical temperature $\sigma^2=\lambda_{\max}$ all centroids at the mean form a strict local minimizer. For optimization, alternating minimization is a preconditioned gradient method on $F_\sigma$ whose hard limit is Lloyd's algorithm. For one update, under a margin $\Delta_{\min}>0$, the soft centroid map approaches Lloyd's at rate $O(e^{-\Delta_{\min}/2\sigma^2})$. For fixed points and trajectories, every nondegenerate Lloyd fixed point has a nearby soft local minimizer, and soft iterates keep Lloyd's partitions while Lloyd's path keeps a margin. With the Tsallis entropy of order 3/2, Entmax-1.5 recovers the hard assignments, the Lloyd update and, along a path with margin, Lloyd's trajectory exactly for $\sigma\le\sqrt{\Delta_{\min}}/2$, a sharp threshold. Experiments on sixteen datasets confirm every bound, rate and threshold, and the trajectory statements at the edge of their hypotheses. As a differentiable K-Means term, $F_\sigma$ shows the predicted effects: its gradients do not vanish at low temperature, its closed-form centroid update needs no learning rate, a fixed temperature crosses the critical one as representations contract, and soft responsibilities keep a vector-quantized codebook in use.
Read the full abstract

Algebraic Topology

Discrimination of Dynamic Data via Curvature Sets

Techniques from topological data analysis (TDA) have proven effective in studying time-dependent data arising in dynamic systems, such as animal swarming behavior and spatiotemporal patterns in neuroscience. While early algorithms leveraged efficient updates to persistence diagrams for dynamic data, they struggled to distinguish behaviors that are isometric at each fixed time but differ qualitatively. This limitation was addressed by Kim and Mémoli, who introduced a spatiotemporal persistence framework for dynamic metric spaces, resulting in multiparameter persistence modules. However, these modules pose computational challenges. To address this, we build on insights from Gómez and Mémoli, who observed that the homology of Rips complexes over size $(2k+2)$ point subsets of a metric space–termed principal curvature sets–is both tractable and informative. We extend this idea to dynamic settings by introducing dynamic curvature-set persistent homology, applying the spatiotemporal framework of Kim and Mémoli to curvature sets. We prove that the resulting multiparameter persistence modules are interval-decomposable: in fact, they possess a stronger property we term antichain-decomposable. Utilizing this property, we present a new algorithm to efficiently compute the erosion distance $d_E$ (due to Patel) between arbitrary antichain-decomposable modules (including, but not limited to modules produced by our construction). Additionally, our construction is stable with respect to a generalized Gromov-Hausdorff distance between time-dependent datasets proposed by Kim and Mémoli. This enables a robust computational pipeline for distinguishing dynamic data, as demonstrated in experiments with the Boids model, where we successfully detect parameter changes.
Read the full abstract

All authors Nadezhda Belova, Maxwell Goldberg, Facundo Memoli, Sriram Raghunath, Andrew Xie

Mathematical Physics · Cross-listed from hep-th

The Chern-Simons Natural Boundary and Black Hole Entropy

The method of resurgent continuation of transseries reveals a new correspondence between the $q$-series for enumerating degeneracies of quarter-BPS states in supersymmetric black holes and $\hat{Z}$ invariants of Chern-Simons theory on a class of 3 dimensional orientation-reversed manifolds.
Read the full abstract

Probability

Heat kernel estimates on book-like graphs

In this paper, we prove two-sided heat kernel estimates on what we call "book-like" graphs. These are graphs consisting of pieces that satisfy the parabolic Harnack inequality that are glued together in a sufficiently nice way over a possibly infinite set of vertices. The prototypical example is gluing a copy of the square four-dimensional lattice $\mathbb{Z}^4,$ a copy of $\mathbb{Z}^5$, and a copy of $\mathbb{Z}^6$ by identifying their $x_1$-axes and taking the lazy simple random walk on this glued graph. Our results are flexible enough to handle perturbations of this example, for instance by adding diagonals to one of the lattices or a few extra vertices/edges.
Read the full abstract

Group Theory

Combinatorial Characterizations of Virtually Torsion-Free and Virtually Free Groups

We establish combinatorial characterizations of virtually torsion-free and virtually free groups using the canonical graph decomposition theory in \cite{DJKK22}. Our main results show that a finitely presented, residually finite group $\Gamma$ is virtually torsion-free if and only if there exists a locality parameter $r>0$ such that its $r$-local cover admits a canonical tree-decomposition with finite quotient and finite adhesion, every finite subgroup of $\Gamma$ fixes a vertex of this decomposition, and the finite subgroups in each bag have uniformly bounded order. Moreover, a finitely generated group $\Gamma$ is virtually free if and only if for some $r>0$ its $r$-global decomposition has a finite model graph with finite bags and the tree-decomposition of the $r$-local cover is $\Gamma$-equivariantly isomorphic to the Bass–Serre tree arising from a splitting of $\Gamma$ as a finite graph of finite groups.
Read the full abstract

Statistics Theory

KRAFTY: Khatri-Rao Framework for Joint Cluster Recovery

When multiple datasets describe complementary information about the same set of entities, for example, brain scans of an individual over time, global trade network across years, or user information across social media platforms, integrating these snapshots allows us to see a more holistic picture. A common way of identifying structure in data is through clustering, but while clustering may be applied to each dataset separately, we learn more in the multi-view setting by identifying joint clusters. We consider a clustering problem where each view conflates some of these joint clusters, only revealing partial information, and seek to recover the true joint cluster structure. We introduce this multi-view clustering model and a method for recovering it: the transposed Khatri-RAo Framework for joinT cluster recoverY (KRAFTY). The model is flexible and can accommodate a variety of data-generating processes, including latent positions in random dot product graphs and Gaussian mixtures. A key advantage of KRAFTY is that it represents joint clusters in a space with sufficient dimension so that each joint cluster occupies an orthogonal subspace in the transposed Khatri-Rao matrix, which results in a sharp drop in the scree plot at the true number of joint clusters, enabling easy model selection. Our simulations show that when the number of joint clusters exceeds the sum of the numbers of clusters in each individual view, our method outperforms existing methods in both joint clustering accuracy and estimation of the number of joint clusters.
Read the full abstract

Number Theory

BSD Invariants and Murmurations of Elliptic Curves

We study how the murmurations of elliptic curves over $\mathbb{Q}$ depend on the invariants in the Birch-Swinnerton-Dyer formula, using the Frobenius traces at all primes up to $10^5$ for one curve in each isogeny class of conductor below $10^5$. In these data, at the murmuration scale the rank-$0$ profile depends on the central value $L(E,1)$, in its shape and in the position of its sign changes. Through the series for $L(E,1)$, the covariance of $a_p$ with $L(E,1)$ is exactly a sum of covariances of $a_p$ with the coefficients $a_n$ weighted by a factor that depends on $n$ and the conductor; numerically, in this conductor range, the terms with $n\le50$ reproduce its shape (correlation $0.998$, largest deviation $0.29$ against a largest absolute covariance of $3.03$). Empirically, for $q=3$, $5$, $7$ and $11$ the unweighted covariance of $a_p$ with $a_q$ has nearly the shape of the rank-$0$ profile dilated by a factor near $q$; for $q=2$ the agreement is weaker. Weighting by the Tamagawa product changes the rank-$0$ profile substantially on $0.025<y\le0.125$; after standardisation to the deciles of $\log L(E,1)$, the change summed over these bins is 13% of the unstandardised one (17% for sums of absolute values), and in the lowest bin the standardised change is larger than the unstandardised one and of opposite sign. This version replaces the earlier versions (v1 and v2); their claim that the Tate-Shafarevich group carries information about Frobenius traces beyond the other invariants taken together cannot hold, because its analytic order is defined by the BSD formula, and it is withdrawn.
Read the full abstract

Logic

Escaping Tennenbaum's Theorem and a Strong Jump Inversion Theorem

Tennenbaum's theorem states that PA does not admit any nonstandard computable model. In 2022, Pakhomov proved that this theorem is fragile in regards to how PA is expressed, by constructing a theory that is definitionally equivalent to PA (roughly: "it's PA but with a different choice of signature") for which there is a computable nonstandard model. He showed that this fragility does not extend to true arithmetic (any nonstandard model of a theory definitionally equivalent to $\mathrm{Th}(\mathbb{N})$ is not computable), but the question of whether this fragility extends to fragments of PA of intermediate strength was left open. We show that it does, by constructing a sequence of theories $T^n$ which are definitionally equivalent to: "PA plus all $\Pi^0_n$ truths", all of which admit computable nonstandard models. In the process, we produce a general-purpose theorem for strong jump inversion. Besides applying this theorem to obtain our novel result, we show that several known results from the literature can be seen as direct applications of our theorem.
Read the full abstract

Probability

Characterization of the (fractional) Malliavin-Watanabe-Sobolev spaces $\mathcal{D}^{\alpha,2}$ via the Bargmann-Segal norm

Motivated by an open question going back to P.Malliavin and P.-A.Meyer (and closely related to the foundational work of S.Watanabe) on whether Malliavin-Watanabe-Sobolev regularity admits a characterization in terms of a holomorphic Laplace image similar as for Hida distributions, we establish a characterization of the spaces $\mathcal{D}^{\alpha,2}$ for all $\alpha\in\mathbb{R}$ via the Bargmann-Segal norm of the $S$-transform. More precisely, we express $\mathcal{D}^{\alpha,2}$-regularity, $\alpha > 0$, of $F\in L^{2}(\mu)$, as well as dual regularity of distributions, in terms of integrability, differentiability and growth properties of the function \[ (0,1) \ni \lambda \longmapsto \int_{\mathcal{S}'_{\mathbb{C}}} |SF(\lambda u)|^{2}\,d\nu(u) \] involving integer-order derivatives in $\lambda$ for $\alpha\in\mathbb{N}$ and Riemann-Liouville fractional derivatives/integrals for non-integer $\alpha$. Here $\nu$ is the Gaussian Bargmann-Segal measure. This yields practical criteria for both positive and negative (including fractional) orders of Malliavin regularity and thereby bridges Malliavin calculus and Bargmann-Segal techniques from white noise analysis. Applications are worked out for Donsker's delta, self-intersection local times of Gaussian processes, and Gauss kernels.
Read the full abstract

Complex Variables

Central Limit Theorems for Common Zeros via Bergman Kernels

We prove central limit theorems as \(N\to\infty\) for common-zero statistics of \(k\) independent standard Gaussian holomorphic sections of \(L^N\), where \(L\) is a positive Hermitian holomorphic line bundle over a compact Kähler manifold of complex dimension \(m\). For fixed real \(\mathscr C^3\) forms \(\varphi\) of bidegree \((m-k,m-k)\) with \(\partial\bar\partial\varphi\not\equiv0\), we prove the CLT in codimensions \(2\leqslant k\leqslant m\) and show that the integrated coefficient in the Shiffman–Zelditch variance formula at scale \(N^{2k-m-2}\) is strictly positive. Shiffman and Zelditch proved the unconditioned smooth CLT for \(k=1\). For \(1\leqslant k\leqslant m\) we also prove a CLT for weighted volumes in fixed domains \(U\) with \(\mathscr C^2\) boundary and fixed real \(\mathscr C^3\) weights \(f\) whose restriction to \(\partial U\) is not identically zero. The variance of a weighted volume is asymptotic to \(N^{2k-m-1/2}\nu_{m,k}\int_{\partial U}f^2\,\mathrm d\sigma\), with \(\nu_{m,k}>0\) the Shiffman–Zelditch boundary constant and \(\sigma\) the induced surface measure. For \(k=m\) and \(f\equiv1\), the statistic counts common zeros in \(U\). Conditioning each section to vanish on the same fixed finite set preserves the leading variance and the Gaussian limit for both classes of tests, including smooth tests for \(k=1\). The set may meet \(\partial U\). A Bergman kernel criterion yields variance bounds and the new unconditioned CLTs from a uniform local \(L^2\) Bargmann–Fock limit and integrable off-diagonal derivative bounds.
Read the full abstract

2603.04588 · 4 Mar · 67 pages, 1 figure. Substantially revised and retitled. Extends the domain CLT to weighted volumes and identifies their leading variance. Shows that conditioning all sections to vanish on the same fixed finite set preserves the leading variance and Gaussian limit. Adds a Bergman kernel criterion and an explicit lower bound for the integrated smooth variance coefficient

Mathematical Physics · Cross-listed from gr-qc

Aspects of Relativity in Flat Spacetime

A monograph on the mathematical aspects of Special Relativity, focusing on the Lorentz group and the properties of relativistic transformations in mechanics and electrodynamics. Manuscript of published book, with added appendices.

Number Theory

Restricted set addition in finite abelian groups

Let $A$ be a nonempty subset of finite abelian group $G$ of order $n$. For an integer $h \geq 2$, the restricted $h$-fold sumset $h^\wedge A$ is the set of all sums of $h$ distinct elements of $A$. It is known that if $G$ is a group of order $n$ and $A$ is a subset of $G$ such that $|A|$ is close to $\frac{n}{2}$, then $h^{\wedge}A = G$ under some conditions on $h$ and $n$. The constant $\frac{1}{2}$ is optimal for groups of even order but not for groups of odd order. For an integer $h \geq 4$, let $\alpha_h$ be the unique positive root of the polynomial $3^{h - 2} x^{h - 1} + x - 1$. In this paper, we show that for any $\alpha > \alpha_h$, there exists a positive integer $M_h(\alpha)$, which is determined precisely, such that for all $n > M_h(\alpha)$ with $n$ odd, if $A$ is a subset of a finite abelian group $G$ of order $n$ and if $|A| \geq \alpha n$, then $h^{\wedge} A = G$. Moreover, $\alpha_h > \alpha_{h + 1}$ for $h \geq 4$ and $\alpha_h$ approaches $\frac{1}{3}$ as $h$ increases, and the constant $\frac{1}{3}$ is optimal when the smallest prime dividing $n$ is $3$. This result extends a theorem of Tang and Wei on $4^{\wedge}A$ in the cyclic group $\mathbb{Z}_n$ to $h^{\wedge}A$ for every $h \geq 4$, and to arbitrary finite abelian groups.
Read the full abstract

Algebraic Topology

Estimation of Persistence Diagrams via the Three Gap Theorem

The time delay (or Sliding Window) embedding is a technique from dynamical systems to reconstruct attractors from time series data. Recently, descriptors from Topological Data Analysis (TDA) – specifically, persistence diagrams – have been used to measure the shape of said reconstructed attractors in applications including periodicity and quasiperiodicity quantification. Despite their utility, the fast computation of persistence diagrams of sliding window embeddings is still poorly understood. In this work, we present theoretical and computational schemes to approximate the persistence diagrams of sliding window embeddings from quasiperiodic functions. We do so by combining the Three Gap Theorem from number theory with the Persistent Künneth formula from TDA, and derive fast and provably correct persistent homology approximations. The input to our procedure is the spectrum of the signal, and we provide numerical as well as theoretical evidence of its utility to capture the shape of toroidal attractors.
Read the full abstract

Mathematical Physics

Split Casimir Operator of the Lie Algebra so(2r) in Spinor Representations, Colour Factors and Yang-Baxter Equation

In this paper, we derive characteristic identities for the split Casimir operator of the Lie algebra $so(2r)$ in tensor products of spinor representations of the same and opposite chiralities. Using these identities, we explicitly construct projectors onto invariant subspaces of this operator and compute their traces. The results obtained allow us to derive explicit expressions for the colour factors of ladder Feynman diagrams in gauge theories with gauge group $Spin(2r)$. In addition, we obtain a new form of a solution to the Yang-Baxter equation that is invariant under the action of the Lie algebra $so(2r)$ in spinor representations.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Tight inapproximability of max-LINSAT and implications for decoded quantum interferometry

We establish tight inapproximability bounds for max-LINSAT, the problem of maximizing the number of satisfied linear constraints over the finite field $\mathbb{F}_q$, where each constraint accepts $r$ values. Specifically, we prove by a direct reduction from Håstad's theorem that no polynomial-time algorithm can exceed the random-assignment ratio $r/q$ by any constant, assuming $\mathsf{P} \neq \mathsf{NP}$. This threshold coincides with the $\ell/m \to 0$ limit of the semicircle law governing decoded quantum interferometry (DQI), where $\ell$ is the decoding radius of the underlying code. Together, these observations delineate the boundary between worst-case hardness and potential quantum advantage, showing that any algorithm surpassing $r/q$ must exploit instance structure beyond what is present in the hard instances produced by PCP reductions.
Read the full abstract

Information Theory · Cross-listed from cs.LO

Complete Diagrammatic Axiomatisations of Relative Entropy

Relative entropy is a fundamental class of distances between probability distributions, with widespread applications in probability theory, statistics, and machine learning. In this work, we study relative entropy from a categorical perspective, viewing it as a quantitative enrichment of categories of stochastic matrices. We consider two natural monoidal structures on stochastic matrices, given by the Kronecker product and the direct sum. Our main results are complete axiomatisations of Kullback-Leibler divergence and, more generally, of Rényi divergences of arbitrary order, for each such structure. Our axiomatic theories are formulated within the framework of quantitative monoidal algebra, using a graphical language of string diagrams enriched with quantitative equations.
Read the full abstract

History and Overview of Mathematics · Cross-listed from cs.AI

Discovering mathematical concepts through a multi-agent system

Mathematical concepts emerge through an interplay of processes, including experimentation, efforts at proof, and counterexamples. In this paper, we present a new multi-agent model for computational mathematical discovery based on this observation. Our system, conceived with research in mind, poses its own conjectures and then attempts to prove them, making decisions informed by this feedback and an evolving data distribution. Inspired by the history of Euler's conjecture for polyhedra and an open challenge in the literature, we benchmark with the task of autonomously recovering the concept of homology from polyhedral data and knowledge of linear algebra. Our system completes this learning problem. Most importantly, the experiments are ablations, statistically testing the value of the complete dynamic and controlling for experimental setup. They support our main claim: that the optimisation of the right combination of local processes can lead to surprisingly well-aligned notions of mathematical interestingness.
Read the full abstract

All authors Daattavya Aggarwal, Oisin Kim, Carl Henrik Ek, Challenger Mishra

Operator Algebras

The Unitary Conjugation Groupoid of a Type I C*-Algebra: Topology, Fell Continuity, and the Canonical Diagonal Embedding

This paper introduces a canonical Polish groupoid associated to any separable unital C*-algebra, termed the unitary conjugation groupoid. It is defined as the semidirect product of the algebra's dual space by its unitary group, acting by conjugation. Classical groupoid models for C*-algebras typically require additional structure such as a Cartan subalgebra and rely on the locally compact Hausdorff framework. In contrast, our construction is entirely canonical but forces a paradigm shift: the natural topologies on the dual space and the unitary group are not locally compact. To address this, we equip the dual space with a Polish topology derived from the weak-star topology on pure states and the unitary group with the strong operator topology. This yields a Polish groupoid admitting a continuous Haar system. We prove that the associated reduced groupoid C*-algebra is Morita equivalent to the original algebra tensored with the compact operators, establishing that the groupoid encodes the K-theory of the algebra. A key feature is a canonical diagonal embedding of the original algebra into the groupoid C*-algebra, which is a unital injective star-homomorphism for separable Type I C*-algebras. We characterize commutativity via this embedding and establish functoriality of the construction under appropriate star-homomorphisms. The theory is illustrated with detailed computations for three fundamental classes: finite-dimensional matrix algebras, commutative algebras over compact metrizable spaces, and the unitized compact operators. These examples demonstrate that our general constructions reduce to familiar objects. We also discuss limitations by analyzing the irrational rotation algebra, a non-Type I algebra not covered by our construction, highlighting directions for future research.
Read the full abstract

Algebraic Geometry

On the irrationality of cubic fourfolds

Following the work of Katzarkov–Kontsevich–Pantev–Yu concerning the irrationality of the very general complex cubic fourfold, we prove the following: for every rational smooth complex cubic fourfold, the primitive cohomology is isomorphic as a Hodge structure to the (twisted) middle cohomology of a projective K3 surface.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Markovian quantum master equations are exponentially accurate in the weak coupling regime

We consider the evolution of open quantum systems coupled to one or more Gaussian environments. We demonstrate that such systems can be described by a Markovian quantum master equation (MQME) up to a correction that decreases exponentially with the inverse system-bath coupling strength. We provide an explicit expression for this MQME, along with rigorous bounds on its residual correction, and numerically benchmark it for an exactly solvable model. The MQME is obtained via a generalized Born-Markov approximation that can be iterated to arbitrary orders in the system-bath coupling; our error bound converges asymptotically to zero with the iteration order. Our results thus demonstrate that the non-Markovian component in the evolution of an open quantum system, while possibly inevitable, can be exponentially suppressed at weak coupling.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Rethinking quantum smooth entropies: Tight one-shot analysis of quantum privacy amplification

We introduce an improved one-shot characterisation of randomness extraction against quantum side information (privacy amplification), strengthening known one-shot bounds and providing a unified derivation of the tightest known asymptotic constraints. Our main tool is a new class of smooth conditional entropies defined by lifting classical smooth divergences through measurements. A key role is played by the measured smooth Rényi relative entropy of order 2, which we show to admit an equivalent variational form: it can be understood as allowing for smoothing over not only states, but also non-positive Hermitian operators. Building on this, we establish a tightened leftover hash lemma, significantly improving over all known smooth min-entropy bounds on extractable randomness and recovering the sharpest classical achievability results. We extend these methods to decoupling, the coherent analogue of privacy amplification, obtaining a corresponding improved one-shot bound. Relaxing our smooth entropy bounds leads to one-shot achievability results in terms of measured Rényi divergences, tightening the bounds of [Dupuis, arXiv:2105.05342] and recovering state-of-the-art asymptotic i.i.d. error exponents. We show an approximate optimality of our results by giving a matching one-shot converse bound up to additive logarithmic terms. This yields an optimal second-order asymptotic expansion of privacy amplification under trace distance, establishing a significantly tighter one-shot achievability result than previously shown in [Shen et al., arXiv:2202.11590] and proving its optimality for all hash functions.
Read the full abstract

Probability · Cross-listed from stat.ML

Bayesian Modeling of Collatz Stopping Times: A Probabilistic Machine Learning Perspective

We study the Collatz total stopping time $\tau(n)$ over $n\le 10^7$ from a probabilistic machine learning viewpoint. Empirically, $\tau(n)$ is a skewed and heavily overdispersed count with pronounced arithmetic heterogeneity. We develop two complementary models. First, a Bayesian hierarchical Negative Binomial regression (NB2-GLM) predicts $\tau(n)$ from simple covariates ($\log n$ and residue class $n \bmod 8$), quantifying uncertainty via posterior and posterior predictive distributions. Second, we propose a mechanistic generative approximation based on the odd-block decomposition: for odd $m$, write $3m+1=2^{K(m)}m'$ with $m'$ odd and $K(m)=v_2(3m+1)\ge 1$; randomizing these block lengths yields a stochastic approximation calibrated via a Dirichlet-multinomial update. On held-out data, the NB2-GLM achieves substantially higher predictive likelihood than the odd-block generators. Conditioning the block-length distribution on $m\bmod 8$ markedly improves the generator's distributional fit, indicating that low-order modular structure is a key driver of heterogeneity in $\tau(n)$.
Read the full abstract

Information Theory · Cross-listed from stat.ML

Dictionary Based Pattern Entropy for Causal Direction Discovery

Discovering causal direction from temporal observational data is particularly challenging for symbolic sequences, where functional models and noise assumptions are often unavailable. We propose a novel \emph{Dictionary Based Pattern Entropy ($DPE$)} framework that infers both the direction of causation and the specific subpatterns driving changes in the effect variable. The framework integrates Algorithmic Information Theory (AIT) and Shannon Information Theory. Causation is interpreted as the emergence of compact, rule based patterns in the candidate cause that systematically constrain the effect. $DPE$ constructs direction-specific dictionaries and quantifies their influence using entropy-based measures, enabling a principled link between deterministic pattern structure and stochastic variability. Causal direction is inferred via a minimum-uncertainty criterion, selecting the direction exhibiting stronger and more consistent pattern-driven organization. As summarized in Table 7, $DPE$ consistently achieves reliable performance across diverse synthetic systems, including delayed bit-flip perturbations, AR(1) coupling, 1D skew-tent maps, and sparse processes, outperforming or matching competing AIT-based methods ($ETC_E$, $ETC_P$, $LZ_P$). In biological and ecological datasets, performance is competitive, while alternative methods show advantages in specific genomic settings. Overall, the results demonstrate that minimizing pattern level uncertainty yields a robust, interpretable, and broadly applicable framework for causal discovery.
Read the full abstract

All authors Harikrishnan N B, Shubham Bhilare, Aditi Kathpalia, Nithin Nagaraj

Combinatorics

Abelian-normal decimal expansions

A landmark paper on normal numbers due to Champernowne [J. London Math. Soc., 1933] provided the first explicit construction of a normal number. Since many research works have concerned normality-preserving selection rules and operations on the sequence of digits of a given normal number, this leads us to introduce the concept of an abelian-normal number, in such a way so that subwords that are equivalent up to permutations are counted as being equivalent, and so that the number of occurrences of equivalent subwords appearing, up to a given point in a decimal expansion, is then normalized by the size of the associated equivalence class. This may be thought of as giving rise to an interdisciplinary area linking combinatorics on words and probabilistic number theory. Since every normal number is abelian-normal, this raises the question as to whether or not there exists an abelian-normal number that is not normal. We succeed in constructing such a constant in an explicit way.
Read the full abstract

Rings and Algebras

Unital $3$-dimensional structurable algebras: classification, properties and $\rm{AK}$-construction

This paper is devoted to the classification and studying properties of complex unital $3$-dimensional structurable algebras. We provide a complete list of non-isomorphic classes, identifying five algebras for type $(2, 1)$ and two algebras for type $(1, 2).$ For each obtained algebra, we describe the derivation algebra, the automorphism group, the lattice of subalgebras and ideals, and functional identities of degree $2$. Furthermore, we investigate the Allison-Kantor construction for the classified algebras. We determine the structure of the resulting $\mathbb{Z}$-graded Lie algebras, providing their dimensions and Levi decompositions.
Read the full abstract

Representation Theory

Super-decomposable pure-injective modules over some Jacobian algebras

Existence of superdecomposable pure-injective modules reflects complexity in the category of finite-dimensional representations over an algebra. Such an existence occurs when an algebra is non-domestic; a conjecture due to M. Prest. G. Puniski confirms the conjecture for non-domestic string algebras. Geiß, Labardini-Fragoso and Schröer show that every Jacobian algebra associated with a triangulation of a closed surface with marked points is finite-dimensional and tame. We show that, excluding only the case of a sphere with four (or fewer) punctures, there exists a special family of pointed modules, called an independent pair of dense chains of pointed modules. In the process, we show the existence of such an independent pair in a non-domestic skew-gentle algebra and (skew) Brauer graph algebras by showing that the Galois semi-covering functor and trivial extension preserve such pairs. Then it follows from a result of M. Ziegler that there exists a superdecomposable pure-injective module if the algebraically closed field is countable.
Read the full abstract

Probability

The Gaussian Wave for Graphs of Finite Cone Type

We show that for any infinite tree of finite cone type satisfying a mild expansion condition, the only typical process on its vertices with covariance induced by the Green's function is the Gaussian wave. This generalizes a result of Backhausz and Szegedy, who proved this for the infinite regular tree of degree $d\geq 3$. We do this by giving a reduction to a statement concerning the distribution of the inner product of our process with columns of the Green's function, which in turn are straightforward to calculate. As a consequence, for random bipartite biregular graphs, the distribution of local neighborhoods of eigenvectors must approximate the Gaussian wave. Moreover, for generic configuration models including random lifts, the local distribution of a uniformly chosen eigenvector from any arbitrarily small spectral window likewise converges to the Gaussian wave.
Read the full abstract

Commutative Algebra

Formalization in Lean of faithfully flat descent of projectivity

We formalize in Lean the following foundational result in commutative algebra: Let $R \to S$ be a faithfully flat map of (not necessarily noetherian) commutative rings, and let $P$ be an arbitrary $R$-module. Then $P$ is projective over $R$ if and only if $S\otimes_R P$ is projective over $S$. This formalizes and verifies Perry's fix of a subtle gap in the classical work of Raynaud and Gruson, a result which is a key ingredient in the study of finitistic dimension of commutative noetherian rings.
Read the full abstract