Counting distinct functional graphs from linear finite dynamical systems

TL;DR

This paper refines the understanding of the growth rate of the number of non-isomorphic functional graphs from linear finite dynamical systems over finite fields, showing it grows faster than previously established.

Contribution

It provides sharper estimates and proves that the ratio of log-log of the count to log of n approaches 1 as n increases for all prime powers q.

Findings

The ratio lim_{n→∞} (log log A_q(n)) / log n equals 1.

Improved bounds on the growth rate of A_q(n).

Confirmation that the growth rate approaches the upper bound for all q.

Abstract

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$. In 2013, Bach and Bridy proved that, if $q$ is fixed and $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$ for every prime power $q$.