Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 18 May

Rings and Algebras

Graph Theoretic and Spectral Properties of the Zero-Divisor Graph of $\mathbb{F}_p + u\mathbb{F}_p + v\mathbb{F}_p + uv\mathbb{F}_p$

In this article, we study the zero-divisor graph of the commutative ring with identity $R= \mathbb{F}_p + u\mathbb{F}_p + v\mathbb{F}_p + uv\mathbb{F}_p,$ where $u^2 = 0, v^2 = 0, uv = vu$ and $p$ is an odd prime. We determine several graph-theoretic properties associated with the zero-divisor graph $\Gamma(R),$ including the clique number, chromatic number, vertex connectivity, edge connectivity, diameter and girth. In addition, we compute certain topological indices of the graph $\Gamma(R).$ Furthermore, we find the eigenvalues, energy and spectral radius of the adjacency matrix, the Laplacian matrix and the Eccentricity matrix of the zero-divisor graph $(\Gamma(R).$
Read the full abstract

Combinatorics

Recursive structures of molecules and cells in Gelfand $S_n$-graphs

$W$-graphs, representing the multiplication action of the standard basis on the canonical basis in the Iwahori-Hecke algebra are introduced by Kazhdan and Lusztig. Marberg defined a generalized $W$-graph, the Gelfand W-graph, corresponding to the Hecke algebra modules instead of Hecke algebras. To classify the molecules and cells of the Gelfand $S_n$-graphs, in this paper, we introduce a recursive structure of $S_n$ and then discuss the action of the recursive structure on the molecules. Using this structure, we prove that the distinguished nonnesting molecule is a cell.
Read the full abstract

Number Theory

Non-admissibility of some universal supersingular representations

Let $K/\mathbf{Q}_p$ be an unramified extension of degree $f$ with residue field $k$. Let $\sigma$ be an irreducible representation of $\mathrm{GL}_n(k)$ over $\overline{\mathbf{F}}_p$. For $n\ge 3$, we prove that the universal supersingular representation of weight $\sigma$ is non-admissible and of infinite length when $\sigma$ is sufficiently generic and satisfies certain technical conditions. This generalizes the previous results for $n=2$ and a non-trivial finite extension $K/\mathbf{Q}_p$. Our method employs a weight cycling argument together with recent progress on the Serre weight conjectures.
Read the full abstract

All authors Zachary Feng, Heejong Lee, Ray Li, Vaughan McDonald, Nischay Reddy

Numerical Analysis

Multigrid Primer: Basic Principles

The goal of this primer is to provide a relatively short exposition of the basics of multigrid methods, simplified by focusing on fundamental concepts in a variational setting. This is done by way of a quadratic energy minimization formulation of symmetric positive definite linear equations arising from the discretization of elliptic partial differential equations. This focus provides an alternate viewpoint to other expositions and, more importantly, it enables a simplification of the development while clarifying the principles that lead to effective algorithms. The development begins with multigrid as an iterative solver exemplified by the so-called V-cycle. It then introduces the full multigrid method as a direct solver in the sense that it is aimed directly at the source of the matrix equations. In this way, full multigrid attempts to achieve discretization-level accuracy at a cost comparable to that of a few matrix multiplies on the finest level.
Read the full abstract

Number Theory

An update on the Linnik–Goldbach problem

We consider the Linnik–Goldbach problem of writing all large even integers as the sum of two primes and a fixed number of powers of 2. We show that, under the generalised Riemann hypothesis, one can use 6 powers of two. In addition, we discuss refinements to the unconditional case and to the related problem of Romanov in expressing a positive proportion of odd numbers as the sum of a prime and a power of 2.
Read the full abstract

Numerical Analysis

Solving Vlasov-Poisson system with an adaptive Hermite spectral method

We propose an adaptive Hermite spectral method for the Vlasov-Poisson system based on a recently developed frequency indicator that measures the contribution of the high-order expansion coefficients. Precisely, the symmetrically weighted Hermite basis with a scaling factor is utilized to approximate the distribution function to satisfy the increasing resolution requirement, which, for example, is induced by filamentation. To implement the scaling adjustment, a fast conservative projection operator is constructed in two steps. The first step is to formulate the projection as a constrained optimization problem to preserve key invariants, including mass, momentum, energy, and the $L^2$ norm of the distribution function. The second step is an ODE-based approximation developed to compute the updated expansion coefficients with linear complexity. Numerical experiments with 1D1V and 2D2V settings validate the feasibility and efficiency of this proposed adaptive Hermite method.
Read the full abstract

Optimization and Control

Convergence Analysis via ODE Approach for Convex Optimization with Linear Equality Constraints

This paper studies the continuous-time dynamics of primal-dual algorithms for linearly constrained convex optimization problems and provides a quantitative convergence analysis using the Lyapunov functions. With the growing prevalence of sparse and low-rank models, large-scale problems involving nonsmooth objective functions have become increasingly important. Our approach addresses nonsmooth and nonstrong convex objective functions, which is particularly effective in extending classical accelerated methods to broader large-scale optimization problems. Building upon the ordinary differential equation (ODE) approach inspired by the recent work on Nesterov's acceleration methods, we extend the analysis to an ODE associated with an optimization problem with linear equality constraints. Furthermore, to relax strong assumptions, we introduce two geometric conditions the Flatness condition and the Growth condition and derive explicit convergence rates depending on the local geometry and algorithmic parameter. When the objective function is convex and the Lagrangian satisfies the Flatness condition, an appropriate parameter choice yields a worst-case convergence rate of O(1/t^2). Furthermore, incorporating the Growth condition guarantees this worst-case rate of O(1/t^2) for any function satisfying these assumptions if and only if the parameter is chosen above a suitable threshold; under this condition, even faster convergence can be achieved. For the algorithmic construction, a numerical scheme is derived by discretizing the proposed ODE. We also investigate the influence of algorithm parameters and provide insights into their optimal selection. Finally, preliminary numerical experiments are provided to validate the consistency with the theoretical results.
Read the full abstract

Optimization and Control

Data-Driven Co-Design of Event-Triggered and Sparse Control for Resource-Aware Networked Control Systems

This paper investigates the data-driven co-design of event-triggered control (ETC) and sparse control (SC) for networked control systems (NCSs) with unknown linear dynamics. While ETC and SC have been widely studied as effective strategies to reduce communication and computation burdens on different resource dimensions, existing works typically address them separately and rely on accurate system models. Furthermore, their joint design in a data-driven setting, especially in the presence of measurement and process noise, remains largely unexplored. To bridge these gaps, we propose a unified data-driven framework that simultaneously accounts for bounded state and input measurement noise as well as process noise, and enables the co-design of ETC mechanisms and sparse controllers directly from data. Within this framework, we characterize stability, uniformly ultimately bounded (UUB) behavior, and $H_\infty$ performance under different noise conditions. For each problem, given the event-triggered parameters, we provide a sufficient condition for the existence of a feasible controller and develop an iterative algorithm to solve the associated nonconvex optimization problem. Numerical examples are provided to demonstrate the effectiveness of the proposed methods.
Read the full abstract

All authors Zhaohua Yang, Xiaoxu Lyu, Dawei Shi, Ling Shi

Group Theory

Geometric properties of the golden ration Thompson's group

We show that all three golden ratio Thompson's groups $F_\tau$, $T_\tau$ and $V_\tau$ embed in the asynchronous rational group. We prove properties of the Cayley graph of the monoid $M = \langle L, R : LR^2 = RL^2 \rangle$, whose topological full group is $V_\tau$. In particular, we compute a distance function for the Cayley graph of the monoid $M$. Additionally, we prove that this Cayley graph is hyperbolic in the sense of Gromov. Our analysis reveals that the horofunction boundary of this graph is homeomorphic to a space resembling a Cantor-like set, with additional isolated points situated between each pair of breakpoints.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

One Model, Two Roles: Emergent Specialization in a Shared Recurrent Transformer

Can a shared-weight recurrent Transformer—one that repeatedly applies the same Transformer to update evolving latent states—develop distinct internal roles without being partitioned into separate modules? We study this in Asymmetric Input Recurrence (AIR), a minimal two-state reasoning architecture in which the same Transformer model is reused for both updates (per literature, L and H) and the only built-in difference in the update rule is that the encoded input is injected during L-updates but not H-updates. Across Sudoku-Extreme and Maze, decoded rollouts reveal a consistent split: $z_H$ behaves like a fully committed proposal state, whereas $z_L$ retains local uncertainty and shifting intermediate structure. Freeze interventions provide evidence of dynamical dependence between the two states, with responses that vary across tasks, intervention directions, and seeds. Ablations show that to induce specialization, the shared model needs to be able to tell the two update types apart, either from input injection asymmetry or from a separate level token. Mechanistically, attention analysis shows that L-updates are consistently more local than H-updates in both Sudoku and Maze. Together, these results show that, in a two-state recurrent setting, a clear state-identity signal can induce stable, related functional roles inside a shared-parameter recurrent Transformer. Code is available at https://github.com/juchengshen/air.
Read the full abstract

Information Theory

The information-theoretic complexity of differentiable functions

A measure for the complexity of a differentiable function f(x) on an interval is introduced. It is based on approximations of the function by piecewise constant functions. The measure takes into account the quality of the approximation and the number of intervals in the approximating function. This measure, called the V-complexity of f(x), is shown to formalize some intuitions about the simplicity or complexity of f(x). The V-complexity is then compared to another measure of complexity, namely how compressible an approximation of f(x) is. It is hypothesized that V-complexity is equivalent to the compression measure, in the case of the Run Length Encoding and the Lempel Ziv 77 algorithms. V-complexity can be used as an ingredient in the definition of the Effective Complexity (EC) of a Complex System. When the perceived regularities of such a system are described by a differentiable function on an interval, the EC can be defined as the V-complexity of that function. EC is applied to the model of diffusion of cream in a cup of coffee. The perceived regularity of this model is given by the diffusion equation. The V-complexity of the solution of the equation starts at zero, quickly increases to a maximum and then decreases back to zero as the liquid reaches its equilibrium state. It is shown that this is also the result when a cellular automaton approach and the concept of Apparent Complexity is used.
Read the full abstract

Numerical Analysis

Convergence Analysis of Two Alternating Iterative Schemes for Tucker Decomposition

The higher-order orthogonal iteration (HOOI) and the alternating subspace iteration (ASI) are two popular numerical methods for computing the Tucker decomposition of a multiple-mode tensor. Xu [Linear and Multilinear Algebra, 66(11):2247–2265, 2018] proposed a variation of HOOI, called the greedy HOOI, which has an extra alignment action between consecutive approximations. Kroonenberg and De Leeuw [Psychometrika, 45(1):69–97, 1980] analyzed the convergence of ASI but their analysis has gaps. These analysis were for a real tensor only. In this paper, we present detailed convergence analysis of the two methods that is applicable to a complex tensor with a real tensor being a special case, and it is shown both methods are globally convergent to stationary points under mild conditions while the objective function monotonically increases. Numerical examples are presented to demonstrate the convergence behavior of the methods.
Read the full abstract

Combinatorics

An introduction to equitable DP coloring of graphs

A proper $k$-coloring of vertices of an $n$-vertex graph is equitable if the size of every color class is $\lfloor n/k\rfloor$ or $\lceil n/k\rceil$. An extension of it to list coloring requires only that the size of every color class is at most $\lceil n/k\rceil$. Such colorings have interesting applications and have been actively studied recently. In this paper, we extend the notion of equitable coloring to the more general notion of equitable DP coloring and study properties of the new parameter.
Read the full abstract

Combinatorics

On the Failure of the Upper Bound in the Refined BMV Conjecture and a Pinching Correction

We analyze why the refined Bessis–Moussa–Villani conjecture fails. The refined conjecture proposed that the normalized trace average over all words with prescribed numbers of letters \(A\) and \(B\) should be bounded above by the clustered word \(\Tr(A^nB^m)\). Recent counterexamples of Cha show that this upper bound is false already for \(3\times3\) positive semidefinite matrices when \(n=m=5\). We explain the failure from the viewpoint of commutative common parts. The term \(\Tr(A^nB^m)\) is not the canonical common part of the pair \((A,B)\); it is only one clustered word. After pinching \(B\) relative to \(A\), the natural commuting contribution is \(\A_{n,m}(A,\EA(B))\). The off-diagonal complement \(B-\EA(B)\) creates spectral bridges, and mixed words can distribute the powers of \(A\) along closed cycles more efficiently than the clustered word. This gives a mechanism for finding counterexamples. Motivated by this mechanism, we propose a corrected pinching refinement \[ \A_{n,m}(A,B)\ge \A_{n,m}(A,\EA(B)). \] We prove this corrected conjecture in the case of two letters \(B\), obtaining a sandwich refinement \[ \A_{n,2}(A,\EA(B)) \le \A_{n,2}(A,B) \le \Tr(A^nB^2). \] Thus, even where the old clustered upper bound remains true, the pinching viewpoint gives a sharper structural decomposition.
Read the full abstract

Statistics Theory

Self-Distillation is Optimal Among Spectral Shrinkage Estimators

Self-distillation has emerged as a promising technique for improving model performance in modern machine learning systems. We develop the statistical foundations of self-distillation in high-dimensional linear regression by introducing and analyzing a broad class of estimators, namely spectral shrinkage estimators. We consider both spiked and general covariance matrices. For the former, we establish that when the covariance has $s$ distinct spikes, $s$-step self-distillation achieves optimal prediction among spectral shrinkage estimators, outperforming well-known estimators in statistics and machine learning. Moreover, we show that $s$ steps are necessary for optimality: any $(s-k)$-step distilled estimator is strictly suboptimal for $1 \leq k \leq s$. For general covariance matrices, we show that self-distillation approaches the optimal limiting prediction risk among continuous spectral shrinkage estimators as the number of distillation steps increases. We further develop a generalized cross-validation procedure for selecting the distillation parameters from data and establish an asymptotic oracle guarantee for the resulting estimator. We also study a federated approach where multiple data centers share spectral shrinkage estimators and a common server seeks to aggregate them to achieve optimal performance. In this case, we find that the best local rule again takes the form of self-distillation, though it differs from the optimal rule when data are hosted centrally on a single server. Together, our results explain why self-distillation improves predictive performance and provide a broader statistical framework that connects it to classical shrinkage-based methods.
Read the full abstract

Number Theory

Linear independence of periods related to polylogarithms

This paper provides the first criteria for the linear independence of multiple polylogarithm values over algebraic number fields. In particular, we derive novel results regarding the linear independence of products of polylogarithms at distinct points over an algebraic number field. Our approach is based on the explicit construction of Padé-type approximants tailored for multiple polylogarithms.
Read the full abstract

Rings and Algebras

On transposed Poisson conformal superalgebras

We introduce and study transposed Poisson conformal superalgebras, the $\mathbb Z_2$-graded conformal analogues of transposed Poisson algebras, as well as their noncommutative variants. We derive a family of identities forced by the transposed conformal super-Leibniz rule and prove that the tensor product over $\mathbb C[\partial]$ of two such superalgebras again carries a natural transposed Poisson conformal superalgebra structure. Moreover, we display a close relationship between transposed Poisson conformal superalgebras and Hom-Lie conformal superalgebras, and give the compatibility conditions between a Poisson conformal superalgebra and a transposed Poisson conformal superalgebra. In addition, several constructions are obtained from modified Lie conformal brackets and from Novikov-Poisson, pre-Lie commutative, differential Novikov-Poisson, and pre-Lie Poisson conformal superalgebras. Finally, using the known classification of Lie conformal superalgebras of rank (1+1), we determine all compatible transposed Poisson conformal superalgebra structures on such superalgebras.
Read the full abstract

Numerical Analysis · Cross-listed from cs.CE

Numerical methods for optimal decumulation of a defined contribution pension plan

The decumulation of a defined contribution (DC) pension plan is well known to be one of the hardest problems in finance. We model this decumulation challenge as an optimal stochastic control problem. The control problem is solved, at each rebalancing date, by alternatively solving a linear partial-integro differential equation (PIDE) followed by an optimization step. We solve the PIDE by using a $\delta$-monotone Fourier method, which ensures that monotonicity holds to $O(\delta)$. We allow for the use of leverage (i.e. borrowing to invest in stocks), as well as minimum constraints on bond holdings. We pay particular attention to minimizing wrap-around error, an issue which is endemic for Fourier methods and central to the effective use of these methods for optimal control problems. Rather unexpectedly, we find that restricting the portfolio equity fraction to a maximum of 50% does not reduce portfolio efficiency noticeably. This may be a useful strategy for risk-averse retirees.
Read the full abstract

Optimization and Control

From Optimization to Satisficing: Robust Screening under Distributional Ambiguity

This study investigates a robust screening problem under distributional ambiguity, where a seller is uncertain about a buyer's true valuation distribution, knowing only that it lies near a reference distribution measured by the Wasserstein metric. Traditional robust optimization (RO) approaches prioritize maximizing worst-case revenue within predefined ambiguity sets, often yielding seller-centric outcomes and reliance on precise set specifications. We propose a robust satisficing (RS) framework aimed at attaining a specified revenue target by minimizing the worst-case shortfall across all potential distributions. Our approach offers a tractable formulation and detailed characterization of optimal mechanisms using randomized pricing strategies. We also assess the out-of-sample efficacy of a simple posted pricing mechanism, finding it particularly effective with lower targets and positively skewed valuations, where smaller valuations have high probability mass. Comparing RO with RS, we find that RS consistently enhances buyer surplus when the reference distribution has an increasing hazard rate and increases out-of-sample seller revenue with positively skewed true valuations. Our analysis indicates that a target-driven RS framework enhances buyer surplus and fairness by offering more opportunities to lower-valuation buyers, potentially boosting overall revenue in scenarios with demand skewed toward these valuations. This approach offers a practical and viable modeling alternative to conventional RO methods, effectively overcoming the challenges of ambiguity set calibration while ensuring broader equitable access for diverse buyers.
Read the full abstract

Numerical Analysis

Two-scale neural networks for optimal control of linear convection-dominated equations

We propose a two-scale neural network method for optimal control problems governed by convection-dominated convection-diffusion-reaction equations. Building on two-scale architectures developed for singularly perturbed forward problems, we augment the spatial input with suitably rescaled features that become increasingly important as the diffusion coefficient becomes small. The approach employs separate neural networks for the state and adjoint state variables of the optimality system, reflecting the fact that these quantities develop sharp layers in different parts of the domain due to opposite convection fields. By choosing different center points for the two networks, the architecture naturally aligns with the layer location of each variable. We present two formulations of the method, one based on the first-order optimality conditions and another using penalization of the PDE constraint, and combine them with a successive training strategy that gradually decreases the diffusion coefficient toward its target value. Numerical experiments on benchmark problems illustrate the effectiveness and behavior of the proposed approach.
Read the full abstract

All authors Sijing Liu, Marcus Sarkis, Yi Zhang, Zhongqiang Zhang

Numerical Analysis

Hyperinterpolation beyond exact cubature: a spectral multiplier approach

We study hyperinterpolation and its spectral multiplier variants on the sphere under weak cubature assumptions formulated through Sobolev discrepancy estimates. In contrast with classical hyperinterpolation theory, our framework does not require exact polynomial cubature formulas or Marcinkiewicz–Zygmund inequalities. The main idea is to interpret the discretization error as the action of a spectral multiplier operator on the cubature discrepancy measure. This viewpoint separates approximation properties of the underlying spectral operator from geometric properties of the sampling measure, leading to stable Sobolev approximation estimates under weak cubature assumptions. The resulting theory applies to a broad class of spectral approximation operators, including sharp spectral projections, compactly supported smooth filters, Bessel potential operators, and heat kernel operators. For sufficiently localized spectral multipliers, we additionally obtain uniform $L^\infty$-stability of the corresponding discrete approximation operators. The results establish a direct connection between hyperinterpolation, Sobolev discrepancy, and quasi-Monte Carlo (QMC) designs, showing that stable approximation from scattered data can be achieved without exact polynomial reproduction.
Read the full abstract

Commutative Algebra

Rank varieties over the generic hypersurface I

To every local complete intersection ring one may associate a so-called generic hypersurface. In this paper we introduce rank varieties for modules and complexes over the generic hypersurface. The definition uses extension of scalars, rather than restriction of scalars which are used to define the conventional support varieties over a local complete intersection. We show that every projective variety can be realized as the rank variety of a finitely generated module over the generic hypersurface. We also investigate several properties of these rank varieties.
Read the full abstract

Numerical Analysis

Structure preserving quaternion conjugate gradient-type methods for solving non-Hermitian quaternion linear systems

In this paper, we consider the non-Hermitian quaternion linear systems arising from color image restoration and three-dimensional signal filtering problems. For exploring to solve such systems, we present two innovative structure-preserving conjugate gradient-type methods, QNHERLQ and QNHERQR, which are based on the unitary equivalence transformations of the non-Hermitian quaternion matrices to tridiagonal forms, called quaternion Saunders-Simon-Yip tridiagonalization procedure. The proposed tridiagonalization procedure for non-Hermitian quaternion matrices is closely related to the quaternion Lanczos process for Hermitian matrices, and is very different from the quaternion Lanczos biorthogonalization process for non-Hermitian matrices. The convergence of QNHERLQ and QNHERQR is discussed, which depends on the singular values of the coefficient matrix. Also we show that both algorithms have the finite termination property and constant costs per iteration step. Numerical results illustrate that the proposed algorithms are with the robustness and effectiveness compared with QGMRES and QQMR.
Read the full abstract

Optimization and Control

A reflected forward-backward splitting algorithmic framework

In this paper, we propose a reflected forward-backward splitting algorithic framework for finding a zero of the sum of finitely many monotone op-erators, including maximally monotone operators, cocoercive operators, and monotone and Lipschitz continuous operators. We provide a unified convergence analysis under mild conditions, eliminating the need to analyze the convergence of each algorithm individually. The heuristic strategies for matrix selections are proposed through a numerical experiment, based on which a new algorithm is derived. A further numerical experiment on the regularized saddle-point problem is then presented to demonstrate the effectiveness of the proposed algorithm.
Read the full abstract

All authors Haowen Zheng, Yongyu Fu, Qiao-Li Dong, Shuangbao Li

Probability

Limit theorems for random walks with spatio-temporal drift

We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models of self-interacting random processes. We determine the asymptotic behavior of the walk under the assumption that its increments have moments of order $p$ for some $p>2$. In the linear case, where the drift depends linearly on the current position, we establish a phase transition in the convergence in distribution of the normalized process to Gaussian limits. In the nonlinear case, we identify three distinct regimes separated by a critical line and show that the normalized process exhibits qualitatively different behaviors in each regime, including convergence in distribution to a Gaussian law, convergence to a non-Gaussian limit given by the stationary distribution of a stochastic differential equation, and almost sure localization on a hypersphere.
Read the full abstract

Dynamical Systems · Cross-listed from eess.SY

Observer-Based Stabilization for Linear Multi-Agent Dynamical Systems Using Generalized Frequency Variables

We address the conditions and design of controllers and observers for homogeneous networks of linear MIMO agents. We develop networked controllers and observers that ensure the stability of both the system state and the estimation error, leveraging the concept of generalized frequency variables. A separation principle for networks is then established, showing that the observer and controller can be designed independently and combined to achieve a stable output feedback. Our results are illustrated via a highly unstable, oscillatory network of locally actuated pendulums on carts. Finally, necessary conditions for controllability and observability – derived from agent properties and network structure – are established and discussed.
Read the full abstract

Operator Algebras

Quantum Doubly Stochastic Operators on Non-commutative $L_p$-Spaces

We introduce and systematically develop the theory of quantum doubly stochastic operators, i.e. positive, trace-preserving maps on non-commutative $L_p$-spaces associated to semifinite von Neumann algebras. After establishing basic norm and duality properties, we characterize strict norm inequalities, give necessary and sufficient criteria for compactness in the sense of Schatten-ideals, and exhibit a range of new examples in both finite and infinite dimensions. Applications to quantum majorization and stability under interpolation are also discussed.
Read the full abstract

Dynamical Systems

Crime hotspot dynamics in residential burglary models with police response

We develop and analyze mathematical models for residential burglary that incorporates police deployment through a delayed feedback mechanism. Motivated by empirical observations from publicly available crime and policing data, we extend a well-known agent-based model by introducing a dynamic police response driven by crime information that becomes available only after a finite delay. Taking the mean-field limit, we derive a coupled continuum system consisting of three partial differential equations and one ordinary differential equation describing the interactions among criminal density, environmental attractiveness, delayed crime signal, and police deployment. Linear stability analysis of homogeneous steady states reveals that response delays can destabilize otherwise stable equilibria through Hopf bifurcations. As a result, the model predicts sustained temporal oscillations and dynamically evolving crime hotspots. Numerical simulations of both the agent-based and continuum models confirm the theoretical analysis and uncover rich spatio-temporal behaviors, including moving, splitting, and merging hotspots. Through a parametric study, we investigate the roles of police density, crime information delay, and neighborhood effects in controlling stability, hotspot size, and oscillatory behavior. Our results indicate that timely access to crime data plays a more important role than police density in stabilizing crime levels.
Read the full abstract

All authors Baoli Hao, Kamrun Mily, Annalisa Quaini, Ming Zhong

Sunday 17 May

General Mathematics

Unified Nilpotent Operational Framework: Foundations, Algebraic Exactness, and Complexity

A unified algebraic framework is developed to study nilpotency as a structural mechanism for exactness in operational, combinatorial, and computational problems. The central object is the Nilpotent Operational System (SON), formalized as a tuple (R, N, m, M_R), where R is a C-algebra, N satisfies N^{m+1}=0, and M_R(m) is the arithmetic cost of a product in R. The basic result is the Exact Termination Lemma: every formal series evaluated at N collapses to an exact finite sum of m+1 terms. Three complexity regimes are obtained: truncated series (quasi-linear bound via Newton iteration), nilpotent operators (linear bound via Horner evaluation), and incidence algebras (quasi-quadratic bound). Applications include classical and free cumulants, Appell sequences, orthogonal polynomials, Stirling numbers, Möbius inversion, Witt vectors, and local holonomic functions. In all cases except Stirling numbers, strict complexity improvements over classical algorithms are obtained. For classical cumulants, equivalence with polynomial multiplication is achieved: L(C_n)=Theta(M(n)). For free cumulants, the complete equivalence T_{FC}(n)=Theta(M(n)) is established via the Voiculescu functional equation and compositional reversal.
Read the full abstract

Mathematical Physics

Inverse scattering for the linear system associated with the coupled Gerdjikov–Ivanov equations

We consider a certain first-order linear system of ordinary differential equations, and we analyze the direct and inverse scattering problems for that linear system. The linear system involves two potentials in the Schwartz class, and those potentials linearly depend on the spectral parameter. This linear system is related to the integrable system of nonlinear partial differential equations known as the DNLS (derivative nonlinear Schrödinger) system III, which is also known as the Gerdjikov–Ivanov system. When analyzing the direct problem, we describe the pertinent properties of the Jost solutions and the scattering coefficients. The bound states poles and the associated normalization constants are represented via a matrix triplet pair, enabling us to deal with any number of bound states and any multiplicities. The inverse scattering problem comprises the determination of the two potentials when the reflection coefficients and the bound-state information are available. To solve the inverse problem, we establish a linear system of integral equations where the kernel and nonhomogeneous term are determined by the Fourier transforms of the reflection coefficients and the matrix triplet pair representing the bound-state information. This system of linear integral equations is the counterpart of the system of Marchenko integral equations available for the AKNS system associated with the integrable NLS (nonlinear Schrödinger) system. We recover the potentials from the solution of our established Marchenko integral system. When we use the time-evolved reflection coefficients and the time-evolved matrix triplets, the corresponding time-evolved potential pair yields a solution of the Gerdjikov–Ivanov system.
Read the full abstract