Vector prefix balancing research simulator

Family 097: The Euclidean Steinitz–Bergström bound. First review, 9 October 2026 Australia/Brisbane.

Problem and potential new use

Batch-planning researchers can explore signing or ordering tasks whose vectors represent normalized zero-sum resource changes.

Applicability and commercial boundary

The theorem is existential and uses the complete sequence; it supplies neither an online rule nor an efficient construction. Signed choices may be impossible in a physical workflow.

Initial business decision

Defer direct product. Commercial demand and profitability remain hypotheses.

Next verification action

Identify a restricted batch model with a constructible policy and test its maximum prefix imbalance.

Evidence scope

The catalog statement was individually reviewed. Main-paper and selected formal-scope passages were additionally inspected for families 090, 093, 094, 097, 325, 328 and 332; this record does not claim a full proof audit or independent Lean verification. Source revision fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb. See source metadata.