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)

Wednesday 11 March

Probability · Cross-listed from eess.SY

Polynomial Updates for the Unscented Kalman Filter

Most nonlinear filters used in spacecraft navigation are based on a linear approximation of the optimal minimum mean square error estimator. The Unscented Kalman Filter (UKF) handles nonlinear dynamics through a sigma-point transform, but the resulting state estimate remains a linear function of the measurement. This paper proposes a polynomial approximation of the optimal Bayesian update, leading to a Polynomial Unscented Kalman Filter that retains the structure of the standard UKF but enriches the measurement update with higher-order (polynomial) terms. To compute the moments required by this polynomial estimator, we employ a Conjugate Unscented Transformation (CUT), which accurately captures higher-order central moments of the state and measurement. Numerical examples, including Clohessy-Wiltshire and Circular Restricted 3-Body dynamics with non-Gaussian measurement noise, illustrate that the resulting polynomial-CUT filters improve both state estimation accuracy and covariance consistency when compared with their linear counterparts.
Read the full abstract

History and Overview of Mathematics

But some are more equal than others

All men are created equal, proclaimed Jefferson in 1776 – but some are more equal than others, added Orwell in Animal Farm in 1945. So what's the probability that two skaters are exactly equal, to the third decimal places, after four distances?

Number Theory

Periodic Points of Power Maps in Finite Matrix Groups and Algebras

Consider the power map $x\mapsto x^L$ for a prime $L\neq 2$ such that $L|q-1$ where $q$ is a power of a prime. We determine the periodic points under this map for $\operatorname{M}_n(q)$, the algebra of $n\times n $ matrices over a finite field of order $q$, and also for the group $\operatorname{GL}_n(q)=\operatorname{M}_n(q)^\times$. We compute the limit $ \lim\limits_{\substack{q\longrightarrow \infty\\v_L(q-1)=c}}\dfrac{\left|\operatorname{Per}(x^L,\operatorname{M}_\ell(q))\right|}{|\operatorname{M}_\ell(q)|}$ and consequently $\lim\limits_{\substack{q\longrightarrow \infty v_L(q-1)=c}}\dfrac{\left|\operatorname{Per}(x^L,\operatorname{GL}_\ell(q))\right|}{|\operatorname{GL}_\ell(q)|}$, where $v_L$ denotes the $L$-adic valuation. We also compute the quantity $\lim\limits_{\substack{q\longrightarrow \infty v_L(q-1)=c}}\dfrac{\left|\operatorname{Per}(x^L,\operatorname{Sp}_{2\ell}(q))\right|}{|\operatorname{Sp}_{2\ell}(q)|}$ and $\lim\limits_{\substack{q\longrightarrow \infty v_L(q-1)=c}}\dfrac{\left|\operatorname{Per}(x^L,\operatorname{U}_\ell(q))\right|}{|\operatorname{U}_\ell(q)|}$; turns out these two limiting values are same. In all the cases, it turns out that the regular semisimple elements play the role in determining the limiting values.
Read the full abstract

Combinatorics

Induced Minors and Coarse Tree Decompositions

Let $G$ be a graph, $S \subseteq V(G)$ be a vertex set in $G$ and $r$ be a positive integer. The distance $r$-independence number of $S$ is the size of the largest subset $I \subseteq S$ such that no pair $u$, $v$ of vertices in $I$ have a path on at most $r$ edges between them in $G$. It has been conjectured [Chudnovsky et al., arXiv, 2025] that for every positive integer $t$ there exist positive integers $c$, $d$ such that every graph $G$ that excludes both the complete bipartite graph $K_{t,t}$ and the grid $\boxplus_t$ as an induced minor has a tree decomposition in which every bag has (distance $1$) independence number at most $c(\log n)^d$. We prove a weaker version of this conjecture where every bag of the tree decomposition has distance $16(\log n + 1)$-independence number at most $c(\log n)^d$. On the way we also prove a version of the conjecture where every bag of the decomposition has distance $8$-independence number at most $2^{c (\log n)^{1-(1/d)}}$.
Read the full abstract

All authors Maria Chudnovsky, Julien Codsi, Ajaykrishnan E S, Daniel Lokshtanov

Dynamical Systems

Bohr sets in sumsets III: expanding difference sets and almost Bohr sets

Let $G$ be a discrete abelian group. Følner showed that if $A \subseteq G$ has positive upper Banach density, then $A - A$ contains an almost Bohr set – a set of the form $B \setminus E$ where $B$ is a Bohr set and $E$ has zero Banach density. We study the sets $S \subseteq G$ for which $A - A + S$ contains a Bohr set for every $A \subseteq G$ of positive upper Banach density. For $G = \mathbb{Z}$, we show that the sets $\{n^2: n \in \mathbb{N}\}$, $\{p - 1: p \text{ prime}\}$, and $\{ \lfloor n^c \rfloor: n \in \mathbb{N} \}$ with $c > 0$, have this property. Moreover, we prove that there are sets $A, B \subseteq \mathbb{Z}$ such that $A$ is dense in the Bohr topology of $\mathbb{Z}$, $d^*(B) > 0$, while $A + B$ is not piecewise Bohr, answering two questions of the second author in [31]. We also study those sets $S$ such that $A + S$ contains a Bohr set for every almost Bohr set $A$. As applications, we prove: (i) If $\phi_1, \phi_2: G \to G$ are (not necessarily commuting) homomorphisms with finite indices $[G: \phi_i(G)]$, and $C \subseteq G$ is a central set, then $\phi_1(C) - \phi_1(C) + \phi_2(C)$ contains a Bohr set. This answers one of our questions in [35] and generalizes results in [44, 48]; (ii) Every set of pointwise recurrence in $\mathbb{Z}$ is a set of nice recurrence and a van der Corput set, extending known properties of sets of pointwise recurrence studied in [26, 27, 40].
Read the full abstract

All authors Pierre-Yves Bienvenu, John T. Griesmer, Anh N. Le, Thái Hoàng Lê

Probability

Large N limit of Wilson Loops on orientable closed surfaces in the light of Koike-Schur-Weyl duality and Spin Networks

We prove the convergence in probability of Wilson loops under the Yang-Mills measure on any closed, orientable surface of genus larger than two, for large unitary or special unitary groups. Our approach revisits and refines recent arguments for average Wilson loops under the Atiyah-Bott-Goldman measure and for the Yang-Mills measure, using Koike-Schur-Weyl duality and Spin Networks.
Read the full abstract

Combinatorics

The zeta function of regular trees, their special values and functional equations

We determine the special values at positive integers of the spectral zeta function associated with the combinatorial Laplacian on the regular tree. These values admit explicit formulas in terms of certain polynomials, which we show to be palindromic and to have non-negative integer coefficients with a combinatorial interpretation. Along the way, we uncover unexpected symmetries between the values of the zeta function at negative and positive integers, expressed at the level of their generating functions. Using these symmetries, we ultimately establish a functional equation of the type \( s \longleftrightarrow 1-s \) for a natural completion of the zeta function.
Read the full abstract

Algebraic Geometry

Twisted Arinkin transforms and derived categories of moduli spaces on Kuznetsov components

In this note, we generalize results of Donagi and Pantev on twisted derived equivalences between elliptically fibered surfaces to higher dimensions. First, we establish a twisted derived equivalence between torsors under abelian schemes satisfying a certain compatibility condition. Then, relying on the work of Arinkin on compactified Jacobians, we extend the equivalence to twisted compactified Jacobians associated to curves on K3 surfaces. This positively answers a question stated by Mattei and Meinsma. We then extend a result of Bottini and Huybrechts for Fano varieties of lines on cubic fourfolds to general moduli spaces of Bridgeland-stable objects on Kuznetsov components admitting rational Lagrangian fibrations.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Contractivity of Multi-Stage Runge-Kutta Dynamics

Many control, optimization, and learning algorithms rely on discretizations of continuous-time contracting systems, where preservation of contractivity under numerical integration is key for stability, robustness, and reliable fixed-point computation. In this paper, we establish conditions under which multi-stage Runge-Kutta methods preserve strong contractivity when discretizing infinitesimally contractive continuous-time systems. For explicit Runge-Kutta methods, preservation conditions are derived by bounding Lipschitz constants of the associated composite stage mappings, leading to coefficient-dependent criteria. For implicit methods, the algebraic structure of the stage equations enables explicit conditions on the Runge-Kutta coefficients that guarantee preservation of strong contractivity. In the implicit case, these results extend classical guarantees, typically limited to weak contractivity in the Euclidean metric, to strong contractivity with respect to the $\ell_1$-, $\ell_2$-, and $\ell_\infty$-norms. In addition, we study well-definedness of implicit methods through an auxiliary continuous-time system associated with the stage equations. We show that strong infinitesimal contractivity of this auxiliary system is sufficient to guarantee unique solvability of the stage equations. This analysis generalizes standard well-definedness conditions and provides a dynamic implementation approach that avoids direct solution of the implicit algebraic equations.
Read the full abstract

Numerical Analysis · Cross-listed from physics.ao-ph

Leveraging higher-order time integration methods for improved computational efficiency in a rainshaft model

Cloud and precipitation microphysics packages in atmospheric general circulation models typically use first-order time integration methods with a large time step, requiring ad hoc limiters and substepping of the sedimentation scheme to prevent numerical instability. We investigate alternative methods for rain microphysical processes in the current Energy Exascale Earth System Model (E3SMv3), provided by the Predicted Particle Properties (P3) scheme. Using an offline rainshaft model containing P3's rain microphysics as a proxy for E3SMv3, we find that rain microphysics is underresolved in time at E3SMv3's default 300s time step. Accurately resolving the rainshaft model processes in time requires an over 100x reduction in time step, increasing wall clock time by 40x. However, higher-order time integrators based on Runge-Kutta methods offer improved solution accuracy for a given computational cost. Adaptive time stepping is key to obtaining computationally efficient microphysics results, eliminating the need for specialized substepping procedures in the sedimentation process. An adaptive second-order Runge-Kutta method approximates a high-temporal-resolution reference solution at only 2.6x the cost of the default P3 scheme; this method achieves high accuracy greater than 15x more efficiently than simply reducing the time step of P3 in the rainshaft model. We also analyze the timescales of the rain processes to obtain insight about the maximum time step each process is able to take while maintaining stability and accuracy, and about how individual processes should be grouped together for most efficient results.
Read the full abstract

All authors Justin Dong, Sean P. Santos, Steven B. Roberts, Christopher J. Vogl, Carol S. Woodward

Numerical Analysis · Cross-listed from q-bio.QM

Ill-Conditioning in Dictionary-Based Dynamic-Equation Learning: A Systems Biology Case Study

Data-driven discovery of governing equations from time-series data provides a powerful framework for understanding complex biological systems. Library-based approaches that use sparse regression over candidate functions have shown considerable promise, but they face a critical challenge when candidate functions become strongly correlated: numerical ill-conditioning. Poor or restricted sampling, together with particular choices of candidate libraries, can produce strong multicollinearity and numerical instability. In such cases, measurement noise may lead to widely different recovered models, obscuring the true underlying dynamics and hindering accurate system identification. Although sparse regularization promotes parsimonious solutions and can partially mitigate conditioning issues, strong correlations may persist, regularization may bias the recovered models, and the regression problem may remain highly sensitive to small perturbations in the data. We present a systematic analysis of how ill-conditioning affects sparse identification of biological dynamics using benchmark models from systems biology. We show that combinations involving as few as two or three terms can already exhibit strong multicollinearity and extremely large condition numbers. We further show that orthogonal polynomial bases do not consistently resolve ill-conditioning and can perform worse than monomial libraries when the data distribution deviates from the weight function associated with the orthogonal basis. Finally, we demonstrate that when data are sampled from distributions aligned with the appropriate weight functions corresponding to the orthogonal basis, numerical conditioning improves, and orthogonal polynomial bases can yield improved model recovery accuracy across two baseline models.
Read the full abstract

Combinatorics

Super-minimally $3$-connected matroids

A super-minimally $k$-connected matroid is a $k$-connected matroid having no proper $k$-connected restriction of size at least $2k-2$. This extends the corresponding concept for graphs. For $k=2$ and $k=3$, we determine the maximum size of a super-minimally $k$-connected rank-$r$ matroid and characterize, in each case, those matroids attaining the extremal bound. These results parallel Murty's results for minimally $2$-connected matroids and Oxley's results for minimally $3$-connected matroids.
Read the full abstract

Numerical Analysis

Physics-based Approximation and Prediction of Speedlines in Compressor Performance Maps

Speedlines in compressor performance maps (CPMs) are critical for understanding and predicting compressor behavior under various operating conditions. We investigate a physics-based method for reconstructing compressor performance maps from sparse measurements by fitting each speedline with a superellipse and encoding it as a compact, interpretable vector (surge, choke, curvature, and shape parameters). Building on the formulation of Llamas et al., we develop a robust two-stage fitting pipeline that couples global search with local refinement. The approach is validated on industrial data-sets for different turbocharger types. We discuss prediction quality for inter- and extrapolation, metric sensitivities and outline opportunities for physics-informed constraints, alternative function families, and hybrid physics-ML mappings to improve boundary behavior and, ultimately, enable full CPM reconstruction from limited data.
Read the full abstract

All authors Abdul-Malik Akiev, Danyal Ergür, Alexander Schirger, Matthias Müller, Alexander Hinterleitner, Thomas Bartz-Beielstein

Statistics Theory · Cross-listed from stat.AP

Finite-Sample Decision Instability in Threshold-Based Process Capability Approval

Process capability indices such as $C_{pk}$ are widely used in manufacturing quality control to support supplier qualification and product release decisions based on fixed acceptance thresholds (e.g., $C_{pk} \geq 1.33$). In practice, these decisions rely on sample-based estimates computed from moderate sample sizes ($n \approx$ 20-50), yet the stochastic nature of the estimator is often overlooked when interpreting threshold compliance. This study establishes a local asymptotic characterization of decision behavior when the true process capability lies near a fixed threshold. Under standard regularity conditions, if the true capability equals the threshold, the acceptance probability converges to 0.5 as sample size increases, implying that a fixed $C_{pk}$ gate embeds an inherent boundary decision risk even under ideal distributional assumptions. When the true capability deviates from the threshold by $O(n^{-1/2})$, the decision probability converges to a non-degenerate limit governed by a scaled signal-to-noise ratio. Monte Carlo simulations and an empirical study on 880 manufacturing dimensions demonstrate substantial resampling-based decision instability near the commonly used 1.33 criterion. These findings provide a probabilistic interpretation of threshold-based capability decisions and quantitative guidance for assessing boundary-induced release risk in engineering practice.
Read the full abstract

Numerical Analysis

Explicit Discrete Solution for Some Optimization Problems and Estimations with Respect to the Exact Solution

We consider two steady-state heat conduction systems called, $S$ and $S_\alpha$, in a multidimensional bounded domain $D$ for the Poisson equation with source energy $g$. In one system, we impose mixed boundary conditions (temperature $b$ on the boundary $\Gamma_1$, heat flux $q$ on $\Gamma_2$ and an adiabatic condition on $\Gamma_3$). In the other system, the condition on $\Gamma_1$ is replaced by a convective heat flux condition with coefficient $\alpha$. For each of these systems, we consider three associated optimization problems $(P_{i})$ and $(P_{i\alpha })$, $i=1,2,3$, where the variable is the source energy $g$, the heat flux $q$ and the environmental temperature $b$, respectively. In the particular case where $D$ is a rectangle, the explicit continuous optimization variables and the corresponding state of the systems are known. In the present work, by using a finite difference scheme, we obtain the discrete systems $({S^h})$ and ${(S^h_\alpha)}$ and discrete optimization problems ${(P^h_i)}$ and ${(P^h_{i \alpha})}$, $i=1,2,3$, where $h$ is the space step in the discretization. Explicit discrete solutions are found, and convergence and estimation errors results are proved when $h$ goes to zero and when $\alpha$ goes to infinity. Moreover, some numerical simulations are provided in order to test theoretical results. Finally, we note that the use of a three-point finite-difference approximation for the Neumann or Robin boundary condition at the boundary improves the global order of convergence from $O(h)$ to $O(h^2)$.
Read the full abstract

Dynamical Systems

Cut and project schemes in the Poincaré disc: From cocompact Fuchsian groups to chaotic Delone sets

A question raised by Davies et al [Phys. Rev. Lett. 131, 2023] is: "Can developing new cut and project models, where the lattice is not square or the curve is non-linear, generate better performing graded metamaterials?" In this article, we study a natural construction of such a cut and project scheme, namely, cut and project schemes in relation to cocompact Fuchsian groups acting on the Poincaré disc model of hyperbolic space. We present a condition on the fundamental domain (a hyperbolic polygon) of the group so that the resulting cut and project set $S \subset \mathbb{R}$ is a chaotic Delone set. We also investigate the set of tile lengths of $S$, namely $\mathcal{L}_{S} = \{ z - y : z,y \in S, \, z > y \; \text{and} \; (y,z) \cap S = \emptyset \}$, and show that this set is countably infinite. Finally, we apply our results to cocompact Fuchsian triangle groups and show that the resulting cut and project sets are chaotic Delone, complementing and extending the work of López et al. [Discrete Contin. Dyn. Syst. 41, 2021].
Read the full abstract

Probability

Infinite Bernoulli convolutions generated by multigeometric series and their properties

The paper is devoted to infinite Bernoulli convolutions generated by positive multigeometric series and to probability distributions of random variables whose digits in an even integer base-$s$ expansion with two redundant digits form a sequence of independent and identically distributed random variables. The main objects of the article are random variables: $\xi=\sum\limits_{n=1}^{\infty}\frac{\xi_n}{s^n}$, where $(\xi_n)$ is a sequence of independent and identically distributed random variables taking values $0, 1, 2, \dots, s-1, s, s+1$ with probabilities $p_0$, $p_1$, $p_2, \dots, p_{s-1}, p_s, p_{s+1}$ respectively $(3<s \in \mathbb{N})$; $$\eta=\sum\limits_{n=1}^{\infty}\left[\frac{3\eta_{(n-1)(m+1)+1}}{s^n}+\sum\limits_{j=1}^{m} \frac{2\eta_{(n-1)(m+1)+1+j}}{s^n}\right],$$ where $(\eta_n)$ is a sequence of independent and identically distributed random variables that take values $0$ and $1$ with probabilities $q_0>0$ and $q_1=1-q_0>0$. We study conditions under which the above random variables have absolutely continuous or singular distributions as well as topological, metric, and fractal properties of their supports. The main focus is on the case where the spectrum is a Cantorval.
Read the full abstract

Group Theory

When are Two Subgroups Independent?

Rosenmann and Ventura asked "What is the right definition of dependence of subgroups for general groups?". Here we aim to answer this question. We consider a definition of subgroup independence which is a special case of a category-theoretic one. It is that: Two subgroups of a group are independent if and only if any two endomorphisms, one acting on each subgroup, can be extended to an endomorphism of the group generated by these subgroups. This definition helps to illuminate that the usual condition of almost disjointness of subgroups (two subgroups $A$ and $B$ are almost disjoint if and only if $A \cap B = \{e\}$, where $e$ is the identity element) is not enough to force independence and here we find necessary and (different) sufficient conditions for subgroup independence. The aim of this note is to introduce this general notion of subgroup independence to the group theory community and to pose the open question of its characterisation. We present the partial results known up to this point. Moreover, we use the progress made so far to give a heuristic algorithm that decides subgroup independence for many cases.
Read the full abstract

Optimization and Control

Minimizers that are not Impulsive Minimizers and Higher Order Abnormality

This paper addresses two related problems in optimal control. The first investigation consists of compatibility issues between two classical approaches to deriving necessary conditions for optimal control problems with a final target: the set-separation approach and penalization techniques. These methods generally lead to non-equivalent conditions, mainly due to their reliance on different notions of tangency at the target. We address this issue by considering Quasi Differential Quotient (QDQ) approximating cones (which are fit for the set-separation approach) and identifying conditions under which the Clarke tangent cone (which is a typical tool within penalization techniques) is also a QDQ approximating cone. In particular, we show that this property holds under suitable local invariance assumptions or when the target coincides locally with an $r$-prox regular set. In the second part of the paper we apply this compatibility result to the study of infimum-gap phenomena in optimal control problems with unbounded controls and impulsive extensions. In particular, we establish a connection between the occurrence of infimum gaps for strict-sense minimizers and abnormality in a higher-order Maximum Principle involving Lie brackets. While the abnormality-gap correspondence beyond first-order conditions has been already established for extended-sense –i.e. impulsive– minimizers, a topological argument involving the former and the utilization of the above compatibility issues allow us to extend this correspondence to strict-sense minimizers.
Read the full abstract

Analysis of PDEs

Self-similar blow-up profile for the one-dimensional reduction of generalized SQG with infinite energy

We study the singularity formation mechanisms of the inviscid generalized Surface Quasi-Geostrophic (gSQG) equation on the whole space $\mathbb{R}^2$ and on the upper half-plane $\mathbb{R}^2_+$, allowing infinite energy. In each case, we derive a one-dimensional reduction that captures the leading-order singular behavior of the original 2D system, and use a fixed-point argument to show the existence of finite-time self-similar blow-up solutions for the 1D systems. We also perform numerical simulations for verification and visualization.
Read the full abstract

All authors Thomas Y. Hou, Xiang Qin, Yannick Sire, Yantao Wu

Mathematical Physics · Cross-listed from hep-th

The role of p_1-structures in 3-dimensional Chern-Simons theories

Our recent paper~\cite{FST} with Claudia Scheimbauer uses the cobordism hypothesis to construct fully local Chern-Simons theories. Here we expose some physics motivations: Yang-Mills plus Chern-Simons in the bosonic case and the free Majorana-Weyl spinor field in the fermionic case. We also give expositions of tangential structures and invertible field theories, in particular the 'gravitational Chern-Simons theory' used by Witten to obtain topological field theories from the physical theories.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Outrigger local polynomial regression

Standard local polynomial estimators of a nonparametric regression function employ a weighted least squares loss function that is tailored to the setting of homoscedastic Gaussian errors. We introduce the outrigger local polynomial estimator, which is designed to achieve distributional adaptivity across different conditional error distributions. It modifies a standard local polynomial estimator by employing an estimate of the conditional score function of the errors and an 'outrigger' that draws on the data in a broader local window to stabilise the influence of the conditional score estimate. Subject to smoothness and moment conditions, and only requiring consistency of the conditional score estimate, we first establish that even under the least favourable settings for the outrigger estimator, the asymptotic ratio of the worst-case local risks of the two estimators is at most $1$, with equality if and only if the conditional error distribution is Gaussian. Moreover, we prove that the outrigger estimator is minimax optimal over Hölder classes up to a multiplicative factor $A_{\beta,d}$, depending only on the smoothness $\beta \in (0,\infty)$ of the regression function and the dimension~$d$ of the covariates. When $\beta \in (0,1]$, we find that $A_{\beta,d} \leq 1.69$, with $\lim_{\beta \searrow 0} A_{\beta,d} = 1$. A further attraction of our proposal is that we do not require structural assumptions such as independence of errors and covariates, or symmetry of the conditional error distribution. Numerical results on simulated and real data validate our theoretical findings; our methodology is implemented in R and available at https://github.com/elliot-young/outrigger.
Read the full abstract

Numerical Analysis

Efficient numerical computation of traveler states in explicit mobility-based metapopulation models: Mathematical theory and application to epidemics

Metapopulation models are powerful tools for capturing the spatio-temporal spread of infectious diseases. Models that explicitly account for traveler origins and destinations, such as Lagrangian metapopulation models, enable a detailed representation of mobility and traveling subpopulations. However, in densely connected networks, tracking these subpopulations leads to quadratic growth in system size with the number of spatial patches. While specific approaches reducing the effort of traveler state estimation have been proposed, these approaches are either model-specific or heuristic. Here, we introduce a Runge-Kutta (RK) stage-aligned computation of traveler states that leverages the precomputed intermediate stage values of explicit RK methods under the assumption of localized homogeneous mixing. We prove that the resulting numerical solution is identical to that of the standard Lagrangian formulation when solved with the corresponding RK method. For compartments without inflows, we further show that the exact same results can be obtained using a simple algebraic scaling based on the initial traveler share. When embedded in a recently proposed metapopulation framework that combines local dynamics with discrete mobility, the stage-aligned approach eliminates the need for heuristic traveler approximations. In contrast to the standard Lagrangian formulation, the resulting method enables efficient simulations by reducing the global ODE system to linear scaling in the number of patches, while the remaining quadratic interactions are handled through highly efficient algebraic updates. Numerical experiments confirm the theoretical results, demonstrating optimal convergence order. Benchmarks on fully connected networks with up to 1025 patches, 1024 local travel connections, and six age groups achieve speedups of up to 76 and 50 for first- and fourth-order Runge-Kutta methods, respectively.
Read the full abstract

All authors Henrik Zunker, René Schmieding, Jan Hasenauer, Martin J. Kühn

Optimization and Control

First and second-order optimality conditions for a bilinear controlled wave equation on an infinite horizon

This paper investigates the optimal control of a bilinear damped wave equation over an infinite time horizon. We establish the well-posedness of the controlled system and derive uniform energy estimates. The existence of optimal controls is proven by constructing a minimizing sequence. We prove that the control-to-state mapping is twice continuously Fréchet differentiable, which enables the derivation of first-order necessary optimality conditions in the form of a variational inequality and a pointwise projection formula. Furthermore, we establish second-order necessary and sufficient conditions: the nonnegativity of the Hessian of the cost functional is shown to be a necessary condition for local optimality, while the coercivity of this Hessian constitutes a sufficient condition. These results provide a complete characterization of local optimality for bilinear hyperbolic control systems over infinite time horizons on bounded spatial domains.
Read the full abstract

Combinatorics · Cross-listed from cs.DS

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem

The $k$-Opt algorithm is a local search algorithm for the traveling salesman problem. Starting with an initial tour, it iteratively replaces at most $k$ edges in the tour with the same number of edges to obtain a better tour. Krentel (FOCS 1989) showed that the traveling salesman problem with the $k$-Opt neighborhood is complete for the class PLS (polynomial time local search). However, his proof requires $k \gg 1000$ and has a substantial gap. We provide the first rigorous proof for the PLS-completeness and at the same time drastically lower the value of $k$ to $k \geq 15$, addressing an open question by Monien, Dumrauf, and Tscheuschner (ICALP 2010). Our result holds for both the general and the metric traveling salesman problem.
Read the full abstract

Probability · Cross-listed from stat.ME

Continuous-time modeling and bootstrap for Schnieper's reserving

We revisit Schnieper's model, which decomposes incurred but not reported (IBNR) reserves into two components: reserves for newly reported claims (true IBNR) and reserves for changes over time in the estimated cost of already reported claims (IBNER). We propose a continuous-time stochastic model for the aggregate claims process, driven by a random Poisson measure for the arrival of newly reported claims and by Brownian motion for the cost fluctuations of reported claims. This framework is consistent with the key assumptions of Schnieper's original approach. Within this setting, we develop a bootstrap method to estimate the full predictive distribution of claims reserves. Our approach naturally accounts for asymmetry, ensures non-negativity, and respects intrinsic bounds on reserves, without requiring additional assumptions. We illustrate the method through a case study and compare it with alternative stochastic techniques based on Schnieper's model.
Read the full abstract

Differential Geometry

On the smoothness of 3-dimensional skew polynomial rings

This paper is part of a series of papers in which we have investigated the differential smoothness of families of noncommutative algebras. Here, we consider this topic for the family 3-dimensional skew polynomial rings characterized by Bell and Smith \cite{BellSmith1990}.

Analysis of PDEs

The Green Function for Elliptic Systems in the Upper-Half Space

Let $L$ be a second-order, homogeneous, constant (complex) coefficient elliptic system in ${\mathbb{R}}^n$. The goal of this article is provide a qualitative and quantitative study of the nature of the Green function associated with the system $L$ in the upper-half space. Starting with a definition of the Green function which brings forth the minimal features which identify this object uniquely, we establish optimal nontangential maximal function estimates and regularity results up to the boundary for the said Green function. The main tools employed in the proof include the Agmon-Douglis-Nirenberg construction of a Poisson kernel for the system $L$, the Agmon-Douglis-Nirenberg a priori regularity estimates near the boundary, and the brand of Divergence Theorem from the book Geometric Harmonic Analysis Vol. I by the last three authors of this paper in which the boundary trace of the corresponding vector field is taken in nontangential pointwise sense.
Read the full abstract

All authors Martin Dindoš, Dorina Mitrea, Irina Mitrea, Marius Mitrea

Numerical Analysis

A Machine Learning-Enhanced Hopf-Cole Formulation for Nonlinear Gas Flow in Porous Media

Accurate modeling of gas flow through porous media is critical for many technological applications, including reservoir performance prediction, carbon capture and sequestration, and fuel cells and batteries. However, such modeling remains challenging due to strong nonlinear behavior and uncertainty in model parameters. In particular, gas slippage effects described by the Klinkenberg model introduce pressure-dependent permeability, which complicates numerical simulation and obscures deviations from classical Darcy flow behavior. To address these challenges, we present an integrated modeling framework for gas transport in porous media that combines a Klinkenberg-enhanced constitutive relation, Hopf-Cole-transformed mixed-form linear governing equations, a shared-trunk neural network architecture, and a Deep Least-Squares (DeepLS) solver. The Hopf-Cole transformation reformulates the original nonlinear flow equations into an equivalent linear system closely related to the Darcy model, while the mixed formulation, together with a shared-trunk neural architecture, enables simultaneous and accurate prediction of both pressure and velocity fields. A rigorous convergence analysis is performed both theoretically and numerically, establishing the stability and convergence properties of the proposed solver. Importantly, the proposed framework also naturally facilitates inverse modeling of pressure-dependent permeability and slippage parameters from limited or indirect observations, enabling efficient estimation of flow properties that are difficult to measure experimentally. Numerical results demonstrate accurate recovery of flow dynamics and parameters across a wide range of pressure regimes, highlighting the framework's robustness, accuracy, and computational efficiency for gas transport modeling and inversion in tight formations.
Read the full abstract

Analysis of PDEs

Long-time asymptotics for the heat kernel and for heat equation solutions on homogeneous trees

We study the large-time behavior of the continuous-time heat kernel and of solutions to the heat equation on homogeneous trees. First, we derive sharp asymptotic formulas for the heat kernel as $t\to\infty$. Second, using them, we show that solutions with initial data in weighted $\ell^1$ classes, asymptotically factorize in $\ell^p$ norms, $p\in[1,\infty]$, as the product of the heat kernel, times a $p$-mass function, dependent on the initial condition and $p$. The $p$-mass function is described in terms of boundary averages associated with Busemann functions for $p<2$, while for $p\ge 2$, it is expressed through convolution with the ground spherical function. For comparison, the case of the integers shows that a single constant mass determines the asymptotics of solutions to the heat equation for all $p$, emphasizing the influence of the graph geometry on heat diffusion.
Read the full abstract