论文信息 - A Combinatorial Problem on Polynomials and Rational Functions

A Combinatorial Problem on Polynomials and Rational Functions

The structure of rational functions of two real variables which take few distinct values on large (finite) Cartesian products is described. As an application, a problem of G. Purdy is solved on finite subsets of the plane which determine few distinct distances.

Lajos Rónyai | György Elekes | L. Rónyai | G. Elekes

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

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

[3] Micha Sharir,et al. On the Number of Incidences Between Points and Curves , 1998, Combinatorics, Probability and Computing.

[4] P. Erdös. On Sets of Distances of n Points , 1946 .

[5] György Elekes,et al. On linear combinatorics I. Concurrency—An algebraic approach , 1997, Comb..

[6] Andrzej Schinzel,et al. Selected topics on polynomials , 1982 .

[7] Julio R. Bastida. Field Extensions and Galois Theory , 1984 .

[8] Endre Szemerédi,et al. A statistical theorem of set addition , 1994, Comb..

[9] László A. Székely,et al. Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997, Combinatorics, Probability and Computing.

[10] György Elekes,et al. A Combinatorial Problem on Polynomials , 1998, Discret. Comput. Geom..

[11] W. Fulton. Algebraic curves , 1969 .