Conjecture on dimension two for open convex codes
Conjecture on dimension two for open convex codes
Let be a convex open code, meaning a code realizable by open convex sets. Its minimal convex embedding dimension is the smallest dimension in which it is realizable by convex sets, and its minimal open convex embedding dimension is the smallest dimension in which it is realizable by open convex sets.
Dimension-two embedding conjecture. If has minimal open convex embedding dimension , then its minimal convex embedding dimension is .
This is stated as equivalent to the dimension-one conjecture above. It would show that, for open convex codes whose least open realization dimension is two, allowing non-open convex realizations does not reduce the dimension.
Sources & referencesView supporting material
Primary source
Megan K. Franke and Samuel Muthiah, “Every Binary Code Can Be Realized by Convex Sets”, arXiv:1711.03185 (2018).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.