Abstract
We examine iteration graphs of the squaring function on the rings ℤ/nℤ when n = 2kp, for p a Fermat prime. We describe several invariants associated to these graphs and use them to prove that the graphs are not symmetric when k = 3 and when k ⩾ 5 and are symmetric when k = 4.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Earle L. Blanton, Jr., Spencer P. Hurd and Judson S. McCranie: On a digraph defined by squaring modulo n. Fibonacci Quart. 30 (1992), 322–334.
Guy Chassé: Combinatorial cycles of a polynomial map over a commutative field. Discrete Math. 61 (1986), 21–26.
John Ellson, Emden Gansner, Lefteris Koutsofios, Stephen C. North and Gordon Woodhull: Graphviz-open source graph drawing tools. Graph drawing (Petra Mutzel, Michael Jünger, and Sebastian Leipert, eds.), Lecture Notes in Computer Science, vol. 2265, Springer-Verlag, Berlin, 2002, Selected papers from the 9th International Symposium (GD 2001) held in Vienna, September 23–26, 2001, pp. 483–484. (In English.)
The GAP Group, Gap-groups, algorithms, and programming, version 4.4, 2005, (http://www.gap-system.org).
Thomas D. Rogers: The graph of the square mapping on the prime fields. Discrete Math. 148 (1996), 317–324.
Lawrence Somer and Michal Křížek: On a connection of number theory with graph theory. Czechoslovak Math. J. 54 (2004), 465–485.
L. Szalay: A discrete iteration in number theory. BDTF Tud. Közl. 8 (1992), 71–91.
Troy Vasiga and Jeffrey Shallit: On the iteration of certain quadratic maps over GF(p). Discrete Math. 277 (2004), 219–240.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Carlip, W., Mincheva, M. Symmetry of iteration graphs. Czech Math J 58, 131–145 (2008). https://doi.org/10.1007/s10587-008-0009-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10587-008-0009-8