Counting distinct functional graphs from linear finite dynamical systems

Let ${\mathbb{F}}_q$ be the finite field with $q$ elements and, for each positive integer $n$, let $A_q(n)$ be the number of non isomorphic functional graphs arising from ${\mathbb{F}}_q$-linear maps $T:\mathbb F_{q}^n\to \mathbb F_{q}^n$\mathrm{.}In2013,BachandBridyprovedthat,if$q$isfixedand$n$ is sufficiently large, the quantity $\frac{\log \log A_q(n)}{\log n}$ lies in the interval $[\frac{1}{2},1]$. By combining some ideas from linear algebra, combinatorics and number theory, in this paper we provide sharper estimates on the function $A_q(n)$ and, in particular, we prove that $\lim\limits_{n\to +\infty}\frac{\log\log A_q(n)}{\log n}=1$foreveryprimepower$q$.