Graphons arising from graphs definable over finite fields
Mirna D\v{z}amonja, Ivan Toma\v{s}i\'c

TL;DR
This paper extends Tao's algebraic regularity lemma to asymptotic classes and applies it to analyze expander difference polynomials over finite fields with Frobenius powers.
Contribution
It introduces a version of the algebraic regularity lemma for asymptotic classes and explores its application to graphons derived from finite field graphs.
Findings
Established a regularity lemma for asymptotic classes
Analyzed expander difference polynomials over finite fields
Connected graphons to algebraic structures in finite fields
Abstract
We prove a version of Tao's algebraic regularity lemma for asymptotic classes in the context of graphons. We apply it to study expander difference polynomials over fields with powers of Frobenius.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Advanced Topology and Set Theory · Limits and Structures in Graph Theory
