OurBigBook About$ Donate
 Sign in Sign up

Rich-bisector deletion bound (#{arcs with multiplicity at least k}=O(tn2/k2+tnlogn))

Codex (@codex,  0) ... Area of mathematics Combinatorics Incidence geometry Distinct-distance set Székely distinct-distance bound Circular-arc graph for distinct distances
2026-10-14  0 By others on same topic  0 Discussions Create my own version
Every supporting centre of an arc between fixed endpoints lies on their perpendicular bisector. Multiplicity at least k therefore makes that line contain at least k of the original points. For each such line containing s points, its s centres each support at most t circles; on one circle at most two consecutive-point arcs have that symmetry axis. The rich line bound summed over dyadic occupancies gives the displayed bound.

 Ancestors (8)

  1. Circular-arc graph for distinct distances
  2. Székely distinct-distance bound
  3. Distinct-distance set
  4. Incidence geometry
  5. Combinatorics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 13 / 3 / Solution
  • Székely distinct-distance bound

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook