The divisibility embedding conjecture
Let be a set of points such that the distances between any two points of are integer and divisible by a number . In this setting, is congruent to a set after scaling by if there is a set such that is congruent to .
Divisibility embedding conjecture. There is a set such that is congruent to .
The paper states that this formulation is equivalent to the integer-distances to integer-coordinates embedding conjecture. No resolution is supplied.
References
Primary source
Jan Fricke, “On Heron Simplices and Integer Embedding”, arXiv:math/0112239 (2001).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.