Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 3 April

Optimization and Control

Stabilized Proximal Point Method via Trust Region Control

The Proximal Point Method (PPM) (Rockafellar, 1976) is a fundamental tool for nonsmooth convex optimization. However, its convergence is not linear under general convexity in the absence of strong convexity or other structural assumptions. To address this limitation, we study a trust-region stabilized proximal point scheme in which each proximal update is computed over a localized feasible region. We show that this simple stabilization enforces non-vanishing steps and yields a linear decrease in objective values outside any prescribed neighborhood, without assuming smoothness or strong convexity. Our analysis identifies a displacement condition as the key driver of linear descent and provides two complementary parameter regimes to guarantee it: fixing the trust-region radius and choosing the regularization properly, or fixing the regularization and selecting radii via a uniform displacement lower bound. We further give explicit characterization of the linear regime conditions respectively, and prove that the trust-region is redundant under strong convexity, Finally, we establish an exact equivalence with the Broximal Point Method (BPM) (Gruntkowska et al., 2025) in the active constraint regime.
Read the full abstract

Dynamical Systems · Cross-listed from nlin.CD

Self-excited oscillations in multi-degree-of-freedom systems subjected to discontinuous forcing

This study investigates the existence and stability of limit cycles resulting from self-excited oscillations in linear multi-degree-of-freedom systems subjected to discontinuous, state-dependent forcing. Using the method of averaging and slow-flow phase-plane analysis, analytical expressions are derived for the amplitudes and stability boundaries of limit cycles in a two-degree-of-freedom system. The analysis demonstrates that stable limit cycles may exist in all natural modes, with the steady-state response governed by initial conditions in regimes of multistability. A central contribution of this work is the identification and analytical characterization of the stability-axis-flipping (SAF) bifurcation, which serves as the governing mechanism for the exchange of stability between modes. The framework is then systematically extended to systems with higher degrees of freedom, confirming that the SAF bifurcation remains a universal feature, even under varying feedback configurations. The steady-state dynamics, summarized through stability maps and validated by numerical simulations, delineate the existence and stability regions of modal limit cycles as functions of key system parameters. These results provide efficient criteria for guiding optimization studies to mitigate or generate limit cycles at targeted frequencies in flexible mechanical structures.
Read the full abstract

Information Theory · Cross-listed from cs.DC

Digital Twin-Assisted In-Network and Edge Collaboration for Joint User Association, Task Offloading, and Resource Allocation in the Metaverse

Advancements in extended reality (XR) are driving the development of the metaverse, which demands efficient real-time transformation of 2D scenes into 3D objects, a computation-intensive process that necessitates task offloading because of complex perception, visual, and audio processing. This challenge is further compounded by asymmetric uplink (UL) and downlink (DL) data characteristics, where 2D data are transmitted in the UL and 3D content is rendered in the DL. To address this issue, we propose a digital twin (DT)-based in-network computing (INC)-assisted multi-access edge computing (MEC) framework that enables real-time synchronization and collaborative computing via URLLC. In this framework, a network operator manages wireless and computational resources for XR user devices (XUDs), while XUDs autonomously offload tasks to maximize their utilities. We model the interactions between XUDs and the operator as a Stackelberg Markov game, where the optimal offloading strategy constitutes an exact potential game with a Nash Equilibrium (NE), and the operator's problem is formulated as an asynchronous Markov decision process (MDP). We further propose a decentralized solution in which XUDs determine offloading decisions based on the operator's joint UL-DL optimization of offloading mode (INC-E or MEC only) and DL power allocation. A Nash-asynchronous hybrid multi-agent reinforcement learning (AMRL) algorithm is developed to predict the UL user-associated and DL transmission power, thereby achieving NE. Simulation results demonstrate that the proposed approach considerably improves system utility, uplink rate, and energy efficiency by reducing latency and optimizing resource utilization in metaverse environments.
Read the full abstract

All authors Ibrahim Aliyu, Seungmin Oh, Sangwon Oh, Jinsul Kim

Differential Geometry

On the blow-up of harmonic maps from surfaces to homogeneous manifolds

We study harmonic map sequences from surfaces to compact homogeneous spaces. For sequences developing a single bubble, we derive refined asymptotic expansions in the neck region and prove new obstruction relations among the leading coefficients. These strengthen earlier results by converting an inequality into an equality. For weakly conformal maps, this yields geometric constraints: in low dimensions the tangent planes of the limit map and bubble must coincide, while in higher dimensions they are isoclinic.
Read the full abstract

Quantum Algebra

Classification of Extended Abelian Chern-Simons Theories

We classify extended Abelian Chern-Simons theories with gauge group $U(1)^n$ as extended $(2+1)$-dimensional topological quantum field theories. For an even integral nondegenerate lattice $(\Lambda,K)$, let $(G_K,q_K)$ denote its discriminant quadratic module. We prove that the associated theory is determined, up to symmetric monoidal natural isomorphism, by this finite quadratic module, and that every finite quadratic module is realized as the discriminant quadratic module of an even integral nondegenerate lattice. It follows that finite quadratic modules classify extended Abelian Chern-Simons theories, pointed Abelian Reshetikhin-Turaev TQFTs, and pointed modular tensor categories.
Read the full abstract

Numerical Analysis

New Robust Streaming DMD with Forecasting

The Dynamic Mode Decomposition (DMD) and the more general Extended DMD (EDMD) are powerful tools for computational analysis of dynamical systems in data-driven scenarios. They are built on the theoretical foundation of the Koopman composition operator and can be considered as numerical methods for data snapshot-based extraction of spectral information of the composition operator associated with the dynamics, spectral analysis of the structure of the dynamics, and for forecasting. In high fidelity numerical simulations, the state space is high dimensional and efficient numerical methods leverage the fact that the actual dynamics evolves on manifolds of much smaller dimension. This motivates computing low rank approximations in a streaming fashion and the DMD matrix is adaptively updated with newly received data. In this way, large number of high dimensional snapshots can be processed very efficiently. Low dimensional representation also requires fast updating for online applications. This paper revisits the pioneering works of Hemati, Williams and Rowley (Physics of Fluids, 2014), and Zhang, Rowley, Deem and Cattafesta (SIAM Journal on Applied Dynamical Systems, 2019) on the streaming DMD and proposes improvements in functionality (using residual bounds, Exact DMD vectors), computational efficiency (more efficient algorithm with smaller memory footprint) and numerical robustness (smaller condition numbers and better forecasting skill).
Read the full abstract

Metric Geometry

On the maximum volume solid wrappable by a given sheet of paper

We consider the problem of wrapping three-dimensional solid bodies with a given planar sheet of paper, where the paper may be folded or wrinkled but not stretched or torn. We propose a conjecture characterising the maximumvolume solid wrappable by any given sheet: the maximum is always achieved (or approached) by a non-convex body. In other words, for any convex solid wrappable by a given sheet, there exists a non-convex solid of strictly greater volume that the same sheet can wrap. We discuss related work, a key subquestion involving the sphere, and several further directions.
Read the full abstract

Functional Analysis

Some results on the Dunkl-Williams constant

This paper presents a compilation of various formulas for calculating the Dunkl-Williams constant $DW(X)$ of a real normed linear space. The constant $DW_B(X)$ related to Birkhoff orthogonality is also considered. The value of $DW(X)$ is calculated for several two-dimensional spaces. In particular, it is shown that the Dunk-Williams constant for $\ell_2-\ell_1$ is equal to $2\sqrt{2}$, and that it is equal to $8(2-\sqrt3)$ for the two dimensional normed linear space whose unit sphere is a dodecahedron.
Read the full abstract

Optimization and Control

Scalable Mean-Variance Portfolio Optimization via Subspace Embeddings and GPU-Friendly Nesterov-Accelerated Projected Gradient

We develop a sketch-based factor reduction and a Nesterov-accelerated projected gradient algorithm (NPGA) with GPU acceleration, yielding a doubly accelerated solver for large-scale constrained mean-variance portfolio optimization. Starting from the sample covariance factor $L$, the method combines randomized subspace embedding, spectral truncation, and ridge stabilization to construct an effective factor $L_{eff}$. It then solves the resulting constrained problem with a structured projection computed by scalar dual search and GPU-friendly matrix-vector kernels, yielding one computational pipeline for the baseline, sketched, and Sketch-Truncate-Ridge (STR)-regularized models. We also establish approximation, conditioning, and stability guarantees for the sketching and STR models, including explicit $O(\varepsilon)$ bounds for the covariance approximation, the optimal value error, and the solution perturbation under $(\varepsilon,\delta)$-subspace embeddings. Experiments on synthetic and real equity-return data show that the method preserves objective accuracy while reducing runtime substantially. On a 5440-asset real-data benchmark with 48374 training periods, NPGA-GPU solves the unreduced full model in 2.80 seconds versus 64.84 seconds for Gurobi, while the optimized compressed GPU variants remain in the low-single-digit-second regime. These results show that the full dense model is already practical on modern GPUs and that, after compression, the remaining bottleneck is projection rather than matrix-vector multiplication.
Read the full abstract

Optimization and Control

Memory-Type Null Controllability for Non-Autonomous Degenerate Parabolic Equations with Boundary Degeneracy

This paper studies the memory-type null controllability of a class of one-dimensional non-autonomous degenerate parabolic equations with Volterra-type memory terms. The diffusion operator is considered in both divergence and non-divergence forms and may exhibit weak or strong degeneracy at the boundary, while the diffusion coefficient depends explicitly on time. Due to the presence of memory effects, classical null controllability is insufficient, and a stronger notion requiring the vanishing of both the state and the accumulated memory is introduced. To address this problem, we establish new Carleman estimates adapted to non-autonomous degenerate operators in weighted spaces. The memory term is handled as a lower-order perturbation within the Carleman framework. These estimates yield suitable observability inequalities, which allow us to prove memory-type null controllability under appropriate structural conditions. Extensions to cases with double boundary degeneracy and moving control regions are also discussed.
Read the full abstract

Optimization and Control

Concave Continuation: Linking Routing to Arbitrage

We extend AMM trade functions to negative inputs via the concave continuation, derived from the invariance of the local conservation law under allocation direction flips. This unifies routing and arbitrage into a single problem. We extend the one-hop transfer algorithm proposed in \cite{jiang} to this setting.
Read the full abstract

Probability · Cross-listed from eess.SY

Augmenting Automatic Differentiation for a Single-Server Queue via the Leibniz Integral Rule

New recursive estimators for computing higher-order derivatives of mean queueing time from a single sample path of a first-come, first-served single-server queue are presented, derived using the well-known Lindley equation and applying the Leibniz integral rule of differential calculus. Illustrative examples are provided.
Read the full abstract

Combinatorics

Large sum-free sets in finite vector spaces II

Answering a question of Leo Versteegen, we prove that for $n\ge 3$ every sum-free set $A\subseteq\mathbb{F}_5^n$ with $|A|\ge 28\cdot 5^{n-3}$ is either contained in the union of two parallel hyperplanes, or isomorphic to $\Lambda\times \mathbb{F}_5^{n-3}$, where $\Lambda\subseteq \mathbb{F}_5^3$ denotes a certain sum-free set of size $28$ discovered by Vsevolod Lev and Leo Versteegen.
Read the full abstract

Numerical Analysis

A posteriori error estimates for mixed finite element discretization of the multigroup Neutron Simplified Transport equations with Robin boundary condition

We analyse a posteriori error estimates for the discretization with mixed finite elements on simplicial or Cartesian meshes of the multigroup neutron simplified transport (SPN ) equations, in the case where a Robin (or Fourier type) boundary condition is imposed on the boundary. This boundary condition is of particular importance in neutronics, since it corresponds to the well-known vacuum boundary condition. We provide guaranteed and locally efficient estimators. In particular, a specific estimator is designed to handle the Robin boundary condition. We also develop the theory in the case of mixed imposed boundary conditions, of Dirichlet, Neumann or Fourier type. The approach is further extended to a Domain Decomposition Method, the so-called DD+L 2 jumps method. In this framework, the adaptive mesh refinement strategy is implemented for a discretization using Cartesian meshes on each subdomain. Numerical experiments illustrate the theory.
Read the full abstract

All authors Patrick Ciarlet, Minh-Hieu Do, Mario Gervais, François Madiot

Group Theory

On recognition of simple classical groups with prime graph independence number $4$ by spectrum

Let $L$ be one of the finite simple classical groups $L_8(q)$, $U_8(q)$, $O_{10}^+(q)$, $O_{10}^-(q)$ or $O_{12}^+(q)$, with $q$ odd. We prove that every finite group having the same set of element orders as $L$ is an almost simple group with socle isomorphic to $L$. This completes the study of the recognition-by-spectrum problem for simple classical groups whose prime graph independence number is equal to $4$.
Read the full abstract

Optimization and Control

Importance Sampling Optimization with Laplace Principle

Grid search and random search are widely used techniques for hyperparameter tuning in machine learning, especially when gradient information is unavailable. In these methods, a finite set of candidate configurations is evaluated, and the best-performing one is selected. We propose a simple and computationally inexpensive refinement of this paradigm: instead of selecting a single best point, we form a weighted average of the evaluated configurations, where the weights are chosen using an importance sampling scheme inspired by the Laplace principle. This scheme can be implemented as a post-processing step on top of a random search, with no additional function evaluations. We also propose an iterative variant, where the sampling distributions are chosen adaptively to generate new candidate points around the previous estimate, in the spirit of Evolution Strategy (ES) methods. In a general non-convex setting, we show that, after n evaluations, the error of the proposed methods is of smaller order than n -2/(d+2) . This compares favorably to random search or grid search rates of n -1/d as soon as d > 2. We illustrate the practical benefits of this averaging strategy on several examples.
Read the full abstract

Algebraic Geometry

Locally finite solvable Lie algebras of derivations

Let X be an affine variety. The local finiteness of a Lie subalgebra h of Lie(Aut(X)) is equivalent to the existence of an algebraic subgroup G of Aut(X) such that h is contained in Lie(G). Let h be a solvable Lie subalgebra of Lie(Aut(X)) generated by a finite collection of locally finite Lie subalgebras. The authors of [arXiv:2507.09679] wondered whether h is itself locally finite. After presenting some criteria for the local finiteness of h, we answer this question in the affirmative in the particular case where X is the affine plane.
Read the full abstract

Optimization and Control

Random Reshuffling-Based Distributed Nash Equilibrium Seeking

This paper studies random reshuffling (RR)-based distributed Nash equilibrium seeking for noncooperative games. The game is motivated as a sample-average approximation of an underlying expected-value stochastic game, while the algorithmic focus is placed on the resulting finite-sum equilibrium problem. Unlike existing distributed stochastic Nash equilibrium methods that mainly rely on with-replacement sampling, the proposed approach incorporates without-replacement component updates into equilibrium computation over networks. We first consider a full-information benchmark, for which an intermediate reference trajectory and a shuffling variance are introduced to characterize the epoch-wise dynamics induced by RR. The method is then extended to the more practical partial-decision-information setting, where each player updates its action using local estimates of the joint action profile. For the full-information case, a descent-type bound is established for the RR iterates. For the distributed partial-decision-information case, it is shown that, under constant parameters, the proposed algorithm converges linearly to a neighborhood of the Nash equilibrium, while under diminishing parameters, it converges exactly to the Nash equilibrium almost surely and in mean square. Numerical experiments on an EV charging game and a nonquadratic edge resource admission game demonstrate that RR consistently outperforms the conventional with-replacement SGD baseline in both steady-state accuracy and long-horizon performance.
Read the full abstract

All authors Jun Hu, Chao Sun, Chen Bo, Jianzheng Wang, Zheming Wang

Rings and Algebras

Biquantization of the necklace Lie bialgebra

For the double of a quiver, the works of Ginzburg, Bocklandt-Le Bruyn and Schedler show that its closed paths, called the necklaces, have a natural Lie bialgebra structure. Schedler also constructed,in [Int. Math. Res. Notices, 2005 (12), 725-760], a Hopf algebra that quantizes this Lie bialgebra. In this paper, we pursue one more step in this direction by constructing its biquantization, in the sense of Turaev [Ann. Sci. École Norm. Sup. (4) 24 (1991), no. 6, 635-704].
Read the full abstract

All authors Xiaojun Chen, Maozhou Huang, Meiliang Liu, Jun Zhang

Dynamical Systems · Cross-listed from physics.ao-ph

High-resolution probabilistic estimation of three-dimensional regional ocean dynamics from sparse surface observations

The ocean interior regulates Earth's climate but remains sparsely observed due to limited in situ measurements, while satellite observations are restricted to the surface. We present a depth-aware generative framework for reconstructing high-resolution three-dimensional ocean states from extremely sparse surface data. Our approach employs a conditional denoising diffusion probabilistic model (DDPM) trained on sea surface height and temperature observations with up to 99.9 percent sparsity, without reliance on a background dynamical model. By incorporating continuous depth embeddings, the model learns a unified vertical representation of the ocean states and generalizes to previously unseen depths. Applied to the Gulf of Mexico, the framework accurately reconstructs subsurface temperature, salinity, and velocity fields across multiple depths. Evaluations using statistical metrics, spectral analysis, and heat transport diagnostics demonstrate recovery of both large-scale circulation and multiscale variability. These results establish generative diffusion models as a scalable approach for probabilistic ocean reconstruction in data-limited regimes, with implications for climate monitoring and forecasting.
Read the full abstract

All authors Niloofar Asefi, Tianning Wu, Ruoying He, Ashesh Chattopadhyay

Algebraic Geometry

The rationality problem for multinorm one tori, II

We investigate the stable and retract rationality of multinorm one tori associated to finite étale algebras. Our results are organized according to the greatest common divisor $d$ of the degrees of the factors. We show that these tori are stably rational for $d=1$, and obtain a criterion for retract rationality that can be attributed to our previous results. For $d>1$, we provide sufficient conditions for the failure of retract rationality. We further generalize results of Endo–Miyata (1975) and Endo (2011) by giving an equivalent condition for multinorm one tori to be stably rational under the assumption that they split over Galois extensions with Galois groups in which all Sylow subgroups are cyclic. A similar result also holds when they split over dihedral Galois extensions.
Read the full abstract

Analysis of PDEs

Microscopic derivation of the one-dimensional constrained Euler equations

We provide a new existence result for weak solutions to the one-dimensional Euler equations with a maximal density constraint, corresponding to a unilateral constraint on the density. Such models arise in the description of congestion phenomena in compressible flows. Our approach is based on a microscopic approximation by a system of N solid particles of identical radius r, with 2r = 1/N . The particles move freely until collision, after which perfectly inelastic interactions are imposed, so that colliding particles stick together. At this level, the non-overlapping condition is encoded through Signorini-type constraints from contact mechanics. Passing to the limit as N $\rightarrow$ +$\infty$, we rigorously establish the connection between these microscopic Signorini conditions and the macroscopic unilateral constraint on the density, together with the associated sign condition on the congestion pressure. The analysis is carried out in a Lagrangian framework, which is natural at the microscopic level and relies at the macroscopic level on the monotone rearrangement associated with the density. A key ingredient of our result is a monotonicity property of the congested region, which allows us to reduce the dynamics to a first-order evolution in time.
Read the full abstract

Numerical Analysis

Iterative Refinement for Diagonalizable Non-Hermitian Eigendecompositions

This paper develops matrix-multiplication-based iterative refinement for diagonalizable non-Hermitian eigendecompositions. The main theory concerns simple eigenvalues and distinguishes two input regimes. In the right-only regime, where only approximate right eigenvectors and eigenvalues are available, a first-order derivation selects the update and the resulting post-update residual identity is exact, yielding a quadratic residual bound. In the left-right regime, where approximate left and right eigenvectors are both available, the computable driving matrix is an exact perturbation of the inverse-based one and the biorthogonality correction satisfies an exact Newton–Schulz-type error identity. Under a small biorthogonality error, these relations yield a local second-order estimate for the resulting $W$-method. Clustered eigenvalues are handled separately by a stabilization extension based on clusterwise re-diagonalization and suppression of intracluster corrections, whose effect is verified on controlled matrices with ill-conditioned cluster bases. The method is intended as post-processing for an already accurate eigendecomposition. The attraction region is not analyzed, and no complete theory is given for the clustered case.
Read the full abstract

Spectral Theory

Anderson Localization for Schrödinger Operators with Monotone Potentials Generated by the Doubling Map

In this paper, we consider the Schrödinger operators on $ \ell^{2}(\N) $, defined for all $ x\in\mathbb{T} $ by \begin{equation} (H(x)u)_n = u_{n+1} + u_{n-1} + \lambda f(2^{n} x) u_n, \quad \text{for } n \geq 0,\notag \end{equation} with the Dirichlet boundary condition $ u_{-1}=0 $. Building on Zhang's recent breakthrough work [Comm.Math.Phys.405:231(2024)] that resolved Damanik's open problem [Proc.Sympos. Pure Math.76,Amer.Math.Soc.(2007)] on the uniform positivity of the Lyapunov exponent, for the potential $ f \in C^{1}(0,1)$ with $ \|f\|_{C^{1}(0,1)} < C $ and $ \inf_{x \in (0,1)} |f^{\prime}(x)| > c>0 $, we obtain the large deviation estimate and prove that for a.e. $ x \in \mathbb{T} $ and sufficiently large $ \lambda > \lambda_{0} $, the operators $ H(x) $ display Anderson localization. Furthermore, if the potentials also have zero mean, our analysis reveals that the doubling map models can exhibit localization behavior for both small and large coupling constants $ \lambda $.
Read the full abstract

Combinatorics

A Note on Generalized Erdős-Rogers Problems

For a $k$-uniform hypergraph $F$ and positive integers $s$ and $N$, the generalized Erdős-Rogers function $f^{(k)}_{F,s}(N)$ denotes the largest integer $m$ such that every $K_s^{(k)}$-free $k$-graph on $N$ vertices contains an $F$-free induced subgraph on $m$ vertices. In particular, if $F = K^{(k)}_t$, then we write $f^{(k)}_{t,s}(N)$ for $f^{(k)}_{F,s}(N)$. Mubayi and Suk (J. London. Math. Soc. 2018) conjectured that $f^{(4)}_{5,6}(N)=(\log \log N)^{\Theta(1)}$. Motivated by this conjecture, we prove that $f^{(4)}_{5^{-},6}(N)=(\log\log N)^{\Theta(1)}$, where $5^{-}$ denotes the $4$-graph obtained from $K_5^{(4)}$ by deleting one edge. Our proof combines a probabilistic construction of a $2$-coloring of pairs with a stepping-up construction and an analysis of multi-layer local extremum structures. Furthermore, we derive an upper bound for a more general Erdős-Rogers function, which implies the lower bound $r_4(6,n)\ge 2^{2^{cn^{1/2}}}$. By applying a variant of the Erdős-Hajnal stepping-up lemma due to Mubayi and Suk, we also slightly improve the lower bound for $r_k(k+2,n)$.
Read the full abstract

All authors Longma Du, Xinyu Hu, Ruilong Liu, Guanghui Wang

Functional Analysis

Real-Variable Theory of Hardy–Lorentz Spaces on Quasi-Ultrametric Spaces of Homogeneous Type with Reverse-Doubling Property

Let $(X,\mathbf{q},\mu)$ be an ultra-RD-space with upper dimension $n\in(0,\infty)$; i.e., it is a quasi-ultrametric space of homogeneous type whose measure $\mu$ satisfies an additional reverse doubling property. Let $\mathrm{ind\,}(X,\mathbf{q})\in(0,\infty]$ denote its lower smoothness index, as introduced by Mitrea et al. In this monograph, the authors first construct a new approximation of the identity on quasi-ultrametric spaces of homogeneous type, achieving a maximal degree of smoothness $0<\varepsilon\preceq\mathrm{ind\,}(X,\mathbf{q})$. This fundamental tool is then used to derive sharp homogeneous (as well as inhomogeneous) continuous/discrete Calderón reproducing formulae on ultra-RD-spaces. As applications, the authors establish Littlewood–Paley function characterizations for both Hardy spaces and Triebel–Lizorkin spaces on ultra-RD-spaces. The authors further introduce Hardy–Lorentz spaces $H^{p,q}_\ast(X)$ via the grand maximal function, with the sharp range $p\in(\frac{n}{n+\mathrm{ind\,}(X,\mathbf{q})},\infty)$ and $q\in(0,\infty]$, and provide their real-variable characterizations using radial/non-tangential maximal functions, (finite) atoms, molecules, and various Littlewood–Paley functions. Based on these characterizations, the authors prove a duality theorem between Hardy–Lorentz spaces and Campanato–Lorentz spaces, establish a real interpolation theorem for Hardy–Lorentz spaces, and derive boundedness results for Calderón–Zygmund operators on them. It should be emphasized that many of the main results in this monograph are indeed established in the more general setting of quasi-ultrametric spaces of homogeneous type.
Read the full abstract

All authors Chenfeng Zhu, Ryan Alvarado, Xianjie Yan, Dachun Yang, Wen Yuan

Dynamical Systems

Invariant measures with full support and approximation by zero-entropy systems in the $C^0$-Gromov–Hausdorff topology

In this paper we prove that every homeomorphism of a compact metric space admitting an invariant probability measure with full support can be approximated in the $C^0$-Gromov–Hausdorff topology by homeomorphisms with zero topological entropy. The argument relies on the ergodic decomposition theorem and on the existence of points with dense positive orbit in the supports of suitable ergodic components. As a consequence, topological entropy is not stable under $C^0$-Gromov–Hausdorff perturbations within this class. We also show that if, in addition, the homeomorphism is topologically $GH$-stable, then its periodic points are dense in the ambient space. Finally, by combining this framework with a previous result on transitive and topologically $GH$-stable homeomorphisms, we deduce that every dynamics in this class admits an invariant measure with full support and therefore falls within the scope of the general approximation theorem by zero-entropy systems.
Read the full abstract

Optimization and Control · Cross-listed from cs.GT

Deception Equilibrium Analysis for Three-Party Stackelberg Game with Insider

This paper investigates strategic interactions within a three party deception security game involving a defender, an insider, and external attackers. We propose a robust deception mechanism where the leader manipulates game parameters perceived by followers to enhance defense performance when followers operate under misperceived and uncertain observation. Specifically, we propose a unified three party leader follower game framework and introduce the concepts of Deception Stackelberg equilibria (DSE) and Hyper Nash equilibria (HNE), which generalize classical two-player Stackelberg and deception games. We develop necessary and sufficient conditions for the consistency between DSE and HNE, ensuring that the defender's utility remains invariant when the hierarchical structure degenerates into a simultaneous-move scenario. Moreover, we propose a scalable hypergradient-based algorithm with established convergence guarantees for seeking DSE, efficiently addressing the computational challenges posed by non-smooth and set-valued best-response mappings. Finally, we apply theoretical analysis to practical scenarios in secure wireless communication and defense against insider-assisted false data injection attacks.
Read the full abstract

Optimization and Control

Computing the Pareto Front by Polynomial Elimination, With an Application From System Identification

We propose a novel numerical approach to compute the Pareto front in multivariate polynomial multi-objective optimization problems. When the objective functions and (equality) constraints are multivariate polynomials, the Pareto front, which describes the efficient points of the multiple (often conflicting) objective functions, can be interpreted as a subset of a positive-dimensional algebraic variety. By combining the objective functions with weights and considering the weights as additional decision variables, we can eliminate all variables except the objective values and obtain one (or multiple) polynomial equation(s) that describes the Pareto front. Unlike sampling-based methods that approximate the Pareto front point-wise, our elimination-based approach yields an explicit algebraic relation between the objective values, representing the Pareto front as a geometric object in the objective space without requiring a predetermined number of sample points. Besides numerical examples illustrating the elimination-based approach, we use elimination on a challenging application that originates from system identification, in which we analyze the trade-off between misfit and latency terms when determining the optimal model parameters from measured data.
Read the full abstract

All authors Hans van Rooij, Christof Vermeersch, Marie Deferme, Bart De Moor

Number Theory

Equivalence between the Functional Equation and Voronoï-type summation identities for a class of $L$-Functions

To date, the best methods for estimating the growth of mean values of arithmetic functions rely on the Voronoï summation formula. By noticing a general pattern in the proof of his summation formula, Voronoï postulated that analogous summation formulas for $\sum a(n)f(n)$ can be obtained with “nice" test functions $f(n)$, provided $a(n)$ is an “arithmetic function". These arithmetic functions $a(n)$ are called so because they are expected to appear as coefficients of some $L$-functions satisfying certain properties. It has been well-known that the functional equation for a general $L$-function can be used to derive a Voronoï-type summation identity for that $L$-function. In this article, we show that such a Voronoï-type summation identity in fact endows the $L$-function with some structural properties, yielding in particular the functional equation. We do this by considering Dirichlet series satisfying functional equations involving multiple Gamma factors and show that a given arithmetic function appears as a coefficient of such a Dirichlet series if and only if it satisfies the aforementioned summation formulas.
Read the full abstract