On functional graphs of quadratic polynomials
From MaRDI portal
Publication:5228846
Abstract: We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These include: the number of connected functional graphs, the number of graphs having a maximal cycle, the number of cycles of fixed size, the number of components of fixed size, as well as the shape of trees extracted from functional graphs. We particularly focus on connected functional graphs, that is, the graphs which contain only one component (and thus only one cycle). Based on the results of our computations, we formulate several conjectures highlighting the similarities and differences between these functional graphs and random mappings.
Recommendations
- Functional graphs of polynomials over finite fields
- A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields
- GRAPH COMPONENTS AND DYNAMICS OVER FINITE FIELDS
- Grasping the connectivity of random functional graphs
- The graph structure of Chebyshev polynomials over finite fields and applications
Cites work
- scientific article; zbMATH DE number 16479 (Why is no real title available?)
- scientific article; zbMATH DE number 2081139 (Why is no real title available?)
- scientific article; zbMATH DE number 862977 (Why is no real title available?)
- A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields
- Bifurcations and discriminants for polynomial maps
- Corrigendum: ``On certain algebraic curves related to polynomial maps
- Counting dynamical systems over finite fields
- Dynamically distinguishing polynomials
- Function digraphs of quadratic maps modulo \(p\)
- Functional graphs of polynomials over finite fields
- GRAPH COMPONENTS AND DYNAMICS OVER FINITE FIELDS
- Irreducibility of polynomials modulo \(p\) via Newton polytopes.
- On the heuristic of approximating polynomials over finite fields by random mappings
- On the iteration of certain quadratic maps over GF(\(p\)).
- On the reduction modulo p of an absolutely irreducible polynomial f(x,y)
- Periods of iterated rational functions
- Periods of rational maps modulo primes
- Reduzibilität ebener Kurven.
- The Galois Theory of Periodic Points of Polynomial Maps
- The arithmetic of dynamical systems
- The average height of binary trees and other simple trees
Cited in
(12)- scientific article; zbMATH DE number 1643954 (Why is no real title available?)
- Connected components of the graph generated by power maps in prime finite fields
- Iteration entropy
- Functional graphs of families of quadratic polynomials
- On the equational graphs over finite fields
- scientific article; zbMATH DE number 1466268 (Why is no real title available?)
- Functional graphs of polynomials over finite fields
- A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields
- Pluripolarity of graphs of quasianalytic functions of several variables in the sense of Gonchar
- Dynamics of polynomial maps over finite fields
- Preperiodic points for quadratic polynomials over cyclotomic quadratic fields
- Grasping the connectivity of random functional graphs
This page was built for publication: On functional graphs of quadratic polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5228846)
