Exact Minimum Field Partition for One-Step Prediction in a Finite Five-Agent ABCW Model
Abstract
Which distinctions in a present state must be retained to predict a specified future exactly? We study this question on a finite reachable set of a deterministic five-agent ABCW model in which binary agent actions and strategies coevolve with a weighted directed influence field. The dataset is generated from four initial-field families and all 4,096 action-strategy initial conditions, yielding 56,536 transitions and 2,562 distinct current fields. We retain the current action and seek the coarsest field-only partition that uniquely determines the complete one-step-ahead field on every observed transition. Nine natural feature families and all 511 of their nonempty combinations provide strong approximate predictors but no exact nontrivial field compression. We therefore construct an incompatibility graph whose vertices are current fields and whose edges join fields that produce different next fields under a shared observed action. A proper 692-coloring gives a constructive upper bound. An independent anchor-action decomposition, followed by exact solution of the 50 nontrivial induced subgraphs, gives the matching lower bound. Hence the minimum number of field classes is exactly 692. This number applies only to the specified finite reachable set, field-only compression, retained current actions, one-step target, and exact-prediction requirement; it is not a universal macrostate count for ABCW systems.
Related
- High-temperature expansion of the inverse-square Ising chain in a magnetic field: exact coefficients and finite-size reconstruction
- Newton's Identity in Finite-Bead Fermionic Partition Function
- Exact quantum Hamming-weight computation at optimal depth and minimum width
- Exact minimum measurement dependence for faithful local deterministic models of multipartite GHZ-Mermin correlations
- Minimum energy paths for defect annihilation in finite dodecagonal quasicrystal clusters
BibTeX
@misc{shizusawa2026exact,
title = {{Exact Minimum Field Partition for One-Step Prediction in a Finite Five-Agent ABCW Model}},
author = {Takashi Inoue Shizusawa},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.00024},
eprint = {2609.00024},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.00024},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Exact Minimum Field Partition for One-Step Prediction in a Finite Five-Agent ABCW Model
AU - Takashi Inoue Shizusawa
PY - 2026
DA - 2026/09/01
PB - arXiv
DO - 10.48550/arxiv.2609.00024
UR - https://arxiv.org/abs/2609.00024
AB - Which distinctions in a present state must be retained to predict a specified future exactly? We study this question on a finite reachable set of a deterministic five-agent ABCW model in which binary agent actions and strategies coevolve with a weighted directed influence field. The dataset is generated from four initial-field families and all 4,096 action-strategy initial conditions, yielding 56,536 transitions and 2,562 distinct current fields. We retain the current action and seek the coarsest field-only partition that uniquely determines the complete one-step-ahead field on every observed transition. Nine natural feature families and all 511 of their nonempty combinations provide strong approximate predictors but no exact nontrivial field compression. We therefore construct an incompatibility graph whose vertices are current fields and whose edges join fields that produce different next fields under a shared observed action. A proper 692-coloring gives a constructive upper bound. An independent anchor-action decomposition, followed by exact solution of the 50 nontrivial induced subgraphs, gives the matching lower bound. Hence the minimum number of field classes is exactly 692. This number applies only to the specified finite reachable set, field-only compression, retained current actions, one-step target, and exact-prediction requirement; it is not a universal macrostate count for ABCW systems.
ER -