Aggregating assignment constraints

This article shows how simple systems of linear equations with {0,1} variables can be aggregated into a single linear equation whose {0,1} solutions are identical to the solutions of the original system. Structures of the original systems are exploited to keep the aggregator's integer coefficients from becoming unnecessarily large. The results have potential application in integer programming and information theory, especially for problems that contain assignment-type constraints along with other constraints. Several unresolved questions of a number-theoretic nature are mentioned at the conclusion of the article.