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)

Thursday 19 March

Mathematical Physics · Cross-listed from quant-ph

Exact Law of Quantum Reversibility under Gaussian Pure Loss

Classical reverse diffusion is generated by changing the drift at fixed noise. We show that the quantum version of this principle obeys an exact law with a sharp phase boundary. For Gaussian pure-loss dynamics – the canonical model of continuous-variable decoherence in optical attenuation channels, squeezed-light interferometric sensing, and superconducting bosonic architectures – complete positivity, the requirement that the dynamics remain physical even for systems entangled with an ancilla, creates an exact phase boundary at which the minimum reverse cost vanishes, fixes the reverse-noise budget on both sides, and makes pure nonclassical targets dynamically singular. The minimum reverse cost vanishes exactly at a critical squeezing-to-thermal ratio and is strictly positive away from it, with a sharp asymmetry: below the boundary, standard reverse prescriptions such as the fixed-diffusion Bayes reverse remain feasible at mild cost; above it, these prescriptions become infeasible, the covariance-aligned generator remains CP-feasible and uniquely optimal, and the cost can be severe. The optimal reverse noise is locked to the state's own fluctuation geometry and simultaneously minimizes the geometric, metrological, and thermodynamic price of reversal. For multimode trajectories, the exact cost is additive in a canonical set of mode-resolved data, and a globally continuous protocol attains this optimum on every mixed-state interval. If a pure nonclassical endpoint is included, the same pointwise law holds for every $t>0$, but the optimum diverges as $2/t$: exact reversal of a pure quantum state is dynamically unattainable. These results establish an exact law of quantum reversibility in the canonical pure-loss setting and provide a sharp benchmark for broader theories of quantum reverse diffusion.
Read the full abstract

Dynamical Systems

Enhanced stability of pressure relief valves: mechanistic design and analysis

Pressure-relief valves, often the critical last line of defence in process engineering, are known to be susceptible to valve chatter. Such behaviour has been shown to arise from a flutter instability, or Hopf bifurcation, associated with the fundamental, quarter-wave acoustic mode of their inlet piping. Here, a novel design concept is proposed and analyzed for eliminating this instability. The concept involves using an oversized valve with reduced lift and adopting a discharge characteristic that enhances the blow-down effect, so that the valve opens immediately to its upper lift limit upon reaching set pressure. The concept is demonstrated numerically using an updated version of a 1D fluid pipe dynamics mathematical model solved using a Lax-Wendroff method. Stability properties are analysed using dynamical systems theory, applied to an improved reduced-order modal model. It is shown how the valve settles to a stable so-called pseudo equilibrium, in contact with the upper stop, provided the coefficient of restitution of is not too large. Such stable operation is reached despite the equivalent regular valve being unstable to the quarter-wave Hopf bifurcation. Parameter studies using the reduced-order model demonstrate the extent of the enhanced stability effect, which is confirmed using the full model for the case of gas service valves.
Read the full abstract

All authors Hong Tang, Istvan Erdodi, Alan R. Champneys, Csaba J. Hős

Optimization and Control

Warm-Startable Progressive Integrality Outer-Inner Approximation for AC Unit Commitment with Conic Formulation

The alternating-current unit commitment problem provides a realistic representation of power system operations, which is a nonconvex mixed-integer nonlinear programming problem and hence is computationally intractable. A common relaxation to the alternating-current unit commitment problem is based on the second-order cone, which results in a mixed-integer second-order cone program and remains computationally challenging. In this paper, we propose a warm-startable outer-inner approximation framework that alternatively solves a mixed-integer linear programming (MILP) as an outer approximation and a convex second-order cone programming as an inner approximation to find a (near-)optimal solution to the second-order cone-based alternating-current unit commitment problem. To improve computational efficiency, we introduce a progressive integrality strategy that gradually enforces integrality, reducing the reliance on expensive MILP solutions in early iterations. In addition, time-block Benders cuts are incorporated to strengthen the outer approximation and accelerate convergence. Computational experiments on large-scale test systems, including 200-bus and 500-bus networks, demonstrate that the proposed framework significantly improves both efficiency and robustness compared to state-of-the-art commercial solvers.
Read the full abstract

Probability

Uniqueness and locality of the ground state of the disordered Monomer-Dimer models on independently weighted Unimodular Bienaymé-Galton-Watson trees

Consider a finite graph $G=(V(G),E(G))$ and two continuous weight distributions $\omega$ and $\xi$, for which we only assume that $\xi$ is lower bounded. Next, independently draw weights $(w(e))_{e \in E(G)}$ with distribution $\omega$ on edges and $(x(v))_{v \in V(G)}$ with distribution $\xi$ on vertices. The ground state of the monomer-dimer model on the weighted graph $G$ is a collection of edges (dimers) and vertices (monomers) such that every vertex is included in at most one monomer or dimer, and such that the sum of weights on its dimers and monomers is maximised. Take $(G_n,o_n)_{n \in \mathbb{N}}$ to be a sequence of random rooted weighted graphs that converges locally to an independently weighted unimodular Bienaymé-Galton-Watson tree $(\mathbb{T},o)$ with vertex-weight distribution $\xi$ and edge-weight distribution $\omega$ . By proving that the ground state of the monomer-dimer model on the tree $(\mathbb{T},o)$ is almost surely unique and locally approximable, we prove that the ground state of the monomer-dimer model on $(G_n,o_n)$ must converge locally to the ground state of the monomer-dimer model on $(\mathbb{T},o)$. This also implies a strong decorrelation property on monomer-dimer models on unimodular Bienaymé-Galton-Watson trees.
Read the full abstract

Dynamical Systems

On a family of singular potentials: Parameter dependence of thermodynamic characteristics

We consider the family of singular potentials $\psi_c = 2 \log(|\sin(\pi(x-c))|)$, $c\in \mathbb{T}$ over the doubling map and we examine the dependence of several thermodynamic and multifractal characteristics on the position of the singularity $c$. This includes the pressure functions $\mathcal P(t \psi_c)$, the Birkhoff spectrum of $\psi_c$, and the $L^q$ spectrum of the associated equilibrium measure $\mu_c$. For every $c \in \mathbb{T}$, it is known that $\mu_c$ is given by the diffraction measure of a generalized Thue–Morse sequence, with the classical Thue–Morse measure arising for $c = 0$. If $t\geqslant 0$, we show that $c \mapsto \mathcal{P}(t\psi_c)$ is continuous in $c$. If $t<0$, we prove that the function $c \mapsto \mathcal{P}(t\psi_c)$ is lower semicontinuous but not continuous. In this case, we show that the continuity points are precisely those values $c$ such that $\mathcal{P}(t\psi_c) = \infty$, which form a residual set of vanishing Hausdorff dimension in $\mathbb{T}$. We obtain similar statements about the parameter (semi-)continuity of the $L^q$ spectrum and the Birkhoff spectrum.
Read the full abstract

Combinatorics

Product Structure and Treewidth of Hyperbolic Uniform Disk Graphs

Hyperbolic uniform disk graphs (HUDGs) are intersection graphs of disks with some radius $r$ in the hyperbolic plane, where $r$ may be constant or depend on the number of vertices in a family of HUDGs. We show that HUDGs with constant clique number do not admit product structure, i.e., that there is no constant $c$ such that every such graph is a subgraph of $H \boxtimes P$ for some graph $H$ of treewidth at most $c$. This justifies that HUDGs are described as not having a grid-like structure in the literature, and is in contrast to unit disk graphs in the Euclidean plane, whose grid-like structure is evident from the fact that they are subgraphs of the strong product of two paths and a clique of constant size [Dvořák et al., '21, MATRIX Annals]. By allowing $H$ to be any graph of constant treewidth instead of a path-like graph, we reject the possibility of a grid-like structure not merely by the maximum degree (which is unbounded for HUDGs) but due to their global structure. We complement this by showing that for every (sub-)constant $r$, HUDGs admit product structure, whereas the typical hyperbolic behavior is observed if $r$ grows with the number of vertices. Our proof involves a family of $n$-vertex HUDGs with radius $\log n$ that has bounded clique number but unbounded treewidth, and one for which the ratio of treewidth and clique number is $\log n / \log \log n$. Up to a $\log \log n$ factor, this negatively answers a question raised by Bläsius et al. [SoCG '25] asking whether balanced separators of HUDGs with radius $\log n$ can be covered by less than $\log n$ cliques. Our results also imply that the local and layered tree-independence number of HUDGs are both unbounded, answering an open question of Dallard et al. [arXiv '25].
Read the full abstract

All authors Thomas Bläsius, Emil Dohse, Deborah Haun, Laura Merker

Functional Analysis

On the approximation of finite perimeter sets

We prove that if $\Omega\subseteq\mathbb{R}^N$ is a set with finite perimeter with $\mathscr{H}^{N-1}(\partial \Omega\setminus\partial^* \Omega)=0$, then any set of finite perimeter $E\subseteq\mathbb{R}^N$ can be approximated by a polyhedral or smooth bounded set $F$ in such a way that both the total perimeter of $E$ and the perimeter of $E$ inside $\Omega$ are approximated by those of $F$, and the boundary of $F$ has negligible intersection with the boundary of $\Omega$. In addition, we address the approximation for perimeter and volume with densities, and we present counterexamples illustrating the sharpness of our assumptions. Our constructions rely on a technical result that replaces $E$ with a set $F$ which agrees with $E$ and has the same boundary inside $\Omega$, while sharing no common boundary with $\Omega$, and does so without substantially altering the perimeter or the volume of the original set.
Read the full abstract

All authors Alessandro Carbotti, Simone Cito, Domenico Angelo La Manna, Aldo Pratelli, Giorgio Stefani

Numerical Analysis

A bilinear inverse problem with forward operator inaccuracy applied to neonatal atlas-based diffuse optical tomography

In this work, we assume to have a set of candidate forward operator matrices and suggest principal component analysis for modeling their variation from the mean. We use this principal component representation to adapt a bilinear inverse-problem formulation to forward-operator inaccuracy in neonatal atlas-based diffuse optical tomography and present two optimization algorithms, as well as Gibbs sampling and a version of the Bayesian approximation error method, for approximately solving the resulting problem. We apply the algorithms to account for the inaccuracy that is present in the sensitivity profiles or Jacobian matrices in diffuse optical tomography when an atlas-based model of the head anatomy is used instead of the subject's own anatomical model in neonates over a wide range of gestational ages (29–44 weeks). We report visual and numerical improvements in the spatial localization and contrast-to-noise-ratio in reconstructions of simulated hemodynamic activity.
Read the full abstract

Numerical Analysis

On Affordable High-Order Entropy-Conservative/Stable and Well-Balanced Methods for Nonconservative Hyperbolic Systems

Many entropy-conservative and entropy-stable (summarized as entropy-preserving) methods for hyperbolic conservation laws rely on Tadmor's theory for two-point entropy-preserving numerical fluxes and its higher-order extension via flux differencing using summation-by-parts (SBP) operators, e.g., in discontinuous Galerkin spectral element methods (DGSEMs). The underlying two-point formulations have been extended to nonconservative systems using fluctuations by Castro et al. (2013, doi:10.1137/110845379) with follow-up generalizations to SBP methods. We propose specific forms of entropy-preserving fluctuations for nonconservative hyperbolic systems that are simple to interpret and allow an algorithmic construction of entropy-preserving methods. We analyze necessary and sufficient conditions, and obtain a full characterization of entropy-preserving three-point methods within the finite volume framework. This formulation is extended to SBP methods in multiple space dimensions on Cartesian and curvilinear meshes. Additional properties such as well-balancedness extend naturally from the underlying finite volume method to the SBP framework. We use the algorithmic construction enabled by the chosen formulation to derive several new entropy-preserving schemes for nonconservative hyperbolic systems, e.g., the compressible Euler equations of an ideal gas using the internal energy equation and a dispersive shallow-water model. Numerical experiments show the robustness and accuracy of the proposed schemes.
Read the full abstract

Combinatorics

Finite and infinite frieze patterns from p-angulations and a generalization of Weyl groupoids

A classic result of Conway and Coxeter on frieze patterns has been generalized to a bijection between $p$-angulations of regular polygons and frieze patterns of type $\Lambda_p$. One of the features of Conway-Coxeter theory is a combinatorial procedure to obtain from the triangulation all entries of the corresponding frieze pattern. We first present a combinatorial algorithm, involving Chebyshev polynomials, for obtaining from a dissection all entries of the corresponding frieze pattern. As an application we obtain a characterisation of frieze patterns of types $\Lambda_4$ and $\Lambda_6$ in terms of all entries (not only the quiddity cycle). We then study infinite frieze patterns of type $\Lambda_p$, which appeared in a preprint by Banaian and Chen, generalizing the infinite frieze patterns of positive integers studied by Baur, Parsons and Tschabold. As our main result we obtain a combinatorial model for infinite frieze patterns of type $\Lambda_p$, these are in bijection with certain $p$-angulations of an infinite strip. This extends results by Baur, Parsons and Tschabold from $p=3$ to arbitrary $p\ge 3$, and also provides new insight in the classic case. Infinite frieze patterns of positive integers appear in the context of Weyl groupoids. In the final section we extend this to infinite frieze patterns of type $\Lambda_p$ for any $p\ge 3$ by introducing a generalization of Cartan graphs and Weyl groupoids. We show that, up to equivalence, there is a 1-1 correspondence between connected simply connected Cartan graphs of type $\Lambda_p$ of rank two with infinitely many vertices permitting a root system and infinite frieze patterns of type $\Lambda_p$.
Read the full abstract

Dynamical Systems

Joint ergodicity - 40 years on

Recent years have seen dramatic progress in the study of joint ergodicity, i.e. a scenario in which a multiple ergodic average converges in norm to the product of integrals of individual functions. This survey, accompanying the talk given by the author in the Perspectives on Ergodic Theory and its Interactions conference to celebrate Vitaly Bergelson's 75th birthday, aims to summarize these recent advances, outline crucial new tools, present various open problems, and highlight the main challenges currently faced in the study of multiple ergodic averages.
Read the full abstract

Number Theory

The non-abelian Leopoldt conjecture and equalities of $\mathcal{L}$-invariants

Let $G$ be a reductive group quasi-split at $p$. Using arguments of Hansen–Thorne, we show that under the non-abelian Leopoldt conjecture (NALC), Hansen's $p$-adic overconvergent cohomology eigenvariety for $G$ is étale over its image in weight space at any non-critical classical tempered cuspidal point of `cohomological multiplicity one'. This applies to all non-critical classical cuspidal points if $G = \mathrm{Res}_{F/\mathbb{Q}}\mathrm{GL}_n$. We then let $\pi$ be a $p$-ordinary regular algebraic cuspidal automorphic representation of $\mathrm{GL}_n(\mathbb{A}_{\mathbb{Q}})$ such that $\pi_p$ is Steinberg. Combining the above étaleness result for the classical point attached to $\pi$, and a local-global compatibility result from our earlier work, we deduce – under a tangent vector hypothesis that is true for at least half the simple roots – the equality of Fontaine–Mazur and automorphic $\mathcal{L}$-invariants for $\pi$. Where this assumption is satisfied, we deduce the NALC implies a conjecture of Gehrmann: that automorphic $\mathcal{L}$-invariants are independent of cohomological degree. Our approach is inspired by (and generalises) previous work of Gehrmann–Rosso. When $\pi = \operatorname{Sym}^{n-1} \pi_f$ is the symmetric power lift of a modular form, we verify all assumptions other than the NALC, and deduce a functoriality result for the automorphic $\mathcal{L}$-invariants.
Read the full abstract

Logic

Foundational Analysis Of The Solvability Complexity Index

The Solvability Complexity Index (SCI) provides an extensional limit-height formalism for recovering a target map $\Xi$ from finite samples of an evaluation interface $\Lambda\subseteq\mathbb C^\Omega$ by finite-height towers of pointwise limits. We first give a foundational analysis of what this extensional framework does and does not determine. In second place, we give a concrete non-trivial bridge result from a comparable SCI object to the well known limit rank of Weihrauch theory.
Read the full abstract

2603.18955 · 19 Mar · Important: [arXiv:2603.18955v2]: additional discussions about evaluation-induced topologies, Kihara-style piecewise-continuity reducibilities, and feasible real RAM models and their connection to the SCI [arXiv:2603.18955v3]: Short+focused version on main results; this version: densified revised version with additional examples, algebraic properties of general algorithms

Combinatorics

On a maximal anti-Ramsey conjecture of Burr, Erdős, Graham, and Sós

Given a graph $H$, the maximal anti-Ramsey function $f(n,e,H)$ denotes the minimum integer $f$ for which there exists an $n$-vertex graph $G$ with at least $e$ edges admitting an edge-coloring with $f$ colors in which each copy of $H$ in $G$ is rainbow. In the late 1980s, Burr, Erdős, Graham, and Sós conjectured that for every odd cycle $C_{2k+1}$ with $k \ge 3$, $f(n, \lfloor n^2/4 \rfloor + 1, C_{2k+1}) = n^2/8 + o(n^2)$. In this note, we confirm this conjecture for all $k \ge 4$. More generally, we establish the asymptotic formula $$f\left(n,e,C_{2k+1}\right)=\frac{e}{2}+\frac{n}{2}\sqrt{e-\frac{n^2}{4}}+o(n^2),$$ for the entire non-trivial range of $\left\lfloor n^2/4 \right\rfloor+1\le e\le \binom{n}{2}$.
Read the full abstract

Combinatorics

Improvement on the Erdős-Kleitman conjecture via the KKL theorem

In 1974, Erdős and Kleitman conjectured that if a family $\mathcal{F}\subseteq 2^{[n]}$ contains no matching of size \(s\) and is maximal with respect to this property, then $ |\mathcal{F}|\ge \left(1-2^{-(s-1)}\right)\cdot 2^{n}. $ For decades, the best general lower bound remained the trivial $2^{n-1}$. About a decade ago, Frankl and Tokushige emphasized that obtaining a bound of the form $\left(\frac{1}{2}+\varepsilon\right)\cdot 2^n$ for some $\varepsilon>0$ is a challenging problem. A breakthrough of Bucič, Letzter, Sudakov and Tran in 2018 showed that $ |\mathcal{F}|\ge \left(1-\frac{1}{s}\right)\cdot 2^n $ via two very elegant and quite different approaches. Our main result shows that $$ |\mathcal{F}|\ge \left( 1 - \frac{1}{s + (s-2)\frac{\log n}{2\sqrt{5}n}} \right)\cdot 2^n $$ by exploiting a connection to the cornerstone result of Kahn, Kalai and Linial on influences of Boolean functions. Independently, we can also obtain a weaker improvement combining the linear algebra method with a combinatorial twist.
Read the full abstract

Numerical Analysis

Non-asymptotic uniform in time error bounds for new and old numerical schemes for SPDEs

We study numerical schemes for Stochastic Partial Differential Equations (SPDEs). We introduce a general method of proof of non-asymptotic uniform in time error bounds on numerical integrators for SPDEs, ensuring the schemes capture both the transient and the long term dynamics faithfully. We then consider SPDEs with non-globally Lipshitz nonlinearities, which include for example the stochastic Allen-Cahn equation and some stochastic advection-diffusion equations. For the case of Allen-Cahn type SPDEs we show that the classic semi-implicit Euler time-discretization can exhibit finite time blow up. This motivates analysing other schemes which do not suffer from this blow-up problem. We consider three numerical schemes for SPDEs with non globally Lipshitz nonlinearity: a fully implicit scheme and two tamed schemes. For these schemes we prove non-asymptotic uniform in time error bounds by leveraging our general criterion, and provide numerical comparisons. While the main emphasis in this paper is on the properties of the time-discretization, the schemes we consider are full space-time discretization of the SPDE.
Read the full abstract

Differential Geometry

Gaussian Volume Functional, Integral Scalar Curvature, and Minimal Super-Ricci Flows

We present a synthetic notion of scalar curvature (and its integral) for Riemannian manifolds and metric measure spaces, defined in terms of the initial slope of a Gaussian (double) integral. We explicitly calculate the integral scalar curvature for Lipschitz gluings of smooth Riemannian manifolds and for cones. In dimension 2, the former coincides with the formula derived by Gauss-Bonnet, whereas the latter differs. The extension to the time-dependent case allows us to characterize Ricci flows as super Ricci flows with minimal integral curvature functional.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Kernel Single-Index Bandits: Estimation, Inference, and Learning

We study contextual bandits with finitely many actions in which the reward of each arm follows a single-index model with an arm-specific index parameter and an unknown nonparametric link function. We consider a regime in which arms correspond to stable decision options and covariates evolve adaptively under the bandit policy. This setting creates significant statistical challenges: the sampling distribution depends on the allocation rule, observations are dependent over time, and inverse-propensity weighting induces variance inflation. We propose a kernelized $\varepsilon$-greedy algorithm that combines Stein-based estimation of the index parameters with inverse-propensity-weighted kernel ridge regression for the reward functions. This approach enables flexible semiparametric learning while retaining interpretability. Our analysis develops new tools for inference with adaptively collected data. We establish asymptotic normality for the single-index estimator under adaptive sampling, yielding valid confidence regions, and derive a directional functional central limit theorem for the RKHS estimator, which provides asymptotically valid pointwise confidence intervals. The analysis relies on concentration bounds for inverse-weighted Gram matrices together with martingale central limit theorems. We further obtain finite-time regret guarantees, including $\tilde{O}(\sqrt{T})$ rates under common-link Lipschitz conditions, showing that semiparametric structure can be exploited without sacrificing statistical efficiency. These results provide a unified framework for simultaneous learning and inference in single-index contextual bandits.
Read the full abstract

Information Theory

Theoretical Analyses of Detectors for Additive Noise Channels with Mean-Variance Uncertainty under Nonlinear Expectation Theory

In classical information theory, both the form and performance of the optimal detector for additive noise channels can be precisely derived, based on the assumption that the channel noise follows a specific probability distribution or a mixture of known distributions, or that the exact distribution exists but is unknown. In this paper, we extend the analyses of detectors for additive noise channel to the situation where the probability model for analyzing channels is uncertain, utilizing nonlinear expectation theory. We consider two types of distribution uncertainties: one with no mean uncertainty but with variance uncertainty, and another with both mean and variance uncertainties. We derive the optimal threshold detectors for binary input additive noise channel under the nonlinear expectation optimal criterion for both scenarios and provide their explicit forms. Our findings reveal that mean uncertainty significantly influences the form of the optimal detector, whereas variance uncertainty does not. Additionally, we propose an estimation method for the uncertain parameters of the channel noise. Finally, we present theoretical analyses and simulated performance results of the newly derived optimal threshold detectors, and compare these results with the performance of optimal detector under classical information theory, which assumes a deterministic probability model. The results of experiments show that our new detection methods outperform conventional methods in most scenarios with uncertain probability models, showing the practical relevance of our theoretical contributions.
Read the full abstract

Analysis of PDEs

A Sudakov Decomposition in Riemannian Manifolds with Positive Curvature

In this paper, we study Monge's problem on Riemannian manifolds $(M, g)$ with positive sectional curvature. Assuming that the source and target measures are absolutely continuous with respect to the Riemannian volume measure, we generalize a variational method from the Euclidean setting to establish the existence of a transport density and an explicit disintegration of measures along optimal rays. These results extend the approach of Bianchini-Caravenna to the Riemannian context.
Read the full abstract

Algebraic Topology

On Topological André-Quillen homology of Eilenberg-MacLane spectra

Based on the work of Dundas, Lindenstrauss and Richter we compute the topological André-Quillen homology with reduced coefficients for Eilenberg-MacLane spectra such as $H\mathbb{Z}$ and $H\mathbb{Z}/p^n$. The case of $H\mathbb{F}_p$ was settled in an unpublished work of Basterra and Mandell, which was refined later by Brantner and Mathew in the context of spectral partition Lie algebras. Our approach is similar to Cartan's calculation of the Steenrod algebra, and eventually shorter. We also present some computations relative to the $H\mathbb{Z}$ base.
Read the full abstract

Analysis of PDEs

Well-posedness for the $\bar\partial$-problem relevant to the AKNS spectral problem

The well-posedness for the Dbar problem associated with the AKNS spectral problem is considered. In general, the relevant Dbar equation with normalization condition is quivalent to an integral equation, where the kernel involves exponents $\mathrm{e}^{\pm2ikx}$ with physical variable $x$ as a parameter. We develop a decomposition technique to control the convergence of the integral by defining a new integral operator $RT_{\mathbb{C}}(k;x)$. The small norm condition of the operator is obtained to show that there exists a unique solution for the Dbar problem. Moreover, the Dbar dressing method is extended to construct the AKNS spectral problem and the potential construction is presented via the Dbar data. Prior estimates are given to show that the map from the Dbar data to the AKNS potential is Lipschitz continuous.
Read the full abstract

Metric Geometry

On the Duality of Coverings in Hilbert Geometry

We prove polarity duality for covering problems in Hilbert geometry. Let $G$ and $K$ be convex bodies in $\mathbb{R}^d$ where $G \subset \operatorname{int}(K)$ and $\operatorname{int}(G)$ contains the origin. Let $N^H_K(G,\alpha)$ and $S^H_K(G,\alpha)$ denote, respectively, the minimum numbers of radius-$\alpha$ Hilbert balls in the geometry induced by $K$ needed to cover $G$ and $\partial G$. Our main result is a Hilbert-geometric analogue of the König-Milman covering duality: there exists an absolute constant $c \geq 1$ such that for any $\alpha \in (0,1]$, \[ c^{-d}\,N^H_{G^{\circ}}(K^{\circ},\alpha) ~ \leq ~ N^H_K(G,\alpha) ~ \leq ~ c^{d}\,N^H_{G^{\circ}}(K^{\circ},\alpha), \] and likewise, \[ c^{-d}\,S^H_{G^{\circ}}(K^{\circ},\alpha) ~ \leq ~ S^H_K(G,\alpha) ~ \leq ~ c^{d}\,S^H_{G^{\circ}}(K^{\circ},\alpha). \] We also recover the classical volumetric duality for translative coverings of centered convex bodies, and obtain a new boundary-covering duality in that setting. The Hilbert setting is subtler than the translative one because the metric is not translation invariant, and the local Finsler unit ball depends on the base point. The proof involves several ideas, including $\alpha$-expansions, a stability lemma that controls the interaction between polarity and expansion, and, in the boundary case, a localized relative isoperimetric argument combined with Holmes–Thompson area estimates. In addition, we provide an alternative proof of Faifman's polarity bounds for Holmes–Thompson volume and area in the Funk and Hilbert geometries.
Read the full abstract

Combinatorics

An Ore-type Theorem for Oriented Discrepancy of Hamilton Cycles

Oriented discrepancy concerns the existence of prescribed subgraphs whose edges exhibit a substantial imbalance between the two directions. The Hamilton cycle case was first investigated by Gishboliner, Krivelevich, and Michaeli. Subsequently, Freschi and Lo established a sharp minimum-degree result and raised the question of whether a corresponding Ore-type theorem holds. For an oriented graph $G$ on $n$ vertices, define $\sigma_2(G):=\min\{d_G(x)+d_G(y):x\neq y,\ xy,yx\notin E(G)\},$ with $\sigma_2(G):=2(n-1)$ when $G$ is a tournament. Given a cycle $C$ in an oriented graph, let $\sigma_{\max}(C)$ denote the maximum number of edges oriented consistently with one of the two traversal directions of $C$. We prove that for every $\gamma>0$ there exists $n_0$ such that every oriented graph $G$ on $n\ge n_0$ vertices with $\sigma_2(G)\ge n$ contains a Hamilton cycle $C$ satisfying $$ \sigma_{\max}(C)\geq \max\left\{\frac n2,\frac{\sigma_2(G)}2-\gamma n\right\}. $$ This partially answers a question of Freschi and Lo and gives an asymptotic affirmative answer to a conjecture of Ai et al. The bound is asymptotically best possible.
Read the full abstract

All authors Yufei Chang, Yangyang Cheng, Zhilan Wang, Shuo Wei, Jin Yan

Numerical Analysis · Cross-listed from cs.LG

Neural Galerkin Normalizing Flow for Transition Probability Density Functions of Diffusion Models

We propose a new Neural Galerkin Normalizing Flow framework to approximate the transition probability density function of a diffusion process by solving the corresponding Fokker-Planck equation with an atomic initial distribution, parametrically with respect to the location of the initial mass. By using Normalizing Flows, we look for the solution as a transformation of the transition probability density function of a reference stochastic process, ensuring that our approximation is structure-preserving and automatically satisfies positivity and mass conservation constraints. By extending Neural Galerkin schemes to the context of Normalizing Flows, we derive a system of ODEs for the time evolution of the Normalizing Flow's parameters. Adaptive sampling routines are used to evaluate the Fokker-Planck residual in meaningful locations, which is of vital importance to address high-dimensional PDEs. Numerical results show that this strategy captures key features of the true solution and enforces the causal relationship between the initial datum and the density function at subsequent times. After completing an offline training phase, online evaluation becomes significantly more cost-effective than solving the PDE from scratch. The proposed method serves as a promising surrogate model, which could be deployed in many-query problems associated with stochastic differential equations, like Bayesian inference, simulation, and diffusion bridge generation.
Read the full abstract

Numerical Analysis

A Stabilized Mortar Method for Discontinuities in Geological Media with Non-Conforming Grids

Accurate numerical simulation of fault and fracture mechanics is critical for the performance and safety assessment of many subsurface systems. The discretized representation of discontinuity surfaces and the robust simulation of their frictional contact behavior still represent major challenges. In this work, we use the mortar method to enforce the contact constraints and allow for non-conformity around the discontinuity surface, with a set of Lagrange multipliers playing the role of interface tractions. The formulation combines piecewise linear displacements with piecewise constant multipliers defined on one side of the fault interface (the non-mortar side). This choice for the Lagrange multipliers has a number of advantages from practical and computational viewpoints, but violates the inf-sup stability constraint. In order to stabilize the proposed formulation, we develop a traction-jump stabilization term to be added to the constraint equations. We use a macro-element analysis to derive an algorithmic strategy that automatically evaluates the proper scaling of the stabilization, without requiring any additional user-selected parameter. Numerical experiments demonstrate that the proposed formulation not only restores the inf-sup stability condition, but also recovers stable traction profiles in the presence of finer non-mortar sides, where other inf-sup-stable formulations fail. The proposed method is finally used to simulate non-linear contact conditions in non-conforming corner-point grids typically used in industrial geological applications.
Read the full abstract

Optimization and Control

Optimal strategies for controlled growth in metastable Kawasaki dynamics

In this paper, we develop a Markov decision process (MDP) formulation for the low–temperature metastable Ising model evolving according to Kawasaki dynamics in a finite box of the two–dimensional square lattice. We analyze how an external controller can guide the system to the all–occupied state by appropriately adding and moving particles at specified moments in time. To this end, we construct a reduced MDP on a constrained family of configurations having a single cluster, a regime where particle attachment is more likely than detachment. We investigate two reward structures: one that depends solely on the time to reach the target configuration, and another that incorporates action–dependent energy costs. Within this MDP framework, we characterize the exact optimal policies under both reward structures, which turn out to have a different behavior: while a purely efficiency–based criterion promotes the growth from the boundary centers of the cluster, an energy–based reward function favours the growth at the corners of the cluster.
Read the full abstract

Analysis of PDEs

Optimal Bilinear control restricted to the three-dimensional chemo-repulsion model with potential production

In this paper we study the following three-dimensional parabolic-parabolic chemo-repulsion model with potential production, logistic reaction and bilinear control, defined in $Q=(0,T)\times\Omega$: \begin{equation*}\label{eq0} \left\{ \begin{array}{rcl} \partial_tu-\Delta u&=&\nabla\cdot(u\nabla v)+r\,u-\mu\, u^p,\\ \partial_tv-\Delta v+v&=&u^p+f\,v\, 1_{\Omega_c}, \end{array} \right. \end{equation*} where $1< p<+\infty$, $r,\mu\geq 0$, and $f=f(t,x)$ is the control function acting on a subdomain $(0,T)\times \Omega_c $, with $\Omega_c\subseteq\Omega$. This system is endowed with initial and non-flux boundary conditions. We prove the existence of global weak solutions of this controlled problem when $f\in L^{5/2}(0,T;L^{5/2}(\Omega_c))$, analyzing the role of the diffusion and the logistic terms to get energy estimates. In particular, the logistic competition term $\mu \, u^p$ is necessary only for $p>5/3$. Secondly, if $f\in L^{5/2}(0,T;L^{5/2+}(\Omega_c))$, any weak solution $(u,v)$ satisfying the regularity criterion $u\in L^{5p/2}(Q)\cap L^{10/3}(Q)$ is in fact more regular, arriving in particular to $u,\nabla v\in L^5(Q)$ for $p\le 2$ and $u,\nabla v\in L^{5(p-1)}(Q)$ for $p> 2$ which is the critical regularity to solve a related optimal bilinear control problem. In fact, this setting let us to prove the existence of global optimal solutions, and the differentiability of the control-to-state mapping via the Implicit Function Theorem in Banach spaces. Then, we can identify the gradient of the (reduced) cost with respect to the control solving the adjoint problem by duality. In particular, we derive first-order necessary optimality conditions for local optimal solutions.
Read the full abstract

All authors Francisco Guillen-Gonzalez, Exequiel Mallea-Zepeda, Maria A. Rodriguez-Bellido, Elder J. Villamizar-Roa

Optimization and Control · Cross-listed from cs.LG

Uniform a priori bounds and error analysis for the Adam stochastic gradient descent optimization method

The adaptive moment estimation (Adam) optimizer proposed by Kingma & Ba (2014) is presumably the most popular stochastic gradient descent (SGD) optimization method for the training of deep neural networks (DNNs) in artificial intelligence (AI) systems. Despite its groundbreaking success in the training of AI systems, it still remains an open research problem to provide a complete error analysis of Adam, not only for optimizing DNNs but even when applied to strongly convex stochastic optimization problems (SOPs). Previous error analysis results for strongly convex SOPs in the literature provide conditional convergence analyses that rely on the assumption that Adam does not diverge to infinity but remains uniformly bounded. It is the key contribution of this work to establish uniform a priori bounds for Adam and, thereby, to provide – for the first time – an unconditional error analysis for Adam for a large class of strongly convex SOPs.
Read the full abstract

Commutative Algebra

On the $S$-version of some special elements in commutative rings

In this paper, we introduce and study the $S$-versions of several fundamental elements in commutative rings. Specifically, for a commutative ring $R$ with identity and a multiplicative subset $S$, we define and investigate the notions of $S$-invertible, $S$-idempotent, $S$-von Neumann regular, and $S$-$\pi$-regular elements. We establish their basic properties, interrelations, and structural inclusions, and use them to characterize classes of rings. Special attention is given to the uniform $S$-counterparts of Boolean and $\pi$-regular rings, where we provide examples distinguishing these from their classical analogues. Several transfer results under homomorphisms and direct product constructions are established, and connections with existing $S$-counterparts (uniformly $S$-von Neumann regular, uniformly $S$-Artinian, etc.) are highlighted. Throughout the paper, we point out several open problems, offering directions for further research.
Read the full abstract

All authors D. Bennis, A. Bouziri, S. D. Kumar, T. Singh