I don't have an idea how to prove, that between any n points on the plane, there are not more than $O(n^\frac{3}{2})$ pairs with distance of 1 unit between each other... Thanks a lot for any help!
2026-04-01 08:04:13.1775030653
Pairs of points exactly 1 unit apart in the plane
404 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in PLANE-GEOMETRY
- Euclidean Fifth Postulate
- Line coordinates from plane intersection
- Properties of a eclipse on a rotated plane to see a perfect circle from the original plane view?
- Perfect Pascal Mysticum Points
- Intersection of a facet and a plane
- Proving formula to find area of triangle in coordinate geometry.
- Prove that the intersection of a cylinder and a plane forms an ellipse
- Rank of Matrix , Intersection of 3 planes
- Composite of two rotations with different centers
- Can a plane be perpendicular in two other planes if those planes are not parallel to each other?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Weaker result :
Take a graph whose vertices are your $n$ points. We say that there is an edge joining two vertices iff the corresponding points are at distance $1$.
Then it is easy to prove that in the plane there cannot be $4$ points such that the distance between every pair of them is $1$.
Hence your graph is $K_4$ free, and you can use Turan's theorem (see Turan Theorem) : the number of edges is at most $\frac{1}{3}n^2$
After some researchs, the references $[48]$ and $[49]$ in this article (Distinct distances in graph drawings) should be useful : the bound they proved is proportional to $n^{\frac{4}{3}}$.