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)

Saturday 21 March

Number Theory

Relating Mahler measures and Dirichlet $L$-values: new evidence for Chinburg's conjectures

Let $\chi_{-f}$ be the odd quadratic Dirichlet character of conductor $f$, and let $\mathrm{m}(P)$ denote the Mahler measure of a polynomial $P$. In 1984, Chinburg conjectured that for any such $\chi_{-f}$ there exist an integral bivariate rational function $P$ (and, in the strong form, an integral polynomial) such that $\mathrm{m}(P)$ is a rational multiple of $L'(\chi_{-f},-1)$. The strong form of the conjecture was previously known to hold for $18$ values of $f$. We double the number of numerical examples, giving $8$ new instances of the strong and $18$ new instances of the weak conjecture. Our examples arise from an explicit approach, which also captures almost all of the previously known results, and is based on work of Boyd and Rodriguez-Villegas. Moreover, we prove Chinburg's weak conjecture if we allow cyclotomic coefficients.
Read the full abstract

Numerical Analysis

Preserving Conservation Laws in the Time-Evolving Natural Gradient Method via Relaxation and Projection Techniques

Neural networks have demonstrated significant potential in solving partial differential equations (PDEs). While global approaches such as Physics-Informed Neural Networks (PINNs) offer promising capabilities, they often lack inherent temporal causality, which can limit their accuracy and stability for time-dependent problems. In contrast, local training frameworks that progressively update network parameters over time are naturally suited for evolving PDEs. However, a critical challenge remains: many physical systems possess intrinsic invariants – such as energy or mass – that must be preserved to ensure physically meaningful solutions. This paper addresses this challenge by enhancing the Time-Evolving Natural Gradient (TENG) method, a recently proposed local training framework. We introduce two complementary techniques: (i) a relaxation algorithm that ensures the target solution $u_{\text{target}}$ preserves both quadratic and general nonlinear invariants of the original system, providing a structure-preserving learning target; and (ii) a projection technique that maps the updated network parameters $\theta(t)$ back onto the invariant manifold, ensuring the final neural network solution strictly adheres to the conservation laws. Numerical experiments on the inviscid Burgers equation, Korteweg-de Vries equation, and acoustic wave equation demonstrate that our proposed approach significantly improves conservation properties while maintaining high accuracy.
Read the full abstract

Combinatorics

Faber-Krahn inequalities for first Dirichlet eigenvalues of combinatorial $p$-Laplacian on graphs with boundary

In this paper, we obtain sharp Faber-Krahn inequalities for the first Dirichlet eigenvalue of the combinatorial $p$-Laplacian on connected graphs with a fixed number of vertices or with a fixed number of edges. More precisely, we show that the minimum of the first $p$-Dirichlet eigenvalues of connected graphs with boundary that consist of $n$ vertices or $n$ edges is achieved only on the tadpole graph $T_{n,3}$ when $p>1$.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Curvature bounds, regularity and inextendibility of spacetimes

We provide a completely new relation between curvature bounds and definiteness of the causal character of maximizers by exploiting the robust notion of synthetic curvature. This enables us to relate low-regularity inextendibility of spacetimes to unboundedness of curvature - which is at present unattainable using classical methods - thereby strengthening and complementing the results of Grant-Kunzinger-Saemann (2019) significantly.
Read the full abstract

Functional Analysis

On the geometry of $G$-norm

Let $X$ and $Y$ be Banach spaces and let $G \in L(X,Y)$ with $\|G\|=1$. We study the geometry of $G$-(semi-)norm on $L(X,Y)$, defined by \[ \|T\|_G := \inf_{\delta>0}\sup\{\|Tx\|: \|x\|=1, \|Gx\|>1-\delta\}, \] considering it as a norm ($G$-norm), and further explore the associated numerical indices. In particular, we characterize relative spear operators, that is, operators for which the numerical radius with respect to $G$ coincides with the $G$-norm. Relations among the numerical indices and their invariance under isometric isomorphisms are established. We further obtain a description of the dual unit ball of $(L(X,Y),\|\cdot\|_G)$ and characterize smooth points of its unit ball. In finite-dimensional Hilbert spaces, we prove that relative spear operators are partial isometries. Finally, we establish some equivalent criteria for which the $G$-norm is achieved by the norm attainment set of a norm-attaining operator $G$.
Read the full abstract

Rings and Algebras

Infinitesimal deformations of $\mathfrak{sl}_2$ with a twisted Jacobi identity

We show that whenever \[ [\,\cdot,\cdot]_t = [\,\cdot,\cdot]_0 + t[\,\cdot,\cdot]_1,\qquad \alpha_t = \mathrm{id} + t\alpha_1 \] define an infinitesimal Hom–Lie deformation of $\mathfrak{sl}_2(\mathbb K)$ over $\mathbb K[t]/(t^2)$ and $(\mathfrak{sl}_2(\mathbb K),[\,\cdot,\cdot]_0,\alpha_1)$ is a Hom–Lie algebra, then the deformed bracket $[\,\cdot,\cdot]_t$ satisfies the ordinary Jacobi identity over $\mathbb K[t]$. This solves a conjecture of Makhlouf and Silvestrov from 2010.
Read the full abstract

Combinatorics · Cross-listed from cs.DS

(Sets of ) Complement Scattered Factors

Starting in the 1970s with the fundamental work of Imre Simon, scattered factors (also known as subsequences or scattered subwords) have remained a consistently and heavily studied object. The majority of work on scattered factors can be split into two broad classes of problems: given a word, what information, in the form of scattered factors, are contained, and which are not. In this paper, we consider an intermediary problem, introducing the notion of complement scattered factors. Given a word $w$ and a scattered factor $u$ of $w$, the complement scattered factors of $w$ with regards to $u$, $C(w, u)$, is the set of scattered factors in $w$ that can be formed by removing any embedding of $u$ from $w$. This is closely related to the shuffle operation in which two words are intertwined, i.e., we extend previous work relating to the shuffle operator, using knowledge about scattered factors. Alongside introducing these sets, we provide combinatorial results on the size of the set $C(w, u)$, an algorithm to compute the set $C(w, u)$ from $w$ and $u$ in $O(\vert w \vert \cdot \vert u \vert \binom{w}{u})$ time, where $\binom{w}{u}$ denotes the number of embeddings of $u$ into $w$, an algorithm to construct $u$ from $w$ and $C(w, u)$ in $O(\vert w \vert^2 \binom{\vert w \vert}{\vert w \vert - \vert u \vert})$ time, and an algorithm to construct $w$ from $u$ and $C(w, u)$ in $O(\vert u \vert \cdot \vert w \vert^{\vert u \vert + 1})$ time.
Read the full abstract

Analysis of PDEs

Equivalence of Uniform Polyconvexity and Almgren Uniform Ellipticity for Lipschitz $Q$-Graph Test Pairs

We investigate the relationship between uniform polyconvexity of anisotropic geometric integrands and Almgren's uniform ellipticity. We first establish the converse implication for uniform ellipticity with respect to polyhedral test pairs, thereby strengthening earlier results. Our main theorem shows that uniform polyconvexity is equivalent to Almgren's uniform ellipticity with respect to Lipschitz $Q$-graph test pairs, building on techniques developed by De Rosa, Lei, and Young. As a consequence, we show that for a classical integrand, uniform polyconvexity is equivalent to uniform quasiconvexity of the associated $Q$-integrand for every~$Q \in \natp$.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Ordinal Patterns Based Testing of Spatial Independence in Irregular Spatial Structures

We propose a nonparametric test of spatial independence for data observed on irregular, non-lattice point clouds $\mathcal{V}_{n}\subset\mathbb{R}^{2}$. For each location $v\in\mathcal{V}_{n}$, we encode the local spatial configuration through the ordinal pattern of the $m$ nearest-neighbour observations, obtaining a symbolic representation that is invariant under strictly monotone transformations and robust to outliers. Under the null hypothesis of spatial independence, the local ordinal patterns are i.i.d.\ and uniformly distributed over the symmetric group $\mathcal{S}_{m}$, regardless of the unknown marginal distribution $F$. We exploit this characterisation to construct a test statistic $L_{n}$ based on the additive log-ratio (ALR) transformation of the empirical ordinal-pattern frequencies. Invoking a central limit theorem for graph-dependent processes under a graph-based $\alpha$-mixing condition, we establish that $L_{n}$ converges in distribution to a $\chi^{2}_{m!-1}$ random variable, yielding an asymptotically pivotal procedure with no nuisance parameters. An extensive Monte Carlo study confirms that the $\chi^{2}_{m!-1}$ approximation is accurate already at moderate sample sizes, that the test controls size at the nominal level, and that power increases monotonically with the strength of spatial dependence. Notably, the test detects dependence in both linear and nonlinearly transformed spatial autoregressive models, illustrating the robustness that is characteristic of ordinal-pattern methods. Our framework extends the spatial ordinal-pattern testing paradigm from regular lattices to general spatial supports, opening the door to ordinal-pattern inference in the many applied settings where observations are irregularly located.
Read the full abstract

All authors Giorgio Micali, David Garnés-Galindo, Mariano Matilla-García, Manuel Ruiz-Marín

Mathematical Physics

Propagation of Condensation via Neumann Localization in the Dilute Bose Gas

We prove a Neumann localization inequality for the Laplacian that includes a spectral gap. This result is obtained by partitioning a cube into overlapping families of subcubes and analysing the associated projection operators. The resulting operator inequality goes through a discrete Neumann Laplacian on the lattice of boxes and yields a quantitative spectral gap estimate. As an application, we consider the dilute Bose gas with Neumann boundary conditions. Combining the localization method with recently established free-energy lower bounds, we propagate strong condensation estimates from the Gross Pitaevskii scale to larger boxes of side length $R\sim a(\rho a^3)^{-\frac{3}{4}-\eta}$.
Read the full abstract

Combinatorics

Spectral radii and star-factors with large components

Let $G$ be a connected graph with $n$ vertices. The isolated toughness of $G$, denoted by $I(G)$, is defined by $I(G)=\min\left\{\frac{|S|}{i(G-S)}:S\subseteq V(G) \ \mbox{and} \ i(G-S)\geq2\right\}$ if $G$ is not complete, or $I(G)=+\infty$ if $G$ is complete. A graph $G$ is called isolated $r$-tough if $I(G)\geq r$. A spanning subgraph $H$ of $G$ is called a $\{K_{1,j}:m\leq j\leq2m\}$-factor of $G$ if every component of $H$ is isomorphic to an element of $\{K_{1,j}:m\leq j\leq2m\}$. Let $\rho(G)$, $q(G)$ and $\mu(G)$ denote the adjacency spectral radius, the signless Laplacian spectral radius and the distance spectral radius of $G$, respectively. Let $m$ and $b$ be two positive integers with $m\geq2$. In this paper, we first establish a lower bounds on the adjacency spectral radius of a connected isolated $\frac{mb-1}{b}$-tough graph $G$ to guarantees that $G$ contains a $\{K_{1,j}:m\leq j\leq2m\}$-factor. Second, we establish a lower bounds on the signless Laplacian spectral radius of a connected isolated $\frac{mb-1}{b}$-tough graph $G$ to ensures that $G$ contains a $\{K_{1,j}:m\leq j\leq2m\}$-factor. Finally, we create an upper bounds on the distance spectral radius of a connected isolated $\frac{mb-1}{b}$-tough graph $G$ with a $\{K_{1,j}:m\leq j\leq2m\}$-factor. Furthermore, we construct some extremal graphs to claim that all the bounds obtained in this paper are sharp.
Read the full abstract

Optimization and Control

A reliability-aware randomized simheuristic for the stochastic team orienteering problem

We study a stochastic variant of the Team Orienteering Problem with lognormal travel times and an all-or-nothing reward policy, under which the reward of a route is lost if its travel time exceeds the available budget. We propose a reliability-aware simheuristic that combines a savings-based constructive heuristic with three specific design elements: a Top-$L_{\mathrm{top}}$ randomization mechanism, stochastic screening of the savings parameter, and an explicit reliability threshold for solution selection. Computational experiments on the Chao et al. benchmark show that the method is competitive with the VNS-based simheuristic of Panadero et al. (2020) on a non-trivial subset of instances using a significantly simpler architecture, with the largest gains on two-vehicle sub-families with long routes where the reliability-aware selection compensates for the absence of VNS-style exploration. On larger multi-vehicle instances the simpler architecture is outperformed, and this trade-off is discussed explicitly.
Read the full abstract

Statistics Theory

Asymptotic statistical theory of irreducible quantum Markov chains

In this paper we investigate the asymptotic statistical theory of irreducible quantum Markov chains, focusing on identifiability properties and asymptotic convergence of associated quantum statistical models. We show that the space of identifiable parameters for the stationary output is a stratified space called an orbifold, which is obtained as the quotient of the manifold of irreducible dynamics by a compact group of state preserving symmetries. We analyse the orbifold's geometric properties, the connection between periodicity and strata, and provide orbifold charts as the starting point for the local asymptotic theory. The quantum Fisher information rate of the system and output state is expressed in terms of a canonical inner product on the identifiable tangent space. We then show that the joint system and output model satisfies quantum local asymptotic normality while the stationary output model converges to a product between a quantum Gaussian shift model and a mixture of quantum Gaussian shift models, reflecting the underlying periodicity. These strong convergence results provide the basis for constructing asymptotically optimal estimators of dynamical parameters. We provide an in-depth analysis of the model with smallest dimensions, consisting of two-dimensional system and environment units.
Read the full abstract

Optimization and Control

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions

In this work, we propose derivative-free framework for bilevel optimization. We consider both the upper and lower-level problems with bound constraints on the variables, as well as general nonlinear constraints, assuming that first-order information (in the upper-level) is not available or it is impractical to obtain. The lower-level problem is solved with an accuracy that is progressively refined throughout the optimization process. We first analyze the case in which the upper-level problem is subject only to bound constraints, establishing convergence to Clarke-Jahn stationary points when the refinement process is allowed to reach its maximum precision. When a limitation is imposed on this refinement process, we prove convergence to approximate stationary points using an extended notion of Goldstein stationarity. Finally, we extend the proposed framework to handle more complex constraints via an exact penalty function approach, proving convergence to stationary points under suitable assumptions. A comprehensive numerical study on 160 problems from the BOLIB collection shows that the adaptive accuracy strategy consistently yields better results than fixed-precision solves, with its benefits becoming more pronounced as the required lower-level accuracy becomes more stringent.
Read the full abstract

Numerical Analysis

Convergence of a finite volume method to weak solutions for the compressible Navier-Stokes-Fourier system

We prove strong convergence of an upwind-type finite volume method to a weak solution of the Navier-Stokes-Fourier system with the Dirichlet boundary conditions. The limit solution satisfies a weak form of the mass and momentum equations, together with a weak form of the entropy and ballistic energy inequalities, and complies with the weak-strong uniqueness principle. The finite volume method uses piecewise-constant spatial approximations. The convergence proof is based on a combination of delicate consistency estimates with a careful analysis of the oscillations of numerical densities via renormalisation of the continuity equation.
Read the full abstract

All authors Eduard Feireisl, Maria Lukacova-Medvidova, Bangwei She, Yuhuan Yuan

Algebraic Geometry

An explicit expression of the Richelot isogeny through Kleinian hyperellyptic functions

We find an explicit expression for the Richelot isogeny of Kummer surfaces of genus 2 curves in terms of Kleinian hyperelliptic functions of weight 2. We use this expression to relate Kleinian hyperelliptic functions associated to Richelot isogenous curves.

Optimization and Control

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization

In this paper, we study the local convergence of the standard ADMM scheme for a class of nonconvex composite optimization problems motivated by applications in signal processing and machine learning. The problems are constrained by a closed convex set, while their objective is the sum of a continuously differentiable, possibly nonconvex, smooth term and a polyhedral convex nonsmooth term composed with a linear mapping. Motivated by recent works of Rockafellar, we first provide an elementary proof of a local strong convexity property of the Moreau envelope of polyhedral convex functions on the orthogonal complement of an appropriate subspace. Building on this property, we establish the strong variational sufficiency of the reduced augmented Lagrangian under an appropriate second-order condition. We then derive a descent inequality for the ADMM iterates that is analogous to the classical descent inequality for convex ADMM. For a sufficiently large penalty parameter, and under suitable initialization and local trajectory conditions, we prove that the ADMM sequence converges to a stationary primal-dual point. When the constraint set is polyhedral convex, we further show that the weighted distance of the primal-dual sequence to the local solution set converges Q-linearly, while the primal sequence converges R-linearly. Finally, we present three illustrative examples together with an application-oriented verification for a class of possibly nonconvex quadratic programs, illustrating the role of the second-order condition, the local nature of the convergence theory, and its applicability.
Read the full abstract

Numerical Analysis

Residual Recombination Methods as Anderson-like Acceleration: An Algebraic Interpretation of BoostConv

BoostConv has been introduced in earlier works as an effective acceleration technique for nonlinear iterative processes and has been successfully employed in a variety of applications to enhance convergence rates or to compute unstable fixed points that are otherwise inaccessible through standard approaches. Despite its demonstrated practical effectiveness, the theoretical properties of the method have not yet been fully characterized. In this work, we present a more robust formulation of the BoostConv algorithm and, for the first time, provide a rigorous proof of its local convergence. The proposed analysis places BoostConv within a precise mathematical framework, clarifying its interpretation as a nonlinear convergence accelerator and establishing sufficient conditions under which convergence to a fixed point is guaranteed. The theoretical findings are illustrated through several numerical examples, spanning from a linear problem to a low-dimensional benchmark and a large-scale incompressible Navier-Stokes simulation. These results demonstrate the robustness and practical relevance of the proposed method and bridge the gap between empirical performance and rigorous analysis, paving the way for further developments and applications to complex nonlinear problems.
Read the full abstract

Optimization and Control

Optimality in Decentralized Optimization under Bandwidth Constraints

We consider a realistic decentralized setup with bandwidth-constrained communication and derive optimal time complexities for non-convex stochastic parallel and asynchronous optimization (up to logarithmic factors). We develop the corresponding methods, Grace SGD and Leon SGD, for both homogeneous and heterogeneous settings. Unlike previous work, our optimal bounds are characterized in terms of min-cut/max-flow quantities and rely on tools from Gomory-Hu trees and Steiner Tree Packing problems, providing tighter and more practical complexities.
Read the full abstract

Information Theory

Tackling heavy-tailed noise in distributed estimation: Asymptotic performance and tradeoffs

We present an algorithm for distributed estimation of an unknown vector parameter $\boldsymbol{\theta}^\ast \in {\mathbb R}^M$ in the presence of heavy-tailed observation and communication noises. Heavy-tailed noises frequently appear, e.g., in densely deployed Internet of Things (IoT) or wireless sensor network systems. The presented algorithm falls within the class of consensus+innovation estimators and combats the effect of the heavy-tailed noises by adding general nonlinearities in the consensus and innovations update parts. We present results on almost sure convergence and asymptotic normality of the estimator. In addition, we provide novel analytical studies that reveal interesting tradeoffs between the system noises and the underlying network topology.
Read the full abstract

All authors Dragana Bajovic, Dusan Jakovetic, Soummya Kar, Manojlo Vukovic

Optimization and Control

Neural network model for mathematical programming problems with complementary constraints

In this paper, we propose a a gradient-based neural network model to solve the mathematical programming problems with complementary constraints (MPCC). In order to facilitate tractable optimization, the problem MPCC is transformed via a regularized approach into a relaxed nonlinear optimization problem NLP($\beta$). After that employing the penalty function and neural network model an estimate of the optimal solution of the problem NLP($\beta$) is obtained. On the basis of Lyapunov stability theory and LaSalle invariance principle, the equilibrium point of proposed neural network is theoretically proven to be asymptotically stable and capable to generate optimal solution of the problem MPCC. Further, we demonstrate the performance and dynamic behavior of the proposed neural network through various illustrative examples and its effectiveness via theoretical and numerical experiments.
Read the full abstract

Combinatorics

Classification of perfect and total perfect codes in generalized Petersen graphs

In a graph $\Gamma$, a perfect code is an independent set $C$ with the property that every vertex not in $C$ is adjacent to a unique vertex in $C$, and a total perfect code is a set $C$ of vertices of $\Gamma$ such that every vertex of $\Gamma$ is adjacent to a unique vertex in $C$. We classify these codes for generalized Petersen graphs.
Read the full abstract

Algebraic Geometry

Periods of Limiting Mixed Hodge Structures of Projective Hypersurfaces

For a generic one-parameter degeneration of projective hypersurfaces, we show that the periods of the limiting mixed Hodge structure are generated by certain special values of logarithm, Gamma and Dirichlet $L$-functions. Our proof is based on the analytic continuation of solutions to the GKZ system.
Read the full abstract

Mathematical Physics

Vertex Centrality Reconstruction in an Inverse Problem for Information Diffusion

We consider an inverse problem in information diffusion modeled by random walks on combinatorial graphs. The problem concerns reconstruction of vertex centrality from the distribution of the first passage times observed on a subset of vertices. We adapt the boundary control method to obtain a direct algorithm that computes the unobserved vertex centrality. The algorithm is numerically implemented and validated on small graphs.
Read the full abstract

Dynamical Systems · Cross-listed from nlin.AO

Coevolutionary dynamics of cooperation, risk, and cost in collective risk games

Addressing both natural and societal challenges requires collective cooperation. Studies on collective-risk social dilemmas have shown that individual decisions are influenced by the perceived risk of collective failure. However, existing feedback evolving game models often focus on a single feedback mechanism, such as the coupling between cooperation and risk or between cooperation and cost. In many real-world scenarios, however, the level of cooperation, the cost of cooperating, and the collective risk are dynamically interlinked. Here, we present an evolutionary game model that considers the interplay of these three variables. Our analysis shows that the worst-case scenario, characterized by full defection, maximum risk, and the highest cost of cooperation, remains a stable evolutionary attractor. Nevertheless, cooperation can emerge and persist because the system also supports stable equilibria with non-zero cooperation. The system exhibits multistability, meaning that different initial conditions lead to either sustained cooperation or a tragedy of the commons. These findings highlight that initial levels of cooperation, cost, and risk collectively determine whether a population can avert a tragic outcome.
Read the full abstract

All authors Lichen Wang, Shijia Hua, Yuyuan Liu, Liang Zhang, Linjie Liu, Attila Szolnoki

Combinatorics

Double Toeplitz codes and their average weight enumerators

Recently, double Toeplitz codes have been introduced as a generalization of double circulant codes. In this paper, we study the average weight enumerators of double Toeplitz codes. As an application, we consider the existence of double Toeplitz codes over $\mathbb{F}_q$ with some specified minimum weights for $q \in \{2,3,4\}$. We also give a classification of double Toeplitz codes over $\mathbb{F}_q$ with the largest minimum weights for moderate lengths and $q \in \{2,3,4\}$.
Read the full abstract

Dynamical Systems

Shift maps and statistical invariants for some dynamical systems

Given a dynamical system, we study the so-called space of shift functions thus introducing another vision on bifurcations and chaos. As an application of the obtained results, we give a partial solution to an open problem formulated in \cite{Misiurewicz1}: to describe all the one-dimensional maps with all the periodic orbits having the same mean value. Moreover, we show that there are continuous families of such mappings having infinitely many periodic points. For this purpose, we study the dynamics of the so-called replicator maps, depending on two parameters. Such studies are also motivated by the analysis of the dynamics of evolutionary games under selection. We prove the existence of hyperbolic chaos for the considered map and demonstrate that the average values are the same for all the periodic orbits.
Read the full abstract