Counting distinct functional graphs from linear finite dynamical systems

DOI10.1016/J.LAA.2022.10.011MaRDI QIDQ6368130arXivFDO

Authors Lucas Reis

Publication date 20 May 2021

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.LAA.2022.10.011

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Canonical forms, reductions, classification (15A21) Universality and renormalization of dynamical systems (37E20) Dynamical systems involving maps of trees and graphs (37E25) Dynamical systems over finite ground fields (37P25)

arXiv classification

math.COmath.NT

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}omathbb{F}_q^n$. In 2013, Bach and Bridy proved that, if $q$ is fixed and $n$ is sufficiently large, the quantity $fracloglog{A}_q(n)logn$ lies in the interval $[frac12,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 $limlimit{s}_{no+infty}fracloglog{A}_q(n)logn=1$ for every prime power $q$.

This page was built for publication: Counting distinct functional graphs from linear finite dynamical systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6368130)