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)

Monday 18 May

Probability

Faster random walks via infrequent steering

Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs of bounded degree, there is a way to steer the walk so that it visits every vertex in $n^{1+o(1)}$ steps with high probability. The key to this result is a way to decompose arbitrary graphs into small-diameter pieces.
Read the full abstract

Analysis of PDEs

Boundary regularity for general elliptic operators of order $2s$

We establish optimal $C^s$ boundary regularity for the most general class of (linear and translation invariant) nonlocal elliptic operator of order $2s$. Namely, we consider Lévy operators that are symmetric and its Fourier symbol satisfies $\mathcal{A}(\xi)\asymp |\xi|^{2s}$ in $\mathbb{R}^d$. This was only known when the kernel of the operator (or Lévy measure) is either homogeneous or comparable to that of the fractional Laplacian, with different proofs in each case. Our new proofs extend both at the same time, and work in a very general class of domains, under a $C^1$-Dini-type condition.
Read the full abstract

Analysis of PDEs

Nested nodal loops for sums of Laplace eigenfunctions

We study nested loops in zero sets of sums of Laplace eigenfunctions on closed surfaces. In the real-analytic category, answering a question of Logunov, we prove a uniform bound for the number of rooted double nests in terms of the surface, the root, and the spectral cutoff. We show that this analyticity hypothesis is sharp: on a smooth sphere, a linear combination of eigenfunctions with eigenvalues \(0\) and \(2\) can have infinitely many rooted double nests. We also answer a question of Logunov and Nadirashvili by constructing a planar biharmonic function whose nodal set contains a double nest, and we prove a quantitative bound for entire biharmonic functions of polynomial growth. The biharmonic construction gives a nodal-set manifestation of the failure of the Boggio–Hadamard conjecture from the 1900s.
Read the full abstract

Analysis of PDEs

Nested nodal loops of biharmonic functions

Given any \(n\in\mathbb{N}\), we construct a real-valued biharmonic polynomial on \(\mathbb{R}^2\) whose zero set contains a nest of \(n\) smooth, disjoint topological loops, meaning that the \(k\)-th loop lies inside the domain bounded by the \((k+1)\)-st loop for \(k=1,\ldots,n-1\). The case \(n=2\), i.e., the existence of two nested loops, is related to the failure of the Boggio-Hadamard conjecture from the early 1900s.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

From classical Lax ODEs to quantum integrable theories: the moduli

The general idea of this paper is to start from a classical integrable (partial differential) equation which arises as a compatibility condition for a matrix linear differential problem. For definitiveness' sake, a generalised sinh-Gordon equation depending on $2N-1$ complex coefficients or moduli is considered. Then, the connexion coefficients (Wronskians) of different solutions to this problem satisfy, in the spirit of the Ordinary Differential Equation/Integrable Model correspondence, functional relations, which can be considered, – if supplemented by suitable asymptotic behaviours –, as identifying a specific state of a quantum integrable model: in fact they are the eigenvalues of extensions of Baxter operators $Q$ and $T$, the transfer matrix. Moreover, Y-system and (implementing the asymptotic conditions) thermodynamic Bethe Ansatz equations originate from them, without any passage through the scattering theory, and providing an invariant parametrisation of the monodromy space. The crucial novelty is the modification of all the relations because of their dependence on the moduli. For zero momentum, they fully describe physically the quantum homogeneous sine-Gordon model, i.e. scattering amplitudes of gauge fields in $\mathcal{N} = 4$ SYM at strong coupling or their dual null polygonal light-like Wilson loops in $AdS_3$. As a direct consequence of the correspondence, two Zamolodchikov's conjectures, based on previous results, are also proven.
Read the full abstract

Optimization and Control

Can Adaptive Gradient Methods Converge under Heavy-Tailed Noise? A Case Study of AdaGrad

Many tasks in modern machine learning are observed to involve heavy-tailed gradient noise during the optimization process. To manage this realistic and challenging setting, new mechanisms, such as gradient clipping and gradient normalization, have been introduced to ensure the convergence of first-order algorithms. However, adaptive gradient methods, a famous class of modern optimizers that includes popular $\mathtt{Adam}$ and $\mathtt{AdamW}$, often perform well even without any extra operations mentioned above. It is therefore natural to ask whether adaptive gradient methods can converge under heavy-tailed noise without any algorithmic changes. In this work, we take the first step toward answering this question by investigating a special case, $\mathtt{AdaGrad}$, the origin of adaptive gradient methods. We provide the first provable convergence rate for $\mathtt{AdaGrad}$ in non-convex optimization when the tail index $p$ satisfies $4/3<p\leq2$. Notably, this result is achieved without requiring any prior knowledge of $p$ and is hence adaptive to the tail index. In addition, we develop an algorithm-dependent lower bound, suggesting that the existing minimax rate for heavy-tailed optimization is not attainable by $\mathtt{AdaGrad}$. Lastly, we consider $\mathtt{AdaGrad}\text{-}\mathtt{Norm}$, a popular variant of $\mathtt{AdaGrad}$ in theoretical studies, and show an improved rate that holds for any $1<p\leq2$ under an extra mild assumption.
Read the full abstract

Optimization and Control · Cross-listed from cs.AI

Democratizing Large-Scale Re-Optimization with LLM-Guided Model Patches

Optimization models developed by operations research (OR) experts are often deployed as decision-support systems in industrial settings. However, real-world environments are dynamic, with evolving business rules and unforeseen perturbations. In such contexts, end users should ideally re-optimize models to recover feasible and implementable solutions, often without access to the original model developers. This paper introduces an agentic re-optimization framework in which a large language model (LLM) acts as an OR expert, dynamically supporting end users through natural-language interaction. The LLM translates user prompts into structured updates of the underlying optimization model, selects suitable re-optimization techniques from an optimization toolbox, and solves the resulting instance to return implementable solutions. The toolbox leverages primal information, including historical solutions, valid inequalities, solver configurations, and metaheuristics, to accelerate re-optimization while preserving solution quality. The proposed framework enables interactive and continuous adaptation of deployed optimization models, reducing dependence on OR experts, and improving the sustainability of decision-support systems. Extensive experiments on two complementary large-scale real-world case studies demonstrate the effectiveness and scalability of the proposed framework. The first considers online supply chain re-optimization, where solutions must be generated rapidly while remaining close to the deployed plan, whereas the second focuses on offline university exam scheduling, where solution quality is prioritized over runtime. Results show that the toolbox-driven architecture significantly improves computational efficiency through primal-based and solver-aware re-optimization techniques, while the structured patch-based updates improve interpretability and traceability of model modifications.
Read the full abstract

All authors Tinghan Ye, Arnaud Deza, Ved Mohan, El Mehdi Er Raqabi, Pascal Van Hentenryck

Optimization and Control

Implementation-Based Incentive Design for Autonomous Mobility-on-Demand and Transit Systems

Achieving a socially desirable operating point for a multimodal transportation system is challenging when Autonomous Mobility-on-Demand (AMoD) and Public Transit (PT) operators pursue selfish objectives alongside endogenous passenger choices. Existing equilibrium-based regulation models typically search over municipal policies to predict the induced operator equilibrium, creating strong behavioral assumptions, equilibrium-selection issues, and difficult bilevel optimization problems. This paper proposes an implementation-based alternative. Rather than asking which municipal action induces the best equilibrium, we ask: given a target operating profile, what minimum realized transfer makes unilateral deviation unattractive for each operator? Using k-implementation theory, this payment decomposes into two unilateral deviation gains: one for the AMoD operator and one for PT. Calculating this payment requires computing three distinct objects: the social target, the AMoD best response, and the PT best response. This is nontrivial because each represents a large-scale network optimization problem complicated by endogenous mode choice and congestion. To address this, we develop tailored mathematical formulations and algorithms for each oracle. For the social target, we derive a decomposition and entropy-regularized mixed-integer convex formulation balancing social optimality and implementability. For the AMoD oracle, we derive an exact reformulation, a convex relaxation providing a global upper bound, and a sequential convex approximation for feasible lower bounds. For the PT oracle, we develop a mixed-integer convex relaxation and characterize its exactness condition. A NYC case study shows the framework computes tight implementation-payment bounds and reveals how the dominant source of incentive misalignment shifts with congestion.
Read the full abstract

Number Theory

Linear equations in Piatetski-Shapiro primes

We establish discorrelation estimates between the Piatetski-Shapiro prime set \[ \mathcal{P}_{\gamma} := \{p \text{ is prime and } p = \lfloor n^{1/\gamma} \rfloor \text{ for some } n \in \mathbb{N}\} \] and arbitrary nilsequences when $\gamma \in (0,1)$ is sufficiently close to $1$. This extends earlier works which treated linear or polynomial exponential phase functions. As an application, we establish an asymptotic formula for the number of solutions in $\mathcal{P}_{\gamma}$ to any “finite-complexity" system of linear equations, including for the number of $k$-term arithmetic progressions in $\mathcal{P}_{\gamma}$ up to a threshold $N$ for any given $k \geq 3$. Furthermore, we show that there exists an absolute constant $C>0$ such that if \[ 1 - 2^{-Ck} < \gamma < 1, \] then the Piatetski-Shapiro primes $\mathcal{P}_{\gamma}$ contain infinitely many non-trivial $k$-term arithmetic progressions. This significantly improves upon the previous range of $\gamma$ obtained by Li and Pan, which is of triple exponential type.
Read the full abstract

Optimization and Control

Robust Optimization Under Objective Functional Uncertainty

This paper proposes a new robust optimization (RO) formulation namely the RO under objective functional uncertainty (ObRO). The ObRO adopts a min-max structure where the inner problem finds the worst-case objective function in a continuous function space to maximize the cost, and the outer problem finds the optimal decision in a Euclidean space to minimize the cost. A solution algorithm is designed to alternately generate the worst-case objective function at the current decision and the optimal decision for the current collection of objective functions. Using operator theory, we prove that this algorithm converges to the defined “semi-global” saddle point of the ObRO problem. In addition, we propose a numerical solver based on the piece-wise linearization (PWL) approximation of objective functions. The PWL approximate problem is proved to be numerically consistent with the original ObRO problem. The obtained results are applied to the degradation-aware battery charging scheduling in distribution networks.
Read the full abstract

All authors Yue Song, Yuxi Lu, Gang Li, Kairui Feng, Qi Liu

Mathematical Physics

Arbitrary-genus dark soliton gases in the defocusing nonlinear Schrödinger hydrodynamics

The defocusing nonlinear Schrödinger hydrodynamics supports exact dark solitons under finite density boundary conditions. However, the dark soliton gas, an interacting ensemble of dark solitons, has not yet been studied. In this work, we introduce an arbitrary-genus potential of dark soliton gases by considering the limit of the $\mathcal{N}$-dark soliton as $\mathcal{N}\to \infty$. The large-space asymptotics and long-time evolution of this dark soliton gas potential are analytically investigated through Deift-Zhou nonlinear steepest descent approach. The genus-$N$ dark soliton gas potential approaches the genus-$N$ finite-gap solution as $x \to -\infty$ and the background $1$ as $x \to +\infty$. In the long-time evolution, as the self-similar variable $\xi=x/t$ increases, the gas configuration exhibits a cascade of behaviours, passing from unmodulated and modulated genus-$N$ regions and progressively reducing the genus down to the planar region (unmodulated genus-$0$ region). Notably, the evolution of lower-genus soliton gases can be embedded within that of higher-genus gases, exhibiting identical dynamics within specific regimes. This phenomenon is encoded by the underlying spectra. We also include numerical validations, in perfect agreement with the theoretical predictions.
Read the full abstract

All authors Marco Bertola, Deng-Shan Wang, Peng Yan, Dinghao Zhu

Category Theory

Weak and Strong Fibrations of Functors

We develop a homotopical framework for small categories that extends classical invarints of algebraic topology to the categorical setting. Our approach is based on the construction of genuine path category, obtained trough a localization procedure, which allows us to define strong and weak fibrations for functor. We establish their basic properties, introduce a fibrant replacement for functors, and extend homotopical invariants such as the Svarc genus and sectional category to small categories. Finally, we apply this framework to motion planning in small categories, providing categorical analogues of Farber's topological complexity while removing finiteness constraints typical of existing approaches.
Read the full abstract

Geometric Topology

Non-injectivity of the trace map for character varieties

Given a closed oriented surface $\Sigma$ of genus at least two, the Goldman trace map defines a function from the vector space generated by the free homotopy classes of oriented closed curves to the Poisson algebra of regular functions on the $G$-character variety where $G$ is a reductive (real or complex) linear Lie group. In this article, we prove that this map is never injective. For each $n$, we construct an explicit nonzero element of the vector space whose associated trace function vanishes on every homomorphism from $\pi_1(\Sigma)$ to $GL_n$. The construction is based on the Amitsur-Levitzki identity, together with a choice of words in a free subgroup of $\pi_1(\Sigma)$, ensuring that no cancellation occurs at the level of free homotopy classes. This gives a uniform family of explicit kernel elements, proving Goldman's predicted non-injectivity of the trace map in arbitrary rank.
Read the full abstract

Number Theory

Covering systems where the prime divisors of all moduli are only $2$, $3$, or $5$

We try to find all quadruples of positive integers $(m,a,b,c)$ with $a \geq b \geq c$ such that there exists a distinct covering system with minimum modulus $m$ and least common multiple of the moduli $2^a 3^b 5^c$. We obtain complete description of all such quadruples when $m=2,3,4,5$, or $6$, except when $m=6$ and $b=c=1$. We also show that if the LCM of the moduli has only $2$, $3$, or $5$ as prime divisors, then $m \leq 9$ and construct a distinct covering system with $m=8$, $a=8$, $b=3$, and $c=2$. When a covering system exists for a quadruple $(m,a,b,c)$ we provide an example. Nonexistence of covering systems is established via integer programming or by using a new estimate on the density of a set covered by a system of congruences.
Read the full abstract

All authors Joshua Harrington, Jonah Klein, Joshua Lowrance, Ognian Trifonov

Mathematical Physics · Cross-listed from quant-ph

Open quantum dynamics without Complete Positivity: a criticism

The requirement of complete positivity is very often regarded as a fundamental consistency condition for the description of open quantum dynamics. We critically examine this requirement and discuss both its physical motivations and its limitations. We analyze proposals based on restricting the domain of non-completely positive maps to subsets of compatible initial states. Using isotropic states as a concrete example, we show that such domain restrictions become increasingly severe with growing system dimension, revealing an intrinsic weakness of the compatibility-based approach.
Read the full abstract

Combinatorics

Harmonious Colorings: bounds, heuristics and integer-linear formulations

A proper coloring $c$ of a simple graph $G$ is harmonious if, for every pair of distinct edges $uv,xy\in E(G)$, we have that $\{c(u),c(v)\}\neq \{c(x),c(y)\}$. The harmonious chromatic number of $G$, denoted by $h(G)$, is the least positive integer $k$ such that $G$ has a harmonious coloring with $k$ colors. In this work, we extend an idea presented in [Kolay, et al. Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comp. Sci. 772 (2019), 132-142] to compare the harmonious chromatic numbers of two graphs $G$ and $H$, with $H$ being obtained from $G$ by identifying vertices at distance at least three. Furthermore, by fixing a proof presented in the same work, we manage to improve one of its upper bounds. We also introduce and study the first, to the best of our knowledge, integer-linear programming formulations for this problem in the literature, along with some heuristics. We provide some preliminary tests on random instances and instances from the second DIMACS Implementation Challenge.
Read the full abstract

All authors Júlio Araújo, Manoel Campêlo, Beatriz Martins, Marcio C. Santos

Optimization and Control

Singleton Optimality in Standard Quadratic Programs with the GOE

We study the standard quadratic optimization problem over the simplex when the objective matrix is drawn from the Gaussian Orthogonal Ensemble (GOE). Let \(\kappa_n\) denote the support size of the almost surely unique global optimizer. We prove \[ \Prob(\kappa_n>1)\sim 2\sqrt{2\pi}\,\frac{\sqrt{\log n}}{n}. \] The proof combines an exact two-coordinate condition for edge improvement with a product formula obtained by conditioning on the diagonal order statistics. Boundary-layer estimates identify the leading contribution and show that supports of size at least three are negligible. Consequently, the minimum-diagonal vertex is globally optimal with probability tending to one, with an explicit first-order correction.
Read the full abstract

Symplectic Geometry

Derived sheaves in locally conformally symplectic geometry

In this paper, we use derived sheaves to study rigidity phenomena in the cotangent bundles of manifolds endowed with some locally conformally symplectic ($\frak{lcs}$) structure. Taking inspiration from the work of Guillermou, Kashiwara and Shapira, we define a quantization for “$\frak{lcs}$” Hamiltonian isotopies, as well as new quantities: the asymptotic Betti numbers of a sheaf. We then show that those quantities are “well behaved” with respect of said quantization and use this to give a sheaf-theoretical proof of the Chantraine-Murphy theorem. We also consider the quantization in light of the Tamarkin morphism and the displacement energy of sheaves. This allows us to derive a non-squeezing theorem for $\frak{lcs}$ geometry that is similar, although not identical, to the one recently proven by Bertelson, Chakravarthy, and Sandon. Indeed, the result shown in this paper is more in line with the contact non-squeezing theorem shown by Eliashberg, Kim and Polterovich in 2006.
Read the full abstract

Optimization and Control

Efficient Gradient Methods for Distributed Saddle Problems

The distributed setting for Saddle Problems (SPs) has recently emerged as a framework for various modern applications in machine learning and multiagent systems. Despite its relevance, the theoretical foundations of this setting have not yet been thoroughly established. In this paper, we advance this research direction by formalizing the distributed setup for SPs and providing rigorous definitions of communication and computational costs. Our main result is a novel decoupled method that achieves optimal communication cost within the zero-respecting framework. Our method is based on a multi-stage reduction to the decoupled minimization of residual norms, which yields strict improvements over the best known communication cost for the class and the long-standing oracle cost of the Extragradient method. Further, we show by a matching lower bound that our method is communication-optimal within the family of gradient-span algorithms. Finally, we study the extension of distributed SP into Variational Inequality Problem (VIP), which generalizes two-player zero-sum games to multiplayer general-sum games. We show that our decoupled method achieves a new state-of-the-art communication complexity for this broader class.
Read the full abstract

Analysis of PDEs

On nematic electrolytes

We study a system of nonlinear partial differential equations modeling the electrokinetics of a nematic electrolyte material consisting of various ion species suspended in a nematic liquid crystal within a bounded domain in two or three dimensions. The system couples a Nernst-Planck model for ion concentrations with the Poisson equation for the electrostatic potential, a Navier-Stokes equation for the fluid solvent, and the Ericksen-Leslie equations with general Leslie stress for nematic liquid crystals. We consider the case of isotropic elasticity for the liquid crystal and impose a unit-length constraint on the director field. The no-flux condition for the electrochemical potential leads to a nonlinear (and nonlocal) boundary condition for the ion concentrations. Using the theory of maximal regularity, we prove existence and uniqueness of strong solutions, provide criteria for global existence, and characterize the set of equilibria.
Read the full abstract

Information Theory

The Sharma-Mittal Entropy is Subadditive and Supermodular on the Majorization Lattice

We prove that Sharma-Mittal entropy is a subadditive and supermodular function on the lattice of all $n$-dimensional probability distributions, ordered according to the partial order relation defined by majorization among vectors. Our result unifies and extends analogous results presented in the literature for the Shannon entropy, the Tsallis entropy, and the Rényi entropy.
Read the full abstract

Functional Analysis · Cross-listed from cs.LG

Pointwise Generalization in Deep Neural Networks

We address the fundamental question of why deep neural networks generalize by establishing a pointwise generalization theory for fully connected networks. This framework resolves long-standing barriers to characterizing the rich nonlinear feature-learning regime and builds a new statistical foundation for representation learning. For each trained model, we characterize the hypothesis via a pointwise Riemannian Dimension, derived from the eigenvalues of the learned feature representations across layers. This establishes a principled framework for deriving hypothesis-dependent, representation-aware generalization bounds. These bounds offer a systematic upgrade over approaches based on model size, products of norms, and infinite-width linearizations, yielding guarantees that are orders of magnitude tighter in both theory and experiment. Analytically, we identify the structural properties and mathematical principles that explain the tractability of deep networks. Empirically, the pointwise Riemannian Dimension exhibits substantial feature compression, decreases with increased over-parameterization, and captures the implicit bias of optimizers. Taken together, our results indicate that deep networks are mathematically tractable in practical regimes and that their generalization is sharply explained by pointwise, feature-spectrum-aware complexity.
Read the full abstract

Complex Variables

On starlikeness of $p$-valent analytic functions

The known Ozaki's condition says that $\mathfrak{Re}\left\{f^{(p)}(z)\right\}>0$ for $|z|<1$ implies that $f(z)=z^p+a_{p+1}z^{p+1}+\cdots$ is at most $p$-valent in $\mathbb D$. In this paper prove an extension of Ozaki's condition. Also, we shall determine the new sufficient conditions for functions to be in the class of $p$-valent starlike of order $\alpha$.
Read the full abstract

Analysis of PDEs

Constructive solutions of the heat equation with Stieltjes derivatives

In this work, we investigate the one-dimensional heat equation within the framework of Stieltjes calculus. We first consider the equation associated with two fixed derivators and develop a constructive approach to establish the existence of solutions. We then study the corresponding initial value problem and incorporate several types of boundary conditions. Finally, we introduce a notion of multivariable derivator, suitable for higher-dimensional settings, and obtain explicit solutions of the heat equation for relevant classes of such derivators.
Read the full abstract

Analysis of PDEs

Generalizations of the Dirichlet problem for bianalytic functions

We prove the Dirichlet problem for second-order iterated Vekua equations, a natural generalization of the Bitsadze equation, is well-posed when the boundary condition is defined as a product of an exponential function and a polynomial on a non-degenerate conic that is not a circumference. Also, we extend this result, as well as other related results for the Dirichlet problem for polyanalytic and generalized analytic functions from the literature, to their analogues for bicomplex differential equations.
Read the full abstract

Quantum Algebra

The Ring of Differential Operators on a Nodal Curve is not a Bialgebroid

In a previous article, we showed that local projectivity is a sufficient condition for the existence of a bialgebroid structure on the ring of differential operators on an affine variety. In this note, we show using elementary methods that the ring of differential operators on a nodal curve is neither locally projective nor does it admit a bialgebroid structure.
Read the full abstract

Geometric Topology

Spectra of normalized volumes of right-angled hyperbolic polyhedra

We consider three-dimensional hyperbolic polyhedra of finite volume with finitely many vertices. The normalized volume of a polyhedron is the ratio of its volume to the number of vertices. Given some set of hyperbolic polyhedra, we can associate with it the set of normalized volumes of the polyhedra belonging to it. We call this set the spectrum of normalized volumes of the set under consideration. We focus on right-angled hyperbolic polyhedra. For the subset of ideal polyhedra, we find bounds for the spectrum of normalized volumes and prove that they are sharp. Moreover, we show that the spectrum splits into discrete and dense parts. For the subset of compact polyhedra, we obtain estimates for the spectrum of normalized volumes, prove that the upper bound is sharp, and also establish numerical intervals on which the spectrum is discrete and dense. The endpoints of the indicated numerical intervals are expressed in terms of the volume of the regular ideal hyperbolic tetrahedron and the volume of the regular ideal hyperbolic octahedron.
Read the full abstract

Number Theory

Three Brillhart-Lehmer-Selfridge primality proofs for Wagstaff numbers

The Wagstaff numbers $W_p = (2^p + 1)/3$ for odd primes $p$ are the natural $+1$ companions of the Mersenne numbers. Known primality proofs for $W_p$ with $p \geq 2617$ rely on the elliptic-curve primality proving algorithm of Atkin-Morain; Chebyshev/Lucas-type tests, while available as compositeness criteria, remain conjectural on the sufficiency side. We present fully verified primality proofs of $W_{2617}$ (788 digits), $W_{10501}$ (3161 digits), and $W_{12391}$ (3730 digits), independent of ECPP and relying only on classical $N-1$ machinery. The proofs apply the Brillhart-Lehmer-Selfridge (BLS) $N-1$ criterion to the cyclotomic decomposition $2^{p-1} - 1 = \prod_{d \mid p-1} \Phi_d(2)$, harvesting factored content from the Cunningham project tables (used as evidence) and FactorDB (used only as a discovery aid, with every retrieved factor re-certified). As an independent check on the $\mathbb{Z}[\sqrt{2}]$ arithmetic implementation, the Chua $N+1$ congruence $\omega_3^{(W_p + 1)/2} \equiv -1 \pmod{W_p}$ – the $a=3$ case of the Chua framework with $\omega_3 = 3 + 2\sqrt{2}$, a necessary condition for Wagstaff primality – is verified at each $W_p$. BLS $N-1$ requires $p-1$ sufficiently smooth that enough cyclotomic factors $\Phi_d(2)$ are fully factored. On the factorisation data consulted (Cunningham project tables and FactorDB, January-April 2026), $p = 10501$ and $p = 12391$ are the only exponents above $2617$ in the known Wagstaff prime/probable-prime list meeting this ceiling. Every cofactor primality is certified unconditionally by APR-CL; the method is independent of the Chebyshev sufficiency conjecture, and every step is reproducible from the archived scripts.
Read the full abstract

Numerical Analysis · Cross-listed from physics.plasm-ph

An explicit, energy-conserving particle-in-cell scheme for relativistic plasmas

We extend the recently-developed explicit, energy-conserving particle-in-cell (PIC) scheme of [1] to the relativistic Vlasov-Maxwell system. As in the non-relativistic case, the method is built on an optimization problem that is analytically solvable, local to each particle, and designed to enforce exact energy conservation. Although the solution to this optimization problem is not guaranteed to be real, we show that such instances are rare enough for practical simulation parameters to permit dramatic improvements in energy conservation over traditional explicit PIC schemes. We show that, as in the non-relativistic case, the scheme is compatible with popular field-solvers for electromagnetic PIC schemes, including the Yee/FDTD and pseudo-spectral analytic time-domain (PSATD) methods. The scheme is verified on standard relativistic test problems, where its conservation properties are confirmed.
Read the full abstract

Combinatorics

Integral Planes and Unit-Norm Polytopes

We introduce and study integral planes associated with crystallographic and non-crystallographic integral systems in real composition algebras. For an integral order $\Order$ in such an algebra we define the plane $\Order^{2}$ with quadratic form $Q(x,y)=\NN(x)+\NN(y)$, the axis shell, the balanced shell, and the corresponding unit-normalised spherical polytopes. For ten crystallographic orders we recover, in one uniform construction, the orthogonal-direct-sum root systems $2A_{1}$, $A_{2}\oplus A_{2}$, $4A_{1}$, $D_{4}\oplus D_{4}$, $16A_{1}$, and $E_{8}\oplus E_{8}$ (with classical-polytope realisations including the square, the 16-cell, the 24-cell, and the Gosset polytope $4_{21}$); for two non-crystallographic orders we obtain $H_{2}\oplus H_{2}$ (decagonal tegum) and $H_{4}\oplus H_{4}$ (600-cell tegum) over $\Z[\golden]$. We prove a rank-obstruction theorem that closes, unconditionally and by a purely Coxeter-theoretic argument, the existence question for an indecomposable rank-eight golden octonion order: no such order can exist. On the balanced shell side, we identify the genuine algebraic Hopf map $\Hopfmap_{A}(a,b)=(2a\bar b,\NN(a)-\NN(b))$ and prove that its restriction to the balanced shell is a finite principal fibration of the unit loop, valid both for the associative case and for the alternative Moufang case.
Read the full abstract