Analysis of PDEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 22 April
In this paper, we first extend the explicit formula \cite{gerard2023explicit} for the classical Benjamin-Ono equation to each flow of the Benjamin-Ono hierarchy on line. We then use this representation to derive two main applications. First, we obtain a complete classification of traveling wave solutions for all higher-order flows in the hierarchy. Second, we analyze the zero-dispersion limit for the corresponding small-dispersion flows. For every fixed time $t\in\mathbb R$, we prove that, at any time, the solution converges weakly in $L^2(\mathbb R)$ as the dispersion parameter tends to $0$, and we provide a geometric characterization of the limit in terms of an alternating sum, which yields the higher-order analogue of the formula obtained in \cite{miller2011zero}, \cite{Gerard2025small} for the Benjamin-Ono equation.
Mathematical Physics · Cross-listed from quant-ph
Native quantum games from interacting discrete-time quantum walks
We study how strategic interaction can arise from controlled quantum dynamics rather than being imposed as an external mathematical structure. We introduce a class of interaction-defined quantum games in which players are represented by distinguishable quantum walkers, strategies correspond to local coin operations, and payoffs are defined as expectation values of physical observables. Using interacting discrete-time quantum walks as a concrete platform, we demonstrate numerically that competitive, cooperative, and asymmetric games admit stable stationary strategy profiles when the walkers are coupled, while no non-trivial equilibria exist in the absence of interaction. To clarify the game-theoretic structure, we derive an analytic perturbative decomposition of the payoff function in the weak-interaction regime, showing explicitly that strategic coupling originates from interaction-induced interference terms in the joint probability distribution. For a collision-based phase interaction, the payoff becomes non-separable at first order in the interaction strength and generically admits stationary points satisfying the Nash conditions. Our results provide a physically explicit realization of strategic interdependence in quantum transport processes and establish interacting quantum walks as a minimal platform for studying game-theoretic behavior emerging from unitary dynamics.
Read the full abstract
Mathematical Physics
Generalised Langevin Dynamics: Significance and Limitations of the Projection Operator Formalism
We discuss some mathematical aspects of the Mori-Zwanzig projection operator formalism. The core of the Mori-Zwanzig formalism is the generalised Langevin equation, which is typically derived from the Dyson-Duhamel identity. We recall the derivation of the projection operator formalism for Mori's projection by means of semigroup theory, and we discuss where rigorous methods fail for the case of Zwanzig's projection. For bounded perturbations of the time-evolution operator (e.g. for Mori's projection), the Dyson-Duhamel identity coincides with the variation of constants formula. For unbounded perturbations (e.g. for Zwanzigs's projection), the Dyson-Duhamel identity should be considered an equation for the orthogonal dynamics, for which the existence of unique solutions has yet to be established. Then we recall that all properties of Mori's generalised Langevin equation follow directly from the well-posedness of Volterra equations, irrespective of the projection operator formalism. Further, we discuss the use of Mori's generalised Langevin equation as a coarse-grained model. Finally, we illustrate that the memory term is a coupling term that is not necessarily related to memory. To this end, we introduce projections onto subspaces of 'fast' and 'slow' variables that are associated with the spectral decomposition of skew-adjoint operators. For these projections, the memory term vanishes.
Read the full abstract
Numerical Analysis
Forward–Inverse Interplay in FEM-Based EEG Source Imaging: Distributional Signatures of Advanced Source Models and Inverse Solvers
Electroencephalography (EEG) source imaging aims to infer brain activity from electrical potentials measured on the scalp. This is a difficult problem because many different source patterns can explain the same measurements. The result depends strongly on two things: the forward model and the inverse method. In this work, we study how these two parts work together. We focus not only on where the activity is located, but also on how the reconstructed activity is distributed in space. We suggest that different source models create different signatures in the reconstructed activity. We use realistic head models and compute forward solutions with the finite element method using Zeffiro Interface and DUNEuro. We test different source models, including 2 implementations of a divergence-conforming model, and one implementation of Local subtraction approach. For inverse methods, we use advanced methods such as standardized hierarchical adaptive L1 regression (SHAL1R), standardized Kalman filtering (SKF), and classical dipole scanning. To understand the complex interplay between the forward and inverse approaches, we analyze the inverse source localization results using distributional quantitative measures, including Earth Mover's Distance and depth bias scatter plot, and qualitatively assess the amplitude distribution and focality. The results show that there is a strong dependence between the choice of source model and the success rate of a given inverse method: a source model that corresponds well with a single point-like source is a good match with an inverse method that presupposes such a source.
Read the full abstract
Algebraic Geometry
A Matsushima theorem for K-polystable polarised smooth Fano threefolds
We prove that if $X$ is a smooth Fano threefold and $L$ is an ample $\mathbb{Q}$-divisor such that $(X,L)$ is K-polystable, then the automorphism group $\operatorname{Aut}(X)$ is reductive. This verifies the reductivity statement predicted by the Yau–Tian–Donaldson conjecture in the setting of smooth Fano threefolds with arbitrary ample polarisation.
Read the full abstract
Probability
Stochastic Extinction with Relaxed Boundedness Conditions
We study stochastic extinction for a class of Markov processes motivated by models in ecology and epidemiology. Extinction is often characterized by a boundedness condition and a condition on boundary Lyapunov exponents (invasion rates). While the latter is typically sharp, the former is often restrictive and can be improved. Building on the ideas initiated in \cite{benaim2018stochastic}, we develop a streamlined approach that relaxes this boundedness condition and yields concise and accessible criteria for extinction. In particular, we establish extinction criteria in two settings: with and without a linearly bounded quadratic variation condition. In the first case, our result is comparable to, and slightly improves upon, the main results in \cite{foldes2024stochastic}. In the second case, where the quadratic variation is not linearly bounded, we obtain new extinction results that fall outside the scope of existing frameworks. Several examples are provided to illustrate the applicability of our results and to highlight situations where previous conditions are not practically verifiable.
Read the full abstract
Optimization and Control
On Reward-Balancing Methods for Reinforcement Learning
This paper investigates the so-called reward-balancing methods, a novel class of algorithms for solving discounted-return reinforcement learning (RL) problems. These methods consist of iteratively adjusting the reward function to transform the RL problem into an equivalent one in which the optimal policies are greedy. For this procedure, referred to as normalization process, we provide a theoretical analysis of the involved transformations, emphasizing their algebraic structure. Then, we introduce a control-theoretic reformulation, recasting the reward-balancing procedure into an optimal control framework. The approach is further extended to address model uncertainty through stochastic model sampling, yielding normalization guarantees and probabilistic bounds on stochastic fluctuations. Using the proposed optimal control framework within a scenario model predictive control (MPC) setting, we demonstrate, through simulation studies, performance improvements over the current state-of-the-art.
Read the full abstract
Information Theory
A New Paradigm Towards Reconfigurable Environment: Reconfigurable Distributed Antennas and Reflecting Surface
Reconfigurable distributed antennas and reflecting surface (RDARS) has emerged as a transformative solution to address the stringent requirements of future wireless networks. By combining distributed active antennas with reconfigurable passive reflecting surfaces, RDARS integrates the advantages of both active transmission and passive wave control in a cost-effective and energy-efficient manner. This hybrid architecture enables enhanced coverage, improved spectral efficiency, and seamless support for integrated communication and sensing. In this article, we first introduce the fundamental architecture and working principles of RDARS, followed by practical benefits and comparisons with recently proposed intelligent surface variants. We then highlight the signal-to-noise ratio (SNR) gains in representative applications of RDARS-aided communication and sensing scenarios, where RDARS demonstrates clear advantages over conventional reconfigurable intelligent surfaces. Finally, we outline key challenges related to practical implementation and resource allocation, and discuss potential research directions. With its unique hybrid mode synergy, RDARS is envisioned to play a pivotal role in shaping the evolution of next-generation intelligent communication systems.
Read the full abstract
Analysis of PDEs
A discrete-time overdetermined problem for the heat equation
In this paper, we consider a parabolic counterpart of Serrin's overdetermined problem, in which the overdetermined condition (constant flux condition) is imposed only on a discrete infinite set of time values. We show that, under suitable regularity assumptions on the domain, such a discrete-time overdetermined problem admits a solution if and only if the domain is a ball. Remarkably, depending on the temporal scale, the same overdetermined condition captures either geometric or spectral information, yet both mechanisms lead to the same rigidity conclusion. We study both the case in which the constant flux condition is imposed on the boundary and the case in which the constant flux condition is imposed on an interior surface. We remark that the methods employed in our analysis do not depend on the location of the overdetermined surface but only on whether the sequence of time instants accumulates away from zero. Finally, we will show how this problem generalizes to complete Riemannian manifolds.
Read the full abstract
Algebraic Geometry
On G-birational rigidity of projective spaces
In this paper, we study finite subgroups $G\subset\mathrm{Aut}(\mathbb{P}^n)$ such that $\mathbb{P}^n$ is $G$-birationally rigid. For each $n\geqslant 3$, we prove that $\mathrm{Aut}(\mathbb{P}^n)$ contains at most finitely many such subgroups up to conjugation. For $n=4,5,7$, we prove that $\mathbb{P}^n$ is $G$-birationally superrigid if $G$ is a primitive subgroup isomorphic to $\mathrm{PSp}_{4}(\mathbf{F}_3)$, $\mathrm{PSU}_4(\mathbf{F}_3)\rtimes\boldsymbol{\mu}_2$, $\mathrm{O}_8^+(\mathbf{F}_2)\rtimes \boldsymbol{\mu}_2$, respectively.
Read the full abstract
Algebraic Geometry
G-birationally rigid cubic threefolds
We classify pairs $(X,G)$ consisting of a (possibly singular) cubic threefold $X\subset\mathbb{P}^4$ and a finite subgroup $G\subset\mathrm{Aut}(X)$ such that $X$ is $G$-birationally rigid, i.e., $X$ is a $G$-Mori fiber space (over a point), and $X$ is not $G$-birational to any $G$-Mori fibre space that is not $G$-biregular to $X$.
Read the full abstract
Algebraic Geometry
Birational geometry of actions on del Pezzo surfaces
We complete the classification of regular generically free actions of finite groups on del Pezzo surfaces, up to birational equivalence. As a byproduct, we settle several open problems in equivariant birational geometry, e.g., we classify birationally rigid actions on del Pezzo surfaces.
Read the full abstract
Statistics Theory
Likelihood-based inference for birth-death processes with composite birth mechanisms
We develop a likelihood-based inference for finite-state birth-death processes with composite birth rates, in which multiple distinct mechanisms contribute additively to the total birth intensity. Our main motivating example is an SIS epidemic model with pairwise and higher-order transmission. The process is observed through a single aggregate trajectory, and in the main setting of interest, birth events are unmarked. This creates a deconvolution problem in event space: the state is one-dimensional, but the mechanism underlying each birth is latent. We formulate the inference under a Doob $h$-transformed $Q$-process, which is time-homogeneous and ergodic and which provides a time-homogeneous asymptotic surrogate for the law of the original process conditioned on long survival. We derive the corresponding conditional likelihood and study both the conditional maximum likelihood estimator and a quasi-maximum likelihood estimator which is based on a simplified working score. Under the Doob-transform law, we prove consistency and asymptotic normality for both estimators, with asymptotic covariance determined by the inverse Fisher and inverse Godambe information matrices, respectively. We also showcase a practical one-dimensional test for the presence of a specific higher-order birth mechanism.
Read the full abstract
Group Theory
On generic and supertight automorphisms
We show that generic automorphisms of stable groups are supertight in a strong sense. In particular, we obtain the existence of supertight automorphisms. We also answer a question concerning the relationship between supertight automorphisms of $\mathrm{PGL}_2(K)$ and generic automorphisms of the underlying field $K$. Moreover, we provide partial evidence-already suggested by Hrushovski-toward the principle that “fixed points are pseudofinite” in the setting of generic automorphisms of simple groups of finite Morley rank.
Read the full abstract
Statistics Theory
Fast and Provably Accurate Sequential Designs using Hilbert Space Gaussian Processes
Gaussian processes are widely used for accurate emulation of unknown surfaces in sequential design of expensive simulation experiments. Integrated mean squared error (IMSE) is an effective acquisition function for sequential designs based on Gaussian processes. However, existing approaches struggle with its implementation because the required integrals often lack closed-form expressions for most kernel functions. We propose a novel and computationally efficient Hilbert space Gaussian process approximation for the IMSE acquisition function, where a truncated eigenbasis representation of the integral enables closed-form evaluation. We establish sharp global non-asymptotic bounds for both the approximation error of isotropic kernels and the resulting error in the acquisition function. In a series of numerical experiments with $\gamma$-stabilizing, the proposed method achieves substantially lower prediction error and reduced computation time compared to existing benchmarks. These results demonstrate that the proposed Hilbert space Gaussian process framework provides an accurate and computationally efficient approach for Gaussian process based sequential design.
Read the full abstract
Rings and Algebras
Free Poisson Rota-Baxter algebra
Functional Analysis
Cesàro-Hardy operators on $L^p[0,1]$: fine spectrum, weighted Koopman semigroups and invariant subspaces
In this paper we study boundedness and detailed spectral properties for the Cesàro-Hardy operator and some generalizations in $L^p[0,1]$. The study employs $C_0$-semigroup theory, expressing the Cesàro-Hardy operators and their dual operators through subordination with $C_0$-semigroups $T(t)$ and $S(t)$ respectively. The spectral properties of the semigroup's infinitesimal generators are transferred to the Cesàro-Hardy operators using functional calculus methods. Furthermore, some implications for the Invariant Subspace Problem are explored by demonstrating the universality of certain translations related to the semigroup $T(t)$, and providing results on the invariant subspaces of these operators.
Read the full abstract
Analysis of PDEs
$L^2({\mathbb R}) $-Unconditional well-posedness for low dispersion fractional KdV equations
We show that the $ L^2({\mathbb R}) $-unconditional well-posedness, that is well-known for the KdV equation, is shared by KdV type equations with weaker dispersion. This is despite the difference in the nature of these equations, which are quasilinear while KdV is semilinear. More precisely we prove that the low dispersion fractional KdV equation $$ \partial_t u -D_x^\alpha \partial_x u +\partial_x(u^2)=0 $$ is unconditionally globally well-posed in $L^2({\mathbb R}) $ for $\alpha \in ]\frac{55}{38},2] $. Our method of proof combined refined bilinear estimates with the energy method enhanced with Bourgain's type estimates developed in Molinet-Vento (2015).
Read the full abstract
Dynamical Systems
Quenched and annealed linear response for some partially hyperbolic skew products
We prove quenched and annealed statistical stability, linear response, and differentiability of asymptotic moments for parametric families of partially hyperbolic skew products, with random hyperbolic maps on the fibers. The main novelty is that the base maps also depend on the parameter, which leads to different formulas in the linear response and the derivative of the asymptotic moments with respect to the parameter. Our annealed results apply to partially hyperbolic maps that are not covered in \cite{BashCastro26,Dol,DS}.
Read the full abstract
Number Theory
On the Hyperbolic Fractional Sum of the Divisor Function
Let $\tau(n)$ denote the classical divisor function. In this paper, we consider the hyperbolic fractional sum of the divisor function defined by $$ T(x) = \sum_{n_1 n_2 \leqslant x} \tau\left( \left[ \frac{x}{n_1 n_2} \right] \right) = \sum_{n \leqslant x} \tau\left( \left[ \frac{x}{n} \right] \right) \tau(n), $$ where $[t]$ denotes the integral part of the real number $t$. By establishing new estimates for a class of three-dimensional exponential sums with constant perturbation, we obtain an improved asymptotic formula for $T(x)$. In particular, we show that for any $\varepsilon > 0$, the error term in the asymptotic expansion of $T(x)$ is bounded by $O(x^{17/30+\varepsilon})$. This result breaks the $4/7$-barrier which corresponds to the application of the classical divisor problem conjecture $1/4+\varepsilon$.
Read the full abstract
Analysis of PDEs
Infinite time blow-up and slow decay for the six dimensional energy-critical heat equation with self-similarly decaying initial data
We consider the six dimensional energy-critical semilinear heat equation with self-similarly decaying initial data. Our main result shows the existence of sign-changing solutions that exhibit infinite-time blow-up and nonnegative solutions that decay strictly more slowly than the self-similar rate. Moreover, the blow-up and decay rates are not uniquely determined by the decay rate of the initial data, but exhibit a certain flexibility depending on the construction. The proof is based on gluing suitably rescaled bubbles to forward self-similar solutions.
Read the full abstract
Representation Theory
Multivariable Vandermonde determinants, amalgams of matrices and Specht modules
Using results of Fayers on the structure of Specht modules, we prove two different formulae for the determinant of matrices which are obtained by amalgamating the entries of two smaller matrices. In particular, this gives formulae for multivariable Vandermonde determinants as a sum of completely factorising terms, each of which is a Vandermonde determinant in fewer variables. As an application, we deduce an elementary proof of the multiplicativity of the transfinite diameter for products of compact sets.
Read the full abstract
Metric Geometry
A sharp $p$-subadditive bound for the $l_p$ Hausdorff distance from convex hull
We study the $\ell_p$ Hausdorff distance from convex hull, which for a compact set $A\subset \mathbb{R}^n$ is defined by \begin{align*} d^{(\ell_p)}(A):=\sup_{x\in \text{conv}(A)}\inf_{a\in A}\|x-a\|_p. \end{align*} In the planar case $n=2$, we study the problem of finding the optimal constant $C_p$ such that \begin{align*} d^{(\ell_p)}(A+B)^p\leq C_p\left(d^{(\ell_p)}(A)^p+d^{(\ell_p)}(B)^p\right) \end{align*} for all nonempty compact $A,B\subset\mathbb{R}^2$. We resolve this question, proving that \begin{align*} C_p=\max\{1,2^{p-2}\}. \end{align*}
Read the full abstract
Information Theory
Fundamental Tradeoff in Movable Antenna Systems: How Long to Move Before Transmission?
The movable antenna (MA) technology enables flexible reconfiguration of wireless channels through adaptive antenna deployment, offering significant potential for enhancing communication performance. However, antenna movement requires a certain duration within which communication may be compromised due to factors such as channel fluctuation and Doppler effect. This leads to a fundamental tradeoff: A longer movement duration allows antennas to reach more favorable positions for better channel conditions, but it inevitably reduces the time available for data transmission. To characterize the aforementioned tradeoff, we focus on the MAs-enabled multiuser downlink scenario, and jointly optimize the movement duration and antenna deployment at the base station to maximize the effective throughput. The formulated problem is highly non-convex. The general solutions require an one-dimensional search over movement durations, each with optimized antenna deployment. To reduce complexity, we propose a fitting method that samples only a few rate-duration pairs, yielding a closed-form expression that captures the rate trend and enables a favorable solution immediately. We further derive a closed-form condition on the maximum antenna movement speed: When the speed is below a certain threshold, the optimal strategy is to keep antennas stationary throughout the transmission period. The fundamental tradeoff and the effectiveness of the proposed solutions are examined in a special case with two MAs and two users. Finally, numerical simulations validate the efficacy of the proposed schemes.
Read the full abstract
Differential Geometry
A Loewner-Nirenberg phenomena for Ricci flow on compact manifolds with boundary.II
This is a continuation of the research in [16]. Let $(\overline{M},g_{-1})$ be a closed geodesic $r_0$-ball in the hyperbolic space $(\mathbb{H}^n,g_{-1})$. Let $m\neq1$ be a positive constant. In this paper, we show that for $n\geq3$, starting from the metric $m g_{-1}$ on $\overline{M}$, with certain prescribed non-decreasing rotationally symmetric mean curvature and the fixed conformal class $[g_{\mathbb{S}^{n-1}}]$ on the boundary $\partial M$, the solution $g(t)$ to the normalized Ricci flow $(1.2)$ which is continuous up to the boundary, exists for all $t>0$, and converges locally uniformly in the interior $M$ of $\overline{M}$ to a complete hyperbolic metric as $t\to\infty$(see Theorem 1.1 for details). Under some additional conditions, we show the same conclusion holds for $n=2$.
Read the full abstract
Information Theory
CSI Feedback Under Basis Mismatch: Rate-Splitting Transform Coding for FDD Massive MIMO
In frequency division duplex massive multiple-input multiple-output systems, downlink channel state information must be fed back within a limited uplink budget. While transform coding with Karhunen-Loeve transform and reverse water-filling is rate-distortion optimal for Gaussian channels, its performance is limited by basis mismatch between the user and base station. We analyze this mismatch and propose a practical architecture separating long-term basis feedback from short-term coefficient quantization. Using a random vector quantization, we derive a closed-form end-to-end mean square error expression. This allows us to characterize the optimal rate split and identify a phase transition threshold for basis updates. Simulations on correlated Gaussian and COST2100 channels demonstrate near-optimal performance, robustness to update overhead, and significant complexity reduction compared to deep-learning-based autoencoders.
Read the full abstract
Differential Geometry
A Loewner-Nirenberg phenomena for Ricci flow on compact manifolds with boundary
In this paper, we show that starting from a geodesic ball $\overline{B_{r_0}}(0)$ in $\mathbb{H}^n$, for $n\geq3$, with prescribed non-decreasing rotationally symmetric mean curvature and the fixed conformal class $[g_{\mathbb{S}^{n-1}}]$ on the boundary, the solution $g(t)$ to the normalized Ricci flow $(1.2)$ which is continuous up to the boundary, exists for all $t>0$ and converges locally uniformly in $B_{r_0}(0)$ to a complete hyperbolic metric as $t\to\infty$(see Theorem 1.2 for details). Moreover, the sectional curvature of $g(t)$ maintains less than $-1$ for $t>0$. For dimension $2$, to achieve such a convergence result, we need the additional assumption that the mean curvature on the boundary increases in a certain speed to infinity as $t\to\infty$.
Read the full abstract
Information Theory
Rate-Cost Tradeoffs in Nonlinear Control
We study finite-horizon rate-cost tradeoffs for general stochastic control systems, including nonlinear systems. Under an average control cost constraint, we show that the minimum expected communication rate lies within an additive logarithmic gap above the normalized directed information minimized over causal control policies. This establishes directed information as the operationally relevant quantity governing rate-limited control, extending its previously established roles in causal source coding and linear quadratic Gaussian (LQG) control to general nonlinear control systems.
Read the full abstract
Analysis of PDEs
Improved lower bounds for Dirichlet eigenvalues of the Laplacian and poly-Laplacian on bounded Euclidean domains
In this paper, we establish Brezin-Li-Yau type lower bounds for averaged sums of Dirichlet eigenvalues of the Laplacian and poly-Laplacian on bounded domains in Euclidean spaces. By deriving expansions of two binary polynomials which may be of independent interest, we improve several existing lower bounds of this kind in the literature. Furthermore, our lower bounds are optimal in the sense that our expansions capture all positive terms, whereas previous works only provided certain lower bounds for these two binary polynomials, effectively capturing only a subset of the positive terms identified in our expansions.
Read the full abstract
Information Theory
Trajectory Design for Fairness Enhancement in Movable Antennas-Aided Communications
Through adaptive antenna repositioning, the movable antenna (MA) technology enables on-demand reconfiguration of wireless channels, thereby creating an additional spatial degree of freedom in improving communication performance. This paper investigates a multiuser uplink communication system aided by MAs, where a base station (BS) equipped with multiple MAs serves multiple single-antenna users. Specifically, given that an optimized array geometry cannot guarantee rate fairness, we focus on designing antenna trajectory at the BS to maximize the minimum achievable rate among all users over a finite time period. The resulting optimization problem is fundamentally challenging to solve due to the continuous-time nature. To address it, we first examine an ideal case with infinitely fast MA movement and demonstrate that the relaxed problem can be optimally solved via the Lagrangian dual method. The obtained trajectory solution reveals that the BS should employ a finite set of MA deployment patterns, each allocated an optimal time duration. Building on this, we then study the general case with limited MA movement speed and propose a heuristic trajectory design inspired by the optimal patterns identified in the ideal scenario. Several insights are also gained by examining the simplified special case. Finally, numerical results are provided to validate the effectiveness of the proposed designs compared to competitive benchmarks.