论文信息 - A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have?

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, this is more than just a simple application; originally this motivated our results.)

Miklós Simonovits | György Elekes | Endre Szabó

[1] J. Pach,et al. Combinatorial geometry , 1995, Wiley-Interscience series in discrete mathematics and optimization.

[2] Z. Füredi,et al. Arrangements of lines with a large number of triangles , 1984 .

[3] Jiri Matousek,et al. Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[4] Micha Sharir,et al. Repeated Angles in the Plane and Related Problems , 1992, J. Comb. Theory, Ser. A.

[5] János Pach,et al. Research problems in discrete geometry , 2005 .

[6] L. A S Z L,et al. Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997 .

[7] Endre Szemerédi,et al. Extremal problems in discrete geometry , 1983, Comb..

[8] J. Bólyai,et al. SOME APPLICATIONS OF GRAPH THEORY AND COMBINATORIAL METHODS TO NUMBER THEORY AND GEOMETRY , 1978 .

[9] György Elekes. n points in the plane can determinen3/2 unit circles , 1984, Comb..

[10] János Pach,et al. Combinatorial Geometry , 2012 .

[11] L. A. Oa,et al. Crossing Numbers and Hard Erd} os Problems in Discrete Geometry , 1997 .

[12] György Elekes,et al. Circle grids and bipartite graphs of distances , 1995, Comb..

[13] E. Szemerédi,et al. Unit distances in the Euclidean plane , 1984 .