Elisa Bellah, Derek Garton, Erin Tannenbaum and Noah
Walton
Vol. 11 (2018), No. 1, 169–179
DOI: 10.2140/involve.2018.11.169
Abstract
Flynn and Garton (2014) bounded the average number of components of the
functional graphs of polynomials of fixed degree over a finite field. When the fixed
degree was large (relative to the size of the finite field), their lower bound matched
Kruskal’s asymptotic for random functional graphs. However, when the fixed degree
was small, they were unable to match Kruskal’s bound, since they could not
(Lagrange) interpolate cycles in functional graphs of length greater than the fixed
degree. In our work, we introduce a heuristic for approximating the average number
of such cycles of any length. This heuristic is, roughly, that for sets of edges in a
functional graph, the quality of being a cycle and the quality of being interpolable
are “uncorrelated enough”. We prove that this heuristic implies that the
average number of components of the functional graphs of polynomials of fixed
degree over a finite field is within a bounded constant of Kruskal’s bound. We
also analyze some numerical data comparing implications of this heuristic
to some component counts of functional graphs of polynomials over finite
fields.