# Breaking the 3/2 barrier for unit distances in three dimensions

## TL;DR

This paper improves the upper bound on the number of unit distances among n points in three-dimensional space from O(n^{3/2}) to approximately O(n^{1.5025+ε}), using novel geometric techniques.

## Contribution

It introduces a new method for cutting circles into pseudo-segments in three dimensions, leading to a tighter bound on unit distances.

## Key findings

- Bound on unit distances improved to O(n^{295/197+ε})
- New technique for circle cutting in 3D
- Advances understanding of geometric configurations in 3D

## Abstract

We prove that every set of $n$ points in $\mathbb{R}^3$ spans $O(n^{295/197+\epsilon})$ unit distances. This is an improvement over the previous bound of $O(n^{3/2})$. A key ingredient in the proof is a new result for cutting circles in $\mathbb{R}^3$ into pseudo-segments.