A combinatorial problem on polynomials and rational functions

DOI10.1006/JCTA.1999.2976zbMATH Open0953.05005OpenAlexW2045383484MaRDI QIDQ1971011FDOQ1971011

Lajos Rónyai, György Elekes

Publication date: 29 January 2001

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1999.2976

zbMATH Keywords

polynomialrational function

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10)

Cites Work

• Title not available (Why is that?)
• Repeated angles in the plane and related problems
• On linear combinatorics. I: Concurrency---an algebraic approach
• A combinatorial problem on polynomials
• Title not available (Why is that?)
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• On the Number of Incidences Between Points and Curves
• On Sets of Distances of n Points
• Title not available (Why is that?)
• A statistical theorem of set addition
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the combinatorics of projective mappings

Cited In (34)

• Title not available (Why is that?)
• Geometric and o-minimal Littlewood-Offord problems
• Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
• Subquadratic algorithms for algebraic 3SUM
• Distinct distances in \(\mathbf{R}^3\) between quadratic and orthogonal curves
• Sums, Products, and Dilates on Sparse Graphs
• A note on distinct distances
• The Elekes-Szabó theorem in four dimensions
• Expanding polynomials: a generalization of the Elekes-Rónyai theorem to \(d\) variables
• EXPANDING POLYNOMIALS ON SETS WITH FEW PRODUCTS
• The Elekes-Szabó problem and the uniformity conjecture
• Constructions for the Elekes-Szabó and Elekes-Rónyai problems
• Some combinatorial questions about polynomial mappings
• The number of unit-area triangles in the plane: theme and variation
• A successful concept for measuring non-planarity of graphs: The crossing number.
• Distinct distances on curves via rigidity
• Bisector energy and few distinct distances
• Distinct Distances on Algebraic Curves in the Plane
• Distinct Distances Between a Circle and a Generic Set
• Distinct distances between a collinear set and an arbitrary set of points
• Distinct distances between points and lines
• Improved Elekes-Szabó type estimates using proximity
• On triple lines and cubic curves: the orchard problem revisited
• Distinct Distances from Three Points
• On the dimension of exceptional parameters for nonlinear projections, and the discretized Elekes-Rónyai theorem
• New results for the growth of sets of real numbers
• On triple intersections of three families of unit circles
• The structure of sets with few sums along a graph
• Products of Differences over Arbitrary Finite Fields
• Few distinct distances implies no heavy lines or circles
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• How to find groups?
• Convexity, squeezing, and the Elekes-Szabó theorem
• A family of four-variable expanders with quadratic growth

   Recommendations

• Extensions of a result of Elekes and Rónyai 👍 👎
• A one-page solution of a problem of Erdős and Purdy 👍 👎
• A combinatorial problem on polynomials 👍 👎
• Distinct Distances on Algebraic Curves in the Plane 👍 👎
• Extremal problems in discrete geometry 👍 👎

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

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