Numerical Analysis
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Thursday 2 April
This paper addresses the local recovery of conservative fluxes and the a posteriori error analysis for an elliptic interface problem with discontinuous coefficients. The transmission conditions on the interface are imposed by means of Nitsche's method and the discretization is carried out using conforming finite elements on unfitted meshes via the CutFEM method. A flux is subsequently defined in the global Raviart-Thomas space, ensuring that it satisfies the natural conservation property on the cut cells, and is then employed in the a posteriori error analysis. We prove here the sharp reliability of the error estimator and show a numerical experiment which illustrates the approach.
Optimization and Control
Safe Control of Feedback-Interconnected Systems via Singular Perturbations
Control Barrier Functions (CBFs) have emerged as a powerful tool in the design of safety-critical controllers for nonlinear systems. In modern applications, complex systems often involve the feedback interconnection of subsystems evolving at different timescales, e.g., two parts from different physical domains (such as the electrical and mechanical parts of robotic systems) or a physical plant and an (optimization or control) algorithm. In these scenarios, safety constraints often involve only a portion of the overall system. Inspired by singular perturbations for stability analysis, we develop a formal procedure to lift a safety certificate designed on a reduced-order model to the overall feedback-interconnected system. Specifically, we show that under a sufficient timescale separation between slow and fast dynamics, a composite CBF can be designed to certify the forward invariance of the safe set for the interconnected system. As a result, the online safety filter only needs to be solved for the lower-dimensional, reduced-order model. We numerically test the proposed approach on: (i) a robotic arm with joint motor dynamics, and (ii) a physical plant driven by an optimization algorithm.
Read the full abstract
Probability
Realisation of constraints in underdamped Langevin dynamics
This article deals with the realisation of constraints in underdamped Langevin dynamics via soft-constrained dynamics. Specifically, we study systems with a large (or small) parameter that controls the constraint mechanisms, e.g. the strength of confinement forces, mass or friction coefficients, and we derive quantitative convergence results for both the constrained variables and the softly constrained dynamics on the limiting subspace. The latter can be either a spatial or a momentum or velocity subspace, depending on the underlying soft constraint mechanism; in this paper we treat only holonomic constraints, i.e. all momentum- or velocity-level constraints are integrable. We explicitly include the initial conditions so that it is clear whether they must satisfy the constraint or not in order to realise the desired constrained dynamics. We discuss the implications of these results as well as questions related to the sampling of the corresponding conditional probability measures.
Read the full abstract
Numerical Analysis
Compact Runge-Kutta flux reconstruction methods with entropy and/or kinetic energy preserving fluxes
Compact Runge-Kutta (cRK) methods are a class of high order methods for solving hyperbolic conservation laws characterized by their compact stencil including only immediate neighboring finite elements. A Compact Runge-Kutta flux reconstruction (cRKFR) method for solver hyperbolic conservation laws was introduced in [Babbar, A., Chen, Q., Journal of Scientific Computing, 2025] which uses a time average flux formulation to perform evolution using a single numerical flux computation at each step, making it a single stage method. Entropy or kinetic energy preserving numerical fluxes are often used for construction of high order entropy stable or kinetic energy preserving methods for hyperbolic conservation laws, and are known to enhance the robustness of numerical methods for under-resolved simulations. In this work, we show how these fluxes can be incorporated into the cRKFR framework for general hyperbolic equations that consist of fluxes and non-conservative products. We test the effectiveness of this new class of methods through numerical experiments for the compressible Euler equations, magnetohydronamics (MHD) equations and multi-ion MHD equations. It is observed that the application of entropy or kinetic energy preserving fluxes enhances the robustness of the cRKFR methods.
Read the full abstract
Numerical Analysis
Variationally mimetic operator network approach to transient viscous flows
The Variationally Mimetic Operator Network (VarMiON) approach is a machine learning technique, originally developed to predict the solution of elliptic differential problems, that combines operator networks with a structure inherited from the variational formulation of the equations. We investigate the capabilities of this method in the context of viscous flows, by extending its formulation to vector-valued unknown fields and with a particular emphasis on the space-time approximation context necessary to deal with transient flows. As a first step, we restrict attention to the regime of low-to-moderate Reynolds numbers, in which the Navier–Stokes equations can be linearized to give the time-dependent Stokes problem for incompressible fluids. The details of the method as well as its performance are illustrated in three paradigmatic flow geometries where we obtain a very good agreement between the VarMiON predictions and reference finite-element solutions.
Read the full abstract
Operator Algebras
The Bures metric and the quantum metric on the density space of a C*-algebra: the non-unital case
Building off work of Farenick and Rahaman, we extend the definition of the density space and the Bures metric to the setting of non-unital C*-algebras equipped with a faithful trace and prove that the Bures metric is also a metric in this case and show that its topology is weaker than the topology induced by the C*-norm. Furthermore, we prove a Heine-Borel type theorem for C*-algebras and the density space. In particular, we prove that for any C*-algebra (unital or non-unital) equipped with a faithful trace, the density space equipped with the Bures metric topology is not compact if and only if the C*-algebra is infinite dimensional. We also exhibit several examples of sequences that have no converging sequence in the unital and non-unital case including both commutative and noncommutative C*-algebras. Next, building off work from some of the authors, we extend the definition of the quantum metric on the density space to the non-unital C*-algebra case by introducing the notion of a quantum Lipschitz triple, which form a subclass of quantum locally compact metric spaces of Latrémolière that utilize Rieffel's notion of a quantum metric (we also introduce new classes of quantum locally compact metric spaces that include certain noncommutative homogeneous C*-algebras). Furthermore, we prove that this quantum metric topology is weaker than the topology of the one induced by the C*-norm and finish the article with an analysis of matrix-valued functions on the quantized interval, which provides commutative and noncommuataive examples where the quantum metric topology on the density space is not compact and is not uniformly equivalent to both the Bures metric and the metric induced by the C*-norm.
Read the full abstract
Combinatorics
Complete Resolution of the Butler-Costello-Graham Conjecture on Monochromatic Constellations
A constellation pattern is a finite increasing rational sequence \(Q=[0=q_0<q_1<\cdots<q_k=1]\), and a \(Q\)-constellation in \([n]\) is obtained by scaling and translating a rational pattern $Q$, with key examples including arithmetic progressions. In 2010, Butler, Costello, and Graham proposed a conjecture, that is, for any constellation pattern $Q$ there is a coloring pattern of $[n]$ that has $\gamma n^2+o\left(n^2\right)$ monochromatic constellations, where $\gamma$ is smaller than the coefficient for a random coloring. In this paper, we confirm this conjecture. As applications of this conjecture, we obtain interval-uncommon translation-invariant linear systems associated with rational constellations and a ground-state bound for deterministic arithmetic hypergraph spin systems.
Read the full abstract
Analysis of PDEs · Cross-listed from gr-qc
Localized formation of quiescent big bang singularities
We prove a localized big bang formation result, which does not require proximity of the initial data to any background solution. Suppose that we are given initial data for the Einstein–nonlinear scalar field equations on an open set $U \subset \mathbb{R}^3$. We identify a general condition on the initial data such that if the condition is satisfied in a large enough neighborhood of $x \in U$, then the corresponding maximal globally hyperbolic development has a local quiescent big bang singularity with curvature blow up to the past of $x$. We achieve the localization by introducing a new kind of foliation by spacelike hypersurfaces, given by the level sets of a time function satisfying a certain second order differential equation. This time function allows us to synchronize the singularity while at the same time yielding a symmetric hyperbolic formulation of Einstein's equations. Our new formulation also has two key advantages over previous localized big bang stability results. First, it is independent of the matter model, so it is possible that it could be used to prove big bang formation with matter models different from a scalar field. And second, it allows us to conclude that our solutions induce geometric initial data on the singularity, thus giving a complete description of the asymptotics towards the big bang.
Read the full abstract
Analysis of PDEs
A Mean-Field Game Model For Large-Scale Attrition in Attacker-Defender Systems
This paper proposes a novel Mean-Field Game (MFG) framework for large-scale attacker-defender systems aimed at protecting one or multiple High-Value Units (HVUs). Motivated by classical agent-wise attrition models, we introduce a population-wise attrition mechanism formulated by statistical distance between populations, enabling a macroscopic description of weapon-based interactions between large populations. Leveraging this and Lions derivative on the space of probability measures, we derive the associated MFG system, which characterizes optimal strategies and the evolution of population distributions in attacker-defender interactions. We analyze the model by establishing upper and lower bounds on the defender density, ensuring physical consistency by preventing concentration and depletion. For numerical investigation, we develop a numerical scheme combining physics-informed neural networks with Sinkhorn method to solve attacker-defender MFG system. Simulations confirm the effectiveness of the framework and reveal key insights, including sensitivity to weapon strengths and population dispersion.
Read the full abstract
Geometric Topology
The prime decomposition fibre sequence for moduli spaces of reducible 3-manifolds
We study the moduli space $B\textrm{Diff}^+(M)$, for $M$ a reducible, oriented 3-manifold with irreducible prime factors $P_1,\ldots,P_n$. A programme of César de Sá-Rourke, Hendriks-Laudenbach, and Hendriks-McCullough studies the homotopy type of $\textrm{Diff}^+(M)$ in terms of the $\textrm{Diff}^+(P_i)$. Inspired by a delooping proposed by Hatcher, we construct a map from $B\textrm{Diff}^+(M)$ to $B\textrm{Diff}^+(P_1 \sqcup \dots \sqcup P_n)$, called the splitting map, that yields a prime decomposition fibre sequence. The fibre $H_g(P_1, \dots, P_n)$ is a space of $1$-handle attachments which we describe geometrically as a homotopy colimit of certain configuration spaces on the $P_i$. Firstly, this allows us to show that for $n>0$ the fibre is equivalent to a finite, connected cell complex. Secondly, this makes the fibre sequence an effective tool for computations, which we illustrate by computing the rational cohomology ring of $B\textrm{Diff}^+\!\left((S^1\times S^2)^{\sharp 2}\right)$.
Read the full abstract
Statistics Theory
Importance sampling for Bayesian inference: polynomial-dimension dependent error bounds
Many Bayesian inference problems involve high-dimensional models where the performance of standard importance sampling (IS) methods often degrades rapidly as the dimensionality increases. Classical analyses of IS typically rely on the assumption that observations are arbitrary but fixed (i.e., deterministic), thereby neglecting the probabilistic structure that the Bayesian model induces on the data. In this paper, we adopt the perspective that observations are themselves random variables whose distribution is governed by the underlying model. Within this probabilistic framework, we identify a model-dependent function, referred to as the link function, which connects the fixed- and random-observation formulations. We provide a characterization of the $L^2$ Monte Carlo estimation error: specifically, we show that the $L^2$ error bounds are finite and converge at the standard Monte Carlo rate $O(N^{-1/2})$, for arbitrarily large dimension, if and only if the link function is Bochner integrable. This result reveals the fundamental quantity controlling the approximation error and establishes a mechanism to manage the dependence on the model state dimension. Consequently, our approach provides a principled way to alleviate the challenges of high dimensionality, offering insights that transcend worst-case analyses dominant in the existing literature. Finally, we derive explicit analytical examples of the dimensional scaling of the associated errors for several model classes, including linear-Gaussian systems and models with bounded observation functions.
Read the full abstract
Logic
Bounded Ramsey's theorem for triples in computability theory
We study a restriction of Ramsey's theorem for 2-coloring of triples, in which homogeneous sets for color~1 are of bounded size ($\mathsf{BRT}^3_2$). We prove that the computational content of this statement is very close to Ramsey's theorem for pairs ($\mathsf{RT}^2_2)$, in that it satisfies the same known computability-theoretic upper bounds, but that $\mathsf{BRT}^3_2$ is not computably-reducible to $\mathsf{RT}^2_2$, even when allowing multiple applications of $\mathsf{RT}^2_2$.
Read the full abstract
Dynamical Systems
Local rigidity of self-joinings and factors of pro-nilsystems
It is an immediate consequence of the ergodic structure theorem of Host and Kra that every factor of an ergodic $k$-step pro-nilsystem is again an ergodic $k$-step pro-nilsystem. It has remained open whether this fact can be proved independently of the structure theorem itself. In this note, we give such a proof. The key new ingredient is a local rigidity theorem for nilsystems: any ergodic self-joining sufficiently close to the diagonal joining is necessarily the graph joining of an automorphism. This rigidity result may be of independent interest. As an application, our proof of the factor-closure of pro-nilsystems combined with a result of Tao yields a new proof of the ergodic structure theorem of Host and Kra from the combinatorial inverse theorem of Green, Tao, and Ziegler for the Gowers norms on cyclic groups. We can also use our methods to establish an independent proof of the factor-closure property of topological pro-nilsystems, a fact that can also be derived from the topological structure theorem of Host, Kra, and Maass.
Read the full abstract
Group Theory
A family of groups extending McLain's
Given a strict partial order $\Delta$ on a set $\Lambda$ and an arbitrary ring $R$ with $1\neq 0$, the corresponding McLain group $M(\Delta)$ has been studied in depth. We construct a larger family of McLain groups $G(\Delta)$, where $\Delta$ need be neither asymmetric nor transitive, while satisfying two weaker axioms. Structural properties common to all members~$G(\Delta)$ of this new family are investigated, including a group presentation, a description of the factors of its descending central series, a canonical form for its elements relative to any total order on~$\Delta$, and a recursive determination of its upper central series. In addition, we prove the natural isomorphism $G(\Delta)/G(\Gamma)\cong G(\Delta\setminus\Gamma)$, where $\Gamma$ is a normal subset of $\Delta$, and $G(\Gamma)$ and $G(\Delta\setminus\Gamma)$ are extended McLain groups on their own right. This result has no parallel in the classical context.
Read the full abstract
Combinatorics
On Ramsey number of $K_{2,n}$ versus even cycles
For graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the smallest integer $N$ such that every graph $\Gamma$ on $N$ vertices contains $G$ or its complement $\overline{\Gamma}$ contains $H$ as a subgraph. In graph Ramsey theory, the star-cycle Ramsey number is well-studied throughout the years. Whereas the Ramsey number of $K_{2,n}$ versus cycle is challenging to determine due to increased structural complexity. In this article, we have obtained an exact value of the Ramsey number $R(K_{2,n}, C_{m})$ for even $m\in [n, 2n-4008]$ and $n\geq 4516$. In particular, we show that $$R(K_{1,n}, C_{m})= R(K_{2,n}, C_{m})$$ for all even $m\in [n, 2n-4008]$ and $n\geq 4516$. This leads to an interesting question: For fixed $t$, does there exist $n_0(t)\in \mathbb{N}$ such that $R(K_{1,n}, C_m)=R(K_{t,n}, C_m)$ for all $n \geq n_0(t)$ and for a given range of even $m$?
Read the full abstract
Analysis of PDEs · Cross-listed from gr-qc
Boundedness and decay for the conformal wave equation in Schwarzschild-AdS under dissipative boundary conditions
We study the conformal wave equation $\square_g \psi + \frac{2}{l^2} \psi = 0$ on 4-dimensional Schwarzschild–Anti de Sitter spacetimes under dissipative boundary conditions. We prove boundedness and decay of the non-degenerate energy of $\psi$ at an arbitrary polynomial rate of $(1+v)^{-n}$ provided that we control the (up to) $n$-times $T$-commuted energy. This contrasts with the inverse logarithmic decay obtained under Dirichlet boundary conditions and is in line with the result obtained in the pure Anti-de Sitter case under dissipative boundary conditions. In particular, the decay is not affected by the additional trapping at the photon sphere.
Read the full abstract
Logic
Fischer-Servi logic does not have interpolation
We prove that the Fischer-Servi logic $\mathsf{IK}$ does not have the (Craig) interpolation property. This is obtained by showing that the corresponding class of modal Heyting algebras lacks the amalgamation property. We also generalize this result to some extensions of the Fischer-Servi logic such as $\mathsf{IT}$, $\mathsf{IK4}$, $\mathsf{IS4}$, and $\mathsf{IGL}$.
Read the full abstract
Functional Analysis
Isometric rigidity and Fraïssé properties of Orlicz sequence spaces
We provide an approximate version of a rigidity result by Randrianantoanina: for a large class of Orlicz sequence spaces, almost isometric embeddings almost preserve disjointness. In specific cases, we can even prove that such embeddings almost preserve basic vectors. As a consequence, we prove that some Orlicz sequences spaces are guarded Fraïssé but not $\omega$-categorical; moreover, they do not contain copies of $\ell_2$ and their age is not closed. This answers a question of Cúth-de Rancourt-Doucha.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.mes-hall
Optimal skyrmion stability in antisymmetric ultrathin ferromagnetic bilayers
We demonstrate the stray-field-mediated skyrmion stabilizing capabilities of ultrathin exchange-decoupled antisymmetric ferromagnetic bilayers based on conventional transition metal materials. Using an asymptotically exact micromagnetic model valid in the ultrathin film limit, we show that the antisymmetric tailoring of the bilayer allows the Dzyaloshinskii-Moriya interaction and the dipolar interaction to act synergistically to stabilize skyrmions, in contrast to the monolayer case, in which these energies compete. To obtain optimal stability of these skyrmions against collapse and bursting – the two fundamental processes determining skyrmion lifetime, we carry out an asymptotic analysis of the saddle point solution that separates the skyrmion from the demagnetized state. The result is an optimal stability line for compact skyrmions in the non-dimensional parameter space of the effective Dzyaloshinskii-Moriya interaction strength and the effective film thickness. Our predictions are confirmed by extensive micromagnetic simulations of antisymmetric bilayers, using magnetic parameters of the conventional Pt/Co/AlO$_x$ systems. Our results provide a new pathway for experimental observations of 10 nm radius zero-field skyrmions with lifetimes compatible with information technology applications.
Read the full abstract
Optimization and Control
Fixed-time-stable ODE Representation of Lasso
Lasso problems arise in many areas, including signal processing, machine learning, and control, and are closely connected to sparse coding mechanisms observed in neuroscience. A continuous-time ordinary differential equation (ODE) representation of the Lasso problem not only enables its solution on analog computers but also provides a framework for interpreting neurophysiological phenomena. This article proposes a fixed-time-stable ODE representation of the Lasso problem by first transforming it into a smooth nonnegative quadratic program (QP) and then designing a projection-free Newton-based ODE representation of the Lasso problem by first transforming it into a smooth nonnegative quadratic program (QP) and then designing a projection-free Newton-based fixed-time-stable ODE system for solving the corresponding Karush-Kuhn-Tucker (KKT) conditions. Moreover, the settling time of the ODE is independent of the problem data and can be arbitrarily prescribed. Numerical experiments verify that the trajectory reaches the optimal solution within the prescribed time.
Read the full abstract
Number Theory
The Circle Method for Quadrics over Function Fields
We use the circle method to count $\mathbb{F}_q(t)$-rational points of bounded naive height on a quadric hypersurface $X\subseteq \mathbb{P}^{n-1}$ defined over $\mathbb{F}_q$, provided that $\mathrm{char}(\mathbb{F}_q)>2$ and $n\ge 3$. Viewing these points as morphisms $\mathbb{P}^1 \to X$ of fixed degree, we obtain exact formulas for their number depending on the parity of $n$ and on the determinant of the quadratic form defining $X$, including secondary terms in some cases.
Read the full abstract
Numerical Analysis · Cross-listed from quant-ph
Quantitative Universal Approximation for Noisy Quantum Neural Networks
We prove a quantitative universal approximation theorem for noisy quantum neural networks (QNNs), with explicit non-asymptotic error bounds in terms of the number of accuracy blocks, the qubit count, the number of two-qubit gates, and hardware noise parameters. Motivated by quantitative finance, where target functions are expectations of payoffs, we first extend existing noiseless bounds to expectation functions and derive explicit constants for exponential Levy models, covering the Black-Scholes price of (truncated) European Put options. We then formulate the noisy circuit via quantum channels, obtain a fidelity-based bound for general noise models, and specialise to depolarising noise with readout error, calibrated to real hardware. Finally, we provide a detailed numerical analysis for option pricing in the Black-Scholes model, testing our results on actual noisy quantum hardware.
Read the full abstract
Group Theory
Cross-Commuting Nonabelian Squares in Affine Groups over Finite Commutative Principal Ideal Rings
We study a commutation pattern in which two affine families commute completely across the two families while each family retains internal noncommutativity. For one-dimensional affine groups over finite commutative rings, we prove a local-product dichotomy. Over a finite commutative local principal ideal ring, the common centralizer of two noncommuting affine permutations is always abelian, so the pattern is impossible. Over a direct product of two commutative rings whose affine groups each contain a noncommuting pair, the same pattern is constructed by separating the two noncommuting families into different factors. More generally, over a finite commutative principal ideal ring, the pattern exists if and only if at least two local factors are not isomorphic to $\mathbb{F}_2$. Applied to residue rings, this yields an exact classification: $\mathrm{AGL}_1(\mathbb{Z} / n \mathbb{Z})$ contains the pattern if and only if at least two prime-power factors of $n$ exceed 2 . We also compare this phenomenon with the permutation-group setting, where the same pattern is easy to realize.
Read the full abstract
Optimization and Control
Faster Symmetric Rendezvous on Four or More Locations
In the symmetric rendezvous problem, two players follow the same (randomized) strategy to visit one of $n$ locations in each time step $t=0,1,2,\dots$. Their goal is to minimize the expected time until they visit the same location and thus meet. A canonical strategy due to Anderson and Weber (J. Appl. Probab., 1990) is known to be optimal for $n=2$ and $n=3$ (Weber, Math. Oper. Res. 2012), but whether it remains optimal for larger values of $n$ has been an open question since 1990. We show that it does not remain optimal: for any finite $n\geq 4$, we construct an explicit symmetric strategy that achieves a strictly smaller expected meeting time than the Anderson-Weber strategy. In the Anderson-Weber strategy players stay at a dedicated home location for $n-1$ steps with a certain probability $\theta$ and with the remaining probability tour all non-home locations in a random order. Our improving strategy introduces carefully chosen correlations between consecutive tours of the non-home locations. The construction is uniform in $n$ and is guided by a graph-theoretic view in which tours correspond to permutations and meetings to edges in the complement of the derangement graph. By exploiting the clique structure of this graph we obtain a correlated strategy that improves on the Anderson-Weber strategy. For $n=4$, we give an exact expression for the improvement; for any $n\geq 5$, we obtain a lower bound on the expected improvement of $\frac{483(1-\theta)^6}{(n-1)^8}$, where $\theta \in [0,1)$ is the probability of staying at the home location. The graph-theoretic framework we introduce may be useful more widely in the design and analysis of correlated strategies for rendezvous.
Read the full abstract
Algebraic Geometry
Secant rank and syzygies of projections of elliptic normal curves
We study the syzygies of projections of elliptic normal curves. Let $C \subset \mathbb{P}^{d-1}$ be an elliptic normal curve of degree $d \ge 5$, and let $C_q$ denote the projection of $C$ from a point $q$. We obtain sharp bounds for the Green–Lazarsfeld index of $C_q$ in terms of the secant rank of $q$. More precisely, if $q \in C^s \setminus C^2$, where $C^s$ is the $s$-th secant variety of $C$, then $\mathrm{index}(C_q) \le s-3$, and equality holds for a general point $q$ of $C^s$. In particular, $\mathrm{index}(C_q) = \lceil \frac{d}{2} \rceil - 3$ for a general point $q$ in $\mathbb{P}^{d-1}$. The proof realizes projected elliptic curves as hyperplane sections of elliptic ruled surface scrolls and exploits the known syzygetic properties of these scrolls.
Read the full abstract
Dynamical Systems
Synchronization for the Rough Kuramoto Model
We study the local synchronization of phases and frequencies for the Kuramoto model driven by rough noise. In particular, we prove exponential convergence towards synchronization and we give the explicit rate of convergence and quantify the size of the random basin of attraction. Furthermore, we show that the long time behavior of the system is determined by the evolution of phases' mean. Our result relies on the use of a Lyapunov function, capable of overriding the particular structure of the noise, taking in account only its intensity. Finally, we illustrate our analytical results and possible extensions with the help of numerical simulations.
Read the full abstract
Classical Analysis and ODEs
A Fenchel Theorem for the Gauss maps and uniqueness of minimizers of nonlocal curvature energies
In this paper, we prove a Fenchel theorem for Gauss maps by providing sharp lower bounds for the path length of Gauss maps of an embedding. By combining the Fenchel-type theorem with various techniques from the field of geometric analysis, we show that circles minimize most generalized tangent-point energies. Furthermore, we prove that disks minimize all fractional Willmore energies among the class of convex planar sets.
Read the full abstract
Numerical Analysis
Stable Hermite transforms via the Golub-Welsch algorithm
We introduce an efficient stable algorithm for transforms associated with expansions in Hermite functions interpolated at Hermite polynomial roots. The Hermite transform matrix can be factorised into a diagonal component and an orthogonal matrix, leading to a form which allows both the forward and inverse Hermite transforms to be computed stably. Our novel algorithm computes this factorisation based on the eigendecomposition of the Jacobi matrix associated with Hermite functions. Through numerical experiments, we demonstrate the stability and efficiency gains of this novel method over prior work. Numerical experiments show that the new approach matches or improves on the accuracy of existing stabilized methods, is substantially faster in practice, and enables reliable use of large Hermite expansions in downstream PDE computations. We also provide an open-source implementation, together with reference implementations of previous methods, to facilitate adoption by the community.
Read the full abstract
Information Theory
On the Capacity Region of Additive-Multiplicative MAC with Heterogeneous Input Constraints
This paper characterizes the capacity region of a two-user additive-multiplicative multiple access channel (AM-MAC) under heterogeneous input constraints. This model captures the fundamental limits of symbiotic radio, where an active primary transmitter (PT) conveys information via active transmission subject to an average power constraint, while a passive backscatter device (BD) modulates signals through backscattering under a peak amplitude constraint. Our main results are threefold. Firstly, we prove that the sum-rate capacity equals the PT's point-to-point capacity, achieved when the PT employs Gaussian signaling and the BD acts as a pure reflector to assist the PT's transmission. Secondly, to achieve the BD's maximum achievable rate, the PT must adopt a constant-envelope signaling strategy, while the optimal BD distribution exhibits a concentric-circle structure with a uniform phase. Thirdly, for the remaining boundary points, we establish that the optimal PT signal consists of a continuous uniform phase and a discrete amplitude, whereas the optimal BD distribution is fully discrete. Finally, numerical results are provided to characterized the capacity region by solving a specialized nonlinear optimization problem. To demonstrate the practical implications, we also characterize an baseline rate pair and evaluate the overall performance of the AM-MAC.
Read the full abstract
Algebraic Geometry
On the inverse Galois problem for del Pezzo surfaces of degree 1
We solve the inverse Galois problem for del Pezzo surfaces of degree 1 over finite fields completely for 85 of the 112 possible types. We also determine for all 112 types the smallest field of existence. As an aside, we provide an example of a del Pezzo surface of degree 1 in characteristic 2 with more than one generalized Eckardt point.