Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.00024

Exact Minimum Field Partition for One-Step Prediction in a Finite Five-Agent ABCW Model

Takashi Inoue Shizusawa
View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Takashi Inoue Shizusawa. 2026-08-26. Exact Minimum Field Partition for One-Step Prediction in a Finite Five-Agent ABCW Model. https://arxiv.org/abs/2609.00024

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗