A combinatorial problem on polynomials

DOI10.1007/PL00009355MaRDI QIDQ1387848zbMATH OpenOpenAlexFDO

Authors 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 geometrygeometric progressionpolynomials

Mathematics Subject Classification ID

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

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.
• Algebraic methods in sum-product phenomena

Cited in

(8)

• Some combinatorial questions about polynomial mappings
• A combinatorial problem on polynomials and rational functions
• The Szemerédi-Trotter theorem in the complex plane
• Restricted sums in a field
• scientific article; zbMATH DE number 16456 (Why is no real title available?)
• Products of differences over arbitrary finite fields
• An Extension of the Perplexing Polynomial Puzzle
• The structure of sets with few sums along a graph

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)