A combinatorial problem on polynomials

DOI10.1007/PL00009355zbMath0929.05082OpenAlexW2076845823MaRDI QIDQ1387848

György Elekes

Publication date: 25 January 2000

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009355

zbMATH Keywords

polynomialsarithmetic progressioncombinatorial geometrygeometric progression

Mathematics Subject Classification ID

Extremal set theory (05D05) Curves in algebraic geometry (14H99)

Related Items (4)

The Szemerédi-Trotter theorem in the complex plane ⋮ The structure of sets with few sums along a graph ⋮ A combinatorial problem on polynomials and rational functions ⋮ Products of Differences over Arbitrary Finite Fields

This page was built for publication: A combinatorial problem on polynomials