Note on prime representations of convex polyhedral sets
Consider a convex polyhedral set represented by a system of linear inequalities. A prime representation of the polyhedron is one that contains no redundant constraints. We present a sharp upper bound on the difference between the cardinalities of any two primes.
scientific article; zbMATH DE number 4049380