Sums, Products, and Dilates on Sparse Graphs

DOI10.1137/20M1372184zbMath1464.52010arXiv2010.02050OpenAlexW3130004570MaRDI QIDQ5854454

Oliver Roche-Newton

Publication date: 17 March 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.02050

zbMATH Keywords

sparse graphssum-productsElekes-Szabó

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Related Items (2)

Improved Elekes-Szabó type estimates using proximity ⋮ Convexity, squeezing, and the Elekes-Szabó theorem

Cites Work

• Polynomials vanishing on Cartesian products: the Elekes-Szabó theorem revisited
• On problems of Erdős and Rudin.
• Sums and products along sparse graphs
• A combinatorial problem on polynomials and rational functions
• How to find groups?
• Sums, products, and ratios along the edges of a graph
• Constructions for the Elekes-Szabó and Elekes-Rónyai problems
• A survey of Elekes-Rónyai-type problems
• Polynomials vanishing on grids: The Elekes-Rónyai problem revisited
• On the number of sums and products

This page was built for publication: Sums, Products, and Dilates on Sparse Graphs