A combinatorial distinction between unit circles and straight lines: How many coincidences can they have?

György Elekes, M. Simonovits, Endre Szabó

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

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.)

Original languageEnglish
Pages (from-to)691-705
Number of pages15
JournalCombinatorics Probability and Computing
Volume18
Issue number5
DOIs
Publication statusPublished - Sep 2009

Fingerprint

Triple Point
Coincidence
Unit circle
Straight Line
Intersection
Curve
Sufficient Conditions
Family

ASJC Scopus subject areas

  • Applied Mathematics
  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Statistics and Probability

Cite this

A combinatorial distinction between unit circles and straight lines : How many coincidences can they have? / Elekes, György; Simonovits, M.; Szabó, Endre.

In: Combinatorics Probability and Computing, Vol. 18, No. 5, 09.2009, p. 691-705.

Research output: Contribution to journalArticle

@article{8e4a694644b044aa99916a7fb518acd0,
title = "A combinatorial distinction between unit circles and straight lines: How many coincidences can they have?",
abstract = "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.)",
author = "Gy{\"o}rgy Elekes and M. Simonovits and Endre Szab{\'o}",
year = "2009",
month = "9",
doi = "10.1017/S0963548309990265",
language = "English",
volume = "18",
pages = "691--705",
journal = "Combinatorics Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "5",

}

TY - JOUR

T1 - A combinatorial distinction between unit circles and straight lines

T2 - How many coincidences can they have?

AU - Elekes, György

AU - Simonovits, M.

AU - Szabó, Endre

PY - 2009/9

Y1 - 2009/9

N2 - 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.)

AB - 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.)

UR - http://www.scopus.com/inward/record.url?scp=74149087190&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=74149087190&partnerID=8YFLogxK

U2 - 10.1017/S0963548309990265

DO - 10.1017/S0963548309990265

M3 - Article

AN - SCOPUS:74149087190

VL - 18

SP - 691

EP - 705

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

SN - 0963-5483

IS - 5

ER -