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)

Monday 6 April

Group Theory

On arc-transitive inner-automorphic Cayley graphs on dihedral groups

A Cayley graph $\Cay(G,S)$ is said to be inner-automorphic if $S$ is a union of conjugacy classes of a group $G$, and arc-transitive if its full automorphism group acts transitively on the set of arcs. In this paper, we characterize four well-known families of arc-transitive graphs that arise as connected inner-automorphic Cayley graphs on dihedral groups, and we provide a necessary condition for other connected arc-transitive Cayley graphs on dihedral groups to be inner-automorphic. We further construct an infinite family of examples satisfying this condition, thereby demonstrating the existence of such graphs. Finally, we complete the classification of all 2-distance-transitive connected inner-automorphic Cayley graphs on dihedral groups.
Read the full abstract

Statistics Theory

Attributed Network Alignment: Statistical Limits and Efficient Algorithm

This paper studies the problem of recovering a hidden vertex correspondence between two correlated graphs when both edge weights and node features are observed. While most existing work on graph alignment relies primarily on edge information, many real-world applications provide informative node features in addition to graph topology. To capture this setting, we introduce the featured correlated Gaussian Wigner model, where two graphs are coupled through an unknown vertex permutation, and the node features are correlated under the same permutation. We characterize the optimal information-theoretic thresholds for exact recovery and partial recovery of the latent mapping. On the algorithmic side, we propose QPAlign, an algorithm based on a quadratic programming relaxation, and demonstrate its strong empirical performance on both synthetic and real datasets. Moreover, we also derive theoretical guarantees for the proposed procedure, supporting its reliability and providing convergence guarantees.
Read the full abstract

Symplectic Geometry

Geometry of the tt*-Toda equations I: universal centralizer and symplectic groupoids

We investigate the geometry of a certain space of meromorphic connections with irregular singularities, and prove in particular that it is a (real) symplectic Lie groupoid. The connections have a physical meaning: they correspond to certain solutions of the topological-antitopological fusion (tt*) equations of Cecotti and Vafa, and hence to deformations of supersymmetric quantum field theories. The groupoid structure arises because we restrict ourselves to the tt* equations of Toda type, whose monodromy data has a Lie theoretic description. To obtain these results, we show first that the universal centralizer of a Lie group is a holomorphic symplectic groupoid over the Steinberg cross section.
Read the full abstract

Algebraic Geometry

Perverse Extensions and Limiting Mixed Hodge Structures for Conifold Degenerations

Let $pi:X\to\Delta$ be a one-parameter degeneration whose central fiber $X_0$ has a single ordinary double point. The nearby- and vanishing-cycle formalism determines a canonical perverse sheaf on $X_0$, obtained from the variation morphism and fitting into an extension of the intersection complex by a point-supported rank-one contribution. We study this object from the perspective of limiting mixed Hodge theory and Saito's theory of mixed Hodge modules. In the ordinary double point case, we show that the corrected perverse object is the unique minimal Verdier self-dual perverse extension of the shifted constant sheaf across the node, and that its rank-one singular contribution and the corresponding rank-one vanishing contribution in the limiting mixed Hodge structure arise from the same nearby-cycle formalism. We also formulate the analogous structural statements for multi-node degenerations and for more general stratified singular loci. Finally, we explain how Saito's divisor-gluing formalism provides the natural framework for a fuller mixed-Hodge-module refinement of these constructions.
Read the full abstract

Numerical Analysis

On the Optimality of Reduced-Order Models for Band Structure Computations: A Kolmogorov $n$-Width Perspective

In this paper, we exploit the concept of Kolmogorov $n$-widths to establish optimality benchmarks for reduced-order methods used in phononic, acoustic, and photonic band structure calculations. The Bloch-transformed operators are entire holomorphic functions of the wave vector~$\kk$, and by Kato's analytic perturbation theory the eigenpairs inherit this holomorphy wherever the spectral gap is positive. The Kolmogorov $n$-width of the solution manifold therefore decays exponentially, at a rate controlled by the minimum spectral gap between the band of interest and its neighbors. For clusters of bands, we show that working with spectral projectors rather than individual eigenvectors renders all internal crossings – avoided, symmetry-enforced, or conical – irrelevant: only the gap separating the cluster from the remaining spectrum matters. These results provide a sharp lower bound on the error of any linear reduction method, against which existing approaches can be measured. Numerical experiments on one- and two-dimensional problems confirm the predicted exponential decay and demonstrate that a greedy algorithm achieves near-optimal convergence. It also provides a principled justification for the choice of basis vectors in highly successful reduced-order models like RBME.
Read the full abstract

Algebraic Geometry

On the Tame Isotropy Group of Locally Finite Derivations of K[X,Y]

Let K be an algebraically closed field of characteristic zero. We study the tame isotropy group Tame_D(K[X,Y]) of locally finite derivations of the polynomial ring K[X,Y], using Van den Essen's classification up to conjugation. For each normal form, we explicitly determine the corresponding tame isotropy group. We then compare Tame_D(K[X,Y]) with the tame isotropy group of the associated exponential automorphism exp(D), and prove that these groups always coincide. This stands in contrast to the behaviour of the full automorphism group, where such an equality may fail for derivations with a nontrivial semisimple part.
Read the full abstract

Differential Geometry

Calibrating Forms for Minimal Graphs in Arbitrary Codimension

We introduce a new family of closed differential forms naturally associated with minimal graphical submanifolds in Euclidean space, defined in arbitrary codimension. For each minimal graph, we construct an explicit closed form whose restriction coincides with the induced volume form. These forms admit a geometric interpretation as pullbacks, via the Gauss map, of tautological differential forms on the Grassmannian. In contrast to most known calibrations, they are generally not parallel and do not arise from special holonomy or symmetry considerations. The calibration problem is thus reduced to estimating the pointwise comass of the constructed forms. We show that the comass bound can be characterized in terms of explicit inequalities involving the singular values of the defining map of the graph, formulated via its two-dilations and we identify precise conditions ensuring that the comass is at most one. As a consequence, any minimal graph satisfying these conditions is calibrated and hence area-minimizing. This yields a broad class of new calibrated minimal graphs, extending the classical codimension-one theory, and provides an effective criterion for determining precisely where a given minimal graph is area-minimizing. As an application of our construction, we confirm a conjecture of Lawson and Osserman under two-dilation conditions, in arbitrary codimesnion.
Read the full abstract

Optimization and Control

MPC and System Identification with Differentiable Physics: Fluid System and Particle Beam Control

We consider the problem of simultaneous control and parameter estimation when the model is available only as a differentiable physics simulator. We propose a receding-horizon control framework in which a model predictive control (MPC) objective is optimized using gradients obtained by differentiating through the simulator, while physical parameters are updated online using measurement data. Unlike classical MPC, which relies on explicit algebraic models, our approach treats the dynamics as a computational object and performs simulation-based optimization using automatic differentiation. A shared differentiable model enables joint, real-time optimization of control inputs and physical parameters. We present two preliminary examples to demonstrate the proposed framework on two challenging applications: a fluid flow problem and a particle accelerator.
Read the full abstract

Combinatorics

Stingray Patterns of Dominant Weights

We study the set $W_{r,e,w}\ $ of dominant weights of $\mathfrak{sl}_r$ arising from partitions of fixed $e$-weight $w$. For $e$-cores, we show that $W_{r,e,0}\ $ decomposes as a disjoint union of simplices indexed by compositions of $r$. For general $w$, we prove that $W_{r,e,w}\ $ is a disjoint union of copies of these simplices, with multiplicities determined by the corresponding quotient data, yielding in particular a closed counting formula for $|W_{r,e,w}\ |\ $. The geometry gives rise to the stingray patterns appearing in the title. More generally, it yields a natural labeling of the dominant $e$-alcoves meeting $W_{r,e,w}\ $ by weak compositions of $w$, together with a compatible partial action of the affine Weyl group via wall crossing. Finally, we give an explicit alcove-geometric proof of the empty runner removal theorem for Iwahori-Hecke algebras.
Read the full abstract

Differential Geometry

Minimising Willmore Energy via Neural Flow

The neural Willmore flow of a closed oriented $2$-surface in $\mathbb{R}^3$ is introduced as a natural evolution process to minimise the Willmore energy, which is the squared $L^2$-norm of mean curvature. Neural architectures are used to model maps from topological $2d$ domains to $3d$ Euclidean space, where the learning process minimises a PINN-style loss for the Willmore energy as a functional on the embedding. Training reproduces the expected round sphere for genus $0$ surfaces, and the Clifford torus for genus $1$ surfaces, respectively. Furthermore, the experiment in the genus $2$ case provides a novel approach to search for minimal Willmore surfaces in this open problem.
Read the full abstract

Sunday 5 April

General Mathematics

Path Averaged Polynomial Contractions: A New Generalization of Polynomial Contractions, Path-Averaged Contractions, and Banach Contractions

The notion of polynomial contraction appeared in [2], whilst the notion of path-averaged contraction appeared in [3] for metric spaces, in [4,5] for b-metric spaces, , and in [6] for suprametric spaces. In this paper, we combine both notions to introduce path-averaged polynomial contractions, as a generaliation of polynomial contractions, path-averaged contractions, and Banach contractions.We obtain a fixed point theorem for such contractions in the setting of metric spaces.We give an example showing path-averaged polynomial contractions are not Banach contractions
Read the full abstract

Information Theory · Cross-listed from cs.LG

StateSMix: Online Lossless Compression via Mamba State Space Models and Sparse N-gram Context Mixing

We present StateSMix, a fully self-contained lossless compressor that couples an online-trained Mamba-style State Space Model (SSM) with sparse n-gram context mixing and arithmetic coding. The model is initialised from scratch and trained token-by-token on the file being compressed, requiring no pre-trained weights, no GPU, and no external dependencies. The SSM (DM=32, NL=2, approximately 120K active parameters per file) provides a continuously-updated probability estimate over BPE tokens, while nine sparse n-gram hash tables (bigram through 32-gram, 16M slots each) add exact local and long-range pattern memorisation via a softmax-invariant logit-bias mechanism that updates only non-zero-count tokens. An entropy-adaptive scaling mechanism modulates the n-gram contribution based on the SSM's predictive confidence, preventing over-correction when the neural model is already well-calibrated. On the standard enwik8 benchmark, StateSMix achieves 2.123 bpb on 1 MB, 2.149 bpb on 3 MB, and 2.162 bpb on 10 MB, beating xz -9e (LZMA2) by 8.7%, 5.4%, and 0.7% respectively. Ablation experiments establish the SSM as the dominant compression engine: it alone accounts for a 46.6% size reduction over a frequency-count baseline and beats xz without any n-gram component, while n-gram tables provide a complementary 4.1% gain through exact context memorisation. OpenMP parallelisation of the training loop yields 1.9x speedup on 4 cores. The system is implemented in pure C with AVX2 SIMD and processes approximately 2,000 tokens per second on commodity x86-64 hardware.
Read the full abstract

General Mathematics

On the Structure of Asymptotic Space of the Lobachevsky Plane

The notion of asymptotic space for an unbounded metric space has been introduced by Micha Gromov in 1980s. It is intended to capture the structure of a metric space at infinity. The most comprehensive definition of asymptotic space is given in the lahguage of Nonstandard Analysis (NSA). It turns out that the asymptotic space depends on the underlying nonstandard extension of the standard universe. This paper contains the exhaustive description of asymptotic spaces of the Lobachevski plane which turns ourt to be an R-tree. However, there turn out to be a plenty of different nonisometric asymptotic spaces, including the spaces of high cardinality.
Read the full abstract

Number Theory

The Thue-Morse Transform

We define the Thue-Morse transform T on a class of infinite binary words. It sends the alternating word a_0 = 010101... to the Thue-Morse sequence. We then study its orbit a_m = T^m(a_0) as well as the sequences u_m and v_m giving respectively the positions of the ones and the zeros in a_m. We obtain an explicit formula for a_m and deduce Prouhet-Tarry-Escott identities for the partitions induced by u_m and v_m. We also give composition formulas for u_m and v_m, and a full description of the factor complexity of a_m.
Read the full abstract

Number Theory

The Domb Ap'ery-limit and a proof of the Ramanujan Machine conjecture Z2

We prove that the ratio $B_n/D_n$ of the Apéry-like sequence $B_n$ to the Domb numbers $D_n$ converges to $(7/24)\zeta(3)$, and that $\sum_{n=1}^{\infty} 64^n/(n^3 D_n D_{n-1}) = (56/3)\zeta(3)$. As a corollary we establish the value $Z_2 = 12/(7\zeta(3))$ conjectured by the Ramanujan Machine project. The proof uses level-6 eta products, Atkin–Lehner involutions, and Eichler integrals of weight-4 modular forms.
Read the full abstract

Number Theory

Order drop, Hecke descent, and a mod $p^4$ supercongruence for symmetric-cube hypergeometric coefficients

We prove that the symmetric-cube coefficients $A_n=(-27)^n[z^n]\,_2F_1(1/3,1/3;1;z)^3$ satisfy the supercongruence $A(mp)\equiv A(m) \bmod p^4$ for every prime $p\geq 5$ and every $m\geq 1$. The proof rests on three ingredients: (i) the modular identification $F(t(\tau))=\eta(\tau)^9/\eta(3\tau)^3$ with $t(\tau)=\eta(3\tau)^{12}/\eta(\tau)^{12}$, whose logarithmic derivative is the weight-5 Eisenstein series $C(q)=3E_5(\chi_0,\chi_3)$ on $\Gamma_0(3)$; (ii) exact congruences $c_{mp^r}\equiv c_{mp^{r-1}} \bmod p^{4r}$ for the coefficients of $C$, combined with a Lagrange-Burmann extraction; and (iii) a Hecke descent on weakly holomorphic forms, where the defect is expanded in the two-dimensional space of weight-5 forms on $\Gamma_0(3)$ with character $\chi_3$, spanned by $C$ and $tC$, via a cusp-adapted basis, with the second cusp handled by the Fricke involution $W_3$. As an independent result, we show that the Mao-Tian cubic recurrence drops from order 3 to order 2 at the specialization $(1/3,1/3,1)$.
Read the full abstract

2604.06238 · 5 Apr · 25 pages. v2: substantially revised proof. The earlier three-layer truncation argument is replaced by a cusp-adapted expansion in the weight-5 modular forms space on $\Gamma_0(3)$ with character $\chi_3$, giving $F_r \equiv 0 \bmod p^4$ for all $r\geq 1$ uniformly. The order drop from 3 to 2 is now stated as an independent result and is not used in the proof of Theorem A

Optimization and Control · Cross-listed from cs.LG

Cactus: Accelerating Auto-Regressive Decoding with Constrained Acceptance Speculative Sampling

Speculative sampling (SpS) has been successful in accelerating the decoding throughput of auto-regressive large language models by leveraging smaller draft models. SpS strictly enforces the generated distribution to match that of the verifier LLM. This is unnecessarily restrictive as slight variations of the verifier's distribution, such as sampling with top-$k$ or temperature, would also be acceptable. Typical acceptance sampling (TAS) alleviates this issue by accepting more tokens using entropy-based heuristics. However, this approach distorts the verifier distribution, potentially degrading output quality when the verifier encodes critical information. In this work, we formalize the speculative sampling algorithm through the lens of constrained optimization. Based on this formulation, we propose Cactus (constrained acceptance speculative sampling), a method that guarantees controlled divergence from the verifier distribution and increasing acceptance rates. Empirical results across a wide range of benchmarks confirm the effectiveness of our approach.
Read the full abstract

Combinatorics

The matching book embedding of the $F$-sum of two graphs

The $F$-sum is a new graph operation defined by combining four graph transformation operations with the Cartesian product operation. A matching book embedding of a graph $G$ is a book embedding in which the vertices of $G$ are placed on a fixed linear order along the spine, and the edges are assigned to pages such that (i) no two edges on the same page cross, and (ii) each vertex has degree at most one on every page. The minimum number of pages required for such a matching book embedding is called the matching book thickness of $G$, denoted by $mbt(G)$. A graph $G $ is dispersable if and only if $ mbt(G) = \Delta(G) $, and nearly dispersable if and only if $mbt(G) = \Delta(G) + 1 $. In this paper, we determine the dispersability of outerplanar graphs and establish an upper bound on the matching book thickness of the $F$-sum of any simple graph with any dispersable bipartite graph.
Read the full abstract

Numerical Analysis

A Numerical PDEs Approach to Evolution Equations in Shape Analysis Based on Regularized Morphoelasticity

This work studies a variational formulation and numerical solution of a regularized morphoelasticity problem of shape evolution. The foundation of our analysis is based on the governing equations of linear elasticity, extended to account for volumetric growth. In the morphoelastic framework, the total deformation is decomposed into an elastic component and a growth component, represented by a growth tensor $G$. While the forward one-step problem – computing displacement given a growth tensor – is well-established, a more challenging and relevant question in biological modeling is the inverse problem in a continuous sense. While this problem is fundamentally ill-posed without additional constraints, we will explore parametrized growth models inscribed within an optimal control problem inspired by the Large Deformation Diffeomorphic Metric Mapping (LDDMM) framework. By treating the growth process as a path within a shape space, we can define a physically meaningful metric and seek the most plausible, energy-efficient trajectory between configurations. In the construction, a high-order regularization term is introduced. This elevates the governing equations to a high-order elliptic system, ensuring the existence of a smooth solution. This dissertation focuses on the issue of solving this equation efficiently, as this is a key requirement for the feasibility of the overall approach. This will be achieved with the help of finite element solvers, notably from the FEniCSx library in Python. Also, we implement a Mixed Finite Element Method, which decomposes the problem into a system of coupled second-order equations as a treatment of these high-order systems that have significant computational challenges.
Read the full abstract

Functional Analysis

A Combinatorial Formula for Recursive Operator Sequences and Applications

We study sequences of bounded operators \((T_n)_{n \ge 0}\) on a complex separable Hilbert space \(\mathcal{H}\) that satisfy a linear recurrence relation of the form $$ T_{n+r} = A_0 T_n + A_1 T_{n+1} + \cdots + A_{r-1} T_{n+r-1} \quad(\textrm{for all } n\ge 0), $$ where the coefficients \(A_0, A_1, \dots, A_{r-1}\) are pairwise commuting bounded operators on \(\mathcal{H}\). \ Such relations naturally arise in the context of the operator-valued moment problem, particularly in the study of flat extensions of block Hankel operators. \ Our first goal is to derive an explicit combinatorial formula for \(T_n\). As a concrete application, we provide an explicit expression for the powers of an operator-valued companion matrix. \ In the special case of scalar coefficients $A_k=a_kI_\mathcal{H}$, with $a_k\in\mathbb{R}$, we recover a Binet-type formula that allows the explicit computation of the powers and the exponential of algebraic operators in terms of Bell polynomials.
Read the full abstract

All authors Raul E. Curto, Abderrazzak Ech-charyfy, Kaissar Idrissi, El Hassan Zerouali

Algebraic Geometry

Ogus-Vologodsky equivalence via stacks

Using the relative de Rham stack for a family $X \to S$ in characteristic $p,$ we reprove the (local and global) Ogus-Vologodsky equivalence. Moreover, we observe that a lift of $S$ is not necessary. Instead, we use a lift of $X$ to the second Witt vectors of $S.$ The main ingredient is that, for a quasi-syntomic family $X/S,$ the relative de Rham stack admits a structure of a torsor over $X'$ which is the analogue of the Azumaya property of the algebra of differential operators. This can be applied to families of (reasonable) algebraic stacks, which gives rise to a logarithmic version of the Cartier equivalence. Along the way, we also obtain a decompleted version of the global Cartier equivalence.
Read the full abstract

Information Theory

Out-of-Air Computation: Enabling Structured Function Extraction from Wireless Superposition

Over-the-air computation (AirComp) broadly exploits the superposition property of wireless multiple-access channels (MACs) to compute functions of distributed data. Within this broad class, dominant conventional designs are embedding-oriented: they pre-shape transmitted signals or mitigate channel effects so that the received superposition directly realizes the prescribed computation, often requiring the MAC to approximate an ideal computational medium. This paper introduces out-of-air computation (AirCPU) and establishes an extraction-oriented paradigm for AirComp. Built on joint source-channel coding, AirCPU creates a structured wireless superposition from which the receiver extracts the target function. AirCPU operates directly on continuous-valued device data, avoiding the need for a separate source quantization stage, and employs a multi-layer nested lattice architecture that enables progressive resolution by decomposing each input into hierarchically scaled components, all transmitted over a common bounded digital constellation under a fixed power constraint. We formalize the notion of decoupled resolution, showing that in operating regimes where the decoding error probability is sufficiently small, the impact of channel noise and finite constellation constraints on distortion becomes negligible, and the resulting computation error is primarily determined by the target resolution set by the finest lattice. For fading MACs, we further introduce collective and successive computation mechanisms, in addition to the proposed direct computation, which exploit multiple decoded integer-coefficient functions and side-information functions as structural representations of the wireless superposition to significantly expand the reliable operating regime.
Read the full abstract

Information Theory

Robust MMSE Precoding for Out-of-Cluster Interference Mitigation in Cell-Free MIMO Networks

In this work, we develop a linear robust minimum mean-square error (RMMSE) precoder to mitigate the effects of imperfect channel state information (CSI) and the intra-cluster (ICL) and out-of-cluster (OCL) interference in cell-free (CF) multiple-antenna systems. The proposed precoder includes statistical information of the OCL interference in its derivation, allowing a more effective interference mitigation. An analysis of the sum-rate that can be obtained by the CF system is carried out and an expression quantifying the theoretical gains of mitigating OCL interference are derived. Simulation results corroborate that the proposed RMMSE precoder effectively mitigates ICL and OCL interference.
Read the full abstract

Optimization and Control

Partial health status observability and time horizon uncertainty in mean-field game epidemiological models

We introduce Mean-Field Game (MFG) epidemiological models, in which immunity either wanes with time in a fully observable way or disappears instantaneously with no direct observation (making a previously recovered individual fully susceptible again without realizing it). Both interpretations create computational challenges for rational noninfected individuals deciding on their contact rates based on their personal current immunity state and the changing epidemiological situation. Both require solving a forward-backward MFG system that includes PDEs (an advection-reaction equation for the immunity-structured population and a Hamilton-Jacobi-Bellman equation for the corresponding value function). We show how this can be done efficiently by solving a two-point boundary value problem for a system of approximating ODEs. We also show how the same approach can be extended to handle an initial uncertainty in the planning horizon.
Read the full abstract

Optimization and Control

Analytic Non-Gaussian Confidence Boundary Method for Chance-Constrained Trajectory Control

Standard chance constrained control algorithms typically rely on the assumption that uncertainties in vehicle states obey Gaussian statistics. Highly nonlinear systems tend to disrupt Gaussianity, challenging standard chance-constrained control methods. This paper develops a non-Gaussian confidence boundary parameterization technique for such cases where the problem departs appreciably from the Gaussian assumption. The approach is to consider the true confidence boundary as a perturbation of the one predicted from covariance, deriving perturbed boundary geometry from computed higher-order statistical moments. Applying this technique to so-called "banana-shaped distributions" (found e.g. in orbital mechanics problems) enables a simple parameterization of the confidence boundary using the skew and kurtosis tensors. The method is then applied to an impulsive stochastic spacecraft maneuver targeting problem in two-body dynamics. An algorithmic implementation outperforms a standard linear covariance-based approach in computing control parameters satisfying certain probabilistic bounds on the non-Gaussian distribution.
Read the full abstract

Optimization and Control

On the Regularity of Generalized Conjugate Functions

We investigate regularity properties of generalized conjugate functions induced by a general coupling function and the associated generalized proximal mapping. Our main results provide verifiable conditions ensuring local single-valuedness, continuity, Lipschitz continuity, and differentiability of the generalized proximal mapping, and transfer these properties to generalized conjugates providing explicit derivative formulas. These results are based on a nonsmooth implicit function theorem for generalized equations, relying on graphical localizations and second-order variational tools. Beyond first-order regularity, we also derive conditions under which generalized conjugates are strictly twice differentiable.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Efficient estimation of relative risk, odds ratio and their logarithms for rare events

This paper proposes sequential estimators for the relative risk, odds ratio, log relative risk or log odds ratio of a dichotomous attribute in two populations. The estimators take the same number of observations from each population, and ensure that the relative mean-square error for the relative risk or odds ratio, or the mean-square error for their logarithmic versions, is less than a given target, regardless of the value of the estimated parameter. The estimation efficiency, computed with respect to the Cramér-Rao bound, is high when the considered attribute is rare or moderately rare.
Read the full abstract

Information Theory

Would Learning Help? Adaptive CRC-QC-LDPC Selection for Integrity in 5G-NR V2X

Vehicle-to-everything (V2X) communications impose stringent physical-layer integrity requirements, particularly under short-packet transmission and mobility-induced channel variation. This paper studies whether standard-compliant online selection of Cyclic Redundancy Check (CRC) polynomials and Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) coding rates can reduce silent (undetected) errors in 5G New Radio (5G-NR) V2X links. The joint configuration problem is formulated as a lightweight Contextual Bandit (CB) with a small, discrete action space, and a discounted LinUCB policy is evaluated against greedy online adaptation and a conservative fixed baseline. A 5G-NR-compliant physical-layer simulation is developed using Sionna, modeling mobility through time-correlated Rayleigh fading, where vehicle speed governs channel correlation, and non-stationary interference via a two-state Markov process. The learning agent operates on coarse receiver feedback, including a noisy Signal-to-Noise Ratio (SNR) estimate and indicators of burst interference and deep fades, and targets minimization of the Undetected Error Probability ((P{UE})) while accounting for the Detected Error Probability ((P{DE})). Overall, our objective is to delineate the mobility regimes in which learning-assisted CRC-QC-LDPC configuration improves physical-layer integrity in 5G-NR V2X systems. Our results indicate that learning-assisted adaptation is most effective at low to moderate mobility, reducing (P_UE) by up to 50-70% relative to greedy selection in the low-SNR regime ((-5) to 5~dB) and approaching the best fixed configuration at higher (E_b/N_0). At high mobility (>= 180~km/h), fast channel decorrelation weakens temporal predictability, limiting the effectiveness of online learning and reducing performance differences across policies.
Read the full abstract

All authors Sarah Al-Shareeda, Gulcihan Özdemir, Arouj Fatima, Madalin-Dorin Pop, Bander A. Jabr, Yasser Bin Salamah, Jacques Demerjian