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)

Thursday 19 February

Mathematical Physics

Anderson localization for 1-d quasi-periodic Schrödinger operators with degenerate weights

We establish Anderson localization for 1-d discrete Schrödinger operators with positive weights. The distinctive feature of this work lies in the degeneracy of the weights, with both the potentials and weights assumed to be analytic and quasi-periodic. Operators of this kind originate from distinct mathematical physics problems, which include the Frenkel-Kontorova model with impurities, the discretization of singular Sturm-Liouville operators, and the Fisher-KPP lattice equation in heterogeneous media.
Read the full abstract

All authors Yingdu Dong, Haoxuan Liu, Zuhong You, Xiaoping Yuan

Algebraic Geometry

Automorphisms of Smooth Hypersurfaces with Fixed Loci of Codimension at Most Two

We study automorphisms of smooth hypersurfaces in projective space $\mathbb{P}^{n+1}$ whose fixed loci have codimension at most two for $n\geq2$. While classifications of possible orders of automorphisms are known, our aim is to explore the relationship between the order of an automorphism and its algebraic and geometric properties. In this paper, we show that the assumption on the fixed locus restricts the possible orders of automorphisms. Moreover, when the fixed locus has codimension at most two, we investigate the rationality of quotient spaces associated with automorphisms whose orders are multiples of $d-1$ or $d$, where $d$ denotes the degree of the hypersurface.
Read the full abstract

Geometric Topology

The realization problem of essential surfaces in knot exteriors

We study compact orientable essential surfaces in knot exteriors in the 3-sphere. The genus $g$, the number of boundary components $b$, and the boundary slope $p/q$ are fundamental invariants of an essential surface. The realization problem asks whether, for a given triple $(g, b, q)$ with $g \ge 0$, $b \ge 1$, and $q \ge 1$, there exists a knot $K \subset S^3$ whose exterior $E(K)$ contains a compact orientable essential surface $F$ of genus $g$ with $b$ boundary components and boundary slope $p/q$ for some $p$. In general, not all combinations of $(g, b, q)$ are realizable. First, we show that if $b$ is odd, then $q$ must be equal to $1$. Our main theorem states that for any given even $b \ge 2$ and $q \ge 1$, there exist a genus $g \ge 0$ and a knot $K$ such that $E(K)$ contains a compact orientable essential surface with these parameters.
Read the full abstract

Optimization and Control

Adjoint-based gradient methods for inverse design in a multiple fragmentation model

We study an inverse design problem for the linear multiple fragmentation equation arising in particle dynamics. Our objective is to reconstruct an unknown initial size distribution that evolves, under a prescribed fragmentation law, into a desired size distribution at a specified final time. We first establish the existence of global mass-conserving solutions for a broad class of fragmentation kernels with unbounded rates, and subsequently prove the continuous dependence and uniqueness of these solutions under additional assumptions on the fragmentation kernels. We then formulate the inverse design problem as an optimal control problem constrained by the fragmentation dynamics and prove the existence of the optimal control problem. Also derive the corresponding continuous adjoint equation and propose a gradient-type iterative reconstruction method. For the numerical implementation, we develop finite volume schemes for both the forward and adjoint equations, including a weighted finite volume scheme designed to enhance mass conservation and accuracy. Two benchmark problems, involving linear and nonlinear fragmentation rates with known analytical solutions, are used to assess the accuracy and efficiency of the proposed approach and to compare the performance of the two discretizations in both forward simulations and inverse reconstructions.
Read the full abstract

Differential Geometry

A gauge theoretical generalization of Bryant's correspondence

A classical theorem in the theory of minimal surfaces establishes a correspondence between minimal surfaces in $\mathbb{R}^n$ and null holomorphic curves in $\mathbb{C}^n$. A hyperbolic version of this correspondence is due to Bryant: null holomorphic curves in ${\rm SL}(2,\mathbb{C})$ correspond to CMC-1 surfaces in the hyperbolic space $\mathbb{H}^3$. We also have a relativistic Bryant type correspondence: CMC-1 immersions in the hyperbolic space are replaced by space-like CMC-1 immersion in the de Sitter space. We prove a mutual generalisation of all these results: let $H$ be a real Lie group, $\pi:P \to M$ a principal $H$-bundle, $A$ a connection on $P$ and $\alpha\in A^1_{\rm Ad}(P,\mathfrak{h})$ a tensorial 1-form of type ${\rm Ad}$ which induces isomorphisms $A_\xi \to \mathfrak{h}$. Such a pair $(\alpha,A)$ defines an almost complex structure $J^\alpha_A$ on $P$, which is integrable if and only $(\alpha,A)$ solves a gauge-invariant first order differential system. A non-degenerate symmetric ${\rm Ad}_H$-invariant bilinear form $g$ on $\mathfrak{h}$ defines pseudo-Riemannian metrics $g^\alpha_M$, $\mathfrak{g}^\alpha_A$ on $M$, respectively $P$, and a non-degenerate bilinear form $\omega^{\alpha,g}_A:T_P\times_P T_P\to \mathbb{C}$ which is holomorphic when $J^\alpha_A$ is integrable. Assuming that this is the case, we have a Bryant type correspondence between space-like, $\omega^{\alpha,g}_A$-isotropic holomorphic immersions $Y\to P$ and space-like conformal immersions $Y\to (M,g^\alpha_M)$ whose mean curvature vector field is given by a simple explicit formula. In particular, one obtains such a correspondence for any principal bundle of the form $G\to G/H$, where $G$ is a complex Lie group, and $H$ is a real form of $G$ endowed with a non-degenerate, ${\rm Ad}_H$-invariant, symmetric bilinear form $g$ on its Lie-algebra $\mathfrak{h}$.
Read the full abstract

Information Theory

Resource Allocation for STAR-RIS-enhanced Metaverse Systems with Augmented Reality

Augmented reality (AR)-enabled Metaverse is a promising technique to provide immersive service experience for mobile users. However, the limited network resources and unpredictable wireless propagation environments are key design bottlenecks of AR-enabled Metaverse systems. Therefore, this paper presents a resource management framework for simultaneously transmitting and reflecting RIS (STAR-RIS)-assisted AR-enabled Metaverse, where the STAR-RIS is configured to improve the communication efficiency between AR users and the Metaverse server located at the base station (BS). Moreover, we formulate a service latency minimization problem via jointly optimizing the computation resource allocation of the BS, coefficient matrix of the STAR-RIS, central processing unit (CPU) frequency and transmit power of the AR users. To tackle the non-convex problem, we utilize an approximate method to transform it to a tractable form, and decouple the multi-dimensional variables via the alternating optimization method. Particularly, the optimal coefficient matrix is obtained by a penalty function-based method with proved convergence, the CPU frequencies of AR users are derived as the closed-form solution, and the transmit power of AR users and computation resource allocation of the BS are obtained by the Lagrange duality method and convex optimization theory. Finally, simulation results demonstrates that the proposed method achieves remarkable latency reduction than several benchmark methods.
Read the full abstract

All authors Sun Mao, Lei Liu, Kun Yang, F. Richard Yu, Duist Niyato, Chau Yuen

Geometric Topology

3-decompositions of genus two handlebody-knots

We investigate the class of $3$-decomposable genus two handlebody-knots and provide a complete classification of essential annuli in their exteriors. We introduce the notion of $\tau$- and $\rho$-tangles and good rectangles and annuli. By classifying $\tau$- and $\rho$-tangles whose exteriors admit a good rectangle or annulus, we categorize atoroidal $3$-decomposable genus two handlebody-knots into distinct classes, based on the number of essential annuli. As an application, the hyperbolicity of all genus two handlebody-knots with up to six crossings are determined, and numerous hyperbolic handlehody-knots with seven crossings identified. Furthermore, obstructions for a handlebody-knot to be $3$-decomposable are constructed with explicit examples provided.
Read the full abstract

Dynamical Systems · Cross-listed from cs.LG

Synergizing Transport-Based Generative Models and Latent Geometry for Stochastic Closure Modeling

Diffusion models recently developed for generative AI tasks can produce high-quality samples while still maintaining diversity among samples to promote mode coverage, providing a promising path for learning stochastic closure models. Compared to other types of generative AI models, such as GANs and VAEs, the sampling speed is known as a key disadvantage of diffusion models. By systematically comparing transport-based generative models on a numerical example of 2D Kolmogorov flows, we show that flow matching in a lower-dimensional latent space is suited for fast sampling of stochastic closure models, enabling single-step sampling that is up to two orders of magnitude faster than iterative diffusion-based approaches. To control the latent space distortion and thus ensure the physical fidelity of the sampled closure term, we compare the implicit regularization offered by a joint training scheme against two explicit regularizers: metric-preserving (MP) and geometry-aware (GA) constraints. Besides offering a faster sampling speed, both explicitly and implicitly regularized latent spaces inherit the key topological information from the lower-dimensional manifold of the original complex dynamical system, which enables the learning of stochastic closure models without demanding a huge amount of training data.
Read the full abstract

Probability

Diffusive Scaling Limits of Forward Event-Chain Monte Carlo: Provably Efficient Exploration with Partial Refreshment

Piecewise deterministic Markov process samplers are attractive alternatives to Metropolis–Hastings algorithms. A central design question is how to incorporate partial velocity refreshment to ensure ergodicity without injecting excessive noise. Forward Event-Chain Monte Carlo (FECMC) is a generalization of the Bouncy Particle Sampler (BPS) that addresses this issue through a stochastic reflection mechanism, thereby reducing reliance on global refreshment moves. Despite promising empirical performance, its theoretical efficiency remains largely unexplored. We develop a high-dimensional scaling analysis for standard Gaussian targets and prove that the negative log-density (or potential) process of FECMC converges to an Ornstein–Uhlenbeck diffusion, under the same scaling as BPS. We derive closed-form expressions for the limiting diffusion coefficients of both methods by analyzing their associated radial momentum processes and solving the corresponding Poisson equations. These expressions yield a sharp efficiency comparison: the diffusion coefficient of FECMC is strictly larger than that of optimally tuned BPS, and the optimum for FECMC is attained at zero global refreshment. Specifically, they imply an approximately eightfold increase in effective sample size per event over optimal BPS. Numerical experiments confirm the predicted diffusion coefficients and show that the resulting efficiency gains remain substantial for a range of non-Gaussian targets. Finally, as an application of these results, we propose an asymptotic variance estimator for Piecewise deterministic Markov processes that becomes increasingly efficient in high dimensions by extracting information from the velocity variable.
Read the full abstract

Statistics Theory · Cross-listed from econ.TH

Dynamic Decision-Making under Model Misspecification: A Stochastic Stability Approach

Dynamic decision-making under model uncertainty is central to many economic environments, yet existing bandit and reinforcement learning algorithms rely on the assumption of correct model specification. This paper studies the behavior and performance of one of the most commonly used Bayesian reinforcement learning algorithms, Thompson Sampling (TS), when the model class is misspecified. We first provide a complete dynamic classification of posterior evolution in a misspecified two-armed Gaussian bandit, identifying distinct regimes: correct model concentration, incorrect model concentration, and persistent belief mixing, characterized by the direction of statistical evidence and the model-action mapping. These regimes yield sharp predictions for limiting beliefs, action frequencies, and asymptotic regret. We then extend the analysis to a general finite model class and develop a unified stochastic stability framework that represents posterior evolution as a Markov process on the belief simplex. This approach characterizes two sufficient conditions to classify the ergodic and transient behaviors and provides inductive dimensional reductions of the posterior dynamics. Our results offer the first qualitative and geometric classification of TS under misspecification, bridging Bayesian learning with evolutionary dynamics, and also build the foundations of robust decision-making in structured bandits.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Adam Improves Muon: Adaptive Moment Estimation with Orthogonalized Momentum

Efficient stochastic optimization typically integrates an update direction that performs well in the deterministic regime with a mechanism adapting to stochastic perturbations. While Adam uses adaptive moment estimates to promote stability, Muon utilizes the weight layers' matrix structure via orthogonalized momentum, showing superior performance in large language model training. We propose a new optimizer and a diagonal extension, NAMO and NAMO-D, providing the first principled integration of orthogonalized momentum with norm-based Adam-type noise adaptation. NAMO scales orthogonalized momentum using a single adaptive stepsize, preserving orthogonality while improving upon Muon at negligible additional cost. NAMO-D instead right-multiplies orthogonalized momentum by a diagonal matrix with clamped entries. This design enables neuron-wise noise adaptation and aligns with the common near block-diagonal Hessian structure. Under standard assumptions, we establish optimal convergence rates for both algorithms in the deterministic setting and show that, in the stochastic setting, their convergence guarantees adapt to the noise level of stochastic gradients. Experiments on pretraining GPT-2 models demonstrate improved performance of both NAMO and NAMO-D compared to the AdamW and Muon baselines, with NAMO-D achieving further gains over NAMO via an additional clamping hyperparameter that balances the competing goals of maintaining a well-conditioned update direction and leveraging fine-grained noise adaptation.
Read the full abstract

Probability

Graph distance and effective resistance of the four-dimensional random walk trace

Refining previous results, we establish a sharp asymptotic estimate on the expected graph distance between the origin and the terminal point of the trace of the first $n$ steps of the walk. A similar conclusion is drawn for the resistance metric.

Operator Algebras

$C(SO_q(2n+1)/SO_q(2n-1))$ as iterated torsioned quantum double suspensions of $C(\mathbb{T})$

Let $A$ be a unital $C^*$-algebra, and let $\Sigma^2_m A$ denote the $m$-torsioned quantum double suspension of $A$. For $q \in (0,1)$ and $n \geq 1$, we prove that the $C^*$-algebra corresponding to the quotient space $SO_q(2n+1)/SO_q(2n-1)$ is isomorphic to $\Sigma^{2(n-1)} \, \Sigma^2_2 \, \Sigma^{2(n-1)} C(\mathbb{T})$. It follows as a consequence that these spaces are independent of the deformation parameter $q$.
Read the full abstract

Analysis of PDEs

On sliding methods for mixed local and nonlocal equations and Gibbons' conjecture

We investigate elliptic and parabolic equations involving mixed local and nonlocal operators of the form $(-\Delta)^s-\Delta$, as well as their parabolic counterparts with both the Marchaud fractional time derivative and the classical first-order derivative. A major difficulty in this setting stems from the coexistence of operators with different nonlocal structures and incompatible scaling properties, which obstruct the direct use of classical sliding methods. To address this issue, we develop a refined sliding method suited to mixed local-nonlocal operators. As key technical ingredients, we establish new generalized weighted average inequalities, narrow region principles, and maximum principles in bounded and unbounded domains. These tools enable us to derive monotonicity and one-dimensional symmetry results for mixed elliptic equations in bounded domains, half-spaces, and the whole space, and to extend the analysis to parabolic equations with mixed time derivatives. As an application, we resolve the Gibbons' conjecture for a class of mixed fractional equations.
Read the full abstract

All authors Yinbin Deng, Pengyan Wang, Zhihao Wang, Leyun Wu

Information Theory · Cross-listed from quant-ph

Quantum-Channel Matrix Optimization for Holevo Bound Enhancement

Quantum communication holds the potential to revolutionize information transmission by enabling secure data exchange that exceeds the limits of classical systems. One of the key performance metrics in quantum information theory, namely the Holevo bound, quantifies the amount of classical information that can be transmitted reliably over a quantum channel. However, computing and optimizing the Holevo bound remains a challenging task due to its dependence on both the quantum input ensemble and the quantum channel. In order to maximize the Holevo bound, we propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble. We provide a detailed complexity analysis for the proposed algorithm. Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
Read the full abstract

All authors Hong Niu, Chau Yuen, Alexei Ashikhmin, Lajos Hanzo

Optimization and Control

Formalization of Two Fixed-Point Algorithms in Hilbert Spaces

Iterative algorithms are fundamental tools for approximating fixed-points of nonexpansive operators in real Hilbert spaces. Among them, Krasnosel'skiĭ–Mann iteration and Halpern iteration are two widely used schemes. In this work, we formalize the convergence of these two fixed-point algorithms in the interactive theorem prover Lean4 based on type dependent theory. To this end, weak convergence and topological properties in the infinite-dimensional real Hilbert space are formalized. Definition and properties of nonexpansive operators are also provided. As a useful tool in convex analysis, we then formalize the Fejér monotone sequence. Building on these foundations, we verify the convergence of both the iteration schemes. Our formalization provides reusable components for machine-checked convergence analysis of fixed-point iterations and theories of convex analysis in real Hilbert spaces. Our code is available at https://github.com/TTony2019/fixed-point-iterations-in-lean.
Read the full abstract

All authors Yifan Bai, Yantao Li, Jian Yu, Jingwei Liang

Analysis of PDEs

Asymptotic stability of symmetric flows with viscous inflow boundary condition

We study the two-dimensional incompressible Navier-Stokes equations in a channel $\Omega=(0,L)\times(0,H)$ with small viscosity $\varepsilon\ll1$, an $\varepsilon$-Navier slip condition on the horizontal walls, and a viscous inflow condition for the perturbation stream function. For a broad class of symmetric base profiles $u_0(y)$ vanishing on the walls, we construct an exact steady solution $(u_s,v_s)$ that is $O(\varepsilon^{1/3})$-close to the shear $(u_0,0)$. We then develop a new weighted vorticity energy method to prove uniform linear stability and exponential decay: perturbations decay exponentially in a weighted $L^2$ norm on the time scale $O(\varepsilon^{-1/3})$. In the short-channel regime $L\ll1$, the method yields nonlinear asymptotic stability with threshold $O(\varepsilon^{2/3})$. In the long-channel regime, assuming concavity together with a spectral condition, we introduce a quantity Rayleigh vorticity to control the non-favorable terms and obtain nonlinear stability with threshold $O(\varepsilon^{5/6+})$.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Environment-Aware Network-Level Design of Pinching-Antenna Systems–Part II: Geometry-Aware Case

This two-part paper aims to develop an environment-aware network-level design framework for generalized pinching-antenna systems to overcome the limitations of conventional link-level optimization, which is tightly coupled to instantaneous user geometry and thus sensitive to user mobility and localization errors. Part I investigates the traffic-aware case, where user presence is characterized statistically by a spatial traffic map and deployments are optimized using traffic-aware network-level metrics. Part II complements Part I by developing geometry-aware, blockage-aware network optimization for pinching-antenna systems in obstacle-rich environments. We introduce a grid-level average SNR model with a deterministic LoS visibility indicator and a discrete activation architecture, where the geometry-dependent terms are computed offline in advance. Building on this model, we formulate two network-level activation problems: (i) average-SNR-threshold coverage maximization and (ii) fairness-oriented worst-grid average-SNR maximization. On the algorithmic side, we prove the coverage problem is NP-hard and derive an equivalent mix-integer linear programming reformulation through binary coverage variables and linear SNR linking constraints. To achieve scalability, we further develop a structure-exploiting coordinate-ascent method that updates one waveguide at a time using precomputed per-candidate SNR contributions. For the worst-grid objective, we adopt an epigraph reformulation and leverage the resulting monotone feasibility in the target SNR, enabling an efficient bisection-based solver with low-complexity feasibility checks over the discrete candidate set. Simulations results validate the proposed designs and quantify their gains under different environments and system parameters.
Read the full abstract

All authors Yanqing Xu, Zhiguo Ding, Xiu Yin Zhang, Trung Q. Duong, Tsung-Hui Chang

Functional Analysis

Product Hardy Spaces on Spaces of Homogeneous Type: Discrete Product Calderón-Type Reproducing Formula, Atomic Characterization, and Product Calderón–Zygmund Operators

Let $i\in\{1,2\}$ and $X_i$ be a space of homogeneous type in the sense of Coifman and Weiss with the upper dimension $\omega_i$. Also let $\eta_i$ be the smoothness index of the Auscher–Hytönen wavelet function $\psi^{k_i}_{\alpha_i}$ on $X_i$. In this article, for any $p\in(\max\{\frac{\omega_1}{\omega_1+\eta_1},\frac{\omega_2}{\omega_2+\eta_2}\}, 1]$, by regarding the product Carleson measure space $\mathrm{CMO}^p_{L^2}(X_1\times X_2)$ as the test function space and its dual space $(\mathrm{CMO}^p_{L^2}(X_1\times X_2))'$ as the corresponding distribution space, we introduce the product Hardy space $H^p(X_1\times X_2)$ in terms of wavelet coefficients. Moreover, we establish an atomic characterization of this product Hardy space and, as an application, obtain a criterion for the boundedness of linear operators from product Hardy spaces to corresponding Lebesgue spaces. To escape the wavelet reproducing formula, which is not useful for this atomic characterization because the wavelets have no bounded support, we establish a new discrete product Calderón-type reproducing formula, which holds in the product Hardy space and has bounded support. This reproducing formula also leads to the boundedness of product Calderón–Zygmund operators on the product Hardy space.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Environment-Aware Network-Level Design of Pinching-Antenna Systems–Part I: Traffic-Aware Case

Existing studies on pinching-antenna systems have primarily focused on link-level design, where system parameters are optimized for a given user set according to user-specific communication metrics. Such designs provide an effective means of exploiting the spatial reconfigurability of pinching antennas for short-term user-centric transmission. Complementing this perspective, this two-part paper develops an environment-aware network-level design framework, where pinching-antenna configurations are optimized according to long-term spatial information and evaluated through network-level performance metrics. Part I focuses on the traffic-aware case, where user presence is modeled statistically by a spatial traffic map and performance is optimized and evaluated in a traffic-aware sense; Part II addresses the geometry-aware case in obstacle-rich environments by explicitly modeling line-of-sight blocking and optimizing region-wide robustness objectives. In Part~I, we introduce traffic-weighted average SNR metrics and formulate two traffic-aware deployment problems: (i) maximizing the traffic-weighted network average SNR, and (ii) a fairness-oriented traffic-restricted max–min average-SNR design over traffic-dominant grids. To solve these nonconvex problems with low complexity, we reveal and exploit their separable structures. For the network-average objective, we establish unimodality properties of the hotspot-induced components and develop a candidate-based low-complexity method that only needs to evaluate the objective at a small set of candidate antenna positions. For the traffic-restricted max–min objective, we develop a block coordinate descent framework where each coordinate update reduces to a one-dimensional subproblem via an epigraph reformulation and bisection. Simulations show that the proposed design outperm.
Read the full abstract

All authors Yanqing Xu, Zhiguo Ding, Xiu Yin Zhang, Trung Q. Duong, Tsung-Hui Chang

General Topology

Fundamental examples of Reeb spaces of smooth functions defined from two graphs of smooth functions with same asymptotic behaviors

Reeb spaces of (continuous) real-valued functions on (nice) topological spaces are the spaces whose underlying sets consist of all connected components (contours) of their level sets and seen naturally as quotient spaces of the spaces. They are "$1$-dimensional" spaces in various nice cases. They are graphs or graphs with ends for smooth function cases with nice singularities and behaviors. Reeb spaces have been fundamental and important in theory of Morse functions and more general smooth functions and applications to geometry, since the 20th century. We present Reeb spaces homeomorphic to infinite graphs (with ends) for functions on non-compact manifolds with no boundary. This paper is a note on cases previously obtained by the author. More explicitly, we consider a natural smooth map onto the region surrounded by the graphs of two smooth real-valued functions in the plane and its composition with the canonical projection.
Read the full abstract

Analysis of PDEs

Divergence-form equations admitting nowhere $C^1$ Lipschitz weak solutions

We study a class of partial differential equations in divergence form that admit highly irregular Lipschitz weak solutions. By reformulating these divergence-form equations as a first-order partial differential relation and adapting the convex integration scheme recently developed in \cite{GKY26} for irregular diffusion equations, we show that the same structural Condition~$O_N$ introduced there also ensures the existence of Lipschitz weak solutions that are nowhere $C^1$ for the corresponding time-independent equations in bounded domains, under suitable boundary data. In particular, for the smooth strongly polyconvex functions on $\mathbb{R}^{2\times n}$ constructed in that paper for all $n \ge 2$, the associated Euler–Lagrange equations admit Lipschitz weak solutions that are nowhere $C^1$ and satisfy zero boundary conditions in any bounded domain of $\mathbb{R}^n$. Our approach relies on new building blocks constructed from the same wave cone and $\mathcal{T}_N$-configurations employed in the analysis of diffusion equations.
Read the full abstract

Number Theory

The Parabolic Mellin Transform: Gamma and Zeta Integral Representations

We introduce the Parabolic Mellin Transform (PMT), defined by ${P}_{\sigma}[f](z)=\int_{-\infty}^{\infty}w^{2z}f(w^2)dt$, where $w=\sigma+it$ and $\sigma>0$. Under the substitution $u=w^2$, the vertical line $\operatorname{Re}(w)=\sigma$ is mapped to the parabolic contour $C_\sigma$ in the $u$-plane. For the Gaussian kernel, the PMT yields $\int_{-\infty}^{\infty}w^{2z}e^{w^2}dt=\pi/\Gamma(\tfrac{1}{2}-z)=\cos(\pi z)\Gamma(z+\tfrac{1}{2})$, a parabolic-contour form of the classical Hankel representation for the reciprocal Gamma function. The advantage of this parametrization is that the contour integral becomes a Gaussian-damped vertical-line integral. We develop scaling, differentiation, and Dirichlet-composition identities for the PMT and use them to derive integral representations of the Hurwitz zeta, Riemann zeta, and Dirichlet eta functions. The framework provides a unified transform dictionary for Gamma-type and zeta-type special functions and yields equivalent reformulations of the Riemann hypothesis and the Lindelöf hypothesis in terms of zeros and growth of parabolic-contour integrals.
Read the full abstract

Probability

Central limit theorem for linear eigenvalue statistics of random geometric graphs

Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric graph, obtained by placing vertices according to a Poisson point process and connecting two vertices whenever their Euclidean distance is less than a certain threshold. Despite their broad applicability, the spectral properties of such spatial models remain far less understood than those of classical random graph models, such as Erdős-Rényi graphs and Wigner matrices. The main obstacle is the presence of spatial constraints, which induce highly nontrivial dependencies among edges, placing these models outside the scope of techniques developed for purely combinatorial random graphs. In this paper, we provide the first rigorous analysis of Gaussian fluctuations for linear eigenvalue statistics of random geometric graphs. Specifically, we establish central limit theorems for $\text{Tr}[\phi(A)]$, where $A$ is the adjacency matrix and $\phi$ ranges over a broad class of suitable (possibly non-polynomial) test functions. In the polynomial setting, we moreover obtain a quantitative central limit theorem, including an explicit convergence rate to the limiting Gaussian law. We further obtain polynomial-test-function CLTs for other canonical random spatial networks, including $k$-nearest neighbor graphs and relative neighborhood graphs. Our results open new avenues for the study of spectral fluctuations in spatially embedded random structures and underscore the delicate interplay between geometry, local dependence, and spectral behavior.
Read the full abstract

Mathematical Physics · Cross-listed from cs.CE

A Total Lagrangian Finite Element Framework for Multibody Dynamics: Part I – Formulation

We present a Total Lagrangian finite element framework for finite-deformation multibody dynamics. The framework combines a compact kinematic representation, a deformation-gradient-based formulation, an element-agnostic constitutive interface, and a systematic constraint-construction machinery for coupling deformable bodies through engineering joints. Within this setting, we derive the equations of motion for collections of deformable bodies and formulate their response in the presence of external loads, frictional contact forces, and constraint reaction forces. The framework accommodates field forces applied pointwise, over surfaces, or throughout volumes, and supports material models of practical interest, including Mooney-Rivlin, Neo-Hookean, and Kelvin-Voigt. A companion paper discusses the GPU-accelerated implementation of the framework outlined herein and reports on numerical experiments and benchmark results.
Read the full abstract

Commutative Algebra

Neural codes via homological invariants of polarized neural ideals

For a neural code $\mathcal{C}\subseteq\mathbb{F}_2^n$, polarizing the canonical form generators of the neural ideal $J_{\mathcal{C}}$ yields a squarefree monomial ideal $\mathcal{P}(J_{\mathcal{C}})\subset k[x_1,\dots,x_n,y_1,\dots,y_n]$, the polarized neural ideal, and an associated simplicial complex $\Delta_{\mathcal{C}}$, the polar complex. We study the graded invariants $\operatorname{pd}(\mathcal{P}(J_{\mathcal{C}}))$ and $\operatorname{reg}(\mathcal{P}(J_{\mathcal{C}}))$ via the topology of $\Delta_{\mathcal{C}}$, showing that simple geometric features of the Hamming cube $\mathbb{F}_2^n$ (with Hamming distance) organize their extremal behavior. We prove $\operatorname{reg}(\mathcal{P}(J_{\mathcal{C}}))\le 2n-1$, with equality precisely when $\mathcal{C}$ is obtained from $\mathbb{F}_2^n$ by deleting an antipodal pair. Using connectedness properties of induced subcomplexes of $\Delta_{\mathcal{C}}$, we obtain $\operatorname{pd}(\mathcal{P}(J_{\mathcal{C}}))\le 2n-3$, and we give an explicit family of codes attaining equality, each consisting of antipodal pairs. At the opposite end, we identify the cube geometry behind the smallest values: $\operatorname{reg}(\mathcal{P}(J_{\mathcal{C}}))=1$ forces $\mathcal{C}$ to be a coordinate subcube of $\mathbb{F}_2^n$, while $\operatorname{pd}(\mathcal{P}(J_{\mathcal{C}}))=0$ forces $\mathcal{C}$ to be the complement of one. Finally, we construct families realizing large regions of the $(\operatorname{pd},\operatorname{reg})$-plot for fixed $n$.
Read the full abstract

Optimization and Control

Bessel Function Analysis of Nesterov's ODE in $N$-Player Quadratic Games

We analyze Nesterov's accelerated gradient descent (NAGD) for Nash equilibrium seeking in $N$-player quadratic games. While the continuous-time NAGD dynamics - the Su-Boyd-Candès ODE - are well understood for convex optimization, their behavior with non-symmetric pseudo-gradient matrices arising in games has not been characterized precisely. We establish spectral characterizations via Bessel function modal analysis: the equilibrium is unstable whenever any eigenvalue of the pseudo-gradient matrix $G$ lies outside $\mathbb{R}_{\geq 0}$, and all trajectories converge when every eigenvalue lies in $\mathbb{R}_{\geq 0}$ and $G$ is diagonalizable. Remarkably, complex eigenvalues with positive real parts, which ensure stability for first-order gradient dynamics, induce exponential instability in NAGD. This reveals that the momentum mechanism enabling $O(1/t^2)$ convergence in optimization can be detrimental for equilibrium seeking in non-potential games.
Read the full abstract

Wednesday 18 February

Rings and Algebras

A Homogeneous Nullstellensatz for Joint Invariant Subspaces

Jurij Volčič conjectured that a noncommutative polynomial $g$ belongs to the unital $\mathbb{K}$-algebra generated by finitely many noncommutative polynomials if and only if, for matrices of every size, every joint invariant subspace of the evaluations of the generators is also invariant under the evaluation of $g$. In this paper, we establish a homogeneous Nullstellensatz for joint invariant subspaces by proving that this equivalence holds whenever the generators are homogeneous. In contrast, we demonstrate that the statement fails in the general case, thereby settling the conjecture completely.
Read the full abstract

Number Theory

The Golden Sieve

We revisit the golden sieve, a self-referential deletion process on increasing sequences of positive integers introduced by the author in 2002. Applied to the natural numbers, the sieve produces the Wythoff pair as a Beatty partition. For arithmetic progressions $a\mathbb{N}+b$, we establish a connection with the $(j,x,y,z)$-hiccup sequences recently studied by Fokkink and Joshi and with Fraenkel's complementary partitions. We further introduce an extraction sieve that also produces hiccup sequences, and whose action on arithmetic progressions is governed by an explicit affine transformation of hiccup parameters.
Read the full abstract

2602.17735 · 18 Feb · 26 pages, 2 tables. Added proof chain for the Wythoff identification made clear. Remark on Beatty dichotomy promoted to Corollary with explicit algebraic obstruction. Several redundant remarks removed. Open questions reduced to three

General Mathematics

Internal Symmetry Group in Categorial Topology

The interdefinability of the universal concepts of category theory has been introduced by Lawvere. The perfect interdefinability between the objects and arrows of some category, defines the class of Perfectly Symmetric Categories (PSC) where each category can be represented equivalently by its arrows or by its objects only. Such symmetry, differently from the global categorial symmetry ( categorial-symmetry group $CS(\mathbb{Z})$ of all comma-propagation transformations), ia a local internal symmetry inside a given PSC category. Given a PSC category (as a "geometric object") $\textbf{C}$ we can consider its properties (the categorial commutative diagrams) preserved under actions of a particular endofunctor $E$ which transforms any commutative diagram into an invariant "up to isomorphism" diagram. We show that this kind of internal categorial invariance is a phenomena of a local categorial symmetry under an Internal Catergorial Symmetry group $ICS(\mathbb{N})$ of all local enfdofunctorial transformations. Then we establish the relationships between this local internal symmetry and global general symmetry between n-dimensional levels (the comma categories obtained from a PSC category $\textbf{C}$) . We show that if a base category $\textbf{C}$ is a PSC, then all its ne-dimensional levels are PSC as well.
Read the full abstract