ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a finite collection of lattice vectors spanning Rd\mathbb{R}^d be cosimple if it has a linear dependence whose coefficients are all non-zero and have pairwise different absolute values. A lattice zonotope generated by a cosimple collection is a cosimple zonotope. Cosimple zonotope covering-radius conjecture. Every cosimple zonotope with generators in Zd\mathbb{Z}^d has covering radius at most

dd+2.\frac{d}{d+2}.

This conjecture generalizes the shifted Lonely Runner Conjecture because every Strong Lonely Runner Zonotope with nn generators is a cosimple (n−1)(n-1)-zonotope. The paper introduces it to address the fact that projections of Strong Lonely Runner Zonotopes need not remain Strong Lonely Runner Zonotopes; its general status is open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.