Graphons arising from graphs definable over finite fields
Logic
2022-01-04 v4 Combinatorics
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.
Keywords
Cite
@article{arxiv.1707.06296,
title = {Graphons arising from graphs definable over finite fields},
author = {Mirna Džamonja and Ivan Tomašić},
journal= {arXiv preprint arXiv:1707.06296},
year = {2022}
}
Comments
This is the final accepted version of the paper, which is to appear in Colloquium Mathematicum