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)

Sunday 17 May

General Mathematics

Riccati–Gamma Dynamics for Concavity and Asymptotics of Generalized Dirichlet Eta Functions

We develop a unified analytical and dynamical framework for the qualitative study of the one-parameter family of generalized Dirichlet eta functions $\eta_{a}(t)=\sum_{m\ge0}(-1)^{m}(am+1)^{-t}$, $a>0$, $t>0$, which includes the classical Dirichlet eta and beta functions. Using a Mellin–Laplace representation of $\eta_{a}$ as $\mathbb{E}[f_{a}(X_{t})]$, where $f_{a}$ is a scaled logistic function and $(X_{t})$ a standard Gamma process, we show that the logarithmic derivative $\varphi_{a}(t)=\eta_{a}'(t)/\eta_{a}(t)$ satisfies a non-homogeneous Riccati equation with strictly negative forcing. This single inequality yields strict concavity and strict log-concavity of $\eta_{a}$, positivity and monotonicity of $\varphi_{a}$, and the precise asymptotic law $\varphi_{a}(t)=\log(a+1)(a+1)^{-t}+O((a+2)^{-t})$. We further prove that $\varphi_{a}(t)/\varphi_{a,e}(t)\to 2/\log(a+1)$ as $t\to\infty$, where $\varphi_{a,e}(t)=-\eta_{a}''(t)/(2\eta_{a}(t))$, obtaining in particular the trapping inequality $0<\varphi_{a,e}(t)<\varphi_{a}(t)$ for all sufficiently large $t$ when $a<e^{2}-1$. We also present a self-contained geometric-rate algorithm (rate $1/3$) for computing $\eta_{a}^{(k)}(t)$ together with a sharp error bound. High-precision numerical experiments confirm all results. As an application, we show that the Riccati–Gamma dynamics of $\eta_{a}$ and $\varphi_{a}$ provide a principled mechanism for musical synthesis, generating a complete melody whose pitch and rhythm are governed by these functions.
Read the full abstract

Optimization and Control · Cross-listed from cs.CC

Information Redistribution Under Reductions in NP Search

Using reductions from structured P-matrix violation search to classical NP-complete formulations such as 3-SAT and Subset Sum, we examine the relationship between representational expansion, auxiliary variables, local inferability, and information accessibility. Rather than viewing reductions purely as computational transformations, we interpret them as mechanisms that redistribute hidden witness information across enlarged representations. From this perspective, reductions, gadgets, and auxiliary structures may expose globally encoded witness information to local propagation and inference, while search algorithms act as decoding procedures attempting to recover the original hidden witness. The resulting observations suggest that representational expansion may improve local inferability by introducing auxiliary variables and consistency structures, while preserving the need to recover the underlying witness information. This work is exploratory in nature and proposes a conceptual framework for understanding how reductions reshape information accessibility in NP search.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Quantum Viterbi Algorithm

We introduce a quantum Viterbi decoding algorithm for hidden quantum Markov models (HQMMs) motivated by quantum information processing and quantum algorithms. Given a finite sequence of measurement outcomes, the algorithm identifies hidden quantum trajectories that maximize a joint decoding functional, serving as a genuine quantum analogue of the classical Viterbi score. Unlike classical hidden Markov models, where decoding optimizes over a finite discrete state space, our method performs optimization over a continuous manifold of pure quantum effects, thereby exploiting coherent superpositions in the hidden memory. We prove a strict quantum advantage: coherent hidden trajectories can achieve decoding scores that strictly exceed any classical strategy constrained to diagonal (commuting) effects, even when both models share the same observed statistics. These results position quantum Viterbi decoding as a concrete quantum algorithmic primitive for sequential decision-making, with direct applications to quantum memories, quantum communication with memory, and near-term quantum machine learning on NISQ devices.
Read the full abstract

All authors Luigi Accardi, Abdessatar Souissi, El Gheteb Soueidi, Farrukh Mukhamedov, Mohamed Rhaima

Algebraic Topology

Adams filtrations and secondary coherence for fibers of Steenrod operations

Motivated by the Bruner–Rognes two-extension theorem and open questions regarding the secondary cohomology modeling of fibers of Steenrod operations, we develop a general framework to compute their Adams filtrations and delineate the underlying algebraic obstructions. Let $f:Y\to\prod\Sigma^{d_\lambda}H\mathbb F_2$ be a locally finite family of positive-degree stable operations, where $Y=H\mathbb F_2$ or $H\mathbb Z$. We determine the Adams filtration of its fiber from the minimal generators of $\operatorname{im}(f^*)$ as a left Steenrod module. An explicit target automorphism separates a minimal subfamily, and combining this with the two-extension theorem and an acyclic cancellation gives $E_3=E_\infty$. A terminating Adem recursion realizes this splitting for the full positive even-square family. Separately, we identify two fundamental algebraic obstructions to directly constructing the secondary cohomology of these fibers: an augmentation discrepancy when the primary row has a nonzero kernel, and a coherence obstruction class in the third cohomology of a Hom complex. These results demonstrate why the secondary Ext groups of these fibers must be derived topologically via the Baues–Jibladze comparison theorem, rather than through a direct algebraic resolution.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Stability and Discretization Error of State Space Model Neural Operators

Neural operators have emerged as a powerful, discretization-invariant framework for solving partial differential equations (PDEs). Although established approaches like the Deep Operator Network (DeepONet) have successfully achieved universal approximation for operators, and architectures such as Fourier Neural Operators (FNOs) have shown algebraic convergence rates, a precise theoretical connection between the continuous theory and its discrete numerical implementation remains a challenge. Specifically, the relationship between the continuous formulation and the discrete numerical stability has yet to be fully explored. In this paper, we address this gap by establishing theoretical guarantees for the discretization error and stability of neural operator approximation schemes. We prove analytical bounds that link solution regularity to input discretization, providing a formal quantification of neural operator accuracy under real-world numerical constraints. We derive these bounds to the specific cases of State Space Model-based Neural Operators (SS-NOs) and FNOs, thus providing a new discretization error theorem for these models. Additionally, through an input-to-state stability (ISS) analysis, we formally assess the impact of discretization on the stability of SS-NOs results obtained in the continuous domain. Our empirical experiments on 1D and 2D benchmarks validate our theoretical bounds and show the robustness of SS-NOs under varying resolutions.
Read the full abstract

All authors Abderrahim Bendahi, Adrien Fradin, Johan Peralez, Julie Digne, Madiha Nadri

Information Theory

Variational Diffusion Channel Decoder

Neural channel decoder, as a data-driven channel decoding strategy, has shown very promising improvement on error-correcting capability over the classical methods. However, the success of those deep learning-based decoder comes at the cost of drastically increased model storage and computational complexity, hindering their practical adoptions in real-world time-sensitive resource-sensitive communication and storage systems. To address this challenge, we propose an efficient variational diffusion model-based channel decoder, which effectively integrates the domain-specific belief propagation process to the modern diffusion model. By reaping the low-cost benefits of belief propagation and strong learning capability of diffusion model, our proposed neural decoder simultaneously achieves very low cost and high error-correcting performance. Experimental results show that, compared with the state-of-the-art neural channel decoders, our model provides a feasible solution for practical deployment via achieving the best decoding performance with significantly reduced computational cost and model size.
Read the full abstract

Complex Variables

Boundary Behavior of Bisectional Curvatures for Weighted Bergman Metrics

This paper investigates the asymptotic boundary behavior of the holomorphic bisectional curvature for weighted Bergman metrics. By characterizing extremal functions via $L^2$-orthogonal projections, we establish an explicit formula for the weighted bisectional curvature. Utilizing the squeezing function, we then obtain quantitative upper and lower bounds for the curvature on bounded pseudoconvex domains. Furthermore, we prove that at strongly pseudoconvex boundary points, the bisectional curvature asymptotically coincides with that of the unit ball. As an application, these results provide a streamlined and unified proof for the known asymptotic behavior of the bisectional curvature of the Kähler-Einstein metric.
Read the full abstract

Number Theory

Multiplicative independence in the sequence of $k$-generalized Pell numbers

We study multiplicative dependence between terms of the \(k\)-generalized Pell sequence \((P_n^{(k)})_{n\ge 2-k}\), defined by the linear recurrence \[ P_n^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\cdots+P_{n-k}^{(k)}, \] with initial conditions \(P_0^{(k)}=\cdots=P_{-(k-2)}^{(k)}=0\) and \(P_1^{(k)}=1\). We prove that for every \(k\ge 2\) and all integers \(n>m\ge 2\), the equation \[ \bigl(P_n^{(k)}\bigr)^x=\bigl(P_m^{(k)}\bigr)^y \] has no solution in positive integers \(x,y\) with \(x<y<n\). The proof combines lower bounds for linear forms in logarithms, the Baker-Davenport reduction method, the LLL algorithm, and a finite computational verification.
Read the full abstract

All authors Cherif B. Deme, Kancou D. Fall, Khady Faye, Bernadette Faye

Quantum Algebra

Coupled double Poisson brackets

We introduce coupled double Poisson brackets on an associative algebra $A$ as pairs consisting of a generalized Van den Bergh's double Poisson bracket and a generalized Fairon–McCulloch's right double Poisson bracket subject to a cross-Jacobi identity. Each of Van den Bergh's double brackets, Fairon–McCulloch's right double brackets, and also Ginzburg–Schedler's wheeled Poisson brackets induces a $\operatorname{GL}_N$-invariant Poisson structure on the representation scheme $\operatorname{Rep}_N(A)$ parametrizing $N$-dimensional representations of $A$, thereby satisfying the Kontsevich–Rosenberg principle. Wheeled Poisson brackets seem to be the most general such structures, and while their relation to Van den Bergh's double Poisson brackets is known, their relation to Fairon–McCulloch's right double Poisson brackets has remained open. We fill this gap and establish a bijection between pairs of coupled double Poisson brackets and wheeled Poisson brackets of Ginzburg and Schedler. On free polynomial algebras, we furthermore establish a one-to-one correspondence between linear coupled double Poisson brackets and a new algebraic structure that we call Poisson-left-pre-Lie algebras, and describe quadratic ones via solutions of the associative and classical Yang–Baxter equations satisfying a compatibility condition.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting

We show that the training problem of a deep linear neural network under the squared loss admits an exact convex reformulation in a lifted space over a generalized completely positive cone. The reformulation has the same optimal value as the original nonconvex problem and is linear in the lifted variables, with all nonconvexity encoded in the cone constraint. Its ambient lifted dimension depends only on the input and output dimensions, independent of the network depth and the number of data points, and the bottleneck width enters only through scalar constraints. The construction proceeds by reducing the multilayer parameterization to a bilinear factorization, lifting it to a rank-constrained semidefinite program, expressing the rank constraint via a complementarity condition, and applying a completely positive lifting. The resulting formulation gives a conic representation of the nonconvexity induced by linear factorization and connects linear neural network training with copositive programming.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Do Stationarity Transformations Actually Improve Time Series Forecasts? A Controlled Experimental Evaluation

Stationarity transformations, such as differencing, are a common preprocessing step in forecasting, motivated by the idea that modifying a series to achieve stationarity improves accuracy. Whether this is true, and for which processes, has rarely been evaluated in controlled experiments. We study the decision to transform as the object of inquiry. We cross eighteen synthetic data-generating processes, most of them stochastic-trend processes spanning exact and near unit roots, fractional integration, seasonal unit roots, structural breaks, and heteroscedasticity, with ten transformations, five models, and three horizons, replicated by Monte Carlo, for 35,099 evaluations. Each forecast is inverted to the original scale, with the differencing inverse anchored at the forecast origin, and scored by the mean absolute scaled error. Signal-preserving transforms, namely deterministic detrending and seasonal differencing matched to series structure, improve accuracy, whereas indiscriminate differencing degrades it. A mediation analysis shows that differencing achieves trend stationarity, but trend stationarity is only weakly associated with accuracy, and transforms differ in their effects on predictable structure. Choosing the transformation by out-of-sample validation yields lower regret than unit-root pretesting or any fixed rule, with blanket differencing performing the worst. The findings are confirmed by real-world validation on nine series from two domains.
Read the full abstract

Functional Analysis

Blaschke operations on log-concave functions and affine isoperimetric inequalities

We introduce Blaschke addition and homothety operations on log-concave functions and study their affine-geometric consequences. Our starting point is the first variation formula of Falah and Rotem (Calc. Var. and PDE, 2026), which associates to each log-concave function a pair of surface area measures. Using the additivity of these measures, we define a canonical Blaschke sum and Blaschke homothety on the class of log-concave functions, uniquely determined up to translation. We establish the basic algebraic properties of these operations, define the associated Blaschke symmetral, and show that this symmetrization preserves both total mass and the first quermassintegral. We also prove that successive Blaschke symmetrizations converge, after translations, to a radially symmetric log-concave function, which we call the mean Blaschke symmetral. We then relate the canonical theory to projection-type constructions. In particular, we show that the functional projection body arising from the first variation coincides with the projection body of the asymmetric LYZ body, and we derive corresponding intertwining properties. As applications, we prove concavity of the entropy with respect to the canonical Blaschke sum and obtain associated Kneser–Süss-type inequalities. We also study a functional version of affine surface area, and prove affine isoperimetric inequalities for log-concave functions. In particular, we obtain a Blaschke-concavity property for the affine surface area and show that it is maximized, under fixed first quermassintegral, by radially symmetric functions.
Read the full abstract

Classical Analysis and ODEs

On singular integrals with non-negative kernels in the Heisenberg group

In this paper we revisit nonnegative kernels in the first Heisenberg group $\He$, and in particular we further study the family $$K_\alpha(x,y,z)= \frac{|z|^{\alpha/2}}{\|(x,y,z)\|_{H}^{\alpha+1}}, \quad \alpha>0,$$ which was introduced in \cite{CL}. We first show that if $E \subset \He$ is a $1$-Ahlfors regular set and the SIO associated with the kernel $K_4$ is $L^2(E)$-bounded, then $E$ is contained in a $1$-Ahlfors regular curve. Combined with the converse implication which was obtained by Fässler and Orponen in \cite{FO1dim}, our result provides a characterization of uniform $1$-rectifiability in the Heisenberg group via the $L^2$-boundedness of a singular integral. We also give a negative answer to a question of Fässler and Orponen from \cite{FO1dim} by showing that for any $\alpha \in (0,2)$ there exists a $1$-Ahlfors regular curve $E_a$ such that the operators associated with the kernels $K_\alpha$ are not bounded in $L^2(E_\alpha)$. We finally show that there exists a $1$-Ahlfors regular and purely $1$-unrectifiable set $E$ such that the singular integral associated with $|x| \|(x,y,z)\|^{-2}$ is $L^2(E)$ -bounded.
Read the full abstract

Probability

Rank Based Routing in Large Server Systems under Extreme Congestion

We study $n$ parallel queues in an extreme heavy-traffic regime: each server works at rate $n$, while jobs arrive to a dispatcher at rate $n^2-(a-b)\sqrt{n}$, with fixed $a>b>0$. Arrivals are routed by a marginal join-the-shortest-queue policy: a small stream of rate $b\sqrt{n}$ joins the current shortest queue, while the remaining stream of rate $n^2-a\sqrt{n}$ is routed uniformly at random. This policy greatly reduces communication cost relative to full JSQ, while improving load balancing and offering a natural mechanism for premium jobs to join shorter queues. Under diffusive scaling, we prove limit theorems for the ranked queue lengths and associated gap process. The limit is an infinite-dimensional reflected Atlas process, with reflection at the origin and rank-based drift acting on the lowest particle. Its dynamics depend only on $b$, the shortest-queue arrival rate, while $a$ enters through the choice of invariant distribution. We prove well-posedness of this reflected infinite Atlas model and characterize a one-parameter family of product-form stationary gap distributions, parametrized by $a$ and $b$. To connect the diffusion limit with the stationary behavior of the queueing system, we introduce a related "system with pauses” that agrees with the original dynamics at diffusion scale but admits an exact open Jackson network representation. This yields explicit finite-$n$ stationary gap distributions, whose heavy-traffic limits select the corresponding product-form invariant laws of the infinite reflected Atlas process. As consequences, we obtain sharp asymptotics for the lowest-ranked queues, system imbalance, and average queue length, quantifying the tradeoff between communication cost and load-balancing performance relative to random routing and full join-the-shortest-queue policies.
Read the full abstract

Number Theory

On the finite transcendence of Frobenius traces for abelian varieties over $\mathbb{Q}$

The first purpose of this paper is to give the fnite transcendence of Frobenius traces for elliptic curves over $\mathbb{Q}$ without the assumption of complex multiplication (CM). This result generalizes the previous work by Luca and Zudilin, who obtained similar transcendence results specifically for the CM case. The second purpose is to give the finite transcendence of Frobenius traces for several principally polarized abelian varieties over $\mathbb{Q}$, by using Luca–Zudilin's method.
Read the full abstract

Algebraic Geometry

$\mathbb T$-homogeneous locally nilpotent derivations of trinomial algebras

A trinomial algebra is a commutative finitely generated algebra given by a system of compatible relations each of which is a polynomial with three terms. Such algebras arise as the Cox rings of varieties admitting a complexity one torus action. We describe locally nilpotent derivations of a trinomial algebra that are homogeneous under a natural torus action of complexity one.
Read the full abstract

Numerical Analysis

On a blended Anderson / NGMRES acceleration for the Navier-Stokes Picard iteration: convergence analysis and adaptive depth selection

Anderson acceleration (AA) and nonlinear GMRES (NGMRES) have been successfully applied to improve the efficiency and robustness of many nonlinear solvers, with each being shown to have certain advantages over the other. There are two differences between the AA and NGMRES algorithms: the extrapolations are different, and AA uses fixed point residuals in the optimization problem while NGMRES uses true nonlinear residuals. Motivated by recent AA and NGMRES analyses and numerical testing, we consider a blend of AA and NGMRES that uses the AA extrapolation and the true nonlinear residuals for the optimization problem. To focus our study, we consider the blended method applied to the Picard iteration for the Navier-Stokes equations, but many of the ideas developed herein are extendable to a wide variety of nonlinear systems and solvers. We provide a convergence analysis and proof of acceleration of the blended method, provide a detailed numerical comparison of AA, NMGRES and the blended method for several benchmark tests, and develop an effective adaptive depth strategy.
Read the full abstract

Classical Analysis and ODEs

A Banach space that distinguishes two maximal operators

Maz'ya and Shaposhnikova introduced a non-classical maximal operator $M^\diamond$ as the maximal convolution with the vector-valued signum kernel truncated to centered balls. We construct a translation-invariant Banach space of locally integrable functions on which $M^\diamond$ is bounded, but the sharp maximal operator $M^\sharp$ is not. This answers one of Maz'ya's questions from a collection of 75 open problems in analysis.
Read the full abstract

Optimization and Control

Training Infinitely Deep and Wide Transformers

Transformers have become the dominant architecture in modern machine learning, yet the theoretical understanding of their training dynamics remains limited. This paper develops a rigorous mathematical framework for analyzing gradient-based training of transformers in the mean-field regime, where both the depth (number of layers) and width (number of attention heads) tend to infinity. While ResNet training can be understood as controlling a neural ODE, transformer training corresponds to controlling a neural PDE, due to the coupling of multiple token distributions through the attention mechanism. Our mean-field model features two types of measure representations: token distributions evolving through layers and attention parameters at each layer. We establish well-posedness of the forward pass through infinitely deep transformers, characterizing token evolution via flow maps that satisfy ODEs in function spaces. Using adjoint sensitivity analysis, we derive an explicit formula for the conditional Wasserstein gradient of the training risk, involving adjoint variables governed by backward ODEs. We prove the existence and uniqueness of gradient flow curves in the conditional Wasserstein metric space, establishing a rigorous foundation for gradient-based transformer training. A key technical contribution is providing necessary and sufficient conditions for injectivity of the Neural Tangent Kernel (NTK) for attention mechanisms: we show that NTK injectivity is equivalent to linear independence of log-sum-exp functions modulo affine functions, a condition satisfied by diverse token distributions, including discrete distributions, uniform distributions, and Gaussian mixtures. Under this NTK injectivity assumption, we prove that gradient flow converges to global minima when the initial loss is sufficiently small, eliminating spurious local minima from the optimization landscape.
Read the full abstract

All authors Raphaël Barboni, Maarten V. de Hoop, Takashi Furuya, Gabriel Peyré

Number Theory

Algebraic Spectral Curves of Two-Channel Operator Pencils with Power-Law Response

A finite matrix can acquire a nontrivial algebraic spectral curve when its entries contain a multivalued response. We study this mechanism for a two-channel pencil with scalar response $z^\beta$ and $J$-self-adjoint matrices. If $\beta=r/n$ is in lowest terms and the coefficients are generic, the normalized determinant curve in $(z,\lambda)$ has genus $n-1$ and is a double cover. It is rational for $n=1$, elliptic for $n=2$, and hyperelliptic for $n\geq3$. The generic genus depends only on the denominator $n$. The proof reduces birationally to a classical hyperelliptic normal form. The numerator appears as the cyclic character of the distinguished coupling and controls its divisor and boundary singularity. Here $\lambda$ is a complexified coupling coordinate: the curve is the joint determinant locus, not a fixed-coupling spectrum. For irrational exponents the local monodromy has infinite order, while rational approximants converge uniformly on compact sets and preserve isolated zeros on a fixed branch. Negative exponents in $(-1,0)$ arise from causal Volterra kernels and cutoff continuum-bath Schur complements, separating finite channels from nonlocal memory. As an application, the exact leading infrared monomial model of a zero-temperature conformal response of dimension $h_{\rm probe}$ has, for rational $2h_{\rm probe}$, genus $\operatorname{den}(2h_{\rm probe})-1$. For the fundamental fermion in the even-$q>2$ Sachdev–Ye–Kitaev saddle, this becomes $q/2-1$. The core statements, including determinant algebra, branch counts, and causal-response identities, are machine-checked from raw matrix definitions.
Read the full abstract

Information Theory

DL-Driven Optimization for ISAC System Equipped With Pinching and Movable Antennas

Integrated sensing and communication (ISAC) is considered one of the key technologies for future wireless networks, due to its ability to provide accurate environment awareness and improve energy, spectral and hardware efficiency. Moreover, the introduction of recently developed pinching antennas (PAs) and movable antennas (MAs) has the potential to further improve the performance gains of ISAC. Therefore, our goal is to study the optimization of the sum-rate for an ISAC system equipped with PAs and MAs, capable of satisfying minimal sensing requirements. To achieve it, we derive a closed-form solution for the optimal sensing receive combiner, and show that it is determined by other optimization variables. For these other variables (i.e., the positions of the transmit PAs, the positions of the users' MAs, the communication precoding matrices, and the sensing transmit beamformer), we propose a deep learning (DL) network that finds their optimal values. To train the network in an unsupervised manner, we formulate a loss function consisting of the objective function, as well as the penalty terms related to the constraints for the PAs and MAs positions. Simulation results show that using PAs and MAs in ISAC systems provides a larger sum-rate compared to ISAC systems with only fixed antennas, and that this performance advantage is increased with the maximum transmit power. Furthermore, we demonstrate that the communication performance of the considered system is a bit more affected by the sensing signal-to-interference-plus-noise ratio (SINR) threshold compared to the sensing performance.
Read the full abstract

Optimization and Control · Cross-listed from quant-ph

A Penalty-Free Pipeline for Direct Quantum-Annealer Portfolio Optimization

Cardinality-constrained portfolio selection is routinely cast as a quadratic unconstrained binary optimization (QUBO) and submitted to a quantum processing unit (QPU) for direct annealing. We show that this standard penalty encoding is the binding constraint for direct-QPU execution on current D-Wave Pegasus and Zephyr hardware. Expanding the exact cardinality penalty contributes a dense rank-one term that makes the logical interaction graph complete regardless of the covariance, producing chain-break fractions from 83% at small universes up to 92% at the full forty-nine-industry Fama–French universe, and zero feasible raw samples at every tested scale. Topology-aware sparsification reduces chain breaks to near zero, but any sparsifier that removes off-diagonal entries also dilutes the cardinality constraint; an ablation reveals that this sparsify-and-project pipeline is dominated by the classical projector, not the QPU. We propose removing the penalty entirely: sample an objective-only QUBO built from expected returns and the risk-scaled covariance on hardware, and enforce cardinality classically through a deterministic feasibility projector. Across 4,468 saved embedding records on live Pegasus and Zephyr hardware, spanning equities up to forty-nine assets and football-betting instances up to forty-eight, this penalty-free pipeline reduces mean chain-break fractions from 71%–92% down to at most 0.04%, and post-processed regret is at most 0.03% relative to greedy classical references at every tested scale. We do not claim quantum advantage; the penalty encoding, not the sparse hardware topology, is the limiting factor for direct-QPU portfolio optimization at currently accessible scales.
Read the full abstract

Optimization and Control · Cross-listed from quant-ph

Where the Quantum Lives in D-Wave Hybrid Portfolio Optimization: An Operational Decomposition Audit

Hybrid quantum-classical solvers conceal how reported performance divides between quantum-processing-unit (QPU) access and other service time. We audit D-Wave's Leap service on cardinality-constrained mean-variance portfolio instances from N=10 to 640, comparing constraint-native CQMs, penalty-encoded BQMs, Gurobi MIQP, simulated annealing, and a matched-budget Tabu baseline, and we propose a four-metric operational audit of the exposed timing fields. LeapHybridCQM matches Gurobi's proven optimum on all 54 head-to-head instances at N<=120, yet its mean QPU access is 0.034 s: 0.68% of the nominal five-second budget; telemetry does not resolve the residual into classical computation, orchestration, or budget granularity. Across 108 fixed-seed five-second CPU runs on 36 instances, TabuSampler reaches CQM-level objectives with mean absolute delta 0.00078 (maximum 0.00798); at N in {400,640} the mean is 3.04e-5. This establishes classical objective achievability, not an internal QPU ablation. We prove that quadratic encoding of exact cardinality adds a dense rank-one term and, apart from isolated exact coefficient cancellations, yields a complete logical graph independent of covariance support, with a bounded-degree embedding lower bound; the resulting density collapse is consistent with hybrid-BQM degradation. A descriptive five-window Fama-French overlay of post-projection direct-QPU portfolios yields mean Sharpe 1.94 versus 2.22 for 1/N. These results do not establish a quantum-sampling advantage; they motivate reporting QPU wall-clock fraction, optimality gap, density amplification, service-output variance, and matched-budget classical controls, keeping operational accounting separate from causal attribution.
Read the full abstract

Number Theory · Cross-listed from cond-mat.stat-mech

Iterative map with power-law scaling of Gamma-distributed fluctuations related to prime numbers

Prime numbers arise in several contexts beyond number theory, including statistical mechanics, quantum mechanics, and dynamical systems. However, the mechanisms underlying the irregularities of their sequence and their connections to physical systems remain poorly understood. The present work provides further insight into the search for deterministic fingerprints in the prime sequence. To this end, prime gaps at different separation distances are investigated through an empirical analysis. Based on this analysis, a modified local approximation of the Prime Number Theorem is introduced and analyzed empirically, in which the logarithmic gap estimate is evaluated at a midpoint-corrected argument. From this relation an iterative map is obtained that reproduces the classical asymptotic prime spacing at leading order and satisfies an approximate semigroup property. The residual fluctuations are found to follow Gamma distributions rescaled by the correction terms, with a variance exhibiting an approximate power-law scaling in the prime separation distance.
Read the full abstract

Optimization and Control

Inexact Adjoint Gradients and Directional Tolerances for Full-Potential Airfoil Optimization

This paper develops a framework connecting discrete adjoint gradient-error analysis with an optimization method that uses directional error tolerances, and applies it to airfoil shape optimization governed by a conservative full-potential flow solver on body-fitted structured meshes. The theoretical part derives the reduced discrete adjoint formula for scalar objectives constrained by a state equation and analyzes how inexact state and adjoint residuals propagate into the reduced gradient. For residuals that are affine in the state variable, the gradient error is bounded by a linear combination of the state and adjoint residual tolerances. On compact sets of decision variables, a uniform version of this bound is obtained, leading to a directional tolerance condition under which the inexact gradient satisfies an exact descent inequality. The resulting inexact general directions method inherits convergence properties under uniformly bounded, diminishing, and Armijo-type step-size rules. The computational part combines a parabolic initial grid generator, an elliptic mesh smoother, and a full-potential discretization with artificial-density stabilization and approximate-factorization iteration. The optimization problem is formulated as a pressure-matching problem in which a class-shape-transformation airfoil parametrization is adjusted so that the computed surface pressure coefficient approaches prescribed reference data, subject to mesh-generation and full-potential residual constraints.
Read the full abstract

Commutative Algebra

Elasticity of Orders from the $S$-relative Davenport Constant: an Arithmetic Application of a Number-Theoretic Investigation

Orders in algebraic number fields have long been objects of central interest in algebraic number theory. Despite non-maximal orders failing to be Dedekind, the present authors have previously shown that the structure of the ideal class group may still contain enough information to determine elasticity. In this paper, we develop the $S$-relative Davenport constant, which builds on previous work by M. Skałba. Although Skałba's original construction was defined to aid in the study of binary quadratic forms, we show that this related invariant is the exact tool needed to tackle the question of elasticity in non-integrally closed orders. In particular, we investigate the elasticity of orders $\mathcal{O}$ whose conductor ideal $I=(\mathcal{O}:\mathcal{O}_K)$ is prime as an ideal of $\mathcal{O}$, as well as orders in quadratic number fields with primary conductor. We also give conditions under which $\mathcal{O}$ will have the same elasticity as the full ring of integers $\mathcal{O}_K$.
Read the full abstract

Combinatorics

MUBs from bent functions

This note contains a simple construction of complete sets of MUBs, using bent functions to write the new basis vectors as explicit linear combinations of the standard basis.

Functional Analysis

Ordered POVMs and Residual Collapse

Ordered realizations of discrete POVMs are studied through a residual transform generated by sequential tests. One application of the transform replaces each coordinate by the effect obtained after all earlier tests have failed, and appends the remaining mass as a terminal outcome. Under natural hypotheses, iterating the transform produces a collapsed POVM whose non-escape coordinates are the parts of the original effects that survive all earlier tests. The resulting collapse map gives an equivalence relation on ordered POVM realizations. Its range and fibers are characterized. The range consists of collapsed POVMs, whose non-escape coordinates are mutually orthogonal and whose support projections strongly sum to the identity. The fiber over a collapsed POVM consists of all ordered realizations with the same residually visible compressions. In particular, different ordered realizations, including ones with different off-diagonal coupling data, can have the same collapsed image. After collapse, the non-escape coordinates are fixed under further residual iteration. The remaining dynamics takes place in the escape effect, which is fragmented by a universal scalar functional calculus.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Form and Function: Machine Unlearning as a Problem of Misaligned States

We formulate machine unlearning for online L-BFGS as a counterfactual state-alignment problem. Given an actual event stream and a deletion-edited counterfactual stream, the target of unlearning is the optimizer state that would have arisen had the deleted samples never been processed. We introduce state-aware metrics that separately measure parameter error, memory-operator error, combined state error, and update-direction error. The memory metric compares the inverse-Hessian actions induced by the o-L-BFGS memory, rather than treating curvature pairs as of finite influence. Under convexity assumptions, we derive a recursive bound on counterfactual state deviation. We then evaluate a state-aware benchmark of deletion interventions, including memory-only and parameter-only corrections, against an counterfactual oracle model. These results show that unlearning for online L-BFGS is not merely a parameter-correction problem: it requires alignment with a realizable counterfactual optimizer state.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Semi-classical Imprint of Horizon Induced Instability

We consider an inverted harmonic oscillator in the space $L^{2} (\mathbb{S})$ of square-integrable functions on the circle $\mathbb{S}$ and compute its density of states employing the stationary phase approximation. Our computation is based on an oscillatory integral representation of the Schwartz kernel of the time-evolution operator. This demonstrates thermalisation as a semi-classical manifestation of the classical Lyapunov instability – reported earlier in [Phys. Rev. D 102, 044006; Phys. Rev. D 102, 124047] using heuristic analytic continuation. Our spectral analysis of the Hamiltonian points out and closes the conceptual and mathematical gaps in the preceding literature.
Read the full abstract