Peer Revenue Publish or profit

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 1 April

Combinatorics

Rationality of certain triangle tilings

We consider tilings of a triangle $ABC$ by congruent copies of a triangle that has one angle equal to $120^\circ$, has non-commensurable angles (that is, not all angles are rational multiples of $\pi$), and is not similar to $ABC$. We prove that any such tiling has commensurable sides, meaning that the side lengths can be taken to be integers after scaling. As a consequence, we show that outside of a couple of special cases, a triangle (allowing all angles) tiling must either have commensurable angles or commensurable sides (that is, all sides have rational ratios).
Read the full abstract

Analysis of PDEs

Finite-time stabilization via impulse control of degenerate singular parabolic equations

This paper examines the impulse controllability of degenerate singular parabolic equations through a modern framework focused on finite-time stabilization. Furthermore, we provide an explicit estimate for the exponential decay of the solution. The proof of our main result combines a logarithmic convexity estimate with specific spectral properties. Finally, we establish the existence and uniqueness of the minimal norm impulse control associated with the system.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

An Online Machine Learning Multi-resolution Optimization Framework for Energy System Design Limit of Performance Analysis

Designing reliable integrated energy systems for industrial processes requires optimization and verification models across multiple fidelities, from architecture-level sizing to high-fidelity dynamic operation. However, model mismatch across fidelities obscures the sources of performance loss and complicates the quantification of architecture-to-operation performance gaps. We propose an online, machine-learning-accelerated multi-resolution optimization framework that estimates an architecture-specific upper bound on achievable performance while minimizing expensive high-fidelity model evaluations. We demonstrate the approach on a pilot energy system supplying a 1 MW industrial heat load. First, we solve a multi-objective architecture optimization to select the system configuration and component capacities. We then develop an machine learning (ML)-accelerated multi-resolution, receding-horizon optimal control strategy that approaches the achievable-performance bound for the specified architecture, given the additional controls and dynamics not captured by the architectural optimization model. The ML-guided controller adaptively schedules the optimization resolution based on predictive uncertainty and warm-starts high-fidelity solves using elite low-fidelity solutions. Our results on the pilot case study show that the proposed multi-resolution strategy reduces the architecture-to-operation performance gap by up to 42% relative to a rule-based controller, while reducing required high-fidelity model evaluations by 34% relative to the same multi-fidelity approach without ML guidance, enabling faster and more reliable design verification. Together, these gains make high-fidelity verification tractable, providing a practical upper bound on achievable operational performance.
Read the full abstract

All authors Oluwamayowa O. Amusat, Luka Grbcic, Remi Patureau, M. Jibran S. Zuberi, Dan Gunter, Michael Wetter

Category Theory · Cross-listed from cs.LO

Compositional Program Verification with Polynomial Functors in Dependent Type Theory

We present a framework for compositional program verification based on polynomial functors in dependent type theory. In this framework, polynomial functors serve as program interfaces, Kleisli morphisms for the free monad monad serve as implementations, and dependent polynomials encode pre/postcondition specifications. We show that implementations and their verifications compose via wiring diagrams, and that Mealy machines provide a compositional coalgebraic operational semantics. We identify the abstract categorical structure underlying this compositionality as a monoidal functor from specifications to interfaces with a compatible monoidal natural transformation of lax monoidal presheaves; this opens the door to generalizations to other categories, monoidal products, etc., including settings for concurrency and relational verification, which we sketch. As a proof-of-concept, the entire framework has been formalized in Agda.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Numerically Optimizing Shortcuts to Adiabaticity: A Hybrid Control Strategy

Achieving fast, excitation-free quantum control is a vital challenge in modern quantum technologies. In many cases, shortcuts to adiabaticity enable fast adiabatic-like protocols, yet determining control parameters that satisfy practical constraints is often challenging in complex systems. Here, we combine an analytical shortcut to adiabaticity approach with several numerical optimization methods to boost the performance of the protocol. As a proof-of-principle for this hybrid approach, we study a particularly intricate control problem, the separation of two trapped ions. We show that this analytical-numerical approach, along with the physical insight gained through the variety of suboptimal solutions, leads to the exploration of new solutions in a complex landscape that yield improvements of up to 3 orders of magnitude. Moreover, this improvement comes with no additional cost from an experimental point of view.
Read the full abstract

All authors Bo Xing, Jesús G. Parejo, Sofía Martínez-Garaot, Paola Cappellaro, Mikel Palmero

Optimization and Control

On explicit solutions to a class of quadratic BSDEJs driven by affine Volterra processes with jumps and applications

In this paper we consider a class of quadratic BSDEs with jumps (quadratic BSDEJs) involving inhomogeneous affine Volterra processes and show that their solution can be reduced to solving a system of generalized inhomogeneous integral Riccati-Volterra ordinary differential equations with Lévy jump compensators. This yields a rich and flexible class of quadratic BSDEJs that are analytically tractable, in the sense that their solutions are explicit up to the solution of an associated integral Riccati-Volterra ODE with Lévy jump compensator. As an application, we provide analytically tractable solutions to the continuous-time Markowitz mean-variance portfolio selection problem within a multivariate class of affine Volterra models allowing jumps driven by an independent Poisson random measure. In this non-Markovian and non-semimartingale market framework with unbounded random coefficients, the classical stochastic control approach cannot be directly applied to the associated optimization task. Instead, the problem is tackled using the martingale optimality principle by constructing a family of submartingale processes characterized via solutions to a novel Riccati backward stochastic differential equation with jumps (Riccati BSDEJ), particular subclass of the aforementionned quadratic BSDEJ. Specifically, we obtain analytical closed-form expressions for the optimal feedback control as well as the mean-variance efficient frontier, both of which depend on the solution to the associated multivariate inhomogeneous Riccati-Volterra system, while the optimal value function is expressed using the solution to this original Riccati BSDEJ. Furthermore, numerical experiments on a two-dimensional fake stationary rough Heston model is discussed and used to highlight the impact of stabilized rough volatilities on the Markowitz allocation problem.
Read the full abstract

Probability

Bridging classical and martingale Schrödinger bridges

We investigate the martingale Schrödinger bridge, recently introduced by Nutz and Wiesel as a distinguished martingale transport plan between two probability measures in convex order. We show that this construction extends naturally to arbitrary dimension and admits several equivalent characterizations. In particular, we identify its continuous-time counterpart as the continuous martingale with prescribed marginals that minimizes a weighted quadratic energy measuring the deviation from Brownian motion. In the irreducible case, we prove that this continuous martingale Schrödinger bridge coincides with the Föllmer martingale, that is, with the Doob martingale associated to a suitable Föllmer process. More generally, we relate the martingale Schrödinger bridge to a variational problem over base measures and to the dual formulation of the corresponding weak optimal transport problem, thereby clarifying its connection with the classical Schrödinger bridge.
Read the full abstract

All authors Julio Backhoff, Mathias Beiglböck, Giorgia Bifronte, Armand Ley

Optimization and Control · Cross-listed from cs.LG

Sven: Singular Value Descent as a Computationally Efficient Natural Gradient Method

We introduce Sven (Singular Value dEsceNt), a new optimization algorithm for neural networks that exploits the natural decomposition of loss functions into a sum over individual data points, rather than reducing the full loss to a single scalar before computing a parameter update. Sven treats each data point's residual as a separate condition to be satisfied simultaneously, using the Moore-Penrose pseudoinverse of the loss Jacobian to find the minimum-norm parameter update that best satisfies all conditions at once. In practice, this pseudoinverse is approximated via a truncated singular value decomposition, retaining only the $k$ most significant directions. We show that Sven can be understood as a natural gradient method generalized to the overparametrized regime, recovering natural gradient descent in the underparametrized limit. We test Sven on a variety of regression and classification tasks, including small-scale language modeling with transformers, and find that it is competitive with leading baselines such as Adam, Muon, and K-FAC. We also discuss Sven's memory overhead, which presents a barrier to scaling under a naive implementation, and introduce an optimized implementation that keeps memory usage on par with standard baselines under mild restrictions on model architecture. Beyond standard machine learning benchmarks, we anticipate that Sven will find natural application in scientific computing settings where custom loss functions decompose into several conditions.
Read the full abstract

All authors Samuel Bright-Thonney, Thomas R. Harvey, Andre Lukas, Jesse Thaler

Statistics Theory

Observable Geometry of Singular Statistical Models

Singular statistical models arise whenever different parameter values induce the same distribution, leading to non-identifiability and a breakdown of classical asymptotic theory. While existing approaches analyze these phenomena in parameter space, the resulting descriptions depend heavily on parameterization and obscure the intrinsic statistical structure of the model. In this paper, we introduce an invariant framework based on observable charts: collections of functionals of the data distribution that distinguish probability measures. These charts define local coordinate systems directly on the model space, independent of parameterization. We formalize observable completeness as the ability of such charts to detect identifiable directions, and introduce observable order to quantify higher-order distinguishability along analytic perturbations. Our main result establishes that, under mild regularity conditions, observable order provides a lower bound on the rate at which Kullback-Leibler divergence vanishes along analytic paths. This connects intrinsic geometric structure in model space to statistical distinguishability and recovers classical behavior in regular models while extending naturally to singular settings. We illustrate the framework in reduced-rank regression and Gaussian mixture models, where observable coordinates reveal both identifiable structure and singular degeneracies. These results suggest that observable charts provide a unified and parameterization-invariant language for studying singular models and offer a pathway toward intrinsic formulations of invariants such as learning coefficients.
Read the full abstract

Statistics Theory

Horseshoe Priors and MDP

Carvalho (2010) established two foundational theorems for the horseshoe prior: tight two-sided logarithmic bounds on the marginal density near the origin (Theorem~1.1), and a super-efficient rate of convergence of the Bayes predictive density to the true sampling density in sparse situations (Theorem~2). The “Shrink Globally, Act Locally” paper \citep{polson2010shrink} formalised necessary and sufficient conditions on the prior's behaviour at the origin for sparsity adaptation as $p \to \infty$. We show that these results are not merely descriptive properties of the horseshoe – they are the finite-sample precursors to the asymptotic moderate deviation principle (MDP) of \citet{datta2026newlook}. The log-pole singularity $\piH(\theta) \asymp -\log\abs{\theta}$ is precisely the origin integrability boundary that selects the MDP threshold $\tcrit = \sqrt{\log(\pi n/2)}$; super-efficiency below the threshold and tail robustness above it together produce the ABOS Bayes risk $p_0 \log(p/p_0)/n$; and the Clarke–Barron information-theoretic asymptotics of Bayes methods provide the unifying framework in which all three results are faces of a single logarithmic budget principle.
Read the full abstract

Information Theory

Coverage and Rate Analysis of Follower-Based LEO Satellite Networks: A Stochastic Geometry Approach

To mitigate inter-satellite interference and payload limits in LEO mega-constellations, satellite clusters, groups of small cooperative satellites have been proposed to improve performance and reduce interference. The typical configuration divides the cluster into a leader satellite with full processing and control capabilities and multiple simpler follower satellites that assist with coverage and throughput. These clusters enhance coverage and throughput, prompting interest in their performance gains and optimal deployment. Given that the spherical stochastic geometry (SG) model has been proven effective for modeling such structures, we establish a performance evaluation framework based on the SG approach for the leader-follower satellite architecture, enabling an assessment of communication performance under different deployment configurations quantitatively. We derive analytical expressions for the outage probability and average data rate to evaluate the communication performance of the satellite system, along with low-complexity approximations. Numerical results demonstrate the performance advantages of the leader-follower architecture over a single leader satellite and explore optimal deployment configurations for the follower satellites.
Read the full abstract

Probability · Cross-listed from cs.DS

Near-Optimal Parallel Approximate Counting via Sampling

The computational equivalence between approximate counting and sampling is well established for polynomial-time algorithms. The most efficient general reduction from counting to sampling is achieved via simulated annealing, where the counting problem is formulated in terms of estimating the ratio $Q={Z(\beta_{\max})}/{Z(\beta_{\min})}$ between partition functions $Z(\beta)=\sum_{x\in \Omega} \exp(\beta H(x))$ of Gibbs distributions $\mu_\beta$ over $\Omega$ with Hamiltonian $H$, given access to a sampling oracle that produces samples from $\mu_\beta$ for $\beta \in [\beta_{\min}, \beta_{\max}]$. The best bound achieved by known annealing algorithms with relative error $\varepsilon$ is $O(q \log h / \varepsilon^2)$, where $q, h$ are parameters which respectively bound $\ln Q$ and $H$. However, all known algorithms attaining this near-optimal complexity are inherently sequential, or *adaptive*: the queried parameters $\beta$ depend on previous samples. We develop a simple non-adaptive algorithm for approximate counting using $O(q \log^2 h / \varepsilon^2)$ samples, as well as an algorithm that achieves $O(q \log h / \varepsilon^2)$ samples with just two rounds of adaptivity, matching the best sample complexity of sequential algorithms. These algorithms naturally give rise to work-efficient parallel (RNC) counting algorithms. We discuss applications to RNC counting algorithms for several classic models, including the anti-ferromagnetic 2-spin, monomer-dimer and ferromagnetic Ising models.
Read the full abstract

All authors David G. Harris, Vladimir Kolmogorov, Hongyang Liu, Yitong Yin, Yiyao Zhang

Logic · Cross-listed from econ.TH

What aggregation rules can be classified as logical concepts?

In this paper, we study aggregation rules with nontrivial symmetric classes of invariant sets (restricted domains), assuming that they, unlike others, have a logical nature. In the simplest case, we provide a complete classification of such rules. Our primary tools are methods of universal algebra and the theory of closed classes of discrete functions.
Read the full abstract

General Mathematics

RBF Kernel Parameter Formula for Data Classification Methods

Radial Basis Function (RBF), or Gaussian, kernels are among the most widely used parametric kernels in machine learning, particularly in methods such as Support Vector Machines (SVM) and kernel-based subspace approaches. The kernel parameter $\gamma$ (or $\sigma$ in the Gaussian formulation) must be carefully tuned, as the performance of these methods strongly depends on its value and is highly sensitive to improper selection. In practice, this parameter is typically determined through computationally expensive training procedures, which may also lack robustness. In this paper, we propose an efficient analytical formula for selecting the RBF kernel parameter that significantly reduces the computational cost of RBF-based methods. The proposed approach is derived by optimizing the diameter of mapped classes in the feature space while simultaneously maximizing inter-class feature distances. The detailed formulation is presented, and its efficiency is validated on the widely used SVM algorithm as well as on a Proper Orthogonal Decomposition (POD)-based subspace method for both binary and multi-class classification problems.
Read the full abstract

Probability

Enhanced Asymptotic Analysis of Continuous-Time Markov Branching Systems: Revisiting Limiting Structural Theorems

Markov branching systems form a fundamental class of stochastic models that are extensively applied in biology, physics, finance, and other domains. These systems are distinguished by their continuous-time evolution and inherent branching structure, allowing transitions to multiple states from a single one. This branching mechanism plays a critical role in modeling phenomena such as population dynamics, epidemic spread, and probabilistic systems with multiple outcomes. Unlike standard Markov processes, branching systems require a simultaneous treatment of transition dynamics and branching probabilities, resulting in a more intricate mathematical framework. In this work, we investigate the asymptotic properties of transition functions in continuous-time Markov branching-immigration systems. Our focus lies in refining known limit theorems, establishing convergence rates, and deriving improved asymptotic expansions under relaxed moment conditions. The results contribute to a deeper understanding of the long-term behavior and invariant structures within these systems.
Read the full abstract

All authors Azam A Imomov, Sarvar B. Iskandarov, Jakhongir B. Azimov, Hurshidjon Q. Jumaqulov

Number Theory

On Series Involving Cubed Catalan Numbers

Using generalized binomial coefficient identities and some results of John Dougall, we derive some families of series involving the cubes of Catalan numbers. We also establish a family of series containing fourth powers of Catalan numbers. Finally, we find a generalization of the Bauer series for $1/\pi$ and obtain some Ramanujan-like series for $1/\pi^2$ and~$1/\pi^3$.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Conditional channel entropy sets fundamental limits on thermodynamic quantum information processing

The thermodynamic resourcefulness of quantum channels primarily depends on their underlying causal structure and their ability to generate quantum correlations. We quantify this interplay within the resource theory of athermality for bipartite quantum channels in the presence of a side channel acting as memory, referred to as the resource theory of conditional athermality. For channels with trivial output Hamiltonians, we characterize the optimal one-shot rates for distilling the identity gate from a given channel, as well as the cost of simulating the channel using the identity gate, under conditional Gibbs-preserving superchannels. We show that these rates have a direct trade-off relation with the conditional channel entropies, attributing operational significance to signaling in quantum processes. Furthermore, we establish an asymptotic equipartition property for the conditional channel min-entropy for classes of channels that are either tele-covariant or no-signaling from the non-conditioning input to the conditioning output. As a consequence, we demonstrate asymptotic reversibility of the resource theory for these channels. The asymptotic conditional athermality capacity of a tele-covariant channel is half the superdense coding capacity of its Choi state. Our work establishes the conditional channel entropy as a primitive information-theoretic concept for quantum processes, elucidating its potential for wider applications in quantum information science.
Read the full abstract

Probability

Rotationally invariant first passage percolation: Breaking the $n/\log n$ variance barrier

For first passage percolation (FPP) on Euclidean lattices $\mathbb{Z}^d$ with $d\ge 2$, it is expected that the variance of the first passage time between two points grows sublinearly in the distance with a universal exponent strictly smaller than $1$. Following Kesten's $O(n)$ upper bound (Ann. Appl. Probab., 1993) on the variance, Benjamini, Kalai and Schramm (Ann. Probab., 2003) used hypercontractivity to obtain an improvement of a factor of $\log n$ when passage times take two values with equal probability. This was later extended to more general classes of passage time distributions. However, unlike in exactly solvable planar models in last passage percolation where the variance is known to be $\Theta(n^{2/3})$, the best known upper bound for the variance of passage times has remained $O(n/\log n)$ in all non-trivial variants of FPP. For a class of rotationally invariant Riemannian FPP on the plane, we show that the variance is $O(n^{1-\varepsilon})$ for some $\varepsilon>0$. Our argument uses fluctuation estimates for passage times and geodesics derived in Basu, Sidoravicius and Sly (2023) together with a multi-scale argument to establish that the geodesic exhibits disorder chaos, i.e., upon resampling a small fraction of the underlying randomness, the updated geodesic has on average a small overlap with the original one; this, established at a large number of scales, leads to a polynomial improvement of the variance bound.
Read the full abstract

Analysis of PDEs

Regularity theorems for random elliptic operators on domains

Regularity theorems à la Avellaneda-Lin are an indispensable part of the modern quantitative theory of stochastic homogenization. While interior regularity results for random elliptic operators have been available for a while, on general smooth domains the existing theory has until recently remained limited to Lipschitz estimates. We establish $C^{1,\alpha}$ regularity results for random elliptic operators on bounded sufficiently smooth domains, as well as for scalar problems on convex polytopes. We, furthermore, prove a number of auxiliary results typically employed in the derivation of fluctuation bounds, such as a weighted Meyers estimate.
Read the full abstract

All authors Peter Bella, Julian Fischer, Marc Josien, Claudia Raithel

Symplectic Geometry

Topological algebra of symplectic geometry of symmetric powers

To a noncompact orientable surface with no closed boundary, we associate the sum of Fukaya categories of (Liouville sectors associated to) its symmetric powers. We construct sectorial covers with the combinatorics of the bar resolution to show this association extends to an open 2d topological field theory – without naming a Lagrangian, let alone a holomorphic disk. In particular, we recover results of Rouquier and Manion on extending Heegaard-Floer theory down to an interval.
Read the full abstract

Numerical Analysis · Cross-listed from quant-ph

Programmable Signal Design for Quantum Phase Estimation via Quantum Signal Processing

Quantum phase estimation is a central primitive in quantum algorithms and sensing, where performance is governed by the sensitivity of measurement signals to the target parameter. While existing methods have developed increasingly sophisticated inference and adaptive design strategies, the signal family used for phase learning is often largely pre-specified. Here we propose a programmable signal design framework for quantum phase estimation based on quantum signal processing, which enables the measurement signal to be tailored to the current uncertainty region. We cast phase estimation as a max-min optimization problem over admissible signals and introduce a sensitivity efficiency parameter that quantifies information gain per query depth. The resulting iterative algorithm combines optimized quantum signal transformations with structured classical inference, retaining Heisenberg-limited scaling while improving sensitivity efficiency and practical resource prefactors. Numerical results show reduced estimation variance compared with standard protocols such as robust phase estimation. Our framework also extends to Hamiltonian eigenvalue estimation in higher dimensions and establishes a quantum-classical co-design paradigm through programmable signal shaping.
Read the full abstract

Numerical Analysis

A Posteriori Error Analysis of Runge-Kutta Discontinuous Galerkin Schemes with SIAC Post-Processing for Nonlinear Convection-Diffusion Systems

We develop reliable a posteriori error estimators for fully discrete Runge-Kutta discontinuous Galerkin approximations of nonlinear convection-diffusion systems endowed with a convex entropy in multiple spatial dimensions on the flat torus T^d, with a focus on the convection-dominated regime. In order to use the relative entropy method, we reconstruct the numerical solution via tensor-product Smoothness-Increasing Accuracy-Conserving (SIAC) filtering which has superconvergence properties. We then derive reliable a posteriori error estimators for the difference between the entropy weak solution and the reconstruction, with constants that are uniform in the vanishing viscosity limit. Our numerical experiments show that the a posteriori error bounds converge with the same order as the error of the reconstructed numerical solution.
Read the full abstract

Numerical Analysis

A high-order, structure preserving scheme for the stochastic Galerkin shallow water equations – unification and two-dimensional extension

Recently, two independent research efforts have been made to study the stochastic Galerkin formulation of the shallow water equations. Bender and Öffner developed entropy-conservative discontinuous Galerkin (DG) methods to solve the stochastic shallow water equations in a stochastic Galerkin framework using Roe variable transformation, while Dai, Epshteyn and collaborators proposed second-order, energy-stable and well-balanced schemes for the same class of problems with a specific projection step used inside the Galerkin projection together with high-order quadrature rules and a time-step restriction. In this paper, we provide a comprehensive comparison of the two methodologies mentioned, focusing on their theoretical properties and practical implementation aspects. We highlight shared foundational concepts and key differences of both approaches, with a particular focus on the selection of basis functions in the stochastic domain. As a highlight, we show that under specific conditions, the two formulations align, offering a unified framework that connects these distinct approaches. From our theoretical findings, we extend the development of high-order entropy conservative DG methods for the one-dimensional stochastic Galerkin shallow equations to two space dimensions; constructing entropy conservative two-point fluxes via primitive variables instead of entropy variables and applying it in our high-order DG setting. In numerical simulations, we verify and support our theoretical findings of a well-balanced and entropy-stable DG scheme which can be used to solve geophyiscal fluid flows with uncertainty.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Quantum Gibbs Sampling in Infinite Dimensions: Generation, Mixing Times and Circuit Implementation

We develop a rigorous and implementable framework for Gibbs sampling of infinite-dimensional quantum systems governed by unbounded Hamiltonians. Extending dissipative Gibbs samplers beyond finite dimensions raises fundamental obstacles, including ill-defined generators, the absence of spectral gaps on natural Banach spaces, and tensions between implementability and convergence guarantees. We overcome these issues by constructing KMS-symmetric quantum Markov semigroups on separable Hilbert spaces that are both well-posed and efficiently implementable on qubit hardware. Our generation theory is based on the abstract framework of Dirichlet forms, adapted here to the case of algebras of bounded operators over separable Hilbert spaces. Leveraging the spectral properties of our self-adjoint generators, we establish quantitative convergence results in trace distance, including regimes of fast thermalization. In contrast, we also identify Hamiltonians for which a naive choice of generators guaranteeing implementability generally comes at the cost of losing uniform exponential convergence guarantees for the associated evolutions, thereby establishing a strong trade-off between implementability and convergence. Our framework applies to a wide class of models - including Schrödinger operators, Gaussian systems, and Bose-Hubbard Hamiltonians - and provides a unified approach linking rigorous infinite-dimensional analysis with algorithmic Gibbs state preparation.
Read the full abstract

Number Theory

Solutions of Calabi-Yau Differential Operators as Truncated p-adic Series and Efficient Computation of Zeta Functions

Recently, a version of the deformation method developed in arXiv:2104.07816 has been used to great effect to compute the local zeta functions of Calabi-Yau threefolds by computing their periods as series with rational coefficients and using this to find a matrix representing the Frobenius action on a $p$-adic cohomology. However, this method rapidly becomes inefficient as the prime $p$ grows, due to the rational period coefficients growing quickly. In this paper, we point out that this problem can be circumvented by a simple process that we call $p$-adically truncated recurrence. This is a recurrence relation whose solutions are $p$-adic numbers modulo $p^A$ for a given $A \in \mathbb{N}$ and thus grow only slowly as $p$ grows. We show that the $p$-adic accuracy $A$ can be chosen such that all $p$-adic digits which contribute to the final result are kept, and therefore we are able to obtain the correct result by using these solutions. The improvements to speed and memory usage allow for computing the local zeta functions for tens of thousands of primes on a desktop computer, and make computing local zeta functions possible even for primes of size $10^6$ to $10^7$. Previously such computations were practically possible for around 1000 first primes. We have implemented this method in a Sage-compatible Python package PFLFunction.
Read the full abstract

All authors Pyry Kuusela, Michael Lathwood, Miroslava Mosso Rojas, Michael Stepniczka

Combinatorics

High genus one part monotone Hurwitz numbers

We obtain bivariate asymptotics for one part monotone Hurwitz numbers in high genus (i.e. as both the size and the genus go to infinity). To do so, we start with a linear recurrence for these numbers obtained by Do and Chaudhuri. Then, we apply a recent method developped by Elvey-Price, Fang, Wallner and the second author to extract asymptotics from such recurrences.
Read the full abstract

Numerical Analysis

On the error of the Euler scheme for approximation of solutions of nonlinear DDEs under inexact information

We analyze the behavior of the Euler method for delay differential equations under nonstandard assumptions on the right-hand-side function f, when evaluations of f are corrupted by informational noise. We provide theoretical upper bounds on the Euler discretization error and present results from the numerical experiments.
Read the full abstract

Metric Geometry

Moving rectangular sofas in planar and spatial corridors

We consider eight natural planar corridors, including the standard $\mathrm{L}$-shaped one, and characterize the rectangles that can move around their corners. As a bi-product we describe completely the corresponding rectangles with maximum area, as well as the rectangular parallelepipeds with maximum volume that can move around the corners of the spatial analogues of the considered eight planar corridors.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Safe learning-based control via function-based uncertainty quantification

Uncertainty quantification is essential when deploying learning-based control methods in safety-critical systems. This is commonly realized by constructing uncertainty tubes that enclose the unknown function of interest, e.g., the reward and constraint functions or the underlying dynamics model, with high probability. However, existing approaches for uncertainty quantification typically rely on restrictive assumptions that encode smoothness properties of the unknown function, such as a known norm in a function space. Moreover, these methods usually struggle with discontinuities. In this paper, we model the unknown function as a random function from which independent and identically distributed realizations can be generated. We then construct uncertainty tubes via the scenario approach that hold with high probability. Our uncertainty tubes rely solely on sampled realizations and can therefore accommodate discontinuities represented by the sampling model. We integrate these uncertainty tubes into a safe Bayesian optimization algorithm with which we safely tune control parameters on a real Furuta pendulum.
Read the full abstract

All authors Abdullah Tokmak, Toni Karvonen, Thomas B. Schön, Dominik Baumann

Numerical Analysis

Markov chain Monte Carlo for Bayesian inference of the non-conducting region in intra-atrial reentrant tachycardia

We present a Bayesian approach to estimate the parameters of mathematical models of cardiac electrophysiology with quantified uncertainty. Such models capture the dynamics of the electrical signal that coordinates the muscle cell contraction in the heart wall and can support cardiac arrhythmia treatment. We consider an illustrative case motivated by a cardiac arrhythmia, namely, by intra-atrial reentrant tachycardia. We estimate a low-dimensional geometrical parameter that describes the boundary of an electrically non-conducting region in the heart tissue from synthetic electrical measurements outside of the tissue. Instead of relying on a deterministic fit for this region, we estimate a posterior distribution on the geometrical parameter using Bayesian inference that captures the uncertainty due to measurement errors. We propose a likelihood based on a set of quantities that characterize the data for improved accuracy. To efficiently approximate the posterior distribution, we propose a compressed likelihood function and an adapted Metropolis-Hastings (MH) algorithm. We obtain an algorithm that strongly decreases the number of samples by using an adaptive proposal strategy. Our algorithm also gives attention to the impact of discretization errors on inference outcomes, as these introduce artificial discontinuities in the posterior if not properly addressed. We account for discretization errors in the likelihood and in the accept-reject step of our adapted MH algorithm to improve the robustness of our estimates and to further increase the sampling efficiency. All of these elements combined give us a method that efficiently estimates the non-conducting parameters with uncertainty. We perform several experiments with different amounts of measurement noise and illustrate how this translates into the posterior distributions.
Read the full abstract

All authors Maarten Volkaerts, Marie Cloet, Hans Dierckx, Piet Claus, Giovanni Samaey