A combinatorial problem on polynomials

DOI10.1007/PL00009355zbMATH Open0929.05082OpenAlexW2076845823MaRDI QIDQ1387848FDOQ1387848

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

arithmetic progressioncombinatorial geometrypolynomialsgeometric progression

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• Some combinatorial questions about polynomial mappings
• The Szemerédi-Trotter theorem in the complex plane
• Restricted sums in a field
• The structure of sets with few sums along a graph
• Products of Differences over Arbitrary Finite Fields
• A combinatorial problem on polynomials and rational functions
• An Extension of the Perplexing Polynomial Puzzle

   Recommendations

• EXPANDING POLYNOMIALS ON SETS WITH FEW PRODUCTS 👍 👎
• Sums of subsets with polynomial restrictions. 👍 👎
• New results on the Erdős-Szemerédi sum-product problems. 👍 👎
• Polynomials vanishing on grids: the Elekes-Rónyai problem revisited 👍 👎
• Algebraic methods in sum-product phenomena 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1387848)