# A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields

@article{Bellah2016APH, title={A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields}, author={Elisa Bellah and D. Garton and Erin Tannenbaum and N. Walton}, journal={arXiv: Dynamical Systems}, year={2016} }

In 2014, Flynn and the second author bounded the average number of components of the functional graphs of polynomials of fixed degree over a finite field. When the fixed degree was large (relative to the size of the finite field), their lower bound matched Kruskal's asymptotic for random functional graphs. However, when the fixed degree was small, they were unable to match Krusal's bound, since they could not (Lagrange) interpolate cycles in functional graphs of length greater than the fixed… Expand

#### 5 Citations

On Functional Graphs of Quadratic Polynomials

- Mathematics, Computer Science
- Exp. Math.
- 2019

This work introduces efficient algorithms for methodical computations and provides the values of various direct and cumulative statistical parameters of interest, particularly on connected functional graphs generated by quadratic polynomials over prime fields. Expand

Periodic points of polynomials over finite fields

- Mathematics
- 2021

Fix an odd prime p. If r is a positive integer and f polynomial with coefficients in Fpr , let Pp,r(f) be the proportion of P 1 (Fpr) that is periodic with respect to f . We show that as r increases,… Expand

The cycle structure of unicritical polynomials

- Mathematics
- 2018

A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field… Expand

Dynamically distinguishing polynomials

- Mathematics
- 2016

A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: For any prime p, reduce its coefficients mod p and consider its action on the field… Expand

Current Trends and Open Problems in Arithmetic Dynamics

- Mathematics
- 2018

Arithmetic dynamics is the study of number theoretic properties of dynamical systems. A relatively new field, it draws inspiration partly from dynamical analogues of theorems and conjectures in… Expand

#### References

SHOWING 1-10 OF 15 REFERENCES

Random Mapping Statistics

- Mathematics, Computer Science
- EUROCRYPT
- 1989

A general framework in which the analysis of about twenty characteristic parameters of random mappings is carried out is introduced, and an open problem of Knuth is solved, namely that of finding the expected diameter of a random mapping. Expand

Periods of Iterated Rational Functions over a Finite Field

- Mathematics
- 2015

If f is a polynomial of degree d in 𝔽q[x], let ck(f) be the number of cycles of length k in the directed graph on 𝔽q with edges {(v,f(v))}v∈𝔽q. For random polynomials, the numbers ck, 1 ≤ k ≤ b,… Expand

On the cycle structure of repeated exponentiation modulo a prime

- Mathematics
- 2004

Abstract In a recent work, Shallit and Vasiga have obtained several results about tails and cycles in orbits of repeated squaring. Some of these results have been based on the Extended Riemann… Expand

The graph of the square mapping on the prime fields

- Computer Science, Mathematics
- Discret. Math.
- 1996

The number of components c ( p ) (called the connectivity of the prime p ) is shown to take on certain values, assuming various hypotheses, and a formula is given for the decomposition of the graph into cyclic components and their attached trees. Expand

GRAPH COMPONENTS AND DYNAMICS OVER FINITE FIELDS

- Mathematics
- 2014

For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of components of their functional graphs as well as the average number of periodic points of… Expand

Toward A Theory of Pollard's Rho Method

- Computer Science, Mathematics
- Inf. Comput.
- 1991

This paper shows that for fixed k, this probability of success is at least ( 2 k ) p + O(p −3 2 ) as p → ∞, which leads to an Ω( log 2 p) p estimate of the success probability. Expand

Symmetry of iteration graphs

- Mathematics
- 2008

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… Expand

On the iteration of certain quadratic maps over GF(p)

- Computer Science, Mathematics
- Discret. Math.
- 2004

We consider the properties of certain graphs based on iteration of the quadratic maps x->x^2 and x->x^2-2 over a finite field GF(p).

A monte carlo method for factorization

- Mathematics
- 1975

We describe briefly a novel factorization method involving probabilistic ideas.

Random mapping statistics, Advances in cryptology

- (Houthalen,
- 1989