The Number of Halving Circles

DOI10.2307/4145159MaRDI QIDQ3563742zbMATH OpenOpenAlexFDO

Authors Federico Ardila

Publication date 1 June 2010

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0408354

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Abstract: A set S of 2n+1 points in the plane is said to be in general position if no three points of S are collinear and no four are concyclic. A circle is called halving with respect to S if it has three points of S on its circumference, n-1 points in its interior, and n-1 in its exterior. We prove the following surprising result: any set of 2n+1 points in general position in the plane has exactly n^2 halving circles.

Cited in

(3)

• Algebraic \(k\)-sets and generally neighborly embeddings
• Median spheres: Theory, algorithms, applications
• On circles enclosing many points

This page was built for publication: The Number of Halving Circles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563742)