Context
Min-count is a sharp boundary example: state demand grows linearly, yet an optimal clamped difference tracker keeps canonical height constant.
Definitions
- , so two one-state sequential components give an exact width-two cover.
Proof or evidence
Finite-horizon residual differences force one state for each signed count in [−floor(N/2),floor(N/2)]. The clamped tracker attains that state count and is already in canonical height-one form. At N=1 the target is identically zero, so one state of height zero suffices and the N≥2 hypothesis is sharp.
Verification notes
A fresh exhaustive audit checks all 65,515 binary words through horizons 2,...,14, 511 pairwise state lower-bound witnesses, and the BFS normalization; see /research-artifacts/result-review-2026-09-01-batch-23/review_weighted_height_output.json.
Limitations
- The result is a counterexample to extending T73 beyond unambiguous realizations, not a classification of finitely ambiguous series.
- The relation to max-count is an additive length shift, not a negation duality.
Notes
The relation to max-count is addition of a length gauge, not negation duality. All three pinned demand coordinates are invariant under negation; the withdrawn orientation-sensitive account is not revived.