Jones, Gareth A. (2021) Infinite Paley graphs. Art of Discrete and Applied Mathematics, 4 (2), 1-10. (doi:10.26493/2590-9770.1365.884).
Record type:
Article
Abstract
Infinite analogues of the Paley graphs are constructed, based on uncountably many locally finite fields. By using character sum estimates due to Weil, they are shown to be isomorphic to the countable random graph of Erdős, Rényi and Rado.
Text
Infinite Paley graphs
- Accepted Manuscript
Available under License University of Southampton Accepted Manuscript Licence.
Download (142kB)
More information
Accepted/In Press date: 8 June 2020
Published date: 10 March 2021
Additional Information:
Publisher Copyright:
© 2021 University of Primorska. All Rights Reserved.
Keywords:
Character sum, Paley graph, Quadratic residue, Random graph, Universal graph
Identifiers
Local EPrints ID: 469831
URI: http://eprints.soton.ac.uk/id/eprint/469831
PURE UUID: 2e0e8120-fbf7-40fd-91f9-54ba7dc673b0
Catalogue record
Date deposited: 27 Sep 2022 16:33
Last modified: 16 Mar 2024 21:58
Export record
Altmetrics
Contributors
Author:
Gareth A. Jones
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.