Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 1 May

Complex Variables

Intrinsic {Right} $q$-Radial Vector Derivatives and Localized Fischer Decompositions on Radial Algebras

We define intrinsic right \(q\)-radial vector derivatives on radial algebras of abstract vector variables. For a finite parameter set \(Y\), a scalar Jackson calculus on \(x^2\) and the mixed anticommutators \(\{x,y_i\}\) is combined with the exterior decomposition relative to \(x\). Relabelling covariance and compatibility under inclusions of parameter sets give a direct-limit operator on arbitrary radial algebras. {Under the dimension specialization \(Q=q^M\), its classical limit agrees in every \(M\)-dimensional Clifford realization with the standard right Clifford derivative; for an exterior blade one obtains \([x\wedge y_I]\partial_x=(-1)^{|I|}(M-|I|)y_I\).} Two Fischer-type constructions are considered. The anticommutator with exterior creation is triangular and admits an explicit Green inverse after localization at its diagonal factors. {For right \(q\)-monogenic elements, the derivative is paired with right multiplication \(R_xF=Fx\). The homogeneous operators \(\partial^{Y,\mathrm R}_{x,q}R_x\) have generically nonzero determinants, which yields determinant-localized Fischer decompositions and explicit projectors.} The one- and two-vector determinants are computed explicitly. {After \(Q=q^M\), the two-vector determinant is nonzero for every \(0<q<1\) and every positive integer \(M\). For arbitrary finite support, a support filtration factors the determinant into exact-support terms; in degree zero, support rank \(p\) contributes the factor \([m-p]_q+p\).}
Read the full abstract

All authors Diana Barseghyan, Juan Bory-Reyes, Baruch Schneider, Yifan Zhang

Rings and Algebras

Report on $AS$-Gorenstein Hopf algebras

This is a review of progress on the question whether noetherian Hopf algebras always have finite injective dimension and related good homological properties. As well as discussing in detail the main results giving positive answers for particular classes of Hopf algebras, some consequences of such positive answers are also described. Full definitions and references are included, also sketches of some proofs. A considerable number of open questions are listed, additional to the original question, which itself remains open after 30 years.
Read the full abstract

Category Theory

The Synthetic Sierpiński Cone

In domains, categories, and toposes, the Sierpiński cone construction glues onto a space a universal closed point lying below all the other points. Although this is a lax colimit, it also enjoys a well-known right-handed universal property: the Sierpiński cone classifies partial maps defined on an open subspace. The situation proves more subtle in synthetic models of space based on extending homotopy type theory with an interval, as in several recent approaches to synthetic higher categories and domains: although globally it may well be the case that the Sierpiński cone classifies partial maps, this property cannot hold of all parameterised types without degenerating the theory. On the other hand, there are reflective subuniverses within which the classifying property nonetheless holds. We show that the largest subuniverse in which the Sierpiński cone classifies partial maps is the accessible localisation at a family of embeddings parameterised in the interval, and this subuniverse is contained within the Segal types; this containment is moreover strict in the sense that when the interval is non-trivial, it is not possible for all Segal types to lie in the subuniverse. We finally extend these results from Sierpiński cones to mapping cylinders, providing a new right-handed universal property for the latter.
Read the full abstract

All authors Fredrik Bakke, Jonathan Sterling, Mark Damuni Williams, Lingyuan Ye

Statistics Theory · Cross-listed from econ.EM

Penalized Likelihood for Dyadic Network Formation Models with Degree Heterogeneity

Estimating network formation models with degree heterogeneity raises two problems in empirical networks. First, agents that send no links, receive no links, or link to all remaining agents can make the fixed-effects MLE fail to exist. Trimming these agents changes the estimation sample and induces selection bias. Second, the incidental-parameter problem biases common parameters and average partial effects. We resolve both issues through a penalized likelihood approach. Our leading specification is a directed network model with reciprocity, nesting the standard undirected and non-reciprocal directed models. The penalty guarantees finite-sample existence and yields bias corrections for coefficients and partial effects. We establish asymptotic results without imposing compactness on the fixed-effects. Allowing the fixed effects to diverge at a logarithmic rate, our asymptotic framework accommodates the degree sparsity ubiquitous in large empirical networks. A global trade application demonstrates that our estimator avoids selection bias and recovers robust parameters where conventional methods fail.
Read the full abstract

Number Theory

Supersingular reduction and strongly special intersections in powers of the modular curve

We show that Lang–Trotter-type sparsity for simultaneous supersingular reduction of pairs of elliptic curves provides a new arithmetic input for unlikely intersections in powers of the modular curve. Assuming such a sparsity statement, we prove two Zilber–Pink-type finiteness results for Hodge generic curves in $Y(1)^n$. The proof proceeds through height bounds obtained by applying the $G$-function method of Yves André.
Read the full abstract

Information Theory

The Benefit of Decoder-Provided Pilots in Highly Dynamic Channels

Communications in highly dynamic channels relying on training-based channel estimation experience a trade-off between increasing channel measurement accuracy by sending more frequent training sequences and increasing data rate by sending fewer training sequences. Simultaneously, most communication systems use forward error correction to enable error detection and correction at the receiver. This paper presents decoder-provided pilots for time-varying channels by using decoded codewords as training sequences to update the channel estimate at the receiver. In contrast to approaches such as data-aided channel estimation, decision-feedback equalization, joint channel estimation and error correction, and turbo equalization, the decoder-provided pilots approach is non-iterative, which is ideal for low-latency requirements in highly dynamic scenarios. Furthermore, it is modulation-, code-, and decoder-agnostic, meaning it can be implemented on top of virtually any communication system that uses forward error correction. From an information-theoretic perspective, we derive the fundamental limits of decoder-provided pilots' ability to simultaneously sense the channel and transmit data. Simulation results demonstrate that decoder-provided pilots significantly improve performance, that when coding across frequency, soft-output can further enhance performance, and that when coding across time, short codes can outperform long codes of the same rate in fast-fading channels.
Read the full abstract

All authors Duschia Bodet, Muriel Médard, Muralidhar Rangaswamy, Ken Duffy

Number Theory

Lang-Trotter phenomena and unlikely intersections

We show that the Lang-Trotter conjecture for pairs of elliptic curves implies new cases of the Zilber-Pink conjecture for curves in $\mathcal{A}_3$. Unlike previous results for curves in $\mathcal{A}_g$, our result does not rely on any assumption on intersections with the boundary, and in particular applies to potentially compact curves. The argument is based on the $G$-functions method of Yves André.
Read the full abstract

Probability · Cross-listed from stat.OT

Quenched Amplification and Tail Shaping in Networked Systems with Memory and Regime Switching

Networked systems operating under intermittent adverse conditions and long memory can remain stable on average while exhibiting rare but extreme trajectory-level excursions. We study linear regime-switching network dynamics with Volterra-type memory, formulated through a finite-dimensional lifted ordinary differential equation embedding. Despite finite-horizon annealed boundedness, we show that quenched amplification emerges generically from the interaction of regime persistence, memory accumulation, and non-normal lifted operator geometry. A lower bound on burst-size distributions reveals power-law tails whose exponent is determined by the ratio between unfavorable dwell-time rates and an operator-defined instantaneous growth parameter. This parameter is computable online via the Euclidean logarithmic norm of the lifted operator, yielding a practical early-warning indicator. Building on this structure, we introduce a dynamic data-driven intervention strategy that enforces contraction on demand along rare amplification channels, thereby shaping or truncating tail risk without altering exogenous regime statistics or typical system behavior. The results provide a geometrically grounded and operationally actionable framework for understanding and mitigating extreme events in memory-driven regime-switching systems.
Read the full abstract

Optimization and Control

Randomized Subspace Nesterov Accelerated Gradient

Randomized-subspace methods reduce the cost of first-order optimization by using only low-dimensional projected-gradient information, a feature that is attractive in forward-mode automatic differentiation and communication-limited settings. While Nesterov acceleration is well understood for full-gradient and coordinate-based methods, obtaining accelerated methods for general subspace sketches that use only projected-gradient information and can improve over full-dimensional Nesterov acceleration in oracle complexity is technically nontrivial. We develop randomized-subspace Nesterov accelerated gradient methods for smooth convex and smooth strongly convex optimization under matrix smoothness and generic sketch moment assumptions. The key technical ingredient is a three-sequence formulation tailored to matrix smoothness, which recovers the corresponding classical Nesterov methods in the full-dimensional case. The resulting theory establishes accelerated oracle-complexity guarantees and makes explicit how matrix smoothness and the sketch distribution enter the complexity. It also provides a unified basis for comparing sketch families and identifying when randomized-subspace acceleration improves over full-dimensional Nesterov acceleration in oracle complexity.
Read the full abstract

Statistics Theory

Intermittency induced by long memory under stochastic regime switching

We study a fundamental instability mechanism in nonlinear, nonlocal dynamical systems arising from the interaction of long-range memory and stochastic regime switching. The dynamics are governed by network-coupled, operator-valued Volterra evolutions with completely monotone memory kernels whose excitation operators and kernel parameters are modulated by an ergodic finite-state continuous-time Markov chain. We formalize a sharp separation between annealed stability (in expectation) and quenched behaviour (along typical sample paths). On the annealed side, we identify an averaged memory gain that yields uniform moment bounds and a memory-adapted Lyapunov functional implying mean-square control under an averaged subcriticality condition. On the quenched side, we show that rare but persistent excursions into supercritical regimes are amplified by memory, producing intermittent macroscopic bursts with heavy-tailed statistics and a deterministic almost sure growth exponent obtained via a subadditive ergodic argument. This establishes an annealed–quenched dichotomy specific to non-Markovian switching systems, where stability in expectation can coexist with pathwise growth and metastable burst phases. We further derive a micro–macro correspondence by proving that a population of regime-modulated self-exciting point processes converges, both annealed and quenched, to the random-coefficient Volterra limit, transferring the burst mechanism from microscopic branching dynamics to macroscopic long-memory flows. Numerical experiments illustrate how burst localization depends on graph geometry and on noncommuting excitation operators.
Read the full abstract

Functional Analysis

Sion's minimax theorem and the proximal point algorithm in Hadamard spaces

We obtain Sion's minimax theorem in Hadamard spaces and discuss its applications. Among other things, we study several fundamental properties of resolvents of saddle functions in Hadamard spaces. An application to the proximal point algorithm for minimax problems in Hadamard spaces are also included.
Read the full abstract

Probability · Cross-listed from stat.ML

Decentralized Proximal Stochastic Gradient Langevin Dynamics

We propose Decentralized Proximal Stochastic Gradient Langevin Dynamics (DE-PSGLD), a decentralized Markov chain Monte Carlo (MCMC) algorithm for sampling from a log-concave probability distribution constrained to a convex domain. Constraints are enforced through a shared proximal regularization based on the Moreau-Yosida envelope, enabling unconstrained updates while preserving consistency with the target constrained posterior. We establish non-asymptotic convergence guarantees in the 2-Wasserstein distance for both individual agent iterates and their network averages. Our analysis shows that DE-PSGLD converges to a regularized Gibbs distribution and quantifies the bias introduced by the proximal approximation. We evaluate DE-PSGLD for different sampling problems on synthetic and real datasets. As the first decentralized approach for constrained domains, our algorithm exhibits fast posterior concentration and high predictive accuracy.
Read the full abstract

Symplectic Geometry

Curves on surfaces and moduli of associative algebras

Given an immersion of a circle in a punctured surface $\Sigma$, we give an explicit (and finite) computation of the $A_\infty$-algebra associated with this curve when viewed as an object in a (relative) Fukaya category of $\Sigma$ in terms of the signed Gauss word recording the double points in a traversal of the curve and the visible polygons that it bounds in $\Sigma$. We illustrate our computational technique by fully determining the $A_\infty$-products for immersions with up to three self-intersections. In particular, it is proved that, over an algebraically closed field, all associative algebras of dimension $\leq 4$, with one exception, can be realized as the (degree 0) endomorphism algebra of some Lagrangian immersion of a circle equipped with a bounding cochain computed in some relative Fukaya category $\mathcal{F}(\Sigma,D)$. We also note that any finite-dimensional algebra with radical square zero arises as the (degree 0) endomorphism algebra of an object in the Fukaya category $\mathcal{F}(\Sigma)$ of some punctured surface $\Sigma$.
Read the full abstract

Algebraic Geometry

Delta characters and crystalline cohomology of abelian schemes

We provide an explicit description of the smallest filtered sub-isocrystal generated by the Hodge filtered piece of the crystalline cohomology for an abelian scheme over a $p$-adic ring. Our method is based on the theory of arithmetic jet spaces and delta characters associated to the abelian scheme, introduced by Buium and later studied by Borger and Saha using a functor of points approach. In particular, we prove that the delta isocrystal constructed by Borger and Saha is indeed isomorphic to the fundamental smallest sub-isocrystal of the crystalline cohomology in the category of filtered $F$-isocrystals. As an application, we establish a comparison isomorphism between the delta isocrystal and the crystalline cohomology of abelian schemes, which is governed by the group of order $1$ delta characters of the abelian scheme.
Read the full abstract

Rings and Algebras

On local function, an algebraic approach

The paper discuss the limit point concept of a subset in a group via ideal of the power set ring. This idea along with anti-ideal give the topological structure in a group. Homomorphic images of both ideal and anti-ideal are played the remarkable role to change the topological structure from one system to another system.
Read the full abstract

Optimization and Control

A Line-search-free Method for Adaptive Decentralized Optimization

We study decentralized optimization over networks where agents cooperatively minimize a smooth (strongly) convex sum of local losses while communicating only with immediate neighbors. Prevailing decentralized methods require either centralized knowledge of global problem and network parameters for stepsize tuning–hence impractical, or costly per-iteration line-searches that demand access to local function values. We propose line-search-free, fully decentralized algorithms in which each agent adapts its stepsize using only past local iterates and gradients–with no extra function evaluations and no global tuning. The key technical ingredient is a new Lyapunov function, from which a natural adaptive stepsize rule emerges: at each iteration, each agent selects the largest stepsize that guarantees descent, based solely on a local curvature estimate built from successive gradients. The proposed algorithms enjoy strong theoretical guarantees: sublinear convergence rates for merely convex objectives and linear rates under strong convexity. Numerical experiments on standard benchmarks show consistent improvements over the state of the art, both adaptive and non-adaptive.
Read the full abstract

Combinatorics · Cross-listed from cs.DS

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs

We present a near-linear-time algorithm that, given a bridgeless cubic graph, finds a perfect matching intersecting every 3-edge-cut in exactly one edge. This improves over a cubic algorithm of Boyd et al. for the same problem, and over our previous algorithm, which worked only for 3-edge-connected graphs. The main ingredient is a cactus representation of the 2-edge-cuts, together with an efficient update procedure under 2-cut reductions.
Read the full abstract

Statistics Theory

Bootstrap Inference under General Two-way Clustering with Serially and Spatially Dependent Common Effects

This paper develops bootstrap procedures for inference in linear regression models with two-way clustered data. We characterize the estimator's asymptotic behavior in five mutually exclusive and exhaustive regimes: three Gaussian and two non-Gaussian. We establish four impossibility results: heterogeneous score components preclude uniform consistency; uniform consistency also fails in one non-Gaussian (infeasible) regime; the infeasible regime is not uniformly distinguishable from a feasible one; and uniform validity over all feasible regimes rules out uniform conservativeness over the infeasible regime. To address the feasible regimes, we propose a data-driven regime classifier and a projection-based wild bootstrap procedure. The procedure delivers uniformly valid inference across the four feasible regimes while allowing serial dependence along the second clustering dimension and spatial dependence along the first. This combination of regime adaptivity and flexible dependence is new to the two-way clustering literature. Monte Carlo simulations confirm the accuracy and flexibility of the proposed methods in settings with complex clustering structures.
Read the full abstract

Combinatorics

Cohomological properties of the Vietoris–Rips Complex of a Hypercube Graph

We develop a toric topological framework for studying the cohomology of Vietoris–Rips complexes $VR(Q_n;r)$ of hypercube graphs. Using total domination invariants and spectral methods, we establish general lower bounds on connectivity, which leads to infinite families of counterexamples to Shukla's conjecture, and derive first global upper bounds on coconnectivity. Our approach interprets Vietoris–Rips complexes via Stanley–Reisner rings, moment-angle complexes, and Tor algebras, allowing global topological information to be extracted from combinatorial data. In a second direction, we construct explicit cohomology classes using the Koszul resolution and show that they decomposable products of $1$-dimensional classes, and that their representatives can be combimbinatorially realised as the boundary of cross polytopes positively answering the question posed by Adams and Virk. We introduce ghost vertices as a new tool for detecting, extending, and proving linear independence of cohomology classes.
Read the full abstract

Differential Geometry

A Geometric Interpretation of Generalized Hurwitz–Radon Numbers Defined by Kannaka–Tojo

The Hurwitz–Radon number originates in the composition problem of quadratic forms and is related to the maximum number of pointwise linearly independent vector fields on spheres. Kannaka–Tojo [arXiv:2602.04544] reformulated the Hurwitz–Radon number in the setting of a real reductive Lie algebra $\mathfrak g$ and its faithful representation $\iota$, and introduced two natural numbers $\rho^{(1)}(\mathfrak g,\iota)$ and $\rho^{(2)}(\mathfrak g,\iota)$. For classical Lie algebras and their standard representations, these two numbers coincide except for a few cases. In this paper, fixing a Lie group $G$ and a subspace $\mathfrak{s} $ of $ \mathfrak g = \operatorname{Lie}(G)$ , we define natural numbers $\rho_{G,\mathfrak{s}}(M,\sigma)$ and $\rho^{\pm}_{G,\mathfrak{s}}(M,\sigma,\nabla)$ for a $G$-manifold $(M,\sigma)$ equipped with an affine connection $\nabla$. These are defined in terms of fundamental vector fields on $M$. In a special case, we show that $\rho_{G,\mathfrak{s}}(M,\sigma)$ coincides with $\rho^{(2)}(\mathfrak g,\iota)$, and that $\rho^{-}_{G,\mathfrak{s}}(M,\sigma,\nabla)$ coincides with $\rho^{(1)}(\mathfrak g,\iota)$. Furthermore, we show that $\rho^{+}_{G,\mathfrak{s}}(M,\sigma,\nabla)$ is related to Clifford structures on $M$.
Read the full abstract

Analysis of PDEs

Gagliardo-Nirenberg type inequalities with a BMO term and fractional Laplacians

An improvement of a Global (strong) Gagliardo-Nienberg inequality with a BMO term is established by replacing local derivatives by and fractional Laplacians. Local versions are also given.

Logic

Categoricity without Power

We prove an analogue of Morley's categoricity theorem where cardinality is replaced by the recursion-theoretic notion of arithmetic degree. We say that a complete arithmetically definable theory $T$ is $D$-categorical if any two arithmetically extendible models of $T$ of arithmetic degree $D$, considered over a common elementary submodel with arithmetical elementary diagram, are isomorphic over that submodel by an isomorphism which preserves the complexity of sets of degree $D$. Here an arithmetically extendible model means an elementary substructure of a model whose elementary diagram is arithmetical. Our main result is: If $T$ is $D_1$-categorical for some nonzero arithmetic degree $D_1$, then $T$ is $D_2$-categorical for every nonzero arithmetic degree $D_2$. We also show that, assuming ZFC, $D$-categoricity for some nonzero arithmetic degree is equivalent to uncountable categoricity.
Read the full abstract

Number Theory

On divisor sums due to Erdős and Ramanujan

Let $d(n)$ denote the number of divisors of a positive integer $n$. A classical problem in analytic number theory is given by the asymptotic behavior of the divisor sum $\sum_{n \leq x} \frac{1}{d(n)}$, with Ramanujan having introduced an asymptotic formula for this sum with an explicit evaluation for the constant $A_1$ for the leading term $A_1 \frac{x}{\sqrt{\log x}}$. Gabdullin et al. recently considered a hybrid of this problem and the Titchmarsh divisor problem concerning $\sum_{p\leq x} d(p-1)$, proving that $\sum_{p\leq x} \frac{1}{d(p-1)} \asymp \frac{x}{(\log x)^{3/2}}$. This result and Erdős's asymptotic formula $ \sum_{n \leq x} d(d(n)) \sim c_1 \, x \log \log x $ for a constant $c_1 \in (0, \infty)$ lead us to consider the hybrid $\sum_{n \leq x} \frac{1}{d(d(n))}$ of the Erdős and Ramanujan divisor sums. In this paper, we prove that there exists a constant $c_3 \in (0, \infty)$ such that $$\sum_{n \leq x} \frac{1}{d(d(n))} \sim c_3 \frac{x}{ \log \log x}, $$ through a combined application of Golomb's estimate for powerful numbers, Turán's quantitative form of the Hardy-Ramanujan theorem, and a fourth-moment estimate for the number of distinct prime divisors due to Granville and Soundararajan. Moreover, an explicit formula for the constant $c_3$ is given.
Read the full abstract

Analysis of PDEs

Unstable free boundary problems in optimal control theory: existence and regularity

We establish the first general regularity result for constrained optimal control problems arising naturally in mathematical physics and mathematical biology. Namely, we prove that for a large class of problems of the form “maximise $\int \psi(\Theta_m)-c\int m$ where $-\Delta \Theta_m=m\Theta_m+B(x,\Theta_m)$, under the constraint $0\leq m\leq 1$ a.e.", the solution $m^*$ is bang-bang, in the sense that $m^*=\chi_{E^*}$, and that $\partial E^*$ is smooth up to a $(d-2)$-dimensional subset. Moreover, we prove that the solutions to the volume constrained problem “maximise $\int \psi(\Theta_m)$ where $-\Delta \Theta_m=m\Theta_m+B(x,\Theta_m)$, under the constraint $0\leq m\leq 1$ a.e and $\int m=m_0$" are bang-bang in the sense that $m^*=\chi_{E^*}$ and that, in the two-dimensional case, $\partial E^*$ is a finite union of smooth curves. This is done via reduction to an unstable free boundary problem, the regularity analysis of which was pioneered by Monneau & Weiss and Chanillo, Kenig & To. In our case, the free boundary is not minimising, and the laplacian of the state function is sign-changing, which creates significant difficulties, in particular regarding the non-degeneracy of blow-ups. This requires a new approach blending tools from optimal control theory, free boundary and measure theory to establish the regularity of the free boundary.
Read the full abstract

Optimization and Control

Optimal Merton's Problem under Multivariate Affine Volterra Models with Jumps

This paper is concerned with portfolio selection for an investor with exponential, power, and logarithmic utility in multi-asset financial markets allowing jumps. We investigate the classical Merton's portfolio optimization problem in a Volterra stochastic environment described by a multivariate Volterra–Heston model with jumps driven by an independent Poisson random measure. Owing to the non-Markovian and non-semimartingale nature of the model, classical stochastic control techniques are not directly applicable. Instead, the problem is tackled using the martingale optimality principle by constructing a family of supermartingale processes characterized via solutions to an original Riccati backward stochastic differential equation with jumps (Riccati BSDEJ).The resulting optimal strategies for Merton's problems, as well as the corresponding indifference prices, are derived in semi-closed form depending on the solutions to time-dependent multivariate Riccati-Volterra integral equations with Lévy exponential jump compensator, while the optimal value is expressed using the solution to this original Riccati BSDEJ. Numerical experiments on a two-dimensional rough Heston model illustrate the impact of both path roughness and jumps components on the value function and optimal strategies in the Merton problem.
Read the full abstract

Analysis of PDEs

Quantitative symmetry-breaking and nonlinear harmonic generation in plasmonics

We develop a quantitative mathematical theory that offers new perspectives on nonlinear harmonic generation in plasmonic structures arising from symmetry breaking. Focusing on second harmonic generation–the most fundamental process and the most extensively studied owing to its practical significance–we establish a theoretical framework that can be readily extended to higher-order harmonics. We investigate the plasmonic system in the static regime using a columnar nanowire with \(n\)-fold rotational symmetry (\(n \in \mathbb{N}\)) and construct a phenomenological model in which the second harmonic response originates from nonlinear sources confined to a selvedge region near the surface. By introducing a notion of symmetry degree grounded in group theory, we precisely quantify the second harmonic generation in terms of multipolar contributions. Our theory complements existing physical descriptions of this practically important phenomenon and provides a rigorous account of how nonlinear optical efficiency depends on shape, size, symmetry, and defects in plasmonic structures.
Read the full abstract

All authors Hongyu Liu, Zhi-Qiang Miao, Jingfeng Yao, Chengxun Yuan, Guang-Hui Zheng

Differential Geometry

Riemannian Penrose inequality in all dimensions

We prove the Riemannian Penrose inequality in arbitrary dimension for smooth complete asymptotically flat manifolds with nonnegative scalar curvature and compact outer-minimizing minimal boundary, where the boundary is allowed to have a singular set of Hausdorff dimension at most \(n-8\). Moreover, the equality holds exactly when the manifold is isometric to the Riemannian Schwarzschild exteriors. Our proof extends Bray's conformal-flow method to higher dimensions, where the outer-minimizing enclosures along the flow may be singular.
Read the full abstract

Number Theory

Modular Forms and Numerical Explorations of Rational Approximations to $\zeta(3)$

We revisit Beukers' modular-form proof of the irrationality of $\zeta(3)$ from the point of view of the auxiliary weight two modular form. For the Fricke group $\Gamma_0(6)^\star$, we show that Beukers' choice is not isolated: it belongs to a one-parameter affine family. These approximations have the same exponential decay as the classical Apéry approximations and satisfy the same denominator-growth estimate needed in Beukers' irrationality argument. We then apply the same construction to several other genus-zero Fricke groups.
Read the full abstract

Information Theory

SENECA: Small-Sample Discrete Entropy Estimation via Self-Consistent Missing Mass

Discrete entropy estimation is a classic information theory problem, wherein the average information content of a discrete random variable is estimated from samples alone. Naive approaches, such as the plugin method, fail to account for the probability mass associated with members of the random variable's support that are unobserved in a given sample, known as the "missing mass." The resulting systemic underestimation is particularly problematic when data is time-consuming or costly to gather. We propose SENECA, an entropy estimation scheme based on a novel "self-consistent" missing mass calculation. Extensive numerical experiments indicate that our approach outperforms many state-of-the-art alternatives overall in the small-sample setting. We then apply SENECA to two practical use cases, namely biodiversity estimation and the detection of incorrect large language model responses, where our method is competitive with domain-specific approaches. Our work advances SENECA as an effective drop-in replacement for small-sample entropy estimation, with broad utility across several domains.
Read the full abstract

Combinatorics

Hamilton decompositions of the directed 7-torus at odd modulus via root-flat certificates and a prefix-count construction

We prove that the directed seven-dimensional equal-side torus D_7(m) = Cay((Z/mZ)^7, {e_0, e_1, ..., e_6}) admits a directed Hamilton decomposition for every odd integer m >= 3. The proof has two main contributions. First, we introduce the root-flat certificate: a named verification framework in which a Hamilton decomposition of D_n(m) follows from three local conditions on a single root flat – row Latinness, layer bijectivity, and primitive return maps. This abstraction was used informally in the earlier odd D_5(m) construction; here it appears as a definition and a theorem, providing a common verification interface for prime-dimensional base cases. Second, for every odd m >= 7, we give a uniform prefix-coordinate construction: one-layer prefix maps, a symbol-count criterion, and explicit 7x7 count matrices produce all seven Hamilton factors without a finite search. The remaining moduli m = 3 and m = 5 are exactly the boundary where the prefix-count method provably cannot work; they are handled by finite root-flat certificates whose validity is checked in Lean 4. A Lean 4 formalization verifies the Cayley statement, with the symbolic branch and the finite boundary certificates checked in the same development.
Read the full abstract