𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Combinatorial Problem on Polynomials

✍ Scribed by G. Elekes


Publisher
Springer
Year
1998
Tongue
English
Weight
71 KB
Volume
19
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A Combinatorial Problem on Polynomials a
✍ GyΓΆrgy Elekes; Lajos RΓ³nyai πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 190 KB

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.

On a combinatorial problem. II
✍ P. ErdΕ‘s πŸ“‚ Article πŸ“… 1964 πŸ› Akadmiai Kiad 🌐 English βš– 133 KB
A combinatorial problem
✍ J. A. Thas πŸ“‚ Article πŸ“… 1973 πŸ› Springer 🌐 English βš– 177 KB
On a problem in combinatorial geometry
✍ VojtΔ›ch RΓΆdl πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 253 KB

Let us fix a number a, O< a < 2. We join two p0int.s on the unit sphere Sm in the real m-space iff their distance is a. Denote the obtained graph by g,,,. We prove that the chromatic number x(9@,,,) tends to infinity when m --+ a. This gives a positive answer to a question of P. Erdiis.

On problem-specific polynomials
✍ D. Ramkrishna πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 331 KB