A digestion of unit distance constructions

·Terry Tao··

Suppose that one has a set of points in the plane, which we will think of as the complex plane . Let denote the number of unit distances determined by these points, i.e., pairs of points whose displacement obeys the equation (It makes little difference for the asymptotics, but we will count the pair separately from here.) The Erdös unit distance problem asks, for a given large number , what is the largest possible value of amongst all sets of cardinality ? For instance, if one takes to be equall...

Read full article →

Related Articles

The gauge broke: devs felt 20% faster with AI, measured 19% slower
intrepidkarthi · Hacker News · 1d ago
US–Indian space mission maps extreme subsidence in Mexico City
leopoldj · Hacker News · 2mo ago
Why are neural networks and cryptographic ciphers so similar? (2025)
jxmorris12 · Hacker News · 2mo ago
Fun with polynomials and linear algebra; or, slight abstract nonsense
LolWolf · Hacker News · 2mo ago
The Mathematical Dance Inside Plant Cells
isaacfrond · Hacker News · 1mo ago