A combinatorial problem on polynomials and rational functions
From MaRDI portal
Publication:1971011
DOI10.1006/jcta.1999.2976zbMath0953.05005OpenAlexW2045383484MaRDI QIDQ1971011
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
Related Items (30)
The Elekes-Szabó theorem in four dimensions ⋮ The Elekes-Szabó problem and the uniformity conjecture ⋮ Bisector energy and few distinct distances ⋮ The structure of sets with few sums along a graph ⋮ Distinct Distances Between a Circle and a Generic Set ⋮ Expanding polynomials: a generalization of the Elekes-Rónyai theorem to \(d\) variables ⋮ Distinct distances between a collinear set and an arbitrary set of points ⋮ Subquadratic algorithms for algebraic 3SUM ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ A family of four-variable expanders with quadratic growth ⋮ Improved Elekes-Szabó type estimates using proximity ⋮ Convexity, squeezing, and the Elekes-Szabó theorem ⋮ EXPANDING POLYNOMIALS ON SETS WITH FEW PRODUCTS ⋮ On the dimension of exceptional parameters for nonlinear projections, and the discretized Elekes-Rónyai theorem ⋮ Few distinct distances implies no heavy lines or circles ⋮ Distinct distances between points and lines ⋮ New results for the growth of sets of real numbers ⋮ On triple intersections of three families of unit circles ⋮ Distinct Distances from Three Points ⋮ Distinct Distances on Algebraic Curves in the Plane ⋮ A successful concept for measuring non-planarity of graphs: The crossing number. ⋮ Distinct distances on curves via rigidity ⋮ How to find groups? ⋮ The number of unit-area triangles in the plane: theme and variation ⋮ Constructions for the Elekes-Szabó and Elekes-Rónyai problems ⋮ A note on distinct distances ⋮ Products of Differences over Arbitrary Finite Fields ⋮ Sums, Products, and Dilates on Sparse Graphs ⋮ Geometric and o-minimal Littlewood-Offord problems ⋮ Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
Cites Work
- Repeated angles in the plane and related problems
- On linear combinatorics. I: Concurrency---an algebraic approach
- A statistical theorem of set addition
- A combinatorial problem on polynomials
- On the combinatorics of projective mappings
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A combinatorial problem on polynomials and rational functions
