Add to ORKGWe study functional graphs generated by several quadratic polynomials, acting simultaneously on a finite field. We obtain several results about the number of leaves in such graphs. In particular, in the case of graphs generated by three polynomials, we relate the distribution of leaves to the Sato-Tate distribution of Frobenius traces of elliptic curves. We also present extensive numerical results which we hope may shed some light on the distribution of leaves for larger families of polynomials.Comment: 29 page
Given a graph F, let st(F) be the number of subdivisions of F, each with a different vertex set, whi...
This article generalizes the geometric quadratic Chabauty method, initiated over $\mathbb{Q}$ by Edi...
We describe a characteristic-free algorithm for “reducing” an algebraic variety defined by the vanis...
Given a function f in a finite field Fq of q elements, we define the functional graph of f as a dire...
In this paper we study the description of the digraph associated with the power map over finite grou...
For a fixed q and any n ≥ 1, the number of F_{q^n} -points on a hyperelliptic curve over F_q of genu...
Let $f$ be a monic quadratic polynomial over a finite field of odd characteristic. In 2012, Boston a...
For this project, we explore nite eld dynamics and the various patterns of cycles of elements that e...
Motivated by the well-known Paley graphs over finite fields and their generalizations, in this paper...
Stanley and F\'eray gave a formula for the irreducible character of the symmetric group related to a...
Abstract. Let f be a function from a finite field Fp with a prime number p of elements, to Fp. In th...
Most of the constructions of pseudorandom graphs are based on additive or multiplicative groups of e...
Fekete polynomials associate with each prime number $p$ a polynomial with coefficients $-1$ or $1$ e...
Belk and Forrest construct a specific class of graph replacement systems that give sequences of grap...
Let $q$ be an odd power of a prime $p$, and $S \subset \mathbb{F}_q^*$ such that $S=-S$ and $S/S \ne...
Given a graph F, let st(F) be the number of subdivisions of F, each with a different vertex set, whi...
This article generalizes the geometric quadratic Chabauty method, initiated over $\mathbb{Q}$ by Edi...
We describe a characteristic-free algorithm for “reducing” an algebraic variety defined by the vanis...
Given a function f in a finite field Fq of q elements, we define the functional graph of f as a dire...
In this paper we study the description of the digraph associated with the power map over finite grou...
For a fixed q and any n ≥ 1, the number of F_{q^n} -points on a hyperelliptic curve over F_q of genu...
Let $f$ be a monic quadratic polynomial over a finite field of odd characteristic. In 2012, Boston a...
For this project, we explore nite eld dynamics and the various patterns of cycles of elements that e...
Motivated by the well-known Paley graphs over finite fields and their generalizations, in this paper...
Stanley and F\'eray gave a formula for the irreducible character of the symmetric group related to a...
Abstract. Let f be a function from a finite field Fp with a prime number p of elements, to Fp. In th...
Most of the constructions of pseudorandom graphs are based on additive or multiplicative groups of e...
Fekete polynomials associate with each prime number $p$ a polynomial with coefficients $-1$ or $1$ e...
Belk and Forrest construct a specific class of graph replacement systems that give sequences of grap...
Let $q$ be an odd power of a prime $p$, and $S \subset \mathbb{F}_q^*$ such that $S=-S$ and $S/S \ne...
Given a graph F, let st(F) be the number of subdivisions of F, each with a different vertex set, whi...
This article generalizes the geometric quadratic Chabauty method, initiated over $\mathbb{Q}$ by Edi...
We describe a characteristic-free algorithm for “reducing” an algebraic variety defined by the vanis...