Counterintuitive patterns on angles and distances between lattice points in high dimensional hypercubes

Abstract

Let S be a finite set of integer points in Rd, which we assume has many symmetries, and let P∈Rd be a fixed point. We calculate the distances from P to the points in S and compare the results. In some of the most common cases, we find that they lead to unexpected conclusions if the dimension is sufficiently large. For example, if S is the set of vertices of a hypercube in Rd and P is any point inside, then almost all triangles PAB with A,B∈S are almost equilateral. Or, if P is close to the center of the cube, then almost all triangles PAB with A∈ S and B anywhere in the hypercube are almost right triangles.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…