Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 12 May

Analysis of PDEs

Global Existence and Uniqueness of Strong Solutions for a Phase Transition Model in Atmospheric Dynamics

In this work, we study a phase transition model in atmospheric dynamics, inspired by the works [6,14,15], which analyze the primitive equations governing the evolution of velocity, temperature, and specific humidity. The main difficulty arises from the presence of a multivalued discontinuous nonlinear term in the temperature and in the humidity equations, describing the formation of precipitations, which becomes active under supersaturation conditions. To overcome this issue, we introduce a regularized formulation that ensures the existence and uniqueness of approximate solutions. By employing classical compactness arguments, we then establish the existence of a strong solution to the original model. Additionally, we establish uniqueness under a conditional and physically meaningful assumption. This approach allows us to provide a rigorous justification of the tropical climate model on the whole space $\mathbb{R}^2$, while avoiding the introduction of a viscosity term in the humidity equation.
Read the full abstract

Operator Algebras

Compact Quantum Group Extensions of $USp_q(2n)$, $O_q(n)$ and $SO_q(2n)$

I introduce compact quantum group extensions associated with the $q$-deformations of the classical compact groups $USp(2n)$, $O(n,\mathbb{R})$ and $SO(2n,\mathbb{R})$. Motivated by the relationship between $SU_q(n)$ and $U_q(n)$, I study the problem of constructing compact quantum groups $Z_{q,n}$ extending the standard compact quantum groups $A_{q,n}\in\{ {USp_q(2n), O_q(N), SO_q(2n)}\}$ through an additional central unitary element.
Read the full abstract

Mathematical Physics

A self-adjoint Fourier-type model for the iQuad wavefront sensor

Advanced adaptive optics (AO) systems can use Fourier-type wavefront sensing to correct optical distortions encountered in ground-based telescopes, AO-assisted retinal imaging, and free-space optical communications (FSOC). Recently, a novel Fourier-type wavefront sensor (WFS) known as the iQuad WFS has been introduced. Its design features a focal plane tessellation with a four-quadrant phase mask (FQPM) that incorporates a $\pm \pi/2$ phase shift between adjacent quadrants. In this work, we establish a comprehensive mathematical framework for the iQuad WFS, including its forward models and linearizations based on the Fréchet derivative. We reveal a connection between the iQuad WFS and the 2d finite Hilbert transform and demonstrate that the linear iQuad WFS operator is self-adjoint - a unique property among Fourier-type WFSs. Additionally, we introduce the double iQuad WFS, a two-path configuration that combines two rotated iQuad WFSs. This design addresses the limitations of the single iQuad WFS by suppressing poorly-seen phase components. Moreover, the double setup simplifies the mathematical modeling. We also highlight iQuad similarities to the widely used pyramid wavefront sensor (PWFS). Finally, we extend the concept of modulation to the iQuad WFS, further enhancing its versatility. The theoretical analysis presented here lays the groundwork for the development of fast and robust model-based wavefront reconstruction algorithms for the iQuad WFS, paving the way for future applications in AO instruments.
Read the full abstract

All authors Victoria Laidlaw, Olivier Fauvarque, Alfred Miksch, Benoit Neichel, Ronny Ramlau

Complex Variables

Condensed Mathematics and Complex Geometry

This is a slightly revised version of lectures notes for a course in Summer 2022 joint between Bonn and Copenhagen, intended as a stable citable version. The goal of this course is to make our general approach to analytic geometry via condensed mathematics more concrete by concentrating on the case of complex-analytic geometry. Instead of trying to develop new kinds of geometry, here we only try to redevelop the classical theory from a different point of view. More precisely, we reprove some important theorems for compact complex manifolds, including finiteness of coherent cohomology, Serre duality, GAGA and (Grothendieck–)Hirzebruch–Riemann–Roch.
Read the full abstract

Dynamical Systems

Spectral Sensitivity of Directed Weighted Networks: Why Weakening Edges May Trigger Synchronization

Synchronization in dynamical systems on directed weighted networks is often associated with stronger coupling and denser interactions. This paper shows that the opposite can also occur: weakening selected edges may increase the generalized algebraic connectivity, denoted by $\kappa$, and in some nonlinear systems this spectral improvement is accompanied by a transition from nonsynchronization to synchronization. To explain this effect, we develop a perturbation-based spectral sensitivity framework for directed weighted networks. We derive an explicit first-order formula for the response of $\kappa$ to edge-weight perturbations and show that it decomposes into a directed cut-energy term and a stationary redistribution term. This decomposition clarifies how asymmetric flow structure and invariant-mass redistribution jointly determine the synchronization role of each edge. Based on this theory, we design sensitivity-guided algorithms for edge weakening, edge deletion, negative-edge insertion, and edge strengthening. Experiments on synthetic and real networks show that these methods identify critical edges whose modification yields substantial gains in $\kappa$. Simulations of first- and second-order nonlinear consensus dynamics further show markedly faster convergence and, in some cases, a transition from incoherence to synchronization. The results provide a local spectral mechanism by which reducing or reallocating coupling can enhance synchronization-related performance.
Read the full abstract

All authors Xinyu Wu, Xizhi Liu, Chenyao Zhang, Tianping Chen, Wenlian Lu

Mathematical Physics

A Feynman-Kac Formula for the Subcritical Ultraviolet-Renormalized Spin Boson Model

We prove a Feynman-Kac formula (FKF) for the self-energy renormalized spin boson Hamiltonian, describing a two-state quantum system linearly coupled to a bosonic quantum field. Similar to recent FKFs for the Fröhlich polaron and the non- and semi-relativistic Nelson models, it yields a probabilistic treatment of the spin as a jump process, but treats the field on the usual bosonic Fock space. As an application, we prove that the existence of ground states for infrared-regular models persists the removal of an ultraviolet cutoff.
Read the full abstract

Numerical Analysis

A stabilized dual-SAV parametric finite element framework for constrained planar geometric flows with mesh regularization

Parametric finite element discretizations of constrained geometric flows must simultaneously address high-order geometric stiffness, mesh degeneration, and nonlinear global constraints. This paper develops a stabilized dual-SAV (scalar auxiliary variable) parametric finite element framework for planar closed curves. The proposed formulation introduces separate auxiliary variables for the physical geometric energy and for an artificial mesh regularization energy. The mesh regularization is coupled only to tangential motion by projecting out its normal variation, so that mesh redistribution changes the parametrization without introducing an artificial normal driving force. Based on this dual-energy structure, we construct a semi-implicit frozen-metric scheme with zero-order stabilization. The scheme leads to linear spatial response problems and satisfies discrete dissipation estimates for the modified geometric and mesh SAV energies. Nonlinear global constraints are handled by an algebraic block reduction: after solving a small number of symmetric positive-definite response problems, the remaining nonlinear system involves only the geometric auxiliary variable and the Lagrange multipliers. For $K$ global constraints, this reduced nonlinear system has dimension $K+1$; in particular, simultaneous area and length constraints lead to a three-dimensional nonlinear system, independently of the number of mesh vertices. Numerical experiments for curve shortening, area-preserving curve shortening, curve diffusion, and Helfrich-type flows illustrate the modified-energy dissipation, the enforcement of geometric constraints, and the improvement of mesh quality for both second- and fourth-order examples.
Read the full abstract

Mathematical Physics · Cross-listed from nlin.AO

The role of asymmetric time delay and its structure in 1D swarmalators

Swarmalators are a class of coupled oscillators that simultaneously synchronize in both space and phase, providing a minimal model for systems ranging from biological microswimmers to robotic swarms. Time delay is ubiquitous in such systems, arising from finite signal propagation speeds and sensory processing lags, yet its structural form, whether symmetric or asymmetric, has received little attention. Here, we study a one-dimensional swarmalator model with asymmetric time delay, in which the delay enters only the self-interaction terms of the spatial and phase dynamics, breaking the symmetry assumed in prior work. We identify various collective states such as async, static phase wave, static {\pi}, and active {\pi}, and derive analytical stability boundaries for each as a function of the coupling parameters and delay. Our analysis reveals that the asymmetric delay structure fundamentally reshapes the collective phase diagram: in particular, for the asymmetric delay models, increasing the delay systematically expands the active {\pi} state at the expense of other ordered states, in contrast to the symmetric delay model, which more strongly promotes the presence of unsteady states that are generally not well ordered. By providing closed-form stability conditions validated against numerical simulations, our work establishes that the internal structure of the delay, not merely its magnitude, is a decisive factor in determining the emergent collective behavior of swarmalator populations.
Read the full abstract

Operator Algebras

Relative Kubo-Ando Means of Completely Positive Maps

We develop a Kubo–Ando theory on order intervals of completely positive maps. Using Arveson's Radon–Nikodym theorem as a structural tool, we define relative Kubo–Ando means \(\Phi\sigma_\Omega\Psi\) for completely positive maps dominated by a common ambient map \(\Omega\). The special choice \(\Omega=\Phi+\Psi\) yields an intrinsic mean of two completely positive maps. We prove that these means are independent of the chosen Stinespring representation and satisfy the expected order-theoretic properties, including monotonicity, transformer inequalities, Jensen-type inequalities, data processing, and monotonicity with respect to the ambient map. For the geometric mean, we obtain a block-positivity characterization and show that the intrinsic geometric mean vanishes exactly when the two maps have no nonzero common completely positive submap. Finally, we compare the construction with existing finite-dimensional and form-theoretic approaches: for maps between matrix algebras it agrees with the Choi-matrix mean, and in the geometric case it agrees with Okayasu's Pusz–Woronowicz mean on their common domain.
Read the full abstract

Numerical Analysis

A novel energy-conservation Crank-Nicolson finite element method for generalized Klein-Gordon-Zakharov equations

This article focuses on an energy-conservation Galerkin finite element method (FEM) for the generalized Klein-Gordon-Zakharov (KGZ) equations. This method combines the bilinear finite element method for spatial discretization with the Crank-Nicolson (CN) scheme for temporal discretization, thereby guaranteeing exact conservation of the discrete energy functional. A rigorous theoretical analysis is devoted to deriving error bounds for the fast-time-scale electronic field $u$ and the ion density deviation $\varphi$. By systematically integrating interpolation estimates, Ritz projection, and a postprocessing technique, the superclose error estimates and global superconvergence are established for $u$ in the $H^1$-norm, even under weakened regularity assumptions on the exact solution. Concurrently, we prove $H^1$-norm superconvergence for the auxiliary variable $\phi$ ($-\Delta\phi = \varphi_t$) and optimal-order $L^2$-norm error estimates for the auxiliary variable $p$ ($p=u_t$) and $\varphi$. Numerical examples are provided to confirm theoretical results.
Read the full abstract

All authors Xuemiao Xu, Maosheng Jiang, Jiansong Zhang, Jiang Zhu

Probability · Cross-listed from cs.LG

Partial Model Sharing Improves Byzantine Resilience in Federated Conformal Prediction

We propose a Byzantine-resilient federated conformal prediction (FCP) method that leverages partial model sharing, where only a subset of model parameters is exchanged each round. Unlike existing robust FCP approaches that primarily harden the calibration stage, our method protects both the federated training and conformal calibration phases. During training, partial sharing inherently restricts the attack surface and attenuates poisoned updates while reducing communication. During calibration, clients compress their non-conformity scores into histogram-based characterization vectors, enabling the server to detect Byzantine clients via distance-based maliciousness scores and to estimate the conformal quantile using only benign contributors. Experiments across diverse Byzantine attack scenarios show that the proposed method achieves closer-to-nominal coverage with substantially tighter prediction intervals than standard FCP, establishing a robust and communication-efficient approach to federated uncertainty quantification.
Read the full abstract

History and Overview of Mathematics

Diverse yet consistent: How mathematicians position computational thinking across research and teaching

Recent research in mathematics education points to an "epistemic clash" when programming and computational thinking (CT) are leveraged alongside more established forms of mathematical thinking (MT). The emergence of generative AI emphasises the need to understand the mechanisms shaping relations between CT and MT. We address this need by analysing interviews with 15 mathematicians on their use of computations across their teaching and research activities. The interviews were conducted at a critical site with a history of integrating computations across its science and mathematics programs for more than 20 years. Drawing on Cultural Historical Activity Theory and Communities of Practice theory, we consider MT and CT as methodologies grounded in practice. We identify three perspectives shaping how mathematicians position CT: mathematical theory considered as a source of control, computations as a source of pragmatic reach, and real-world impact as a source of legitimacy. This three-perspectives model explains why mathematicians who emphasise real-world impact are most likely to carry programming into teaching, whereas those who position theoretical mathematics as authoritative are least likely to do so. Mathematicians working on numerical algorithms occupy an uneasy intermediate position. Our findings suggest that the perceived clash between MT and CT is not purely epistemic, but also ontological, as it depends on how computations are positioned within the goal of doing mathematics. For mathematics education, this implies that perceived meaningful integration with CT is mediated by context, and that more extensive use can be stabilised by leveraging authentic learning goals external to mathematics.
Read the full abstract

Statistics Theory

Bayesian and Empirical Bayesian Bootstrapping

Let $X_1,\ldots,X_n$ be a random sample from an unknown probability distribution $P$ on the sample space ${\cal X}$, and let $\theta=\theta(P)$ be a parameter of interest. The present paper proposes a nonparametric `Bayesian bootstrap' method of obtaining Bayes estimates and Bayesian confidence limits for $\theta$. It uses a simple simulation technique to numerically approximate the exact posterior distribution of $\theta$ using a (non-degenerate) Dirichlet process prior for $P$. Asymptotic arguments are given which justify the use of the Bayesian bootstrap for any smooth functional $\theta(P)$. When the prior is fixed and the sample size grows five approaches become first-order equivalent: the exact Bayesian, the Bayesian bootstrap, Rubin's degenerate-prior bootstrap, Efron's bootstrap, and the classical one using delta methods. The Bayesian bootstrap method is also extended to the semiparametric regression case. A separate section treats similar ideas for censored data and for more general hazard rate models, where a connection is made to a `weird bootstrap' proposed by Gill. Finally empirical Bayesian versions of the procedure are discussed, where suitable parameters of the Dirichlet process prior are inferred from data. Our results lend Bayesian support to the classic Efron bootstrap. It is the Bayesian bootstrap under a noninformative reference prior; it is a limit of natural approximations to good Bayes solutions; it is an approximation to a natural empirical Bayesian strategy; and the formally incorrect reading of a bootstrap histogram as a posterior distribution for the parameter isn't so incorrect after all.
Read the full abstract

2605.11677 · 12 May · 24 pages, no figures. Statistical Research Report, Department of Mathematics, University of Oslo, May 1991; this version arXiv'd May 2026, for broader visibility. Biometrika expressed positive interest, and invited a revision, but somehow the author did not use that opportunity

Dynamical Systems

Local height arguments toward the dynamical Mordell-Lang conjecture

We consider regular endomorphisms of the complex affine space with a degree gap $k$. They are endomorphisms $f$ of $\mathbb{A}_{\mathbb{C}}^{N}$ of the form $f(x_1,\dots,x_N)=(f_1(x_1,\dots,x_N)+g_1(x_1,\dots,x_N),\dots,f_N(x_1,\dots,x_N)+g_N(x_1,\dots,x_N))$, in which $f_1,\dots,f_N$ are homogeneous polynomials of degree $d$ with no nonzero common zeros and $g_1,\dots,g_N$ are polynomials of degree $\leq d-k$. Such an endomorphism extends to an endomorphism of $\mathbb{P}_{\mathbb{C}}^{N}$. Let $H_{\infty}=\mathbb{P}_{\mathbb{C}}^{N}\setminus\mathbb{A}_{\mathbb{C}}^{N}$ be the infinity hyperplane and we denote $f_{\infty}$ as the induced endomorphism of $H_{\infty}$. Suppose that $k$ is twice greater than the multiplicities of $f_{\infty}$ at the periodic closed points, i.e. $k>2\max\limits_{P\in\mathrm{Per}(f_\infty)}e_{f_{\infty}}(P)$. Then we prove that $f$ satisfies the dynamical Mordell-Lang conjecture for curves. As a by-product of our proof, we show that in this case every periodic curve of $f$ is a "vertical line", i.e. a straight line passing through the origin. There are many examples which satisfy our condition $k>2\max\limits_{P\in\mathrm{Per}(f_\infty)}e_{f_{\infty}}(P)$. Indeed, we prove that for every $d\geq2$, a general endomorphism $f_{\infty}$ of $H_{\infty}\cong\mathbb{P}_{\mathbb{C}}^{N-1}$ of degree $d$ satisfies $\max\limits_{P\in H_{\infty}(\mathbb{C})}e_{f_{\infty}}(P)\leq(N-1)!\cdot2^{N-1}$. So if we take $k=(N-1)!\cdot2^N+1$, then $f$ will satisfy our condition if $f_{\infty}$ is general (of an arbitrary degree $d\geq k$). Moreover, we provide examples to illustrate that this condition is optimal to force every periodic curve to be a vertical line, in the sense that one cannot change "$>$" into "$\geq$".
Read the full abstract

Combinatorics

An improved upper bound on the oriented diameter of graphs with diameter $4$

Let $f(d)$ be the smallest value for which every bridgeless graph $G$ with diameter $d$ admits a strong orientation $\overrightarrow{G}$ such that the diameter of $\overrightarrow{G}$ is at most $f(d)$. Chvátal and Thomassen (JCTB, 1978) established general bounds for $f(d)$, and also proved that $f(2)=6$ and $f(4)\geq 12$. The works of both Kwok, Liu and West (JCTB, 2010) and Wang and Chen (JCTB, 2022) together determined $f(3)=9$. In this paper, we improve the best known upper bound for $f(4)$ from $21$ (Babu et al., DAM, 2021) to \textbf{$18$}.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Stepped Frequency Division Multiplexing: A Jump-Free Continuous-Time AFDM Waveform

Affine frequency division multiplexing (AFDM) has emerged as a promising modulation scheme for doubly selective channels, but its canonical continuous-time realization, referred to herein as piecewise continuous AFDM (PC-AFDM), has been observed to exhibit high out-of-band emission (OOBE) whose mechanism has not been analytically characterized. This paper shows that the underlying cause is frequency wrapping, which introduces internal envelope jumps between AFDM sampling instants and generates a high-frequency spectral tail distinct from ordinary block truncation. To eliminate these discontinuities without altering the inverse discrete affine Fourier transform (IDAFT) output sequence, we propose stepped frequency division multiplexing (SFDM). In SFDM, the instantaneous frequency is kept constant at the midpoint of the wrapped chirp within each sampling interval, while the phase is continuously accumulated across interval boundaries. We prove that, under continuous phase accumulation and without additional phase correction, the midpoint choice is the unique sample-preserving choice for arbitrary chirp-rate parameter. The resulting waveform is continuous within each AFDM block, reduces OOBE, and preserves the standard AFDM modulation matrix, guard-interval structure, and receiver processing. Moreover, under fractional-delay propagation, SFDM mitigates the receiver sensitivity that arises when delayed sampling points fall near wrapping-induced discontinuities in PC-AFDM. Numerical results verify the theoretical tail coefficients, demonstrate OOBE reduction, and show improved receiver robustness in the high-percentile and worst-case regimes. These findings establish SFDM as a spectrally cleaner and more reliable physical layer for AFDM systems.
Read the full abstract

Probability

A Counterexample to the Gaussian Completely Monotone Conjecture

We provide an explicit probability measure on $\mathbb{R}$ for which the fifth time derivative of the entropy along the heat flow is positive at some time. This disproves the Gaussian completely monotone (GCM) conjecture (Cheng-Geng '15) and therefore also the Gaussian optimality conjecture (McKean '66) and the entropy power conjecture (Toscani '15). Our proof also implies the existence of a log-concave probability measure on $\mathbb{R}$ for which the GCM conjecture fails at some order. The explicit counterexample was found by GPT-5.5 Pro.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.mes-hall

Algebra of free fermions: Classifying spaces, Hamiltonians, and computation

Research on topological phases of matter is a core field in modern condensed matter physics. Free fermion systems, such as topological insulators and superconductors, have been studied using the "Tenfold Way" and K-theory. Building on Kitaev's idea of $\Omega$-spectrum and classifying space, as well as Freed-Moore's K-theory, this work demonstrates that free fermionic systems form a genuine $G$-$\Omega$-spectrum and clarifies its connection to several distinct classification schemes appearing in the physical literature. By introducing the $\mathbb{Z}_2$-graded algebra $A_{\mathrm{sym}}^V$, the classification problem for systems with general symmetries, including antilinear symmetries, antisymmetries, projective representations, and point group symmetries, is turned into an extension problem in representation theory. To solve this, a computational method for the $\mathbb{Z}_2$-graded Wedderburn-Artin decomposition of $A_{\mathrm{sym}}^V$ is developed. This decomposition not only yields a classification but also enables the explicit construction of the corresponding Dirac Hamiltonian. Furthermore, a GAP programming package has been developed to automate these calculations.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces

We study posterior contraction rates for sparse Bayesian Kolmogorov-Arnold networks (KANs) over anisotropic Besov spaces, providing a statistical foundation for KANs from a Bayesian point of view. We show that sparse Bayesian KANs equipped with spike-and-slab-type sparsity priors attain a near-minimax posterior contraction rate. In particular, the contraction rate depends on the intrinsic anisotropic smoothness of the underlying function. Moreover, by placing a hyperprior on a single model-size parameter, the resulting posterior adapts to unknown anisotropic smoothness and still achieves the corresponding near-minimax rate. A distinctive feature of our results, compared with those for standard multilayer perceptrons, is that the KAN depth can be kept fixed: owing to the expressive power of learnable spline edge functions, the required approximation complexity is controlled through the network width, the range and size of the spline grid, and parameter sparsity. Our analysis develops theoretical tools tailored to sparse spline-edge architectures, including approximation and complexity bounds for Bayesian KANs. We then extend to compositional Besov spaces and show that the contraction rates depend on layerwise smoothness and effective dimension of the underlying compositional structure, thereby effectively avoiding the curse of dimensionality. Together, these results advance the theoretical understanding of Bayesian neural networks and establish rigorous Bayesian guarantees for KANs.
Read the full abstract

All authors Jeunghun Oh, Jaeyong Lee, Lizhen Lin, Kyeongwon Lee

Information Theory

Schur Products of Constacyclic Codes via the Constacyclic Discrete Fourier Transform

This paper investigates the Schur product of constacyclic codes via the constacyclic discrete Fourier transform (DFT). We first characterize key properties of the constacyclic DFT, highlighting its differences from the ordinary DFT. We then extend the concept of degenerate cyclic codes to constacyclic codes possessing a nontrivial pattern polynomial, thereby facilitating the analysis of their dimension sequences. Building on these tools, we generalize two established methods for computing the square of cyclic codes to compute the Schur product of arbitrary constacyclic codes. Finally, exploiting the inherent combinatorial structure, we derive properties of the Schur product dimension directly from additive combinatorics.
Read the full abstract

Differential Geometry

Homothetical surfaces with constant mean curvature in hyperbolic space

We classify all homothetical surfaces with constant mean curvature $H$ in the hyperbolic space $\mathbb{H}^3$. Using the upper half-space model with standard coordinates $(x,y,z)$, these surfaces are defined by the relation $z = \phi(x)\psi(y)$, where $\phi$ and $\psi$ are smooth functions of one variable. We demonstrate that any such surface is necessarily parabolic, meaning that either $\phi$ or $\psi$ is a constant function. Our results cover the minimal case ($H=0$), the case $H^2 \neq 1$, and the critical case $H^2=1$, thereby extending the existing classification of parabolic surfaces in hyperbolic space.
Read the full abstract

Differential Geometry

Circles-foliated stationary surfaces of the Dirichlet energy

In Euclidean space we study surfaces with constant anisotropic mean curvature $\Lambda$ of the Dirichlet energy $\int_\Omega( |Du|^2+\Lambda u)$. We prove the existence of non-rotational surfaces with $\Lambda=0$ and foliated by a one-parameter family of circles contained in horizontal planes obtaining a geometric description of them. These surfaces extend the known Riemann examples of the theory of minimal surfaces to the anisotropic context of the Dirichlet energy. More general, we classify all surfaces with zero anisotropic mean curvature foliated by circles proving that either the surface is axially symmetric about the $z$-axis or the surface belongs to one of the above examples. We also study the case that the anisotropic mean curvature is a non-zero constant.
Read the full abstract

Analysis of PDEs

Dependence of the nonlinear Schrödinger flow upon the nonlinearity

We consider the defocusing nonlinear Schrödinger equation in the energy-subcritical case, and investigate the dependence of the solution upon the power of the nonlinearity. Special attention is paid to the global in time description. The main three aspects addressed, in the decreasing order of difficulty, are the limit when the total power tends to one, along with the connection with the logarithmic Schrödinger equation, the description when long range effects may be present, and the continuity of the scattering operator in the short range case. This text resumes the presentation given by the first author at École polytechnique for the Laurent Schwartz seminar, in May 2026.
Read the full abstract

Analysis of PDEs

The Newton's problem assuming non-constant density of the fluid

This paper investigates the Newton's problem of minimal resistance for a body moving through a fluid whose density decreases exponentially with altitude. We prove the local existence and regularity of radial solutions $u(r)$ satisfying the initial conditions $u(0)=u'(0)=0$ using a fixed-point theorem. We show that the maximal domain of the solution is finite, $[0, r_M)$, terminating at a critical slope $u'(r_M) = \frac{1}{\sqrt{3}}$.
Read the full abstract

Statistics Theory · Cross-listed from physics.ao-ph

Enabling High-Accuracy Data Assimilation with Limited Ensembles via Machine Learning-Based Covariance Correction

Data assimilation (DA) integrates numerical model forecasts with observations to achieve the optimal state estimation. Ensemble-based methods, such as the ensemble Kalman filter (EnKF), are widely used for state estimation for high-dimensional and nonlinear dynamic systems. However, their performance strongly depends on the ensemble size, therefore causing a tradeoff problem between analysis accuracy and computational cost. To address this problem, this study presents a machine learning-based EnKF framework that maintains high accuracy with a relatively small ensemble size. Specifically, a multilayer perceptron (MLP) function is built to predict the difference between the forecast error covariances estimated from a limited ensemble and a sufficiently large ensemble, with the latter being assumed to be an accurate approximation of the underlying truth. This predicted covariance difference term is then incorporated into the EnKF algorithm via an element-wise scaling strategy, resulting in an amended forecast covariance matrix that better approximates the true uncertainty level and sequentially produces more accurate analysis results. To demonstrate the feasibility and robustness of the proposed algorithm, we perform a set of numerical experiments with the Lorenz-63 and Lorenz-96 systems under various configurations, and the results consistently indicate that the proposed algorithm can significantly outperform the standard EnKF with the same limited ensemble size, by achieving notably higher analysis accuracy while remaining computationally efficient. This approach provides a practical and feasible pathway to accurate and computationally efficient data assimilation for high-dimensional and nonlinear dynamic systems.
Read the full abstract

All authors Zhou Yao, Zhilin Li, Li Zhao, Zeng Liu, Zhaokuan Lu, Seungnam Kim, Guangyao Wang

Optimization and Control

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization

We propose a regularized proximal quasi-Newton method (RPQN) for minimizing the sum of a continuously differentiable, possibly nonconvex function and a proper, lower semicontinuous, prox-bounded, possibly nonconvex regularizer. The method uses adaptive quadratic regularization and limited-memory quasi-Newton models. We establish global convergence under weak assumptions, without requiring global Lipschitz continuity of the gradient, and prove convergence of the entire sequence, with rates, under the Kurdyka-Lojasiewicz property. To solve the proximal subproblems efficiently, we exploit compact limited-memory representations and derive a compact representation of the Kleinmichel rank-one update, which preserves positive definiteness under the same condition as BFGS. Numerical experiments on logistic and Student's regression demonstrate competitive performance and the effectiveness of the proposed approach.
Read the full abstract

Information Theory

Performance of QUBO-Formulated MIMO Detection Under Hardware Precision Constraints

The evolution of multiple-input, multiple-output (MIMO) systems requires the efficient detection algorithms to overcome the exponential computational complexity of optimal maximum likelihood detection. Reformulating MIMO detection as a quadratic unconstrained binary optimization (QUBO) problem enables the use of highly parallel, physics-inspired, hardware-accelerated solvers and non-von Neumann architectures. However, embedding continuous-valued QUBO coefficients into hardware introduces quantization noise due to finite precision, which can severely degrade detection accuracy. This paper presents a rigorous analysis of the performance impact of finite-precision, hardware-accelerated QUBO solvers in MIMO detection. We analytically derive the probability distribution functions of the QUBO matrix entries and introduce novel homogeneous and heterogeneous quantization schemes based on either instantaneous channel state information or its statistical features. We further derive a sufficient condition on the precision required to maintain the optimal solution after quantization. Extensive numerical experiments, across various MIMO system sizes and modulation orders (up to 256-QAM), show that heterogeneous quantization matches the full-precision baseline bit error rate using significantly fewer bits than homogeneous approaches. We provide hardware-aware guidelines for selecting the optimal quantization strategy.
Read the full abstract

All authors Seyedkhashayar Hashemi, Elisabetta Valiante, Ignacio Rozada, Moslem Noori

Analysis of PDEs

Moving localized observations and Cesàro asymptotic observability for conservative PDEs

We develop a deterministic large-time mechanism yielding Cesàro asymptotic observability inequalities from moving localized observations for conservative evolutions. On each observation interval, exact convexification on a compact measured homogeneous space replaces full observation on the whole observation manifold by a finite convex combination of translates of one prototype subset. A switching realization theorem then turns that static design into a genuinely moving observer, while a Hilbertian tail-reduction proposition shows that interval estimates proved only on growing spectral windows still recover the full conserved energy after Cesàro averaging. The resulting design-to-observability chain applies to interior observations for wave, Klein-Gordon, and Schrödinger equations on compact measured homogeneous manifolds, to moving boundary caps on the Euclidean ball, and to a singular almost-separated gas-giant boundary model. The framework is especially relevant when each instantaneous observation set is too small for one to expect a finite-time GCC or time-dependent GCC statement.
Read the full abstract

Optimization and Control

Boundary observability for gas giant metrics

We study the observability of waves on gas giant manifolds which are a class of Riemannian manifolds whose metrics are singular at the boundary. Such manifolds arise naturally in modeling of acoustic wave propagation in gas giant planets.We establish an observability inequality using full boundary measurements given by a Neumann-type trace that is natural in the gas giant setting. The proof proceeds in two steps. First, observability for a general gas giant metric is reduced to the so-called separable case via a perturbation argument. In the separable case, we employ a uniform-in-tangential-frequency analysis combined with an Ingham inequality to prove observability.
Read the full abstract