English

Bounded Local Generator Classes for Deterministic State Evolution

Operating Systems 2026-05-11 v2 Data Structures and Algorithms

Abstract

We define a bounded local generator class (BLGC) for deterministic state evolution on graph-indexed systems. The construction consists of finite-range generators operating on bounded local state under deterministic composition. Each update acts only on a bounded-radius neighborhood and applies a bounded local transformation with projection onto a compact state domain. Under the BLGC constraints, per-step operator work remains independent of total system size M. Specifically, incremental update cost satisfies Wt=O(1)W_t = O(1) with respect to MM \to \infty for fixed interaction radius rr. The framework admits a Hilbert-space embedding in 2(V)Rd\ell^2(V)\otimes \mathbb{R}^d and yields bounded operators under composition on admissible subspaces. The result establishes a structural decoupling between global state capacity and incremental computational work. The claims apply specifically to the bounded local generator class defined in this paper.

Cite

@article{arxiv.2602.11476,
  title  = {Bounded Local Generator Classes for Deterministic State Evolution},
  author = {R. Jay Martin},
  journal= {arXiv preprint arXiv:2602.11476},
  year   = {2026}
}

Comments

42 pages, 1 figure. Introduces bounded local generator classes BLGC for deterministic locality-preserving state evolution with dimension-work decoupling under bounded interaction radius