2000 character limit reached
Infinite Paley graphs
Published 5 Dec 2019 in math.CO | (1912.02709v1)
Abstract: Infinite analogues of the Paley graphs are constructed, based on uncountably many infinite but locally finite fields. Weil's estimate for character sums shows that they are all isomorphic to the random or universal graph of Erd\H os, R\'enyi and Rado. Automorphism groups and connections with model theory are considered.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.