Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 10 April

Probability

Bismut Formula for Intrinsic Derivative of DDSDEs with Singular Interactions

In recent years, remarkable progress has been made for Distribution dependent stochastic equations (DDSDEs) with singular interactions, existing results include wellposedness, propagation of chaos, entropy cost inequality and ergodicity. As a continuation to the existing study, in this paper we establish Bismut type formulas for the intrinsic derivative of DDSDEs with singular interactions, which extends the existing formula established for the case with Lion's differentiable drifts.
Read the full abstract

Probability

Matrix Representations for Scale Functions of Spectrally Negative Lévy Processes with Rational Jumps

For a spectrally negative Lévy process with Laplace transform $\psi$, the $q$-scale function is characterized as the function whose Laplace transform is $(\psi(\cdot)-q)^{-1}$. It has applications in fluctuation theory, for example, exit problems and first hitting probabilities. It is also used in areas like ruin theory, risk theory, continuous state branching processes and optimal control. In this paper, we extend the scale function representation of Ivanovs (2021) from spectrally negative Lévy processes with phase-type jumps to the general case of matrix-exponential jumps. The extension is non-trivial because the probabilistic arguments employed by Ivanovs rely on an embedding to a Markov-modulated Brownian motion, a framework that does not accommodate the algebraic generality of matrix-exponential distributions. We overcome this limitation by embedding the Lévy process into a stochastic fluid process modulated by a rational arrival process (RAP), a class of continuous-valued Markov processes driven by orbit processes. This approach yields iterative schemes related to those of Ivanovs (2021) to provide a simple and explicit formula for the scale function. Our method gives the same fixed point when restricted to the phase-type case, and demonstrates the utility of orbit representations in analytical problems beyond the phase-type setting.
Read the full abstract

Probability

Heavy-traffic limit of stationary distributions of a state-dependent queue

Inspired by the work of Atar and Miyazawa [1] (2026) as well as applications to energy-saving problems, we are interested in the heavy-traffic limit of the stationary queue length distribution, which is not addressed in [1]. In this paper, we consider this heavy-traffic limit for the single server queue which has the most general possible state-dependence. Namely, arrival and service speeds may take any values depending on the queue length. Here, the terminology, heavy-traffic limit, stands for a diffusion-scaled limit in heavy-traffic for processes, distributions and modeling primitives. This general model is referred to as a state-dependent queue. There are two motivations for this generalization. One is interest in the state-dependent queue itself because it allows finer control of service speed in application. Another is making it clear how the heavy-traffic limit is obtained under what conditions for the state-dependent queue. Thus, we start to study basic properties of this state-dependent queue, including its stability. We then take the sequence of the stationary distributions of its diffusion scaled queue-length processes. We have three main results for this sequence. We first show that it is tight if the heavy-traffic limit of their drifts exists and is negative as the queue length goes to infinity, where a drift is the arrival speed minus the service speed. We next assume the condition that the limit of every vaguely convergent subsequence has a density, which is referred to as a density condition, and show that the heavy-traffic limit of the stationary distributions is obtained in a closed form if and only if that negative drift condition holds. We then show that the density condition is always satisfied for the multi-level queue, so the problem is nicely solved for the multi-level queue.
Read the full abstract

Dynamical Systems

Structure of Motion under Constraints and non-Holonomic Path-Following on $R^3$

In this paper we study a path-following problem on $R^3$ with a non-holonomic constraint. The geometric structure associated to the velocity constraint is explored, and general principles for constructing guiding vector fields are obtained, fulfilling the path-following requirements on a neighborhood of the desired path while allowing the design of vector fields to be conducted in global coordinates.
Read the full abstract

Numerical Analysis

Adaptive Randomized Neural Networks with Locally Activation Function: Theory and Algorithm for Solving PDEs

This paper establishes an approximation theory and develop an adaptive computational framework for randomized neural networks (RaNNs). For RaNNs of the form $\sum_{i=1}^{N} W_i \sigma(A_i\cdot x+B_i)$ with hidden parameters uniformly sampled from a bounded set of scale $M$, we show that the choice $M \asymp N^{p/[2((p-1)(d+1)+p\eta)]}$ yields an expected $W^{k,p}$-approximation error of order $\mathcal{O}\left(N^{-p\eta/[2((p-1)(d+1)+p\eta)]}\right)$, where $\eta$ is associated with the regularity of the target function in a generalized Barron spectral space. This theoretical result demonstrates that lower regularity requires a larger sampling range for the hidden parameters. Motivated by the relationship between $M$ and $\eta$, we introduce an adaptive physics-informed RaNN (PIRaNN) method that which couples parameter sampling with an adaptive partition of unity via local affine scaling. Residual-based a posteriori error indicators and Dörfler marking are used to drive local refinement. Numerical experiments, including the 1D viscous Burgers' equation and 2D/3D problems with localized peaks and L-shaped corner singularities, demonstrate that our method preferentially refines regions exhibiting large gradients and singularities. Compared to standard non-adaptive RaNNs, the adaptive PIRaNN effectively captures complex local features with significantly enhanced accuracy and efficiency.
Read the full abstract

Dynamical Systems

Computing with reaction networks at input-independent speed: exponential and logarithmic functions

The concept of input-independent computational speed for chemistry-based analog computers was introduced in Anderson-Joshi (2025), where it was shown that arithmetic operations can be computed with a convergence rate bounded below independently of the input values. Here, by inputs we mean the numerical values encoded by the initial concentrations of designated input species, with the underlying reaction network and rate constants held fixed. Combining these operations via power series to approximate transcendental functions is possible in principle, but the number of chemical species required grows with the number of terms retained, and achieving sufficient accuracy may demand many terms—a burden that is especially severe for slowly converging series such as the power series for the logarithm. In this paper, we begin the program of directly computing transcendental functions by chemical reaction networks by focusing on the exponential and logarithmic functions, two widely used transcendental functions, and constructing reaction network modules that compute them without relying on truncated power series. We show that the resulting modules are mass-action systems, and prove that they achieve arbitrary accuracy given sufficient time while operating at input-independent speed. Moreover, these modules can be combined with each other and with the arithmetic modules of Anderson-Joshi (2025): any such composite computation also runs at input-independent speed, with a convergence rate that does not depend on the length of the feedforward chain. Logarithm and exponential functions serve as foundational cases, and the constructions developed here are intended to serve as templates for the direct computation of more general transcendental functions by chemical reaction networks.
Read the full abstract

Combinatorics

Asymptotic enumeration of admixed arrays and a different independence heuristic

We introduce a class of paired binary matrices called admixed arrays, which arise in analyses of large-scale genetic data and can be viewed as weighted edge colorings of complete bipartite graphs. This combinatorial structure gives rise to two natural families of marginal constraints: a row-sum constraint and a paired column-sum constraint, the latter inducing an inequality among entries of the matrix pair. We study the enumeration of admixed arrays under these constraints in dense regimes. First, we obtain exact formulas for the sizes of the families defined by each constraint in isolation and derive a finite-size criterion characterizing when one constraint is more restrictive than the other. In the large-dimension limit, this comparison simplifies to an entropy inequality, yielding an information-theoretic interpretation and a quantifiable error bound in the semi-regular case. We then analyze the asymptotic enumeration of the doubly constrained family in a semi-regular setting. Using saddle-point approximation and probabilistic techniques, we derive a detailed asymptotic expansion for the logarithm of the count, isolating an explicit fourth-moment contribution and establishing quantitative control of the higher-order remainder. A consequence of this analysis is a phenomenon absent from classical binary and integer matrix models: in the regime $N=\Theta(P)$ with uniform margins and density bounded away from zero, the two constraint families obey the independence heuristic with a correction factor $1/\sqrt[4]{e}$ rather than the familiar $e^{\pm1/2}$. Numerical experiments corroborate the analytical approximations, and we implement and extend an algorithm of Miller and Harrison (2013) as open-source software to enumerate constrained admixed arrays.
Read the full abstract

Analysis of PDEs

Derivation and local well-posedness of a relativistic quantum hydrodynamic system on the Heisenberg group

We derive and analyze a relativistic quantum hydrodynamic (RQHD) system on the Heisenberg group. Starting from the Klein–Gordon–Poisson system, we apply the Madelung transformation to obtain a fluid-type model in which the relativistic and quantum parameters are explicitly separated. The Heisenberg-group structure gives rise to an additional geometric term in the momentum equation, reflecting the underlying noncommutative structure. A central analytical difficulty is the possible appearance of vacuum, where the phase function and the quantum potential become singular. To address this issue, we reformulate the RQHD system as an extended hyperbolic–elliptic system with auxiliary variables. For this extended system, we establish uniform higher-order energy estimates on $\mathbb H^1$ by combining the Banach algebra property of sub-elliptic Sobolev spaces with noncommutative Fourier analysis. We then prove that the extended system is equivalent to the original RQHD system at the level of classical solutions. As a consequence, we obtain the local-in-time existence and uniqueness of non-vacuum classical solutions to the RQHD system on $\mathbb H^1$. The result also provides a framework for the study of related singular limits, including the semiclassical and non-relativistic limits on nilpotent Lie groups.
Read the full abstract

All authors Ben Duan, Yutian Li, Rongrong Yan, Ran Zhang

Information Theory

Shortest Embeddings of Linear Codes with Arbitrary Hull Dimension

In this paper, we study the shortest $t$-dimensional hull embeddings of linear codes in both Euclidean and Hermitian cases, extending the existing research on the shortest LCD and self-orthogonal embeddings to arbitrary hull dimensions and arbitrary finite fields. We obtain the exact length of such embeddings by adopting tools from quadratic form theory over finite fields and classical group theory. Based on the congruence equivalence class of Gram matrices of linear codes, we classify linear codes into distinct “types” and present corresponding constructive algorithms. In particular, we improve the results of An et al. and fully determine the length of the shortest self-orthogonal embeddings for linear codes. Finally, applying these algorithms, we provide examples for various settings and obtain several optimal codes inequivalent to those in the BKLC database.
Read the full abstract

Dynamical Systems

Modelling the coevolution of opinion dynamics and decision making in social dilemmas

This paper proposes a mathematical model for the coevolution of actions and opinions for a population facing a social dilemma. In particular, we assume each person participates in a Public Goods Game (PGG), with their action being to cooperate or defect, and holds an opinion about which action they prefer. We propose a payoff function that combines the PGG with the Friedkin–Johnsen model from opinion dynamics to form a coevolutionary game. According to a discrete-time process, players asynchronously update their actions and opinions, aiming to maximise their individual payoff for the coevolutionary game using myopic best-response. We study the equilibria and provide conditions for the existence of the all-defection and all-cooperation consensus equilibria. We also establish conditions for global convergence to the all-defection equilibrium.
Read the full abstract

All authors Ella C. Davidson, Lorenzo Zino, Ming Cao, Mengbin Ye

Number Theory

Identities and transformations for Lambert series and double Lambert series

We establish two identities for Lambert series and double Lambert series, thereby resolving conjectures of Andrews, Dixit, Schultz and Yee (Acta Arith.~181:253–286, 2017), as well as Amdeberhan, Andrews and Ballantine (J Combin Theory Series A 221:106154, 2026). The proofs are based on classical transformations in the theory of infinite series together with a systematic rearrangement of double Lambert series.
Read the full abstract

Category Theory

A Universal Quotient of Banking APIs

Four axioms of immutable ledger, linear consent, payment irreversibility, and bounded credit manifest themselves as institutional facts codified by banking practice for the transfer of monetary value. These axioms certify the independence of 14 empirically observed and jurisdictionally invariant dimensions. Morphisms of the ambient category do not admit sections that would reconstruct one dimension from another, and every morphism admits epi-mono factorisation through the universal quotient Q_public. This factorisation is forced by definite causal order under classical realisation and echoes the factorisation theorem of Gogioso et al. Gaussian elimination across 4,590 endpoints from BIAN, CDR, and OBIE confirms rank 14 and witnesses the jurisdictional invariance of the quotient object. The axioms similarly constrain the monoidal structure. The information dominance preorder is a thin category; all five Szlachanyi conditions follow, establishing that Q_public carries left skew monoidal structure.
Read the full abstract

Thursday 9 April

General Mathematics

The Geometry of Dilation- and Shear-Deformed Spaces

This paper develops a deformation-field geometry for spaces whose local frames may undergo internal dilation, compression, and shear. The basic datum is an admissible dilation-shear field $P$ over a selected metric-compatible reference geometry $(M,\bar g,\bar\nabla)$. It represents the induced metric by $g=P^T\bar gP$ and compares tangent data through the reference representative $\bar V=PV$. The covariant derivative associated with the natural connection is defined by \[ \nabla_XV=P^{-1}\bar\nabla_X(PV), \] with local connection coefficients \[ \Gamma=\Lambda=P^{-1}\bar\Gamma P+P^{-1}dP . \] Thus the total dilation-shear compensation is represented by the natural connection coefficients $\Gamma=\Lambda$. If $\bar\nabla\bar g=0$, then $\nabla g=0$; hence the covariant derivative associated with the natural connection has zero nonmetricity. The general distinction from Levi-Civita geometry lies instead in torsion and in the deformation origin of the comparison. The Levi-Civita connection coefficients $\mathring\Gamma[g]$ are retained as the torsion-free metric connection of the induced metric layer; they appear naturally in fully isometric realizations, but they are not an additional term to be added to the natural connection. The same pullback rule covers composite references that already contain both an isometric realization and an internal dilation-shear natural connection. Examples involving one-dimensional dilation, conformal deformation, anisotropic dilation, shear, and spherical geometries distinguish metric representation, natural dilation-shear comparison, Levi-Civita comparison, and embedded realization.
Read the full abstract

Rings and Algebras

Tomiyama-type maps with a diagonal perturbation

We investigate a two-parameter family of linear maps on matrix algebras, constructed as diagonal perturbations of classical Tomiyama maps. Employing the Choi matrix method alongside block-positivity techniques, we derive explicit necessary and sufficient conditions for positivity, complete positivity, and k-positivity across arbitrary dimensions. These conditions provide a transparent geometric characterization of the positivity regions within the parameter space.
Read the full abstract

Statistics Theory · Cross-listed from stat.AP

Simulation Based Inference of a Simple Neural Network Structure

Neurophysiologists are nowadays able to record from a large number of extracellular electrodes and to extract, from the raw data, the sequences of action potentials or spikes generated by many neurons. Unfortunately these ”many neurons” still represent only a tiny fraction of the neuronal population that constitutes the network. Using association statistics such as the estimation of the cross-correlation functions, they are trying to infer the structure of the network formed by the recorded neurons. But this inference is compromised by the tremendous under-sampling of the neuronal population. We propose to focus instead on simple spike train statistics, like the empirical spikes frequency, or the interspike interval distribution. Their sampling distributions can be estimated by simulations, and, given a few observed spike train statistics, they provide enough information to infer the structure of the underlying network. We show that, on a ”toy model”, our method gives significantly better results than the sub-network reconstruction method with regards to the inference of the connection probability of the original network.
Read the full abstract

Numerical Analysis · Cross-listed from stat.AP

Bathymetry Reconstruction by Bayesian Inference

Bathymetry reconstruction is an important problem in various fields, including oceanography and environmental monitoring. This paper presents a Bayesian inference approach to reconstructing bathymetries from point measurements of the water height. We test the method for parameterized and discretized bathymetries with synthetic data to evaluate its performance and limitations. Our results indicate that the Bayesian framework provides a robust approach to bathymetry reconstruction. Finally, we use the framework to reconstruct a real-world bathymetry in a wave flume from experimental measurements and compare its performance to an adjoint optimization method. The Bayesian approach improves the normalized root mean squared error (NRMSE) of the reconstruction and provides better qualitative features, while also quantifying uncertainty.
Read the full abstract

All authors Lars Stietz, Sebastian Götschel, Peter Schleper, Daniel Ruprecht

Analysis of PDEs

Global in time justification of a two-phase averaged system for heat-conducting ideal gases

In this article, we mathematically justify (globally in time) a Baer-Nunziato type system from the non-isentropic compressible Navier-Sokes equations for heat conducting ideal gases posed over the torus and in one space dimension. The breakthrough in this paper is to define and prove the global existence of solutions in a framework intermediate between weak and strong solutions and then to derive the system through homogenization and Young measures characterization. Note that the main difficulty is to derive a priori uniform bounds on appropriate unknowns in the presence of piecewise constant coefficients (viscosity and adiabatic constants) exhibiting rapid oscillations between two positive values.
Read the full abstract

General Mathematics

Complexity scaling and optimal policy degeneracy in quantum reinforcement learning via analytically solvable unitary-control-then-measure models

We propose and analyse a class of analytically solvable models of quantum reinforcement learning (QRL), formulated as finite-horizon Markov decision processes in finite-dimensional Hilbert spaces. The models are built around a `unitary-control-then-measure' protocol, in which a learning agent applies unitary transformations to a quantum state and interleaves each control step with a projective measurement onto a prescribed reference basis. Exact closed-form expressions for trajectory probabilities, rewards, and the expected return are derived for four concrete realisations: a closed-chain and an anti-periodic qubit implementation, a qutrit model with ladder coupling, and a four-level two-qubit system. Two structural features of these QRL protocols are then analysed. First, we identify and quantify the reduction in the computational complexity of the expected return, from the nominally exponential $O(e^N)$ scaling in the trajectory length~$N$ to an explicit power-law $O(N^{\mathcal{I}})$, driven by two rigorously established mechanisms, a trajectory equivalence and a sparsity of the transition graph, besides a third, conjectured one: a spectral concentration of the return, at the optimal policy, onto the polynomially populated trajectory classes. Second, we characterise the degeneracy of optimal policies. The low-dimensional models exhibit unique optima whose asymptotic behaviour with~$N$ is governed by the quantum Zeno effect, while the four-level system displays both plateau-type quasi-degeneracy at large horizons and genuine discrete degeneracy at critical energy parameters – phenomena with no counterpart in the measurement-free quantum optimal control landscape.
Read the full abstract

General Mathematics

On the simplicial structure of uncertain information

The mathematical representation of uncertainty has led to a proliferation of preference structures, such as interval-valued fuzzy sets, intuitionistic fuzzy sets, and various granular models. While these extensions are often studied independently, they share profound geometric and topological foundations. This paper provides a unifying framework by identifying these disparate structures with the simplicial geometry of $n$-dimensional fuzzy sets. We first conduct an extensive revision of both classical and modern preference structures, demonstrating that they are distinct semantic interpretations of the same underlying topological objects within the lattice $L_n$. Building on this unification, we introduce a new, highly interpretable preference structure based on Deck-of-Cards membership functions. This approach generalizes the revised models by providing a flexible mechanism to represent complex membership degrees through monotonic sequences. Furthermore, we establish a formal simplicial structure for the set of multidimensional fuzzy sets $L_\infty$. By employing face and degeneracy maps, we demonstrate how this framework unifies existing models into a single simplicial set, allowing for the consistent transformation of information across different levels of granularity. The examples provided illustrate the utility of this simplicial connection in several contexts, offering a robust topological foundation for future developments in fuzzy set theory.
Read the full abstract

Algebraic Geometry

Rationality of cohomological descendent series for Quot schemes on surfaces with $p_g=0$

For a smooth projective surface $S$, Johnson–Oprea–Pandharipande defined cohomological descendent generating series for Quot schemes of rank-$0$ quotients of $\OO_S^{\oplus N}$. We prove rationality of these series in the remaining cohomological surface case \[ p_g(S)=0,\qquad \beta\neq 0,\qquad N>1. \] The wall-crossing part of the proof starts from Joyce-style generalized Donaldson–Thomas invariant classes of $H$-Gieseker semistable one-dimensional sheaves. We vary a single real parameter in the fixed-source Pairs stability condition and obtain the large-$c$ stable-pair chamber for maps $\OO_S^{\oplus N}\to F$. We then compare this pair chamber with the open pure Quot locus, meaning the locus inside the Quot scheme whose target quotient is pure one-dimensional, and then with the full Quot scheme, where zero-dimensional torsion in the target is allowed. The first comparison records the zero-dimensional cokernel of the image of a pair. After decomposing the pure Quot locus into locally-closed pieces on which the scheme-theoretic support curve is flat over the base, this comparison is identified with relative Quot theory on those support curves. The resulting curve-Quot contributions factor into smooth-normalization contributions and finitely many punctual factors at singular points of the support curve. The second comparison records the maximal zero-dimensional torsion subsheaf of a Quot target; locally it becomes a punctual Quot problem over the completed smooth surface ring $\C[[x,y]]$, and its contribution is the universal punctual smooth-surface factor.
Read the full abstract

General Mathematics

Continued fractions, determinant expressions, and identities

In this paper, we clarified the relationship between continued fractions, determinants, and identities, making it easier to apply these methods systematically in other settings. In particular, we studied finite continued fractions from the perspective of incomplete numbers (restricted or associated numbers) and also explored their relationships with determinant representations and identities. Most of the new results in this paper concern $q$-analogues of special numbers, whereas the classical cases mainly serve to illustrate and unify the general framework. The framework developed here is flexible and allows one to derive continued fractions, determinant formulas, and coefficient identities in a uniform way for several new $q$-families, and it is expected to be applicable to other families of special numbers, as well.
Read the full abstract

General Mathematics

Error terms for continued fractions of $e^{1/s}$ and $\sqrt{\frac{v}{u}}\tanh\!\Bigl(\frac{1}{\sqrt{uv}}\Bigr)$

Many classical identities arise from nothing more mysterious than looking at the same object in two different ways. A number, a function, or a combinatorial object may admit several natural decompositions, and by disassembling it in one way and reassembling it in another, we often obtain unexpected corollaries. Telescoping sums provide a particularly vivid incarnation of this principle: by arranging terms so that successive contributions cancel, one performs a conceptual “cut-and-paste” that often admits a clean geometric interpretation. Generating functions offer a complementary perspective. Encoding a problem into a formal power series and then evaluating that series at a prescribed point naturally expresses the same quantity as an infinite (or finite) expansion, and equating these representations yields a wealth of identities. For example, for a real number \(\alpha\) given by its continued fraction expansion $\alpha = [a_0, a_1,a_2,\dots]$, with convergents \(p_n/q_n\) and error terms $E_n := p_n - \alpha q_n$, one can obtain “additive” decompositions of the form $\sum_{n\ge-1} a_{n+1}\,\lvert E_n\rvert \;=\; \alpha + 1$, $\sum_{n\ge-1} a_{n+1}\,E_n^{2} \;=\; \alpha$. Thus $\alpha$ and $\alpha+1$ themselves appear as weighted sums of the local approximation errors of their convergents. In this note we explore what such decompositions yield in two explicit cases: the continued fraction \[ e^{1/s} = [1;\,{\overline{(2k-1)s-1,1,1}}]_{k=1}^{\infty} \] and the continued fraction \[ \frac{s}{u}\tanh\!\Bigl(\frac{1}{s}\Bigr) = [\,0;\,\overline{(4k-3)u,\,(4k-1)\tfrac{s^{2}}{u}}\,]_{k=1}^{\infty} \]
Read the full abstract

Number Theory

Order-3 pi-formulas, Apery-like kernels, and Clausen functoriality for Conservative Matrix Fields

Raz, Shalyt, Leibtag, Kalisch, Weinbaum, Hadad, and Kaminer recently showed that formulas for $\pi$ can be organized by canonical polynomial recurrences and partially unified by a rank-$2$ Conservative Matrix Field (CMF). We prove that each order-$3$ recurrence explicitly printed in the public Appendix~B.6 of their paper is a shifted summation lift of an explicit order-$2$ kernel, and identify all three kernels: the two $\pi$-kernels are explicit rescalings of the sporadic Apéry-like sequences $A036917$ and $A002895$ (Domb numbers, case~$(\alpha)$), while the Catalan kernel is a hypergeometric twist of the Gauss-square coefficient sequence at $(a,b,c)=(\tfrac12,1,\tfrac32)$. We place these kernels in a unified $\operatorname{Sym}^2$ framework: the first $\pi$-kernel and the Catalan kernel come directly from Gauss-square coefficient sequences, while the Domb kernel is recovered by recasting the classical degree-$3$ Belyi pullback $\phi(x)=108x^2/(1-4x)^3$ and the associated algebraic twist in CMF language. We write an explicit square-gauge matrix for the Gauss CMF, formulate the standard pullback–twist transport in CMF terms, and show that for rank-$2$ objects it is compatible with $\operatorname{Sym}^2$. We further prove an inverse classification: for a fixed $\operatorname{Sym}^2$-type Riemann scheme, the one-parameter family of Fuchsian operators contains a unique $\operatorname{Sym}^2(\mathrm{Gauss})$ point, cut out by the closed-form condition $\lambda_0=2\gamma_1\gamma_2(1-2\alpha)$ on the accessory parameter. Finally, a Belyi-pullback scan over $5040$ configurations produces $11$ additional integer sequences of the form $[x^n]\lambda^n\,{}_2F_1(a,b;c;\phi(x))^2$; we prove their integrality and place them in the same $\operatorname{Sym}^2$-pullback framework.
Read the full abstract

Differential Geometry

Generic Metrics on $S^{n+1}$ Preclude Linearly Stable Singular Tangent Cones of Area-Minimizing Boundaries

We prove that for a residual (and hence dense) subset $\mathcal{G}$ of Riemannian metrics on $S^{n+1}$ in the $C^{3}$ topology, no area-minimizing integral $n$-current that is a boundary admits a singular tangent cone which is linearly stable in the Euclidean sense. The proof proceeds in three stages. First, we develop a perturbation theorem: given any area-minimizer possessing an isolated singularity whose unique tangent cone $C$ is linearly stable, we construct an explicit $C^{3}$-small metric perturbation that destroys the compatibility conditions required for $C$ to persist as a tangent cone. The construction rests on the Hardt–Simon asymptotic expansion near isolated singularities, the spectral theory of the Jacobi operator on the cross-section of $C$, and a surjectivity argument showing that the map from compactly supported metric variations to forcing terms in the linearised minimal-surface equation on $C$ has dense range. Second, we establish that the set of metrics admitting no area-minimizer with a prescribed cone type as tangent cone is open, using compactness of integral currents and upper-semicontinuity of the density function. Third, we assemble these ingredients via a Baire category argument, intersecting countably many open dense sets to obtain the residual set $\mathcal{G}$. An extension to non-isolated singularities is outlined using Federer–Almgren dimension reduction.
Read the full abstract

Number Theory

Values of algebraic functions at Liouville numbers

In 1953 LeVeque proved the existence of $U_m$-numbers by showing that for some specially defined Liouville number $\lambda$, the $m$th root $\lambda^{1/m}$ is in $U_m$. In this article we study the following question: let $u$ be an algebraic function of degree $m$ and $\lambda$ a Liouville number; under which conditions is $u(\lambda)$ a $U_m$-number? We consider a more refined notion of $\mathcal{L}$-numbers, and show that, under very general assumptions, an algebraic function of degree $m$ takes $U_m$-values at all $\mathcal{L}$-numbers.
Read the full abstract

Algebraic Geometry

Prime Fano threefolds of genus 8 in positive characteristic

We prove that a prime Fano threefold of genus 8 over an algebraically closed field of positive characteristic is isomorphic to a linear section of the Grassmannian variety Gr(2, 6). As applications, it is shown that a prime Fano threefold of genus 8 is irrational and, if the characteristic is larger than two, then it is globally F-regular.
Read the full abstract

Numerical Analysis · Cross-listed from cs.DC

Sensor Placement for Tsunami Early Warning via Large-Scale Bayesian Optimal Experimental Design

Real-time tsunami early warning relies on distributed sensor networks to infer seismic sources and seafloor motion. Optimizing these networks via Bayesian optimal experimental design (OED) is exceptionally challenging for systems governed by hyperbolic partial differential equations, which lack the spectral decay required by standard low-rank approximations. We present a scalable Bayesian OED framework for linear time-invariant systems. By reformulating the inverse problem in the data space, we transform OED into dense matrix subset selection. We propose a multi-GPU, Schur-complement-update-based, greedy algorithm that solves the OED problem using a pipelined approach that fully overlaps I/O with GPU computations. Our framework achieves near-perfect weak and strong scaling across hundreds of GPUs on Perlmutter and Frontier. Applied to the 2025 Gordon Bell Prize-winning digital twin for tsunami forecasting in the Cascadia Subduction Zone, we optimize a 175-sensor network, minimizing the uncertainty of a parameter field with over one billion degrees of freedom.
Read the full abstract

Dynamical Systems

Chain transitivity in generalized hybrid dynamics with application to simulation and stochastic approximation of hybrid systems

Asymptotic properties of discrete, stochastic approximations to hybrid systems, modeled as hybrid inclusions, are studied. First, the internal chain transitivity of omega-limits of solutions is concluded, along with other properties related to chain recurrence and transitivity. A concept of an asymptotic solution is proposed to describe any mapping that, asymptotically, resembles a solution, and for which the chain transitivity properties also turn out to hold. The mentioned developments are carried out in an abstract setting of a generalized hybrid system defined by a set of hybrid curves, each defined on a hybrid time domain, and possibly consisting of all solutions to a given hybrid inclusion. Then, more specific kinds of perturbed solutions to a hybrid inclusion are proposed and shown to include the solutions of a discretization and of a stochastic approximation to the hybrid inclusion. Consequently, appropriate discretizations and stochastic approximations of a hybrid inclusion produce mappings whose omega limits are internally chain transitive for the underlying hybrid inclusion.
Read the full abstract