Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 10 March

Combinatorics

Reinforced Generation of Combinatorial Structures: Ramsey Numbers

We present improved lower bounds for nine classical Ramsey numbers: $\mathbf{R}(3, 13)$ is increased from $60$ to $61$, $\mathbf{R}(3, 18)$ from $99$ to $100$, $\mathbf{R}(4, 13)$ from $138$ to $139$, $\mathbf{R}(4, 14)$ from $147$ to $148$, $\mathbf{R}(4, 15)$ from $158$ to $159$, $\mathbf{R}(4, 16)$ from $170$ to $174$, $\mathbf{R}(4, 18)$ from $205$ to $209$, $\mathbf{R}(4, 19)$ from $213$ to $219$, and $\mathbf{R}(4, 20)$ from $234$ to $237$. These results were achieved using AlphaEvolve, an LLM-based code mutation agent. Beyond these new results, we successfully recovered lower bounds for all Ramsey numbers known to be exact, and matched the best known lower bounds across many other cases. These include bounds for which previous work does not detail the algorithms used. Virtually all known Ramsey lower bounds are derived computationally, with bespoke search algorithms each delivering a handful of results. AlphaEvolve is a single meta-algorithm yielding search algorithms for all of our results.
Read the full abstract

Probability

Universal limit theorem for rough differential equations driven by controlled rough paths

We study rough differential equations driven by controlled rough paths in the level-$2$ regime $1/3<\alpha\le 1/2$. Given a reference rough path $\mathbf X=(1,X,\mathbb X)$ and an $\mathbf X$-controlled driver $\mathbf Z=(Z,Z')$, we first give a point-removal construction of the controlled rough integral $ \int_s^t Y_r\,d\mathbf Z_r $ and prove the corresponding remainder estimates. We then establish local and global well-posedness for the controlled-driven rough differential equation $ dY_t=F(Y_t)\,d\mathbf Z_t. $ A key structural result is the canonical lift of the controlled driver: from the controlled data $(\mathbf X,\mathbf Z)$ we construct a level-$2$ rough path \[ \widehat{\mathbf Z}=(1,Z,\mathbb Z), \qquad \mathbb Z_{s,t}:=\int_s^t Z_{s,u}\otimes dZ_u, \] and show that the controlled-driven equation is equivalent to the classical rough differential equation driven by $\widehat{\mathbf Z}$. This equivalence shows compatibility with classical rough path theory, while the controlled formulation keeps track of the dependence of the effective driver $Z$ on the reference rough path $\X$. Finally, we prove a universal limit theorem for the solution map $ (\mathbf X,\mathbf Z,Y_0)\longmapsto Y, $ which gives stability with respect to perturbations of the initial condition, the reference rough path, and the controlled driver. These results provide a natural framework for layered rough systems and equations driven by transformed or previously evolved rough signals.
Read the full abstract

Combinatorics

$\partial$-invariant path generators for digraphs

We study the structure of the space $\Omega_3(G)$ of $\partial$-invariant 3-paths in a directed graph $G$. We prove that $\Omega_3(G)$ admits a basis consisting of trapezohedral paths $\tau_m$ ($m \ge 2$) and their merging images. Moreover, we provide an explicit construction of such a basis and, as a consequence, obtain an algorithm with time complexity $O(|V(G)|^5)$ for computing the dimension and a basis of $\Omega_3(G)$ for any finite digraph.
Read the full abstract

Numerical Analysis

A direct sampling method for inverse time-dependent electromagnetic source problems: reconstruction of the radiating time and spatial support

This paper investigates inverse source problems for time-dependent electromagnetic waves governed by Maxwell's equations. After applying the Fourier transform with respect to time, the problem leads to a frequency-domain electromagnetic system with a frequency-dependent source term. We propose a novel direct sampling method for reconstructing such radiating time and spatial space of sources from multi-frequency far-field measurements. By using a pair of multi-frequency data from opposite observation directions, we can obtain the radiating time of the signal. Based on this, the smallest region between two hyperplanes containing the support of source can be reconstructed using multi frequency data from one observation direction. The Theta convex hull of the source support can be reconstructed from multi-frequency data from sparse observation directions. Compared with existing sampling methods that mainly focus on reconstructing the spatial support, the proposed approach allows for the simultaneous reconstruction of both spatial and temporal features of the source.Three-dimensional numerical examples are conducted to validate the effectiveness of the algorithm.
Read the full abstract

Information Theory

Artificial Noise Versus Artificial Noise Elimination: Redefining Scaling Laws of Physical Layer Security

Artificial noise (AN) is a key physical-layer security scheme for wireless communications over multiple-input multiple-output wiretap channels. Recently, artificial noise elimination (ANE) has emerged as a strategy to mitigate the impact of AN on eavesdroppers. However, the influence of ANE on the secrecy rate when counteracting AN has not been investigated. In this paper, we address this issue by establishing scaling laws for both average and instantaneous secrecy rates in the presence of AN and ANE. Based on the scaling laws, several derived corollaries provide insights into the mutual constraints between the number of transmit antennas, receive antennas, and antennas at eavesdroppers, revealing the interplay between these factors. A key corollary reveals that when the eavesdropper possesses more than twice as many antennas as the transmitter, secure communication may no longer be guaranteed. Additionally, by comparing scenarios where ANE counteracts AN with those where AN is not employed, this study identifies sufficient conditions under which AN remains effective. Finally, the derived secrecy rates provide guidelines for system design, even in the presence of advanced ANE countermeasures implemented by the eavesdropper.
Read the full abstract

All authors Hong Niu, Tuo Wu, Xia Lei, Wanbin Tang, Mérouane Debbah, H. Vincent Poor, Chau Yuen

Number Theory · Cross-listed from quant-ph

On the Existence of Algebraic Equiangular Lines

We consider real and complex equiangular lines, generated by unit vectors. We show that, for an arbitrary dimension $d$, if there exists a set of $d^2$ equiangular unit vectors in $\mathbb{C}^d$, then there must exist a set of $d^2$ equiangular unit vectors with all of their coefficients in a number field. This result is motivated by the question of constructing SIC-POVMs in quantum physics and conjectures around them. We discuss applications of our techniques to the case of real equiangular lines and consequences of the above results.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.stat-mech

Canonical Criterion for Third-Order Transitions

Microcanonical inflection-point analysis (MIPA) identifies third-order transitions from derivatives of the microcanonical entropy, but whether such transitions admit a direct canonical formulation has remained unclear. Here we establish a fluctuation-based canonical framework for third-order transitions through a cumulant-ratio criterion whose signed extrema define their canonical counterparts and, in the single-saddle regime, are asymptotically linked to microcanonical classification. Because the criterion depends only on energy cumulants, it avoids explicit density-of-states reconstruction and remains operational in nonequilibrium steady states. Physically, it reveals dependent and independent third-order transitions as fluctuation reorganizations around low-order transitions, namely disordered-side precursors and ordered-side restructuring. Benchmarks on Onsager's two-dimensional Ising solution, finite size Potts models, and a driven nonreciprocal Ising model show that the framework is theoretically grounded and broadly applicable.
Read the full abstract

All authors Fangfang Wang, Wei Liu, Kai Qi, Zidong Cui, Ying Tang, Zengru Di

Information Theory

Do Ambient Backscatter Communication Receivers Require Low-Noise Amplifiers?

In ambient backscatter communication (AmBC), strong direct interference from the ambient source poses a major challenge to reliable symbol detection. Although previous studies have shown that employing a low-noise amplifier (LNA) in conventional point-to-point communication improves symbol detection performance at low-to-moderate transmission power, it remains unclear whether this improvement also holds for AmBC. To respond it, in this work, we investigate the symbol detection performance of an AmBC receiver that is equipped with an LNA and adopts the energy detection (ED) to recover tag's information. Particularly, we first propose a new AmBC symbol detection framework that incorporates LNA parameters. On this basis, we derive the bit error rate (BER) of the ED and employ the deflection coefficient (DC) to demonstrate that the detection performance can be enhanced by the LNA at low-to-moderate ambient source transmission power. Then, we derive the near-optimal detection threshold to minimize the BER and propose a method to estimate the required parameters for this threshold by leveraging the tag's pilot symbols.
Read the full abstract

All authors Xinyi Wang, Yuxin Li, Yinghui Ye, Gongpu Wang, Guangyue Lu

Combinatorics

An RSK correspondence for cylindric tableaux

This paper establishes an analogue of the Robinson–Schensted correspondence for cylindric tableaux. In particular, for any pair of positive integers $(d,L)$, we construct a bijection between permutations that avoid the patterns $d\cdots 1 (d+1)$ and $1\cdots (L+1)$ and pairs of $(d,L)$-cylindric standard Young tableaux with a common shape. This arises as a special case of a Knuth-type generalization involving cylindric semistandard tableaux and a further generalization involving oscillating tableaux. Using these results, we construct several other bijections and derive enumerative consequences involving cylindric tableaux and pattern-avoiding permutations. For example, we give an asymptotic for the number of permutations in $S_n$ that avoid the patterns $d\cdots 1 (d+1)$ and $1\cdots (L+1)$ as $n\to\infty$.
Read the full abstract

Differential Geometry

Classification of ancient finite-entropy curve shortening flows

We prove that any ancient smooth embedded finite-entropy curve shortening flow is one of the following: a static line, a shrinking circle, a paper clip, a translating grim reaper, or a graphical ancient trombone. An ancient trombone is an immersed ancient flow, either compact or non-compact, obtained by gluing together $m$ translating grim reaper curves. For each $m$, there exists a $(2m-1)$-parameter family of graphical ancient trombones, up to rigid motions and time shifts as constructed by Angenent-You. In particular, our result implies that any compact ancient smooth embedded finite-entropy flow is convex. Moreover, any non-compact ancient smooth embedded finite-entropy flow is either a static line or a complete graph over a fixed open interval.
Read the full abstract

All authors Kyeongsu Choi, Dong-Hwi Seo, Wei-Bo Su, Kai-Wei Zhao

Analysis of PDEs

Stability Estimates for the Inverse Problem of Reconstructing Point sources in Parabolic Equations

In this work, we investigate the stability issue of the inverse problem of determining the locations and time-dependent amplitudes of point sources in a parabolic equation with a non-self adjoint elliptic operator from boundary observations. We derive different stability estimates for determining the locations and the amplitudes of the sources in the space, the plane as well as in dimension one. The analysis employs a novel approach that combines several different arguments, including the improved regularity of the solutions, the application of Carleman estimates, time extension of solutions, and construction of explicit solutions to the adjoint equations. Further we provide numerical reconstructions to complement the theoretical findings.
Read the full abstract

All authors Kuang Huang, Bangti Jin, Yavar Kian, Faouzi Triki

Optimization and Control

Adaptive Polyak Stepsize with Level-value Adjustment for Distributed Optimization

Stepsize selection remains a critical challenge in the practical implementation of distributed optimization. Existing distributed algorithms often rely on restrictive prior knowledge of global objective functions, such as Lipschitz constants. While centralized Polyak stepsizes have recently gained attention for their parameter-free adaptability and fast convergence. However, their extension to distributed settings is hindered by the requirement for local function values at the global optimum, which are typically unavailable to individual agents. To bridge this gap, we design a novel distributed adaptive Polyak stepsize algorithm with level-value adjustment (DPS-LA), where each agent only needs to solve a computationally efficient linear feasibility problem, thereby eliminating the dependency on global optimal values. Theoretical analysis proves that DPS-LA guarantees network consensus and achieves a linear speedup convergence rate of $\mathcal{O}(1/\sqrt{nT})$. Numerical results confirm the efficiency of the proposed algorithm.
Read the full abstract

All authors Chen Ouyang, Yongyang Xiong, Jinming Xu, Keyou You, Yang Shi

Probability · Cross-listed from stat.CO

Sampling on Discrete Spaces with Temporal Point Processes

Temporal point processes offer a powerful framework for sampling from discrete distributions, yet they remain underutilized in existing literature. We show how to construct, for any target multivariate count distribution with downward-closed support, a multivariate temporal point process whose event-count vector in a fixed-length sliding window converges in distribution to the target as time tends to infinity. Structured as a system of potentially coupled infinite-server queues with deterministic service times, the sampler exhibits a discrete form of momentum that suppresses random-walk behaviour. The admissible families of processes permit both reversible and non-reversible dynamics. As an application, we derive a recurrent stochastic neural network whose dynamics implement sampling-based computation and exhibit some biologically plausible features, including relative refractory periods and oscillations. The introduction of auxiliary randomness reduces the sampler to a birth-death process, establishing the latter as a degenerate case with the same limiting distribution. In simulations on 63 target distributions, our sampler always outperforms these birth-death processes and frequently outperforms Zanella processes in multivariate effective sample size, with further gains when normalized by CPU time.
Read the full abstract

Analysis of PDEs

Gradient estimates for nonlinear elliptic equations with Orlicz growth and measure data

We establish gradient estimates of solutions to a class of nonlinear elliptic equations with measure data under Orlicz-type growth conditions. The growth is governed by the structural condition \[ 0<i_a\le t g'(t)/g(t)\le s_a<1. \] We obtain two types of regularity results: pointwise Wolff potential estimates for the gradient of solutions in the singular regime $i_a \in \big(\frac{n-1}{2n-1},1\big)$, and Lipschitz regularity of the solutions in the regime $i_a \in (0,1)$. In the power-type case $g(t)=t^{p-1}$, our results recover the known gradient estimates for the singular $p$-Laplace equation.
Read the full abstract

Information Theory

Unlocking High-Fidelity Analog Joint Source-Channel Coding on Standard Digital Transceivers

Analog joint source-channel coding (JSCC) has demonstrated superior performance for semantic communications through graceful degradation across channel conditions. However, a fundamental hardware-software mismatch prevents deployment on modern digital physical layers (PHYs): analog JSCC generates continuous-valued symbols requiring infinite waveform diversity, while digital PHYs produce a finite set of discrete waveforms and employ non-differentiable operations that break end-to-end gradient flow. Existing solutions either fundamentally limit representation granularity or require impractical white-box PHY access. We introduce D2AJSCC, a novel framework enabling high-fidelity analog JSCC deployment on standard digital PHYs. Our approach exploits orthogonal frequency-division multiplexing's parallel subcarrier structure as a waveform synthesizer: computational PHY inversion determines input bitstreams that orchestrate subcarrier amplitudes and phases to emulate ideal analog waveforms. To enable end-to-end training despite non-differentiable PHY operations, we develop ProxyNet-a differentiable neural surrogate of the communication link that provides uninterrupted gradient flow while preventing JSCC degeneration. Simulation results for image transmission over WiFi PHY demonstrate that our system achieves near-ideal analog JSCC performance with graceful degradation across SNR conditions, while baselines exhibit cliff effects or catastrophic failures. By enabling next-generation semantic transmission on legacy infrastructure without hardware modification, our framework promotes sustainable network evolution and bridges the critical gap between analog JSCC's theoretical promise and practical deployment on ubiquitous digital hardware.
Read the full abstract

All authors Shumin Yao, Hao Chen, Yaping Sun, Nan Ma, Xiaodong Xu, Qinglin Zhao, Shuguang Cui

History and Overview of Mathematics

Celebrating Women in Mathematics

This paper was motivated by the worldwide May 12 initiative that aims to celebrate, encourage, and inspire women in mathematics. It presents in short how the May 12 initiative has arisen, what are some of the events in the first years, in particular the Generalized functions online workshop that started in 2021 in this context (and has continued as an annual event ever since), and a brief overview of some female mathematicians who have significant scientific contributions and who are the first women in some aspects: Maryam Mirzakhani (the first female mathematician who was awarded with the prestigious Fields medal; the May 12 initiative appeared in her honour), Hypatia (considered to be the earliest known female mathematician), Sofia Kovalevskaya (the first woman who has been awarded a doctorate in mathematics and considered to be the first woman who got a full professorship in mathematics in the modern academic sense), Emmy Noether (the first woman who gave a plenary lecture at the International Congress of Mathematicians), Karen Uhlenbeck (the first woman awarded with the prestigious Abel Prize), and Ingrid Daubechies (the first woman who became a full professor in mathematics at Princeton University, the first woman elected for President of the International Mathematical Union, the first woman who received the National Academy of Sciences Award in Mathematics). The paper was an invited contribution for the Akademie Intakt of the Austrian Academy of Sciences. It appeared in Akademie Intakt 2021, English Edition, Austrian Academy of Sciences, Vienna, 2021, 10-13, and it is submitted to arXiv with a permission from the publisher.
Read the full abstract

Optimization and Control

On the solvability of parameter estimation-based observers for nonlinear systems

Parameter estimation-based observer (PEBO) is a recently developed constructive tool to design state observers for nonlinear systems. It reformulates the state estimation problem as one of online parameter identification, effectively addressing many open estimation challenges in practical applications. The feasibility of a PEBO design relies on two fundamental properties: transformability and identifiability. The former pertains to the existence of an injective solution to a suitable partial differential equation, whereas the latter characterizes the uniqueness of the parameterization induced by the resulting nonlinear regression model. In this paper, we analyze the existence of PEBOs for general nonlinear systems by studying these two properties in detail and by providing sufficient conditions under which they hold.
Read the full abstract

Mathematical Physics · Cross-listed from stat.ML

Verifying Good Regulator Conditions for Hypergraph Observers: Natural Gradient Learning from Causal Invariance via Established Theorems

We verify that persistent observers in causally invariant hypergraph substrates satisfy the conditions of the Conant-Ashby Good Regulator Theorem. Building on Wolfram's hypergraph physics and Vanchurin's neural network cosmology, we formalize persistent observers as entities that minimize prediction error at their boundary with the environment. Applying a modern reformulation of the Conant-Ashby theorem, we demonstrate that hypergraph observers satisfy Good Regulator conditions, requiring them to maintain internal models. Once an internal model with loss function exists, the emergence of a Fisher information metric follows from standard information geometry. Invoking Amari's uniqueness theorem for reparameterization-invariant gradients, we show that natural gradient descent is the unique admissible learning rule. Under the ansatz M=F^2 for exponential family observers and one specific convergence time functional, we derive a closed-form formula for the regime parameter alpha in Vanchurin's Type II framework, with a quantum-classical threshold at kappa(F)=2. However, three alternative convergence models do not reproduce this result, so this prediction is strongly model-dependent. We further introduce the directional regime parameter alpha_{v_k} and the trace-free deviation tensor, showing that a single observer can simultaneously occupy different Vanchurin regimes along different eigendirections of the Fisher metric. This connects Wolfram and Vanchurin frameworks through established theorems, providing approximately 25-30% novel contribution.
Read the full abstract

Combinatorics

On the Real Reliability Roots of Graphs

Consider a connected graph $G$, and assume that every edge fails independently with probability $q$. The (all-terminal) reliability polynomial is the probability in $q$ that the spanning connected subgraph of operational edges is connected. In this paper we focus on the real roots of reliability polynomials (reliability roots). We prove that almost every graph has a nonreal reliability root, and that the reliability polynomials of graphs have roots dense on the interval $[\beta,0]$ where $\beta\approx-0.5707202942$.
Read the full abstract

Representation Theory

Algebraicity of the Brascamp-Lieb constants

We show that the Brascamp-Lieb (BL) constant BL(-,p) is a semi-algebraic function on the set of feasible data. Consequently, it is algebraic in the sense that it satisfies a polynomial relation of the form P(V, BL(V,p))=0 for a non-zero polynomial P. In fact, we establish an analogous statement in the more general setting of quiver BL constants associated to representations of bipartite quivers.
Read the full abstract

Probability

Critical stationary fluctuations in reaction–diffusion processes

We study stationary fluctuations at criticality for a one-dimensional reaction–diffusion process combining symmetric simple exclusion dynamics with Glauber-type spin flips. The strength of the Glauber interaction is tuned to the critical regime in which the quadratic term in the effective potential vanishes. Focusing on the stationary distribution, we show that the total magnetization scaled by $n^{3/4}$ exhibits non-Gaussian fluctuations. More precisely, we prove that under the invariant measure the rescaled magnetization converges in distribution to a random variable with density proportional to $\exp\{-2(\theta y^2 + y^4/2)\}$. In contrast with the previous result, we show that the density field acting on the faster modes, that is, those associated to zero-mean test functions, have much smaller Gaussian fluctuations. It follows from the previous two results that the rescaled density field projects onto the magnetization in the sense that its action on zero-mean test functions vanishes in the limit.
Read the full abstract

Statistics Theory · Cross-listed from q-bio.QM

Sequential learning theory for Markov genealogy processes

We introduce a filtration-based framework for studying when and why adding taxa improves phylodynamic inference, by constructing a natural ordering of observed tips and applying sequential Bayesian analysis to the resulting filtration. We decompose the expected variance reduction on taxa addition into learning, mismatch, and covariance components, classify estimands into learning classes based on the pathwise behaviour of the mismatch, and show that for absorbing estimands an oracle who knows the latent absorption status obtains event-wise learning guarantees unavailable to the analyst. The gap between oracle and analyst is irreducible assumptions that are likely to hold for many real phylodynamic estimands, establishing a fundamental limit on what sequence data alone can reveal about the latent genealogy.
Read the full abstract

Monday 9 March

Rings and Algebras

Central Splitting, Division-Stable Residuals, and Opposite-Ring Transfer for Strongly C4*-Rings

The known decomposition theorem for strongly \(\Cfourstar\)-modules gives a semisimple summand and a summand-square-free residual summand, with two-way Hom-orthogonality when the ambient module is projective. Applied to the regular module, the two cross-corners vanish, so the idempotent defining the decomposition is central. Thus every strongly right \(\Cfourstar\)-ring splits as \(R\cong \Sigma\times T\), where \(\Sigma\) is semisimple artinian and \(T_T\) is summand-square-free. The splitting need not be unique. We organize all admissible central splittings into a join-semilattice and prove a comparison theorem: any two residual factors have a common direct factor, and their complementary factors are finite products of division rings. Consequently the right-to-left defect is independent of the chosen splitting. If the central idempotents satisfy the ascending chain condition, there is a unique greatest admissible idempotent; it captures every central semisimple artinian direct factor and hence yields a canonical residual with no further such factor. An infinite product of fields shows that this finiteness hypothesis cannot simply be omitted. We also prove anti-isomorphism transport for \(\Cfour\), \(\Cfourstar\), semi-weak-CS, and strongly \(\Cfourstar\) modules. It yields transfer whenever a residual factor is a product of a semisimple summand-square-free ring and a self-opposite core. This criterion does not assume regularity, exchange, or a left-sided hypothesis. Skew Laurent rings provide noncommutative nonregular examples, while the known injective-nonsurjective skew-polynomial construction gives a sharp one-sided residual obstruction.
Read the full abstract

All authors Chandrasekhar Gokavarapu, Naveen Kumar Kakumanu, Sajani Lavanya Madasi, Sudakar Gadde, Siri Katakam

K-Theory and Homology

Twisted factorial Grothendieck polynomials and equivariant $K$-theory of weighted Grassmann orbifolds

In this paper, we provide an explicit description of the Schubert classes in the equivariant $K$-theory of weighted Grassmann orbifolds. We introduce the `twisted factorial Grothendieck polynomials', a family of symmetric polynomials by specializing the factorial Grothendieck polynomials, and prove that they represent the Schubert classes in the equivariant $K$-theory of the weighted Grassmann orbifolds. We give an explicit formula for the restriction of the Schubert classes to any torus fixed point in terms of twisted factorial Grothendieck polynomials. We give an explicit formula for the structure constants with respect to the Schubert basis in the equivariant $K$-theory of weighted Grassmann orbifolds. Eminently, we describe `twisted Grothendieck polynomials' and prove that these represent the Schubert classes in the $K$-theory of the weighted Grassmann orbifold. As a consequence, we describe the structure constants in the $K$-theory of weighted Grassmann orbifolds.
Read the full abstract

Functional Analysis

Zador Theorem for optimal quantization with respect to Bregman divergences

We establish a Zador like theorem for $L^r$-optimal vector quantization when the similarity measure is a twice differentiable Bregman divergence of a strictly convex function. On our way we also prove a similar result when the Bregman divergence is replaced by a continuous matrix-valued vector field having values in the set of positive definite matrices. We adopt the strategy of the first fully rigorous proof of the original Zador' theorem (when the similarity measure is the power of a norm). We have to overcome several difficulties which are specific to this framework especially concerning the so-called firewall lemma.
Read the full abstract

Information Theory · Cross-listed from eess.SY

Joint Trajectory, RIS, and Computation Offloading Optimization via Decentralized Model-Based PPO in Urban Multi-UAV Mobile Edge Computing

Efficient computation offloading in multi-UAV edge networks becomes particularly challenging in dense urban areas, where line-of-sight (LoS) links are frequently blocked and user demand varies rapidly. Reconfigurable intelligent surfaces (RISs) can mitigate blockage by creating controllable reflected links, but realizing their potential requires tightly coupled decisions on UAV trajectories, offloading schedules, and RIS phase configurations. This joint optimization is hard to solve in practice because multiple UAVs must coordinate under limited information exchange, and purely model-free multi-agent reinforcement learning (MARL) often learns too slowly in highly dynamic environments. To address these challenges, we propose a decentralized model-based MARL framework. Each UAV optimizes mobility and offloading using observations from several hop neighbors, and submits an RIS phase proposal that is aggregated by a lightweight RIS controller. To boost sample efficiency and stability, agents learn local dynamics models and perform short horizon branched rollouts for proximal policy optimization (PPO) updates. Simulations show near centralized performance with improved throughput and energy efficiency at scale.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Asymptotic Expansions for Neural Network Approximations of Quantum Channels

This paper establishes the Quantum Voronovskaya–Damasclin (QVD) Theorem, providing a complete asymptotic characterization of Quantum Neural Network Operators in the approximation of arbitrary quantum channels. The result extends the classical Voronovskaya theorem from scalar approximation to the non-commutative operator framework of quantum information theory. We introduce rigorous quantum analogues of Sobolev and Hölder spaces defined through Fréchet differentiability in the Liouville representation and measured using the completely bounded (diamond) norm. Within this framework, we derive an explicit asymptotic expansion of the approximation error and identify the fundamental mechanisms governing convergence. The expansion separates integer-order differential contributions, fractional corrections associated with limited regularity, and intrinsically non-commutative effects arising from operator algebra structure. We also establish a sharp remainder estimate with explicit dependence on the regularity of the channel and the dimension of the underlying Hilbert space. Several applications demonstrate the scope of the theory. These include a quantum central limit theorem describing the fluctuation regime of quantum neural network operators, an optimal interpolation method based on operator geometric means, and a convergence acceleration procedure inspired by Richardson extrapolation. The results provide a rigorous mathematical foundation for the asymptotic analysis of quantum neural network models and establish a direct connection between classical approximation theory, operator algebras, and quantum information science, with implications for quantum algorithms and quantum machine learning.
Read the full abstract

Information Theory

End-to-End Deep Learning in Wireless Communication Systems: A Tutorial Review

The physical layer (PHY) in wireless communication systems has traditionally relied on model-based methods that are often optimized individually as independent blocks to perform tasks such as modulation, coding, and channel estimation. However, these approaches face challenges when it comes to capturing real-world nonlinearities, hardware imperfections, and increasing complexity in modern networks. This paper surveys advancements in applying deep learning (DL) for end-to-end PHY optimization by incorporating the autoencoder (AE) model as a powerful end-to-end DL framework to enable joint transmitter and receiver optimization and address challenges like dynamic channel conditions and scalability. We review cutting-edge DL models; their applications in PHY tasks such as modulation, error correction, and channel estimation; and their deployment in real-world scenarios, including point-to-point communication, multiple access, and interference channels. This work highlights the benefits of learning-based approaches over traditional methods, offering a comprehensive resource for researchers and engineers looking to innovate in next-generation wireless systems. Key insights and future directions are discussed to bridge the gap between theory and practical implementation.
Read the full abstract

All authors Abdelrahman Elfiky, Zouheir Rezki, Jorge Cortez, Youssef Boumhaout, Anne Xia, Abdulkadir Celik, Georges Kaddoum