A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have?

We give a very general sufficient condition for a one-parameter family of curves not to have n members with ‘too many’ (i.e., a near-quadratic number of) triple points of intersections. As a special case, a combinatorial distinction between straight lines and unit circles will be shown. (Actually, t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Combinatorics, probability & computing probability & computing, 2009-09, Vol.18 (5), p.691-705
Hauptverfasser: ELEKES, GYÖRGY, SIMONOVITS, MIKLÓS, SZABÓ, ENDRE
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We give a very general sufficient condition for a one-parameter family of curves not to have n members with ‘too many’ (i.e., a near-quadratic number of) triple points of intersections. As a special case, a combinatorial distinction between straight lines and unit circles will be shown. (Actually, this is more than just a simple application; originally this motivated our results.)
ISSN:0963-5483
1469-2163
DOI:10.1017/S0963548309990265