Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 17 March

Number Theory

Simultaneous visibility in the algebraic lattice

Let $K$ be a number field with ring of integers $\mathcal{O}$. Two lattice points ${\bf x, y}\in \mathcal{O}^m$ with $m\geq 2$ are said to be visible from one another if $\gcd((x_i-y_i),\ldots, (x_m-y_m))=\mathcal{O}$, where $(x_i-y_i)$ is the ideal generated by $x_i-y_i$. Let $S\subset \mathcal{O}^m$ be a finite set. For $K=\mathbb{Q}$, the asymptotic density of the set of lattice points, visible from all points of $S$, was studied by several authors. For general number fields $K$, however, the asymptotic density has been studied only in the special case $S=\{(0,\ldots,0)\}$. Our main result establishes the corresponding density formula for a number field $K$ whose ring of integers $\mathcal{O}$ is a principal ideal domain, for all finite sets $S$ with $|S|\geq 2$.
Read the full abstract

Algebraic Topology

Worst-Case Examples for the Computation of Persistent Homology

We construct worst-case examples for the standard reduction algorithm for computing persistent homology. Our constructions are similar to the worst-case examples introduced by Morozov, but we replace the single-triangle arrangement with a strip of base and fin triangles. This structure allows us to give an explicit algorithm for their construction and to perform experiments comparing the runtime of different versions of the reduction algorithm. We further show that, after suitable edge and triangle subdivisions, these strip examples remain worst-case and can be realized as clique complexes of filtered graphs, and hence as Vietoris–Rips complexes of finite point clouds for a sequence of scale parameters.
Read the full abstract

Combinatorics

Geometric structures of $G$-fans associated with rank $3$ cluster-cyclic exchange matrices

In this paper, we investigate the geometric structures of $G$-fans associated with rank $3$ real cluster-cyclic exchange matrices. In this class, a simple recursion for tropical signs was found, which enables us to study the detailed properties of $c$-, $g$-vectors. We introduce two kinds of upper bounds of the $G$-fans. The first one is the global upper bound, which comes from a hyperbolic surface containing all $g$-vectors after an initial mutation. The second one is the local upper bound, which reflects the internal separateness structure. As applications, we prove that there is no periodicity among $g$-vectors, and we completely determine the sign of $g$-vectors. We also prove the monotonicity of $g$-vectors under the minimum assumption. Moreover, we show that the three global upper bounds can be simplified to a single uniform upper bound.
Read the full abstract

Differential Geometry

Second Variation Formula for the Laplace Eigenvalue Functional on Closed Manifolds

For a closed Riemannian manifold $(M,g)$ of dimension $n$, let $\lambda_{1}(g)$ be the first positive eigenvalue of the Laplace–Beltrami operator $\Delta_{g}$ and $\mbox{Vol}(M,g)$ the volume of $(M, g)$. Considering the scale-invariant quantity $\lambda_{k}(g)\mbox{Vol}(M,g)^{2/n}$ as a functional over all the metrics in a fixed conformal class, we derive a second variation formula for the functional. As a corollary, we prove that if the canonical flat metric on a torus is such that the multiplicity of $\lambda_{1}$ is two, then the flat metric is not a maximal point of the functional in its conformal class. This is a higher dimensional extension of Karpukhin's very recent work.
Read the full abstract

Commutative Algebra

Groups of invertible ideals of one-dimensional Prüfer domains as groups of integer-valued functions

Let $G$ be a one-dimensional $\ell$-subgroup of the group $\mathcal{F}(X,\mathbb{Z})$ of integer-valued functions on a set $X$. We show that $G$ is free under some hypothesis on the spectrum of $G$ and on its quotient groups at the prime ideals. We translate this result in the context of the study of freeness of the group $\mathrm{Inv}(D)$ of invertible ideals of a Prüfer domain $D$: in particular, we introduce the class of dd-domains as the class of Prüfer domains having a set $X$ that is dense in $\mathrm{Spec}(D)$ (with respect to the inverse topology) and whose localizations are DVRs. This class is exactly the class of Prüfer domains for which $\mathrm{Inv}(D)$ is isomorphic (as an $\ell$-group) to a subgroup of $\mathcal{F}(X,\mathbb{Z})$.
Read the full abstract

Quantum Algebra · Cross-listed from quant-ph

How Quantum Circuits Actually Learn: A Causal Identification of Genuine Quantum Contributions

Attributing performance gains in quantum machine learning to genuine quantum resources rather than to classical architectural scaling remains an open methodological challenge. We address this by introducing a counterfactual causal mediation framework that decomposes inter-architectural performance differences into direct effects, attributable to circuit parameterization and expressivity, and indirect effects mediated by quantum information-theoretic observables: entanglement entropy, purity, linear entropy, and quantum mutual information. Applying this framework to five circuit topologies and three benchmark datasets (across 43 validated configurations) reveals that direct architectural contributions systematically exceed quantum-mediated effects, with a mean ratio of 13.1:1 and a mean indirect contribution of 0.82%. These results suggest that current variational quantum circuits operate substantially below their quantum potential, and that principled resource-aware circuit design represents a tractable path toward measurable quantum-mediated performance gains.
Read the full abstract

Differential Geometry

$H$-tensional hypersurfaces in $4$-dimensional space forms

In this paper, we investigate the classification of $H$-tensional hypersurfaces $M$ in a $4$-dimensional space form $N^4(c)$ of constant sectional curvature $c$. Our results show that minimal hypersurfaces are the only $H$-tensional hypersurfaces in $4$-dimensional space forms, thereby providing an affirmative partial answer to Conjecture 3 proposed in \cite{kacimi}.
Read the full abstract

Probability

The Wulff crystal of self-dual FK-percolation becomes round when approaching criticality

The study of the phase transition in planar FK-percolation on the square lattice has seen significant recent breakthroughs. The model undergoes a change in the nature of its phase transition at $q = 4$, transitioning from a continuous to a discontinuous regime. The aim of this article is to investigate the behaviour of the model in the discontinuous regime as $q > 4$ approaches the continuous transition point $4$ from above, while maintaining the critical parameter $p = p_c(q)$. We prove that in this limit, the correlation length becomes isotropic. The core of the proof builds upon the recently established rotational invariance of the large-scale features of the model at $q = 4$ (arXiv:2012.11672).
Read the full abstract

Probability

Large deviations for the branching random walk with heavy-tailed associated random walk - a principle of one big jump

We prove a version of Nagaev's theorem for the branching random walk with heavy-tailed associated random walk. For a branching random walk on $\mathbb{R}$ we consider the random measure $Z_n = \sum_{|u|=n} e^{-V_u} \delta_{V_u}$ where $V_u$, $|u| = n$ denote the positions of the particles in the $n$-th generation. Under the assumption that $\mathbb{E}[Z_1(\cdot)]$ is a probability distribution with regularly varying tail, we prove that $Z_n((n\mathbb{E}[X] + t_n , \infty)) = W n\mathbb{P}(X > t_n )(1 + o(1))$ in $L^1$ as $n \to \infty$ where $W$ is a non-zero random variable, $t_n \uparrow \infty$ grows suitably fast, and $X$ has law $\mathbb{E}[Z_1(\cdot)]$. The result is explained probabilistically by a principle of one big jump for the branching random walk.
Read the full abstract

Algebraic Geometry

A Quadratically Enriched Count Of Lines In Smooth Del Pezzo Surfaces Of Degree 2 And 4

We give a computation of some Euler classes in Chow-Witt groups associated to the count of lines of smooth del Pezzo surfaces of degree 2 and 4. The description of Chow-Witt groups of projective bundles over Grassmannians for vector bundles that are not relatively orientable is the main part of the article. We show that the quadratic count is not enriched as the Chow-Witt group is isomorphic to the Chow group. In this setting, we give an expression of the classes of even rank in the Chow-Witt group as multiples of the hyperbolic element h. A direct application of this construction is the count for the del Pezzo surfaces.
Read the full abstract

Representation Theory

Relating Arthur packets of real unitary groups and $p$-adic symplectic and orthogonal groups

We establish an explicit correspondence of certain Arthur packets between real unitary groups and $p$-adic symplectic or orthogonal groups. This allows one to compute Arthur packets of real unitary groups by translating results from the $p$-adic side. A main ingredient in our proof is an explicit relation between Zuckerman's translation functor on the real side and the Jacquet functor on the $p$-adic side. To achieve this, we construct a correspondence of stacks of Langlands parameters with fixed infinitesimal characters between the relevant real and $p$-adic groups. Our approach also allows one to relate the Kazhdan-Lusztig polynomials and the microlocal geometry between real and $p$-adic sides.
Read the full abstract

All authors Taiwang Deng, Chang Huang, Bin Xu, Qixian Zhao

Probability

Stochastic Sandpiles with Uniform Toppling Rule on the Line

We consider the stochastic sandpile model with uniform toppling rule on the integer line. During a uniform toppling, with probability $1/3$ one particle is sent to the right of the toppled vertex, with probability $1/3$ one particle is sent to the left, and with probability $1/3$ two particles are sent out, one to the right and one to the left. We calculate exactly the stationary distribution of the stochastic sandpile Markov chain with this toppling rule on finite, connected subsets of the integers, and show that the infinite volume limit exists and is equal to the Dirac measure of the full configuration. For this end, we analyze where the excess mass leaves the system, when stabilizing the full configuration plus one additional particle on finite, connected subsets of the integers.
Read the full abstract

Combinatorics

Polytopes with large transversal ratio

The transversal ratio of a polytope $P$ is the minimum proportion of vertices of $P$ required to intersect each facet of $P$. The weak chromatic number of $P$ is the minimum number of colors required to color the vertices of $P$ so that no facet is monochromatic. We will construct an infinite family of $d$-polytopes for each $d\geq 5$ whose transversal ratio approaches 1 as the number of vertices grows. In particular, this implies that the weak chromatic number for $d$-polytopes is unbounded for each $d\geq 5$. The previous best known lower bounds on the supremum of the transversal ratio for $d$-polytopes for $d\geq 5$ were 2/5 for odd $d$ by Novik and Zheng, and 1/2 for even $d$ by Holmsen, Pach, and Tverberg. In the case of simplicial $(d-1)$-spheres, the best known lower bounds were 1/2 for $d=5$ and $6/11$ for $d=6$ by Novik and Zheng.
Read the full abstract

Classical Analysis and ODEs

Lower bounds in $H^2$-rational approximation to Blaschke products

We derive lower bounds in best rational approximation of given degree to finite Blaschke products, in the Hardy space $H^2$ of the unit disk. We first consider approximation to $z^N$, and then move on to more general Blaschke products whose zeros are bounded away from the circle. The latter case depends on Fourier coefficients estimates for Blaschke products which are of independent interest.
Read the full abstract

All authors Laurent Baratchart, Alexander Borichev, Sylvain Chevillard, Claire Coiffard Marre, Rachid Zarouf

Statistics Theory

A Kernel Two-Sample Test Invariant under Group Action with Applications to Functional Data

We introduce a kernel-based two-sample test for comparing probability distributions up to group actions. Our construction yields invariant kernels for locally compact $\sigma$-compact groups and extends classical Haar-based approaches beyond the compact setting. The resulting invariant Maximum Mean Discrepancy (MMD) test is developed in a general framework where the sample space is assumed to be Polish. Under natural conditions, the invariant kernel induces a characteristic kernel on the quotient space, ensuring consistency of the associated MMD test. The method is well suited to functional data, where invariances such as temporal shifts arise naturally, and its effectiveness is illustrated through simulation studies.
Read the full abstract

Numerical Analysis

Jin-Xin relaxation as a shock-capturing method for high-order DG/FR schemes

Jin-Xin relaxation is a method for approximating non-linear hyperbolic conservation laws by a linear system of hyperbolic equations with an $\varepsilon$ dependent stiff source term. The system formally relaxes to the original conservation law as $\varepsilon \to 0$. An asymptotic analysis of the Jin-Xin relaxation system shows that it can be seen as a convection-diffusion equation with a diffusion coefficient that depends on the relaxation parameter $\varepsilon$. This work makes use of this property to use the Jin-Xin relaxation system as a shock-capturing method for high-order discontinuous Galerkin (DG) or flux reconstruction (FR) schemes. The idea is to use a smoothness indicator to choose the $\varepsilon$ value in each cell, so that we can use larger $\varepsilon$ values in non-smooth regions to add extra numerical dissipation. We show how this can be done by using a single stage method by using the compact Runge-Kutta FR method that handles the stiff source term by using IMplicit-EXplicit Runge-Kutta (IMEX-RK) schemes. Numerical results involving Burgers' equation and the compressible Euler equations are shown to demonstrate the effectiveness of the proposed method.
Read the full abstract

All authors Marco Artiano, Arpit Babbar, Michael Schlottke-Lakemper, Gregor Gassner, Hendrik Ranocha

Algebraic Geometry · Cross-listed from cs.SC

Computing the connected components of real algebraic curves

Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical system design and robotics. In this paper, we design a new algorithm for computing such semi-algebraic descriptions for real algebraic curves. Notably, its complexity is less than the best known one for computing a graph which is isotopic to the real space curve under study.
Read the full abstract

Classical Analysis and ODEs

Finite orthogonal polynomials on a cone

The aim of this paper is to study finite orthogonal polynomials on a cone of revolution and its surface. We define two classes of finite orthogonal polynomials on the solid cone and derive their corresponding differential equations and recurrence relations. Furthermore, we demonstrate that, in the limit case, one of these classes reduces to Laguerre polynomials on the cone. Similarly, we establish two families of finite orthogonal polynomials on the surface of the cone and analyze their respective properties.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Two-time physics, Carroll symmetry and Jordan algebras

We describe Carroll particles with nonzero energy (i.e., particles that remain at rest) within the framework of two-time (2T) physics developed by Bars and collaborators. In a spacetime with one additional time and one additional space dimension, one can gauge the phase-space symmetry that exchanges generalized coordinates with their conjugate momenta, thereby unifying the description of apparently different one-time systems. We develop both classical and quantum descriptions of the Carroll particle arising from 2T physics, and explore links between the extended phase space of 2T physics and Freudenthal triple systems constructed over a semisimple cubic Jordan algebra (the Lorentzian spin factor).
Read the full abstract

Information Theory

Rotatable Antenna-Enabled Mobile Edge Computing

In the evolving landscape of mobile edge computing (MEC), enhancing communication reliability and computation efficiency to support increasingly stringent low-latency services remains a fundamental challenge. Rotatable antenna (RA) is a promising technology that introduces new spatial degrees of freedom (DoFs) to tackle this challenge. In this letter, we investigate an RA-enabled MEC system where antenna boresight directions can be independently adjusted to proactively improve wireless channel conditions for latency-critical users. We aim to minimize the maximum computation latency by jointly optimizing the MEC server computing resource allocation, receive beamforming, and the deflection angles of all RAs. To address the resulting non-convex problem, we develop an efficient alternating optimization (AO) framework. Specifically, the optimal edge computing resource allocation is derived based on the Karush-Kuhn-Tucker (KKT) conditions. Given the computing resources, the receive beamforming is optimized using semidefinite relaxation (SDR) combined with a bisection search. Furthermore, the RA deflection angles are optimized via fractional programming (FP) and successive convex approximation (SCA). Simulation results verify that the proposed RA-enabled MEC scheme significantly reduces the maximum computation latency compared with conventional benchmark methods.
Read the full abstract

All authors Qiyao Wang, Beixiong Zheng, Xue Xiong, Weidong Mei, Changsheng You, Qingqing Wu, Jie Tang

Category Theory

From Torsors to Topoi: An Introduction with a View Toward $\Sigma$-Protocols in Cryptography

This paper provides a preparatory introduction to sheaves and topoi, written as a conceptual continuation of the author's earlier introduction to torsors and as preparatory background for the author's arXiv paper \emph{Grothendieck Topologies and Sheaf-Theoretic Foundations of Cryptographic Security:\ Attacker Models and $\Sigma$-Protocols as the First Step}~\cite{InoueSecurity}. Rather than attempting an encyclopedic survey of all of topos theory, the exposition develops those parts of the subject that are most relevant for passing from torsor-based local-to-global reasoning to sheaf-theoretic and topos-theoretic reasoning: Grothendieck topologies, sheaves, torsors over a site, descent, sheaf topoi, elementary topoi, Cartesian closed structure, subobject classifiers, and internal logic. The goal is not merely motivational. We try to develop enough genuine topos theory that the reader can understand, not only heuristically but structurally, why the later cryptographic framework of~\cite{InoueSecurity} uses Grothendieck topologies and sheaf-theoretic language. To make the note more self-contained, we also include substantial appendices on basic category theory, Yoneda's lemma, limits and colimits, equalizers and coequalizers, Kan extensions, the relation between internal logic and intuitionistic logic, and exercises with solutions. In the final part, we explain how these ideas prepare the ground for a conceptual understanding of $\Sigma$-protocols, especially in connection with local consistency, simulability, and the passage from compatible local data to global structure.
Read the full abstract

2603.16274 · 17 Mar · 27 pages. Introductory but substantial note on torsors, sheaves, topoi, and internal logic, written as preparatory background for the author's sheaf-theoretic approach to cryptographic security and {\Sigma}-protocols. Includes appendices on category theory, Yoneda lemma, limits and colimits, Kan extensions, and exercises with solutions

Analysis of PDEs

Quantitative stability of the 2D Monotone shear flow for Boussinesq equation in a finite channel

Neither natural nor laboratory laminar flows are perfectly steady. Instead, they are frequently highly unsteady, as illustrated by experimental studies on Bénard convection. In the paper, we investigate the transition threshold of the Boussinesq equations around a time-dependent monotone shear flow $(U(t,y),0)$ with a constant background temperature $a\in\mathbb{R}$. The analysis is performed in the finite channel $\mathbb{T}\times[0,1]$ with non-slip boundary condition. By means of the sharp resolvent estimates and space-time estimates, we establish that the Boussinesq system admits a globally stable solution around the monotone shear flow, provided that the initial perturbation satisfies $\|u^{\mathrm{in}}\|_{H^2}\leq c\nu^{\frac12}, \|\langle D_x\rangle \theta^{\mathrm{in}}\|_{L^2} \leq c\nu^{\frac56}$. Moreover, we derive the enhanced dissipation estimate of the vorticity and inviscid damping estimate of the velocity.
Read the full abstract

Information Theory · Cross-listed from cs.CR

Novel CRT-based Asymptotically Ideal Disjunctive Hierarchical Secret Sharing Scheme

Disjunctive Hierarchical Secret Sharing (DHSS)} scheme is a type of secret sharing scheme in which the set of all participants is partitioned into disjoint subsets, and each subset is said to be a level with different degrees of trust and different thresholds. In this work, we focus on the Chinese Remainder Theorem (CRT)-based DHSS schemes due to their ability to accommodate flexible share sizes. We point out that the ideal DHSS scheme of Yang et al. (ISIT, 2024) and the asymptotically ideal DHSS scheme of Tiplea et al. (IET Information Security, 2021) are insecure. Consequently, existing CRT-based DHSS schemes either exhibit security flaws or have an information rate less than $\frac{1}{2}$. To address these limitations, we propose a CRT-based asymptotically perfect DHSS scheme that supports flexible share sizes. Notably, our scheme is asymptotically ideal when all shares are equal in size. Its information rate achieves one and it has computational security.
Read the full abstract

All authors Hongju Li, Jian Ding, Fuyou Miao, Cheng Wang, Cheng Shu

Algebraic Geometry

Algebraicity of supermoduli of curves via Artin's criteria

We apply the supergeometric analogue of Artin's algebraicity criteria to prove algebraicity for four moduli problems in supergeometry: supercurves, super Riemann surfaces, stable supercurves, and stable super Riemann surfaces. The algebraicity of the moduli of (stable) super Riemann surfaces is known but we give a new proof by verifying the super Artin conditions. The algebraicity of the moduli of (stable) supercurves is new.
Read the full abstract

Algebraic Geometry

Lawson homology groups of Chow varieties

Let $C_{p,d}(\mathbb{P}^n)$ denote the Chow variety of effective algebraic $p$-cycles of degree $d$ in complex projective space $\mathbb{P}^n$. In this paper, we compute the rational Lawson homology groups $L_qH_k(C_{p,d}(\mathbb{P}^n))_\mathbb{Q}$ for $0 \leq 2q\leq k \leq 2d$. Additionally, we prove that the rational Lawson homology groups of a natural completion of the Chow monoid of algebraic $p$-cycles in projective spaces are isomorphic to the corresponding rational singular homology groups. We also establish the stability of Lawson homology groups of Chow varieties under natural embeddings and algebraic suspension maps within a specified range.
Read the full abstract

Numerical Analysis

Neural Pushforward Samplers for the Fokker-Planck Equation on Embedded Riemannian Manifolds

In this paper, we extend the Weak Adversarial Neural Pushforward Method to the Fokker–Planck equation on compact embedded Riemannian manifolds. The method represents the solution as a probability distribution via a neural pushforward map that is constrained to the manifold by a retraction layer, enforcing manifold membership and probability conservation by construction. Training is guided by a weak adversarial objective using ambient plane-wave test functions, whose intrinsic differential operators are derived in closed form from the geometry of the embedding, yielding a fully mesh-free and chart-free algorithm. Both steady-state and time-dependent formulations are developed, and numerical results on a double-well problem on the two-sphere demonstrate the capability of the method in capturing multimodal invariant distributions on curved spaces.
Read the full abstract

Classical Analysis and ODEs

The d'Alembert Inevitability Theorem

We study functions satisfying the composition law $F(xy)+F(x/y)=P(F(x),F(y))$ with a symmetric polynomial combiner $P$. We prove that symmetry together with a quadratic degree bound on $P$ forces a composition law of d'Alembert type. We establish a degree mismatch exclusion criterion showing that symmetric polynomial combiners with $\mbox{deg} P(u,v) \ge 3$ do not admit nonconstant continuous solutions, provided the leading term does not cancel (Theorem 3.1.). For continuous nonconstant functions $F:\mathbb{R}_{>0}\to\mathbb{R}$ with $F(1)=0$ satisfying the composition law with a symmetric polynomial $P$ of degree at most two, the combiner is necessarily of the form $P(u,v)=2u+2v+c\,uv$, $c\in\mathbb{R}$ (Theorem 3.3.). The equation reduces in logarithmic coordinates to the classical d'Alembert functional equation. For $c\neq 0$, one obtains hyperbolic or trigonometric branches, while $c=0$ yields the squared-logarithm family. Under the cost-function assumptions $F\ge 0$ and convexity, only the hyperbolic branch with $c>0$ remains. A unit log-curvature calibration selects the canonical value $c=2$, which yields the canonical reciprocal cost $F(x)=\tfrac12(x+x^{-1})-1$. For $c\neq0$, the result extends to $\mathbb{R}_{>0}^n$: every solution depends only on a single linear combination of coordinate logarithms; for $c=0$, the solution is a general quadratic form $\sum_{i,j}a_{ij}\ln x_i\ln x_j$. In either case, nontrivial coordinate-wise separable costs are excluded.
Read the full abstract

Group Theory

An Explicit Bound for the Conjugator Length Function of a Surface Group

For a surface group $\pi_1(\Sigma_g)=\langle c_1,\dots , c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\rangle$ with genus $g\geq 2$, we provide an explicit bound $n-1\leq \mathrm{CL}(2n)=\mathrm{CL}(2n+1)\leq n+8g-1$ for the conjugator length function $\mathrm{CL}:\mathbb N\to\mathbb N$ of $\pi_1(\Sigma_g)$ via a detailed analysis of conjugation reductions.
Read the full abstract

Optimization and Control

Featurized Occupation Measures for Structured Global Search in Numerical Optimal Control

Numerical optimal control is split between globally structured but dimensionally intractable Hamilton–Jacobi–Bellman (HJB) methods and scalable but local trajectory optimization. We introduce Featurized Occupation Measures (FOM), a finite-dimensional primal–dual interface where HJB subsolutions guide primal search and primal occupation data can inform certificate refinement. Explicit and implicit realizations, based on finite Liouville tests and rollout-sampled residuals, are proved asymptotically consistent with the exact occupation-measure LP. FOM also identifies when HJB-type certificates avoid full state-space representation. For factor graphs induced by compatible passivity-based interconnections, blockwise HJB inequalities yield block-additive OM-dual certificates, including blockwise approximate variants. The curse of dimensionality is then shifted from state dimension to interconnection topology. Approximate certificates remain reusable under time shifts and bounded model perturbations, with explicit degradation bounds. A static obstacle-avoidance benchmark illustrates how tighter certificates improve sample-based global search.
Read the full abstract

All authors Qi Wei, Jianfeng Tao, Haoyang Tan, Hongyu Nie

Numerical Analysis

Fourth-order compact finite difference methods for 2D and 3D nonlinear convection-diffusion-reaction equations

In this paper, we first consider linear 2D and 3D convection-diffusion-reaction equations $-\nabla\cdot (\kappa \nabla u) + {\bm v} \cdot \nabla u + \lambda u = \phi$ and $u_t - \nabla\cdot (\kappa \nabla u) + {\bm v} \cdot \nabla u + \lambda u = \phi$, where all $\kappa>0, {\bm v}, \lambda, \phi$ are smooth variable functions. We derive fourth-order compact 9-point (2D) and 19-point (3D) finite difference methods (FDMs) to solve linear time-independent equations. As derivations of high-order compact FDMs are very complicated and involve cumbersome notation (especially in 3D), it is usually difficult for readers not specializing in high-order FDMs to follow derivations and replicate numerical results. In this paper, we observe interesting and novel expressions of stencils of high-order FDMs which introduce new restrictions of stencils to help construct compact fourth-order FDMs (2D and 3D) with easy, explicit, and short expressions. These simple stencils make the analysis of the truncation error easy for readers to understand and facilitate implementing proposed FDMs directly. For linear unsteady equations, we apply Crank-Nicolson (CN), BDF3, BDF4 methods with above compact FDMs to compute numerical solutions. Finally, we discuss nonlinear convection-diffusion-reaction equations in 2D and 3D, i.e., each function of $\kappa(u)>0, {\bm v}(u), \lambda(u)$ depends on the solution $u$. We linearize nonlinear equations by the fixed point method (iterative method) and use above simple fourth-order compact FDMs to solve linearized equations (unsteady equations also utilize CN, BDF3, and BDF4 methods). Each of proposed FDMs in 2D and 3D for linear, nonlinear, steady, and unsteady equations satisfies the discrete maximum principle and forms an M-matrix for the sufficiently small $h$, if the function $\lambda$ is nonnegative.
Read the full abstract