%0 Journal Article
%T Functional Graphs of Polynomials over Finite Fields
%A Sergei V. Konyagin
%A Florian Luca
%A Bernard Mans
%A Luke Mathieson
%A Min Sha
%A Igor E. Shparlinski
%J Computer Science
%D 2013
%I arXiv
%X Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if $f(u) = v$. We obtain some theoretic estimates on the number of non-isomorphic graphs generated by all polynomials of a given degree. We then develop a simple and practical algorithm to test the isomorphism of quadratic polynomials that has linear memory and time complexities. Furthermore, we extend this isomorphism testing algorithm to the general case of functional graphs, and prove that, while its time complexity increases only slightly, its memory complexity remains linear. We exploit this algorithm to provide an upper bound on the number of functional graphs corresponding to polynomials of degree $d$ over ${\mathbb F}_q$. Finally, we present some numerical results and compare function graphs of quadratic polynomials with those generated by random maps and pose interesting new problems.
%U http://arxiv.org/abs/1307.2718v3