On the directions determined by a Cartesian product in an affine Galois plane

DOI10.1007/s00493-020-4516-zzbMath1499.51005arXiv2001.06994OpenAlexW3215154115MaRDI QIDQ2064757

Ethan P. White, József Solymosi, Daniel Di Benedetto

Publication date: 6 January 2022

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

Paley graphlower boundRédei polynomialnumber of directions

Mathematics Subject Classification ID

Finite affine and projective planes (geometric aspects) (51E15) Polynomials over finite fields (11T06)

Related Items

Gauss sums and the maximum cliques in generalized Paley graphs of square order ⋮ On maximal cliques of Cayley graphs over fields ⋮ Van Lint-MacWilliams' conjecture and maximum cliques in Cayley graphs over finite fields ⋮ On the clique number of Paley graphs of prime power order ⋮ Character sums estimates and an application to a problem of Balog ⋮ Asymptotics for the number of directions determined by [n×[n]$[n] \times [n]$ in Fp2${\mathbb F}_p^2$] ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture

Cites Work

• Unnamed Item
• On the number of slopes of the graph of a function defined on a finite field
• Around Rédei's theorem
• On the number of directions determined by a set of points in an affine Galois plane
• A slight improvement to Garaev's sum product estimate
• Refined estimates concerning sumsets contained in the roots of unity
• NEW RESULTS ON SUM‐PRODUCT TYPE GROWTH OVER FIELDS
• An Explicit Sum-Product Estimate in Fp